• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.91-94
• /
• 2004

In this paper, we propose a new parallel computer topology, called the postorder Fibonacci circulants and analyze its properties. It is compared with Fibonacci cubes, when its number of nodes and its degree is kept the same of comparable one. Its diameter is improved from n-2 to [$\frac{n}{3}$] and a its topology is changed from asymmetric to symmetric. It includes Fibonacci cube as a spanning tree.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.167-170
• /
• 2004

We present a novel graph labeling problem called S-edge labeling. The constraint in this labeling is placed on the allowable edge label which is the difference between the labels of endvertices of an edge. Each edge label should be ${ a_n / a_n = 4 a_{n-l}+l,\;a_{n-1}=0}$. We show that every binomial tree is possible S-edge labeling by giving labeling schems to them. The labelings on the binomial trees are applied to their embedings into interconnection networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.743-746
• /
• 2006

In this paper, we propose and analyze a new parallel computer topology, called the Fibonacci posterorder circulants. It connects ${\Large f}_x,\;n{\geq}2$ processing nodes, same the number of nodes used in a comparable Fibonacci cube. Yet its diameter is only ${\lfloor}\frac{n}{3}{\rfloor}$ almost one third that of the Fibonacci cube. Fibonacci cube is asymmetric, but it is a regular and symmetric static interconnection networks for large-scale, loosely coupled systems. It includes scalability and Fibonacci cube as a spanning subgraph.

• Journal of the Korean Data and Information Science Society
• /
• v.7 no.1
• /
• pp.13-19
• /
• 1996

In this paper, we study and compare two types of methods for classification when both continuous and categorical variables are used to describe each individual. One is neural network(NN) method using backpropagation learning(BPL). The other is logistic model(LM) method. Both the NN and LM are based on projections of the data in directions determined from interconnection weights.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.289-292
• /
• 1998

Trees are the underlying structure for divide-and-conquer algorithms and the graphs that provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among trees. Therefore, if complete binary trees can be embedded in binomial trees, the algorithms which are provided by complete binary trees can be performed efficiently on the interconnection networks which have binomial trees as their subgraphs or in which binomial trees can be embedded easily. In this paper, we present dilation 2 embedding of complete binary trees in binomial trees.

• 한국전산유체공학회:학술대회논문집
• /
• 2003.10a
• /
• pp.88-90
• /
• 2003

We implement Realtime Air Diffusion Prediction System which is designed for air diffusion simulations with four-dimensional data assimilation. For realtime running, we parallelize the system using MPI (Message Passing Interface) on distributed-memory parallel computers and build a cluster computer which links high-performance PCs with high-speed interconnection networks. We use 162­CPU nodes and a Myrinet network for the cluster

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2079-2082
• /
• 2002

An interconnection network is called hamiltonian-connected if there exists a hamiltonian path joining every pair of nodes. We consider the problem of adding edges to a mesh to make it hamiltonian- connected. We show that at least two edges are necessary for the problem. Also, we present the method to add two edges to a mesh so that the resulting network is hamiltonian-connected.

• Electronics and Telecommunications Trends
• /
• v.9 no.2
• /
• pp.87-101
• /
• 1994

전기통신 시장에 있어서 경쟁의 도입은 통신 시장의 활성화와 서비스 향상을 위해 필요불가결하다는 결론하에 구미각국을 중심으로 경쟁확대를 추진하고 있다. 이에 우리 나라에서도 통신사업체계의 개편을 통해 그동안 독점으로 운영되어 오던 전화사업의 일부에 경쟁이 이루어지고 있는 실정이고 1994년부터 부가통신사업이 전면 자유화가 이루어질 입장에서 1994년 체신부 주관하에 상호접속전담반에서 제정한 데이터망 접속기준(안)을 중심으로 접속에 필요한 기술적인 면과 정책적인 면을 분석함으로써 데이터망 접속에 필요한 기술사항을 제시하고자 한다.

• 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 Internet Computing and Services
• /
• v.8 no.5
• /
• pp.133-140
• /
• 2007

Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.