a famous theorem of schur states that for a group $g$ finiteness of $g/z(g)$‎ ‎implies the finiteness of $g'.$ the converse of schur's theorem is an interesting problem which has been considered by some‎ ‎authors‎. ‎recently‎, ‎podoski and szegedy proved the truth of the converse of schur's theorem for capable groups‎. ‎they also established an explicit bound for the index of the center of such...

in this paper, we investigate the delay-dependent robust stability of fuzzy cohen-grossberg neural networks with markovian jumping parameter and mixed time varying delays by delay decomposition method. a new lyapunov-krasovskii functional (lkf) is constructed by nonuniformly dividing discrete delay interval into multiple subinterval, and choosing proper functionals with different weighting matr...

Multistage Interconnection Networks (MIN) are popular in switching and communication applications. It has been used in telecommunication and parallel computing systems for many years. The new challenge facing optical MIN is crosstalk, which is caused by coupling two signals within a switching element. Crosstalk is not too big an issue in the Electrical Domain, but due to the stringent Bit Error...

Tubular channel angular pressing (TCAP) process was proposed recently as a novel severe plastic deformation technique for producing ultrafine grain and nanostructured tubular components. In this paper, an upper-bound approach was used to analyze the TCAP process. Deformation of the material during TCAP process is analyzed using upper-bound analysis to determine maximum required load. The effect...

This paper is concerned with delay-dependent exponential stability analysis and stabilization for continuous-time T-S fuzzy Markovian jump systems with mode-dependent time-varying delay. By constructing a novel Lyapunov-Krasovskii functional and utilizing some advanced techniques, less conservative conditions are presented to guarantee the closed-loop system is mean-square exponentially stable....

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

It is well known that in operations research‎, ‎degeneracy can cause a cycle in a network‎ ‎simplex algorithm which can be prevented by maintaining strong‎ ‎feasible bases in each pivot‎. ‎Also‎, ‎in a network consists of n arcs‎ ‎and m nodes‎, ‎not considering any new conditions on the entering‎ ‎variable‎, ‎the upper bound of consecutive degenerate pivots is equal‎ $left( ‎begin{array}{c}‎ ‎n...

In this paper the eccentric forward extrusion of sections has been simulated and analyzed using FEM Abaqus-explicit. The results have been compared to those obtained from upper bound theorem and experimental works. Close agreements was observed between the FEM and experimental work and as compared with the upper bound data more realistic and better predictions were made by the authors’ method. ...