• Structural Engineering and Mechanics
• /
• 제1권1호
• /
• pp.119-135
• /
• 1993

The paper presents a generalized optimal active control algorithm for earthquake-resistant structures. The study included the weighting matrix configuration, stability, and time-delays for achieving control effectiveness and optimum solution. The sensitivity of various time-delays in the optimal solution is investigated for which the stability regions are determined. A simplified method for reducing the influence of time-delay on dynamic response is proposed. Numerical examples illustrate that the proposed optimal control algorithm is advantageous over others currently in vogue. Its feedback control law is independent of the time increment, and its weighting matrix can be flexibly selected and adjusted at any time during the operation of the control system. The examples also show that the weighting matrix based on pole placement approach is superior to other weighting matrix configurations for its self-adjustable control effectiveness. Using the time-delay correction method can significantly reduce the influence of time-delays on both structural response and required control force.

• Transactions on Control, Automation and Systems Engineering
• /
• 제3권4호
• /
• pp.268-271
• /
• 2001

In this paper, we propose a simplified pollution adaptive mesh generation algorithm using singular elements. The algorithm based on the element pollution error indicator concentrate on boundary nodes. The automatic mesh generation method is followed by either a node-relocation or a node-insertion method. The boundary node relocation phase is introduced to reduce pollution error estimates without increasing the boundary nodes. The node insertion phase greatly improves the error and the factor with the cost of increasing the node numbers. It is shown that the suggested r-h version algorithm combined with singular elements converges more quickly than the conventional one.

• 대한전자공학회논문지
• /
• 제18권6호
• /
• pp.9-15
• /
• 1981

다출력 TANT회로망에 대한 구성게이트수와 이들의 상호연결에 관계되는 게이트입력수를 최소화시키는 새로운 방법이 제시되었다. 본 연구에서는 다출력맵(multiple-output map)을 구성하여 헤드변수의 갯수가 작은 순서에 따라 통합 개념을 적용하여 최적함수를 구성하였다. 조직적인 통합은 PSA(position search algorithm)에 의했으며 이로써 전체적인 설계자정을 줄일 수 있었다.

• 한국자동차공학회논문집
• /
• 제8권1호
• /
• pp.63-71
• /
• 2000

A shift control algorithm of a newly developed two-speed gear shift system is proposed for electric vehicle applications. The algorithm is formulated according to the motor torque map and optimized to obtain the adequate propulsion characteristics for vehicle. Two speed gear system with shift control algorithm has proved greater efficiencies in terms of energy economy with its simplified hardware and software structures. The gear shifting is designed to be carried out by an actuator and the control signal from a vehicle control unit equipped with $\mu$-processor. The results of performances and efficiency of the algorithm by simulation and vehicle test are described.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권2호
• /
• pp.58-66
• /
• 2001

This paper presents an application of a newly designed Adaptive Genetic Algorithm (AGA) to solve the Optimal Feeder Routing (OFR) problem for distribution system planning. The main objective of the OFR problem usually is to minimize the total cost that is the sum of investment costs and system operation costs. We propose a properly designed AGA, in this paper, which can handle the horizon-year expansion planning problem of power distribution network in which the location of substation candidates, the location and amount of forecasted demands are given. In the proposed AGA, we applied adaptive operators using specially designed adaptive probabilities. we also a Simplified Load Flow (SLF) technique for radial networks to improve a searching efficiency of AGA. The proposed algorithm has been evaluated with the practical 32, 69 bus test system to show favorable performance. It is also shown that the proposed method for the OFR can also be used for the network reconfiguration problem in distribution system.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1995년도 가을 학술발표회 논문집
• /
• pp.76-83
• /
• 1995

Estimation of blasting behavior of explosives is prerequisite in the numerical analysis of blasting works. In this study, blasting pressure is estimated by the finite difference method using the Flux-Corrected Transport Algorithm. To formulate the behavior of blasting gas, the mass conservation equation, the moment conservation equation, the energy conservation equation and the ideal gas state equation are used. The simplified species conservation equation is included to simulate the behavior of reacting explosives. To verify the calculation, the Sod's shock tube problem, the strong shock problem and the reacting problem we used. Numerical results show that the shock wave can be captured by means of the FCT algorithm in the reacting and nonreacting states.

• Wind and Structures
• /
• 제2권3호
• /
• pp.189-200
• /
• 1999

In this paper, a new algorithm for active control design of structures is proposed and investigated. The algorithm preserves the decoupling property of the modal vibration equation and eliminates the spillover problem, which is the main shortcoming in the independent modal space control(IMSC) algorithm. With linear quadratic regulator(LQR) control law, the analytical solution of algebraic Riccati equation and the optimal actuator control force are obtained, and the control design procedure is significantly simplified. A numerical example for the control design of a tall building subjected to wind loads demonstrates the effectiveness of the proposed algorithm in reducing the acceleration and displacement responses of tall buildings under wind actions.

• Earthquakes and Structures
• /
• 제22권2호
• /
• pp.147-155
• /
• 2022

Regarding the importance of seismic pounding, the available standards and guidelines specify minimum separation distance between adjacent buildings. However, the rules in this field are generally based on some simple assumptions, and the level of confidence is uncertain. This is attributed to the fact that the relative response of adjacent structures is strongly dependent on the frequency content of the applied records and the Eigen frequencies of the adjacent structures as well. Therefore, this research aims at investigating the separation distance of the buildings through a probabilistic-based algorithm. In order to empower the algorithm, the record-to-record uncertainties, are considered by probabilistic approaches; besides, a wide extent of material nonlinear behaviors can be introduced into the structural model by the implementation of the hysteresis Bouc-Wen model. The algorithm is then simplified by the application of the linearization concept and using the response acceleration spectrum. By implementing the proposed algorithm, the separation distance in a specific probability level can be evaluated without the essential need of performing time-consuming dynamic analyses. Accuracy of the proposed method is evaluated using nonlinear dynamic analyses of adjacent structures.

• 대한전자공학회논문지
• /
• 제23권2호
• /
• pp.217-224
• /
• 1986

In case of VLSI design, the shuffle-exchange graph is useful for optimal layout. HOEY and LEISERSON proposed the method of drawing a N-nodes shuffle-exchange graph on O(N2/log N) layout area by using the complex plane digram. [2] In this paper, a new algorithm for drawing the shuffle-exchange graph is proposed. This algorithm is not by using the complex plane diabram, but the table of e decimal represented nodes of shuffle-edge relations. And the structural properties for optimal layout of the graph are summarized and verified. By using this more simplified algorithm, a FORTRAN program which can be treated faster is written. Aimed near optimal shuffle-exchange graphs are printed out by giving inputs` the number of nodes.

• 반도체디스플레이기술학회지
• /
• 제22권4호
• /
• pp.59-65
• /
• 2023

Edge detection in image processing and computer vision is one of the most fundamental operations. Canny edge detection algorithm has excellent performance and is currently widely used. However, it is difficult to process the algorithm in real-time because the algorithm is complex. In this study, the equations required in the algorithm were simplified to facilitate hardware implementation, and the calculation speed was increased by using a parallel structure. In particular, the size and management of local buffers were selected in consideration of parallel processing and filter size so that data could be processed without bottlenecks. It was designed in verilog and implemented in FPGA to verify operation and performance.