• Title/Summary/Keyword: Optimal computation

Search Result 640, Processing Time 0.026 seconds

Methods for Call Distribution Service Feature of Service Control Logic in Intelligent Network (지능망에서 서비스 제어 로직의 호 분배 서비스 특성을 위한 방법)

  • Tae-Gyu Kang;Su-Ki Paik
    • Journal of Internet Computing and Services
    • /
    • v.2 no.4
    • /
    • pp.1-10
    • /
    • 2001
  • In this paper, we define requirements for call distribution of service control logic in Intelligent Network, Also, we propose call distribution mechanism for every subscriber with different call distribution rates, The call distribution mechanism had been developed as a function of Premium-rate Service in Intelligent Network. Our call distribution mechanism applies to percentage distribution instead of circular or hierarchical distribution. The call distribution mechanism consists of call input. output. call distribution processing logic part, random number generator, and customers database. We propose the practical implementation of a call distribution mechanism and call distribution decision indicating number computation method. We show three methods, the rand() function in C language, microsecond by system clock, and proposed algorithm, to get call distribution decision indicating number. In order to optimal call distribution mechanism, we estimated the results of three methods on occurrence values and the number of occurrences.

  • PDF

Robust market-based control method for nonlinear structure

  • Song, Jian-Zhu;Li, Hong-Nan;Li, Gang
    • Earthquakes and Structures
    • /
    • v.10 no.6
    • /
    • pp.1253-1272
    • /
    • 2016
  • For a nonlinear control system, there are many uncertainties, such as the structural model, controlled parameters and external loads. Although the significant progress has been achieved on the robust control of nonlinear systems through some researches on this issue, there are still some limitations, for instance, the complicated solving process, weak conservatism of system, involuted structures and high order of controllers. In this study, the computational structural mechanics and optimal control theory are adopted to address above problems. The induced norm is the eigenvalue problem in structural mechanics, i.e., the elastic stable Euler critical force or eigenfrequency of structural system. The segment mixed energy is introduced with a precise integration and an extended Wittrick-Williams (W-W) induced norm calculation method. This is then incorporated in the market-based control (MBC) theory and combined with the force analogy method (FAM) to solve the MBC robust strategy (R-MBC) of nonlinear systems. Finally, a single-degree-of-freedom (SDOF) system and a 9-stories steel frame structure are analyzed. The results are compared with those calculated by the $H{\infty}$-robust (R-$H{\infty}$) algorithm, and show the induced norm leads to the infinite control output as soon as it reaches the critical value. The R-MBC strategy has a better control effect than the R-$H{\infty}$ algorithm and has the advantage of strong strain capacity and short online computation time. Thus, it can be applied to large complex structures.

An Improved Genetic Algorithm for Integrated Planning and Scheduling Algorithm Considering Tool Flexibility and Tool Constraints (공구유연성과 공구관련제약을 고려한 통합공정일정계획을 위한 유전알고리즘)

  • Kim, Young-Nam;Ha, Chunghun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.2
    • /
    • pp.111-120
    • /
    • 2017
  • This paper proposes an improved standard genetic algorithm (GA) of making a near optimal schedule for integrated process planning and scheduling problem (IPPS) considering tool flexibility and tool related constraints. Process planning involves the selection of operations and the allocation of resources. Scheduling, meanwhile, determines the sequence order in which operations are executed on each machine. Due to the high degree of complexity, traditionally, a sequential approach has been preferred, which determines process planning firstly and then performs scheduling independently based on the results. The two sub-problems, however, are complicatedly interrelated to each other, so the IPPS tend to solve the two problems simultaneously. Although many studies for IPPS have been conducted in the past, tool flexibility and capacity constraints are rarely considered. Various meta-heuristics, especially GA, have been applied for IPPS, but the performance is yet satisfactory. To improve solution quality against computation time in GA, we adopted three methods. First, we used a random circular queue during generation of an initial population. It can provide sufficient diversity of individuals at the beginning of GA. Second, we adopted an inferior selection to choose the parents for the crossover and mutation operations. It helps to maintain exploitation capability throughout the evolution process. Third, we employed a modification of the hybrid scheduling algorithm to decode the chromosome of the individual into a schedule, which can generate an active and non-delay schedule. The experimental results show that our proposed algorithm is superior to the current best evolutionary algorithms at most benchmark problems.

Buckling analysis and optimal structural design of supercavitating vehicles using finite element technology

  • Byun, Wan-Il;Kim, Min-Ki;Park, Kook-Jin;Kim, Seung-Jo;Chung, Min-Ho;Cho, Jin-Yeon;Park, Sung-Han
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.3 no.4
    • /
    • pp.274-285
    • /
    • 2011
  • The supercavitating vehicle is an underwater vehicle that is surrounded almost completely by a supercavity to reduce hydrodynamic drag substantially. Since the cruise speed of the vehicle is much higher than that of conventional submarines, the drag force is huge and a buckling may occur. The buckling phenomenon is analyzed in this study through static and dynamic approaches. Critical buckling load and pressure as well as buckling mode shapes are calculated using static buckling analysis and a stability map is obtained from dynamic buckling analysis. When the finite element method (FEM) is used for the buckling analysis, the solver requires a linear static solver and an eigenvalue solver. In this study, these two solvers are integrated and a consolidated buckling analysis module is constructed. Furthermore, Particle Swarm Optimization (PSO) algorithm is combined in the buckling analysis module to perform a design optimization computation of a simplified supercavitating vehicle. The simplified configuration includes cylindrical shell structure with three stiffeners. The target for the design optimization process is to minimize total weight while maintaining the given structure buckling-free.

Skeletonization Methods for Complex Water Distribution Network (상수관망 시스템의 골격화 기법 평가)

  • Choi, Jeong Wook;Kang, Doosun
    • Journal of Korea Water Resources Association
    • /
    • v.48 no.10
    • /
    • pp.845-855
    • /
    • 2015
  • Studies of optimizing pump operation in water distribution networks (WDN) are receiving spotlight in recent days. However, the water networks are quite complex including thousands of or even tens of thousands of nodes and pipes, thus simulation time is an issue. In some cases, implementing a computer model for pump operation decisions is restrictive due to intensive computation time. To that end, it is necessary to reduce the simulation time of water networks by simplifying the network layout. In this study, WDN skeletonization approaches were suggested and applied to a real water transmission network in South Korea. In skeletonizing the original network, it was constrained to match the water pressure and water age in the same junction locations to maintain the hydraulic and water quality characteristics in the skeletonized network. Using the skeletonization approaches suggested in this study, it is expected to reduce the simulation time of WDN and apply for developing a computer module of WDN real-time optimal operation.

Position Control and Stabilization of Inverted Pendulum using the Evolution Strategies (진화전략을 이용한 도립진자의 안정화 및 위치제어)

  • 이동욱;심귀보
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.6 no.4
    • /
    • pp.71-80
    • /
    • 1996
  • This paper presents stabilization and position control of the Inverted-Pendulum system with cart by using Evolution Strategies that is one of the Evolutionary Computation and is effective in searching real number. The control input of the Inverted-Pendulum is the element of chromosome corresponding to the divided space of Inverted-Pendulum state variable x, x, 0, 0 . In general, the larger the length of the chromosome is, the longer the time of evolution to search optimal solution is. So in this paper, we propose a scheme that reduce the state space by half by taking the method, that is, converting only the sign of the control input without obtaining separately for the symmetrical sections of the Inverted-Pendulum to improve the speed of Evolution, and improved the efficiency of the entire system in addition to the improvement of the chromosome's evolution time by carrying out the chromosome's evolutional process by two steps one of which is that cart is positioned near the control point and the other cart is positioned far from that point. We propose another method that is Neural Network-Evolution StrategiedNN-ES) Controller. We verify the effectiveness of the proposed control scheme by computer simulations.

  • PDF

Determining Checkpoint Intervals of Non-Preemptive Rate Monotonic Scheduling Using Probabilistic Optimization (확률 최적화를 이용한 비선점형 Rate Monotonic 스케줄링의 체크포인트 구간 결정)

  • Kwak, Seong-Woo;Yang, Jung-Min
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.1
    • /
    • pp.120-127
    • /
    • 2011
  • Checkpointing is one of common methods of realizing fault-tolerance for real-time systems. This paper presents a scheme to determine checkpoint intervals using probabilistic optimization. The considered real-time systems comprises multiple tasks in which transient faults can happen with a Poisson distribution. Also, multi-tasks are scheduled by the non-preemptive Rate Monotonic (RM) algorithm. In this paper, we present an optimization problem where the probability of task completion is described by checkpoint numbers. The solution to this problem is the optimal set of checkpoint numbers and intervals that maximize the probability. The probability computation includes schedulability test for the non-preemptive RM algorithm with respect to given numbers of checkpoint re-execution. A case study is given to show the applicability of the proposed scheme.

Image Histogram Equalization Using Flexible Logistic Transformation Function (유연한 로지스틱 변환함수를 이용한 영상의 히스토그램 평활화)

  • Cho, Yong-Hyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.6
    • /
    • pp.787-795
    • /
    • 2009
  • This paper presents a histogram equalization based on the logistic function for enhancing the quality of images. The histogram equalization is a simple and effective spatial processing method that it enhances the quality by adjusting the brightness of image. The logistic function that is a nonlinear transformation function is applied to adaptively enhance the brightness of the image according to its intensity level frequency. We propose a flexible and asymmetrical logistic function by only using the intensity level with maximum frequency and the maximum intensity level in an histogram, and the total number of pixels. The proposed function excludes both the computation load of an exponential function and the heuristic setting of an optimal parameter values in the traditional logistic function. The proposed method has been applied for equalizing many images with a different resolution and histogram distribution. The experimental results show that the proposed method has the superior enhancement performances and the faster equalizing speed compared with the traditional histogram equalization and the adaptively modified histogram equalization, respectively. And the proposed histogram equalization can be used in various multimedia systems in real-time.

The PALM system : Architecture and Network Performance (PALM시스템의 구조와 네트웍 성능)

  • Kim, Suk-Il
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.1
    • /
    • pp.105-113
    • /
    • 1994
  • This paper introduces the Parallel Advanced Loosely coupled Multiprocessor (PALM) architecture, which is based on HCH(m,p), where m is number of links per a communication processor (CP) and p is the number of application processors (APs) connected to the CP. communication links between a pair of CPs and/or between a CP and an AP, are made of dual-Port RAMs, which provide fast and reliable word-parallel communication between processors. Among the wide spectrum of HCH networks, HCH(m,2) is also known to be a cost optimal topology, such that HCH(m,2) consists of the largest number of APs retaining the minimal number of CPs and communication links. We also implement a testbed based on HCH(2,2). The experiment result shows that the small communication/computation ratio of the PALM system would realize fine-grain parallelism on message-passing MIMD systems.

  • PDF

Design of Evolvable Hardware based on Genetic Algorithm Processor(GAP)

  • Sim Kwee-Bo;Harashiam Fumio
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.5 no.3
    • /
    • pp.206-215
    • /
    • 2005
  • In this paper, we propose a new design method of Genetic Algorithm Processor(GAP) and Evolvable Hardware(EHW). All sorts of creature evolve its structure or shape in order to adapt itself to environments. Evolutionary Computation based on the process of natural selection not only searches the quasi-optimal solution through the evolution process, but also changes the structure to get best results. On the other hand, Genetic Algorithm(GA) is good fur finding solutions of complex optimization problems. However, it has a major drawback, which is its slow execution speed when is implemented in software of a conventional computer. Parallel processing has been one approach to overcome the speed problem of GA. In a point of view of GA, long bit string length caused the system of GA to spend much time that clear up the problem. Evolvable Hardware refers to the automation of electronic circuit design through artificial evolution, and is currently increased with the interested topic in a research domain and an engineering methodology. The studies of EHW generally use the XC6200 of Xilinx. The structure of XC6200 can configure with gate unit. Each unit has connected up, down, right and left cell. But the products can't use because had sterilized. So this paper uses Vertex-E (XCV2000E). The cell of FPGA is made up of Configuration Logic Block (CLB) and can't reconfigure with gate unit. This paper uses Vertex-E is composed of the component as cell of XC6200 cell in VertexE