• Journal of Satellite, Information and Communications
• /
• v.3 no.1
• /
• pp.41-47
• /
• 2008

Line-of-sight communications cannot easily support korean armed forces because of mountainous terrain. ADD(Agency for Defense Development) introduced ANASIS(Army Navy Air-force Satellite Information System) to meet the Korean warfighter's operational needs. Currently, army's military satcom terminal is designed for either fixed site or on-the-pause operation. The US army is under development of multi-band integrated on-the-move satellite terminals to let the army's communication capability to keep pace with globally deployable Joint Task Force for network-centric application. In this paper we analyzed X-band and Ka-band link and subsystem requirement. Our focus here is to describe key technical issues. Especially, On the basis of 3dB beam width of 0.9m antenna, Tracking accuracy and disturbances compensation signal processing on-the-move of Antenna Tracking system is analyzed. Also, protocol is analyzed that minimize blockage on the move due to an obstacle. when the received signal blocked, it stop to transmit burst signal and retransmit when blockage removed through received synchronization signal monitoring. Analyzed specification will be used to make prototype terminal to analyze risk for mass production

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.9
• /
• pp.514-526
• /
• 2004

Microarray is a new technique for gene expression experiment, which has gained biologist's attention for recent years. This technology enables us to obtain hundreds and thousands of expression of gene or genotype at once using microarray Since it requires manual work to analyze patterns of gene expression, we want to develop an effective and automated tools to analyze microarray image. However it is difficult to analyze DNA chip images automatically due to several problems such as the variation of spot position, the irregularity of spot shape and size, and sample contamination. Especially, one of the most difficult problems in microarray analysis is the block and spot addressing, which is performed by manual or semi automated work in all the commercial tools. In this paper we propose a new algorithm to address the position of spot and block using a new concept of regular structure grid searching. In our algorithm, first we construct maximal I-regular sequences from the set of input points. Secondly we calculate the rotational angle and unit distance. Finally, we construct I-regularity graph by allowing pseudo points and then we compute the spot/block address using this graph. Experiment results showed that our algorithm is highly robust and reliable. Supplement information is available on http://jade.cs.pusan.ac.kr/~autogrid.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1105-1122
• /
• 2004

The organization and company's effort to improve software qualify contributes to the increase of software productivity and quality in some sense. However, it has not been a solution of root causes. This result is caused not because of people or technology, but process in-stitutionalization. Recently SQA (Software Quality Assurance), which provide mechanism to make sure that the software development process and products follow the assigned requirements, plan and standards, is applied to achieve the quality improvements. Several standards and models are developed for SQA activities. However, those standards and mode]s are written in form and do not provide information related to the detailed procedures, methods and outputs. Therefore, the organizations that want to adopt those models or standards have to put a lot of effort to acquire the knowledge about the models and to set up SQA Process that is tailored to meet organization's goal and objectives. In this research, we developed SQA support package to support the organization to develop their SQA process in more convenient and systematic ways. With this package, the organizations can establish SQA Process by tailoring those features necessary to reflect organization's characteristics. We expect this package contribute the organizations in a way that it reduce the effort and cost for establishing SQA process.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.11 no.3
• /
• pp.13-22
• /
• 2008

The objective of this study is to evaluate the applicability of extracted PRMS input parameters by KGIS-Hydrology over Yongdam-Dam watershed. KGIS-Hydrology is a system for automatic extraction and analysis of watershed characteristic data. Input parameters of PRMS were generated from GIS data (DEM, soil, forest type, etc.) using KGIS-Hydrology. Multi-temporal meteorological data from Jangsu station of KMA (Korea Meteorological Administration) were used for all simulation periods. Input parameters of PRMS were optimized using observed runoff data of Yongdam-Dam station (1966-2001) and validated using observed runoff data of Yongdam-Dam station (2002-2006, Yongdam-Dam watershed). The results showed that the simulated flows were much closed to the observed flows of Yongdam-Dam (2002-2006) and Donghyang (2001-2004) station by 0.49~0.83 and 0.57~0.75 model efficiencies, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.605-619
• /
• 2003

The main memory DBMS(MMDBMS) efficiently supports various database applications that require high performance since it employs main memory rather than disk as a primary storage. In this paper, we discuss the index manager of the Tachyon, a next-generation MMDBMS. Recently, the gap between the CPU processing and main memory access times is becoming much wider due to rapid advance of CPU technology. By devising data structures and algorithms that utilize the behavior of the cache in CPU, we are able to enhance the overall performance of MMDBMSs considerably. In this paper, we address the practical implementation issues and our solutions for them obtained in developing the cache-conscious index manager of the Tachyon. The main issues touched are (1) consideration of the cache behavior, (2) compact representation of the index entry and the index node, (3) support of variable-length keys, (4) support of multiple-attribute keys, (5) support of duplicated keys, (6) definition of the system catalog for indexes, (7) definition of external APIs, (8) concurrency control, and (9) backup and recovery. We also show the effectiveness of our approach through extensive experiments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.465-469
• /
• 2000

This paper describes a single-chip full-custom implementation of pipelined adaptive decision-feedback equalizer (PADFE) using a 0.25-${\mu}{\textrm}{m}$ CMOS technology for wide-band wireless digital communication systems. To enhance the throughput rate of ADFE, two pipeline stage are inserted into the critical path of the ADFE by using delayed least-mean-square (DLMS) algorithm Redundant binary (RB) arithmetic is applied to all the data processing of the PADFE including filter taps and coefficient update blocks. When compared with conventional methods based on two's complement arithmetic, the proposed approach reduces arithmetic complexity, as well as results in a very simple complex-valued filter structure, thus suitable for VLSI implementation. The design parameters including pipeline stage, filter tap, coefficient and internal bit-width and equalization performance such as bit error rate (BER) and convergence speed are analyzed by algorithm-level simulation using COSSAP. The singl-chip PADFE contains about 205,000 transistors on an area of about 1.96$\times$1.35-$\textrm{mm}^2$. Simulation results show that it can safely operate with 200-MHz clock frequency at 2.5-V supply, and its estimated power dissipation is about 890-mW.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.348-357
• /
• 2007

Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.9
• /
• pp.35-46
• /
• 2011

Future Internet should support more efficient mobility management, flexible traffic engineering and various emerging new services. So, lots of traffic engineering techniques have been suggested and developed, but it's impossible to apply them on the current running commercial Internet. To overcome this problem, OpenFlow protocol was proposed as a technique to control network equipments using network controller with various networking applications. It is a software defined network, so researchers can verify their own traffic engineering techniques by applying them on the controller. In addition, for high-speed packet processing in the OpenFlow network, programmable NetFPGA card with four 1G-interfaces and commercial Procurve OpenFlow switches can be used. In this paper, we implement an OpenFlow test-bed using hardware-accelerated NetFPGA cards and Procurve switches on the KREONET, and implement CSPF (Constraint-based Shortest Path First) algorithm, which is one of popular QoS routing algorithms, and apply it on the large-scale testbed to verify performance and efficiency of multimedia traffic engineering scheme in Future Internet.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.59-70
• /
• 2012

RSA-CRT is one of the commonly used techniques to speedup RSA operation. Since RSA-CRT performs its operations based on the modulus of two private primes, it is about four times faster than RSA. In RSA, the two primes are normally thrown away after generating the public key pair. However, in RSA-CRT, the two primes are directly used in RSA operations. This led to hardware fault attacks which can be used to factor the public modulus. The most common way to counter these attacks is based on error propagation. In these schemes, all the outputs of RSA are affected by the infected error which makes it difficult for an adversary to use the output to factor the public modulus. However, the error propagation has sequentialized the RSA operation. Moreover, these schemes have been found to be still vulnerable to hardware fault attacks. In this paper, we propose two new RSA-CRT schemes which are both resistant to hardware fault attack and support parallel execution: one uses common modulus and the other one perform operations in each prime modulus. Both proposed schemes takes about a time equal to two exponentiations to complete the RSA operation if parallel execution is fully used and can protect the two private primes from hardware fault attacks.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.53-73
• /
• 2006

Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.