A study has been performed to compare the beddings in which ductile iron pipes are buried. In water transmission systems, bends are usually used in the pipes. According to the prescribed layout, at these bends, unbalanced thrust forces are generated that must be confronted to prevent the separation of the bend from the pipe. The bed condition is a critical and important factor in providing the opposite force to the thrust forces in the restraint joint system. Due to the interaction between the native soil and the bedding layers in which the pipe is buried and the different characteristics between them. Also, the interaction with the pipe material makes it difficult to calculate the real forces opposite to the thrust forces and the way they

: In modern optical communication system, noise rejection multiple access interference (MAI) must be rejected in dense access network (DAN). This paper will study the dual optical band pass and notch filters. They will be extracted with tunable FWHM using 10cm (PMF) with different cladding diameters formed with etching 125μm PMF after immersing it with 40% of hydrofluoric acid (HF). This fiber acts as assessing fiber to perform Sagnac interferometer with splicing regions that placed 12cm (SMF) for performing hybrid Sagnac interferometer that consists of Mach-Zehnder instead of Sagnac loop which is illuminated by using laser source with centroid wavelength of 1546.7nm and FWHM of 286 pm or 9 ns in the time domain. . Firs

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.

Today’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wol

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

RA Ali, LK Abood, Int J Sci Res, 2017 - Cited by 2