• 대한교통학회:학술대회논문집
• /
• 대한교통학회 2000년도 제37회 학술발표회논문집
• /
• pp.25-47
• /
• 2000

In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.

• Journal of Communications and Networks
• /
• 제18권1호
• /
• pp.27-39
• /
• 2016

This paper derives and analyzes a novel block fast Fourier transform (FFT) based joint detection algorithm. The paper compares the performance and complexity of the novel block-FFT based joint detector to that of the Cholesky based joint detector and single user detection algorithms. The novel algorithm can operate at chip rate sampling, as well as higher sampling rates. For the performance/complexity analysis, the time division duplex (TDD) mode of a wideband code division multiplex access (WCDMA) is considered. The results indicate that the performance of the fast FFT based joint detector is comparable to that of the Cholesky based joint detector, and much superior to that of single user detection algorithms. On the other hand, the complexity of the fast FFT based joint detector is significantly lower than that of the Cholesky based joint detector and less than that of the single user detection algorithms. For the Cholesky based joint detector, the approximate Cholesky decomposition is applied. Moreover, the novel method can also be applied to any generic multiple-input-multiple-output (MIMO) system.

• 한국정보처리학회논문지
• /
• 제5권6호
• /
• pp.1633-1638
• /
• 1998

ASICDP 내장된 다중 RAM Module의 테스트를 위하여 BIST(Built-In Self Test)기법을 이용한 내장형 다중 RAM Module용 범용 BIST 생성기를 설계하였다. 본 논문에서 제안한 범용 BIST 생성기는 주어진 Embedded RAM 모듈의 사양과 적용되는 테스트 알고리듬에 따라 이에 부합되는 BIST 회로를 VHDL 코드로 자동 생성하는 설계 자동화 도구로서, 각 모듈 단위로 설계되어 회로의 추가 개발 및 재사용이 가능하다. 뿐만 아니라, Serial Interfacing 기법을 사용하여 부가적인 핀 수를 줄였으며, BIST 회로 공유 기법의 도입으로다중 RAM 테스트 시 다양한 사양의 RAM 테스트에 적용이 쉽도록 설계하였다.

• Smart Structures and Systems
• /
• 제21권3호
• /
• pp.373-387
• /
• 2018

Semi-active isolation systems based on leverage-type stiffness control strategies have been widely studied. The main concept behind this type of system is to adjust the stiffness in the isolator to match the fundamental period of the isolated system by using a simple leverage mechanism. Although this system achieves high performance under far-field earthquakes, it is unsuitable for near-fault strong ground motion. To overcome this problem, this study considers the potential energy effect in the control law of the semi-active isolation system. The minimal energy weighting (MEW) between the potential energy and kinetic energy was first optimized through a series of numerical simulations. Two MEW algorithms, namely generic and near-fault MEW control, were then developed to efficiently reduce the structural displacement responses. To demonstrate the performance of the proposed method, a two-degree-of-freedom structure was employed as a benchmark. Numerical results indicate that the dynamic response of the structure can be effectively dampened by the proposed MEW control under both far-field and near-fault earthquakes, whereas the structural responses resulting from conventional control methods may be greater than those for the purely passive control method. Moreover, according to experimental verifications, both the generic and near-fault MEW control modes yielded promising results under impulse-like earthquakes. The practicability of the proposed control algorithm was verified.

• 한국멀티미디어학회논문지
• /
• 제6권2호
• /
• pp.247-258
• /
• 2003

얼굴인식 기술 분야에 있어서 Principal component analysis (PCA)기반 알고리즘은 많은 관련 알고리즘의 기초가 되고 있다. PCA는 매우 통계적인 접근이며 얼굴인식 분야에 응용하기 위해서는 많은 설계 결정요인 (design derision)을 필요로 한다. 본 논문에서는 일반적인 modular PCA알고리즘을 소개하면서 design decision을 얻는다. 얼굴인식 알고리즘 평가에 대한 표준 접근 방법인 September 1996 FERET evaluation protocol을 활용하여 각 모듈에 대한 서로 다른 구현방법을 실험하고 평가한다. 실험조건으로는 (1) 조도의 정규화 과정 을 변화 (2) JPEG과 wavelet compression 알고리즘 사용에 대한 성능효과를 분석 (3) 표현방법에서 eigenvectors의 수를 조절 (4) 분류과정에서 유사도 측정방법을 변경하는 등이다. 본 논문에서는 standard September 1996 FERET의 대용량 gallery image set에 대해 적용해 본 결과에 대해 정리하며, 100개의 무작위로 발생된 image set에 대해서도 알고리즘의 성능 변화를 평가한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.3-5
• /
• 2005

In this paper. we introduce a new structure of fuzzy-neural networks Fuzzy Set-based Polynomial Neural Networks (FSPNN). The two underlying design mechanisms of such networks involve genetic optimization and information granulation. The resulting constructs are Fuzzy Polynomial Neural Networks (FPNN) with fuzzy set-based polynomial neurons (FSPNs) regarded as their generic processing elements. First, we introduce a comprehensive design methodology (viz. a genetic optimization using Genetic Algorithms) to determine the optimal structure of the FSPNNs. This methodology hinges on the extended Group Method of Data Handling (GMDH) and fuzzy set-based rules. It concerns FSPNN-related parameters such as the number of input variables, the order of the polynomial, the number of membership functions, and a collection of a specific subset of input variables realized through the mechanism of genetic optimization. Second, the fuzzy rules used in the networks exploit the notion of information granules defined over systems variables and formed through the process of information granulation. This granulation is realized with the aid of the hard C-Means clustering (HCM). The performance of the network is quantified through experimentation in which we use a number of modeling benchmarks already experimented with in the realm of fuzzy or neurofuzzy modeling.

• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.105-115
• /
• 2006

Thickness is a commonly used parameter in product design and manufacture. Its intuitive definition as the smallest dimension of a cross-section or the minimum distance between two opposite surfaces is ambiguous for intricate solids, and there is very little reported work in automatic computation of thickness. We present three generic definitions of thickness: interior thickness of points inside an object, exterior thickness for points on the object surface, and radiographic thickness along a view direction. Methods for computing and displaying the respective thickness values are also presented. The internal thickness distribution is obtained by peeling or successive skin removal, eventually revealing the object skeleton (similar to medial axis transformation). Another method involves radiographic scanning along a viewing direction, with minimum, maximum and total thickness options, displayed on the surface of the object. The algorithms have been implemented using an efficient voxel based representation that can handle up to one billion voxels (1000 per axis), coupled with a near-real time display scheme that uses a look-up table based on voxel neighborhood configurations. Three different types of intricate objects: industrial (press cylinder casting), sculpture (Ganesha idol), and medical (pelvic bone) were used for successfully testing the algorithms. The results are found to be useful for early evaluation of manufacturability and other lifecycle considerations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2680-2700
• /
• 2017

Finite field arithmetic over GF($2^m$) is used in a variety of applications such as cryptography, coding theory, computer algebra. It is mainly used in various cryptographic algorithms such as the Elliptic Curve Cryptography (ECC), Advanced Encryption Standard (AES), Twofish etc. The multiplication in a finite field is considered as highly complex and resource consuming operation in such applications. Many algorithms and architectures are proposed in the literature to obtain efficient multiplication operation in both hardware and software. In this paper, a modified serial multiplication algorithm with interleaved modular reduction is proposed, which allows for an efficient realization of a sequential polynomial basis multiplier. The proposed sequential multiplier supports multiplication of any two arbitrary finite field elements over GF($2^m$) for generic irreducible polynomials, therefore made versatile. Estimation of area and time complexities of the proposed sequential multiplier is performed and comparison with existing sequential multipliers is presented. The proposed sequential multiplier achieves 50% reduction in area-delay product over the best of existing sequential multipliers for m = 163, indicating an efficient design in terms of both area and delay. The Application Specific Integrated Circuit (ASIC) and the Field Programmable Gate Array (FPGA) implementation results indicate a significantly less power-delay and area-delay products of the proposed sequential multiplier over existing multipliers.

• 인터넷정보학회논문지
• /
• 제8권5호
• /
• pp.161-170
• /
• 2007

본 논문은 데이터 메모리 평면과 스위칭 평면을 분리하여 패킷 데이터의 저장과 메모리 주소 포인터의 스위칭이 병렬적으로 처리 가능하며 IP 패킷의 가변 길이 스위칭이 가능한 새로운 스위치 구조를 제안한다. 제안한 구조는 기존 VOQ방식의 복잡한 중재 알고리즘이 필요 없으며 출력 큐 방식의 스위치에서만 적용되고 있는 QoS를 입력 큐에서 고려한다. 성능분석 결과 제안한 구조는 기존의 공유 메모리 기반의 구조들에 비해 상대적으로 낮은 평균 지연 시간을 가지며 스위치의 크기가 증가하더라도 일정한 지연 시간을 보장함을 확인하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 A
• /
• pp.580-582
• /
• 2005

This paper presents a new method which applies a genetic algorithm(GA) for determining which sectionalizing switch to operate in order to solve the distribution system loss minimization re-configuration problem. The distribution system loss minimization re-configuration problem is in essence a 0-1 planning problem which means that for typical system scales the number of combinations requiring searches becomes extremely large. In order to deal with this problem, a new a roach which applies a GA was presented. Briefly, GA are a type of random number search method, however, they incorporate a multi-point search feature. Further, every point is not is not separately and respectively renewed, therefore, if parallel processing is applied, we can expect a fast solution algorithm to result.