• 전자공학회논문지A
• /
• 제33A권2호
• /
• pp.196-204
• /
• 1996

This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2003년도 추계학술대회
• /
• pp.129-142
• /
• 2003

The SCM is that Supply Chain Network is Promptly and Voluntarily Optimized in Unstable Market Change Environment. The Cash flow Efficiency of Hole Supply Chain Network is Improved by Changing the Information and Changing the Foundation of Business Processes. The Role of WMS has been Changing Importantly with the Introduction of SCM. WMS Needed to Change to the Information Center in Order to Change Information in Real Time and the WMS of Information Storing in Order to Support an Idea Decision. This Development was Defined about the Importance of WMS in SCM Environment. The Criterion of Valuation is Normally Measured Time between Taking a Order Receive and Bringing the Items to Customer. The Decreasing Move Time of Order Picker in Warehouse is Directly Influence to the Job Execution. So, this Research is Defined about the Optimized Route of Order Picker and Suggests Algorithm. To do this, Past Algorithm is Studied. It's Easy to Introduce and this Study is Looking for Method about the Noticing of Order Picker. The Algorithm will Improve to be Adapt to Standard Process System.

• 한국차세대컴퓨팅학회논문지
• /
• 제15권5호
• /
• pp.7-19
• /
• 2019

랜섬웨어(ransomware)는 사용자 데스크톱의 파일들을 암호화한 뒤, 복호화 비용을 요구하는 악성 프로그램이다. 랜섬웨어 공격의 빈도와 피해금액은 매년 증가하고 있기 때문에 랜섬웨어 예방과 탐지 및 복구 시스템이 필요하다. 본 논문에서는 Baek 등이 제안한 랜섬웨어 탐지 알고리즘인 SSD-Insider가 덮어쓰기 검사를 위해 사용하는 해시테이블을 블룸 필터로 교체한 AdvanSSD-Insider 알고리즘을 제안한다. 실험 결과 AdvanSSD-Insider 알고리즘은 SSD-Insider 알고리즘에 비해 메모리 사용량이 최대 90%, 수행시간이 최대 77% 감소하였고 동일한 탐지 정확도를 얻었다. 또한 SSD-Insider 알고리즘과 동일한 조건의 메모리 사용량으로 AdvanSSD-Insider 알고리즘은 10배 더 긴 시간을 관찰할 수 있으며, 이를 통해 기존에 탐지하기 어려웠던 랜섬웨어에 대해 탐지 정확도가 증가하는 결과를 얻었다.

• 한국정보통신학회논문지
• /
• 제23권5호
• /
• pp.596-603
• /
• 2019

무선 센서 네트워크에서 배치된 노드의 기능을 변경하거나 갱신하기 위해 노드의 소프트웨어 코드를 업데이트하는 재프로그래밍 동작은 필수적이다. 본 논문은 무선 센서 네트워크에서 노드의 재프로그래밍을 목적으로 노드의 전송에너지를 최소화하는 최적화 알고리즘을 제안한다. 또한 네트워크의 수명을 오래 유지하기 위해 전체 노드의 에너지 소모를 균형있게 유지하도록 알고리즘을 설계한다. 본 논문에서는 많은 수의 노드가 배치된 무선 센서 네트워크에서 전송에너지의 최소화와 에너지 소모의 균형화를 위해 새로운 이웃해 생성방식을 가진 타부서치 알고리즘을 제안한다. 제안된 알고리즘은 적정한 수행 시간 내에 최적의 결과를 도출하도록 설계되었다. 제안된 타부서치 알고리즘의 성능은 노드의 전송에너지와 남은 에너지, 알고리즘 수행시간 측면에서 평가되었으며, 성능 평가 결과에서 이전의 방식에 비해 우수한 성능을 보였다.

• Management Science and Financial Engineering
• /
• 제10권2호
• /
• pp.1-28
• /
• 2004

The integrated supply chain of business partners for e-Commerce in cyber space is defined as Logistics Chain if the cooperative activities are logistics-related. Logistics Chain could be managed effectively and efficiently by cooperative technologies of logistics chain execution. In this paper, we propose a routing and scheduling algorithm based on the Tabu search by adding geographical information into existing constraint for pick-up and delivery process to minimize service time and cost in logistics chain. And, we also consider an uncertainty processing for the tracing of moving object to control pick-up and delivery vehicles based on GPS/GIS/ITS. Uncertainty processing is required to minimize amount of telecommunication and database on vehicles tracing. Finally, we describe the Logistics Chain Execution (LCE) system to perform plan and control activities for postal logistics chain. To evaluate practical effects of the routing and scheduling system, we perform a pretest for the performance of the tabu search algorithm. And then we compare our result with the result of the pick-up and delivery routing plan generated manually by postmen.

• 전기학회논문지
• /
• 제57권7호
• /
• pp.1150-1156
• /
• 2008

This paper introduces the PC clustering of the SIMD structure for a distributed processing of on-line contingency to assess a static security of a power system. To execute on-line contingency analysis of a large-scale power system, we need to use high-speed execution device. Therefore, we constructed PC-cluster system using PC clustering method of the SIMD structure and applied to a power system, which relatively shows high quality on the high-speed execution and has a low price. SIMD(single instruction stream, multiple data stream) is a structure that processes are controlled by one signal. The PC cluster system is consisting of 8 PCs. Each PC employs the 2 GHz Pentium 4 CPU and is connected with the others through ethernet switch based fast ethernet. Also, we consider N-1 line contingency that have high potentiality of occurrence realistically. We propose the distributed process algorithm of the SIMD structure for reducing too much execution time on the on-line N-1 line contingency analysis in the large-scale power system. And we have verified a usefulness of the proposed algorithm and the constructed PC cluster system through IEEE 39 and 118 bus system.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1700-1708
• /
• 2006

Since the most program execution time is consumed in a loop structure, extracting parallelism from loop programs is critical for the taster program execution. In this paper, we proposed data dependency removal method for a single loop. The data dependency removal method can be applied to uniform and non-uniform data dependency distance in the single loop. Procedure calls parallelisms with only a single loop structure or procedure call most of other methods are concerned with the uniform code within the uniform data dependency distance. We also propose an algorithm, which can be applied to uniform, non-uniform, and complex data dependency distance among the multiple procedures. We compared our method with conventional methods using CRAY-T3E for the performance evaluation. The results show that the proposed algorithm is effective.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 합동 추계학술대회 논문집 정보 및 제어부문
• /
• pp.282-285
• /
• 2002

In this paper, we designed of low power system by using dynamic scaling. As an effective low-power design, dynamic voltage/frequency scaling recently has received a lot of attention. In dynamic frequency scheme, all execution cycles are driven by the clock frequency that switched frequency dynamically at run time. The algorithm schedules lower frequency operators at earlier steps and higher frequency operators to later steps. This algorithm assigned the frequency for each execution cycle then it adjusted the voltage associated with the frequency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.78-101
• /
• 2017

High-quality industrial control is critical to ensuring production quality, reducing production costs, improving management levels and stabilizing equipment and long-term operations. WiFi-based Long Distance (WiLD) networks have been used as remote industrial control networks. Real-time performance is essential to industrial control. However, the original mechanism of WiLD networks does not minimize end-to-end delay and restricts improvement of real-time performance. In this paper, we propose two algorithms to obtain the transmitting/receiving phase cycle length for each node such that real time constraints can be satisfied and phase switching overhead can be minimized. The first algorithm is based on the branch and bound method, which identifies an optimal solution. The second is a fast heuristic algorithm. The experimental results show that the execution time of the algorithm based on branch and bound is less than that of the heuristic algorithm when the network is complex and that the performance of the heuristic algorithm is close to the optimal solution.

• 대한음성학회지:말소리
• /
• 제57호
• /
• pp.85-97
• /
• 2006

This paper suggests an algorithm that can estimate the direction of the sound source in real time. The algorithm uses the time difference and sound intensity information among the recorded sound source by four microphones. Also, to deal with noise of robot itself, the Kalman filter is implemented. The proposed method can take shorter execution time than that of an existing algorithm to fit the real-time service robot. Also, using the Kalman filter, signal ratio relative to background noise, SNR, is approximately improved to 8 dB. And the estimation result of azimuth shows relatively small error within the range of ${\pm}7$ degree.