• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.56-58
• /
• 2004

In this paper, we propose an adaptive beamforming algorithm for array antenna. The proposed beamforming algorithm is based on EDS (Euclidean Direction Search) algorithm. Generally LMS algorithm has a much slower rate of convergence, but its low computational complexity and robustness make it a representative method of adaptive beamforming. Although the RLS algorithm is known for its fast convergence to the optimal Wiener solution, it still suffers from high computational complexity and poor performance. The proposed EDS algorithm has a rapid convergence better than LMS algorithm, and has a computational more simple complexity than RLS algorithm. In this paper we compared the efficiency of the EDS algorithm with a standard LMS algorithm.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.7
• /
• pp.294-301
• /
• 2002

A new dynamic scheduling algorithm is proposed for CAN-based real-time system in this paper. The proposed algorithm is extended from an existing EDS(Earliest Deadline Scheduling) approach having a solution to the priority inversion. Using the proposed algorithm, the available bandwidth of network media can be checked dynamically, and consequently arbitration delay causing the miss of deadline can be avoided. Also, non-real time messages can be processed with their bandwidth allocation. Full network utilization and real-time transmission feasibility can be achieved through the algorithm. To evaluate the performance of algorithm, two simulation tests are performed. The first one is transmission data measurement per minute for periodic messages and the second one is feasibility in the system with both periodic messages and non-real time message.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2369-2373
• /
• 2001

Usually the static scheduling algorithms such as DMS (Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm haying a solution to the priority inversion. In the proposed algorithm, the available bandwidth of network media can be checked dynamically by all nodes. Through the algorithm, arbitration delay causing the miss of their deadline can be avoided in advance. Also non real-time messages can be processed with their bandwidth allocation. The proposed algorithm can achieve full network utilization and enhance aperiodic responsiveness, still guaranteeing the transmission of periodic messages.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.60.3-60
• /
• 2001

Usually the static scheduling algorithms such as DMS(Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm having a solution to the priority inverstion ....

• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.05a
• /
• pp.151-155
• /
• 2002

Memory의 공정기간은 2∼3개월 정도, 공정은 수백가지에 이를 정도로 많기에 defect은 존재할 수밖에 없다. 많은 defect이 있다면 어쩔 수 없겠지만 적은 defect이 발생한 경우에는 해당 die를 reject시키는 것보다는 repair해서 사용하는 것이 memory생산 업체 입장에서는 보다 효율적이고 원가 절감 차원에서 필수적이다. 이와 같은 이유로 laser repair라는 공정이 필요하고 laser repair공정의 정확한 target을 설정하기 위해 redundancy analysis가 필요하게 되었다. 지금까지 redundancy analysis는 장비 개발 업체에서 제공하는 경우가 대부분 이었고 각 장비 제조 업체별로 redundancy analysis algorithm을 개발하여 제공하여왔기에 동일한 defect 유형에 분석하는 redundancy analysis time이 각 장비 업체 별로 다른 경우가 대부분이었다. 이에 본 연구에서는 기존의 redundancy analysis algorithm의 개념에서 벗어나 defect 유형별로 simulation한 후 redundancy analysis를 진행함으로써 redundancy analysis에 소요되는 시간을 절약함으로써 원가 경쟁력 강화를 하고 correlation 개념을 업무에 적용하는데 목적이 있다

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1241-1248
• /
• 1998

The multicast scheme can improve the efficiency of multimedia retrieval service system, assuming that video transmission speed is faster than the playback rate and the store-and-play scheme. To best exploit the multicast benefits under bandwidth heterogeneous environment, we develop a multicast scheduling algorithm called MTS(Maximum Throughput Scheduling) which tries to maximize the amount of information transferred at each scheduling with subgrouping method. The MTS method compromises the multiple unicast method and the multicast method with lowest transmission rate. we compare the performance of MTS with that of MMS(Most Multicasting Scheduling) and EDS(Earliest Deadine Scheduling) via computer simulation. The performance results show that the MTS requires less number of service handlers to service the same number of subscribers.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.4
• /
• pp.262-269
• /
• 2003

An approach to compute characteristic curves such as section curves, reflection characteristic lines, and asymptotic curves on a surface is introduced. Each problem is formulated as a surface-plane inter-section problem. A single-valued function that represents the characteristics of a problem constructs a property surface on parametric space. Using a contouring algorithm, the property surface is intersected with a horizontal plane. The solution of the intersection yields a series of points which are mapped into object space to become characteristic curves. The approach proposed in this paper eliminates the use of traditional searching methods or non-linear differential equation solvers. Since the contouring algorithm has been known to be very robust and rapid, most of the problems are solved efficiently in realtime for the purpose of visualization. This approach can be extended to any geometric problem, if used with an appropriate formulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.4081-4098
• /
• 2022

With the aim of tackling the contradiction between computation intensive industrial applications and resource-weak Edge Devices (EDs) in Industrial Internet of Things (IIoT), a novel computation task offloading scheme in SDIN-enabled MEC based IIoT is proposed in this paper. With the aim of reducing the task accomplished latency and energy consumption of EDs, a joint optimization method is proposed for optimizing the local CPU-cycle frequency, offloading decision, and wireless and computation resources allocation jointly. Based on the optimization, the task offloading problem is formulated into a Mixed Integer Nonlinear Programming (MINLP) problem which is a large-scale NP-hard problem. In order to solve this problem in an accessible time complexity, a sub-optimal algorithm GPCOA, which is based on hybrid evolutionary computation, is proposed. Outcomes of emulation revel that the proposed method outperforms other baseline methods, and the optimization result shows that the latency-related weight is efficient for reducing the task execution delay and improving the energy efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.12
• /
• pp.1207-1215
• /
• 2013

This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots in consideration of obstacles. In order to match up targets with measured azimuths, to add to the depth-first search (DFS) algorithms in free-obstacle environment, we suggest the expanded DFS (EDS) algorithm including bypass path search, partial path search, middle level ending, and the supplementation of decision metric. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the error rate of estimated location, mean number of calculating nodes, and mean distance between real coordinates and estimated coordinates of the proposed algorithms.

• Membrane and Water Treatment
• /
• v.9 no.5
• /
• pp.363-371
• /
• 2018

In this work, it was investigated the usability of artificial bee colony (ABC) and genetic algorithm (GA) in modeling adsorption of Co(II) onto drinking water treatment sludge (DWTS). DWTS, obtained as inevitable byproduct at the end of drinking water treatment stages, was used as an adsorbent without any physical or chemical pre-treatment in the adsorption experiments. Firstly, DWTS was characterized employing various analytical procedures such as elemental, FT-IR, SEM-EDS, XRD, XRF and TGA/DTA analysis. Then, adsorption experiments were carried out in a batch system and DWTS's Co(II) removal potential was modelled via ABC and GA methods considering the effects of certain experimental parameters (initial pH, contact time, initial Co(II) concentration, DWTS dosage) called as the input parameters. The accuracy of ABC and GA method was determined and these methods were applied to four different functions: quadratic, exponential, linear and power. Some statistical indices (sum square error, root mean square error, mean absolute error, average relative error, and determination coefficient) were used to evaluate the performance of these models. The ABC and GA method with quadratic forms obtained better prediction. As a result, it was shown ABC and GA can be used optimization of the regression function coefficients in modeling adsorption experiments.