• 한국통신학회논문지
• /
• 제29권6A호
• /
• pp.667-667
• /
• 2004

위성망과 같이 DBP(Delay Bandwidth Product)가 큰 고속망에서 전송 지구국의 버퍼는 일시적인 막힘 현상에 의한 전송 효율이 저하되는 것을 방지하기 위하여 큐 현상을 충분히 소화하도록 설계되어야 한다. 뿐만 아니라 버퍼의 어떠한 상태 하에서도 막힘 없는 유연한 전송 패킷의 흐름과 수많은 연결 트래픽 간의 공정성을 보장하고 접속 서비스의 특성에 따라서 정의되는 QOS를 충족시키는 기술이 중요하다. 기존의 버퍼알고리즘들은 여러 네트워크 환경의 다양한 변화에 적절히 대응하지 못하여 위성망과 같은 특수한 네트워크에 적합하지 않다. Floyd에 의해 제안된 RED(Random Early Detection) 알고리즘은 기존의 버퍼 알고리즘과 비교하여 뛰어난 버퍼관리 성능을 보여왔다. 하지만 RED 알고리즘 방식은 TCP 패킷의 연결 수나 네트워크의 변화에 적절히 대응하지 못하여 위성망과 같이 다수의 사용자가 동시 다발적으로 발생할 수 있는 환경에서는 적합하지 못하다. 본 논문에서는 입력 비율에 따라 향상된 버퍼 활용도를 가진 TARED(Target Adaptive REB) 알고리즘이 위성망을 포함한 네트워크 환경에서 향상된 성능을 보이고 제안된 TARED 알고리즘을 이용하면 입력 비율에 따른 버퍼의 점유 레벨의 오버플로우나 언더플로우가 없이 전체 시스템의 성능을 향상시킴과 동시에 네트워크의 적응능력과 시스템의 안정화에 우수함을 보일 수 있었다.

• 한국통신학회논문지
• /
• 제29권6A호
• /
• pp.666-676
• /
• 2004

위성망과 같이 DBP(Delay Bandwidth Product)가 큰 고속망에서 전송 지구국의 버퍼는 일시적인 막힘 현상에 의한 전송 효율이 저하되는 것을 방지하기 위하여 큐 현상을 충분히 소화하도록 설계되어야 한다. 뿐만 아니라 버퍼의 어떠한 상태 하에서도 막힘 없는 유연한 전송 패킷의 흐름과 수많은 연결 트래픽 간의 공정성을 보장하고 접속 서비스의 특성에 따라서 정의되는 QOS를 충족시키는 기술이 중요하다. 기존의 버퍼알고리즘들은 여러 네트워크 환경의 다양한 변화에 적절히 대응하지 못하여 위성망과 같은 특수한 네트워크에 적합하지 않다. Floyd에 의해 제안된 RED(Random Early Detection) 알고리즘은 기존의 버퍼 알고리즘과 비교하여 뛰어난 버퍼관리 성능을 보여왔다. 하지만 RED 알고리즘 방식은 TCP 패킷의 연결 수나 네트워크의 변화에 적절히 대응하지 못하여 위성망과 같이 다수의 사용자가 동시 다발적으로 발생할 수 있는 환경에서는 적합하지 못하다. 본 논문에서는 입력 비율에 따라 향상된 버퍼 활용도를 가진 TARED(Target Adaptive REB) 알고리즘이 위성망을 포함한 네트워크 환경에서 향상된 성능을 보이고 제안된 TARED 알고리즘을 이용하면 입력 비율에 따른 버퍼의 점유 레벨의 오버플로우나 언더플로우가 없이 전체 시스템의 성능을 향상시킴과 동시에 네트워크의 적응능력과 시스템의 안정화에 우수함을 보일 수 있었다.

• 대한조선학회논문집
• /
• 제53권2호
• /
• pp.115-126
• /
• 2016

In the process of ship building, it is known that the maintenance of working period and saving cost are one of the important part during the logistics of blocks transportation. Precise operational planning inside the shipyard plays a big role for a smooth transportation of blocks. But many problems arise in the process of block transportation such as the inevitable road damage during the transportation of the blocks, unpredictable stockyard utilization of the road associated with a particular lot number, addition of unplanned blocks. Therefore, operational plan needs to be re-established frequently in real time for an efficient block management. In order to find the shortest path between lot numbers, there are several representative methods such as Floyd algorithm that has the characteristics of many-to-many mapping, Dijkstra algorithm that has the characteristic of one-to-many mapping, and the A* algorithm which has the one-to-one mapping, but many authors have published without the mutual comparisons of these algorithms. In this study, some appropriate comparison have been reviewed about the advantages and disadvantages of these algorithms in terms of precision and cost analysis of calculating the paths and planning system to operate the transporters. The flexible operating plan is proposed to handle a situation such as damaged path, changing process during block transportation. In addition, an operational algorithm of a vacant transporter is proposed to cover the shortest path in a minimum time considering the situation of transporter rotation for practical use.

• 한국정보통신학회논문지
• /
• 제24권3호
• /
• pp.378-383
• /
• 2020

Viola & Jones의 객체 검출 알고리즘은 얼굴 요소 검출을 위한 매우 우수한 알고리즘이지만 변수 설정에 따른 중복 검출, 오 검출, 미 검출 같은 문제들이 여전히 존재한다. 본 논문은 Viola & Jones의 객체 검출 알고리즘에 미 검출을 줄이기 위한 가변 변수와 중복 검출과 오 검출을 줄이기 위한 검증을 적용한 개선된 얼굴 요소 검출 알고리즘을 제안한다. 제안된 알고리즘은 잠재적 유효 얼굴 요소들을 검출할 때까지 Viola & Jones의 객체 검출의 변수 값을 변화시켜 미 검출을 줄이고, 검출된 얼굴 요소의 크기, 위치, 유일성을 평가하는 검증을 이용해 중복 검출과 오 검출들을 제거시켜 준다. 시뮬레이션 결과들은 제안된 알고리즘이 검출된 객체들에 유효 얼굴 요소들을 포함시키고 나서 무효 얼굴 요소들을 제거하여 유효 얼굴 요소들만을 검출하는 것을 보여준다.

• 품질경영학회지
• /
• 제50권2호
• /
• pp.265-286
• /
• 2022

Purpose: The time and cost of a project activity exists in a selected mode and there is a quality level for the selected mode, and the time and cost of the current activity is determined by the quality level of the preceding activity. When an activity is a predecessor activity of an activity, it is characterized as a trade-off problem in which the time and cost of the activity are determined according to the quality level of the activity. Methods: A neighbor search heuristic algorithm obtains a solution by (1) randomly determining the mode, quality level, and assignment order for each activity. (2) get a solution by improving the solution by changing the possible modes and quality levels; (3) to find a solution by improving the solution from the point where it is feasible to advance the start time. Here, Case[1] is a method to find the optimal solution value after repeating (1). Case [2] is a method for finding a solution including (1) and (2). Case [3] refers to a method for finding solutions including (1), (2), and (3). Results: It can be seen that the value of the objective function presented by the algorithm changes depending on how the model of the heuristic algorithm is designed and applied. In other words, it suggests the importance of algorithm design and proves the importance of the quality problem of activities in the project schedule. Conclusion: A study significance of the optimization algorithm and the heuristic algorithm was applied to the effect of the quality of the preceding activity on the duration and cost of itself and the succeeding activity, which was not addressed in the project schedule problem.

• ETRI Journal
• /
• 제30권1호
• /
• pp.129-140
• /
• 2008

In this paper, we propose a novel ant colony optimization (ACO)-based test scheduling method for testing network-on-chip (NoC)-based systems-on-chip (SoCs), on the assumption that the test platform, including specific methods and configurations such as test packet routing, generation, and absorption, is installed. The ACO metaheuristic model, inspired by the ant's foraging behavior, can autonomously find better results by exploring more solution space. The proposed method efficiently combines the rectangle packing method with ACO and improves the scheduling results by dynamically choosing the test-access-mechanism widths for cores and changing the testing orders. The power dissipation and variable test clock mode are also considered. Experimental results using ITC'02 benchmark circuits show that the proposed algorithm can efficiently reduce overall test time. Moreover, the computation time of the algorithm is less than a few seconds in most cases.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2209-2212
• /
• 2003

In this paper, we propose the method to extract the important frequency bands from the EMG signal, and for generation of feature vector using the important frequency bands. The EMG signal is measured with 4 sensor and is recorded as 4 channel’s time series data. The same frequency bands from 4 channel’s frequency components are selected as the important frequency bands. The feature vector is calculated by the function formed using the combination of selected same important frequency bands. The EMG signals acquired from seven wrist motion type are recognized by changing into the feature vector formed. Then, the extraction and generation is performed by using the double combination of the genetic algorithm (GA) and the neural network (NN). Finally, in order to illustrate the effectiveness of the proposed method, computer simulations are done.

• 산업공학
• /
• 제22권1호
• /
• pp.85-94
• /
• 2009

Nowadays, most of the major manufacturing companies prepare their manufacturing schedule using package based solutions. Even though the accuracy of the detail scheduling result is high at implementation, however, it is low during maintenance period. The main cause of low accuracy during maintenance period is due to difficulties in maintaining the accurate level of master data. In this paper, we propose to easily maintain setup time, which is one of the most important factors required in master data to achieve good scheduling result, after changing job. This paper is mainly focused on how to deduce the factors that influence the setup time in a roll-based manufacturing field with print operations. For this purpose, we employed rule based algorithm and applied for deciding setup time for the existing product items. Likewise, it can be applied to new items without any complex setup procedures, and, finally, it displays the result of the real setup-time and calculated setup-time.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.72-75
• /
• 2004

In this paper, the task assignment strategy considering communication delay and the priority of distributed tasks is proposed for the real-time network system in order to maximize the utilization of the system. For the task assignment strategy, the relationship among priority of tasks in network nodes, the calculation time of each task, and the end-to-end response time including the network delay is formulated firstly. Then, the task assignment strategy using the genetic algorithm is proposed to optimize the utilization of the system considering the LCM(Least Common Multiple) period. The effectiveness of proposed strategy is proven by the simulation for estimating the performance such as the utilization and the response time of the system in case of changing the number of tasks and the number of network nodes.

• 전기학회논문지
• /
• 제57권3호
• /
• pp.421-428
• /
• 2008

The DVS(Dynamic Voltage Scaling) technique is the method to reduce the dynamic energy consumption. As using slack times, it extends the execution time of the big load operations by changing the frequency and the voltage of variable voltage processors. Researches, that controlling the energy consumption of the processors and the data transmission among processors by controlling the bandwidth to reduce the energy consumption of the entire system, have been going on. Since operations in multiprocessor systems have the data dependency between processors, however, the DVS techniques devised for single processors are not suitable to improve the energy efficiency of multiprocessor systems. We propose the new scheduling algorithm based on DVS for increasing energy efficiency of multiprocessor systems. The proposed DVS algorithm can improve the energy efficiency of the entire system because it controls frequency and voltages having the data dependency among processors.