Abstract   

Lightweight materials is used in the sheet metal hydroforming process,  because it can be adapted to the manufacturing of complex structural components into a single body with high structural stiffness. Sheet hydroforming has been successfully developed in industry such as in the manufacturing of the components of automotive.The aim of this study is to simulate the experimental results ( such as the amount of pressure required to hydroforming process, stresses, and strains distribution)  with results  of finite element analyses (FEA)  (ANSYS 11)  for aluminum alloy (AA5652) sheets with  thickness (1.2mm) before heat treatm

Partial shading is one of the problems that affects the power production and the efficiency of photovoltaic module. A series of experimental work have been done of partial shading of   monocrystalline PV module; 50W, I_sc: 3.1A, V_oc: 22V with 36 cells in series is achieved. Non-linear power output responses of the module are observed by applying various cases of partial shading (vertical and horizontal shading of solar cells in the module). Shading a single cell (corner cell) has the greatest impact on output energy. Horizontal shading or vertical shading reduced the power from 41W to 18W at constant solar radiation 1000W/m² and steady state condition. Vertical blocking a column

Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ? W ? M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of ri

Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ⊊ W ⊆ M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of rings

To improve the efficiency of a processor in recent multiprocessor systems to deal with data, cache memories are used to access data instead of main memory which reduces the latency of delay time. In such systems, when installing different caches in different processors in shared memory architecture, the difficulties appear when there is a need to maintain consistency between the cache memories of different processors. So, cache coherency protocol is very important in such kinds of system. MSI, MESI, MOSI, MOESI, etc. are the famous protocols to solve cache coherency problem. We have proposed in this research integrating two states of MESI's cache coherence protocol which are Exclusive and Modified, which responds to a request from reading

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

This paper is concerned with introducing and studying the new approximation operators based on a finite family of d. g. 'swhich are the core concept in this paper. In addition, we study generalization of some Pawlak's concepts and we offer generalize the definition of accuracy measure of approximations by using a finite family of d. g. 's.

Classifying an overlapping object is one of the main challenges faced by researchers who work in object detection and recognition. Most of the available algorithms that have been developed are only able to classify or recognize objects which are either individually separated from each other or a single object in a scene(s), but not overlapping kitchen utensil objects. In this project, Faster R-CNN and YOLOv5 algorithms were proposed to detect and classify an overlapping object in a kitchen area.  The YOLOv5 and Faster R-CNN were applied to overlapping objects where the filter or kernel that are expected to be able to separate the overlapping object in the dedicated layer of applying models. A kitchen utensil benchmark image database and

     The stress(Y) – strength(X) model reliability Bayesian estimation which defines life of a component with strength X and stress Y (the component fails if and only if at any time the applied stress is greater than its strength) has been studied, then the reliability; R=P(Y<X), can be considered as a measure of the component performance. In this paper, a Bayesian analysis has been considered for R when the two variables X and Y are independent Weibull random variables with common parameter α in order to study the effect of each of the two different scale parameters β and λ; respectively, using three different [weighted, quadratic and entropy] loss functions under two different prior functions [Gamma and extension of Jeffery