There are many different methods for analysis of two-way reinforced concrete slabs. The most efficient methods depend on using certain factors given in different codes of reinforced concrete design. The other ways of analysis of two-way slabs are the direct design method and the equivalent frame method. But these methods usually need a long time for analysis of the slabs.

In this paper, a new simple method has been developed to analyze the two-way slabs by using simple empirical formulae, and the results of final analysis of some examples have been compared with other different methods given in different codes of practice.

The comparison proof that this simple proposed method gives good results and it can be used in analy

A new two-way nesting technique is presented for a multiple nested-grid ocean modelling system. The new technique uses explicit center finite difference and leapfrog schemes to exchange information between the different subcomponents of the nested-grid system. The performance of the different nesting techniques is compared, using two independent nested-grid modelling systems. In this paper, a new nesting algorithm is described and some preliminary results are demonstrated. The validity of the nesting method is shown in some problems for the depth averaged of 2D linear shallow water equation.

Abstract The purpose of this study, teach the art of performing Olympic lifts (snatch and, clean and jerk) using the two methods are instructional (self-learning associated with the model) and (reverse style of partial way). Identify the effectiveness of these methods in learning the art of performance and style of the best Olympic lifting in the learning and retention of novice for Olympic lifts. The research sample consisted of 16 lifters were selected purposively representing specialist center for the care of athletic talent to weightlifting for ages 14 years. The sample was divided into two experimental, Each group (8) eight weightlifters. The experimental group used the style of the first self-learning associated with the m

The choice of binary Pseudonoise (PN) sequences with specific properties, having long period high complexity, randomness, minimum cross and auto- correlation which are essential for some communication systems. In this research a nonlinear PN generator is introduced . It consists of a combination of basic components like Linear Feedback Shift Register (LFSR), ?-element which is a type of RxR crossbar switches. The period and complexity of a sequence which are generated by the proposed generator are computed and the randomness properties of these sequences are measured by well-known randomness tests.

We propose a novel strategy to optimize the test suite required for testing both hardware and software in a production line. Here, the strategy is based on two processes: Quality Signing Process and Quality Verification Process, respectively. Unlike earlier work, the proposed strategy is based on integration of black box and white box techniques in order to derive an optimum test suite during the Quality Signing Process. In this case, the generated optimal test suite significantly improves the Quality Verification Process. Considering both processes, the novelty of the proposed strategy is the fact that the optimization and reduction of test suite is performed by selecting only mutant killing test cases from cumulating t-way test ca

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

Traditional accounting takes only one dimension (economic) in calculating the value added of the company, and all other aspects (including environmental and social) are neglected, and despite the emergence of Sustainability Accounting and the interest of companies in preparing sustainability reports, these reports are suffering from many problems, including multiple metrics used in measuring companies (cash, quantity and lavish). In addition, these reports may reach dozens of pages in some companies and this causes the problem (information overload) which affects the qualitative properties of accounting information such as appropriate and relative, which requires the need to find a tool that can measure the Sustainability Unit of