• 정보처리학회논문지C
• /
• 제17C권3호
• /
• pp.259-270
• /
• 2010

본 논문에서는 무선 애드혹 네트워크에서 센서 노드들의 물리적 위치정보를 기반으로 라우팅 경로를 설정하기 위한 LIGR (Location Information-based Gradient Routing) 알고리즘을 제안한다. LIGR 알고리즘은 물리적 위치정보를 이용하여 소스 노드와 싱크 노드를 잇는 직선의 기울기를 통해 전송 방향과 탐색 범위를 결정함으로써 불필요한 데이터 전송과 경로 탐색 시간 및 전파 지연 시간을 감소시킨다. 또한 포워딩 노드 선택 시 배터리 부족 노드는 2순위 또는 3순위의 우선순위를 갖도록 하여 우선적으로 선택하지 않도록 함으로써 에너지 부족 노드가 네트워크상에서 라우터로서의 기능 수행보다는 데이터 수집을 위한 호스트로서의 기능을 수행하도록 하였다. LGR (Logical Grid Routing) 프로토콜에 비하여 LIGR 알고리즘은 평균 수신율, 평균 지연시간, 평균 잔여 에너지 및 네트워크 처리율에서 개선된 성능을 보였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.1169-1172
• /
• 2005

In this paper, we propose an improved anti-collision algorithm for multi tag interrogation in ubiquitous sensor network(USN) and show the result of simulation for multi tag interrogation in RFID systems. We have analyzed an EPC(Electronic Product Code) protocol which specifies the physical and logical requirements for a passive-backscatter Reader-Talk-First(RTF) RFID(Radio Frequency Identification) system operating in the $860MHz{\sim}960MHz$ frequency range. We have also designed and implemented the simulator of the RFID system based on the EPC protocol. Finally, we find that proposed algorithm works better than an existing algorithm.

• 대한기계학회논문집A
• /
• 제24권1호
• /
• pp.225-231
• /
• 2000

Dimensional synthesis of planar and spatial mechanisms mostly requires solution-finding, procedure for a system of polynomial equations. In case the system is nonlinear, numerical techniques like Newton-Raphson are often used. But there are no logical ways for finding all possible solutions in such iterative methods. In this paper, algebraic elimination is used to get all solutions for the synthesis of 5-SS spatial mechanism with seven prescribed positions. The proposed algorithm is more suitable for computer implementation and takes less time than existing one. Two numerical examples are given to demonstrate the implemented algorithm.

• 시스템엔지니어링학술지
• /
• 제12권2호
• /
• pp.115-125
• /
• 2016

An improved RRS (Reactor Regulating System) logic is implemented in this work using systems engineering approach along with GA (Genetic Algorithm) deemed as providing an optimal solution to a given system. The current system works desirably and has been contributed to the safe and stable NPP operation. However, during the ascent and decent section of the reactor power, the RRS output reveals a relatively high steady state error and the output also carries a considerable level of overshoot. In an attempt to consolidate conservatism and minimize the error, this research proposes applying genetic algorithm to RRS and suggests reconfiguring the system. Prior to the use of GA, reverse-engineering is implemented to build a Simulink-based RRS model and re-engineering is followed to apply the GA and to produce a newly-configured RRS generating an output that has a reduced steady state error and diminished overshoot level.

• 한국경영과학회지
• /
• 제14권1호
• /
• pp.88-96
• /
• 1989

General measure in the reliability is the k-terminal reliability, which is the probability that the specified vertices are connected by the working edges. To compute the k-terminal reliability components are usually assumed to be statistically independent. In this study the modeling and analysis of the k-terminal reliability are investigated when dependency among components is considered. As the size of the network increases, the number of the joint probability parameter to represent the dependency among components is increasing exponentially. To avoid such a difficulty the structured-event-based-reliability model (SERM) is presented. This model uses the combination of the network topology (physical representation) and reliability block diagram (logical representation). This enables us to represent the dependency among components in a network form. Computational algorithms for the k-terminal reliability in SERM are based on the factoring algorithm Two features of the ractoring algorithm are the reliability preserving reduction and the privoting edge selection strategy. The pivoting edge selction strategy is modified by two different ways to tackle the replicated edges occuring in SERM. Two algorithms are presented according to each modified pivoting strategy and illustrated by numerical example.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.767-772
• /
• 2005

The Internet is a packet switched network which offers best-effort service, but current IP network provide enhanced services such Quality of Services, Virtual Private Network (VPN) services, Distribute Firewall and IP Security Gateways. All such services need packet classification for determining the flow. The problem is performing scalable packet classification at wire speeds even as rule databases increase in size. Therefore, this research offer packet classification algorithm that increase classifier performance when working with enlarge rules database by rearrange rule structure into Bitmap Intersection Lookup (BIL) tables. It will use packet's header field for looking up BIL tables and take the result with intersection operation by logical AND. This approach will use simple algorithm and rule structure, it make classifier have high search speed and fast updates.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2538-2541
• /
• 2005

This paper deals one of the methods of system identification, especially on-line system identification in time-domain. The algorithm in this study needs all states of the system as well input to it for system identification. In this reason, Kalman filter is used for state estimation. But in order to implement a state estimator, the fact that a system model must be known is logical contradiction. To overcome this, state estimation and system parameter estimation are performed simultaneously in one sample. And the result of the system parameter estimation is used as basis to state estimation in next sample. On-line system identification comes, in every sample by performing both processes of state estimation and parameter estimation that are related mutually and recursively. This paper demonstrates the validity of proposed algorithm through an example of an unstable inverted pendulum system. This algorithm can be useful for on-line system identification of a system that has fewer number of measurable output than system order or number of states.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.1275-1278
• /
• 2003

This research describes a image-processing technique for the scratch detecting algorithm for ITO coated glass. The light emitter efficiency of Organic EL has a failing-off in quality due to many causes. One of the many causes was the defects of the surface in ITO coated glass. We use the logical level thresholding method for binarization of gray-scaled glass image. This method is useful to the algorithm for detecting scratch of ITO coated glass automatically without need of any prior information of manual fine tuning of parameters.

• 디지털산업정보학회논문지
• /
• 제10권1호
• /
• pp.1-6
• /
• 2014

In this paper, we propose a CPLD low power algorithm considering the structure. The proposed algorithm is implemented CPLD circuit FC(Feasible Cluster) for generating a problem occurs when the node being split to overcome the area and power consumption can reduce the algorithm. CPLD to configure and limitations of the LE is that the number of OR-terms. FC consists of an OR node is divided into mainly as a way to reduce the power consumption with the highest number of output nodes is divided into a top priority. The highest number of output nodes with the highest number of switching nodes become a cut-point. Division of the node is the number of OR-terms of the number of OR-terms LE is greater than adding the input and output of the inverter converts the AND. Reduce the level, power consumption and area. The proposed algorithm to MCNC logic circuits by applying a synthetic benchmark experimental results of 13% compared to the number of logical blocks decreased. 8% of the power consumption results in a reduced efficiency of the algorithm represented been demonstrated.

• 한국컴퓨터정보학회지
• /
• 제15권1호
• /
• pp.53-64
• /
• 2007

본 논문에서는 최근의 해킹사고에서 침입자는 피해시스템에서 자신의 IP주소 노출을 피하기 위하여 피해 시스템을 직접 공격하지 않고 Stepping stone(경유지)을 이용하여 우회 공격을 수행한다. 본 논문에서는 로그기반에서는 네트워크 감사 정책을 이용하고, TCP 기반에서는 CIS, AIAA 기법과 네트워크 기반에서는 Thumbprints Algorithm, Timing based Algorithm, TCP Sequence number를 이용한 알고리즘, Sleep Watermark Tracking 기법을 이용하여 역추적 시스템을 제시하였으며, 현 인터넷 망의 구성의 물리적 또는 논리적 복잡성이 크다는 단점을 보완하기 위해, 날로 발전하고 빠른 기술 개발 속도를 갖는 침입 기술에 대응하기위해 하나의 시스템에 하나의 모듈이 아닌 기존의 알고리즘을 이용해 효과적인 역추적 시스템을 제시 하려 한다.