• Annals of Geriatric Medicine and Research
• /
• v.20 no.3
• /
• pp.149-159
• /
• 2016

Background: Since the mid-20th century, the ways in which social networks and older adults' health are related have been widely studied. However, few studies investigate the relationship between self-rated health and position in a complete social network of one entire Korean rural village. This study highlights use of a complete network in health studies. Methods: Using the Korean Social Life and Health Project, the population-based data of adults aged 60 or older and their spouses in one myeon in Ganghwa island (Ganghwa-gun, Incheon, Korea), Incheon, Korea (with a 95% response rate), this study built a $1,012{\times}1,012$ complete social network matrix of the village. The data were collected from 2011 to 2012, and 731 older adults were analyzed. The ordered logistic models to predict self-rated health allowed us to examine social factors from socio-demographic to individual community activities, ego-centered network characteristics, and positions in a complete network. Results: From the network data, 5 network components were identified. Even after controlling for all other factors, if a respondent belonged to a segregated component, the probability that he or she reported good health dropped substantially. Additionally, high in-degree centrality was connected to greater self-rated health. Conclusion: This finding highlights the importance of social position not only from the respondents' point of view but also from the entire village's perspective. Even if a respondent maintained a large social network, when all of those social ties belonged to a segregated group in the village, the respondent's health suffered from this segregation.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.28-34
• /
• 2021

Internet Service Providers (ISPs) constantly endeavor to resolve network congestion, in order to provide fast and cheap services to the customers. This study suggests two models based on Markov chain, using three and four access attempts to complete the call. It involves a comparative study of four models to check the relationship between Internet Access sharing traffic, and the possibility of network jamming. The first model is a Markov chain, based on call-by-call attempt, whereas the second is based on two attempts. Models III&IV suggested by the authors are based on the assumption of three and four attempts. The assessment reveals that sometimes by increasing the number of attempts for the same operator, the chances for the customers to complete the call, is also increased due to blocking probabilities. Three and four attempts express the actual relationship between traffic sharing and blocking probability based on Markov using MATLAB tools with initial probability values. The study reflects shouting results compared to I&II models using one and two attempts. The success ratio of the first model is 84.5%, and that of the second is 90.6% to complete the call, whereas models using three and four attempts have 94.95% and 95.12% respectively to complete the call.

• ETRI Journal
• /
• v.27 no.4
• /
• pp.355-366
• /
• 2005

Automatic discovery of physical topology plays a crucial role in enhancing the manageability of modern metro Ethernet networks. Despite the importance of the problem, earlier research and commercial network management tools have typically concentrated on either discovering logical topology, or proprietary solutions targeting specific product families. Recent works have demonstrated that network topology can be determined using the standard simple network management protocol (SNMP) management information base (MIB), but these algorithms depend on address forwarding table (AFT) entries and can find only spanning tree paths in an Ethernet mesh network. A previous work by Breibart et al. requires that AFT entries be complete; however, that can be a risky assumption in a realistic Ethernet mesh network. In this paper, we have proposed a new physical topology discovery algorithm which works without complete knowledge of AFT entries. Our algorithm can discover a complete physical topology including inactive interfaces eliminated by the spanning tree protocol in metro Ethernet networks. The effectiveness of the algorithm is demonstrated by implementation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.639-642
• /
• 2003

본 논문에서는 청소로봇이 전 청소 영역을 CCPP(Complete Coverage Path Planning)를 이용해 경로를 생성한 후 재 경로계획 시 장애물의 미소한 변화로도 기존에 생성한 전 경로패턴을 바꾸지 않고 수정 할 수 있는 CD(Cell Decomposition)와 FN(Flow Network)을 이용한 CCPP 방식을 제안 하였다. 그리고 제안된 경로 계획에 대해 시뮬레이션으로 결과를 제시하였다.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.132-140
• /
• 2021

Under the mobile ad-hoc network system, the main reason for causing congestion is because of the limited availability of resources. On the other hand, the standardised TCP based congestion controlling mechanism is unable to control and handle the major properties associated with the shared system of wireless channels. It creates an effect on the design associated with suitable protocols along with protocol stacks through the process of determining the mechanisms of congestion on a complete basis. Moreover, when bringing a comparison with standard TCP systems the major environment associated with mobile ad hoc network is regraded to be more problematic on a complete basis. On the other hand, an agent-based mobile technique for congestion is designed and developed for the part of avoiding any mode of congestion under the ad-hoc network systems.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.539-541
• /
• 1990

A new neural network model, based on the Hopfield's crossbar associative network, is presented and shown to be an effective tool for the NP-Complete problems. This model is applied to a class of layer assignment problems for VLSI routing. The results indicate that this modified Hopfield model improves stability and accuracy.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.3
• /
• pp.145-155
• /
• 2004

The design of a communication network has long been a challenging optimization problem. Since the optimal design of a network topology is a well known as a NP-complete problem, many researches have been conducted to obtain near optimal solutions in polynomial time instead of exact optimal solutions. All of these researches suggested diverse heuristic algorithms that can be applied to network design problems. Among these algorithms, a simulated annealing algorithm has been proved to guarantee a good solution for many NP-complete problems. in applying the simulated annealing algorithms to network design problems, generating mechanisms for initial solutions and candidate solutions play an important role in terms of goodness of a solution and efficiency. This study aims at analyzing these mechanisms through experiments, and then suggesting reliable mechanisms.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.479-482
• /
• 1998

Whether a given tree is a subgraph of the interconnection network topology is one of the important problem in parallel computing. Trees are used as the underlying structure for divide and conquer algorithms and provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among those trees. Binomial trees play an important role in broadcasting messages in parallel networks. If binomial trees can be efficiently embedded in complex binary trees, broadcasting algorithms can be effeciently performed on the interconnection networks. In this paper, we present average dilation 2 embedding of binomial trees in complete binary trees.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.135-139
• /
• 2006

Today's social networking services have tens of millions of users, and are growing fast. Their sheer size poses a significant challenge in capturing and analyzing their topological characteristics. Snowball sampling is a popular method to crawl and sample network topologies, but requires a high sampling ratio for accurate estimation of certain metrics. In this work, we evaluate how close topological characteristics of snowball sampled networks are to the complete network. Instead of using a synthetically generated topology, we use the complete topology of Cyworld ilchon network. The goal of this work is to determine sampling ratios for accurate estimation of key topological characteristics, such as the degree distribution, the degree correlation, the assortativity, and the clustering coefficient.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.12
• /
• pp.3063-3072
• /
• 1993

The layout is an important and difficult problem in industrial applications like sheet metal manufacturing, garment making, circuit layout, plant layout, and land development. The module layout problem is known to be non-deterministic polynomial time complete(NP-complete). To efficiently find an optimal layout from a large number of candidate layout configuration a heuristic algorithm could be used. In recent years, a number of researchers have investigated the combinatorial optimization problems by using neural network principles such as traveling salesman problem, placement and routing in circuit design. This paper describes the application of Self-organizing Feature Maps(SOM) of the Kohonen network and Simulated Annealing Algorithm(SAA) to the layout problem of the two-dimensional rectangular shapes.