• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.536-543
• /
• 2011

The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.7
• /
• pp.433-439
• /
• 2014

This paper proposes an architecture of two-stage string matching engine with content-addressable memory(CAM) and parallel bit-split string matchers for deep packet inspection(DPI). Each long signature is divided into subpatterns with the same length, where subpatterns are mapped onto the CAM in the first stage. The long pattern is matched in the second stage using the sequence of the matching indexes from the CAM. By adopting CAM and bit-split string matchers, the memory requirements can be greatly reduced in the heterogeneous string matching environments.

• Journal of Digital Contents Society
• /
• v.8 no.2
• /
• pp.107-112
• /
• 2007

With the evolution to distributed computing technology, the concept of conventional client/server function has been advanced to Service-Oriented Architecture, which can share the information between heterogeneous systems as services. To success Service-Oriented Architecture, the conjunction between business layer and application layer is one of the important techniques. In this paper, we classify services into two views, vertical and horizontal, and introduce matching technique with service classification for SOA.

• Journal of Korean Society for Geospatial Information Science
• /
• v.22 no.3
• /
• pp.121-128
• /
• 2014

This study investigated the accuracy of DEM generated by heterogeneous stereo satellite images based on RPC. Heterogeneous sensor images with different spatial resolution are SPOT-5 panchromatic and IKONOS images. For the accuracy evaluation of the DEM, we compared the DEMs generated from two kinds of sensors and that produced using homogeneous SPOT-5 and IKONOS stereo images. As results of the evaluation, accuracy of 3D positioning by heterogeneous images was substantially similar to that of homogeneous stereo images for exact conjugate points. But, in terms of quality of the DEM, DEM generated by heterogeneous sensor showed a lower accuracy about twice in RMSE and about 3 times in LE90 than that of homogeneous sensors. As a result, DEM can be generated by using heterogenous satellite imagery. But if we use a stereo image with different spatial resolution, the performance of image matching was very important factor for the production of high-quality DEM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.218-224
• /
• 2001

The objective of Distributed Parallel Computing is to solve the computationally intensive problems, which have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. In this paper, we propose a computational model including the generalized graph representation method of distributed parallel systems for speedup analysis, and analyze how the super-linear speedup is achieved when scheduling of programs with diverse embedded parallelism modes onto a distributed heterogeneous supercomputing network environment. The proposed representation method can also be applied to simple homogeneous or heterogeneous systems whose components are heterogeneous only in terms of the processor speed. In order to obtain the core speedup, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled while minimizing the communication overhead.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.3
• /
• pp.208-214
• /
• 2021

Recently, much of the intelligent security scenario and criminal investigation demands for matching photo and non-photo. Existing face recognition system can not sufficiently guarantee these needs. In this paper, we propose an algorithm to improve the performance of heterogeneous face recognition systems by reducing the different modality between sketches and photos of the same person. The proposed algorithm extracts each image's texture features through texture descriptors (gray level co-occurrence matrix, multiscale local binary pattern), and based on this, generates a transformation matrix through eigenfeature regularization and extraction techniques. The score value calculated between the vectors generated in this way finally recognizes the identity of the sketch image through the score normalization methods.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2007.04a
• /
• pp.311-315
• /
• 2007

Since the first phase of NGIS (National Geographic Information System) project was launched in 1988, various types and spatial database has been produced and updated. With recent developments in the information technology, the application of spatial data has increased in amount as well as in the coverage of the area of interest. There is a need for production and management of a nationwide single continuous digital map. This paper looks into three problems of map edge matching when dealing with such a task : 1) different scales of adjacent maps, 2) different time of capture between adjacent maps, and 3) different responsible organization where map matching has not been peformed along the boundary.

• Journal of the Korea Convergence Society
• /
• v.8 no.11
• /
• pp.85-91
• /
• 2017

This paper concerns the design of a matching module system enabling the RF signal to be harmonized between the new base stations (RRH) and the repeater in the same frequency band of the asynchronous transfer network. This matching system controls the RF Gain Control of the module while monitoring the quality of the quality. Additionally, the RF environment has been adapted accordingly to adjust the RF Gain Control to match the receiver characteristics of the relay. As a result of this study, we improved the quality of the interface between the new base stations and existing relays.

• Journal of the Korea Society for Simulation
• /
• v.12 no.4
• /
• pp.25-40
• /
• 2003

With the growing usage of the networks, the world-wide Internet has become the main means to exchange data and carry out transactions. It has also become the main means to attack hosts. To solve the security problems which occur in the network such as Internet, we import software products of network security elements like an IDS (Intrusion Detection System) and a firewall. In this paper, we have designed and constructed the general simulation environment of network security model composed of multiple IDSes and a firewall which coordinate by CNP (Contract Net Protocol) for the effective detection of the intrusion. The CNP, the methodology for efficient integration of computer systems on heterogeneous environment such as distributed systems, is essentially a collection of agents, which cooperate to resolve a problem. Command console in the CNP is a manager who controls the execution of agents or a contractee, who performs intrusion detection. In the network security model, each model of simulation environment is hierarchically designed by DEVS(Discrete Event system Specification) formalism. The purpose of this simulation is that the application of rete pattern-matching algorithm speeds up the inference cycle phases of the intrusion detection expert system and we evaluate the characteristics and performance of CNP architecture with rete pattern-matching algorithm.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.197-206
• /
• 2003

With the growing usage of the networks, the world-wide Internet has become the main means to exchange data and carry out transactions. It has also become the main means to attack hosts. To solve the security problems which occur in the network such as Internet, we import software products of network security elements like an IDS (Intrusion Detection System) and a firewall. In this paper, we have designed and constructed the General Simulation Environment of Network Security model composed of multiple IDSes and a firewall which coordinate by CNP (Contract Net Protocol) for the effective detection of the intrusion. The CNP, the methodology for efficient integration of computer systems on heterogeneous environment such as distributed systems, is essentially a collection of agents, which cooperate to resolve a problem. Command console in the CNP is a manager who controls tie execution of agents or a contractee, who performs intrusion detection. In the Network Security model, each model of simulation environment is hierarchically designed by DEVS (Discrete EVent system Specification) formalism. The purpose of this simulation is to evaluate the characteristics and performance of CNP architecture with rete pattern matching algorithm and the application of rete pattern matching algorithm for the speeding up the inference cycle phases of the intrusion detection expert system.