• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.2
• /
• pp.131-140
• /
• 2014

Customer networks go through constant changes. They may expand or shrink once they are formed. In dynamic environments, it is a critical corporate challenge to identify and manage influential customer groups in a cost effective way. In this context, we apply inverse optimization theory to suggest an efficient method to manage customer networks. In this paper, we assume that there exists a subset of nodes that might have a large effect on the network and that the network can be modified via some strategic actions. Rather than making efforts to find influential nodes whenever the network changes, we focus on a subset of selective nodes and perturb as little as possible the interaction between nodes in order to make the selected nodes influential in the given network. We define the following problem based on the inverse optimization. Given a graph and a prescribed node subset, the objective is to modify the structure of the given graph so that the fixed subset of nodes becomes a minimum dominating set in the modified graph and the cost for modification is minimum under a fixed norm. We call this problem the inverse dominating set problem and investigate its computational complexity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.2
• /
• pp.60-65
• /
• 2008

The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The matching preclusion number is the minimum cardinality over all matching preclusion sets. We show in this paper that, for any $m{\geq}4$, the matching preclusion numbers of both m-dimensional restricted HL-graph and recursive circulant $G(2^m,4)$ are equal to degree m of the networks, and that every minimum matching preclusion set is the set of edges incident to a single vertex.

• Safety and Health at Work
• /
• v.12 no.1
• /
• pp.42-50
• /
• 2021

Introduction: Despite huge investments in new technology and transportation infrastructure, terrible accidents still remain a reality of traffic. Methods: Severe traffic accidents were analyzed from four prevailing modes of today's transportations: sea, air, railway, and road. Main root causes of all four accidents were defined with implementation of the approach, based on Flanagan's critical incident technique. In accordance with Molan's Availability Humanization model (AH model), possible preventive or humanization interventions were defined with the focus on technology, environment, organization, and human factors. Results: According to our analyses, there are significant similarities between accidents. Root causes of accidents, human behavioral patterns, and possible humanization measures were presented with rooted graphs. It is possible to create a generalized model graph, which is similar to rooted graphs, for identification of possible humanization measures, intended to prevent similar accidents in the future. Majority of proposed humanization interventions are focused on organization. Organizational interventions are effective in assurance of adequate and safe behavior. Conclusions: Formalization of root cause analysis with rooted graphs in a model offers possibility for implementation of presented methods in analysis of particular events. Implementation of proposed humanization measures in a particular analyzed situation is the basis for creation of safety culture.

• Research in Mathematical Education
• /
• v.11 no.2
• /
• pp.143-151
• /
• 2007

Nowadays there are practically no mathematical courses in which Computer Algebra Systems (CAS) programs, such as MATHEMATlCA, Maple, and TI-89/92, are not used to some extent. However, generally the usage of these programs is reduced to illustration of computing processes: calculation of integrals, differentiation, solution of various equations, etc. This is obtained by usage of standard command of type: Solve [...] in MATHEMATICA. At the same time the main difficulties arise at teaching nonconventional mathematical courses such as coding theory, discrete mathematics, cryptography, Scientific computing, which are gaining the increasing popularity now. Now it is impossible to imagine a modern engineer not having basic knowledge in discrete mathematics, Cryptography, coding theory. Digital processing of signals (digital sound, digital TV) has been introduced in our lives.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.259-262
• /
• 2004

In most of the character recognition systems, the method of template matching or statistical method using hidden Markov model is used to extract and recognize feature shapes. In this paper, we used modified chain-code which has 8-directions but 4-codes, and made the chain-code of hand-written character, after that, converted it into transition chain-code by applying to HMM(Hidden Markov Model). The transition chain code by HMM is analyzed as signal flow graph by Mason's theory which is generally used to calculate forward gain at automatic control system. If the specific forward gain and feedback gain is properly set, the forward gain of transition chain-code using Mason's theory can be distinguished depending on each object for recognition. This data of the gain is reorganized as tree structure, hence making it possible to distinguish different hand-written characters. With this method, $91\%$ recognition rate was acquired.

• Perspectives in Nursing Science
• /
• v.16 no.1
• /
• pp.12-24
• /
• 2019

Purpose: This study examined the suitability of using text network analysis (TNA) methodology for topic analysis of academic papers related to nursing. Methods: TNA background theories, software programs, and research processes have been described in this paper. Additionally, the research methodology that applied TNA to the topic analysis of the academic nursing papers was analyzed. Results: As background theories for the study, we explained information theory, word co-occurrence analysis, graph theory, network theory, and social network analysis. The TNA procedure was described as follows: 1) collection of academic articles, 2) text extraction, 3) preprocessing, 4) generation of word co-occurrence matrices, 5) social network analysis, and 6) interpretation and discussion. Conclusion: TNA using author-keywords has several advantages. It can utilize recognized terms such as MeSH headings or terms chosen by professionals, and it saves time and effort. Additionally, the study emphasizes the necessity of developing a sophisticated research design that explores nursing research trends in a multidimensional method by applying TNA methodology.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.251-260
• /
• 2019

In order to ensure second-order multi-agent systems (MAS) realizing consensus more quickly in a limited time, a new protocol is proposed. In this new protocol, the gradient algorithm of the overall cost function is introduced in the original protocol to enhance the connection between adjacent agents and improve the moving speed of each agent in the MAS. Utilizing Lyapunov stability theory, graph theory and homogeneity theory, sufficient conditions and detailed proof for achieving a finite-time consensus of the MAS are given. Finally, MAS with three following agents and one leading agent is simulated. Moreover, the simulation results indicated that this new protocol could make the system more stable, more robust and convergence faster when compared with other protocols.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.1
• /
• pp.44-52
• /
• 2008

In this paper we consider detecting collisions between characters whose motion is specified by motion capture data. Since we are targeting on massive crowd simulation, we only consider rough collisions, modeling the characters as a disk in the floor plane. To provide efficient collision detection, we introduce a hierarchical bounding volume, the Motion Oriented Bounding Box tree (MOBB tree). A MOBBtree stores space-time bounds of a motion clip. In crowd animation tests, MOBB trees performance improvements ranging between two and an order of magnitude.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.97-106
• /
• 1996

Existing CAD systems do not provide advanced functions for automatic checking design and drafting errors in mechanical drawings. If the knowledge of checking in mechanical ddrsfting can be implemented into computers, CAD systems could automatically check for design and drafting errors. This paper describes a method for systematic checking of dimension errors. such as deficiency and/or redundancy of dimension input-errors in dimension figures and symbols, etc. The logic for finding dimensional errors is written by using a proccedural language. A geometric model and a topological-graph model are used in this method. Checking for deficiency and redundancy of dimensions is based upon graph Theory.

• Journal of The Korean Association For Science Education
• /
• v.25 no.6
• /
• pp.671-677
• /
• 2005

Line graphs are powerful tools in conveying complicated relationships and ideas because line graphs show the relationship that exists between two continuous variables. Also, line graphs can show readers the variations in variables and correlate two variables in a two dimensional space. For these reasons, line graphs have a significant role in physics, especially kinematics. To what extent are Korean college and secondary students able to understand kinematics graphs? Is there a difference between American students and Korean students in interpreting kinematics graphs? The TUG-K instrument (Test of Understanding Graphs in Kinematics) was administered to students in both countries. The results show the difference between American students and Korean students by TUG-K objective. Also, the results are discussed in terms of a graph comprehension theory.