• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.4 s.95
• /
• pp.389-396
• /
• 2005

In this paper, we propose a pre-distortion method using the NLMS(Normalized Least Mean Square) algorithm to cope with hish PAPR(Peak to Average Power Ratio) problem in OFDM communication system. This proposed scheme estimates the distortion characteristics of HPA, and changes the characteristic against the distortion. Therefore, it can be shown that the adaptive characteristic of the NLMS pre-distorter is good to track the various nonlinear characteristic of HPA, even though HPA characteristic is changed by temperature variation or aging. From the performance analysis, SNR efficiency of NLMS pre-distorter is about $0.5\;\cal{dB}$ less than that of common numerical non-adaptive pre-distorter, when IBO(Input Back Off) is $0\;\cal{dB}$. However, the NLMS pre-distorter is better than the common numerical pre-distorter, because these two pre-distorters have similar performance in higher than $3\;\cal{dB}$ IBO, and the NLMS pre-distorter maintains the constant performance even though characteristic of HPA is changed.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.468-483
• /
• 2001

In order to enhance the performance, cursor stability, which is a variant of isolation lvel 2 in relational DBMSs, has been widely used in place of isolation level 3, which uses strict two phase locking. However, cursor stability is much less usable in object-relational DBMSs (ORDBMSs) because navigational applications in ORDBMSs can suffer from critical inconsistency problems such as dangling pointers, lost updates, and reading inconsistent complex objects. In this paper, we propose a new isolation level, navigation stability, that prevents the inconsistency problems of cursor stability for navigational applications, while avoiding significant degradation of the concurrency of level 3. First, we analyze the inconsistency problems of cursor stability for navigational applications. Second, we define navigation stability as an extension of cursor stability and show that it solves those inconsistency problems of cursor stability in ORDBMSs. For workloads consisting of transactions of long duration, compared with level 3, the throughput of navigation stability is enhanced by up to 200%; the average response time reduced by as much as 55%; and the abort ratio reduced by as much as 77%. From these results, we conclude that navigation stability is a useful isolation level in ORDBMSs that can be used in place of isolation level 3 to improve the performance and concurrency without significantly sacrificing consistency.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.1
• /
• pp.367-373
• /
• 2016

The construction of National Spatial Data Infrastructure (NSDI) started from 2008 and was completed at 2012, with the aim of co-utilizing public agencies' national spatial information by integrating and linking. Despite the existence of the NSDI, an update of spatial data is not fully reflected because the spatial information has not been updated simultaneously by NSDI and public agencies. By examining the public agencies' services using the spatial information, a national budget is wasted because the re-usable similar services are duplicated. These issues could be solved by adopting a cloud system, whose concept is co-utilizing IT resources, to the NSDI. This study examined the service cloud based expansion and development plan for NSDI. The plan included an implementation strategy for a spatial information service cloud system and an establishment plan for a governance system. The service scenarios, concept diagram, and service functions for the system were derived in a system implementation plan. For the service functions, the unit functions of two modules were proposed and specific functions were derived. In the establishment of a governance system, the business roles and business processes were defined for organizations managing service cloud based NSDI. The business role and process were defined and derived by each service life-cycle step. With the proposed system implementation plan, a detail system design and composition of the organization could be possible, and a service cloud-based NSDI system could be implemented.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.2
• /
• pp.901-908
• /
• 2011

For the available grid environmental realization, the resource supply PC must have to provide an appropriate security function of their operation environments. SKY@HOME is a kind of the grid computing environments. If this has not supervised by administrator handling smoothly, it is inherently vulnerable state to the security level of the grid environments, because the resource supply PC is not update a security function without delay. It is also have the troublesome problems which have to install of an additional security program for support the appropriate security. This paper proposes an integration security model on the policy-based that provides an update each level according to the situation of the resource supply PC for improving its problems as a security aspect of the SKY@HOME. This model analyzes the security state of the resource supply PC respectively, and then the result is available to provide an appropriate security of the resource supply PC using an integration security model. The proposed model is not need additionally to buy and install the software, because it is provided the security management server oriented service. It is also able to set up the suit security function of a characteristic of the each resource supply PC. As a result, this paper clearly show the participation of resource supply PC improved about 20%.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.474-483
• /
• 2003

The secret sharing is the basic concept of the threshold cryptosystem and has an important position in the modern cryptography. At 1995, Jarecki proposed the proactive secret sharing to be a solution of existing the mobile adversary and also proposed the share renewal scheme for (k, n) threshold scheme. For n participants in the protocol, his method needs O($n^2$) modular exponentiation per one participant. It is very high computational cost and is not fit for the scalable cryptosystem. In this paper, we propose the efficient share renewal scheme that need only O(n) modular exponentiation per participant. And we prove our scheme is secure if less that ${\frac}\frac{1}{2}n-1$ adversaries exist and they static adversary.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3702-3713
• /
• 2000

Telecommunications standards have two different types of regulations: one is a law. enacted by government which all telecommunications related industries must observe. The other is a recommendatory standards. formulated by either government agency or some standardization organizations. Observation of these standards is not obligatory. However, technical standards are strict laws and ordinances based on common judgement and various conditions for evaluation of levels and limits. This paper deals with enhancing productivity of enactment and revision of technical standards. Through database of above related information we secure information continuity and public property of cyber space for the public. In this paper. we also classify recent data within the website in and out of the country offering four different methods of information retrieval and management system. The four retrieval methods suggested in this paper are itemized keyword retrieval. hierarchical retrieval, regulatory keyword retrieval and chronological keyword retrieval. These various retrieval methods provide the public with information of enactment and amendment of laws and regulations in the cyber space. thereby guarantees the sharing of information. Finally the important feature of the information retrieval system implemented in this paper is the online updating capability of law and regulations through the internet.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.5
• /
• pp.2946-2952
• /
• 2014

The purpose of this study is to provide some basic information for elderly driving safety, by analyzing the current state. This study analyzed 128 survey questionnaires given to senior welfare center user in P city and evaluated Montreal Cognitive Assessment Korean Version(MoCA-K) and Neurobehavioral Cognitive Status Examination(NCSE) for checked 41 owner drivers by questionnaires. 32% of total elderly persons was owner driver, and 56.1% of elderly drivers was driving everyday. 56.1% of elderly persons was driving for 1-2hours per day. 46.3% of elderly persons was using a car for leisure activity and 31.7% of elderly drivers was experienced a car accident. As cognitive function evaluation, some elderly drivers showed scores lower than average in subcategories of cognitive functions for driving a car. So, methodical evaluation system for accurate evaluation of deficit ability and driving re-education system will be required for safety driving of elderly person. In future, a legal approach of government as driver licence management and renewal system will be required for safety driving of elderly person.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.269-277
• /
• 2007

Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.1-10
• /
• 2010

Recently heterogeneous storage system such as hybrid hard disk drive (H-HDD) combining flash memory and magnetic disk is launched, according as the read performance of NAND flash memory is enhanced as similar to that of hard disk drive (HDD) and the power consumption of NAND flash memory is reduced less than that of HDD. However, the read and write operations of NAND flash memory are slower than those of rotational disk. Besides, serious overheads are incurred on CPU and main memory in the case that intensive write requests to flash memory are repeatedly occurred. In this paper, we propose the Least Frequently Used-Hot scheme that replaces the data blocks whose reference frequency of read operation is low and update frequency of write operation is high, and the data flushing scheme that rearranges the data blocks into the multi-zone of the rotation disk. Experimental results show that the execution time of the proposed method is 38% faster than those of conventional LRU and LFU block replacement schemes in I/O performance aspect and the proposed method increases the life span of Non-Volatile Cache 40% higher than those of conventional LRU, LFU, FIFO block replacement schemes.