• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3896-3909
• /
• 2000

The MPEG Video Service of hilving il property of continuity and large cilPilcity needs lilrge network capilcity. Because most of users have a heterogeneous network environment, it's not efficient way that all users have same size of video data to provide them with real time video service. Therefore, for the pUl1Xlse of an efficient and appropriate utilization of network resources, it requires to develop and deploy a new scalable transmission technique in consideration of respective network environment and individual clients computing power. The purpose of this paper is to develop a technology that can adjust the amount of dilta transmitted as an M1'EG video stream according to its gi yen communication bandwidth, and a technique that can reflect dynamic bilndwidth while playing a video stream. For this purpose, we propose a TFS (Temporal-Fidelity Scaling) technique that splits the MPEG video stream into various substream according to picture type or resolution. Those methods proposed her can filcilitilte an effective use of network resources, and provide multimedia MPEG video services in real- time with respect to individual client computing environment

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.465-472
• /
• 2005

IEEE 802.11 wireless LAN technology is essential for wireless internet, next generation converged network and home network. But, it is certain that user's privacy must be provided to expand the applicable area in IEEE 802.11 WLAN. Recently, WEP and 802.11i security scheme can be used in MAC Layer. But with VPN technology which is applied to WLAN user, it means that suity mechanism is used redundantly. One bit authentication mechanism was already proposed to solve this redundancy. In this paper, we analyze problems of 1-bit Authentication mechanism which are failure of synchronization and waste of packet. And we propose new algorithm which synchronizes sender with receiver, at once, using duplicated-packet-count information. We show that our algorithm improves success probability of packet authentication up to $98\%$ and efficiency of authentication bit stream up to $97\%$.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.531-538
• /
• 2008

With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc network is dynamically to search paths from a source to destination with an efficient routing method, which is an important issue for delay-sensitive real-time application. The main concerns of graph theory in communications are finding connectivity and searching paths using given nodes. A topology of the nodes in ad hoc networks can be modeled as an adjacency matrix. In this paper, based on this adjacency matrix, we propose new path search algorithms using a sequence of matrix calculation. The proposed algorithms can search paths from a destination to a source using connectivity matrix. Two matrix-based algorithms for two different purposes are proposed. Matrix-Based Backward Path Search(MBBS) algorithm is designed for shortest path discovery and Matrix-Based Backward Multipath Search(MBBMS) algorithm is for multipath search.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.677-682
• /
• 2004

In the present paper routing and wavelength assignment (RWA) in optical WDM networks is considered. Previous techniques based on the combination of integer linear programming and graph coloring are complex and require extensive use of heuristics. Such methods are mostly slow and sometimes impossible to get results due to infeasibility. An alternative approach applied to RWA employs on the greedy algorithm for obtaining the maximum edge disjoint paths. Even though this approach is fast, it produces a solution for any connection request, which is very far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow technique to obtain the maximum quantity of edge, disjoint paths. Here we compare the offered method with previous maximum edge disjoint paths algorithms ap plied to the RWA.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.369-374
• /
• 2003

Ant Algorithm is used to find the solution of Combinatorial Optimization Problems. Real ants are capable of finding the shortest path from a food source to their nest without using visual informations. This behavior of real ants has inspired ant algorithm. There are various versions of Ant Algorithm. Ant Colony System (ACS) is introduced lately. ACS is applied to the Traveling Salesman Problem (TSP) for verifying the availability of ACS and evaluating the performance of ACS. ACS find a good solution for TSP When ACS is applied to different Combinatorial Optimization Problems, ACS uses the same parameters and strategies that were used for TSP. In this paper, ACS is applied to the Multicast Routing Problem. This Problem is to find the paths from a source to all destination nodes. This definition differs from that of TSP and differs from finding paths which are the shortest paths from source node to each destination nodes. We introduce parameters and strategies of ACS for Multicasting Routing Problem.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.635-648
• /
• 2004

Extreme programming is the most representative methodology among agile software development methodologies that is agile in business environment which change fast. As software industry is matured, usability of software quality characteristics is emphasized gradually, but effort to obtain usability in extreme programming is insufficient. In this paper, three things lacked in extreme programming are reinforced. First, roles of user interface expert are defined. Second, usability testing method to extreme programming are introduced. Third, development process and products are proposed. The proposed plan is validated by four methods, which analyze supporting software development life cycle, analyze satisfaction of CMM key process areas, analyze satisfaction of CMM practices, and analyze development of green tea shopping mail. Green tea shopping mall is improved 23％ in the estimated running time, 21％ in the learnability. Also, usability is improved 18％ in the heuristic evaluation and 16％ in the questionnaire method.

• The KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.289-298
• /
• 2009

Generally, RFID systems are composed of one reader and several passive tags, and share the single wireless channel. For this reason, collisions occurwhen more than two tags simultaneously respond to the reader's inquiry. To achieve this problem, many papers, such as QT[8], HCT[10], BSCTTA[2], and QT-BCS[9], have been proposed. In this paper, we propose the tree-based anti-collision algorithm using a bit change sensing unit (TABCS) based on BSCTTA algorithm. The proposed algorithm can identify bits returned from tags through bit change sensing unit, even if multi collisions occur. So, it rapidly generates the unique prefix to indentify each tag, and reduce the total of bits. As the result, the cost of identifying all tag IDs is relatively reduced as compared with existing algorithms. It is verified through simulations that the proposed algorithm surpass other existing algorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.3
• /
• pp.102-110
• /
• 2024

Blockchain records all transactions issued by users, which are then replicated, stored, and shared by participants of the blockchain network. Therefore, the capacity of the ledger stored by participants continues to increase as the blockchain network operates. In order to address this issue, research is being conducted on methods that enhance storage efficiency while ensuring that valid values are stored in the ledger even in the presence of device failures or malicious participants. One direction of research is applying techniques such as Reed-Solomon encoding to the storage of blockchain ledgers. In this paper, we apply Reed-Solomon encoding to the key-value store used for ledger storage in an open-source blockchain, and measure the storage efficiency and increasing computational overhead. Experimental results confirm that storage efficiency increased by 86% while the increase in CPU operations required for encoding was only about 2.7%.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1906-1916
• /
• 1996

For the medical analysis of the three-dimensional structure such as the mandible, it is necessary to reconstruct the structure into the finite number of analyzable elements. The information of the three-dimensional structure can be obtained from the cross-sections of the magnetic resonance image (MRI). A region corresponding to the structure is extracted from the inner part of the cross- section. By the triangulation of the sampled cross-section image, two-dimensional finite elements are generated. Three-dimensional finite elements are constructed by matching the two dimensional finite elements each other in space. In this paper a construction method of the optimal three-dimensional finite elements has been suggested, which uses the adjacent information abstracted from the triangulated two-dimensional finite elements. The elements are classified into the identical property sets by using the adjacent information of the traingulated two-dimensional elements. After applying the multistep matching algorithm to the classified two-dimensional finite elements, the optimal three-dimensional finite elements can be construccted. By analyzing the constructed finite elements, it is possible to get much more useful medical information about the three-dimensional struture of mandible.

• Spatial Information Research
• /
• v.22 no.4
• /
• pp.39-47
• /
• 2014

The Yeongsan river estuary has a serious water quality problem due to the water stagnation and it is imperative to predict the changes of water quality for mitigating water pollution. EFDC(Environmental Fluid Dynamics Code) model was mainly utilized to predict the changes of water quality for the estuary. The EFDC modeling normally accompanies the large volume of modeling output. For checking the spatial distribution of the modeling results, post-processing for converting of the output is prerequisite and mainly post-processing program is EFDC_Explorer. However, EFDC_Explorer only shows the spatial distribution of the time series and this doesn't support overlay function with other thematic maps. This means the impossible to the connection analysis with a various GIS data and high dimensional analysis. Therefore, this study aims to develop a post-processing system of a EFDC output to use them as GIS layers. For achieving this purpose, a editing module for main input files, and a module for converting binary format into an ASCII format, and a module for converting it into a layer format to use in a GIS based environment, and a module for visualizing the reconfigured model result efficiently were developed. Using the developed system, result file is possible to automatically convert the GIS based layer and it is possible to utilize for water quality management.