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

검색결과 277건 처리시간 0.023초

Framework for End-to-End Optimal Traffic Control Law Based on Overlay Mesh

  • Liu, Chunyu;Xu, Ke
    • Journal of Communications and Networks
    • /
    • 제9권4호
    • /
    • pp.428-437
    • /
    • 2007
  • Along with the development of network, more and more functions and services are required by users, while traditional network fails to support all of them. Although overlay is a good solution to some demands, using them in an efficient, scalable way is still a problem. This paper puts forward a framework on how to construct an efficient, scalable overlay mesh in real network. Main differences between other overlays and ours are that our overlay mesh processes some nice features including class-of-service(CoS) and traffic engineering(TE). It embeds the end-to-end optimal traffic control law which can distribute traffic in an optimal way. Then, an example is given for better understanding the framework. Particularly, besides good scalability, and failure recovery, it possesses other characteristics such as routing simplicity, self-organization, etc. In such an overlay mesh, an applicable source routing scheme called hierarchical source routing is used to transmit data packet based on UDP protocol. Finally, a guideline derived from a number of simulations is proposed on how to set various parameters in this overlay mesh, which makes the overlay more efficient.

An Internet-based computing framework for the simulation of multi-scale response of structural systems

  • Chen, Hung-Ming;Lin, Yu-Chih
    • Structural Engineering and Mechanics
    • /
    • 제37권1호
    • /
    • pp.17-37
    • /
    • 2011
  • This paper presents a new Internet-based computational framework for the realistic simulation of multi-scale response of structural systems. Two levels of parallel processing are involved in this frame work: multiple local distributed computing environments connected by the Internet to form a cluster-to-cluster distributed computing environment. To utilize such a computing environment for a realistic simulation, the simulation task of a structural system has been separated into a simulation of a simplified global model in association with several detailed component models using various scales. These related multi-scale simulation tasks are distributed amongst clusters and connected to form a multi-level hierarchy. The Internet is used to coordinate geographically distributed simulation tasks. This paper also presents the development of a software framework that can support the multi-level hierarchical simulation approach, in a cluster-to-cluster distributed computing environment. The architectural design of the program also allows the integration of several multi-scale models to be clients and servers under a single platform. Such integration can combine geographically distributed computing resources to produce realistic simulations of structural systems.

Semiparametric Bayesian Estimation under Structural Measurement Error Model

  • Hwang, Jin-Seub;Kim, Dal-Ho
    • Communications for Statistical Applications and Methods
    • /
    • 제17권4호
    • /
    • pp.551-560
    • /
    • 2010
  • This paper considers a Bayesian approach to modeling a flexible regression function under structural measurement error model. The regression function is modeled based on semiparametric regression with penalized splines. Model fitting and parameter estimation are carried out in a hierarchical Bayesian framework using Markov chain Monte Carlo methodology. Their performances are compared with those of the estimators under structural measurement error model without a semiparametric component.

어닐링에 의한 Hierarchical Mixtures of Experts를 이용한 시계열 예측 (Prediction of Time Series Using Hierarchical Mixtures of Experts Through an Annealing)

  • 유정수;이원돈
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 1998년도 가을 학술발표논문집 Vol.25 No.2 (2)
    • /
    • pp.360-362
    • /
    • 1998
  • In the original mixtures of experts framework, the parameters of the network are determined by gradient descent, which is naturally slow. In [2], the Expectation-Maximization(EM) algorithm is used instead, to obtain the network parameters, resulting in substantially reduced training times. This paper presents the new EM algorithm for prediction. We show that an Efficient training algorithm may be derived for the HME network. To verify the utility of the algorithm we look at specific examples in time series prediction. The application of the new EM algorithm to time series prediction has been quiet successful.

  • PDF

COMPUTATIONAL MODELING OF KANSEI PROCESSES FOR HUMAN-CENTERED INFORMATION SYSTEMS

  • Kato, Toshikazu
    • 한국감성과학회:학술대회논문집
    • /
    • 한국감성과학회 2002년도 춘계학술대회 논문집
    • /
    • pp.3-8
    • /
    • 2002
  • This paper introduces the basic concept of computational modeling of perception processes for multimedia data. Such processes are modeled as hierarchical inter- and intra- relationships amongst information in physical, physiological, psychological and cognitive layers in perception. Based on our framework, this paper gives the algorithms for content-based retrieval for multimedia database systems.

  • PDF

Hierarchical Topology/parameter Evolution in Engineering Design

  • 서기성
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2005년도 춘계학술대회 학술발표 논문집 제15권 제1호
    • /
    • pp.185-188
    • /
    • 2005
  • This paper suggests a control method for efficient topology/parameter evolution in a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynamic systems, We adopt a hierarchical breeding control mechanism with fitness-level-dependent differences to obtain better balancing of topology/parameter search - biased toward topological changes at low fitness levels, and toward parameter changes at high fitness levels. As a testbed for this approach, an eigenvalue assignment problem, which is to find bond graph models exhibiting minimal distance errors from target sets of eigenvalues, was tested and showed improved performance for various sets of eigenvalues.

  • PDF

Semiparametric Bayesian estimation under functional measurement error model

  • Hwang, Jin-Seub;Kim, Dal-Ho
    • Journal of the Korean Data and Information Science Society
    • /
    • 제21권2호
    • /
    • pp.379-385
    • /
    • 2010
  • This paper considers Bayesian approach to modeling a flexible regression function under functional measurement error model. The regression function is modeled based on semiparametric regression with penalized splines. Model fitting and parameter estimation are carried out in a hierarchical Bayesian framework using Markov chain Monte Carlo methodology. Their performances are compared with those of the estimators under functional measurement error model without semiparametric component.

수단-목적 사슬 이론을 이용한 의복품질 평가과정에 잔한 이론적 연구 (Apparel Quality Evaluation Process bused on Means- Bnd Chain Theory: A Theoretical Study)

  • 오현정;이은영
    • 한국의류학회지
    • /
    • 제22권4호
    • /
    • pp.452-459
    • /
    • 1998
  • The purpose of this study was to discover a conceptual framework and evaluation process of apparel quality by means-end chain theory. The theoretical study was conducted to find out a conceptual framework and build a hypothetical evaluation process model of apparel quality. Apparel quality was perceived associative network called a means-end chain and was evaluated in several stages. A conceptual framework of apparel quality evaluation was organized into hierarchical relationships among four different dimensions: physical attribute, physical function, instrumental performance, and expressive performance. The means-end structure linked tangible physical attributes and function to more abstract instrumental and expressive performance. A hypothetical evaluation process model linked dimensions of apparel quality to the selected means-end relationship. Different consumers had different means-end chains for the same apparel. Therefore different subjects are likely to have different evaluation paths. From this study we can suggest an evaluation process model of apparel quality.

  • PDF

SDN-Based Hierarchical Agglomerative Clustering Algorithm for Interference Mitigation in Ultra-Dense Small Cell Networks

  • Yang, Guang;Cao, Yewen;Esmailpour, Amir;Wang, Deqiang
    • ETRI Journal
    • /
    • 제40권2호
    • /
    • pp.227-236
    • /
    • 2018
  • Ultra-dense small cell networks (UD-SCNs) have been identified as a promising scheme for next-generation wireless networks capable of meeting the ever-increasing demand for higher transmission rates and better quality of service. However, UD-SCNs will inevitably suffer from severe interference among the small cell base stations, which will lower their spectral efficiency. In this paper, we propose a software-defined networking (SDN)-based hierarchical agglomerative clustering (SDN-HAC) framework, which leverages SDN to centrally control all sub-channels in the network, and decides on cluster merging using a similarity criterion based on a suitability function. We evaluate the proposed algorithm through simulation. The obtained results show that the proposed algorithm performs well and improves system payoff by 18.19% and 436.34% when compared with the traditional network architecture algorithms and non-cooperative scenarios, respectively.

Symbolic Cluster Analysis for Distribution Valued Dissimilarity

  • Matsui, Yusuke;Minami, Hiroyuki;Misuta, Masahiro
    • Communications for Statistical Applications and Methods
    • /
    • 제21권3호
    • /
    • pp.225-234
    • /
    • 2014
  • We propose a novel hierarchical clustering for distribution valued dissimilarities. Analysis of large and complex data has attracted significant interest. Symbolic Data Analysis (SDA) was proposed by Diday in 1980's, which provides a new framework for statistical analysis. In SDA, we analyze an object with internal variation, including an interval, a histogram and a distribution, called a symbolic object. In the study, we focus on a cluster analysis for distribution valued dissimilarities, one of the symbolic objects. A hierarchical clustering has two steps in general: find out step and update step. In the find out step, we find the nearest pair of clusters. We extend it for distribution valued dissimilarities, introducing a measure on their order relations. In the update step, dissimilarities between clusters are redefined by mixture of distributions with a mixing ratio. We show an actual example of the proposed method and a simulation study.