• Title/Summary/Keyword: Optimized algorithm

Search Result 1,815, Processing Time 0.032 seconds

Development of a back analysis program for reasonable derivation of tunnel design parameters (합리적인 터널설계정수 산정을 위한 역해석 프로그램 개발)

  • Kim, Young-Joon;Lee, Yong-Joo
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.15 no.3
    • /
    • pp.357-373
    • /
    • 2013
  • In this paper, a back analysis program for analyzing the behavior of tunnel-ground system and evaluating the material properties and tunnel design parameters was developed. This program was designed to be able to implement the back analysis of underground structure by combination of using FLAC and optimized algorithm as direct method. In particular, Rosenbrock method which is able to do direct search without obtaining differential coefficient was adopted for the back analysis algorithm among optimization methods. This back analysis program was applied to the site to evaluate the design parameters. The back analysis was carried out using field measurement results from 5 sites. In the course of back analysis, nonlinear regression analysis was carried out to identify the optimum function of the measured ground displacement. Exponential function and fractional function were used for the regression analysis and total displacement calculated by optimum function was used as the back analysis input data. As a result, displacement recalculated through the back analysis using measured displacement of the structure showed 4.5% of error factor comparing to the measured data. Hence, the program developed in this study proved to be effectively applicable to tunnel analysis.

Optimization of tunnel support patterns using DEA (차분진화 알고리즘을 적용한 터널 지보패턴 최적화)

  • Kang, Kyung-Nam;An, Joon-Sang;Kim, Byung-Chan;Song, Ki-Il
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.20 no.1
    • /
    • pp.211-224
    • /
    • 2018
  • It is important to design tunnel support system considering the various loads acting on the tunnel because they have a direct impact on the stability of tunnels. In Korea, standardized support patterns are defined based on the rock mass classification system depending on the project, and it is stated that it should be modified appropriately considering the behavior of tunnel during construction. In this study, the tunnel support pattern optimization method is suggested based on the convergence-confinement method, earth pressure, axial force of rock bolt, and moment acting on the shotcrete. The length and spacing of the rock bolts and the thickness of the shotcrete were optimized by using the differential evolution algorithm (DEA) and the results were compared to the standard support pattern III for railway tunnel. Rock bolt length can be reduced and the installation interval can be widened for shallow tunnel. As the depth of tunnel increases, the thickness of shotcrete increases linearly. Therefore, the thickness of shotcrete should be thicker than the standard support pattern as the depth of tunnel increases to secure the stability of tunnel.

Minimizing non-optimal paths in multi-hop ad hoc network adopted IEEE 802.11 PSM (IEEE 802.11 PSM을 적용한 다중 홉애드 혹 네트워크에서 우회경로의 최소화)

  • Whang, Do-Hyeon;Lee, Jang-Su;Kim, Sung-Chun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.583-588
    • /
    • 2007
  • It is easy to implement a temporary network with a mobile ad-hoc network in which mobile nodes have without using a infrastructure network. They depend on their limited power. Recently, it is a hot issue to save the energy in a mobile ad-hoc network because a mobile nodes have a limited energy. Research of IEEE 802.11 PSM was proposed in a single hop ad-hoc assumption. If IEEE 802.11 PSM is applied to multi hop ad-hoc network, non-optimal paths will be generated by the mobile nodes which didn't receive a message of routing request. Non-optimal paths increase not only a network latency but also energy consumption of mobile nodes. Reconfiguring algorithm of non-optimal paths caused by the mobile nodes which didn't receive a message of routing request is proposed in this paper. A mobile node can overhear the data in his range. A wireless medium is shared by all mobile nodes using the same bandwidth. All mobile nodes lookout the non-optimal paths with these properties of a medium, if non-optimal path is generated, optimal reconfiguring will be accomplished by modifying routing table of itself or sending a request message of routing update to nearby nodes. By reconfiguring the non-optimal paths to optimized ones, network latency and energy consumption was decreased. It is confirmed to ignore the overhead caused by a algorithm presented in this paper through the result of the simulation.

Slot-Time Optimization Scheme for Underwater Acoustic Sensor Networks (수중음향 센서네트워크를 위한 슬롯시간 최적화 기법)

  • Lee, Dongwon;Kim, Sunmyeng;Lee, Hae-Yeoun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.4
    • /
    • pp.351-361
    • /
    • 2014
  • Compared to a terrestrial communication, the high BER(Bit Error Ratio) and low channel bandwidth are the major factor of throughput degradation due to characteristics of underwater channel. Therefore, a MAC protocol must be designed to solve this problem in UWASNs(Underwater Acoustic Sensor Networks). MAC protocols for UWASNs can be classified into two major types according to the contention scheme(Contention-free scheme and Contention-based scheme). In large scale of sensor networks, a Contention-based scheme is commonly used due to time-synchronize problem of Contention-free scheme. In the contention-based scheme, Each node contends with neighbor nodes to access network channel by using Back-off algorithm. But a Slot-Time of Back-off algorithm has long delay times which are cause of decrease network throughput. In this paper, we propose a new scheme to solve this problem. The proposed scheme uses variable Slot-Time instead of fixed Slot-Time. Each node measures propagation delay from neighbors which are used by Slot-time. Therefore, Slot-Times of each node are optimized by considering node deployment. Consequently, the wasted-time for Back-off is reduced and network throughput is improved. A new mac protocol performance in throughput and delay is assessed through NS3 and compared with existing MAC protocol(MACA-U). Finally, it was proved that the MAC protocol using the proposed scheme has better performance than existing MAC protocol as a result of comparison.

A Self Organization of Wavelet Network Structure by Generation and Extinction of Hidden Nodes (은닉노드의 생성 ${\cdot}$ 소멸에 의한 웨이블릿 신경망 구조의 자기 조직화)

  • Lim, Sung-Kil;Lee, Hyon-Soo
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.12
    • /
    • pp.78-89
    • /
    • 1999
  • Previous wavelet network structures are determined by considering the relationship between wavelet windows distribution of training patterns that are transformed into time-frequency space. Because it is separated two algorithms that determines wavelet network structure and that modifies parameters of network, learning process that minimizes output error of network is executed after the network structure is determined. But this method has some weakness that training patterns must be transformed into time-frequency space by additional preprocessing and the network structure should be fixed during learning process. In this paper, we propose a new constructing method for wavelet network structure by using differences between the output and the desired response without preprocessing. Because the algorithm perform network construction and error minimizing process simultaneously, it can determine the number of hidden nodes adaptively as with the complexity of problems. In addition, the network structure is optimized by inserting new hidden nodes in the area that has maximum error and extracting hidden nodes that has no effect to the output of network. This algorithm has no constraint condition that all training patterns must be known, because it removes preprocessing procedure for training patterns and it can be applied effectively to systems that has time varying outputs.

  • PDF

Dynamic Control Allocation for Shaping Spacecraft Attitude Control Command

  • Choi, Yoon-Hyuk;Bang, Hyo-Choong
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.8 no.1
    • /
    • pp.10-20
    • /
    • 2007
  • For spacecraft attitude control, reaction wheel (RW) steering laws with more than three wheels for three-axis attitude control can be derived by using a control allocation (CA) approach.1-2 The CA technique deals with a problem of distributing a given control demand to available sets of actuators.3-4 There are many references for CA with applications to aerospace systems. For spacecraft, the control torque command for three body-fixed reference frames can be constructed by a combination of multiple wheels, usually four-wheel pyramid sets. Multi-wheel configurations can be exploited to satisfy a body-axis control torque requirement while satisfying objectives such as minimum control energy.1-2 In general, the reaction wheel steering laws determine required torque command for each wheel in the form of matrix pseudo-inverse. In general, the attitude control command is generated in the form of a feedback control. The spacecraft body angular rate measured by gyros is used to estimate angular displacement also.⁵ Combination of the body angular rate and attitude parameters such as quaternion and MRPs(Modified Rodrigues Parameters) is typically used in synthesizing the control command which should be produced by RWs.¹ The attitude sensor signals are usually corrupted by noise; gyros tend to contain errors such as drift and random noise. The attitude determination system can estimate such errors, and provide best true signals for feedback control.⁶ Even if the attitude determination system, for instance, sophisticated algorithm such as the EKF(Extended Kalman Filter) algorithm⁶, can eliminate the errors efficiently, it is quite probable that the control command still contains noise sources. The noise and/or other high frequency components in the control command would cause the wheel speed to change in an undesirable manner. The closed-loop system, governed by the feedback control law, is also directly affected by the noise due to imperfect sensor characteristics. The noise components in the sensor signal should be mitigated so that the control command is isolated from the noise effect. This can be done by adding a filter to the sensor output or preventing rapid change in the control command. Dynamic control allocation(DCA), recently studied by Härkegård, is to distribute the control command in the sense of dynamics⁴: the allocation is made over a certain time interval, not a fixed time instant. The dynamic behavior of the control command is taken into account in the course of distributing the control command. Not only the control command requirement, but also variation of the control command over a sampling interval is included in the performance criterion to be optimized. The result is a control command in the form of a finite difference equation over the given time interval.⁴ It results in a filter dynamics by taking the previous control command into account for the synthesis of current control command. Stability of the proposed dynamic control allocation (CA) approach was proved to ensure the control command is bounded at the steady-state. In this study, we extended the results presented in Ref. 4 by adding a two-step dynamic CA term in deriving the control allocation law. Also, the strict equality constraint, between the virtual and actual control inputs, is relaxed in order to construct control command with a smooth profile. The proposed DCA technique is applied to a spacecraft attitude control problem. The sensor noise and/or irregular signals, which are existent in most of spacecraft attitude sensors, can be handled effectively by the proposed approach.

A Derivation of the Representative Unit Hydrograph from Multiperiod Complex Storm by Linear Programming (선형계획법(線型計劃法)에 의한 대표단위도(代表單位圖) 유도(誘導))

  • Kwon, Oh Hun;Ryu, Tae Sang;Yoo, Ju Hwan
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.13 no.2
    • /
    • pp.173-182
    • /
    • 1993
  • This paper presents an algorithm to derive the representative unit hydrograph for the real environment of a watershed. For a given watershed, the conventional methods give several different unit hydrographs by storm events. In this study the LP model is somewhat modified based on the previous study by Mays et also as follows: the objective function is designed to minimize the sum of weighted residuals. An additional constraint of moving average is added to prevent the unit hydrograph from the occurence of oscillation which was not active in Mays's paper. Configuration of rainfall matrix was improved to reduce its dimension in accordance with Diskin's review point. In spite of the superiority of LP approach in terms of representativeness, all the methods were very sensitive to the validity of baseflow separation and rainfall-loss. Several methods of the separations for rainfall excesses and direct runoffs were applied and no preferred methods were identified. This is the matter of judgement considering catchment and rainfall characteristics. This algorithm was applied to a real watershed of the Wi stream in the Nak-dong river. Compared with the IHP results by conventional methods, this optimized representative unit hydrograph demonstrated relatively smaller and shorter values in terms of the peak discharge and the basin lag respectively, and the oscillation of its falling limb successfully eliminated owing to the additional constraints of moving averages.

  • PDF

Low-power Lattice Wave Digital Filter Design Using CPL (CPL을 이용한 저전력 격자 웨이브 디지털 필터의 설계)

  • 김대연;이영중;정진균;정항근
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.35D no.10
    • /
    • pp.39-50
    • /
    • 1998
  • Wide-band sharp-transition filters are widely used in applications such as wireless CODEC design or medical systems. Since these filters suffer from large sensitivity and roundoff noise, large word-length is required for the VLSI implementation, which increases the hardware size and the power consumption of the chip. In this paper, a low-power implementation technique for digital filters with wide-band sharp-transition characteristics is proposed using CPL (Complementary Pass-Transistor Logic), LWDF (Lattice Wave Digital Filter) and a modified DIFIR (Decomposed & Interpolated FIR) algorithm. To reduce the short-circuit current component in CPL circuits due to threshold voltage reduction through the pass transistor, three different approaches can be used: cross-coupled PMOS latch, PMOS body biasing and weak PMOS latch. Of the three, the cross-coupled PMOS latch approach is the most realistic solution when the noise margin as well as the energy-delay product is considered. To optimize CPL transistor size with insight, the empirical formulas for the delay and energy consumption in the basic structure of CPL circuits were derived from the simulation results. In addition, the filter coefficients are encoded using CSD (Canonic Signed Digit) format and optimized by a coefficient quantization program. The hardware cost is minimized further by a modified DIFIR algorithm. Simulation result shows that the proposed method can achieve about 38% reductions in power consumption compared with the conventional method.

  • PDF

Garbage Collection Method using Proxy Block considering Index Data Structure based on Flash Memory (플래시 메모리 기반 인덱스 구조에서 대리블록 이용한 가비지 컬렉션 기법)

  • Kim, Seon Hwan;Kwak, Jong Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.6
    • /
    • pp.1-11
    • /
    • 2015
  • Recently, NAND flash memories are used for storage devices because of fast access speed and low-power. However, applications of FTL on low power computing devices lead to heavy workloads which result in a memory requirement and an implementation overhead. Consequently, studies of B+-Tree on embedded devices without the FTL have been proposed. The studies of B+-Tree are optimized for performance of inserting and updating records, considering to disadvantages of the NAND flash memory that it can not support in-place update. However, if a general garbage collection method is applied to the previous studies of B+-Tree, a performance of the B+-Tree is reduced, because it generates a rearrangement of the B+-Tree by changing of page positions on the NAND flash memory. Therefor, we propose a novel garbage collection method which can apply to the B+-Tree based on the NAND flash memory without the FTL. The proposed garbage collection method does not generate a rearrangement of the B+-Tree by using a block information table and a proxy block. We implemented the B+-Tree and ${\mu}$-Tree with the proposed garbage collection on physical devices with the NAND flash memory. In experiment results, the proposed garbage collection scheme compared to greedy algorithm garbage collection scheme increased the number of inserted keys by up to about 73% on B+-Tree and decreased elapsed time of garbage collection by up to about 39% on ${\mu}$-Tree.

Development of a New Automatic Image Quality Optimization System for Mobile TFT-LCD Applications (모바일 TFT-LCD 응용을 위한 새로운 형태의 자동화질 최적화 시스템 개발)

  • Ryu, Jee-Youl;Noh, Seok-Ho
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.47 no.1
    • /
    • pp.17-28
    • /
    • 2010
  • This paper presents a new automatic TFT-LCD image quality optimization system using DSP for the first time. Since conventional manual method depends on experiences of LCD module developers, it is highly labor-intensive and requires several correction steps providing large gamma correction error. The proposed system optimizes automatically gamma adjustment and power setting registers in mobile TFT-LCD driver IC to reduce gamma correction error, adjusting time, and flicker. It contains module-under-test (MUT, TFT-LCD module), PC installed with program, multimedia display tester for measuring luminance and flicker, and control board for interface between PC and TFT-LCD module. We have developed a new algorithm using 6-point programmable matching technique with reference gamma curve and applying automatic power setting sequence. Developed algorithm and program are generally applicable for most of the TFT-LCD modules. It is realized to calibrate gamma values of 1.8, 2.0, 2.2 and 3.0, and reduce flicker level. The control board is designed with DSP and FPGA, and it supports various interfaces such as RGB and CPU. Developed automatic image quality optimization system showed significantly reduced gamma adjusting time, reduced flicker, and much less average gamma error than conventional manual method. We believe that the proposed system is very useful to provide high-quality TFT-LCD and to improve developing process using optimized gamma-curve setting and automatic power setting.