• 제목/요약/키워드: hierarchical strategy

검색결과 314건 처리시간 0.076초

Building Hierarchical Bitmap Indices in Space Constrained Environments (저장 공간이 제약된 환경에서 계층적 비트맵 인덱스 생성에 관한 연구)

  • Kim, Jong Wook
    • Journal of Digital Contents Society
    • /
    • 제16권1호
    • /
    • pp.33-41
    • /
    • 2015
  • Since bitmap indices are useful for OLAP queries over low-cardinality data columns, they are frequently used in data warehouses. In many data warehouse applications, the domain of a column tends to be hierarchical, such as categorical data and geographical data. When the domain of a column is hierarchical, hierarchical bitmap index is able to significantly improve the performance of queries with conditions on that column. This strategy, however, has a limitation in that when a large scale hierarchy is used, building a bimamp for each distinct node leads to a large space overhead. Thus, in this paper, we introduce the way to build hierarchical bitmap index on an attribute whose domain is organized into a large-scale hierarchy in space-constrained environments. Especially, in order to figure out space overhead of hierarchical bitmap indices, we propose the cut-selection strategy which divides the entire hierarchy into two exclusive regions.

The Eco-Architecture for Optimal End-Of-Life Strategy for Complex Products : An Extension to Hierarchical Analysis (제품의 사용 후 처리전략 수립 최적화를 위한 계층적 에코 아키텍쳐 분석방법론)

  • Kwak, Min Jung;Lee, Hyun Bok;Hong, Yoo Suk;Cho, Nam Wook;Choi, Keon Young
    • Journal of Korean Institute of Industrial Engineers
    • /
    • 제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.

Proposal of Traffic Management Strategy between Hierarchical Mobile-WiMAX/WLAN Networks (계층적 Mobile-WiMAX/WLAN 네트워크에서의 트래픽 관리 전략에 관한 연구연구)

  • Moon, Tae-Wook;Kim, Moon;Cho, Sung-Jun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제13권1호
    • /
    • pp.153-160
    • /
    • 2009
  • A hierarchical network between Mobile-WiMAX and WLAN systems is to make it possible to utilize wireless internet services including time sensitive applications such as VoIP, VOD, visual telephony etc. During the process of vertical handoff decision from Mobile-WiMAX to WLAN hotspot, vertical handoff delay causes user dissatisfaction because it doesn't provide the seamless wireless internet service. We make use of type of service (ToS) parameters in IEEE 802.16e specification as the criterion parameter of vertical handoff decision process in hierarchical Mobile-WiMAX/WLAN networks. In this paper, we propose the process of vertical handoff decision for seamless wireless internet service which is sensitive to time delay. If type of service is time sensitive application, the decision of vertical handoff is withdrawn until the service is terminated. In focus on user satisfaction, if the proposed traffic management strategy in hierarchical Mobile-WiMAX/WLAN networks is used, user will utilize seamless wireless internet services including time sensitive applications.

COMPLEX STOCHASTIC WHEELBASE PREVIEW CONTROL AND SIMULATION OF A SEMI-ACTIVE MOTORCYCLE SUSPENSION BASED ON HIERARCHICAL MODELING METHOD

  • Wu, L.;Chen, H.L.
    • 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.

A Branch and Bound Algorithm for the Hierarchical Transportation Network Design Problem in Directed Networks (유방향 네트워크에서 계층수송망 설계 문제에 대한 분지한계법)

  • Shim, Hyun-Taik;Park, Son-Dal
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • 제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.

  • PDF

Beamforming Strategy Using Adaptive Beam Patterns and Power Control for Common Control Channel in Hierarchical Cell Structure Networks

  • You, Cheol-Woo;Jung, Young-Ho;Cho, Sung-Hyun
    • 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.

Dextrous Manipulation Planning of Soft-Fingered Hands (소프트핑거 로봇손의 물체 운용계획)

  • 정낙영;최동훈;서일홍
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • 제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.

HALO : An Efficient Global Placement Strategy for Standard Cells (HALO : 효율적 표준셀 배치 알고리듬)

  • 양영일;경종민
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • 제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.

  • PDF

Predicting the Performance of Forecasting Strategies for Naval Spare Parts Demand: A Machine Learning Approach

  • Moon, Seongmin
    • 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.

Solving Mixed Strategy Equilibria of Multi-Player Games with a Transmission Congestion (다자게임 전력시장에서 송전선 혼잡시의 복합전략 내쉬균형 계산)

  • Lee, Kwang-Ho
    • The Transactions of the Korean Institute of Electrical Engineers 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.