Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.
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
... Show MoreA robust video-bitrate adaptive scheme at client-aspect plays a significant role in keeping a good quality of video streaming technology experience. Video quality affects the amount of time the video has turned off playing due to the unfilled buffer state. Therefore to maintain a video streaming continuously with smooth bandwidth fluctuation, a video buffer structure based on adapting the video bitrate is considered in this work. Initially, the video buffer structure is formulated as an optimal control-theoretic problem that combines both video bitrate and video buffer feedback signals. While protecting the video buffer occupancy from exceeding the limited operating level can provide continuous video str
... Show More<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
... Show MoreThe research explores the confessional aspect in Audre Lorde's poem" Who Said It Was Simple ". Lorde depicts her personality under the stress of race, sex and sexuality. She discloses her own bitter experience concerning racism, sexism and sexuality in her poem to revive the retrospective truth of the Afro-Americans' life in the USA. This publicly manifestation of her personality and tribulation throughthe language ofpoetry has been regarded as the hallmark of confessional poetry.
the use of diffrent concectration of Na and Mg ions were shown to causes in increase in the bindings at oncentration
Flexure members such as reinforced concrete (RC) simply supported beams subjected to two-point loading were analyzed numerically. The Extended Finite Element Method (XFEM) was employed for the treatment the non-smooth h behaviour such as discontinuities and singularities. This method is a powerful technique used for the analysis of the fracture process and crack propagation in concrete. Concrete is a heterogeneous material that consists of coarse aggregate, cement mortar and air voids distributed in the cement paste. Numerical modeling of concrete comprises a two-scale model, using mesoscale and macroscale numerical models. The effectiveness and validity of the Meso-Scale Approach (MSA) in modeling of the reinforced concrete beams w
... Show MoreFour simply supported reinforced concrete (RC) beams were test experimentaly and analyzed using the extended finite element method (XFEM). This method is used to treat the discontinuities resulting from the fracture process and crack propagation in that occur in concrete. The Meso-Scale Approach (MSA) used to model concrete as a heterogenous material consists of a three-phasic material (coarse aggregate, mortar, and air voids in the cement paste). The coarse aggregate that was used in the casting of these beams rounded and crashed aggregate shape with maximum size of 20 mm. The compressive strength used in these beams is equal to 17 MPa and 34 MPa, respectively. These RC beams are designed to fail due to flexure when subjected to lo
... Show MoreThe aim for this research is to investigate the effect of inclusion of crack incidence into the 2D numerical model of the masonry units and bonding mortar on the behavior of unreinforced masonry walls supporting a loaded reinforced concrete slab. The finite element method was implemented for the modeling and analysis of unreinforced masonry walls. In this paper, ABAQUS, FE software with implicit solver was used to model and analyze unreinforced masonry walls which are subjected to a vertical load. Detailed Micro Modeling technique was used to model the masonry units, mortar and unit-mortar interface separately. It was found that considering potential pure tensional cracks located vertically in the middle of the mortar and units show
... Show Moreالنحت العربي في جنوب شبه الجزيرة العربية (اليمن) قبل الاسلام
Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res
... Show More