• Journal of Software Engineering Society
• /
• v.26 no.1
• /
• pp.1-16
• /
• 2013

Variable length information message is a communication protocol standard in order for computer network systems to provide efficient delivery of information. The variable length information messages were developed for varying and controlling details of information in accordance with message receiver's required information level or information access level. In the previous studies, data compressing techniques have been in use for information message optimization technologies in order to reduce physical sizes of information messages. In optimization technologies for information messages, accuracy of information is considered as the most important factor; therefore, only non-loss compression techniques are applied to the optimization technologies. However, the non-loss compression based information message optimization methods are not efficient in data compression, and these are limited to efficient delivery of information in wireless network environments that have constraint bandwidth. In this paper, we attempt to optimize information in the variable length information messages at message fields in order to reduce physical sizes of messages more efficiently. To demonstrate the efficiency of our approach, we conduct optimization experiments for variable length information messages.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.537-545
• /
• 2009

In this paper, we proposed an effective multicast causal order algorithm with hand-off protocol for mobile networks. Since the size of control informations needed to enforce message transfer order has much influence on the performance of hand-off and message transfer in mobile networks, size of control information need to be minimized. We reduced the size of control information by analyzing all the valid communication patterns and pruning redundant information not required to enforce causal order as early as possible, and used hand-off protocol which requires minimal amount of control information to be transferred. By simulation, we found that the proposed algorithm showed better performance than other existing algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1670-1678
• /
• 2004

Currently, Price comparison sites receive inputs of product information and price manually after being joined by releted shopping mall companies, and can't support automatically price fluctuation of products in real time. Therefore, this paper designs and implements web service system based on SOAP for interactive product order and price comparison dynamically using web service technologies in real time. This web service system composes web service client module including functions of product search, sort and order, and server module including functions of remote procedure call for product search and order. This web service system implements interchanging product information based on SOAP messages and can support independence of platform and flexible potability in environment conforming to SOAP, WSDL and UDDI standards.

• Journal of the Speleological Society of Korea
• /
• no.70
• /
• pp.29-35
• /
• 2006

21 century as the knowledge base society which demands an originality and a variety the updated technology and knowledge creation ability quality and national power of life of the citizen were under controlling. Consequently, the extension of development and originality of the ability which is various leads and studying voluntary character and the ability back the education which it considers actively it raises and the infield it does. With activation plan of cave resources home page of Speleological Society of Korean like home page of Speleological Society of Japan cave crane information, caving information, cave Q/A, cave publication, the relation site back the possibility of seeing information regarding the cave which is various in order to be, it reorganizes. The possibility of coming in contact in order to be, various branch information also the general rain specialist regarding the cave resources. Currently the possibility of seeing the various branch data for the application of the cave resources at any time it is, home page of Speleological Society of Korean the possibility of doing to lead in order to be, it proposes the plan. From one person it will be able to study the data regarding the cave of various field in order, all curricular materials regarding the cave resources the educational program which leads a home page about under developing it proposes the activation plan of the cave resources.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.3
• /
• pp.31-35
• /
• 2009

In this paper, tunable 4th order SC(switched capacitor) bandpass ${\sigma}-{\Delta}$(Sigma-Delta) modulator with advanced architecture that can adjust the IF by two coefficient values is proposed for data conversion in the wireless communication. Its architecture can optionally adjust all the 4th order noise transfer function in comparison with the conventional architecture. In order to adjust the IF, the conventional architecture needs the four variable coefficients values, basic clocks and eight clocks. On the other hand, the proposed architecture can adjust the IF by two variable coefficient values and basic clocks only.

• Journal of Power Electronics
• /
• v.16 no.3
• /
• pp.1025-1035
• /
• 2016

Luenberger observer (LO)-based sensorless multi-loop control of a converter requires an iterative trial-and-error design process, considering that many parameters should be determined, and loop gains are indirectly related to the closed-loop characteristics. Robust H∞ control adopts a compact sensorless controller. The algebraic Riccati equation (ARE)-based and linear matrix inequality (LMI)-based H∞ approaches need an exhaustive procedure, particularly for a low-order controller. Therefore, in this study, a novel robust H∞ synthesis approach is proposed to design a low-order sensorless controller for boost converters, which need not solve any ARE or LMI, and to parameterize the controller by an adjustable parameter behaving like a "knob" on the closed-loop characteristics. Simulation results show the straightforward closed-loop characteristics evaluation and better dynamic performance by the proposed H∞ approach, compared with the LO-based sensorless multi-loop control. Practical experiments on a digital processor confirmed the simulation results.

• Journal of Distribution Science
• /
• v.13 no.9
• /
• pp.47-57
• /
• 2015

Purpose - The aim of this paper is to investigate the explanatory power of the Pecking-order theory (the cost of financing increases with asymmetric information) among Korean retail firms from the perspective of debt capacity. According to the Pecking-order theory, a firm's first preference is to use internal funds for its capital needs, its next preference is the issuance of debt, and its last preference is the issuance of equity; this is due to the information asymmetry problem between existing shareholders and investors. However, prior empirical studies, such as Lemmon and Zender (2010), argue that the entire sample test for the Pecking-order theory could be misleading due to the different levels of debt issuance capability of each of the individual firms; in fact, they confirm that the explanatory power of the Pecking-order theory improves after taking into account the differences in debt capacity of the U.S. firms they examined. This paper implements a case study approach among Korean retail firms to examine the relationship between debt capacity and the explanatory power of the Pecking-order theory in Korea. Research design, data, and methodology - This study uses the sample of public retail firms on the Korea Composite Stock Price Index (KOSPI) from the time period of 1990 to 2013. We gather related financial and accounting statements from the financial information firm WISEfn. Credit rating information is provided by the Korea Investor Service. We employ the models of Lemmon and Zender (2010) and Son and Kim (2013) to measure a firm's debt capacity. Their logit models use the rating dummy variable as a dependent variable and incorporate other firm characteristics as independent variables to estimate debt capacity. To test the Pecking-order theory, we adopt variants of the financing deficit model of Shyam-Sunder and Myers (1999). In the test of the Pecking-order theory, we consider all of the changes in total debt obligations, current debt obligations, and long-term debt obligations. Results - Our main contribution to the literature is our confirmation of the predicted relationship between debt capacity and the explanatory power of the Pecking-order theory among Korean retail firms. The coefficients on financing deficits become greater as a firm's debt capacity improves. This is consistent with the results of Lemmon and Zender (2010). The coefficients on the square of the financing deficits are also negative for the firms in the largest debt capacity group, which is also consistent with the predictions in prior literature. Conclusions - This study takes a case study approach by examining Korean retail firms. We confirm that the Pecking-order theory explains the capital structure of retail firms more appropriately, after taking into account the debt capacity of each firm. This result suggests the importance of debt capacity consideration in the testing of the Pecking-order theory. Our result also implies that there has been a potential underestimation of the explanatory power of the Pecking-order theory in existing studies.

• Journal of the Korean Society for information Management
• /
• v.27 no.2
• /
• pp.157-171
• /
• 2010

This exploratory study outlines the rationalization of why Ontology's taxonomy requires a strong hierarchy, accuracy, and interoperability in order to be used as a successfully re-useable information management system. Finding the relevant information in a plethora of possible resources by bridging the gap between the user's needs and the resources of the information technology system is the goal that the information management field should find a way to achieve. This study is based on discussions and interviews with a taxonomist, information architect, and information manager, whose discussions were based on the usability and interoperability of the knowledge based information systems. These professional perspectives are necessary as they are the liaison between users and the information technology group. We found that in order for information managers to ensure successful sharing of knowledge across the end users, a common sense language must be issued in order to achieve reasoning for the artificial intelligence system.

• Nuclear Engineering and Technology
• /
• v.31 no.2
• /
• pp.157-171
• /
• 1999

In this work, an automatic software verification method for Nuclear Power Plant (NPP) protection system is developed. This method utilizes Colored Petri Net (CPN) for system modeling and Prototype Verification System (PVS) for mathematical verification. In order to help flow-through from modeling by CPN to mathematical proof by PVS, an information extractor from CPN models has been developed in this work. In order to convert the extracted information to the PVS specification language, a translator also has been developed. ML that is a higher-order functional language programs the information extractor and translator. This combined method has been applied to a protection system function of Wolsong NPP SDS2(Steam Generator Low Level Trip). As a result of this application, we could prove completeness and consistency of the requirement logically. Through this work, in short, an axiom or lemma based-analysis method for CPN models is newly suggested in order to complement CPN analysis methods and a guideline for the use of formal methods is proposed in order to apply them to NPP Software Verification and Validation.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.428-441
• /
• 2011

A trace-and-revoke scheme is a type of broadcast encryption scheme for content protection on various platforms such as pay-per-view TV and DVD players. In 2006, Boneh and Waters (BW) presented a fully collusion-resistant trace-and-revoke scheme. However, a decisive drawback of their scheme is to require composite-order groups. In this paper, we present a new trace-and-revoke scheme that works in prime-order groups. Our scheme is fully collusion-resistant and achieves ciphertexts and private keys of size O($\sqrt{N}$) for N users. For the same level of security, our scheme is better than the BW scheme in all aspects of efficiency. Some superior features include 8.5 times faster encryption, 12 times faster decryption, and 3.4 times shorter ciphertexts. To achieve our goal, we introduce a novel technique where, by using asymmetric bilinear maps in prime-order groups, the cancellation effect same as in composite-order groups can be obtained.