• Title/Summary/Keyword: Hierarchical Order

Search Result 1,220, Processing Time 0.033 seconds

Analysis on Security Vulnerabilities of a Password-based User Authentication Scheme for Hierarchical Wireless Sensor Networks (계층적 무선 센서 네트워크를 위한 패스워드 기반 사용자 인증 스킴의 보안 취약점 분석)

  • Joo, Young-Do
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.63-70
    • /
    • 2015
  • The numerous improved schemes of user authentication based on password have been proposed in order to prevent the data access from the unauthorized person. The importance of user authentication has been remarkably growing in the expanding application areas of wireless sensor networks. Recently, emerging wireless sensor networks possesses a hierarchy among the nodes which are divided into cluster heads and sensor nodes. Such hierarchical wireless sensor networks have more operational advantages by reducing the energy consumption and traffic load. In 2012, Das et al. proposed a user authentication scheme to be applicable for the hierarchical wireless sensor networks. Das et al. claimed that their scheme is effectively secure against the various security flaws. In this paper, author will prove that Das et al.'s scheme is still vulnerable to man-in-the-middle attack, password guessing/change attack and does not support mutual authentication between the user and the cluster heads.

Automatic Keyword Extraction using Hierarchical Graph Model Based on Word Co-occurrences (단어 동시출현관계로 구축한 계층적 그래프 모델을 활용한 자동 키워드 추출 방법)

  • Song, KwangHo;Kim, Yoo-Sung
    • Journal of KIISE
    • /
    • v.44 no.5
    • /
    • pp.522-536
    • /
    • 2017
  • Keyword extraction can be utilized in text mining of massive documents for efficient extraction of subject or related words from the document. In this study, we proposed a hierarchical graph model based on the co-occurrence relationship, the intrinsic dependency relationship between words, and common sub-word in a single document. In addition, the enhanced TextRank algorithm that can reflect the influences of outgoing edges as well as those of incoming edges is proposed. Subsequently a novel keyword extraction scheme using the proposed hierarchical graph model and the enhanced TextRank algorithm is proposed to extract representative keywords from a single document. In the experiments, various evaluation methods were applied to the various subject documents in order to verify the accuracy and adaptability of the proposed scheme. As the results, the proposed scheme showed better performance than the previous schemes.

Hierarchical Gabor Feature and Bayesian Network for Handwritten Digit Recognition (계층적인 가버 특징들과 베이지안 망을 이용한 필기체 숫자인식)

  • 성재모;방승양
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.1
    • /
    • pp.1-7
    • /
    • 2004
  • For the handwritten digit recognition, this paper Proposes a hierarchical Gator features extraction method and a Bayesian network for them. Proposed Gator features are able to represent hierarchically different level information and Bayesian network is constructed to represent hierarchically structured dependencies among these Gator features. In order to extract such features, we define Gabor filters level by level and choose optimal Gabor filters by using Fisher's Linear Discriminant measure. Hierarchical Gator features are extracted by optimal Gabor filters and represent more localized information in the lower level. Proposed methods were successfully applied to handwritten digit recognition with well-known naive Bayesian classifier, k-nearest neighbor classifier. and backpropagation neural network and showed good performance.

Simulation of Dynamic Behavior of Glucose- and Tryptophan-Grown Escherichia coli Using Constraint-Based Metabolic Models with a Hierarchical Regulatory Network

  • Lee Sung-Gun;Kim Yu-Jin;Han Sang-Il;Oh You-Kwan;Park Sung-Hoon;Kim Young-Han;Hwang Kyu-Suk
    • Journal of Microbiology and Biotechnology
    • /
    • v.16 no.6
    • /
    • pp.993-998
    • /
    • 2006
  • We earlier suggested a hierarchical regulatory network using defined modeling symbols and weights in order to improve the flux balance analysis (FBA) with regulatory events that were represented by if-then rules and Boolean logic. In the present study, the simulation results of the models, which were developed and improved from the previou model by incorporating a hierarchical regulatory network into the FBA, were compared with the experimental outcome of an aerobic batch growth of E. coli on glucose and tryptophan. From the experimental result, a diauxic growth curve was observed, reflecting growth resumption, when tryptophan was used as an alternativee after the supply of glucose was exhausted. The model parameters, the initial concentration of substrates (0.92 mM glucose and 1 mM tryptophan), cell density (0.0086 g biomass/1), the maximal uptake rates of substrates (5.4 mmol glucose/g DCW h and 1.32 mmol tryptophan/g DCW h), and lag time (0.32 h) were derived from the experimental data for more accurate prediction. The simulation results agreed with the experimental outcome of the temporal profiles of cell density and glucose, and tryptophan concentrations.

A detailed information browsing as a standard of the hierarchical structure on 3D national treasure building (3D 건조물 문화재의 계층적 구조를 기반으로 한 상세정보브라우징)

  • Jung, jung-il;Cho, Jin-so
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.816-821
    • /
    • 2009
  • In this paper, I would like to talk about a step by step detailed information browsing which is founded on hierarchical structure for offering suitable information about the mass 3D data of a national treasure building to user as a standard of the visual distance. A step by step detailed information of the national treasure building of gigantic proportions offers a process of detailed information browsing which decided suitable hierarchical structure as considering of the preprocessing procedure which produces hierarchical structure and a visual distance of user. In the preprocessing procedure, 3D data is divided and controlled by optimized spacial structures. The relevance connection between the inner spacial surface is then examined and reconfigured in order to prevent holes or distortions. Finally, relative information data is created. In detailed information browsing, by examining the visual distance between model and user, then by browsing proper step of data, suitable level model data can be provided to the users in accordance with the position of observation.

  • PDF

The Intelligent Control System for Biped Robot Using Hierarchical Mixture of Experts (계층적 모듈라 신경망을 이용한 이동로봇 지능제어기)

  • Choi Woo-Kyung;Ha Sang-Hyung;Kim Seong-Joo;Kim Yong-Taek;Jeon Hong-Tae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.4
    • /
    • pp.389-395
    • /
    • 2006
  • This paper proposes the controller for biped robot using intelligent control algorithm. In order to simplify the complexity of biped robot control, manipulator of biped robot is divided into four modules. These modules are controlled by intelligent algorithm with Hierarchical Mixture of Experts(HME) using neural network. Also neural network having direct control method learns the inverse dynamics of biped robot. The HME, which is a network of tree structure, reallocates the input domain for the output by learning pattern of input and output. In this paper, as a result of learning HME repeatedly with EM algorithm, the controller for biped robot operating safety walking is designed by modelling dynamics of biped robot and generating virtual error of HME.

Similarity Analysis of Hospitalization using Crowding Distance

  • Jung, Yong Gyu;Choi, Young Jin;Cha, Byeong Heon
    • International journal of advanced smart convergence
    • /
    • v.5 no.2
    • /
    • pp.53-58
    • /
    • 2016
  • With the growing use of big data and data mining, it serves to understand how such techniques can be used to understand various relationships in the healthcare field. This study uses hierarchical methods of data analysis to explore similarities in hospitalization across several New York state counties. The study utilized methods of measuring crowding distance of data for age-specific hospitalization period. Crowding distance is defined as the longest distance, or least similarity, between urban cities. It is expected that the city of Clinton have the greatest distance, while Albany the other cities are closer because they are connected by the shortest distance to each step. Similarities were stronger across hospital stays categorized by age. Hierarchical clustering can be applied to predict the similarity of data across the 10 cities of hospitalization with the measurement of crowding distance. In order to enhance the performance of hierarchical clustering, comparison can be made across congestion distance when crowding distance is applied first through the application of converting text to an attribute vector. Measurements of similarity between two objects are dependent on the measurement method used in clustering but is distinguished from the similarity of the distance; where the smaller the distance value the more similar two things are to one other. By applying this specific technique, it is found that the distance between crowding is reduced consistently in relationship to similarity between the data increases to enhance the performance of the experiments through the application of special techniques. Furthermore, through the similarity by city hospitalization period, when the construction of hospital wards in cities, by referring to results of experiments, or predict possible will land to the extent of the size of the hospital facilities hospital stay is expected to be useful in efficiently managing the patient in a similar area.

P-Version Model Based on Hierarchical Axisymmetric Element (계층적 축대칭요소에 의한 P-version모델)

  • Woo, Kwang Sung;Chang, Yong Chai;Jung, Woo Sung
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.12 no.4_1
    • /
    • pp.67-76
    • /
    • 1992
  • A hierarchical formulation based on p-version of the finite element method for linear elastic axisymmetric stress analysis is presented. This is accomplished by introducing additional nodal variables in the element displacement approximation on the basis of integrals of Legendre polynomials. Since the displacement approximation is hierarchical, the resulting element stiffness matrix and equivalent nodal load vectors are hierarchical also. The merits of the propoosed element are as follow: i) improved conditioning, ii) ease of joining finite elements of different polynomial order, and iii) utilizing previous solutions and computation when attempting a refinement. Numerical examples are presented to demonstrate the accuracy, efficiency, modeling convenience, robustness and overall superiority of the present formulation. The results obtained from the present formulation are also compared with those available in the literature as well as with the analytical solutions.

  • PDF

Subtopic Mining of Two-level Hierarchy Based on Hierarchical Search Intentions and Web Resources (계층적 검색 의도와 웹 자원을 활용한 2계층 구조의 서브토픽 마이닝)

  • Kim, Se-Jong;Lee, Jong-Hyeok
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.2
    • /
    • pp.83-88
    • /
    • 2016
  • Subtopic mining is the extraction and ranking of possible subtopics, which disambiguate and specify the search intentions of an input query in terms of relevance, popularity, and diversity. This paper describes the limitations of previous studies on the utilization of web resources, and proposes a subtopic mining method with a two-level hierarchy based on hierarchical search intentions and web resources, in order to overcome these limitations. Considering the characteristics of resources provided by the official subtopic mining task, we extract various second-level subtopics reflecting hierarchical search intentions from web documents, and expand and re-rank them using other provided resources. Terms in subtopics with wider search intentions are used to generate first-level subtopics. Our method performed better than state-of-the-art methods in almost every aspect.

Successive MAP Detection with Soft Interference Cancellation for Iterative Receivers in Hierarchical M-ary QAM Systems (M-레벨 QAM 계층 변조 시스템에서 연 간섭 제거를 이용한 연속 MAP 판정 기법)

  • Kim, Jong-Kyung;Seo, Jong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3C
    • /
    • pp.304-310
    • /
    • 2009
  • This paper proposes a successive MAP (maximum a posteriori probability) detection scheme with SoIC(soft interference cancellation) to reduce the receiver complexity of hierarchical M-ary QAM system. For the successive MAP detection, modulation symbols generated from the other data streams are treated as Gaussian noise or eliminated as the soft interference according to their priorities. The log-likelihood ratio of the a posteriori probability (LAPRP) of each bit is calculated by the MAP detector with an adjusted noise variance in order to take the elimination and Gaussian assumption effect into account. By separating the detection process into the successive steps, the detection complexity is reduced to increase linearly with the number of bits per hierarchical M-ary QAM symbol. Simulation results show that the proposed detection provides a small performance degradation as compared to the optimal MAP detection.