• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.4
• /
• pp.1453-1459
• /
• 2012

The dual stage manipulator is composed of the voice coil motor (VCM) and piezoelectric ceramics transducer (PZT), which can produce the high precise displacement and express a well dynamic performance. However, inaccurate modeling of the dual stage will exacerbate the positioning accuracy. This paper presents an approach to model the dual stage system by using bond graph theory. And the state space equations can be derived through the bond graph straightforwardly, which can be used in computing simulations. Through designing the compensators for the dual stage system and simulating, the dual stage performs better dynamics characteristic than the single actuator system.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.677-682
• /
• 2006

Multi-domain design is difficult because such systems tend to be complex and include a mixtures of electrical, mechanical, hydraulic, and thermal components. To design an optimal system, unified and automated procedure with efficient search technique is required. This paper introduces design method for multi-domain system to obtain design solutions automatically, combining bond graph which is domain independent modeling tool and genetic programming which is well recognized as a powerful tool for open-ended search. The suggested design methodology has been applied for design of electric fitter, electric printer drive, and and pump system as a proof of concept for this approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3258-3273
• /
• 2021

Malware is a severe threat to the computing system and there's a long history of the battle between malware detection and anti-detection. Most traditional detection methods are based on static analysis with signature matching and dynamic analysis methods that are focused on sensitive behaviors. However, the usual detections have only limited effect when meeting the development of malware, so that the manual update for feature sets is essential. Besides, most of these methods match target samples with the usual feature database, which ignored the characteristics of the sample itself. In this paper, we propose a new malware detection method that could combine the features of a single sample and the general features of malware. Firstly, a structure of Directed Cyclic Graph (DCG) is adopted to extract features from samples. Then the sensitivity of each API call is computed with Markov Chain. Afterward, the graph is merged with the chain to get the final features. Finally, the detectors based on machine learning or deep learning are devised for identification. To evaluate the effect and robustness of our approach, several experiments were adopted. The results showed that the proposed method had a good performance in most tests, and the approach also had stability with the development and growth of malware.

• Journal of Convergence for Information Technology
• /
• v.11 no.6
• /
• pp.24-32
• /
• 2021

Recently, ransomware attacks have been infected through various channels such as e-mail, phishing, and device hacking, and the extent of the damage is increasing rapidly. However, existing known malware (static/dynamic) analysis engines are very difficult to detect/block against novel ransomware that has evolved like Advanced Persistent Threat (APT) attacks. This work proposes a method for modeling ransomware malicious behavior based on graph databases and detecting novel multi-complex malicious behavior for ransomware. Studies confirm that pattern detection of ransomware is possible in novel graph database environments that differ from existing relational databases. Furthermore, we prove that the associative analysis technique of graph theory is significantly efficient for ransomware analysis performance.

• Industrial Engineering and Management Systems
• /
• v.6 no.1
• /
• pp.72-82
• /
• 2007

Business Rules are formal statements about the data and processes of an enterprise. They present projections of the organization's constraints and ways of working on their supporting information systems. Therefore, their collection, structuring and organization should be central activities within information systems. In an enterprise, business rules are used to represent certain aspects of a business domain (static rules) or business policy (dynamic rules). Hence, regarding problem domains in the organization, business rules are classified into two groups: static and dynamic business rules. The paper introduces a new concept of business rules, Extended Dynamic Business Rule (EDBR) which contains the results of the occurrence of business rule's action. The focus of this paper is in the organizing, defining and modeling of such business rules using Mineau's approach. Mineau's approach is an extension of Sowa's Conceptual Graph theory.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1805-1816
• /
• 1999

This paper presents the Module Class Dependency Graph for expressing the dependency relations between classes effectively. The object-oriented language is developed independently at design time, and consists of relationship between classes. Therefore we need to consider these characteristics of independence, and to express effectively the relation of classes which is existed in class hierarchy. In the System Dependence Graph and Class Dependence Graph, the relationship of classes is not expressed. To express the class relationship, we propose the Module Class Dependence Graph, and we verify the effectiveness of this method applying to object constructor, inheritance relationship and dynamic binding. Also, we presents the expressing method of parameter to identify the member data of classes. Using this Module Class Dependency Graph, we can analyze the relationship of module class correctly at design time. This method can be applied to reverse engineering, testing, visualization and other various fields to analyze system.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1992.10a
• /
• pp.339-343
• /
• 1992

For the analysis of dynamic behavior of dynamic behavior of multibody systems by cartesian coordinate method, maximal sets of generalized coordinates and maximum numbers of differential equation and constraints must be considered. Therefore the inefficiency of the increase of CPU time is occurred. This paper is to analyze the dynamic system by using the relative coordinate method without violating the geometric condition of systems. The graph theory and system topology were used for this study. The dynamic systems could be analyzed by the automatic generation of the informations like equation of motion, constraints, and external forces etc. And the results were compared and verified with dynamic commercial package DADS.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.955-962
• /
• 2006

This paper has the objects of deciding dynamic instability regions of thick plates on Pasternak foundation by finite element method and providing kinematic design data for mats and slabs of building structures. In this paper, dynamic stability analysis of tapered opening thick plate is done by use of Serendipity finite element with 8 nodes considering shearing strain of plate. To verify this finite element method, buckling stress and natural frequencies of thick pate with or without in-plane stress are compared with existing solutions. The results are as follow that this finite element solutions with 4x4 meshes are shown the error of maximum 0.56% about existing solutions, and obtained dynamic instability graph according with variation of opening positions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.112-113
• /
• 2008

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.806-809
• /
• 2004

동적 객체지향 프로그램 슬라이싱을 구현하기 위해서 프로그램 종속 그래프가 필요하다. 본 논문에서는 기존의 동적 객체지향 프로그램 종속 그래프 기법 보다 효율적인 동적 객체지향 프로그램 종속 그래프 기법을 제안하였다. 본 논문에서 제안한 기법이 기존에 비해 효율적임을 보이기 위해 그래프의 복잡도를 측정하여 비교하였다. 그리고 프로그램 슬라이스의 크기도 함께 측정하여 본 논문에서 제시한 기법이 효율적임을 증명하였다.