• Structural Engineering and Mechanics
• /
• 제16권2호
• /
• pp.177-193
• /
• 2003

This paper presents an illustrative example of the advantages offered by inserting added viscous dampers into shear-type structures in accordance with a special scheme based upon the mass proportional damping (MPD) component of the Rayleigh viscous damping matrix. In previous works developed by the authors, it has been widely shown that, within the class of Rayleigh damped systems and under the "equal total cost" constraint, the MPD system provides best overall performance both in terms of minimising top-storey mean square response to a white noise stochastic input and maximising the weighted average of modal damping ratios. A numerical verification of the advantages offered by the application of MPD systems to a realistic structure is presented herein with reference to a 4-storey reinforced-concrete frame. The dynamic response of the frame subjected to both stochastic inputs and several recorded earthquake ground motions is here analysed in detail. The results confirm the good dissipative properties of MPD systems and indicate that this is achieved at the expense of relatively small damping forces.

• International Journal of Precision Engineering and Manufacturing
• /
• 제1권2호
• /
• pp.24-34
• /
• 2000

In this paper we propose a controller design method, called Quasi-LQG/$H_{\infty}$/LTR for nonlinear servo systems with hard nonlinearities such as Coulomb friction, dead-zone. Introducing the RIDF method to model Coulomb friction and dead-zone, the statistically linearized system is built. Then, we consider $H_{\infty}$ performance constraint for the optimization of statistically linearized systems, by replacing a covariance Lyapunov equation into a modified Riccati equation of which solution leads to an upper bound of the LQG performance. As a result, the nonlinear correction term is included in coupled Riccati equation, which is generally very difficult to thave a numerical solution. To solve this problem, we use the modified loop shaping technique and show some analytic proofs on LTR condition. Finally, the Quasi-LQG/$H_{\infty}$/LTR controller for a nonlinear system is synthesized by inverse random input describing function techniques (ITIDF). It is shown that the proposed design method has a better performance robustness to the hard nonlinearity than LQG/$H_{\infty}$/LTR method via simulations and experiments for the timing-belt driving servo system that contains the Coulomb friction and dead-zone.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.663-668
• /
• 1990

This paper deals with the application of a Generalized Predictive Control (CPC) to a Pressurized Water Reactor (P.W.R) Nuclear Power Plant. Generalized Predictive Control is a sort of Explicit Self-Tuning Control. Current self-tuning algorithms lack robustness to prior choices of either dead-time (input time delay of a plant) or model order. GPC is shown by simulation studies to be superior to accepted self-tuning techniques such as minimum variance and pole-placement from the viewpoint that it is robust to prior choices of dead-time or model order. In this paper a GPC controller is designed to control the P.W.R. nuclear power rlant with varying dead-time and through the designing procedure the designer is free from the constraint of knowing the exact dead-time. The controller is constructed based on the 2nd order linear model approximated in the vicinity of operating point. To ensure that this low-order model describes the complex real dynamics well enough for control purposes, model parameters are updated on-line with a Recursive Least Squares algorithm. Simulation results are successful and show the possibilities of the GPC control application to actual plants with varying or unknown dead-time.

• 전자공학회논문지
• /
• 제54권7호
• /
• pp.12-18
• /
• 2017

본 논문은 MIMO 통신 시스템을 위한 Dijkstra 탐색 기반의 제한된 연산량을 갖는 스피어 디코딩 (sphere decoding; SD) 알고리즘을 제안하고 이에 대한 성능을 평가한다. Dijkstra 탐색 기반의 SD는 MIMO 심볼 검파 과정에서 저 복잡도로 준 최적의 에러율 성능을 달성하는 효율적인 tree 탐색 알고리즘이다. 하지만 Dijkstra 탐색 기반의 SD는 채널 환경에 따라 연산량이 가변적이고, 최악의 경우 전역 탐색의 경우에 해당하는 높은 연산량을 갖는 심각한 문제가 있다. 본 논문에서는 이러한 문제를 해결하기 위해서 연산량을 제한시킨 새로운 Dijkstra 탐색 기반의 SD 알고리즘을 제시한다. 제안된 알고리즘은 연산량이 제한되었음에도 여전히 준 최적의 에러율 성능을 달성함을 모의 실험을 통해 검증하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.557-557
• /
• 2000

Tracking of the moving object, which is realized by the computer vision, is used for military and industrial fields. It is the application technique with imply complicated processing for understanding the input images. But, in these days, the most moving object tracking algorithms have many difficult problems. A typical problem is the increase of calculation time depending on target number. For this reason, there are many studies to solve real time processing problems and errors for background environmental change. In this paper, we used optical flow which is one of moving object tracking algorithms. It represents vector of the moving object. Optical flow estimation based on the regularization method depends on iteration method but it is very sensitive the noise. We proposed a new method using the Combinatorial Hough Transform (CHT) and Voting Accumulation in order to find optimal constraint lines. Also, we used the logical operation in order to release the operation time. The proposed method can easily and accurately extract the optical flow of moving object area and the moving information. We have simulated the proposed method using the test images. This images are included the noise. Experimental results show that the proposed method get better flow and estimate accurately the moving information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권3호
• /
• pp.576-599
• /
• 2013

Protocol reverse engineering is useful for many security applications, including intelligent fuzzing, intrusion detection and fingerprint generation. Since manual reverse engineering is a time-consuming and tedious process, a number of automatic techniques have been proposed. However, the accuracy of these techniques is limited due to the complexity of binary instructions, and the derived formats have missed constraints that are critical for security applications. In this paper, we propose a new approach for protocol format extraction. Our approach reasons about only the evaluation behavior of a program on the input message from concolic execution, and enables field identification and constraint inference with high accuracy. Moreover, it performs binary analysis with low complexity by reducing modern instruction sets to BIL, a small, well-specified and architecture-independent language. We have implemented our approach into a system called Icefex and evaluated it over real-world implementations of DNS, eDonkey, FTP, HTTP and McAfee ePO protocols. Experimental results show that our approach is more accurate and effective at extracting protocol formats than other approaches.

• Industrial Engineering and Management Systems
• /
• 제9권1호
• /
• pp.10-19
• /
• 2010

This paper presents an extended computing procedure for the global optimization of the triple response system (TRS) where the response functions are nonconvex (nonconcave) quadratics and the input factors satisfy a radial region of interest. The TRS arising from response surface modeling can be approximated using a nonlinear mathematical program involving one primary (objective) function and two secondary (constraints) functions. An optimization algorithm named triple response surface algorithm (TRSALG) is proposed to determine the global optimum for the nondegenerate TRS. In TRSALG, the Lagrange multipliers of target (secondary) functions are computed by using the Hooke-Jeeves search method, and the Lagrange multiplier of the radial constraint is located by using the trust region (TR) method at the same time. To ensure global optimality that can be attained by TRSALG, included is the means for detecting the degenerate case. In the field of numerical optimization, as the family of TR approach always exhibits excellent mathematical properties during optimization steps, thus the proposed algorithm can guarantee the global optimal solution where the optimality conditions are satisfied for the nondegenerate TRS. The computing procedure is illustrated in terms of examples found in the quality literature where the comparison results with a gradient-based method are used to calibrate TRSALG.

• Journal of Communications and Networks
• /
• 제13권5호
• /
• pp.456-462
• /
• 2011

This paper investigates the outage behavior of peak interference power limited cognitive radio (CR) networks with multiple transmit antennas. In CR-multi-input single-output (MISO) channel, the total transmit power is distributed over the transmitantennas. First, we use the orthogonal space-time codes (STC) to achieve the transmit diversity at CR-receiver (rx) and investigate the effect of the power distribution on the interference power received at the primary-receiver (P-rx). Then, we investigate the transmit antenna selection (TAS) scheme in which the CR system selects the best transmit antenna and allocates all the power to the selected best antenna. Two transmit antenna selection strategies are proposed depending on if feedback channel is available or not. We derive the closed form expressions of outage probability and outage capacity of all schemes with arbitrary number of transmit-antennas. We show that the proposed schemes significantly improve the outage capacity over the single antenna systems in Rayleigh fading environment. We also show that TAS based scheme outperforms the STC based scheme when peak interference power constraint is imposed on the P-rx only if a feedback channel from CR-rx to CR-transmitter is available.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3887-3907
• /
• 2015

This paper introduces a full duplex single secondary user multiple-input multiple-output (FD-SSU-MIMO) cognitive radio network, where secondary user (SU) opportunistically accesses the authorized spectrum unoccupied by primary user (PU) and transmits data based on FD-MIMO mode. Then we study the network achievable average sum-rate maximization problem under sum transmit power budget constraint at SU communication nodes. In order to solve the trade-off problem between SU's sensing time and data transmission time based on opportunistic spectrum access (OSA) and the power allocation problem based on FD-MIMO transmit mode, we propose a simple trisection algorithm to obtain the optimal sensing time and apply an alternating optimization (AO) algorithm to tackle the FD-MIMO based network achievable sum-rate maximization problem. Simulation results show that our proposed sensing time optimization and AO-based optimal power allocation strategies obtain a higher achievable average sum-rate than sequential convex approximations for matrix-variable programming (SCAMP)-based power allocation for the FD transmission mode, as well as equal power allocation for the half duplex (HD) transmission mode.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.686-710
• /
• 2019

This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.