• Title/Summary/Keyword: Oriented Graph

Search Result 98, Processing Time 0.028 seconds

CBAbench: An AutoCAD-based Dynamic Geometric Constraint System

  • Gong, Xiong;Wang, Bo-Xing;Chen, Li-Ping
    • International Journal of CAD/CAM
    • /
    • v.6 no.1
    • /
    • pp.173-181
    • /
    • 2006
  • In this paper, an integration framework of Geometric Constraint Solving Engine and AutoCAD is presented, and a dynamic geometric constraint system is introduced. According to inherent orientation features of geometric entities and various Object Snap results of AutoCAD, the' proposed system can automatically construct an under-constrained geometric constraint model during interactive drawing. And then the directed constraint graph in a geometric constraint model is realtime modified in order to produce an optimal constraint solving sequence. Due to the open object-oriented characteristics of AutoCAD, a set of user-defined entities including basic geometric elements and graphics constraint relations are defined through derivation. And the custom-made Object Reactor and Command Reactor are also constructed. Several powerful characteristics are achieved based on these user-defined entities and reactors, including synchronously processing geometric constraint information while saving and opening DWG files, visual constraint relations, and full adaptability to Undo/Redo operations. These characteristics of the proposed system can help the designers more easily manage geometric entities and constraint relations between them.

A Formal Approach for the Reorganization of Class Hierarchies for the Extension of Object Oriented Applications (객체지향 어플리케이션의 확장을 위한 클래스 계층 구조의 재구성에 대한 정형기법)

  • Hwang, Suk-Hyung;Kim, Dae-Won;Yang, Hae-Sool
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.3
    • /
    • pp.589-602
    • /
    • 1999
  • There are some advantages of developing applications based on the object oriented concepts. One os them is that it is possible to reuse the existing designs and products. This paper provides a formal method for the reorganization of class hierarchies for the object extension in the object oriented design phase. In this paper, we introduce classes, and edges to represent the inheritance and aggregation relationship between classes. Based on the graph, we define an order relation(called the object extension) between class hierarchy graphs. And also we present a set of five basic transformations preserving the object extension relation. The set is proven to be correct and complete. The results of this paper help form a theoretical basis for the extension and reorganization object-oriented application systems.

  • PDF

Static Allocation of C++ Objects to CORBA-based Distributed Systems (C++ 객체의 CORBA 기반 분산 시스템으로의 정적 할당)

  • 최승훈
    • Journal of Internet Computing and Services
    • /
    • v.1 no.2
    • /
    • pp.69-88
    • /
    • 2000
  • One of the most important factors on the performance of the distributed systems is the effective distribution of the software components, There have been a lot of researches on partitioning and allocating the task-based system, while the studies on the allocating the objects of the object-oriented system into the distributed object environments are very little relatively. In this paper. we defines the graph model for partitioning the existing C++ application and allocating the C++ objects into CORBA-base distributed system, In addition, we propose a distributed object allocation algorithm based on this graph model. The performance of distributed systems is determined by the concurrency between objects, the load balance among the processors and the communication cost on the networks. To search for the solutions optimizing the above three factors simultaneously, the object allocation algorithm of this paper is based on the Niched Pareto Genetic Algorithm (NPGA). We performed the experiment on the typical C++ application and CORBA system to prove the effectiveness of our graph model and our object allocation algorithm.

  • PDF

Automatic STG Derivation with Consideration of Special Properties of STG-Based Asynchronous Logic Synthesis (신호전이그래프에 기반한 비동기식 논리합성의 고유한 특성을 고려한 신호전이그래프의 자동생성)

  • Kim, Eui-Seok;Lee, Jeong-Gun;Lee, Dong-Ik
    • The KIPS Transactions:PartA
    • /
    • v.9A no.3
    • /
    • pp.351-362
    • /
    • 2002
  • Along with an asynchronous finite state machine, in short AFSM, a signal transition graph, in short STG, is one of the most widely used behavioral description languages for asynchronous controllers. Unfortunately, STGs are not user-friendly, and thus it is very unwieldy and time consuming for system designers to conceive and describe manually the behaviors of a number of asynchronous controllers which constitute an asynchronous control unit for a target system in the form of STGs. In this paper, we suggest an automatic STG derivation method through a process-oriented method. Since the suggested method considers special properties of STG-based asynchronous logic synthesis very carefully, asynchronous controllers which are synthesized from STGs derived through the suggested method are superior in aspects of area, synthesis time, performance and implementability compared to those obtained through previous methods.

A Method for Detecting Program Plagiarism Comparing Class Structure Graphs (클래스 구조 그래프 비교를 통한 프로그램 표절 검사 방법)

  • Kim, Yeoneo;Lee, Yun-Jung;Woo, Gyun
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.11
    • /
    • pp.37-47
    • /
    • 2013
  • Recently, lots of research results on program comparison have been reported since the code theft become frequent as the increase of code mobility. This paper proposes a plagiarism detection method using class structures. The proposed method constructs a graph representing the referential relationship between the member variables and the methods. This relationship is shown as a bipartite graph and the test for graph isomorphism is applied on the set of graphs to measure the similarity of the programs. In order to measure the effectiveness of this method, an experiment was conducted on the test set, the set of Java source codes submitted as solutions for the programming assignments in Object-Oriented Programming course of Pusan National University in 2012. In order to evaluate the accuracy of the proposed method, the F-measure is compared to those of JPlag and Stigmata. According to the experimental result, the F-measure of the proposed method is higher than those of JPlag and Stigmata by 0.17 and 0.34, respectively.

A Dynamic Resource Allocation Method in Tactical Network Environments Based on Graph Clustering (전술 네트워크 환경에서 그래프 클러스터링 방법을 이용한 동적 자원 할당 방법)

  • Kim, MinHyeop;Ko, In-Young;Lee, Choon-Woo
    • Journal of KIISE:Software and Applications
    • /
    • v.41 no.8
    • /
    • pp.569-579
    • /
    • 2014
  • In a tactical-edge environment, where multiple weapon resources are coordinated together via services, it is essential to make an efficient binding between an abstract service and a resource that are needed to execute composite services for accomplishing a given mission. However, the tactical network that is used in military operation has low bandwidth and a high rate of packet loss. Therefore, communication overhead between services must be minimized to execute composite services in a stable manner in the tactical network. In addition, a tactical-edge environment changes dynamically, and it affects the connectivity and bandwidth of the tactical network. To deal with these characteristics of the tactical network we propose two service-resource reallocation methods which minimize the communication overhead between service gateways and effectively manage neutralization of gateways during distributed service coordination. We compared the effectiveness of these two - methods in terms of total communication overhead between service gateways and resource-allocation similarity between the initial resource allocation and the reallocation result.

An Implementation of Product Data Management System for Design of Ship Propulsion System (선박 추진시스템 설계를 위한 PDM 구현)

  • Suh, Sung-Bu
    • Journal of Navigation and Port Research
    • /
    • v.35 no.6
    • /
    • pp.489-494
    • /
    • 2011
  • Present study introduces an implementation of product data management (PDM) that can be applied to the design of ship propulsion system. The PDM system is developed based on both object oriented software development environment and Open Scene Graph (OSG) library while the system architecture is modeled by the unified modeling language (UML). Suggested PDM system also integrates the modeling & simulation components required to estimate the performance of ship propulsion system as the product information is represented based on the 3-dimensional digital mock-up (DMU). Finally, functions of the implemented PDM system that is integrated with the M&S softwares are illustrated in order to suggest a practical guidance for the efficient design of ship propulsion system.

A Method of Test Case Generation Using BPMN-Based Path Search (BPMN 기반 경로 탐색을 이용한 테스트 케이스 생성 기법)

  • Park, JeJun;Kang, DongSu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.3
    • /
    • pp.125-134
    • /
    • 2017
  • The SOA (Service Oriented Architecture) based softwares are escalated because of quickly coping with business requirement. SOA can not apply to existing test method because of loosely coupled service and massage exchange architecture. In this paper, we suggest a method of test case generation using BPMN (Business Process Model and Notation). First we model processes, then make Business Flow Graph (BFG). After searching the euler path through symmetrized BFG about input and output degrees, we generate test cases. A method of test case generation using BPMN can apply at SOA-based system, and reduce the number of test cases.

Design of Visual Object-Oriented Database Query Language and Implementation of the Query Processor (시각적 객체지향 데이터베이스 질의어의 설계 및 질의처리기의 구현)

  • Lee, Suk-Kyoon;Nah, Yun-Mook;Suh, Yong-Moo
    • Asia pacific journal of information systems
    • /
    • v.11 no.2
    • /
    • pp.121-139
    • /
    • 2001
  • VOQL* query language, recently proposed, is a visual language for object-oriented databases. It is based on Ven Diagram and graph, so that the underlying schema structure can be naturally implied in query expressions. In VOQL*, structural relationship among the objects used in a query expression is represented graphically and thus it has formal semantics that can be inductively defined, as well as it can be used with ease. In this paper, we proposed revised VOQL* and introduced its query processor, InQs(Intelligent Querying System). While retaining the merit of VOQL* that it allows the structural relationship among the objects to be represented visually, the revised VOQL* has another merit that users can formulate a query interactively using various forms supplied by InQs. As a query processor that translates queries in revised VOQL into those in ODMG OQL, InQs provides an environment in which users express queries in revised VOQL* and then the system automatically translates them into those in ODMG OQL. Translation algorithm of InQs is much simpler and intuitive than other algorithms used in QUIVER and other systems, since it reflects the formal semantics of VOQL*, which is defined inductively.

  • PDF

Object-Oriented Software Regression Testing by Class Node Analysis (클래스 노드 분석에 의한 객체 지향 소프트웨어 회귀 테스팅)

  • Kwon, Young-Hee;Li, Len-Ge;Koo, Yeon-Seol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.12
    • /
    • pp.3523-3529
    • /
    • 1999
  • In this paper, we propose an improved regression testing method, which use method as the basic unit of changing. The testing method consists of three steps. We represent the relationship of classes using the notation of UML(Unified Modeling Language), find the nodes of the modified methods and affected methods by node analysis, and then select changed test cases from the original test cases. The proposed object-oriented regression testing method can reduce the number of test cases, testing time and cost through reuse of test cases.

  • PDF