• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.325-327
• /
• 2004

'생물정보학'이란 생물학적 데이터를 처리, 가공하여 정보를 얻어내는 연구 분야로 이 중 대사체학은 대사 경로 네트워크를 가시화하여 생명 활동을 이해하고자 하는 분야로, 대사 경로 내의 흐름을 한 눈에 알 수 있도록 가시화하여 보여 주는 도구가 반드시 필요하다 따라서 본 논문에서는 새로운 '대사 경로 드로잉 알고리즘'을 제안하였다. 대사 경로 그래프의 구조로는 이분 그래프를 이용하여 가독성을 높였으며. 이 그래프가 척도 없는(scale-free) 네트워크 구조라는 것과 구조적으로 환형, 계층적 선형 컴포넌트를 가진다는 것을 고려하여 사이즈가 큰 그래프도 적절하게 드로잉 하도록 하였다.

• Journal of Family Resource Management and Policy Review
• /
• v.27 no.3
• /
• pp.1-19
• /
• 2023

This study aims to develop a family strength scale for dual-earner families with young children. Based on existing theories of family strength and a review of related literature, we draw on 80 items to measure the strength of dual-earner families. Using a sample of 747 people, all members of dual-earner families with young children, we examined the items' factor structures. Using the statistical method, we checked the validity and reliability of these items. The final scale consisted of four domains with a total of 49 items : basic foundation (basic structure, economic life, and resource management), parenting, social interest and participation (citizenship, volunteer, leisure, network), work-life balance (balance between work and family, sharing the family role, equal division of role). The developed scale can be used in the field, such as in the Healthy Family Support Center or Family Center, in the context of education, counseling, or consulting for dual-earner families. In order to enhance the usefulness and efficiency of the scale, the adequate education system for the professionals who handle this scale in the field and updated data are required.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.9
• /
• pp.493-502
• /
• 2002

The connectivity and edge-connectivity have been the prime deterministic measure of fault tolerance in multicomputer networks. These parameters have a problem that they do not differentiate the different types of disconnected graphs which result from removing the disconnecting vertices or disconnecting edges. To compensate for this shortcoming, one can utilize generalized measures of connectedness such as superconnectivity, toughness, scattering number, vertex-integrity, binding number, and restricted connectivity. In this paper, we analyze such deterministic measures of fault tolerance in recursive circulants and hypercubes, and compare them in terms of fault tolerance.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.648-653
• /
• 2010

The non-metric multidimensional scaling (nMDS) is a method for analyzing the relation among objects by mapping them onto the Euclidean space. The nMDS is useful when it is difficult to use the concept of distance between pairs of objects due to non-metric dissimilarities between objects. The nMDS can be regarded as an optimization problem in which there are many local optima. Since the conventional nMDS algorithm utilizes the steepest descent method, it has a drawback in that the method can hardly find a better solution once it falls into a local optimum. To remedy this problem, in this paper, we applied the simulated annealing to the nMDS and proposed a new optimization algorithm which could search for a global optimum more effectively. We examined the algorithm using benchmarking problems and found that improvement rate of the proposed algorithm against the conventional algorithm ranged from 0.7% to 3.2%. In addition, the statistical hypothesis test also showed that the proposed algorithm outperformed the conventional one.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1215-1223
• /
• 2014

In multi-hop wireless networks, a message transmission path is set up on demand by a route discovery step, where a shortest path is used in general. The shortest path, however, normally uses the nodes near the center area, which causes a high traffic load in that area and reduces the message transmission reliability. We propose a stable routing protocol considering the remaining energy of nodes. Our protocol uses ETX as a link performance estimator and tries to avoid the nodes with smaller energy. By doing this, we can reduce the route failure probability and packet loss. We have evaluated the performance of the proposed protocol using QualNet and compared with AODV and MRFR protocols. The simulation result shows that our protocol has a similar performance as MRFR in terms of end-to-end message reception ratio, average message delay and delay jitter, but outperforms MRFR in terms of traffic load distribution.

• Journal of the Korean Geographical Society
• /
• v.47 no.6
• /
• pp.975-992
• /
• 2012

This study analyzed the citation count of papers and authors in the field of human geography through the multidimensional scaling and social network analysis with the papers and their references published in Journal of Korean Geographical Society(Geography). The major findings of this study are as follows. Group formation of common approaches in intelligent network has not formed by cited literature in the field of human geography of a journal representing Korea. Then, each researcher should study consistently on a subject to form a school rather than diversify the field and subject of study. They also need to increase the citation count by accumulating research work with a high degree of completion. In addition, many universities with a lot of enrolled graduate students of master's and doctorate course have a responsibility to encourage the formation of school. Meanwhile, if the master's and doctoral dissertations are not official publications unlike journals, the citation of them should be avoided institutionally because it is the unique phenomena of Korea.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.815-818
• /
• 2015

AODV routing protocol, one of the most studied routing protocols for the Mobile Ad hoc Network (MANET), uses the number of hops as the metric to choose a path from a source node to a destination node. If the path is deteriorated, it will cause many problems to the communication. In order to improve the performance of the network, we propose AuM-AODV routing protocol that contains an auxiliary metric besides the number of hops. Nodes using AuM-AODV use control packets such as Route Request (RREQ), Route Reply (RREP), and HELLO to exchange information about network topology like AODV routing protocol. AuM-AODV routing protocol is implemented in NS-3 for performance evaluation. We use three performance metrics, that is to say, throughput, packet delivery ratio, and average end-to-end delay. According to numerical results, the new AuM-AODV routing protocol has better performance over three performance metrics than AODV routing protocol.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.119-124
• /
• 1995

물류네트워크에서 다루는 문제들은 물류거점의 입지문제, 물류거점의 재고문 제, 수배송문제로 크게 분류해 볼수 있으며 특히 이들 각 문제들은 복합적으 로 관련되어 있는 것이 사실이다. 이러한 물류네트워크모형을 수리적으로 표 현해보면 대규모 혼합 정수계획법이 되어 최적 해를 구하기가 매우 어려울 뿐더러 현실적으로 유리된 가정이 불가피하다. 수리모형의 비현실적인 가정 들을 가능한 줄이고 현실적으로 응용 가능한 방법론을 제시하는 것이 본 연 구의 목적이다. 때문에 단일 최적 해를 찾는 수리계획법 대신 대안별로 분 석.비교평가 할 수 있는 네트워크 시뮬레이션 기법을 이용하였다. 평가척도 는 비용인자와 서비스 수준을 이용하지만 시뮬레이션 기법의 유연성으로 인 해 다양한 평가인자를 접목시킬수 있는 가능성을 제공하였다. 현실성과 실용 성에 주안을 둔 본 연구는 프로그래밍 되어 분석 및 계획수립과정에 활용되 어질수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.466-468
• /
• 2003

무선 센서 네트워크에서의 에너지 효율은, 네트워크 및 노드의 운용시간에 직접 영향을 미치므로, 지연시간과 같은 일반 성능척도 이상으로 중요하다. 본 논문에서는 에너지 소모의 관점에서 정적 애드혹 센서 네트워크에서의 멀티캐스트 프로토콜들을 재평가하고, 멀티캐스트에서의 에너지 소모의 분석적 모델을 제안한다. 멀티캐스트 프로토콜은 멀티캐스트 패킷이 다수의 수신자들에게 전달되는 네트워크 구조에 따라, 크게 트리기반(tree­based) 멀티캐스트와 메쉬기반(mesh­based) 멀티캐스트로 분류된다. 메쉬기반 프로토콜은 링크 장애에 강하여 높은 신뢰성을 갖는 반면에, 트리기반 멀티캐스트는 높은 에너지 효율을 나타낸다. 그 이유는 메쉬기반 프로토콜은 메쉬 내에서 플러딩(flooding)에 의존하고 메쉬 내의 노드는 모든 멀티캐스트 패킷을 수신해야 하기 때문이다. 본 논문에서 제안한 에너지 소모의 분석적 모델에 의하면, 메쉬기반 멀티캐스트는 메쉬 내의 브로드캐스기반 플러딩으로 인하여 트리기반 멀티캐스트에 비하여 약 (f + 1)/2 배의 에너지를 더 소모한다. 여기서 f 는 평균 노드 연결도를 나타낸다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.262-262
• /
• 2004