• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.257-263
• /
• 2002

A graph embedding problem has been studied for applications of resource allocation and mapping the underlying data structure of a parallel algorithm into the interconnection architecture of massively parallel processing systems. In this paper, we consider the embedding problem of the pyramid into the regular 2-dimensional mesh interconnection network topology. We propose a new embedding function which can embed the pyramid of height N into 2$^{N}$ x2$^{N}$ 2-dimensional mesh with dilation max{2$^{N1}$-2. [3.2$^{N4}$＋1)/2, 2$^{N3}$＋2. [3.2$^{N4}$＋1)/2]}. This means an improvement in the dilation measure from 2$^{N}$ $^1$in the previous result into about (5/8) . 2$^{N1}$ under the same condition.condition.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1218-1225
• /
• 2005

The effort to expand digital contents market and get more users is growing. This is being done by interconnecting the existing broadcasting data services and two-way data services in mobile network with the terrestrial DMB transmitting system. However, the interconnection is not easy because various data service system uses difference protocols to transmit digital contents and the receiving protocol of terrestrial DMB system is the standardized one. In this paper, we designed and implemented the middleware structured system, trying to minimize problems and difficulties in the interconnection of the data service system and terrestrial DMB transmitting system. We considered the readiness of the extension of the various transmitting method in the various data service systems and also implemented Terrestrial DMB Data Inserter system that transmits contents data on the broadcasting schedule.

• Communications of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.435-445
• /
• 2017

Let D be a directed graph with p vertices and q arcs. A vertex out-magic total labeling is a bijection f from $V(D){\cup}A(D){\rightarrow}\{1,2,{\ldots},p+q\}$ with the property that for every $v{\in}V(D)$, $f(v)+\sum_{u{\in}O(v)}f((v,u))=k$, for some constant k. Such a labeling is called a V-super vertex out-magic total labeling (V-SVOMT labeling) if $f(V(D))=\{1,2,3,{\ldots},p\}$. A digraph D is called a V-super vertex out-magic total digraph (V-SVOMT digraph) if D admits a V-SVOMT labeling. In this paper, we provide a method to find the most vital nodes in a network by introducing the above labeling and we study the basic properties of such labelings for digraphs. In particular, we completely solve the problem of finding V-SVOMT labeling of generalized de Bruijn digraphs which are used in the interconnection network topologies.

• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.184-194
• /
• 1999

We present a new algorithm to minimize channel contention while sending multiple messages from multiple source to overlapped destination set on Multistage Interconnection Network (MIN) which supports wormhole routed turnaround routing. The multicast tree of the U-MIN(Unicast MIN) algorithm is useful in performing messages from one source to multiple destination but gives rise to a serious channel connection in performing multiple multicast because it has been designed for only single multicast. For multiple multicast communication on MIN, we address how to implement multiple multicast services efficiently. And a SPU-MIN(Source Partitioned Unicast MIN) algorithm is proposed and shown to be superior than the U-MIN algorithm for multiple multicast. The turnaround routing algorithm based on wormhole routing technique is employed as a message sending method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1201-1209
• /
• 1991

Generally, the conventional tracking algorithms are very limited in the practical applications because of its exponential increase in the required computation time for the number of targets being tracked. Therefore, in this paper, a new real-time moving target tracking system is proposed, which is based on the neural networks with massive parallel processing capabilities. Through the theoretical and experimental results, the target tracking system based on neural network algorithm is analyzed to be computationally independent of the number of objects being tracked and performs the optimized tracking through its massive parallel computation and learning capabilities. And this system also has massive matched filtering effects because the moving target data can be compactly stored in the interconnection weights by learning. Accordingly, a possibility of the proposed neural network target tracking system can be suggested to the fields of real-time application.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.271-286
• /
• 2011

In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.9 no.1
• /
• pp.17-24
• /
• 1972

A method utilizing vector representation is investigated for determining a faulty elenlent in passive and active networks by simple external measurements. A large system may be considered as an interconnection of a number of subnetlvorks. By utilizing the relationships between the magintudes of a transfer function at various frequencies and the deviations of a circuit element, the fault simulation curves can be drawn. The fault identification regions are defined from the fault simulation curves. A fault identlfication matrix is constructed corresponding the defined fault identification regions. The fault identification matrix, when premultiplied by a vector whose components are measured from a network, yieldg another vector whose components identify a network element which is faulty. A test procedure for the fault identification method is presented and verified by experiments.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.71-78
• /
• 1989

To estimate a performance of MIM's a network modeling method and a simulation algorithm are proposed, and this algorithm is programmed by C language. Especially, state variables are defined to process many concurrent requests ar inputs and a data structure, which contains network informations, is proposed to keep track of each stage. This simulation can be applied to computers which are designed for sequential processing. This method can be used to estimate a performance of MIN's instead of using complex mathematical method.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.11
• /
• pp.63-75
• /
• 1998

Since many co-articulation problems are occurring in continuous spoken Korean language, several researches use words as a basic recognition unit. Though the word unit can solve this problem, it requires much memory and has difficulty fitting an input speech in a word list. In this paper, we propose an hidden Markov model(HMM) based recognition model that is an interconnection network of word HMMs for a syntax of sentences. To match suitably the input sentence into the continuous word list in the network, we use a level building search algorithm. This system represents the large sentence set with a relatively small memory and also has good extensibility. The experimental result of an airplane reservation system shows that it is proper method for a practical recognition system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1346-1363
• /
• 1994

Packet voice protocols have been realized in many research works. But few studies for the interconnection of LAN and PABX to facilitate the voice communication have been done. In this paper, the gateway to interconnect the Ethernet LAN with the existing PABX telephone network for voice communication has been designed and implemented. The implemented gateway protocol is a modified protocol based on CCITT`s G.764 packetized voice protocol. To accomplish this goal the hardware system has been realized, which is divided into five parts: interface part with the telephone line, voice-processing part, PC interface part, controller part, and finally DTMF part. And the gateway software is divided into three parts: interface to make use of the packet driver which drives the network card, driver to drive the PABX gateway, and the protocol handling part.