• 제목/요약/키워드: higher order algorithms

검색결과 213건 처리시간 0.028초

디스크 기반 그래프 엔진의 입출력 성능 향상을 위한 그래프 오더링 (Improving the I/O Performance of Disk-Based Graph Engine by Graph Ordering)

  • 임근학;김정현;이은재;서지원
    • 정보과학회 컴퓨팅의 실제 논문지
    • /
    • 제24권1호
    • /
    • pp.40-45
    • /
    • 2018
  • 빅데이터와 소셜 네트워크의 발전과 더불어 거대한 그래프를 처리하는 연구도 활발하게 진행되고 있다. 최근 그래프 처리의 성능 향상을 위해 Gorder 라는 그래프 오더링 기법이 제안되었다. 이 기법은 메모리 상의 그래프 레이아웃을 변형하여 데이터 접근 패턴을 CPU 캐시에 적합하게 바꿈으로써 성능을 향상시킨다. 하지만 그래프 알고리즘의 캐시 지역성에만 초점을 두고 설계되었기 때문에 디스크 기반 그래프 엔진에서는 적합하지 않고 전처리 비용도 크다는 문제점이 있다. 제시한 문제점을 해결하기 위해, 본 논문에서는 새로운 그래프 오더링인 I/O Order를 제안하였다. I/O Order는 디스크 기반의 그래프 엔진에서 지역성 외에 입출력 부하를 고려하여 설계되었다. 또한, 오더링 비용을 줄이기 위해 간단한 scheme을 사용한다. 본 논문에서 제시된 I/O Order는 Gorder와 비교해 전처리 비용이 최대 9.6배 감소하였고 성능은 지역성이 낮은 그래프 알고리즘에서 Random 대비 최대 2배 이상 향상되었다.

다단계 자동가공/조립제조시스템에서 다목표 작업제어 기법 (Operation control method for multiple objectives on multiple stages automated machining /assembly systems)

  • 최정상
    • 한국생산제조학회지
    • /
    • 제7권1호
    • /
    • pp.95-103
    • /
    • 1998
  • This paper is concentraed on a study of operation for multiple objectives in a automated manufacturing system with multiple machining cells . Largest Sum Processing-time First(LSPF) was developed in order to minimize makespan, mean flowtime and maximize mean utilization and compare with Ho and Chang's algorithm(HC) and Hunsucker and Shah's algorithm(HS). The results show that LSPF provides better soutions than HC at 78.2% and than HS at 67.8% of total problems to frequency . LSPF reduces 5.8% of makespan by HC and 22.1% of the value by HS and curtails 15.8% , 7.5% of mean flowtime by receptive algorithms(HC, HS). And mean utilization is also higher about 5.5% than HC and HS.

  • PDF

압전 감지기/작동기를 이용한 복합재 평판의 최적 진동제어 실험 (Optimal Vibration Control Experiments of Composite Plates Using Piezoelectric Sensor/Actuator)

  • 류근호;한재흥;이인
    • 소음진동
    • /
    • 제7권1호
    • /
    • pp.161-168
    • /
    • 1997
  • The present paper describes the vibration control experiment of composite plates with bonded piezoelectric sensor and actuator. The system is modeled as two degree-of-freedom system using modal coordinates and the system parameters are obtained from vibration tests. Kalman filter is adopted for extracting modal coordinates from sensor signal, and control algorithms applied to the system are Linear Quadratic Gaussian(LQG) control, Bang-Bang Control (BBC), Negative Velocity Feedback(NVF), Proportional Derivative Control(PDC). From observation of the spillover and control perfomance, it is concluded that a higher order control algorithm such as LQG rather than BBG, NVF, PDC is suitable for efficient simultaneous control of both bending and twisting modes of composite plates.

  • PDF

시뮬레이션을 이용한 물류 배송계획 시스템 개발에 관한 연구 (Design of the Simulation-Based Vehicle Distribution Planning System for Logistics)

  • 양병희;이영해
    • 산업공학
    • /
    • 제7권2호
    • /
    • pp.87-97
    • /
    • 1994
  • Many vehicle routing methods have been suggested, which minimize the routing distances of vehicles to reduce the total transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to develop a vehicle distribution planning system using heuristic algorithms and simulation techniques for home electronics companies. The vehicle distribution planning system developed by this study involves such complicated and stochastic conditions as one depot, multiple nodes(demand points), multiple vehicle types, multiple order items, and other many restrictions for operating vehicles. The proposed system is compared with the nearest neighbor method of the current system in terms of total logistics cost and driving time. This heuristics algorithm and simulation based distribution planning system is efficient in computational complexity, and give improved solutions with respect to the cost as well as the time. This method constructs a route with a minimum number of vehicles for a given demand.

  • PDF

A Robust Optimization Method Utilizing the Variance Decomposition Method for Electromagnetic Devices

  • Wang, Shujuan;Li, Qiuyang;Chen, Jinbao
    • Journal of Magnetics
    • /
    • 제19권4호
    • /
    • pp.385-392
    • /
    • 2014
  • Uncertainties in loads, materials and manufacturing quality must be considered during electromagnetic devices design. This paper presents an effective methodology for robust optimization design based on the variance decomposition in order to keep higher accuracy of the robustness prediction. Sobol' theory is employed to estimate the response variance under some specific tolerance in design variables. Then, an optimal design is obtained by adding a criterion of response variance upon typical optimization problems as a constraint of the optimization. The main contribution of this paper is that the proposed method applies the variance decomposition to obtain a more accurate variance of the response, as well save the computational cost. The performance and robustness of the proposed algorithms are investigated through a numerical experiment with both an analytic function and the TEAM 22 problem.

2차원적 음원추적에 관한 연구IV -음원위치의 근사적 결정법을 중심으로 - (A Study on 2-Dimensional Sound Source Tracking System IV - Mainly on Approximation of the Relative Bearing and Distance -)

  • 문성배;전승환
    • 한국항해학회지
    • /
    • 제25권4호
    • /
    • pp.371-379
    • /
    • 2001
  • We have reported the new measurement system which was substituted digital filter for the analog filter in order to develop the optimal system that could find the time delay between each sensors with high accuracy. And also we have confirmed through the experiments that the accuracy of measurements were differentiated by the methods what kind of digital filter had been adopted. This paper suggests two algorithms which approximate the sound source's bearing and distance. One is that sound source's relative bearing can be approximately regarded as the gradient of hyperbolic asymptote, the other is that the source's range can be approximated under the condition of a long range source relative to the sensor's interval. And a series of experiments were carried out with the source's distance 22.42meters and the random bearing interval within the limits of $-90^{\circ}$~$+90^{\circ}$. As a result, we have recognized that the approximation methods could measure the bearing and distance with higher accuracy than the method using trigonometric relation could do.

  • PDF

디지탈 릴레이 시뮬레이션 프로그램의 개발 (Development of Digital Relay Simulation Program)

  • 최상봉;신대승;문영환
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1992년도 하계학술대회 논문집 A
    • /
    • pp.51-54
    • /
    • 1992
  • Protection and control systems play a prominent part in avoiding power delivery interruptions and help to get a fast and secure restoration when a failure occurs. In order to meet the higher functional requirements on modern power system, protection speed, selectivity, sensitivity, dependability, and security are essential to ensure reliability. These functions on be satisfied by taking advantage of microprocessor and communication technologies, and digital protection relays (systems) have been developed and applied to real power system enhancing reliability and saving money. It is necessary to have a tool to analyze the functions and algorithms of digital relays for installing them to power system. The purpose of this study is to develop a digital relay simulation program to estimate digital relay performances during system faults. Components of digital protective relay including analog filter, sampling unit, digital filter, and relay logic are modeled in this program.

  • PDF

Efficient Algorithm and Architecture for Elliptic Curve Cryptographic Processor

  • Nguyen, Tuy Tan;Lee, Hanho
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제16권1호
    • /
    • pp.118-125
    • /
    • 2016
  • This paper presents a new high-efficient algorithm and architecture for an elliptic curve cryptographic processor. To reduce the computational complexity, novel modified Lopez-Dahab scalar point multiplication and left-to-right algorithms are proposed for point multiplication operation. Moreover, bit-serial Galois-field multiplication is used in order to decrease hardware complexity. The field multiplication operations are performed in parallel to improve system latency. As a result, our approach can reduce hardware costs, while the total time required for point multiplication is kept to a reasonable amount. The results on a Xilinx Virtex-5, Virtex-7 FPGAs and VLSI implementation show that the proposed architecture has less hardware complexity, number of clock cycles and higher efficiency than the previous works.

A Simulation Based Vehicle Distribution Planning System

  • 양병희;이영해
    • 한국국방경영분석학회지
    • /
    • 제22권2호
    • /
    • pp.182-199
    • /
    • 1996
  • Many vehicle routing methods have been suggested, which minimize the routing distances of vehicles to reduce the total transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to develop a vehicle distribution planning system using heuristic algorithms and simulation techniques for home electronics companies. The vehicle distribution planning system developed by this study involve so complicated and stochastic conditions such as one depot, multiple nodes(demand points), multiple vehicle types, multiple order items, and other many restrictions for operating vehicles. The proposed system is compared with the nearest neighbor method and the savings method in terms of total logistics cost and driving time. This heuristic algorithm and simulation based distribution planning system is efficient in computational complexity, and give improved solutions with respect to the cost as well as the time. This method constructs a route with a minimum number of vehicles for a given demand.

  • PDF

PSA: A Photon Search Algorithm

  • Liu, Yongli;Li, Renjie
    • Journal of Information Processing Systems
    • /
    • 제16권2호
    • /
    • pp.478-493
    • /
    • 2020
  • We designed a new meta-heuristic algorithm named Photon Search Algorithm (PSA) in this paper, which is motivated by photon properties in the field of physics. The physical knowledge involved in this paper includes three main concepts: Principle of Constancy of Light Velocity, Uncertainty Principle and Pauli Exclusion Principle. Based on these physical knowledges, we developed mathematical formulations and models of the proposed algorithm. Moreover, in order to confirm the convergence capability of the algorithm proposed, we compared it with 7 unimodal benchmark functions and 23 multimodal benchmark functions. Experimental results indicate that PSA has better global convergence and higher searching efficiency. Although the performance of the algorithm in solving the optimal solution of certain functions is slightly inferior to that of the existing heuristic algorithm, it is better than the existing algorithm in solving most functions. On balance, PSA has relatively better convergence performance than the existing metaheuristic algorithms.