• IEIE Transactions on Smart Processing and Computing
• /
• 제2권4호
• /
• pp.208-215
• /
• 2013

Early iterations of the existing Global Positioning System (GPS)-based or radio lateration technique-based vehicle localization algorithms suffer from flip ambiguities, forged relative location information and location information exchange overhead, which affect the subsequent iterations. This, in turn, results in an erroneous neighbor-vehicle map. This paper proposes an extended information overlap measure (EIOM) algorithm to reduce the flip error rates by exchanging the neighbor-vehicle presence features in binary information. This algorithm shifts and associates three pieces of information in the Moore neighborhood format: 1) feature information of the neighboring vehicles from a vision-based environment sensor system; 2) cardinal locations of the neighboring vehicles in its Moore neighborhood; and 3) identification information (MAC/IP addresses). Simulations were conducted for multi-lane highway scenarios to compare the proposed algorithm with the existing algorithm. The results showed that the flip error rates were reduced by up to 50%.

• 디지털융복합연구
• /
• 제13권10호
• /
• pp.343-351
• /
• 2015

현재 M2M 환경은 다양한 서비스가 기관 및 기업이나 일상생활로 확대되면서 관련 기술의 보안 취약성 발생 가능성이 이슈화되고 있다. 본 논문은 이러한 보안 취약성 문제를 해결하기 위해 M2M 환경의 디바이스 키 보호를 위한 암호 알고리즘 응용 기법을 제안한다. 제안 기법은 타원곡선 암호 기반으로 초기 키 교환과 서명 교환을 통해 보안 세션을 생성하였고, 화이트박스 암호는 보안 세션 키를 이용하여 화이트박스 테이블을 생성하는 암호화에 응용하였다. 암호 알고리즘 적용 결과, 타원곡선 암호는 통신 세션에 대한 경량 화된 상호인증, 세션 키 보호를 제공하고, 화이트 박스 암호는 기존 암호 알고리즘과는 다른 방식으로 암호화에 사용되는 세션 키 보호를 보장하였다. 제안하는 프로토콜은 데이터변조 및 노출, 중간자 공격, 데이터 위조 및 변조 공격에 대해 안전한 장점이 있다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1544-1549
• /
• 2004

A new collision avoidance algorithm is presented for two mobile robots in narrow corridor environments. When two robots meet each other in a narrow corridor, one should yield the way to the other robot. To solve the problem arising in this situation, they exchange their path to get information about crossing-points to check avoidance conditions, which are necessary for choosing the robot to yield. The conditions are summarized as follows. 1) If one robot blocks the path to the closest crossing-point in front of the other robot. 2) If the closest crossing-point of each robot is the same point. 3) Which robot is closer to the closest crossing-point. In this paper, we propose a path planning algorithm for the robot which yield the way. Simulation results are presented to verify the feasibility of the proposed collision avoidance algorithm.

• International Journal of Automotive Technology
• /
• 제6권4호
• /
• pp.429-436
• /
• 2005

In this paper, operation algorithms are evaluated for a fuel cell hybrid electric vehicle (FCHEV). Power assist, load leveling and equivalent fuel algorithm are proposed and implemented in the FCHEV performance simulator. It is found from the simulation results that the load leveling algorithm shows poor fuel economy due to the system charge and discharge efficiency. In the power assist and equivalent fuel algorithm, the fuel cell stack is operated in a relatively better efficiency region owing to the battery power assist, which provides the improved fuel economy.

• International Journal of Contents
• /
• 제7권1호
• /
• pp.1-7
• /
• 2011

A new power control algorithm for wireless communication which can be applied to various near distance communications and USN/RFID systems is proposed. This technique has been applied and tested to lithium coin battery operated UHF/microwave transceiver systems to show extremely long communication life time without battery exchange. The power control algorithm is based on the dynamic prediction method of arrival time for incoming packet at the receiver. We obtain 16mA current consumption in the TX module and 20mA current consumption in the RX module. The advantage provided by this method compared to others is that both master transceiver and slave transceiver can be low power consumption system.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2001년도 추계학술대회 논문집
• /
• pp.191-194
• /
• 2001

We consider a postal transportation planning in the transportation network of the form of hub and spoke. Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is Proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is acceptable.

• 한국통신학회논문지
• /
• 제11권3호
• /
• pp.217-226
• /
• 1986

DQSM알고리즘을 이용하여 다중채널 FIR디지털 필터를 구성하기 위한 한 기법을 제안하였다. 본 논문에서는 Double precision 알고리즘과 절대치회로를 이용하여 ROM용량을 감소시키고 절대치회로의 논리레벨의 단계를 줄이므로 동작속도를 개선할 수 있었다. 위의 기법으로 구성된 4채널 FIR디지탈필터의 주파수응답은 Remez exchange 알고리즘으로 시뮬레이션하여 얻어진 주파수응답과 잘 일치하였다.

• 유통과학연구
• /
• 제12권3호
• /
• pp.33-41
• /
• 2014

Purpose - The purpose of this study was to predict the selection of independent auditors in the companies listed on the Tehran Stock Exchange (TSE) using a combination of PSO algorithm and CART. This study involves applied research. Design, approach and methodology - The population consisted of all the companies listed on TSE during the period 2005-2010, and the sample included 576 data specimens from 95 companies during six consecutive years. The independent variables in the study were the financial ratios of the sample companies, which were analyzed using two data mining techniques, namely, PSO algorithm and CART. Results - The results of this study showed that among the analyzed variables, total assets, current assets, audit fee, working capital, current ratio, debt ratio, solvency ratio, turnover, and capital were predictors of independent auditor selection. Conclusion - The current study is practically the first to focus on this topic in the specific context of Iran. In this regard, the study may be valuable for application in developing countries.

• Journal of Information Processing Systems
• /
• 제15권6호
• /
• pp.1503-1516
• /
• 2019

In this paper, to improve the accuracy of long sentence similarity calculation, we proposed a sentence similarity calculation method based on a system similarity function. The algorithm uses word2vector as the system elements to calculate the sentence similarity. The higher accuracy of our algorithm is derived from two characteristics: one is the negative effect of penalty item, and the other is that sentence similar function (SSF) based on word2vector similar elements doesn't satisfy the exchange rule. In later studies, we found the time complexity of our algorithm depends on the process of calculating similar elements, so we build an index of potentially similar elements when training the word vector process. Finally, the experimental results show that our algorithm has higher accuracy than the word mover's distance (WMD), and has the least query time of three calculation methods of SSF.

• 산업경영시스템학회지
• /
• 제21권45호
• /
• pp.165-180
• /
• 1998

To make a scheduling for minimizing the tardiness of delivery, we present an efficient heuristic algorithm for job-shop scheduling problems with due dates. The SDME(Slack Degree Modified Exchange) algorithm, which is the proposed heuristic algorithm, carries out the operation in two phases. In the phase 1, a dispatching rule is employed to generate an active or non-delay initial schedule. In the phase 2, tasks selected from a predetermined set of promising target operations in the initial schedule are tested to ascertain whether, by left-shifting their start times and rearranging some subset of the remaining operations, one can reduce the total tardiness. In the numerical example, the results indicate that the proposed SDME algorithm is capable of yielding notable reductions in the total tardiness for practical size problems.