The article describes a certain computation method of -arcs to construct the number of distinct -arcs in for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each construction especially for large value of and then reduce the running time of the calculation. Therefore, it allows to decrease the memory storage for the calculation processes. This method’s effectiveness evaluation is confirmed by the results of the calculation where a largest size of complete -arc is constructed. This research’s calculation results develop the strategy of the computational approaches to investigate big sizes of arcs in where it put more attention to the study of the number of the inequivalent classes of -secants of -arcs in which is an interesting aspect. Consequently, it can be used to establish a large value of .
Image steganography is undoubtedly significant in the field of secure multimedia communication. The undetectability and high payload capacity are two of the important characteristics of any form of steganography. In this paper, the level of image security is improved by combining the steganography and cryptography techniques in order to produce the secured image. The proposed method depends on using LSBs as an indicator for hiding encrypted bits in dual tree complex wavelet coefficient DT-CWT. The cover image is divided into non overlapping blocks of size (3*3). After that, a Key is produced by extracting the center pixel (pc) from each block to encrypt each character in the secret text. The cover image is converted using DT-CWT, then the p
... Show MoreThe main purpose of this paper is to study some results concerning reduced ring with another concepts as semiprime ring ,prime ring,essential ideal ,derivations and homomorphism ,we give some results a bout that.
The present work describes numerical and experimental investigation of the heat transfer characteristics in a plate-fin, having built-in piezoelectric actuator mounted on the base plate (substrate). The geometrical configuration considered in the present work is representative of a single element of the plate-fin and triple fins. Air is taken as the working fluid. A performance data for a single rectangular fin and triple fins are provided for different frequency levels (5, 30 and
50HZ) , different input power (5,10,20,30,40 and 50W) and different inlet velocity (0.5, 1, 2, 3, 4, 5 and 6m/s) for the single rectangular fin and triple fins with and without oscillation. The investigation was also performed with different geometrical fin
This research is devoted to study the strengthening technique for the existing reinforced concrete beams using external post-tensioning. An analytical methodology is proposed to predict the value of the effective prestress force for the external tendons required to close cracks in existing beams. The external prestressing force required to close cracks in existing members is only a part from the total strengthening force.
A computer program created by Oukaili (1997) and developed by Alhawwassi (2008) to evaluate curvature and deflection for reinforced concrete beams or internally prestressed concrete beams is modified to evaluate the deflection and the stress of the external tendons for the externally strengthened beams using Matlab
This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.
In this paper, we introduce and study the concept of S-coprime submodules, where a proper submodule N of an R-module M is called S-coprime submodule if M N is S-coprime Rmodule. Many properties about this concept are investigated.
Let L be a commutative ring with identity and let W be a unitary left L- module. A submodule D of an L- module W is called s- closed submodule denoted by D ≤sc W, if D has no proper s- essential extension in W, that is , whenever D ≤ W such that D ≤se H≤ W, then D = H. In this paper, we study modules which satisfies the ascending chain conditions (ACC) and descending chain conditions (DCC) on this kind of submodules.
Let R be a commutative ring with identity 1 and M be a unitary left R-module. A submodule N of an R-module M is said to be approximately pure submodule of an R-module, if for each ideal I of R. The main purpose of this paper is to study the properties of the following concepts: approximately pure essentialsubmodules, approximately pure closedsubmodules and relative approximately pure complement submodules. We prove that: when an R-module M is an approximately purely extending modules and N be Ap-puresubmodulein M, if M has the Ap-pure intersection property then N is Ap purely extending.
Data security is a significant requirement in our time. As a result of the rapid development of unsecured computer networks, the personal data should be protected from unauthorized persons and as a result of exposure AES algorithm is subjected to theoretical attacks such as linear attacks, differential attacks, and practical attacks such as brute force attack these types of attacks are mainly directed at the S-BOX and since the S-BOX table in the algorithm is static and no dynamic so this is a major weakness for the S-BOX table, the algorithm should be improved to be impervious to future dialects that attempt to analyse and break the algorithm in order to remove these weakness points, Will be generated dynamic substitution box (S-B
... Show MoreThe global food supply heavily depends on utilizing fertilizers to meet production goals. The adverse impacts of traditional fertilization practices on the environment have necessitated the exploration of new alternatives in the form of smart fertilizer technologies (SFTs). This review seeks to categorize SFTs, which are slow and controlled-release Fertilizers (SCRFs), nano fertilizers, and biological fertilizers, and describes their operational principles. It examines the environmental implications of conventional fertilizers and outlines the attributes of SFTs that effectively address these concerns. The findings demonstrate a pronounced environmental advantage of SFTs, including enhanced crop yields, minimized nutrient loss, improved nut
... Show More