• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.141-156
• /
• 2010

Despite all attempts to prevent fraud, it continues to be a major threat to industry and government. Traditionally, organizations have focused on fraud prevention rather than detection, to combat fraud. In this paper we present a role mining inspired approach to represent user behaviour in Enterprise Resource Planning (ERP) systems, primarily aimed at detecting opportunities to commit fraud or potentially suspicious activities. We have adapted an approach which uses set theory to create transaction profiles based on analysis of user activity records. Based on these transaction profiles, we propose a set of (1) anomaly types to detect potentially suspicious user behaviour, and (2) scenarios to identify inadequate segregation of duties in an ERP environment. In addition, we present two algorithms to construct a directed acyclic graph to represent relationships between transaction profiles. Experiments were conducted using a real dataset obtained from a teaching environment and a demonstration dataset, both using SAP R/3, presently the predominant ERP system. The results of this empirical research demonstrate the effectiveness of the proposed approach.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.1 s.94
• /
• pp.81-86
• /
• 2005

In this work, we propose a new ultrasonic damage inspection method in plate structures. The proposed method employs an OPMT(orientation-adjustable patch-type magnetostrictive transducer) in order to make the ultrasonic waves directed to a specific target point. For experiments, virtual grid points were set up at every 50 mm in an aluminum plate and two OPMTs were used for inspection. If there exists a crack in a plate, the reflected Lamb wave from the crack is measured in addition to the direct waves from the transmitting transducer to the receiving transducer.

• Journal of Korean Society for Quality Management
• /
• v.7 no.1
• /
• pp.41-50
• /
• 1979

The purpose of this study is to examine the introduction and its application of objectives management system in practical case, This study attempts to describe, (1) the relationships between the objectives management and budget management (2) analyzed the introduced organization and applicable system for the performance of objectives. Concepts of objectives, as this study is adjusted as follows; i) Objectives must be operational. They must be capable of being converted into specific targets and specific assignments. Therefore, objectives are the basis for work and assignments; they determine the structure of the business, the key activities which must be discharged, and, above all, the allocation of people to tasks. ii) Setting objectives for investment requires also objectives for the structure, basic policies, jobs, and directions of the business itself. They are not selling objectives; They are genuine marketing objectives, and as such have to be built into the way the business itself is set up, directed, structured, and run.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2013.02a
• /
• pp.219-220
• /
• 2013

The phenomenology of liquid breakdown has been an area of interest for many years but is still not fully understood. Moreover, it was known that the behavior of magnetic nanoparticles in transformer oil could affect the dielectric breakdown voltage positively or negatively. In this study, we have imaged the magnetic nanoparticles in a transformer oil in-situ using an optical microscopic set-up and a microchannel according to the electric and magnetic fields applied. And we have calculated numerically dielectrophoresis and magnetophoresis forces, which must be the driving mechanisms to move magnetic nanoparticles in the fluid. It was found that when the electric field is applied the magnetic nanoparticles in the fluid experience an electrical force directed toward the place of maximum electric field strength. And when the external magnetic field is applied, the magnetic nanoparticles form long chains oriented along the direction of the field.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.14-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.13-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.385-396
• /
• 2008

For a positive integer m and a digraph D, the m-step competition graph $C^m$ (D) of D has he same set of vertices as D and an edge between vertices u and v if and only if there is a vertex x in D such that there are directed walks of length m from u to x and from v to x. Cho and Kim [6] introduced notions of competition index and competition period of D for a strongly connected digraph D. In this paper, we extend these notions to a general digraph D. In addition, we study competition indices of tournaments.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.44-52
• /
• 1997

A design process is difficult to describe comprehensively because a design problem has a multi-disciplinary nature and the design itself evolves as solutions are attempted by the designer. The process of design has been investigated in this paper with the purpose of characterizing the role that a system of this kind may have. In defining the system, an approach has been used that privileges the relationships with the existing CAD tools based on data exchange standards in course of definition today. Integrated design environment normally consists of a centralized data model a data management system and a set of CAD tools. In this study, all further investigations are directed towards the data management system, as one of the main components of the proposed environment. Moreover, product modeling, as a prerequisite for the data management core, is taken into special consideration.

• Honam Mathematical Journal
• /
• v.21 no.1
• /
• pp.157-169
• /
• 1999

For a k-connected inverse system $({\scr{X}},\;*)=((X_{\lambda},\;*),p_{{\lambda}{{\lambda}}^{\prime}},\;{\Lambda})$ of pointed topological spaces and pointed preserving weak fibrations, inducting epimorphic chain maps, over a directed set, we show that the homotopy group ${\pi}_k(lim{\scr{X}},\;*)$ of the inverse limit is isomorphic to the integral homology group $$H_k(lim{\scr{X}};\mathbb{Z})$. Using the result of S. $Marde{\check{s}}i{\acute{c}}$, we prove that the group of pure extension $Pext(colimH^n({\scr{X}},\;A)$ is isomorphic to the group of extension $Ext({\Delta}({\lambda}),\;Hom(H^n({\scr{X}}),\;A))$.

• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.1
• /
• pp.1-15
• /
• 2000

In this paper, an efficient system for finding answers to a given path algebra expression in a directed acylic graph is discussed more particulary, in a multimedia presentration graph. Path algebra expressions are formulated using revised versions of operators next and until of temporal logic, and the connected operator. To evaluate queries with path algebra expressions, the node code system is proposed. In the node code system, the nodes of a presentation graph are assigned binary codes (node codes) that are used to represent nodes and paths in a presentation graph. Using node codes makes it easy to find parent-child predecessor-sucessor relationships between nodes. A pair of node codes for connected nodes uniquely identifies a path, and allows efficient set-at-a-time evaluations of path algebra expressions. In this paper, the node code representation of nodes and paths in multimedia presentation graphs are provided. The efficient algorithms for the evaluation of queries with path algebra expressions are also provided.