• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.11-24
• /
• 2001

XML documents found over internet are generally fairly irregular and hove no fixed schema, The SQL and OQL are not suitable for query processing in XML documents, So, there are many researches about schema extraction and query language for XML documents, We propose a schema extraction method using the frequency of label path in XML documents, Our proposed method produces multi-level schemas and those are useful for query processing.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.351-354
• /
• 2003

To inspect point-defect in LCD pannel, calculate period and eliminated pattern. And then find point-defect to compare block image with each period. First processing, Founded over point defects. To reduce wrong point defect. Next, label point-defects and eliminated not surpass fixed limit-size.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1491-1494
• /
• 2002

The paper introduces a novel system of two hands real-time tracking based on the unrestricted hand skin segmentation by multi color systems. After corer-based segmentation and pre-processing operation, a label set of regions is created to locate the two hands automatically. By the normalization, template matching is used to find out the left or right hand. An improved fast self-adaptive tracking algorithm is applied and Canny filter is used for hand detection.

• International Journal of Human Ecology
• /
• v.14 no.1
• /
• pp.13-27
• /
• 2013

Consumer perception of the meaning of 'green' and 'green products' as well as how they use green claims (including terms, certifications, and marks) should be examined to help consumers pursue green behavior in everyday life. This study investigates what type of green claims prevail in the Korean consumer market and how consumers perceive the meaning of 'green' and green claims. For these purposes, media analysis, in-context research (shop visit) and a survey were conducted to collect green claims (including green terms and certified/noncertified green marks). Green claims in the consumer market were first summarized and analyzed; subsequently, the most frequently used 7 green marks and 15 green terms were selected to construct a consumer survey questionnaire on consumer perceptions of green claims. An online survey was performed via Embrain and the survey respondents consisted of 500 adult consumers over the age of 20. The field research results showed frequent green claims in the Korean consumer market. However, certified (and hence trustworthy green product information labels) were uncommon in the market. The only green claim widely known and used by consumers was the energy consumption efficiency label. Consumers were interested in the green information label not because it affected their utility cost nor because it was important for environment protection.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.546-550
• /
• 2010

In this paper, we propose a method for the postprocessing of cursive script recognition in Wine Label Images. The proposed method mainly consists of three steps: combination matrix generation, character combination filtering, string matching. Firstly, the combination matrix generation step detects all possible combinations from a recognition result for each of the pieces. Secondly, the unnecessary information in the combination matrix is removed by comparing with bigram of word in the lexicon. Finally, string matching step decides the identity of result as a best matched word in the lexicon based on the levenshtein distance. An experimental result shows that the recognition accuracy is 85.8%.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.351-361
• /
• 2008

This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.145-148
• /
• 2003

MPLS is one of the most important technics for the growth of the next generation network. MPLS is a kind of third layers switching technics which is combined with second layers switching speed and third layers routing ability. And a simple label switching paradigm which uses short and fired lengths of lables is available in MPLS, too. Like this way, MPLS not only can keep its competitive price but also keep its merits such as second layers speed, third layers expansion, and compatibility with existing protocols. That means the traffic engineering, VPN, QoS ran be supported easily in MPLS. In this thesis, therefore, we will implement a small inter-networking based on MPLS and analyze its performance.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.2
• /
• pp.30-37
• /
• 2003

To effectively control a vast amount of postal packages, we need the automatic system for extracting the address region from CCD scanner images. In this paper, we propose a address region extraction algorithm in the standard postal label. We used geometric characteristics of the underlying address regions and defined several criteria for fast detection of address regions. As a result, we accomplished a successful detection and classification of the postal package labels in real time.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.45-54
• /
• 2002

MPLS(Multiprotocol Label Switching) is regarded as a core technology for migrating to the next generation Internet. In this paper, we propose an dynamic flow admission control supporting DiffServ(Differentiated Services) to provide QoS in MPLS networks. Our proposed model dynamically adjusts the amount of admissible traffic based on transmittable capacity over one outgoing port. It then transmits the Packets while avoiding congested area resulting traffic loss. Ingress LSRs find out the congested area by collecting network state information at QoS state update for QoS routing table. Our Proposed model manages the resource efficiently by protecting the waste of resources that is a critical Problem of DiffServ and makes much more flows enter the network to be served.