• Title/Summary/Keyword: Hierarchical

Search Result 6,929, Processing Time 0.041 seconds

Hierarchical Decentralized Supervisory Control of Discrete Event Systems

  • Kim, Seong-Gyu;Lim, Jong-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.73.6-73
    • /
    • 2001
  • In this paper, we consider a hierarchical decentralized supervisory control of discrete event systems underpartial observation in two-level hierarchical structure since the observability is a practical and general property in modeling of real systems. Hierarchical consistencies of controllability and observability on the hierarchical decentralized supervisory control are investigated and relevant conditions are proposed to ensure such hierarchical consistencies.

  • PDF

Hierarchical Fair Queueing: A Credit-based Approach for Hierarchical Link Sharing

  • Jun, Andrew Do-Sung;Choe, Jin-Woo;Leon-Garcia, Alberto
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.209-220
    • /
    • 2002
  • In this paper, we propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, Hierarchical Generalized Processor Sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. The H-GPS model is decomposed into two separate service components: the guaranteed service component to consistently provide performance guarantees over the entire system, and the excess service component to fairly distribute spare bandwidth according to the hierarchical scheduling rule. For tight and harmonized integration of the two service components into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called Hierarchical Fair Queueing (HFQ). We demonstrate the layerindependent performance of the HFQ algorithm through simulation results.

Bayes Estimation in a Hierarchical Linear Model

  • Park, Kuey-Chung;Chang, In-Hong;Kim, Byung-Hwee
    • Journal of the Korean Statistical Society
    • /
    • v.27 no.1
    • /
    • pp.1-10
    • /
    • 1998
  • In the problem of estimating a vector of unknown regression coefficients under the sum of squared error losses in a hierarchical linear model, we propose the hierarchical Bayes estimator of a vector of unknown regression coefficients in a hierarchical linear model, and then prove the admissibility of this estimator using Blyth's (196\51) method.

  • PDF

Definition of hierarchical attributed random graph and proposal of its applications (계층적 속성 랜덤 그래프의 정의 및 이를 이용한 여러 응용들의 소개)

  • 성동수
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.8
    • /
    • pp.79-87
    • /
    • 1997
  • For the representation of a complex object, the object is decomposed into several parts, and it is described by these decomposed parts and their relations. In genral, the parts can be the primitive elements that can not be decomposed further, or can be decomposed into their subparts. Therefore, the hierarchical description method is very natural and it si represented by a hierarchical attributed graph whose vertieces represent either primitive elements or graphs. This graphs also have verties which contain primitive elements or graphs. When some uncertainty exists in the hierarchical description of a complex object either due to noise or minor deformation, a probabilistic description of the object ensemble is necessary. For this purpose, in this paper, we formally define the hierarchical attributed random graph which is extention of the hierarchical random graph, and erive the equations for the entropy calculation of the hierarchical attributed random graph, and derive the equations for the entropy calculation of the hierarchical attributed random graph. Finally, we propose the application areas to use these concepts.

  • PDF

Hierarchical Task Planning through Abstraction of World Elements and Operators (월드 엘리먼트와 오퍼레이터의 추상화에 기반한 효율적인 계층적 작업계획)

  • Park, Young-Bin;Suh, Il-Hong;Choi, Byung-Uk
    • The Journal of Korea Robotics Society
    • /
    • v.2 no.3
    • /
    • pp.262-269
    • /
    • 2007
  • Hierarchical Planning based on Abstraction of World Elements and Operators(HiPAWO) is proposed for mobile robots task planning, where abstraction of world elements is used for hierarchical planning and abstraction of operators is used for hierarchical decomposition of abstracted actions. Especially, a hierarchical domain theory based on JAH(Joint of Action Hierarchy)-graph is proposed to improve efficiency of planning, where a number of same actions are included in both adjacent hierarchical levels of domain theories to provide relationships between adjacent hierarchical levels. To show the validities of our proposed HiPAWO, experimental results are illustrated and will be compared with two other classical planning methods.

  • PDF

A Survey of Advances in Hierarchical Clustering Algorithms and Applications

  • Munshi, Amr
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.5
    • /
    • pp.17-24
    • /
    • 2022
  • Hierarchical clustering methods have been proposed for more than sixty years and yet are used in various disciplines for relation observation and clustering purposes. In 1965, divisive hierarchical methods were proposed in biological sciences and have been used in various disciplines such as, and anthropology, ecology. Furthermore, recently hierarchical methods are being deployed in economy and energy studies. Unlike most clustering algorithms that require the number of clusters to be specified by the user, hierarchical clustering is well suited for situations where the number of clusters is unknown. This paper presents an overview of the hierarchical clustering algorithm. The dissimilarity measurements that can be utilized in hierarchical clustering algorithms are discussed. Further, the paper highlights the various and recent disciplines where the hierarchical clustering algorithms are employed.

Ban-mal and Hierarchical Structures : Professor Chung′s Theory Critically Examined (반말과 계층 구조 -정대현 교수의 반말 이론에 대한 비판적 검토-)

  • 선우환
    • Lingua Humanitatis
    • /
    • v.5
    • /
    • pp.93-106
    • /
    • 2003
  • Professor Daihyun Chung has recently presented an intriguing view of Ban-mal(non-honorific expressions) in Korean. He criticizes uses of Ban-mal, on the grounds that they presuppose the existence of hierarchical structures in human beings. Professor Chung also advocates ″a relational theory of Ban-mal″ according to which ascriptions of 'n-mal' should be relativized to the speaker-hearer relationship. He employs this view in showing that uses of Ban-mal indeed presuppose the existence of hierarchical structures in human beings I claim that Professor Chung has not shown the credibility of his relational theory of Ban-mal, and that this very view leads to an unintended and undesirable consequence. Moreover, 1 show that even if we assume that this view is true for the sake of an argument, he is not able to show that uses of Ban-mal indeed presuppose the existence of hierarchical structures. All he can show is rather that uses of 'Ban-mal'(a meta-linguistic expression) presuppose the existence of hierarchical structures. Finally, 1 conclude that what really presupposes the existence of hierarchical structures is the asymmetrical uses of Ban-mal and honorific expressions.

  • PDF

An Analysis of Time-Bound Hierarchical Key Management Scheme for Secure Broadcasting (안전한 브로드 캐스팅을 위한 Time-Bound Hierarchical Key Management 스킴 비교 분석)

  • Kim, Hyun-Cheol;Goo, Woo-Guen;Lee, Jun-Ho;Lee, Dong-Hoon
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.556-558
    • /
    • 2008
  • Secure broadcasting is requirement for payment of TV systems, government or company. Hierarchical key management for access control provides efficient key management in those environment. Also, time-bound hierarchical key management technique generates different keys in each time period. In 2004, Tzeng proposed a time-bound cryptgraphic key assignment scheme for access control in a hierarchy and in 2008, Bertino et al proposed an efficient time-bound hierarchical key management scheme for secure broadcasting. Tzeng's scheme and Bertino et al's scheme are organized in different environment and primitive. In this paper, we analysis above two time-bound hierarchical key management scheme.

  • PDF

Superhydrophobic ZnO nano-in-micro hierarchical structure fabricated by nanoimprint lithography

  • Jo, Han-Byeol;Byeon, Gyeong-Jae;Gwon, Mu-Hyeon;Lee, Heon
    • Proceedings of the Korean Institute of Surface Engineering Conference
    • /
    • 2012.05a
    • /
    • pp.153-153
    • /
    • 2012
  • 자연계에는 다양한 생물체들의 표면 구조가 특수한 기능을 갖는 형태로 되어 있다. 이와 같이 특수한 기능을 갖는 생물체들의 표면 구조는 일반적으로 화학적 조성과 표면의 더불어 나노와 마이크로 구조가 혼합되어 있는, 이른바 hierarchical 구조를 보인다. 그 중에서도 표면 초소수성 특성을 보이는 연잎의 표면과 같은 hierarchical 구조는 self-cleaning effect 등의 기능성 표면 제작에 활용이 가능하여 이를 모사하기 위한 연구가 활발히 진행중에 있다. 이에 본 연구에서는 연잎과 같은 초소수성을 띄는 ZnO nano-in-micro hierarchical 구조를 저온 공정을 통하여 다양한 기판에 제작하였다. 이를 위하여 ZnO 나노 입자 분산 레진을 제작하였고 UV imprinting 과 수열합성법을 통하여 마이크로 패턴 상부에 ZnO 나노 입자가 형성된 ZnO nano-in-micro hierarchical 구조를 형성하였다. 제작된 ZnO hierarchical 구조의 젖음 특성은 표면 접촉각이 $160^{\circ}C$이상인 초소수성을 보였으며, 제작 공정에는 고온의 열처리가 수반되지 않아 PET film 등 다양한 기판에 ZnO hierarchical 구조를 제작할 수 있었다.

  • PDF

One-Pot Electrochemical Synthesis of Hierarchical Porous Niobium

  • Joe, Gihwan;Shin, Heon-Cheol
    • Journal of Electrochemical Science and Technology
    • /
    • v.12 no.2
    • /
    • pp.257-265
    • /
    • 2021
  • In this study, we report niobium (Nb) with hierarchical porous structure produced by a one-pot, HF-free electrochemical etching process. It is proved experimentally that a well-defined hierarchical porous structure is produced from the combination of a limited repetition of pulse etching and high concentration of aggressive anion (i.e., SO42-), which results in hierarchical pores with high order over 3. A formula is derived for the surface area of porous Nb as a function of the hierarchical order of pores while the experimental surface area is estimated on the basis of the electrochemical gas evolution rate on porous Nb. From the comparison of the theoretical and experimental surface areas, an in-depth understanding was gained about porous structure produced in this work in terms of the actual pore shape and hierarchical pore order.