• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3236-3246
• /
• 2000

XML is a meta-language as SGML and also can be xonsructed as an Internet versionof simplified SGML being used in confunction with XLL. Xpointer and XSL. Also W3C established DTDless Well-Formed XML document to use XML document on the Web. But it isnt offered system that consists of browsing, link and DTD generating facihty, and efficiently processes DTDless Well-Formed XML document. This paper studies on an implementation and design of system to process DTDless Well-Formed XML document on the client-side. This system consists of Well-Formed XML viewer displaying Well-Formed XML documet, XLL Processor processing Xll and Auto DTD generator constructing automatically DTDs based on multiple documents of the same class. This study focuses on automatic DTD generation during hyperlink navigation and an implementation of extended links based on XLL and Xpointer. ID and Xpointer location address are used as the address mode in the links. As a result of implement of this system, it conforms to validationof extended link facihties, extracts DTD from Well-Fromed XML Documents including same root element at the same class and constructs generalized DTD.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.751-759
• /
• 2008

Carrier Ethernet backbone network integrates distributed layer-2 based metro networks. In this networks, Multiple Spanning Tree Protocol (MSTP) has been uscd as a main routing protocol that allows multiple spanning trees in a network. A better routing protocol called IEEE802.1aq - Shortest Path Bridging (SPB) is recently proposed, that generates the shortest spanning tree per a destination node. As SPB provides a routing path per a destination node, there is no way to adapt network traffic at normal condition. If we are free from the principle of "a spanning tree per a destination node", we can achieve adaptive routing. Based on this philosophy, we propose a new spanning tree based protocol - Edge Node Divided Spanning Tree (ENDIST). ENDIST divides an edge node into sub-nodes as many as connecting links from the node and each sub-node generates a single shortest path tree based on SPB. Depending on network or nodal status, ENDIST chooses a better routing path by flow-basis. This added traffic engineering ability contributes to enhanced throughput and reduced delay in backbone networks. The simulation informs us that ENDIST's throughput under heavy load performs about 3.4-5.8 and 1.5-2.0 times compared with STP's and SPB's one respectively. Also, we verified that ENDIST's throughput corresponds to the theoretical upper bound at half of cases we investigated. This means that the proposed ENDIST is a dramatically enhanced and the close-to-perfect spanning tree based routing schemes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.18-25
• /
• 2014

To increase wireless capacity, the concurrent use of multiple wireless interfaces on different frequency bands, called aggregation, can be considered. In this paper, we focus on aggregation of multiple Wi-Fi interfaces with packet-level traffic spreading between the interfaces. Two aggregation schemes, link bonding and multipath TCP (MPTCP), are tested and compared in a dualband Wi-Fi radio system with their Linux implementation. Various test conditions such as traffic types, network delay, locations, interface failures and configuration parameters are considered. Experimental results show that aggregation increases throughput performance significantly over the use of a single interface. Link bonding achieves lower throughput than MPTCP due to duplicate TCP acknowledgements (ACKs) resulting from packet reordering and filtering such duplicate ACKs out is considered as a possible solution. However, link bonding is fast responsive to links' status changes such as a link failure. It is shown that different combinations of interface weights for packet spread in link bonding result in different throughput performance, envisioning a spatio-temporal adaptation of the weights. We also develop a mathematical model of power consumption and compare the power efficiency of the schemes applying different power consumption profiles.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.73-80
• /
• 2004

In this paper, we present the cell resequencing buffer to solve the cell sequence integrity problem of the Cyclic banyan network that is a high-performance fault-tolerant cell switch. By offering multiple paths between input ports and output ports, using the deflection self-routing, the Cyclic banyan switch offer high reliability, and it also solves congestion problem for the internal links of the switch. By the way, these multiple paths can be different lengths for each other. Therefore, the cells departing from an identical source port and arriving at an identical destination port can reach to the output port as the order that is different from the order arriving at input port. The proposed cell resequencing buffer is a hardware sliding window mechanism. to solve such cell sequence integrity problem. To calculate the size of sliding window that cause the prime cost of the presented device, we analyzed the distribution of the cell delay through the simulation analyses under traffic load that have a nonuniform address distribution that express tile Property of traffic of the Internet. Through these analyses, we found out that we can make a cell resequencing buffer by which the cell sequence integrity is to be secured, by using a, few of ordinary memory and control logic. The cell resequencing buffer presented in this paper can be used for other multiple paths switching networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2831-2847
• /
• 2017

In this paper, a joint destination-relay selection and antenna mode selection scheme for full-duplex (FD) relay network is investigated, which consists of one source node, N FD amplify-and-forward (AF) relays and M destination nodes. Multiple antennas are configured at the source node, and beamforming technique is adopted. Two antennas are employed at each relay, one for receiving and the other for transmitting. Only one antenna is equipped at each destination node. In the proposed scheme, the best destination node is firstly selected according to the direct links between the source node and destination nodes. Then the transmit and receive mode of two antennas at each relay is adaptively selected based on the relaying link condition. Meanwhile, the best relay with the optimal Tx/Rx antenna configuration is selected to forward the signals. To characterize the performance of the proposed scheme, the closed-form expression of the outage probability is derived; meanwhile, the simple asymptotic expressions are also obtained. Our analysis shows that the proposed scheme obtains the benefits of multi-relay diversity and multi-destination diversity. Moreover, extra space diversity in the medium SNR region can be achieved due to the antenna selection at the relay. Finally, Monte-Carlo simulations are provided to consolidate the analytical results, and show the effectiveness of the proposed scheme.

• Korean Journal of Health Education and Promotion
• /
• v.28 no.2
• /
• pp.109-123
• /
• 2011

Objectives: The purpose of the present study was to explore the relationships between views on suicide, death, and life and lifetime suicidal attempts in the Korean context. Methods: Multiple logistic regression model was tested using data from Korean General Social Survey of 2009. We utilized the nationally representative survey data obtained via multistage stratified area probability sampling design from 1,599 respondents aged ${\geq}18$ years. Results: The proportion of lifetime suicidal attempts was 12.1% of entire sample in Korea. Some components of views on suicide and death influenced significantly on lifetime suicidal attempts after adjusting for demographic and health-related factors. The positive view on suicide(OR=0.76, 95% CI: 0.62-0.94), the naturalistic view on afterlife(OR=0.37, 95% CI: 0.67-0.99) and death concern(OR=0.67, 95% CI: 0.55-0.83) were risk factors of lifetime suicidal attempts. In contrast, the social responsibility view on suicide(OR=1.17, 95% CI: 1.00-1.37) and the transcendental view on afterlife(OR=1.25, 95% CI: 1.02-1.54) lowered the risk. Conclusions: Practical implications of the findings were discussed exploring policy evidences to screen high risk groups out and to reframe educational programs for suicide prevention. Strategic health messages need to be developed and transmitted for prevention of suicide.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.407-411
• /
• 2005

KUGI (Korean UniGene Information) database contains the annotation information of the cDNA sequences obtained from the disease samples prevalent in Korean. A total of about 157,000 5'-EST high throughput sequences collected from cDNA libraries of stomach, liver, and some cancer tissues or established cell lines from Korean patients were clustered to about 35,000 contigs. From each cluster a representative clone having the longest high quality sequence or the start codon was selected. We stored the sequences of the representative clones and the clustered contigs in the KUGI database together with their information analyzed by running Blast against RefSeq, human mRNA, and UniGene databases from NCBI. We provide a web-based search engine fur the KUGI database using two types of user interfaces: attribute-based search and similarity search of the sequences. For attribute-based search, we use DBMS technology while we use BLAST that supports various similarity search options. The search system allows not only multiple queries, but also various query types. The results are as follows: 1) information of clones and libraries, 2) accession keys, location on genome, gene ontology, and pathways to public databases, 3) links to external programs, and 4) sequence information of contig and 5'-end of clones. We believe that the KUGI database and search system may provide very useful information that can be used in the study for elucidating the causes of the disease that are prevalent in Korean.

• Journal of Preventive Medicine and Public Health
• /
• v.46 no.6
• /
• pp.336-345
• /
• 2013

Objectives: Research has shown that obesity appears to spread through social ties. However, the association between other characteristics of social networks and obesity is unclear. This study aimed to identify the association between social network characteristics and body mass index (BMI, $kg/m^2$) in an elderly Korean population. Methods: This cross-sectional study analyzed data from 657 Koreans (273 men, 384 women) aged 60 years or older who participated in the Korean Social Life, Health, and Aging Project. Network size is a count of the number of friends. Density of communication network is the number of connections in the social network reported as a fraction of the total links possible in the personal (ego-centric) network. Average frequency of communication (or meeting) measures how often network members communicate (or meet) each other. The association of each social network measure with BMI was investigated by multiple linear regression analysis. Results: After adjusting for potential confounders, the men with lower density (<0.71) and higher network size (4-6) had the higher BMI (${\beta}$=1.089, p=0.037) compared to the men with higher density (>0.83) and lower size (1-2), but not in the women (p=0.393). The lowest tertile of communication frequency was associated with higher BMI in the women (${\beta}$=0.885, p=0.049), but not in the men (p=0.140). Conclusions: Our study suggests that social network structure (network size and density) and activation (communication frequency and meeting frequency) are associated with obesity among the elderly. There may also be gender differences in this association.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1098-1107
• /
• 1999

In multimedia applications, a source usually generates multiple streams. By heterogeneous multimedia multicast, we mean a recipient can receive some of them, not necessarily all of them. A recipient bids for what it wants to receive and the source gains the same amount when a connection is established. The problem of distributing streams for heterogeneous multicast to maximize the source's gain, can be solved using a 0-1 integer programming, hewn as NP-complete. In this paper, we propose efficient stream distribution algorithms in two different types of multicast models. The first restricted model assumes that the capacity for a link in the multicast tree is grater than or equal to the capacities of its descendant links. In the second unrestricted model, we drop out the restriction in the restricted model. Proposed algorithms have better time and space complexities compared with any existing one. In addition, distributed implementations are straightforward, which is very useful for large networks.