• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.1
• /
• pp.81-90
• /
• 2004

The state assignment for a finite state machine greatly affects the delay, area, power dissipation, and testabilities of the sequential circuits. In order to improve the testabilities and power consumption, a new state assignment technique . based on m-block partition is introduced in this paper. By the m-block partition algorithm, the dependencies among groups of state variables are minimized and switching activity is further reduced by assigning the codes of the states in the same group considering the state transition probability among the states. In the sequel the length and number of feedback cycles are reduced with minimal switching activity on state variables. It is inherently contradictory problem to optimize the testability and power consumption simultaneously, however our new state assignment technique is able to achieve high fault coverage with less number of scan nfp flops by reducing the number of feedback cycles while the power consumption is kept low upon the low switching activities among state variables. Experiment shows drastic improvement in testabilities and power dissipation for benchmark circuits.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.946-953
• /
• 2017

Semantic Role Decision defines the semantic relationship between the predicate and the arguments in natural language processing (NLP) tasks. The semantic role information and semantic category information should be used to make Semantic Role Decisions. The Sejong Electronic Dictionary contains frame information that is used to determine the semantic roles. In this paper, we propose a method to extend the Sejong electronic dictionary using word embedding and synonyms. The same experiment is performed using existing word-embedding and retrofitting vectors. The system performance of the semantic category assignment is 32.19%, and the system performance of the extended semantic category assignment is 51.14% for words that do not appear in the Sejong electronic dictionary of the word using the word embedding. The system performance of the semantic category assignment is 33.33%, and the system performance of the extended semantic category assignment is 53.88% for words that do not appear in the Sejong electronic dictionary of the vector using retrofitting. We also prove it is helpful to extend the semantic category word of the Sejong electronic dictionary by assigning the semantic categories to new words that do not have assigned semantic categories.

• Journal of Korean Society of Transportation
• /
• v.25 no.6
• /
• pp.161-170
• /
• 2007

The purpose of this study is to find the solution that overcomes the existing assumption of symmetric cost functions in multi-class assignment. In the assignment problem, the assumption of a symmetric cost function means that the link cost is determined by each unique mode and is not affected by any other modes. In this study, the authors have applied a diagonalized algorithm and a heuristic model based on column generation to a multi-class assignment model and analyzed the result. Through the study, the authors found that the diagonalized algorithm produces equilibrium solutions by the initial convergence condition. In contrast to the diagonalized algorithm, the column generation algorithm has improved the solution model to overcome the problem of equilibrium solutions in the diagonalized algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1447-1457
• /
• 1999

본 논문에서는 일반적인 네트워크에서 적응력 있는(adaptive) 분산형 시스템 레벨 결함 진단을 위한 분할 기법을 제안한다. 적응력 있는 분산형 시스템 레벨 결함 진단 기법에서는 시스템의 형상이 변경될 때마다 시험 할당 알고리즘이 수행되므로 적응력 없는 결함 진단 기법에 비하여 결함 감지를 위한 시험의 갯수를 줄일 수 있다. 기존의 시험 할당 알고리즘들은 전체 시스템을 대상으로 하는 비분할(non-partitioning) 방식을 이용하였는데, 이 기법은 불필요한 과다한 메시지를 생성한다. 본 논문에서는 전체 시스템을 이중 연결 요소(biconnected component) 단위로 분할한 후, 시험 할당은 각 이중 연결 요소 내에서 수행한다. 이중 연결 요소의 관절점(articulation point)의 특성을 이용하여 각 시험 할당에 필요한 노드의 수를 줄임으로서, 비분할 기법들에 비해 초기 시험 할당에 필요한 메시지의 수를 감소시켰다. 또한 결함이 발생한 경우나 복구가 완료된 경우의 시험 재 할당은 직접 영향을 받는 이중 연결 요소내로 국지화(localize) 시켰다. 본 논문의 시스템 레벨 결함 진단 기법의 정확성을 증명하였으며, 기존 비분할 방식의 시스템 레벨 결함 진단 기법과의 성능 분석을 수행하였다.Abstract We propose an adaptive distributed system-level diagnosis using partitioning method in arbitrary network topologies. In an adaptive distributed system-level diagnosis, testing assignment algorithm is performed whenever the system configuration is changed to reduce the number of tests in the system. Existing testing assignment algorithms adopt a non-partitioning approach covering the whole system, so they incur unnecessary extra message traffic and time. In our method, the whole system is partitioned into biconnected components, and testing assignment is performed within each biconnected component. By exploiting the property of an articulation point of a biconnected component, initial testing assignment of our method performs better than non-partitioning approach by reducing the number of nodes involved in testing assignment. It also localizes the testing reassignment caused by system reconfiguration within the related biconnected components. We show that our system-level diagnosis method is correct and analyze the performance of our method compared with the previous non-partitioning ones.

• Journal of Korean Society of Transportation
• /
• v.26 no.2
• /
• pp.89-100
• /
• 2008

In an urban network controlled by traffic signals, there is an interaction between the signal timing and the routes chosen by individual road users. This study develops a bi level programming model for traffic signal optimization in networks with path based traffic assignment. In the bi level programming model, genetic algorithm approach has been proposed to solve upper level problem for a signalized road network. Path based traffic assignment using column generation technique which is proposed by M.H. Xu, is applied at the lower-level. Genetic Algorithm provieds a feasible set of signal timings within specified lower and upper bounds signal timing variables and feeds into lower level problem. The performance of this model is investigated in numerical experiment in a sample network. In result, optimal signal settings and user equilibrium flows are made.

• The Journal of the Korea Contents Association
• /
• v.18 no.8
• /
• pp.118-126
• /
• 2018

In order to dominate the multiple-targets of high threat in the initial stage of combat, it is necessary to maximize the combat effect by rapidly firing as many weapons as possible within a short time. Therefore, it is mandatory to establish the effective weapon allocation and utilize them for the combat. In this paper, we propose a weapon assignment algorithm for rapid reaction in multi-target and multi-weapon environments. The proposed algorithm maximizes the combat effect by establishing the fire plan that enables the rapid action with the operation of low complexity. To show the superiority of our algorithm, we implement the evaluation and verification of performances through the simulation and visualization of our algorithm. Our experimental results show that the proposed algorithm perform the effective weapon assignment, which shows the high target assignment rate within the fast hour even under the large-scale battle environments. Therefore, our proposed scheme are expected to be highly useful when it is applied to real weapon systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.568-576
• /
• 2011

In this paper, a channel assignment technique to mitigate interferences due to ISI(Inter Symbol Interference) and ICI(Inter Carrier Interference) caused by TDoA(Time Difference of Arrival) among distributed MRs(Mesh Routers) in OFDMA(Orthogonal Frequency Division Multiple Access)-based WMN(Wireless Mesh Network) is proposed. The SINR(Signal to Interference and Noise Ratio) associated with the channel assignment for each MR is defined to minimize the effect of ISI and ICI due to TDoA in WMN, which is then used to propose an channel assignment technique considering fairness constraint. It is verified by computer simulation that the proposed channel assignment technique can improve the performance of BER(Bit Error Rate) in WMNs with compared to the conventional technique.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.40 no.11
• /
• pp.988-996
• /
• 2012

This paper presents a distributed task assignment algorithm for the suppression of enemy air defense (SEAD) mission of heterogeneous UAVs, based on the consensus-based bundle algorithm (CBBA). SEAD mission can be modeled as a task assignment problem of multiple UAVs performing multiple air defense targets, and UAVs performing SEAD mission consist of the weasel for destruction of enemy's air defense system and the striker for the battle damage assessment (BDA) or other tasks. In this paper, a distributed task assignment algorithm considering path-planning in presence of terrain obstacle is developed for heterogeneous UAVs, and then it is applied to SEAD mission. Through numerical simulations the performance and the applicability of the proposed method are tested.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1514-1523
• /
• 2009

It is well known that the current wireless sensor networks addressing methods do not work efficiently in networks more than a few hundred nodes. A standard protocol in ZigBee-Standard feature in ZigBee 2007 gives balanced tree based address assignment method with distributed manner. However, it was limited to cover less than hundreds of sensor nodes due to the wasteful use of available address space, because composed sensor networks usually make an unbalanced tree topology in the real deployment. In this paper, we proposed the hierarchical cluster tree based address assignment method to support large and scalable networks. This method provides unique address for each node with distributed manner and supports hierarchical cluster tree on-demand. Simulation results show that the proposed method reduces orphan nodes due to the address exhaustion and supports larger network with limited address space compared with the ZigBee distributed address assignment method defined in ZigBee-Standard feature in ZigBee 2007.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.7
• /
• pp.30-37
• /
• 2002

In this paper, we propose a new adaptive slot assignment algorithm called In-VDSA in order to guarantee the QoS(Quality of Service) of VBR(Variable Bit Rate) traffics in wireless ATM and maximize efficiency in use of wireless channels. In the proposed algorithm, the status of terminal buffers is encoded in signed number on the GFC(Generic Flow Control) field of an ATM cell header and piggybacked. And also, the number of slots to be assigned to the next frame is adjusted effectively, which is different to methods in the conventional slot assignment algorithms. As a result, we can guarantee QoS such as CLR(Cell Loss Rate) and cell delay and achieve the higher utilization of channels. The validity of the proposed algorithm has been justified in performance by analysis through simulation results using the BONeS tool and comparison with conventional methods.