• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.19-26
• /
• 2006

Redundant expressions must be eliminated in order to apply optimization for expressions in SSA Form from CTOC. This paper applied VN(Value Numbering) for this purpose. In order to carry out VN, SSAGraph must be first generated to maintain the information in the SSA Form, equivalent nodes must be found and SCC(Strongly Connected Component) generated. Equivalent nodes are assigned with an identical valnum through SCC. We could confirm elimiations for many nodes that added at SSA Form process after VN. The valnum can be applied in optimization and type inference.

• Journal of Information Processing Systems
• /
• v.12 no.2
• /
• pp.214-225
• /
• 2016

Global value numbering (GVN) is a method for detecting equivalent expressions in programs. Most of the GVN algorithms concentrate on detecting equalities among variables and hence, are limited in their ability to identify value-based redundancies. In this paper, we suggest improvements by which the efficient GVN algorithm by Gulwani and Necula (2007) can be made to detect expression equivalences that are required for identifying value based redundancies. The basic idea for doing so is to use an anticipability-based Join algorithm to compute more precise equivalence information at join points. We provide a proof of correctness of the improved algorithm and show that its running time is a polynomial in the number of expressions in the program.

• Proceedings of the KSRS Conference
• /
• 1998.09a
• /
• pp.349-354
• /
• 1998

The grid reference system (GRS) has been useful for identifying the geographical location of satellite images. In this study we derive a GRS for the KOMPSAT Electro-Optical Camera (EOC) images. The derivation substantially follows the way that SPOT defines for its GRS, but incorporates the KOMPSAT orbital characteristics. The KOMPSAT EOC GRS (KEGRS) is designed to be a (K,J) coordinate system. The K coordinate parallel to the KOMPSAT ground track denotes the relative longitudinal position and the J coordinate represents the relative latitudinal position. The numbering of K begins with the prime meridian of K=1 with K increasing eastward, and the numbering of J uses a fixed value of J=500 at all center points on the equator with J increasing northward. The lateral and vertical intervals of grids are determined to be 12.5 km about at the 38$^{\circ}$ latitude to allow some margins for the value-added processing. The above design factors are being implemented in a satellite programming module of the KOMPSAT Receiving and Processing System (KRPS) to facilitate the EOC data collection planning over the Korean peninsula.

• Journal of Information Technology Applications and Management
• /
• v.9 no.3
• /
• pp.57-78
• /
• 2002

This paper studios billing mechanisms of value-added telephone services In Korea and major foreign countries. The billing methods of toll-free phone service, voice Information service, one number service, personal number service and calling card service ate compared with each other. The results show that several differences are identified among service providers due to the difference of the regulation, numbering mechanism and underlying networks employed. This paper also provides implications and suggestions to incumbent Korean value-added service providers and regulators

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.486-488
• /
• 2007

The Grid Reference System, which was firstly used in SPOT series, has been successfully adapted in KOMPSAT-1 and KOMPSAT-2 program, which identifies the geographical location to make image collection plans and manage the database of satellite images. Each Grid Reference System for KOMPSAT-1 and KOMPSAT-2 was designed based on system parameters related to each KOMPSAT-1 and KOMPSAT-2 and this fact leads to the need for the design of the Grid Reference System for KOMPSAT-3 (KGRS-3, hereafter), which reflects system parameters for KOMPSAT-3. The (K, J) coordinate system has been defined as the Grid Reference System for KOMPSAT-3 using heritages from KOMPSAT-1 and KOMPSAT-2 programs. The numbering of K begins with the prime meridian of K = 1 with running eastward on earth increasingly, and the numbering of J uses a value of J = 1000 at all points on the equator and begin with running northward increasingly. The Grid Reference System for KOMPSAT-3 is to be implemented in Ground Segment of KOMPSAT-3 system.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.65-72
• /
• 2007

Labeling schemes which don't consider about frequent update in dynamic XML documents need relabeling process to reflect the changed label information whenever the tree of XML document is update. There is disadvantage of considerable expenses in the dynamic XML document which can occurs frequent update. To solve this problem, we suggest prime number labeling scheme that doesn't need relabeling process. However the prime number labeling scheme does not consider that it needs to update the sibling order of nodes in the tree of XML document. This update process needs much costs because the most of the tree of XML document has to be researched and rewritten. In this paper, we propose the prime number labeling scheme with sibling order value that can maintain the sibling order without researching or rewriting the tree of XML documents.

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.23 no.5
• /
• pp.774-783
• /
• 1994

New food item numbers for each food included in Food Composition Table in Korea (4th ed) and other Food Composition Table. New Food item numbers classified to base 5-basic food groups and its classification was as follows. 1 As for the 1569 food items , they were classified as 20 food sub-groups(82 food sorts) for 5-basic food groups. 2. As for the 82 food sorts, they were individually classified with raw prepared , fat sugar content and arranged in order, ㄱ , ㄴ and ㄷ and made the item number. 3. The data set of nutritive value of food with new item numbers was accessed on computer files. 4. The Food & Description Table was drafted as 1572 food items were arranged in order, ㄱ, ㄴand ㄷ. 5. The Food Table arranged in the order or each nutrient content (energy, carbohydrate, protein , etc....) was drafted. Clipper program for computing nutritive values and tabulation of nutrients of daily diet were coded by applying new food item numbers. It is expected that should utilized as a basic data of computer program for calculating the nutritive value of diet, evaluating the nutrition and counseling the nutrition.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.641-650
• /
• 2003

The eXtensible Markup Language(XML) is emerging as a standard format of data representation and exchange on the Internet. There have been researches about storing and retrieving XML documents using the relational database which has techniques in full growth about large data processing, recovery, concurrency control and so on. Since in previous systems same structure information and fundamental operation are used for processing of various kinds of XML queries, only some specific query can be efficiently processed not all types of query. In this paper, we propose a flexible query processing system. To process query efficiently, the proposed system analyzes regular path expression queries, and uses $\theta$-join operation using region numbering values to check ancestor-descendent relationship and equi-join operation using parent's region start value to check parent-child relationship. Thus, the proposed system processes efficiently XML regular path expressions. From the experimental results, we show that proposed XML query processing system is more efficient than previous systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2219-2225
• /
• 2008

Labeling schemes which don't consider about frequent update in dynamic XML documents need relabeling process to reflect the changed label information whenever the tree of XML document is update. There is disadvantage of considerable expenses in the dynamic XML document which can occurs frequent update. To solve this problem, we suggest prime number labeling scheme that doesn't need relabeling process. However the prime number labeling scheme does not consider that it needs to update the sibling order of nodes in the XML tree of document. This update process needs much costs because the most of the XML tree of document has to be relabeling and recalculation. In this paper, we propose the prime number labeling scheme with sibling order value that can maintain the sibling order without relabeling or recalculation the XML tree of documents.

• Journal of IKEEE
• /
• v.18 no.4
• /
• pp.593-602
• /
• 2014

One of the purposes of an artificial neural netowrk(ANNet) is to implement the largest number of functions as possible with the smallest number of nodes and layers. This paper presents a CoreNet which has a multi-leveled input value and a multi-leveled output value with a 2-layered ANNet, which is the basic structure of an ANNet. I have suggested an equation for calculating the capacity of the CoreNet, which has a p-leveled input and a q-leveled output, as $a_{p,q}={\frac{1}{2}}p(p-1)q^2-{\frac{1}{2}}(p-2)(3p-1)q+(p-1)(p-2)$. I've applied this CoreNet into the simulation model 1(5)-1(6), which has 5 levels of an input and 6 levels of an output with no hidden layers. The simulation result of this model gives, the maximum 219 convergences for the number of implementable functions using the cot(${\sqrt{x}}$) input leveling method. I have also shown that, the 27 functions are implementable by the calculation of weight values(w, ${\theta}$) with the multi-threshold lines in the weight space, which are diverged in the simulation results. Therefore the 246 functions are implementable in the 1(5)-1(6) model, and this coincides with the value from the above eqution $a_{5,6}(=246)$. I also show the implementable function numbering method in the weight space.