• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.796-801
• /
• 2002

최근의 소프트웨어 개발은 객체지향 프로그램 개발 기법을 사용하여 소프트웨어를 개발하고 있다. 초보 개발자에게는 적절한 객체를 식별하고 정확한 속성과 행위를 부여하는 객체 지향 기법은 상당히 힘든 문제이다. 객체의 집합, 즉 클래스 모델링 기법에도 재사용 기법을 사용한다면 이미 작성된 모델을 참조하여 객체 지향 개발 기법을 처음 접하는 초보 개발자에게는 학습의 기회를 제공하고, 숙련된 개발자에게는 검증된 모델을 통해 모델링 실패를 방지할 수 있는 안전성을 제공할 수 있다. 본 논문에서는 유사성(Similarity) 측정 기법을 적용하여 클래스간의 유사도를 판단하고, 관계 일치여부를 분석하여, 재사용 가능한 클래스를 검색하는 모델을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1385-1388
• /
• 2000

본 연구에서는 클래스의 응집도를 측정하는 기존 척도들을 클래스의 참조 그래프에 근거하여 분석하였다. 기존의 척도들이 참조 그래프의 관점에서 어떠한 문제점들이 있는가를 분석하고, 기존 척도들의 분석에 근거하여 클래스 응집도를 측정하기 위해 응집도 척도가 고려해야할 사항들을 제시하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.481-483
• /
• 2001

클래스의 응집도를 측정하기 위한 여러 연구들이 제안되었지만, 이런 연구들은 데이터 상호작용에 의해 응집도를 측정하므로 메소들간에 데이터 상호작용이 없지만 객체의 또 다른 속성들을인 데이터들이 함께속하는 경우를 고려하지 못하고 있다. 따라서 본 연구에서는 데이터 상호작용이 없는 경우를 고려하고, 또한 클래스 내의 멤버들과 멤버들간의 연결을 모두 고려하여 응집도를 측정할 수 있는 새로운 응집도 척도를인 강 클래스 응집도(Strong Class Cohesion: SCC)와 약 클래스 응집도(Weak Class Cohesion: WCC)를 제안하였다. 또한 기존 척도들과의 비교평가를 통해서 WCC와 SCC가 향상된 측정을 제시함을 보여 주었다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.2
• /
• pp.125-134
• /
• 2012

In this paper, we propose a method to analyze M:N corresponding relations in semantic matching, especially focusing on feature class matching. Similarities between any class pairs are measured by spatial objects which coexist in the class pairs, and corresponding classes are obtained by clustering with these pairwise similarities. We applied a graph embedding method, which constructs a global configuration of each class in a low-dimensional Euclidean space while preserving the above pairwise similarities, so that the distances between the embedded classes are proportional to the overall degree of similarity on the edge paths in the graph. Thus, the clustering problem could be solved by employing a general clustering algorithm with the embedded coordinates. We applied the proposed method to polygon object layers in a topographic map and land parcel categories in a cadastral map of Suwon area and evaluated the results. F-measures of the detected class pairs were analyzed to validate the results. And some class pairs which would not detected by analysis on nominal class names were detected by the proposed method.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.71-78
• /
• 2006

For using XML data in programming languages, there is a data binding method, which generates classes from XML type definitions. However, since existing binding frameworks for this method generate all classes for element definitions, the number of generated classes becomes large and the complexity of the overall application system gets high. In this research, we propose an inline binding method for selecting necessary classes from element definitions. In the proposed method, classes are created only for elements with repetitions and recursions, and they include fields for values of terminal elements. We introduce a generation algorithm for binding classes and the marshaling methods for recovering the omitted paths. We develop IBinder system to validate the proposed method and compare the generated codes with the ones of existing systems. As a result, we carl show that the number of generated classes decrease substantially compared to other systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1906-1914
• /
• 2012

In this paper, relative service differentiation in JET based optical burst-switched networks with deflection routing is presented. It differs from conventional schemes in that it tries to make the loss rate of high class bursts as low as possible while maintaining the desired proportional ratio between the high class bursts and low class bursts. Strategies applied to it are dynamic wavelength allocation and the preemption which are combined to deflection routing. With dynamic wavelength allocation, the number of wavelengths allocated to high class bursts are dynamically changed. Preemption which gives more preference to high class bursts is also applied to decrease its loss rate. To lower the loss rate, deflection routing is applied for any kind of traffic. With those strategies, the suggested scheme shows desired properties that the loss rate of high class traffic is as lowered as possible. A queueing model for the scheme is developed to approximate loss ratio and the numerical results show that the proposed scheme provisions relative service differentiation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.6
• /
• pp.51-61
• /
• 2007

In this paper, Air-interface protocols of ISO 18000-6 Types and EPCglobal Classes applied to RFID system in UHF band are analyzed, and those anticollision algorithms are realized. Also, the each algorithm which improves the performance of standard protocol is proposed, and the performance is compared when clock period of link timing is a identical condition on $12.5{\mu}s$. As the result, when 500 tags exist simultaneously inside reader interrogation zone, the tag recognition performance of a standard protocol is better in preceding order of Class-1 Generation-1, Type B, Type A, Class-0 and Class-1 Generation-2. And also the performance of improved protocol is better in ascending order of Type B, Type A, Class-1 Generation-1, Class-0 and Class-1 Generation-2. Therefore, performance of tag recognition remarkably depends on the regulated clock period in the protocol and link timing between a reader and a tag.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.451-455
• /
• 2008

In this paper, the k-nearest templates method is proposed to combine multiple classifiers effectively. First, the method decomposes training samples of each class into several subclasses based on the outputs of classifiers to represent a class as multiple models, and estimates a localized template by averaging the outputs for each subclass. The distances between a test sample and templates are then calculated. Lastly, the test sample is assigned to the class that is most frequently represented among the k most similar templates. In this paper, C-means clustering algorithm is used as the decomposition method, and k is automatically chosen according to the intra-class compactness and inter-class separation of a given data set. Since the proposed method uses multiple models per class and refers to k models rather than matches with the most similar one, it could obtain stable and high accuracy. In this paper, experiments on UCI and ELENA database showed that the proposed method performed better than conventional fusion methods.

• Journal of Internet Computing and Services
• /
• v.12 no.1
• /
• pp.119-130
• /
• 2011

As a de facto standard for system modeling, UML diagrams have been widely used in the industry. Of these, the class diagram is useful to visualize the classes and their relationships and thus directly influences the forward and reverse processes of system modeling and development. Many earlier studies have attempted to examine as to what impact the layout and complexity of the class diagram would have on the comprehension of system modeling. However, their findings have been equivocal and it is not easy to understand the effects of diagram layout. Accordingly this research relied on the guidelines of diagram layout suggested in the earlier studies and designed a 2 (layout) x 2 (complexity) factorial design to examine their impact on diagram comprehension. 47 subjects were participated in the experiment where class diagrams were provided differently in their layout and complexity. We found that a good layout was significantly more effective than the bad. Furthermore the results were significantly persistent in the complex group than the simple. However, there was no interaction effect between layout and complexity of the diagram.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.11
• /
• pp.60-66
• /
• 2011

LTE (Long Term Evolution) supports QoS (Quality of Service) with several service classes. For each class of traffic, a big difference exists on BER (Bit Error Rate) requirement. This leads to a considerable difference in transmission power for various classes of traffic. In this paper, a novel scheduler is designed and proposed for LTE which supports CoS (Class of Service) with the consideration of priority as well as target BER. By the CQI (Channel Quality Indicator) and QCI (QoS Class Identifier), a minimum transmission power is assigned from the target BER for each class of traffic per each user. Hence, with the other information such as user's used rate in the past and the priority of traffic, the probability of occupying channels is determined. The simulation results of Service Class scheduling are compared with that of Maximum Rate and Proportional Fair. The results show that the service class-aided scheduling can improve the throughput of whole system significantly.