Free vibration analysis of functionally graded plates with multiple circular and non-circular cutouts

Cutouts are inevitable in structures due to practical consideration.In order to investigate the free vibration of functionally graded plates with multiple circular and non-circular cutouts,finite eleme...     

Studies on the properties and structure of electron‐beam crosslinked low‐density polyethylene/poly[ethylene‐co‐(vinyl acetate)] blends

Blends of low‐density polyethylene (LDPE) and poly[ethylene‐co‐(vinyl acetate)] (PEVA), crosslinked by electron‐beam (EB) radiation, formed separate crystalline lattices with a homogeneous amorphous phase. The crystallinity of the EB‐exposed samples slightly decreased, as verified by a slight reduction in the densities and melting heats and temperatures of the samples. The results obtained from both gel content and hot set tests showed that the degree of crosslinking in the amorphous regions was dependent on the dose and blend composition. The molecular weights between the crosslinks, measured from creep data, showed that an increasing PEVA content resulted in tighter network structures, thus supporting the idea that the crosslinking density at a given irradiation dose depends on the amorphous portions of the polymers. Addition of trimethylolpropane trimethacrylate as a radiation sensitizer enhanced the gel content of the neat polyethylene significantly, while the addition of an antioxidant showed the reverse effect. A significant improvement in the tensile strength of the neat PEVA samples was obtained upon EB radiation up to 210 kGy. The irradiated LDPE/PEVA blends showed improved tensile strength and elongation at break when compared to LDPE. Copyright © 2004 Society of Chemical Industry     

IDFC: A new approach to control bifurcation in TCP/RED

The main objective of this research is to analyze the bifurcation phenomenon in Internet congestion model for Transmission Control Protocol (TCP) with Random Early Detection (RED). This problem can be divided to many categories considering different viewpoints. Different approaches of modeling (continuous and discrete models) and various system structures (control in end node or routers) are some of these categories. The most significant method in control of such systems is Delayed Feedback Controller (DFC). In this paper, a discrete model is considered and a new algorithm Integral DFC (IDFC) is presented that has many preferences over similar algorithms, which are illustrated by simulation results and analytical discussions.     

Efficiency improvement of genetic network programming by tasks decomposition in different types of environments

Genetic Programming and Evolvable Machines - Genetic Network Programming (GNP) is a relatively recently proposed evolutionary algorithm which is an extension of Genetic Programming (GP). However,...     

LADPSO: using fuzzy logic to conduct PSO algorithm

Optimization plays a critical role in human modern life. Nowadays, optimization is used in many aspects of human modern life including engineering, medicine, agriculture and economy. Due to the growing number of optimization problems and their growing complexity, we need to improve and develop theoretical and practical optimization methods. Stochastic population based optimization algorithms like genetic algorithms and particle swarm optimization are good candidates for solving complex problems efficiently. Particle swarm optimization (PSO) is an optimization algorithm that has received much attention in recent years. PSO is a simple and computationally inexpensive algorithm inspired by the social behavior of bird flocks and fish schools. However, PSO suffers from premature convergence, especially in high dimensional multi-modal functions. In this paper, a new method for improving PSO has been introduced. The Proposed method which has been named Light Adaptive Particle Swarm Optimization is a novel method that uses a fuzzy control system to conduct the standard algorithm. The suggested method uses two adjunct operators along with the fuzzy system in order to improve the base algorithm on global optimization problems. Our approach is validated using a number of common complex uni-modal/multi-modal benchmark functions and results have been compared with the results of Standard PSO (SPSO2011) and some other methods. The simulation results demonstrate that results of the proposed approach is promising for improving the standard PSO algorithm on global optimization problems and also improving performance of the algorithm.     

Structured singular value of a repeated complex full-block uncertainty

The structured singular value (SSV), or $\mu$, is used to assess the robust stability and performance of an uncertain linear time-invariant system. Existing algorithms compute upper and lower bounds on the SSV for structured uncertainties that contain repeated (real or complex) scalars and/or nonrepeated complex full-blocks. This paper presents algorithms to compute bounds on the SSV for the case of repeated complex full-blocks. This specific class of uncertainty is relevant for the input-output analysis of many convective systems, such as fluid flows. Specifically, we present a power iteration to compute the SSV lower bound for the case of repeated complex full-blocks. This generalizes existing power iterations for repeated complex scalars and nonrepeated complex full-blocks. The upper bound can be formulated as a semi-definite program (SDP), which we solve using a standard interior-point method to compute optimal scaling matrices associated with the repeated full-blocks. Our implementation of the method only requires gradient information, which improves the computational efficiency of the method. Finally, we test our proposed algorithms on an example model of incompressible fluid flow. The proposed methods provide less conservative bounds as compared to prior results, which ignore the repeated full-block structure.     

A software technique to improve lifetime of caches containing ultra-leaky SRAM cells caused by within-die Vth variation

Exceptionally leaky transistors are increasingly more frequent in nanometer-scale technologies due to lower threshold voltage and its increased variation. SRAM cells containing such transistors suffer from accelerated aging due to electromigration intensified by higher currents continuously flowing through thin metals such as vias and contacts. Such cells do not violate target delay since leaky transistors are faster than ideal ones, and hence they are not faulty to be worth replacing with redundant rows and columns, which may also themselves contain exceptionally leaky transistors. Moreover, their number is growing so fast that makes redundancy ineffective. We show that in SRAM cells leakage current depends on the value stored in the cell and propose a software-based runtime technique that suppresses such abnormal leakages in the standby mode by storing safe values in the corresponding cache lines. Consequently, the lifetime of such caches is restored when used in long-standby applications. Moreover, energy dissipation in the standby mode is reduced by this technique if the standby duration is more than a few seconds. Analysis proves the performance penalty is, in the worst case, linearly dependent to the number of so-cured cache lines.