• 한국컴퓨터정보학회논문지
• /
• 제20권12호
• /
• pp.101-106
• /
• 2015

This paper suggests heuristic algorithm with polynomial time complexity for rigging elections problem that can be obtain the optimal solution using linear programming. The proposed algorithm transforms the given problem into adjacency graph. Then, we divide vertices V into two set W and D. The set W contains majority distinct and the set D contains minority area. This algorithm applies divide-and-conquer method that the minority area D is include into majority distinct W. While this algorithm using simple rule, that can be obtains the optimal solution equal to linear programing for experimental data. This paper shows polynomial time solution finding rule potential in rigging elections problem.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제10권3호
• /
• pp.185-192
• /
• 2010

This paper presents a hardware-efficient auto-correlation scheme for the synchronization of MIMO-OFDM based wireless local area network (WLAN) systems, such as IEEE 802.11n. Carrier frequency offset (CFO) estimation for the frequency synchronization requires high complexity auto-correlation operations of many training symbols. In order to reduce the hardware complexity of the MIMO-OFDM synchronization, we propose an efficient correlation scheme based on time-multiplexing technique and the use of reduced samples while preserving the performance. Compared to a conventional architecture, the proposed architecture requires only 27% logic gates and 22% power consumption with acceptable BER performance loss.

• 대한산업공학회지
• /
• 제34권2호
• /
• pp.160-171
• /
• 2008

MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2007년도 추계학술대회 및 정기총회
• /
• pp.388-394
• /
• 2007

In wireless network, we propose a predictive location update scheme which considers mobile user's(MU's) mobility patterns. MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.

• 산업공학
• /
• 제7권2호
• /
• pp.75-85
• /
• 1994

This paper presents a production scheduling model in a block assembly shop in shipbuilding industry. In a block assembly shop, the most important performance criterion is load leveling, which balances manpower and work area utilization through the planning horizon. The problem is formulated as a mixed-integer nonlinear programming(MINLP) problem of which objective function is to optimize load leveling. The developed MINLP problem can not be solvable due to computational complexity. The MINLP problem is decomposed into two stage mixed-integer linear programming (MILP) problems to obtain a good solution, but the decomposed MILP problems are still computationally intractable because of combinatorial complexity. Therfore, a heuristic method using linear programming is proposed to solve two stage MILP problems sequentially. The proposed heuristic generates a good production schedule within a reasonable computation time, and it is easily applicable for establishing the production schedule in a block assembly shop in shipbuilding industry.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 컴퓨터소사이어티 추계학술대회논문집
• /
• pp.27-30
• /
• 2003

The recent technology developments introduce new difficulties into the test process by the increased complexity of the chip. Most widely used method for testing high complexity and embedded systems is built-in self-test(BIST). In this paper, we describe 5-stage pipeline system as circuit under testing(CUT) and proposed a BIST scheme for the hazard detection unit of the pipeline system. The proposed BIST scheme can generate sequential instruction sets by pseudo-random pattern generator that can detect all hazard issues and compare the expected hazard signals with those of the pipelined system. Although BIST schemes require additional area in the system, it proves to provide a low-cost test solution and significantly reduce the test time.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.451-460
• /
• 2012

Natural disasters often lead to regional failures that can cause network nodes and links co-located in a large geographical area to fail. Novel approaches are required to assess the network vulnerability under such regional failures. In this paper, we investigate the vulnerability of networks by considering the geometric properties of regional failures and network nodes. To evaluate the criticality of node locations and determine the critical areas in a network, we propose the concept of ${\alpha}$-critical-distance with a given failure impact ratio ${\alpha}$, and we formulate two optimization problems based on the concept. By analyzing the geometric properties of the problems, we show that although finding critical nodes or links in a pure graph is a NP-complete problem, the problem of finding critical areas has polynomial time complexity. We propose two algorithms to deal with these problems and analyze their time complexities. Using real city-level Internet topology data, we conducted experiments to compute the ${\alpha}$-critical-distances for different networks. The computational results demonstrate the differences in vulnerability of different networks. The results also indicate that the critical area of a network can be estimated by limiting failure centers on the locations of network nodes. Additionally, we find that with the same impact ratio ${\alpha}$, the topologies examined have larger ${\alpha}$-critical-distances when the network performance is measured using the giant component size instead of the other two metrics. Similar results are obtained when the network performance is measured using the average two terminal reliability and the network efficiency, although computation of the former entails less time complexity than that of the latter.

• 한국정보통신학회논문지
• /
• 제18권8호
• /
• pp.1885-1894
• /
• 2014

기존 영상 검지기 분야에는 다양한 고성능 알고리즘들이 존재하지만 실시간 연산 요구량이 너무 많아 시스템 장비가 고가, 고전력을 소모하는 단점이 있었다. 이에 본 논문에서는 저가, 저전력 영상 검지 시스템 구현을 위해 안드로이드 플랫폼의 성능 사양에 적합한 저연산량의 영상 검지 알고리즘을 제안한다. 본 방법은 차량 하부에만 생성되는 sub-shadow 를 분리하여 이를 누적함으로써 차선 및 검지 영역을 정밀하게 설정하고 이 검지 영역을 통과하는 차량 자체와 차량 sub-shadow 의 통과패턴을 판단하여 차선별 교통량 뿐만 아니라 상행 및 하행 교통량까지 자동으로 분류할 수 있다. 실험 결과 제안하는 알고리즘은 하행 차량의 경우 평균 97.1%, 상행 차량의 경우 평균 94.1%의 검지율을 보였다. 이 결과는 상용 루프검지기의 성능 95% 에 버금가는 수준으로 만족스러운 성능을 보였다.

• 대한전자공학회논문지SD
• /
• 제43권3호
• /
• pp.33-39
• /
• 2006

Divide-and-Conquer방법은 병렬 곱셈기의 구성에 잘 적용되며 가장 대표적으로 카라슈바 방법이 있다. Leone은 최적 반복 회수를 카라슈바 알고리즘에 적용하였으며 Ernst는 다중 분할 카라슈바 방법을 제안하였다. 본 논문에서는 카라슈바 알고리즘에서 불필요한 연산이 제거된 불필요한 연산이 없는 카라슈바 알고리즘과 효율적인 하드웨어 구조를 제안한다. 본 논문에서 제안하는 알고리즘은 기존의 카라슈바 알고리즘에 비교하여 같은 시간 복잡도를 가지나 공간 복잡도를 효율적으로 감소시킨다. 특히 확장체의 차수 n이 홀수 및 소수일 때 더 효율적이며 최대 43%까지 공간 복잡도를 줄일 수 있다.

• 한국정보과학회논문지:정보통신
• /
• 제35권2호
• /
• pp.112-119
• /
• 2008

최근 홈 네트워크 기술에 대한 관심도가 높아지면서 가정 내 장치들의 통신 방법에 대한 표준이 절실히 요구되고 있다. IEEE 802.1 AVB (Audio/Video Bridging)는 이더넷을 이용해 이러한 가정 내장치들 사이에 실시간성 데이타들을 전송하는 방법을 규정하고 있다. 하지만 IEEE 802.1 AVB는 IEEE 1588 PTP(Precision Time Protocol)와 같이 시간을 동기화 하기위해 다수의 컨트를 메시지를 이용하고 있어 복잡한 처리과정과 이로 인한 전송 지연의 문제점을 가지고 있다. 따라서 본 논문에서는 단일 타임싱크 프레임을 이용하여 시간을 동기화하는 방법을 제안한다. 단일 타임싱크 프레임을 이용한 방법은 여러 메시지 형태의 프레임을 이용하지 않고 단일 프레임을 이용하여 모든 동작이 가능한 범위의 동기식 이더넷의 전자기기들 사이에서의 통신에 적합한 처리 복잡도와 낮은 전송 지연을 제공한다. 나아가 단일 타임싱크 프레임을 이용한 시간 동기 방법에 실시간성 데이타 전송을 보장하는 대역폭 예약 방법 및 전송 방법에 대한 연구가 연계되어 진행되어야 한다.