The behavior and shear strength of full-scale (T-section) reinforced concrete deep beams, designed according to the strut-and-tie approach of ACI Code-19 specifications, with various large web openings were investigated in this paper. A total of 7 deep beam specimens with identical shear span-to-depth ratios have been tested under mid-span concentrated load applied monotonically until beam failure. The main variables studied were the effects of width and depth of the web openings on deep beam performance. Experimental data results were calibrated with the strut-and-tie approach, adopted by ACI 318-19 code for the design of deep beams. The provided strut-and-tie design model in ACI 318-19 code provision was assessed and found to be u

Detecting the optimum layer for well placement, which requires a diverse assortment of tools and techniques, represents a significant challenge in petroleum studies due to its critical impact on minimizing drilling costs and time. This study aims to evaluate integrated geological, petrophysical, seismic, and geomechanical data to identify the optimum zones for well placement. Three different reservoirs were analyzed to account for lateral and vertical variations in reservoir properties. The integrated data from these reservoirs provides many tools for reservoir development, especially to detect appropriate well placement zones based on evaluations of reservoir and geomechanical quality. The Mechanical Earth Model (MEM) was construct

In many oil fields only the BHC logs (borehole compensated sonic tool) are available to provide interval transit time (Δtp), the reciprocal of compressional wave velocity VP.

   To calculate the rock elastic or inelastic properties, to detect gas-bearing formations, the shear wave velocity VS is needed. Also VS is useful in fluid identification and matrix mineral identification.

   Because of the lack of wells with shear wave velocity data, so many empirical models have been developed to predict the shear wave velocity from compressional wave velocity. Some are mathematical models others used the multiple regression method and neural network technique.

   In this study a number of em

Big data analysis is essential for modern applications in areas such as healthcare, assistive technology, intelligent transportation, environment and climate monitoring. Traditional algorithms in data mining and machine learning do not scale well with data size. Mining and learning from big data need time and memory efficient techniques, albeit the cost of possible loss in accuracy. We have developed a data aggregation structure to summarize data with large number of instances and data generated from multiple data sources. Data are aggregated at multiple resolutions and resolution provides a trade-off between efficiency and accuracy. The structure is built once, updated incrementally, and serves as a common data input for multiple mining an

The neighbourhood unit is a small local community in a city dwelled by certain number of dwellers who are characterized by common features, mostly economic. They daily deal with each other & unified with the feeling of neighbourhood. The daily primary services are available in this small community (like education, shopping & entertainment). This community is separated from other communities by physical boundaries like streets, gardens… etc. The neighbourhood is not an exotic notion on human community but it is as ancient as history itself since it was there in ancient communities that dwelled on earth. Complications of urban life needs, caused by cities’ expansion, and the weakness of social relationships, imposed phy

The convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.

Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.