• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.650-661
• /
• 2005

As the Internet is growing, the use of XML which is a standard of semi-structured document is increasing. Therefore, there are on going works about integration and retrieval of XML documents. However, the basis of efficient integration and retrieval of documents is to cluster XML documents with similar structure. The conventional XML clustering approaches use the hierarchical clustering algorithm that produces the demanded number of clusters through repeated merge, but it have some problems that it is difficult to compute the similarity between XML documents and it costs much time to compare similarity repeatedly. In order to address this problem, we use clustering algorithm for transactional data that is scale for large size of data. In this paper we use common structures from XML documents that don't have DTD or schema. In order to use common structures of XML document, we extract representative structures by decomposing the structure from a tree model expressing the XML document, and we perform clustering with the extracted structure. Besides, we show efficiency of proposed method by comparing and analyzing with the previous method.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.1
• /
• pp.82-89
• /
• 2004

This paper describes how to reduce the effect of an occupation threshold by that the transform of mixture components of HMM parameters is controlled in hierarchical tree structure to prevent from over-adaptation. To reduce correlations between data elements and to remove elements with less variance, we employ PCA (principal component analysis) and ICA (independent component analysis) that would give as good a representation as possible, and decline the effect of over-adaptation. When we set lower occupation threshold and increase the number of transformation function, ordinary WLLR adaptation algorithm represents lower recognition rate than SI models, whereas the proposed MLLR adaptation algorithm represents the improvement of over 2% for the word recognition rate as compared to performance of SI models.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1995.10a
• /
• pp.185-190
• /
• 1995

Conventional alarm system has many difficulties in the operator's identifying the plant status during special situations such as design basis accidents. To solve the shortcomings, an on-line alarm annunciator system, called dynamic alarm console (DAC), was developed. In the DAC, a signal is generated as alarm by the use of an adaptive setpoint check strategy based on operating mode, and time delay technique is used not to generate nuisance alarms. After alarm generation, if activated alarm is a level precursor alarm or a consequencial alarm, it would be suppressed, and the residual alarms go through dynamic prioritization which provide the alarms with pertinent priorities to the current operating mode. Dynamic prioritization is achieved by going through the system- and mode-oriented prioritization. The DAC has the alarm hierarchical structure based on the physical and functional importance of alarms. Therefore the operator can perceive alarm impacts on the safety or performance of the plant with the alarm propagation from equipment level to plant functional level. In order to provide the operator with the most possible cause of the event and quick cognition of the plant status even without recognizing the individual alarms, reactor trip status tree (RTST) was developed. The DAC and the RTST have been simulated with on-line data obtained from the full-scope simulator for several abnormal cases. The results indicated that the system can provide the operator with useful and compact information fur the earlier termination and mitigation of an abnormal state.

• Asian-Australasian Journal of Animal Sciences
• /
• v.25 no.2
• /
• pp.170-176
• /
• 2012

Genetic diversities, population genetic structures and demographic histories of the thread-sail filefish Stephanolepis cirrhifer were investigated by nucleotide sequencing of 336 base pairs of the mitochondrial DNA (mtDNA) control region in 111 individuals collected from six populations in Korean coastal waters. A total of 70 haplotypes were defined by 58 variable nucleotide sites. The neighbor-joining tree of the 70 haplotypes was shallow and did not provide evidence of geographical associations. Expansion of S. cirrhifer populations began approximate 51,000 to 102,000 years before present, correlating with the period of sea level rise since the late Pleistocene glacial maximum. High levels of haplotype diversities ($0.974{\pm}0.029$ to $1.000{\pm}0.076$) and nucleotide diversities (0.014 to 0.019), and low levels of genetic differentiation among populations inferred from pairwise population FST values (-0.007 to 0.107), support an expansion of the S. cirrhifer population. Hierarchical analysis of molecular variance (AMOVA) revealed weak but significant genetic structures among three groups ($F_{CT}$ = 0.028, p<0.05), and no genetic variation within groups (0.53%; $F_{SC}$ = 0.005, p = 0.23). These results may help establish appropriate fishery management strategies for stocks of S. cirrhifer and related species.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.10
• /
• pp.761-765
• /
• 2009

This research aims an optimal placement of Mobile Base Station (MBS) under HAP based network configurations with the restrictions of HAP capabilities. With clustering algorithm based on BIRCH, mobile ground nodes are clustered and the centroid of the clusters will be the location of MBS. The hierarchical structure of BIRCH enables mobile node management by CF tree and the restrictions of maximum nodes per MBS and maximum radio coverage are accomplished by splitting and merging clusters. Mobility models based on Jeju island are used for simulations and such restrictions are met with proper placement of MBS.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.7
• /
• pp.539-544
• /
• 2003

This paper describes how to reduce the effect of an occupation threshold by that the transform of mixture components of HMM parameters is controlled in hierarchical tree structure to prevent from over-adaptation. To reduce correlations between data elements and to remove elements with less variance, we employ PCA (Principal component analysis) and ICA (independent component analysis) that would give as good a representation as possible, and decline the effect of over-adaptation. When we set lower occupation threshold and increase the number of transformation function, ordinary MLLR adaptation algorithm represents lower recognition rate than SI models, whereas the proposed MLLR adaptation algorithm represents the improvement of over 2% for the word recognition rate as compared to performance of SI models.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.582-591
• /
• 2015

A massive distributed storage system is the foundation for big data operations. Access latency performance is a key metric in distributed storage systems since it greatly impacts user experience while existing codes mainly focus on improving performance such as storage overhead and repair cost. By generating parity nodes from parity nodes, in this paper we design new XOR-based erasure codes hierarchical tree structure code (HTSC) and high failure tolerant HTSC (FH HTSC) to reduce access latency in distributed storage systems. By comparing with other popular and representative codes, we show that, under the same repair cost, HTSC and FH HTSC codes can reduce access latency while maintaining favorable performance in other metrics. In particular, under the same repair cost, FH HTSC can achieve lower access latency, higher or equal failure tolerance and lower computation cost compared with the representative codes while enjoying similar storage overhead. Accordingly, FH HTSC is a superior choice for applications requiring low access latency and outstanding failure tolerance capability at the same time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5819-5840
• /
• 2018

Considering the topology of hierarchical tree structure, each cluster in WSNs is faced with various attacks launched by malicious nodes, which include network eavesdropping, channel interference and data tampering. The existing intrusion detection algorithm does not take into consideration the resource constraints of cluster heads and sensor nodes. Due to application requirements, sensor nodes in WSNs are deployed with approximately uncorrelated security weights. In our study, a novel and versatile intrusion detection system (IDS) for the optimal defense strategy is primarily introduced. Given the flexibility that wireless communication provides, it is unreasonable to expect malicious nodes will demonstrate a fixed behavior over time. Instead, malicious nodes can dynamically update the attack strategy in response to the IDS in each game stage. Thus, a multi-stage intrusion detection game (MIDG) based on Bayesian rules is proposed. In order to formulate the solution of MIDG, an in-depth analysis on the Bayesian equilibrium is performed iteratively. Depending on the MIDG theoretical analysis, the optimal behaviors of rational attackers and defenders are derived and calculated accurately. The numerical experimental results validate the effectiveness and robustness of the proposed scheme.

• Development and Reproduction
• /
• v.24 no.4
• /
• pp.327-335
• /
• 2020

Genomic DNA (gDNA) extracted from two populations of natural and cultured river pufferfish (Takifugu obscurus) was amplified by polymerase chain reaction (PCR). The complexity of the fragments derived from the two locations varied dramatically. The genetic distances (GDs) between individuals numbered 15 and 12 in the cultured population was 0.053, which was the lowest acknowledged. The oligonucleotide primer OPC-11 identified 88 unique loci shared within each population reflecting the natural population. The OPC-05 primer identified 44 loci shared by the two populations. The average band-sharing (BS) values of individuals in the natural population (0.683±0.014) were lower than in those derived from the cultured population (0.759±0.009) (p<0.05). The shortest GD demonstrating a significant molecular difference was found between the cultured individuals # 15 and # 12 (GD=0.053). Individual # 02 of the natural population was most distantly related to cultured individual # 22 (GD=0.827). A cluster tree was built using the unweighted pair group method with arithmetic mean (UPGMA) Euclidean GD analysis based on a total of 578 various fragments derived from five primers in the two populations. Obvious markers identified in this study represent the genetic structure, species security, and proliferation of river pufferfish in the rivers of the Korean peninsula.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.399-400
• /
• 2009

As a part of the era of human centric applications people started to care about their well being utilizing any possible mean. This paper proposes a framework for real time on-body sensor health-care system, addresses the current issues in such systems, and utilizes an enhanced online divisive agglomerative clustering algorithm (EODAC); an algorithm that builds a top-down tree-like structure of clusters that evolves with streaming data to rationally cluster on-body sensor data and give accurate diagnoses remotely, guaranteeing high performance, and scalability. Furthermore it does not depend on the number of data points.