• 제목/요약/키워드: Computer optimization

검색결과 2,405건 처리시간 0.023초

분산 복합유전알고리즘을 이용한 구조최적화 (Distributed Hybrid Genetic Algorithms for Structural Optimization)

  • 우병헌;박효선
    • 한국전산구조공학회논문집
    • /
    • 제16권4호
    • /
    • pp.407-417
    • /
    • 2003
  • 최근 구조최적화분야에서 활발하게 사용되고 있는 유전알고리즘은 해집단을 운용하기 때문에, 많은 반복수와 적응도 평가를 위하여 해집단의 수에 해당하는 구조해석을 필요로 하며, 또한 교배율과 돌연변이율 등의 파라미터에 따라 알고리즘의 성능이 변화하므로 문제에, 따라 적합한 파라미터 설정이 필요한 근본적인 단점을 지니고 있다. 본 연구에서는 기존 유전알고리즘의 단점을 극복할 수 있는 복합유전알고리즘을 마이크로유전알고리즘과 단순유전알고리즘을 결합한 형식으로 그리고, 최적화에 요구되는 연산을 다수의 개인용 컴퓨터에서 동시에 분산하여 수행할 수 있는 고성능 분산 복합유전알고리즘으로 개발하였다. 개발된 알고리즘은 철골 가새골조 구조물의 최소중량설계에 적용하여 그 성능을 평가하였다.

Closed Walk Ferry Route Design for Wireless Sensor Networks

  • Dou, Qiang;Wang, Yong;Peng, Wei;Gong, Zhenghu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권10호
    • /
    • pp.2357-2375
    • /
    • 2013
  • Message ferry is a controllable mobile node with large capacity and rechargeable energy to collect information from the sensors to the sink in wireless sensor networks. In the existing works, route of the message ferry is often designed from the solutions of the Traveling Salesman Problem (TSP) and its variants. In such solutions, the ferry route is often a simple cycle, which starts from the sink, access all the sensors exactly once and moves back to the sink. In this paper, we consider a different case, where the ferry route is a closed walk that contains more than one simple cycle. This problem is defined as the Closed Walk Ferry Route Design (CWFRD) problem in this paper, which is an optimization problem aiming to minimize the average weighted delay. The CWFRD problem is proved to be NP-hard, and the Integer Linear Programming (ILP) formulation is given. Furthermore, a heuristic scheme, namely the Initialization-Split-Optimization (ISO) scheme is proposed to construct closed walk routes for the ferry. The experimental results show that the ISO algorithm proposed in this paper can effectively reduce the average weighted delay compared to the existing simple cycle based scheme.

Dynamic swarm particle for fast motion vehicle tracking

  • Jati, Grafika;Gunawan, Alexander Agung Santoso;Jatmiko, Wisnu
    • ETRI Journal
    • /
    • 제42권1호
    • /
    • pp.54-66
    • /
    • 2020
  • Nowadays, the broad availability of cameras and embedded systems makes the application of computer vision very promising as a supporting technology for intelligent transportation systems, particularly in the field of vehicle tracking. Although there are several existing trackers, the limitation of using low-cost cameras, besides the relatively low processing power in embedded systems, makes most of these trackers useless. For the tracker to work under those conditions, the video frame rate must be reduced to decrease the burden on computation. However, doing this will make the vehicle seem to move faster on the observer's side. This phenomenon is called the fast motion challenge. This paper proposes a tracker called dynamic swarm particle (DSP), which solves the challenge. The term particle refers to the particle filter, while the term swarm refers to particle swarm optimization (PSO). The fundamental concept of our method is to exploit the continuity of vehicle dynamic motions by creating dynamic models based on PSO. Based on the experiments, DSP achieves a precision of 0.896 and success rate of 0.755. These results are better than those obtained by several other benchmark trackers.

Optimizing the Joint Source/Network Coding for Video Streaming over Multi-hop Wireless Networks

  • Cui, Huali;Qian, Depei;Zhang, Xingjun;You, Ilsun;Dong, Xiaoshe
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권4호
    • /
    • pp.800-818
    • /
    • 2013
  • Supporting video streaming over multi-hop wireless networks is particularly challenging due to the time-varying and error-prone characteristics of the wireless channel. In this paper, we propose a joint optimization scheme for video streaming over multi-hop wireless networks. Our coding scheme, called Joint Source/Network Coding (JSNC), combines source coding and network coding to maximize the video quality under the limited wireless resources and coding constraints. JSNC segments the streaming data into generations at the source node and exploits the intra-session coding on both the source and the intermediate nodes. The size of the generation and the level of redundancy influence the streaming performance significantly and need to be determined carefully. We formulate the problem as an optimization problem with the objective of minimizing the end-to-end distortion by jointly considering the generation size and the coding redundancy. The simulation results demonstrate that, with the appropriate generation size and coding redundancy, the JSNC scheme can achieve an optimal performance for video streaming over multi-hop wireless networks.

The feasibility and properties of dividing virtual machine resources using the virtual machine cluster as the unit in cloud computing

  • Peng, Zhiping;Xu, Bo;Gates, Antonio Marcel;Cui, Delong;Lin, Weiwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권7호
    • /
    • pp.2649-2666
    • /
    • 2015
  • In the dynamic cloud computing environment, to ensure, under the terms of service-level agreements, the maximum efficiency of resource utilization, it is necessary to investigate the online dynamic management of virtual machine resources and their operational application systems/components. In this study, the feasibility and properties of the division of virtual machine resources on the cloud platform, using the virtual machine cluster as the management unit, are investigated. First, the definitions of virtual machine clusters are compared, and our own definitions are presented. Then, the feasibility of division using the virtual machine cluster as the management unit is described, and the isomorphism and reconfigurability of the clusters are proven. Lastly, from the perspectives of clustering and cluster segmentation, the dynamics of virtual machines are described and experimentally compared. This study aims to provide novel methods and approaches to the optimization management of virtual machine resources and the optimization configuration of the parameters of virtual machine resources and their application systems/components in large-scale cloud computing environments.

국산 CTP 판재 개발에 관한 연구 (The Study of the Domestic CTP Plate Development)

  • 하영백;최재혁;홍성규;오성상
    • 한국인쇄학회지
    • /
    • 제27권1호
    • /
    • pp.49-58
    • /
    • 2009
  • Computer to plate technology(CTP) have become fully commercial. The current wide range of computer to plate system and plate makes many potential customers insecure. This process which began around 1995 has now been successfully completed, so that a wide variety of high performance systems is available. The computer to plate method of producing printing plates eliminates films from the production process, thus reducing costs and shortening production times. To discover the optimization formulation of sensitized materials we were changed formulation of resin and violet solution in thermal sensitizers. Also we were analyzed the CTP plate's surface and the result of coating and development at each sample. we were analyzed the effects of development condition as temperature and speed, the plate wear of printing test in C, M, Y, Bk ink. This paper aims to find out suitable ways that we can develop a domestic CTP plate.

  • PDF

선형 및 일반형 침투깊이를 이용한 6자유도 햅틱 렌더링 알고리즘 (Six-degree-of-freedom Haptic Rendering using Translational and Generalized Penetration Depth Computation)

  • ;이영은;김영준
    • 로봇학회논문지
    • /
    • 제8권3호
    • /
    • pp.173-178
    • /
    • 2013
  • We present six-degree-of-freedom (6DoF) haptic rendering algorithms using translational ($PD_t$) and generalized penetration depth ($PD_g$). Our rendering algorithm can handle any type of object/object haptic interaction using penalty-based response and makes no assumption about the underlying geometry and topology. Moreover, our rendering algorithm can effectively deal with multiple contacts. Our penetration depth algorithms for $PD_t$ and $PD_g$ are based on a contact-space projection technique combined with iterative, local optimization on the contact-space. We circumvent the local minima problem, imposed by the local optimization, using motion coherence present in the haptic simulation. Our experimental results show that our methods can produce high-fidelity force feedback for general polygonal models consisting of tens of thousands of triangles at near-haptic rates, and are successfully integrated into an off-the-shelf 6DoF haptic device. We also discuss the benefits of using different formulations of penetration depth in the context of 6DoF haptics.

경로 탐색 기법과 강화학습을 사용한 주먹 지르기동작 생성 기법 (Punching Motion Generation using Reinforcement Learning and Trajectory Search Method)

  • 박현준;최위동;장승호;홍정모
    • 한국멀티미디어학회논문지
    • /
    • 제21권8호
    • /
    • pp.969-981
    • /
    • 2018
  • Recent advances in machine learning approaches such as deep neural network and reinforcement learning offer significant performance improvements in generating detailed and varied motions in physically simulated virtual environments. The optimization methods are highly attractive because it allows for less understanding of underlying physics or mechanisms even for high-dimensional subtle control problems. In this paper, we propose an efficient learning method for stochastic policy represented as deep neural networks so that agent can generate various energetic motions adaptively to the changes of tasks and states without losing interactivity and robustness. This strategy could be realized by our novel trajectory search method motivated by the trust region policy optimization method. Our value-based trajectory smoothing technique finds stably learnable trajectories without consulting neural network responses directly. This policy is set as a trust region of the artificial neural network, so that it can learn the desired motion quickly.

[ $C^1$ ] Continuous Piecewise Rational Re-parameterization

  • Liang, Xiuxia;Zhang, Caiming;Zhong, Li;Liu, Yi
    • International Journal of CAD/CAM
    • /
    • 제6권1호
    • /
    • pp.59-64
    • /
    • 2006
  • A new method to obtain explicit re-parameterization that preserves the curve degree and parametric domain is presented in this paper. The re-parameterization brings a curve very close to the arc length parameterization under $L_2$ norm but with less segmentation. The re-parameterization functions we used are $C^1$ continuous piecewise rational linear functions, which provide more flexibility and can be easily identified by solving a quadratic equation. Based on the outstanding performance of Mobius transformation on modifying pieces with monotonic parametric speed, we first create a partition of the original curve, in which the parametric speed of each segment is of monotonic variation. The values of new parameters corresponding to the subdivision points are specified a priori as the ratio of its cumulative arc length and its total arc length. $C^1$ continuity conditions are imposed to each segment, thus, with respect to the new parameters, the objective function is linear and admits a closed-form optimization. Illustrative examples are also given to assess the performance of our new method.

The Design of an Optimal Demand Response Controller Under Real Time Electricity Pricing

  • Jin, Young Gyu;Choi, Tae-Seop;Park, Sung Chan;Yoon, Yong Tae
    • Journal of Electrical Engineering and Technology
    • /
    • 제8권3호
    • /
    • pp.436-445
    • /
    • 2013
  • The use of a demand response controller is necessary for electric devices to effectively respond to time varying price signals and to achieve the benefits of cost reduction. This paper describes a new formulation with the form of constrained optimization for designing an optimal demand response controller. It is demonstrated that constrained optimization is a better approach for the demand response controller, in terms of the ambiguity of device operation and the practicality of implementation of the optimal control law. This paper also proposes a design scheme to construct a demand response controller that is useful when a system controller is already adapted or optimized for the system. The design separates the demand response function from the original system control function while leaving the system control law unchanged. The proposed formulation is simulated and compared to the system with simple dynamics. The effects of the constraints, the system characteristics and the electricity price are examined further.