• Title/Summary/Keyword: Chen algorithm

Search Result 496, Processing Time 0.026 seconds

Nonlinear control of a 20-story steel building with active piezoelectric friction dampers

  • Chen, Chaoqiang;Chen, Genda
    • Structural Engineering and Mechanics
    • /
    • v.14 no.1
    • /
    • pp.21-38
    • /
    • 2002
  • A control algorithm combining viscous and non-linear Reid damping mechanisms has been recently proposed by the authors to command active friction dampers. In this paper, friction dampers and the proposed algorithm are applied to control the seismic responses of a nonlinear 20-story building. Piezoelectric stack actuators are used to implement the control algorithm. The capacity of each damper is determined by the practical size of piezoelectric actuators and the availability of power supply. The saturation effect of the actuators on the building responses is investigated. To minimize the peak story drift ratio or floor acceleration of the building structure, a practical sequential procedure is developed to sub-optimally place the dampers on various floors. The effectiveness of active friction dampers and the efficiency of the proposed sequential procedure are verified by subjecting the building structure to four earthquakes of various intensities. The performance of 80 dampers and 137 dampers installed on the structure is evaluated according to 5 criteria. Numerical simulations indicated that the proposed control algorithm effectively reduces the seismic responses of the uncontrolled 20-story building, such as inelastic deformation. The sub-optimal placement of dampers based on peak acceleration outperforms that based on peak drift ratio for structures subjected to near-fault ground motions. Saturation of piezoelectric actuators has adverse effect on floor acceleration.

A Simple Timeout Algorithm for Point-to-Multipoint ABR Service

  • Lai, Wei-Kuang;Chen, Chien-Ting;Li, Chilin
    • Journal of Communications and Networks
    • /
    • v.6 no.1
    • /
    • pp.38-45
    • /
    • 2004
  • The ABR point-to-multipoint connection is now playing a more important role than before. Many consolidation algorithms have been proposed to solve the consolidation noise problem and the slow transient response problem. But few timeout algorithms are proposed to handle the non-responsive branches for the multicast connections. Chen’s algorithm needs exchanging control messages between switches [9]. Besides, it may mistake a responsive branch as a non-responsive branch because of fast changes in source rates, which causes wrong information in BRM cells and may lead to network congestion and data losses in the responsive branch. We propose a simple timeout algorithm which can handle the non-responsive branches without exchanging message between switches. The timeout value for each switch is computed locally. Simulation results show that the proposed timeout algorithm can efficiently handle the non-responsive branches and utilize the available bandwidth within a small period of time. In addition, our algorithm could handle the situation when the source rates change quickly.

Modal control algorithm on optimal control of intelligent structure shape

  • Yao, Guo Feng;Chen, Su Huan;Wang, Wei
    • Structural Engineering and Mechanics
    • /
    • v.15 no.4
    • /
    • pp.451-462
    • /
    • 2003
  • In this paper, a new block iterative algorithm is presented by using the special feature of the continuous Riccati equation in the optimal shape control. Because the real-time control require that the CPU time should be as short as possible, an appropriate modal control algorithm is sought. The computing cost is less than the one of the all state feedback control. A numerical example is given to illustrate the algorithm.

A GLOBALLY AND SUPERLIEARLY CONVERGENT FEASIBLE SQP ALGORITHM FOR DEGENERATE CONSTRAINED OPTIMIZATION

  • Chen, Yu;Xie, Xiao-Liang
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.3_4
    • /
    • pp.823-835
    • /
    • 2010
  • In this paper, A FSQP algorithm for degenerate inequality constraints optimization problems is proposed. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving a quadratic programming subproblem. To overcome the Maratos effect, a higher-order correction direction is obtained by solving another quadratic programming subproblem. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions. Finally, some preliminary numerical results are reported.

Design of an efficient routing algorithm on the WK-recursive network

  • Chung, Il-Yong
    • Smart Media Journal
    • /
    • v.11 no.9
    • /
    • pp.39-46
    • /
    • 2022
  • The WK-recursive network proposed by Vecchia and Sanges[1] is widely used in the design and implementation of local area networks and parallel processing architectures. It provides a high degree of regularity and scalability, which conform well to a design and realization of distributed systems involving a large number of computing elements. In this paper, the routing of a message is investigated on the WK-recursive network, which is key to the performance of this network. We present an efficient shortest path algorithm on the WK-recursive network, which is simpler than Chen and Duh[2] in terms of design complexity.

Simulated Annealing for Reduction of Defect Sensitive Area Through Via Moving (Via 이동을 통한 결함 민감 지역 감소를 위한 시뮬레이티드 어닐링)

  • Lee, Seung Hwan;Sohn, So Young
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.1
    • /
    • pp.57-62
    • /
    • 2002
  • The semiconductor industry has continuously been looking for the ways to improve yield and to reduce manufacturing cost. The layout modification approach, one of yield enhancement techniques, is applicable to all design styles, but it does not require any additional resources in terms of silicon area. The layout modification method for yield enhancement consists of making local variations in the layout of some layers in such a way that the critical area, and consequently the sensitivity of the layer to point defects, is reduced. Chen and Koren (1995) proposed a greedy algorithm that removes defect sensitive area using via moving, but it is easy to fall into a local minimum. In this paper, we present a via moving algorithm using simulated annealing and enhance yield by diminishing defect sensitive area. As a result, we could decrease the defect sensitive area effectively compared to the greedy algorithm presented by Chen and Koren. We expect that the proposed algorithm can make significant contributions on company profit through yield enhancement.

A Dynamic Placement Mechanism of Service Function Chaining Based on Software-defined Networking

  • Liu, Yicen;Lu, Yu;Chen, Xingkai;Li, Xi;Qiao, Wenxin;Chen, Liyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4640-4661
    • /
    • 2018
  • To cope with the explosive growth of Internet services, Service Function Chaining (SFC) based on Software-defined Networking (SDN) is an emerging and promising technology that has been suggested to meet this challenge. Determining the placement of Virtual Network Functions (VNFs) and routing paths that optimize the network utilization and resource consumption is a challenging problem, particularly without violating service level agreements (SLAs). This problem is called the optimal SFC placement problem and an Integer Linear Programming (ILP) formulation is provided. A greedy heuristic solution is also provided based on an improved two-step mapping algorithm. The obtained experimental results show that the proposed algorithm can automatically place VNFs at the optimal locations and find the optimal routing paths for each online request. This algorithm can increase the average request acceptance rate by about 17.6% and provide more than 20-fold reduction of the computational complexity compared to the Greedy algorithm. The feasibility of this approach is demonstrated via NetFPGA-10G prototype implementation.

Optimization of direct design system of semi-rigid steel frames using advanced analysis and genetic algorithm (고등해석과 유전자 알고리즘을 이용한 반강접 강뼈대 구조물의 직접설계시스템의 최적화)

  • Choi, Se Hyu
    • Journal of Korean Society of Steel Construction
    • /
    • v.18 no.6
    • /
    • pp.707-716
    • /
    • 2006
  • The optimization of the direct design system of semi-rigid steel frames using advanced analysis and genetic algorithm was presented. Advanced analysis can predict the combined nonlinear effects of connection, geometry, and material on the behavior and strength of semi-rigid frames. Geometric nonlinearity was determined using stability functions. On the other hand, material nonlinearity was determined using the Column Research Council (CRC) tangent modulus and parabolic function. The Kishi-Chen power model was used to describe the nonlinear behavior of semi-rigid connections. The genetic algorithm was used as the optimization technique. The objective function was assumed as the weight of the steel frame, with the constraint functions accounting for load-carrying capacities, deflections, inter-story drifts and ductility requirement. Member sizes determined by the proposed method were compared with those derived using the conventional method.

System simulation and synchronization for optimal evolutionary design of nonlinear controlled systems

  • Chen, C.Y.J.;Kuo, D.;Hsieh, Chia-Yen;Chen, Tim
    • Smart Structures and Systems
    • /
    • v.26 no.6
    • /
    • pp.797-807
    • /
    • 2020
  • Due to the influence of nonlinearity and time-variation, it is difficult to establish an accurate model of concrete frame structures that adopt active controllers. Fuzzy theory is a relatively appropriate method but susceptible to human subjective experience to decrease the performance. This paper proposes a novel artificial intelligence based EBA (Evolved Bat Algorithm) controller with machine learning matched membership functions in the complex nonlinear system. The proposed affine transformed membership functions are adopted and stabilization and performance criterion of the closed-loop fuzzy systems are obtained through a new parametrized linear matrix inequality which is rearranged by machine learning affine matched membership functions. The trajectory of the closed-loop dithered system and that of the closed-loop fuzzy relaxed system can be made as close as desired. This enables us to get a rigorous prediction of stability of the closed-loop dithered system by establishing that of the closed-loop fuzzy relaxed system.

NNDI decentralized evolved intelligent stabilization of large-scale systems

  • Chen, Z.Y.;Wang, Ruei-Yuan;Jiang, Rong;Chen, Timothy
    • Smart Structures and Systems
    • /
    • v.30 no.1
    • /
    • pp.1-15
    • /
    • 2022
  • This article focuses on stability analysis and fuzzy controller synthesis for large neural network (NN) systems consisting of several interconnected subsystems represented by the NN model. Advanced and fuzzy NN differential inclusion (NNDI) for stability based on the developed algorithm with H infinity can be designed based on the evolved biological design. This representation is constructed using sector linearity for NN models. Sector linearity transforms a non-linear model into a linear model based on proposed operations. New sufficient conditions are realized in the form of LMI (linear matrix inequalities) to ensure the asymptotic stability of the trans-Lyapunov function. This transforms the nonlinear model into a linear model based on multiple rules. At last, a numerical case study with simulations is derived as illustration to prove its feasibility in real nonlinear structures.