• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.590-595
• /
• 2009

With respect to the exponential increment of web documents on the internet, it is important how to improve performance of clustering method for web documents. Web document clustering techniques can offer accurate information and fast information retrieval by clustering web documents through semantic relationship. The clustering method based on mesh-graph provides high recall by calculating similarity for documents, but it requires high computation cost. This paper proposes a clustering method using hyperlinks which is structural feature of web documents in order to keep effectiveness and reduce computation cost.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.628-634
• /
• 1995

In the area of assembly process of micro-chips and electronic parts on the printed circuit board, surface mounting device(SMD) is used as a fundamental tool. Generally speaking, the motion of the SMD is based on the ball screw system operated by any type of actuators. The ball screw system is a mechanical transformer which converts the mechanical rotational motion to the translational one. Also, this system could be considered as an efficient motion device against mechanical backash and friction. Therefore a dynamic modeling and stste sensitivity analysis of the ball screw system in SMD have to be done in the initial design stage. In this paper, a simple mathematical dynamic model for this system and the sensitivity snalysis are mentioned. Especially, the bond graph approach is used for graphical modeling of the dynamic system before analysis stage. And the direct differentiation method is used for the state sensitivity analysis of the system. Finally, some trends for the state variables with respect to the design variables could be suggested for the better design based on the results on the results of dynamic and state sensitivity.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.2135-2141
• /
• 2015

Power line communication (PLC) is one of the major communication technologies in smart grid since it combines good communication capability with easy and simple deployment. As a power network can be modeled as a graph, we propose a vertex coloring based slot reuse scheduling in the time division multiple access (TDMA) period for PLCs. Our objective is to minimize the number of assigned time slots, while satisfying the quality of service (QoS) requirement of each station. Since the scheduling problem is NP-hard, we propose an efficient heuristic scheduling, which consists of repeated vertex coloring and slot reuse improvement algorithms. The simulation results confirm that the proposed algorithm significantly reduces the total number of time slots.

• Journal of Korea Multimedia Society
• /
• v.23 no.1
• /
• pp.24-30
• /
• 2020

As the number of internet-connected appliances and the variety of IoT services are rapidly increasing, it is hard to protect IT assets with traditional network security techniques. Most traditional network log analysis systems use rule based mechanisms to reduce the raw logs. But using predefined rules can't detect new attack patterns. So, there is a need for a mechanism to reduce congested raw logs and detect new attack patterns. This paper suggests enterprise security management for IoT services using graph and network measures. We model an event network based on a graph of interconnected logs between network devices and IoT gateways. And we suggest a network clustering algorithm that estimates the attack probability of log clusters and detects new attack patterns.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.609-614
• /
• 1989

A collision avoidance algorithm based on a heuristic graph search and subgoals is presented. The joint angle space is quantized into cells. The evaluation function for a heuristic search is defined by the sum of the distance between the links of a manipulator and middle planes among the obstables and the distance between the end-effector and the subgoals on desired trajectory. These subgoals reduce the combinatorial explosion in the search space. This method enables us to avoid a dead-lock in searching. Its effectiveness has been verified by simulation studies.

• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.79-89
• /
• 2002

The performance of OCC is very sensitive to the transaction abort rate, Even if the abort probability can be reduced by re-ordering, most of re-ordering schemes have space overhead in maintaining a graph or histories, In this paper, we proposed an efficient re-ordering scheme based on a broadcast invalidation mechanism. Our scheme, called CBI, can reduce the abort probability without space overhead in maintaining a graph or histories, By simulation studies, we showed that CBI reduced the abort rate and unnecessary operations, Additionally, we showed that CBI outperforms not only BTS but also TSH with low space overhead.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.171-174
• /
• 2003

Shortest path problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time location-based service (LBS) environments according to user's route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. We propose a new rest modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.2
• /
• pp.82-90
• /
• 2006

Reconfigurability of machine tools is one of the critical factors to realize the responsive manufacturing systems to satisfy the mass customization production. This paper presents the methods to model the reconfigurable machine tools (RMTs) on Internet in response to change in the machining requirements. Specifically, the structure and motion model of machine tools using module combination rules and connectivity graph are developed. And we developed Internet-based simulator for designing of RMTs (ISD-RMT). In response to the user requirements, various structures of RMTs can be derived using the module combination rules and connectivity graph relationships. In addition, the user can verify generating structures through the control and simulation procedures.

• Annual Conference on Human and Language Technology
• /
• 2008.10a
• /
• pp.156-161
• /
• 2008

This work presents an agenda-based approach to improve the robustness of the dialog manager by using dialog examples and n-best recognition hypotheses. This approach supports n-best hypotheses in the dialog manager and keeps track of the dialog state using a discourse interpretation algorithm with the agenda graph and focus stack. Given the agenda graph and n-best hypotheses, the system can predict the next system actions to maximize multi-level score functions. To evaluate the proposed method, a spoken dialog system for a building guidance robot was developed. Preliminary evaluation shows this approach would be effective to improve the robustness of example-based dialog modeling.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.55
• /
• pp.85-96
• /
• 2000

This paper describes IDMS, a graph-based modeling system that supports problem structuring. We employs influence diagram as a problem representation tool, that is, a modeling tool. In particular, IDMS is designed as domain-independent shell. Therefore, a modeler can change the contents of the knowledge base to suit his/her own interested domain. Since the knowledge base of IDMS contains both modeling knowledge and domain knowledge, IDMS provides not only the syntactic support for modeling tool, but also the semantic support for problem domain. To apply the method in the real world context, we tested IDMS on the process selection problem in business reengineering, which is typical semi-structured problem.