• 한국통신학회논문지
• /
• 제28권9C호
• /
• pp.908-922
• /
• 2003

최근에 PKI(Public Key Infrastructure)는 인증 경로 고리 작업을 사용자로부터 Delegated Path Discovery (DPD)와 Delegated Path Validation (DPV) 서버에게로 위임하는 추세이다. DPD/DPV 서버 구현의 최적의 조건은 높은 신뢰성을 제공하면서 저렴한 비용과 단순한 구현을 통해 구축하는 것이다. 본 논문에서는 사용자들이 가장 신뢰하는 신뢰 CA(Trusted CA)에 VA(Validation Authority)기능을 추가하여, 이를 DPD/DPV 서버로 사용하는 새로운 인증 경로 처리 기법을 제안하였다. 제안한 기법은 기존의 신뢰 CA를 위임 서버로 사용하기 때문에 단순한 구현을 통해 높은 신뢰성을 획득할 수 있다. 더불어, 경로 처리 작업으로 인한 신뢰 CA의 부담을 감소하기 위해서, 서명 검증 작업을 경로 상의 다른 CA들에게 위임하고, 반복되는 경로에 대한 처리 작업을 생략하도록 함으로서, 신뢰 CA를 이용한 검증 작업이 보다 효율적이고 빠르게 수행될 수 있도록 하였다.

• 한국지반공학회논문집
• /
• 제33권6호
• /
• pp.37-48
• /
• 2017

불포화 지반의 전단강도와 투수계수 산정에 이용되는 함수특성곡선은 건조과정과 습윤과정으로 나뉘며, 동일한 체적함수비에서 다른 흡수력을 나타내는 이력현상을 보인다. 강우 침투시 불포화 지반의 현장 거동은 습윤과정에 가깝게 발생하므로 수치해석 시에 습윤과정이 적용되어야 한다. 하지만 습윤과정이 건조과정보다 습득하는 시간이 오래 걸리기 때문에 주로 건조곡선이 사용되고 있다. 이를 보완하기 위해 건조곡선으로 습윤곡선을 추정하는 방법이 연구되어 왔으나, 방법이 복잡하고 잘 맞지 않는다. 따라서, 본 연구에서는 기존 자료를 바탕으로 습윤곡선 추정이 가능한 간편법을 제안하고 적용성을 검토하였다.

• Communications for Statistical Applications and Methods
• /
• 제13권3호
• /
• pp.577-585
• /
• 2006

This paper presents a method for reliability evaluation of a telecommunication network with variable link-capacities when the simple paths of the network are known. The LP-EM, suggested by Lee and Park (2001), identifies a composite path as a subnetwork and adds only a minimal set of links at each step which gives maximal increase on the maximum capacity flow of the subnetwork. Thereby the LP-EM reduces the possible occurrence of redundant composite paths significantly over other existing methods. Based on the LP-EM, our method further reduces the possible redundancy by identifying such simple paths that could give no increase of maximum capacity flow on the current subnetwork and excluding those simple paths from consideration in the process of constructing composite paths.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.691-700
• /
• 1994

Voronoi diagram of a set of geometric entities on a plane such as points, line segments, or arcs is a collection of Voronoi polygons associated with each entity, where Voronoi polygon of an entity is a locus of point which is closer to the associated entity than any other entity. Voronoi diagram is one of the most fundamental geometrical construct and well-known for its theoretical elegance and the wealth of applications. Various geometric problems can be solved with the aid of Voronoi diagram. For example, the maximum tool diameter of a milling cutter for rough cutting in a pocket can be easily found, and the pocketing tool path can be efficiently generated from Voronoi diagram. In PCB design, the design rule checking can be easily done via Voronoi diagram, too. This paper discusses an algorithm to construct Voronoi diagram of a simple polygon which consists of simple curves such as line segments as well as arcs in a plane with O(nlogn) time complexity by employing the divide and conquer scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.722-725
• /
• 1990

This paper proposes a new path planning method for obstacle avoidance of mobile robot. In order to achieve easy planning of the path, a simple representation of the empty space is achieved based on thinning algorithm. The proposed Planning technique facilitates the direct use of information obtained by camera. Comparing to the V-graph method, the task of determining the shortest path from the resulting skeleton of empty space is optimized in terms of number of computation steps. The usefulness of the proposed method is ascertained by simulation.

• 한국국방경영분석학회지
• /
• 제18권2호
• /
• pp.151-166
• /
• 1992

In this paper, we define a problem finding a simple path that maximizes the sum of the satisfied Origin-Destination (O-D) flows between nodes covered by that path as a Maximum O-D Flow Path Problem(MODEP). We established a formulation and suggested a method finding MODEP in a directed network. The method utilizes the constraint relaxation technique and the Dual All Integer Algorithm.

• 한국자동차공학회논문집
• /
• 제9권2호
• /
• pp.168-175
• /
• 2001

Reduction of structure-borne noise of the compartment in a car is an important task in automotive engineering. Transfer path analysis using vibroacoustic reciprocity technique or multiple path decomposition method has generally been used for structure-borne noise path analysis. These methods are useful in solving particular problem but do net quantify the effectiveness of vibration isolation of each isolator of a vehicle. To quantify the effectiveness of vibration isolation, the vibrational power flow has been used for a simple isolation system or a laboratory based isolation system. It is often difficult to apply the vibrational power flow technique to the complex isolation system like a car. In this paper, a simple equation is derived for calculation of the vibrational power flow of an isolation system with multiple isolators such as a car. It is successfully applied to not only quantifying the relative contributions of eighteen isolators but also reducing structure-borne noise of a passenger car. According to the results, the main contributor of eighteen isolators is the rear roll mount of an engine. The reduced structure-borne noise level is about 5dBA.

• 한국정보통신학회논문지
• /
• 제15권1호
• /
• pp.157-162
• /
• 2011

이 논문에서는 추상 그래프 기반의 경로 탐색 알고리즘에서 탐색된 경로의 비용이 증가하는 문제점을 보완하기 위해 탐색 영역 확장 기법들을 제안한다. 제안하는 기법들은 버퍼링 셀을 추출하여 유효 셀과 함께 탐색 영역으로 설정하는 기법으로, 단순 버퍼링 기법, 속력 제한 버퍼링 기법, 거리제한 버퍼링 기법을 제안하고 성능 평가하였다. 단순 버퍼링 기법은 유효 셀의 인접 셀들을 버퍼링 셀로 추출하며, 속력 제한 버퍼링 기법과 거리 제한 버퍼링 기법은 단순 버퍼링 기법을 통해 추출된 버퍼링 셀을 속력과 거리에 대해 제한하여 임계값을 미치지 못하는 버퍼링 셀을 제외하는 기법이다. 성능 평가 결과 탐색 영역을 확장함으로써 탐색된 경로의 비용을 줄일 수 있었다. 제안한 기법은 경로탐색, 물류관리 등 텔레매틱스 응용 서비스의 개발에 활용될 수 있을 것으로 기대된다.

• 제어로봇시스템학회논문지
• /
• 제12권7호
• /
• pp.671-678
• /
• 2006

This article proposes a smooth path generation and time scheduling method for general tasks defined by non-smooth path segments in industrial robotic applications. This method utilizes a simple 3rd order polynomial function for smooth interpolation between non-smooth path segments, so that entire task can effectively maintain constant line speed of operation. A predictor-corrector type numerical mapping technique, which correlates time based speed profile to the smoothed path in Cartesian space, is also provided. Finally simulation results show the feasibility of the proposed algorithm.

• ETRI Journal
• /
• 제33권2호
• /
• pp.283-286
• /
• 2011

Path loss plays fundamental roles in system design, spectrum management, and performance evaluation. The traditional path loss model has a slight inconvenience; it depends on the unknown distance. In this letter, we explore the probability distribution function (PDF) of path loss in an indoor office environment by randomizing out the distance variable. It is shown that the resulting PDF is not Gaussian-like but is skewed to the right, and both the PDF and the moments are related to the size of the office instead of the unknown distance. To be specific, we incorporate the IEEE 802.15.4a channel parameters into our model and tabulate the cumulative distribution function with respect to different room sizes. Through a simple example, we show how our model helps a cognitive spectrum user to infer path loss information of primary users without necessarily knowing their transmitter-receiver distance.