• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.421-428
• /
• 2008

A. Ghafoor proposed Even networks as a class of fault-tolerant multiprocessor networks in [1] and analyzed so many useful properties include node disjoint paths. By introducing node disjoint paths in [1], fault diameter of Even networks is d+2(d=odd) and d+3(d=even). But the lengths of node disjoint paths proved in [1] are not the shortest. In this paper, we show that Even network Ed is node symmetric. We also propose the shortest lengths of node disjoint paths using cyclic permutation, and fault diameter of Even networks is d+1.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.7
• /
• pp.318-326
• /
• 2008

In this paper, we will analyze embedding among Folded Hypercube, Even Network and Odd Network to further improve the network cost of Hypercube. We will show Folded Hypercube $FQ_n$ can be embedded into Even Network $E_{n-1}$ with dilation 2, congestion 1 and Even Network $E_d$ can be embedded into Folded Hypercube $FQ_{2d-3}$ with dilation 1. Also, we will prove Folded Hypercube $FQ_n$ can be embedded into Odd Network $O_{n-1}$ with dilation 2, congestion 1 and Odd Network $O_d$ can be embedded into Folded Hypercube $FQ_{2d-3}$ with dilation 2, congestion 1. Finally, we will show Even Network $E_d$ can be embedded into Odd Network $O_d$ with dilation 2, congestion 1 and Odd Network $O_d$ can be embedded into Folded Hypercube $E_{d-1}$ with dilation 2, congestion 1.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.88-94
• /
• 1994

Inverse Chebyshev function can realize the same order of Chebyshev function nuder the same specification. In general, inverse Chebyshev function has the preferable characteristics in terms of the delay characteristics and the time-domain performances compare with Chebyshev function. However, for the even order n, inverse Chebyshev function does not realize in the doubly-terminated ladder network which has preferable sensitivity characteristics because of the finite value at ${\omega}={\infty}$. In this paper, the modified inverse Chebyshev function with $\mid$H($j^{\infty}$$\mid$=0 s proposed to realize the passive doubly-terminated ladder network for the n even or odd. The modified inverse Chebyshev function characteristics ars studied in the frequency and time domain, and then, realize the passive doubly-terminated ladder network.

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.113-120
• /
• 2010

Even networks were introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties and algorithms such as simple routing algorithms, maximal fault tolerance, node disjoint path. Introduced routing algorithms and node disjoint path algorithms are proven to be optimal. However, it has not been introduced to constructing scheme for edge-disjoint spanning trees in even networks. The design of edge-disjoint spanning trees is a useful scheme to analyze for measuring the efficiency of fault tolerant of interconnection network and effective broadcasting. Introduced routing algorithm or node disjoint path algorithm are for the purpose of routing or node disjoint path hence they are not applicable to constitute edge disjoint spanning tree. In this paper, we show a construction algorithm of edge-disjoint spanning trees in even network $E_d$.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.184-197
• /
• 2015

This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.332-336
• /
• 1991

Network management is responsible for gathering information on the usage of the network media by the network devices, ensuring the correct operation of the network, and providing reports. MAP network management must provide the high reliability of the media and signaling method, even in very harsh environments, providing a very low bit error rate and minimum number of retransmission. In this paper, we analysed the framework of OSI management and MAP network management and discussed the implementation method of fault management and remote management mechanism in the Mini-MAP controller developed for IBM-PC.

• KDI Journal of Economic Policy
• /
• v.36 no.2
• /
• pp.175-196
• /
• 2014

This paper is a theoretical attempt to analyze and understand Yeonjulmang and Yeongyeolmang, which are terms for social networks with negative and positive connotation respectively in Korean Sociology. To do that, we analyze a social network where unilateral help are reciprocated. A social network in this context is a network where the past behaviors of its members are transmitted. With the information how the members behaved before, a social norm can emerge in the network, which facilitate the indirect reciprocation of unilateral help. In this norm, an agent's helping now will be rewarded by his being helped in the future. Since the reward happens in the future, this norm may not be sustained even if it is efficient. To sustain the reciprocation of the help, a norm can evolve to punish the violation of the norm more severely. If the punishment becomes too severe, the reciprocation of the help can be sustained even if it is not efficient any more in that the cost of help exceeds the benefit. If we allow the exit of the network, members have incentive to do it as belonging to the network is not beneficial any more. Then the social network may collapse. To avoid the collapse of the network, the exclusive norm, which exclude even mutually beneficial relationship with outsiders, may emerge. This can explain the emergence of Yeonjulmang, or a closed network, which is inefficient in double senses; 1) it may sustain inefficient reciprocation of help, and 2) the mutually beneficial relationship is excluded between an insider and an outsider of the network.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2009.03a
• /
• pp.456-463
• /
• 2009

The preconsolidation pressure has been commonly determined by oedometer test. However, it can also be determined by in-situ test, such as piezocone test with theoretical and(or) empirical correlations. Recently, Neural Network(NN) theory was applied and some models were proposed to estimate the preconsolidation pressure or OCR. However, since the optimization process of synaptic weights of NN model is dependent on the initial synaptic weights, NN models which are trained with different initial weights can't avoid the variability on prediction result for new database even though they have same structure and use same transfer function. In this study, Committee Neural Network(CNN) model is proposed to improve the initial weight dependency of multi-layered neural network model on the prediction of preconsolidation pressure of soft clay from piezocone test result. It was found that even though the NN model has the optimized structure for given training data set, it still has the initial weight dependency, while the proposed CNN model can improve the initial weight dependency of the NN model and provide a consistent and precise inference result than existing NN models.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.2
• /
• pp.89-97
• /
• 2007

We study the maximum integer multiflow problem and the minimum multicut problem in a ring network. Both problems in a general network are known to be NP-hard. In this paper, we develop polynomial time algorithms to solve the problems. We also prove that even In a ring network, maximum multiflow is not always integral, which implies that the amount of maximum integer flow does not always reach the minimum capacity of multicut.