• 디지털콘텐츠학회 논문지
• /
• 제16권1호
• /
• pp.33-41
• /
• 2015

비트맵 인덱스는 낮은 카디널리티를 갖는 컬럼에 대한 OLAP 질의의 수행 속도에 있어서 매우 우수한 성능을 보이고 있기 때문에, 데이터 웨어하우스에서 많이 사용하고 있는 인덱스 기법 중에 하나이다. 일반적으로 데이터 웨어하우스에 기반을 둔 많은 응용 프로그램들은 컬럼 값들이 계층 구조를 형성하는 경우가 많이 있다. 만일, 컬럼 값들이 계층적으로 표현될 수 있는 경우 일반적인 비트맵 인덱스 보다 계층적 비트맵 인덱스를 이용하는 것이 질의 처리 수행 속도에 있어서 더 높은 성능을 보인다고 알려지고 있다. 그러나 계층적 비트맵 인덱스의 경우 사용하는 계층 구조의 크기가 큰 경우 저장 공간 오버헤드가 발생할 수 있다는 문제점을 가지고 있다. 그러므로 본 논문에서는 저장 공간이 제약된 환경에서 컬럼 값들이 거대 계층 구조를 형성하고 있을 때, 질의 워크로드에 기반하여 계층적 비트맵 인덱스를 효과적으로 생성하기 위한 방법을 제안한다. 특히, 본 논문에서는 주어진 계층 구조를 두 개의 배타적 역영으로 나누는 Cut 선택 방법 제안함으로써, 계층적 비트맵 인덱스의 저장 공간 오버헤드 문제를 해결한다.

• 대한산업공학회지
• /
• 제34권1호
• /
• pp.79-89
• /
• 2008

An end-of-life strategy is concerned with how to disassemble a product and what to do with each of the resultingdisassembled parts. A sound understanding of the end-of-life strategy at the early design stage could improve theease of disassembly and recycling in an efficient and effective manner. Therefore, the end-of-life decisionmaking for environmental conscious design has become a great concern to product manufacturers.We introduce a novel concept ofeco-architecture which represents a scheme by which the physical componentsare allocated to end-of-life modules. An end-of-life module is a physical chunk of connected components or afeasible subassembly which can be simultaneously processed by the same end-of-life option without furtherdisassembly. In this paper, a method for analyzing the eco-architecture of a product at the configuration designstage is proposed. It produces an optimal eco-architecture under the given environmental regulations. To dealwith the case ofa complex product, the method is extended for analyzing hierarchical eco-architecture.

• 한국정보통신학회논문지
• /
• 제13권1호
• /
• pp.153-160
• /
• 2009

전국망 규모의 망 설계 및 QoS가 적용된 Mobile-WiMAX 시스템과 54Mbps의 광대역 서비 스가 가능한 WLAN 시스템으로 구성된 계층적 네트워크는 VoIP, VOD, 화상전화 등과 같은 실시간 서비스를 포함한 다양한 무선 인터넷 서비스를 제공한다. 그러나 실시간 서비스를 이용하는 사용자가 Mobile-WiMAX/WLAN 계층적 네트워크에서 핸드오프를 수행할 경우, 특히 Mobile-WiMAX 네트워크에서 WLAN 핫스팟 지역으로 핸드오프를 할 경우 핸드오프 지연으로 인해 사용 중인 서비스가 끊기게 된다. 본 연구는 Mobile-WiMAX(IEEE 802.16e) 규격에서 제시된 서비스 종류(ToS) 파라미터를 이용하여 vertical 핸드오프 수행 기준이 되는 vertical 핸드오프 프로세스를 제안한다. 이 프로세스를 이용하면 실시간 서비스를 사용 중인 사용자는 핸드오프 수행을 일정시간 지연하므로 실시간 서비스의 끊기는 불편함을 해소할 수 있다. 본 논문에서 제안한 프로세스를 이용할 경우 Mobile-WiMAX/WLAN 계층적 네트워크에서 vertical 핸드오프 수행 중의 실시간 서비스 이용에 제한이 없어진다. 이는 사용자 편의 중심의 서비스를 실현할 수 있게 될 것이다.

• International Journal of Automotive Technology
• /
• 제7권6호
• /
• pp.749-756
• /
• 2006

This paper presents a complex stochastic wheelbase preview control method of a motorcycle suspension based on hierarchical modeling method. As usual, a vehicle suspension system is controlled as a whole body. In this method, a motorcycle suspension with five Degrees of Freedom(DOF) is dealt with two local independent 2-DOF suspensions according to the hierarchical modeling method. The central dynamic equations that harmonize local relations are deduced. The vertical and pitch accelerations of the suspension center are treated as center control objects, and two local semi-active control forces can be obtained. In example, a real time Linear Quadratic Gaussian(LQG) algorithm is adopted for the front suspension and the combination of the wheelbase preview and LQG control method is designed for the rear suspension. The results of simulation show that the control strategy has less calculating time and is convenient to adopt different control strategies for front and rear suspensions. The method proposed in this paper provides a new way for the vibration control of multi-wheel vehicles.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.86-102
• /
• 1991

The purpose of this paper is to present a branch and bound algorithm for the hierarchical transportation network design problem in 2-level directed networks. This problem is to find the least cost of hierarchical transportation networks which consist of a primary path and a secondary path. The primary path is a simple path from a prespecified orgin node to a prespecified terminal node. All nodes must be either a transsipment node on the primary path or connected to that path via secondary arcs. This problem is formulated to a 0-1 inter programming problem with assignment and illegal subtour elimination equations as constaints. We show that the subproblem relaxing subtour elimination constraints is transformed to a linear programming problem by means of the totally unimodularity. Optimal solutions of this subproblem are polynoially obtained by the assignment algorithm and complementary slackness conditions. Therefore, the optimal value of this subproblme is used as a lower bound. When an optimal solution of the subproblem has an illegal subtour, a better disjoint rule is adopted as the branching strategy for reducing the number of branched problems. The computational comparison between the least bound rule and the depth first rule for the search strategy is given.

• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.319-326
• /
• 2011

Beamforming techniques have been successfully utilized for traffic channels in order to solve the interference problem. However, their use for control channels has not been sufficiently investigated. In this paper, a (semi-) centralized beamforming strategy that adaptively changes beam patterns and controls the total transmit power of cells is proposed for the performance enhancement of the common channel in hierarchical cell structure (HCS) networks. In addition, some examples of its practical implementation with low complexity are presented for two-tier HCS networks consisting of macro and pico cells. The performance of the proposed scheme has been evaluated through multi-cell system-level simulations under optimistic and pessimistic interference scenarios. The cumulative distribution function of user geometry or channel quality has been used as a performance metric since in the case of common control channel the number of outage users is more important than the sum rate. Simulation results confirm that the proposed scheme provides a significant gain compared to the random beamforming scheme as well as conventional systems that do not use the proposed algorithm. Finally, the proposed scheme can be applied simultaneously to several adjacent macro and pico cells even if it is designed primarily for the pico cell within macro cells.

• 대한기계학회논문집
• /
• 제18권8호
• /
• pp.2016-2025
• /
• 1994

A hierarchical planning strategy for dextrous manipulation of multifingered hands with soft finger contact model is proposed. Dextrous manipulation planning can be divided into a high-level stage which specifies the position/orientation trajectories of the fingertips on the object and a low-level stage which determines the contact forces and joint trajectories for the fingers. In the low-level stage, various nonlinear optimization problems are formulated according to the contact modes and integrated into a manipulation planning algorithm to find contact forces and joint velocities at each time step. Montana's contact equations are used for the high-level planning. Quasi-static simulation results are presented and illustrated by employing a three-fingered hand manipulating a sphere to demonstrate the validity of the proposed low-level planning strategy.

• 대한전자공학회논문지
• /
• 제26권10호
• /
• pp.1598-1605
• /
• 1989

This paper describes an efficient global cell (module) placement strategy called HALO (Hierarchical Alternating Linear Ordering)which generates global 2-D placement of circuit modules by hierarchical application of linear ordering in alternating direction. We tried, in principle, to explain why HALO should perform better than other typical, somehat successful, analytical approaches such as min-cut, force-directed relaxation(FDR)or its likes. We have implemented HALO as a program for standard cell placement. Experimental results on two benchmark circuits, primary and primary 2 consisting of 752 and 2907 cells, respectively have shown a decrease of half-perimeter routing length by 7% and 24%, respectively compared to the best available results obtained so far. Total CPU time including the following detailed placement was less than half of the earlier work.

• Management Science and Financial Engineering
• /
• 제19권1호
• /
• pp.1-10
• /
• 2013

Hierarchical forecasting strategy does not always outperform direct forecasting strategy. The performance generally depends on demand features. This research guides the use of the alternative forecasting strategies according to demand features. This paper developed and evaluated various classification models such as logistic regression (LR), artificial neural networks (ANN), decision trees (DT), boosted trees (BT), and random forests (RF) for predicting the relative performance of the alternative forecasting strategies for the South Korean navy's spare parts demand which has non-normal characteristics. ANN minimized classification errors and inventory costs, whereas LR minimized the Brier scores and the sum of forecasting errors.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권11호
• /
• pp.492-497
• /
• 2006

Nash Equilibrium (NE) is essential to investigate a participant's bidding strategy in a competitive electricity market. The transmission line constraints make it difficult to compute the NE due to causing a mixed strategy NE instead of a pure strategy NE. Computing a mixed strategy is more complicated in a multi-player game. The competition among multi-participants is modeled by a two-level hierarchical optimization problem. A mathematical programming approach is widely used in finding this equilibrium. However, there are difficulties to solving a mixed strategy NE. This paper presents two propositions to add heuristics to the mathematical programming method. The propositions are based on empirical studies on mixed strategies in numerous sample systems. Based on the propositions a new formulation is provided with a set of linear and nonlinear equations, and an algorithm is suggested for using the prepositions and the newly-formulated equations.