• Title/Summary/Keyword: hierarchical queue

Search Result 26, Processing Time 0.033 seconds

Improvement of Handoff dropping by Separate Queue in Hierarchical Cellular System (계층셀구조에서 계층별 큐를 이용한 핸드오프 강제종료의 개선방안)

  • Kim, Young-il;Seo, Ju-Ha
    • Journal of Industrial Technology
    • /
    • v.22 no.B
    • /
    • pp.175-184
    • /
    • 2002
  • In this paper, we proposed separate queue scheme in each hierarchical cell for effective use of wireless channel. This method reduces the blocking rata of high speed mobile station's handoff in hierarchical cellular systems. Basically for the high speed mobile stations channels are allocated in macrocell and for the low speed mobile stations channels are allocated in microcell. In order to reduce the rate of forced handoff termination, some reservation channels are employed for the fast handoff calls in the macrocells. And the queue is located in each cell to be able to store handoff requests and takeback requests. The overflowed mobile station are able to perform takeback as soon as a corresponding channel is available.

  • PDF

A Real-Time Integrated Hierarchical Temporal Memory Network for the Real-Time Continuous Multi-Interval Prediction of Data Streams

  • Kang, Hyun-Syug
    • Journal of Information Processing Systems
    • /
    • v.11 no.1
    • /
    • pp.39-56
    • /
    • 2015
  • Continuous multi-interval prediction (CMIP) is used to continuously predict the trend of a data stream based on various intervals simultaneously. The continuous integrated hierarchical temporal memory (CIHTM) network performs well in CMIP. However, it is not suitable for CMIP in real-time mode, especially when the number of prediction intervals is increased. In this paper, we propose a real-time integrated hierarchical temporal memory (RIHTM) network by introducing a new type of node, which is called a Zeta1FirstSpecializedQueueNode (ZFSQNode), for the real-time continuous multi-interval prediction (RCMIP) of data streams. The ZFSQNode is constructed by using a specialized circular queue (sQUEUE) together with the modules of original hierarchical temporal memory (HTM) nodes. By using a simple structure and the easy operation characteristics of the sQUEUE, entire prediction operations are integrated in the ZFSQNode. In particular, we employed only one ZFSQNode in each level of the RIHTM network during the prediction stage to generate different intervals of prediction results. The RIHTM network efficiently reduces the response time. Our performance evaluation showed that the RIHTM was satisfied to continuously predict the trend of data streams with multi-intervals in the real-time mode.

A Performance Improvement Study On Hierarchical Clustering (Centroid Linkage) Using A Priority Queue (Priority Queue 를 이용한 Hierarchical Clustering (Centroid Linkage) 성능 개선)

  • Jeon, Yongkweon;Yoon, Sungroh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.1837-1838
    • /
    • 2010
  • 기존 hierarchical clustering 은 Time complexity 와 space complexity 가 Large data set 을 clustering 하기에는 적당하지 못하며 이것을 일반 PC 의 메모리 내에서 해결하는데 어려움이 있다. 따라서 본 연구에서는 이러한 어려움을 극복하기 위해 기존 Hierarchical clustering 중 Centroid Linkage 에 새로운 Algorithm 을 제안하여 보다 적은 메모리를 사용하고 빠르게 처리하는 방법을 제안하고자 한다.

A Production Function for the Organization with Hierarchical Network Queue Structure (계층적(階層的) 네트웍 대기구조(待機構造)를 갖는 조직(組織)의 생산함수(生産函數)에 대한 연구(硏究))

  • Gang, Seok-Hyeon;Kim, Seong-In
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.12 no.1
    • /
    • pp.63-71
    • /
    • 1986
  • In the organization with a hierarchical network queue structure a production function is derived whose input factors are the numbers of servers at nodes and output is the number of served customers. Its useful properties are investigated. Using this production function, the contributions of servers to the number of served customers are studied. Also given an expected waiting time in the system for each customer, the optimal numbers of servers at nodes are obtained minimizing a cost function.

  • PDF

Efficient Execution of Range $Top-\kappa$ Queries using a Hierarchical Max R-Tree (계층 최대 R-트리를 이용한 범위 상위-$\kappa$ 질의의 효율적인 수행)

  • 홍석진;이상준;이석호
    • Journal of KIISE:Databases
    • /
    • v.31 no.2
    • /
    • pp.132-139
    • /
    • 2004
  • A range $Top-\kappa$ query returns top k records in order of a measure attribute within a specified region on multi-dimensional data, and it is a powerful tool for analysis in spatial databases and data warehouse environments. In this paper, we propose an algorithm for answering the query via selective traverse of a Hierarchical Max R-Tree(HMR-tree). It is possible to execute the query by accessing only a small part of the leaf nodes in the query region, and the query performance is nearly constant regardless of the size of the query region. The algorithm manages the priority queue efficiently to reduce cost of handling the queue and the proposed HMR-tree can guarantee the same fan-out as the original R-tree.

A Study on the Intelligent Load Management System Based on Queue with Diffusion Markov Process Model (확산 Markov 프로세스 모델을 이용한 Queueing System 기반 지능 부하관리에 관한 연구)

  • Kim, Kyung-Dong;Kim, Seok-Hyun;Lee, Seung-Chul
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.5
    • /
    • pp.891-897
    • /
    • 2009
  • This paper presents a novel load management technique that can lower the peak demand caused by package airconditioner loads in large apartment complex. An intelligent hierarchical load management system composed of a Central Intelligent Management System(CIMS) and multiple Local Intelligent Management Systems(LIMS) is proposed to implement the proposed technique. Once the required amount of the power reduction is set, CIMS issues tokens, which can be used by each LIMS as a right to turn on the airconditioner. CIMS creates and maintains a queue for fair and proper allocation of the tokens among the LIMS requesting tokens. By adjusting the number tokens and queue management policies, desired power reduction can be achieved smoothly. The Markov Birth and Death process and the Balance Equations utilizing the Diffusion Model are employed for evaluation of queue performances during transient periods until the static balances among the states are achieved. The proposed technique is tested using a summer load data of a large apartment complex and give promising results demonstrating the usability in load management while minimizing the customer inconveniences.

Fault Diagnosis Method of Complex System by Hierarchical Structure Approach (계층구조 접근에 의한 복합시스템 고장진단 기법)

  • Bae, Yong-Hwan;Lee, Seok-Hee
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.11
    • /
    • pp.135-146
    • /
    • 1997
  • This paper describes fault diagnosis method in complex system with hierachical structure similar to human body structure. Complex system is divided into unit, item and component. For diagnosing this hierarchical complex system, it is necessary to implement special neural network. Fault diagnosis system can forecast faults in a system and decide from current machine state signal information. Comparing with other diagnosis system for single fault, the developed system deals with multiple fault diagnosis comprising Hierarchical Neural Network(HNN). HNN consists of four level neural network, first level for item fault symptom classification, second level for item fault diagnosis, third level for component symptom classification, forth level for component fault diagnosis. UNIX IPC(Inter Process Communication) is used for implementing HNN wiht multitasking and message transfer between processes in SUN workstation with X-Windows(Motif). We tested HNN at four units, seven items per unit, seven components per item in a complex system. Each one neural newtork operate as a separate process in HNN. The message queue take charge of information exdhange and cooperation between each neural network.

  • PDF

Development of Intelligent Fault Diagnosis System for CIM (CIM 구축을 위한 지능형 고장진단 시스템 개발)

  • Bae, Yong-Hwan;Oh, Sang-Yeob
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.7 no.2
    • /
    • pp.199-205
    • /
    • 2004
  • This paper describes the fault diagnosis method to order to construct CIM in complex system with hierarchical structure similar to human body structure. Complex system is divided into unit, item and component. For diagnosing this hierarchical complex system, it is necessary to implement a special neural network. Fault diagnosis system can forecast faults in a system and decide from the signal information of current machine state. Comparing with other diagnosis system for a single fault, the developed system deals with multiple fault diagnosis, comprising hierarchical neural network (HNN). HNN consists of four level neural network, i.e. first is fault symptom classification and second fault diagnosis for item, third is symptom classification and forth fault diagnosis for component. UNIX IPC is used for implementing HNN with multitasking and message transfer between processes in SUN workstation with X-Windows (Motif). We tested HNN at four units, seven items per unit, seven components per item in a complex system. Each one neural network represents a separate process in UNIX operating system, information exchanging and cooperating between each neural network was done by message queue.

  • PDF

The Effects of Management Traffic on the Local Call Processing Performance of ATM Switches Using Queue Network Models and Jackson's Theorem

  • Heo, Dong-Hyun;Chung, Sang-Wook;Lee, Gil-Haeng
    • ETRI Journal
    • /
    • v.25 no.1
    • /
    • pp.34-40
    • /
    • 2003
  • This paper considers a TMN-based management system for the management of public ATM switching networks using a four-level hierarchical structure consisting of one network management system, several element management systems, and several agent-ATM switch pairs. Using Jackson's queuing model, we analyze the effects of one TMN command on the performance of the component ATM switch in processing local calls. The TMN command considered is the permanent virtual call connection. We analyze four performance measures of ATM switches- utilization, mean queue length and mean waiting time for the processor directly interfacing with the subscriber lines and trunks, and the call setup delay of the ATM switch- and compare the results with those from Jackson's queuing model.

Local Watershed and Region Merging Algorithm for Object Segmentation (객체분할을 위한 국부적 워터쉐드와 영역병합 알고리즘)

  • Yu, Hong-Yeon;Hong, Sung-Hoon
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.299-300
    • /
    • 2006
  • In this paper, we propose a segmentation algorithm which combines the ideas from local watershed transforms and the region merging algorithm based hierarchical queue. Only the process of watershed and region merging algorithm can be restricted area. A fast region merging approach is proposed to extract the video object from the regions of watershed segmentation. Results show the effectiveness and convenience of the approach.

  • PDF