• Korean Journal of Computational Design and Engineering
• /
• v.11 no.1
• /
• pp.27-40
• /
• 2006

The exchange of parameterized feature-based CAD models is important for product data sharing among different organizations and automation systems. The role of feature-based modeling is to gonerate the shape of product and capture design intends In a CAD system. A feature is generated by referring to topological entities in a solid. Identifying referenced topological entities of a feature is essential for exchanging feature-based CAD models through a neutral format. If the CAD data contains the modification history in addition to the construction history, a matching mechanism is also required to find the same entity in the new model (post-edit model) corresponding to the entity in the old model (preedit model). This problem is known as the persistent naming problem. There are additional problems arising from the exchange of parameterized feature-based CAD models. Authors have analyzed previous studies with regard to persistent naming and characteristics for the exchange of parameterized feature-based CAD models, and propose a solution to the persistent naming problem. This solution is comprised of two parts: (a) naming of topological entities based on the object spore information (OSI) and secondary name (SN); and (b) name matching under the proposed naming.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.3
• /
• pp.226-237
• /
• 2004

If the topology changes in the re-generation step of the history-based and feature-based CAD systems, it is difficult to identify an entity in the old model and find the same entity in the new model. This problem is known as 'persistent naming problem'. To exchange parametric CAD models, the persistent naming problem and the naming mapping problem must be solved among different CAD system, which use different naming scheme. For CAD model exchange the persistent naming has its own characteristics compare to that for CAD system development. This paper analyses previous researches and proposes a solution to the persistent naming problem for CAD model exchanges and to the naming mapping problem among different naming schemes.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.5
• /
• pp.468-476
• /
• 2000

Binding the object-oriented programming language C++ with a database management system provides a persistency to C++ programming objects so that objects can persist after program termina~,on. In such a binding system, we can manage a persistent object same as that we use a transient object and also use database management facilities such as transaction management and concurrency control. This paper presents a method providing the persistency to C++ programming objects in the binding system. We propose an improved interface based on C++ binding of ODMG-97 and present the design and implementation technique of it. The proposed interface provides a seamless interface for creating objects of the persistent capable class. We can create a persistent object without its class name as we do not give a class name when creating a transient object. Also, we guarantee the type compatibilty between the obiect created in database and the obiect created in main memory.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.449-456
• /
• 1999

본 논문은 C++에 분산 객체 프로그래밍 기능을 추가한 D++ 언어를 제안한다. 대등관계 복제객체 모델을 지원하는 D++는 분산 클래스의 정의, 멤버 함수의 일치성 제어 정의 기능, 그리고 영구 객체 이름에 기반한 분산 객체를 정의할 수 있는 언어 구조를 제공한다. D++ 프로그램에서 새로이 생성되는 분산 객체는 생성 시에 제공되는 객체의 영구 이름과 동일한 영구 이름을 갖는 분산 객체가 존재할 경우 해당 객체들과 복제 관계를 유지함으로써 정보를 공유한다. 각 복제 객체들은 서로 간에 대등한 관계를 가지며, 멤버 함수 정의 시에 기술되는 특성에 따라 일치성이 유지된다. 이 같은 D++의 분산 객체 모델은 실시간 그룹웨어의 기본 요구 사항인 분산 환경에서의 정보 공유 및 사건 공지 기능을 자연스럽게 해결해 주기 때문에 실시간 그룹웨어의 개발을 효율적으로 지원할 수 있을 것으로 기대한다. Abstract This paper proposes D++ programming language that is an extension of C++ for distributed object oriented programming. The D++, which supports peer-to-peer object model, provides new language constructs for the definition of distributed classes, the definition of the consistency control of the member function and the definition of distributed object variables with the persistent name. In D++, when the persistent name of a newly created distributed object is same as that of an existing distributed object, the new distributed object replicates object state of the existing distributed object and thus they share the object state. The replicas have peer relation and the consistency among them is maintained according to the characteristic described on the definition of designated member functions. It is expected that D++ language increases efficiency in development of real-time groupware because the distributed object model of D++ naturally supports the information sharing and event notification that are the basic functions required when building real-time groupware.

• Journal of Korea Multimedia Society
• /
• v.21 no.1
• /
• pp.10-17
• /
• 2018

Persistence Betty numbers, which are the rank of the persistent homology, are a generalized version of the size theory widely known as a descriptor for shape analysis. They show robustness to both perturbations of the topological space that represents the object, and perturbations of the function that measures the shape properties of the object. In this paper, we present a shape matching algorithm which is based on the use of persistence Betty numbers. Experimental tests are performed with Kimia dataset to show the effectiveness of the proposed method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.5
• /
• pp.449-458
• /
• 2010

Recently, the interest on object oriented design patterns has been increased considering to reusability of software and efficiency of maintenance expense in designing software architecture. In this paper, we design the paper submission management system applicable to specific domain using domain object interface based on object oriented design patterns, and then implement it with Java and XML. The proposed system applies method of implementation by assemblying each system objects with upward after system entire architecture design by combining properly downward method and upward method and applies with GoF Design pattern. As well as, we convert domain data of system into the form of various persistent objects through XML, and minimize the complexity of system by not adopting method that generates domain object as in Class with automatic. Finally, the implementation of our system can be used in general C/S environment, but we implement system user GUI using the XSLT built in general web browser in consideration for user convenience and consistency.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.152-162
• /
• 2016

Most traditional garbage collectors commonly use the language level metadata, which is designed for pointer type searching. However, because it is difficult to use this metadata in non-volatile memory allocation platforms, a new garbage collection technique is essential for non-volatile memory utilization. In this paper, we design new metadata for managing information regarding non-volatile memory allocation called "Allocation Tree". This metadata is comprised of tree data structure for fast information lookup and a node that holds an allocation address and an object ID pair in key-value form. The Garbage Collector starts collecting when there are insufficient non-volatile memory spaces, and it compares user data and the allocation tree for garbage detection. We develop this algorithm in a persistent heap based non-volatile memory allocation platform called "HEAPO" for demonstration.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.589-601
• /
• 2003

XLink is XML Linking Language that defines links between XML documents or XML elements. It uses XML syntax to create structures that can describe links similar to the simple unidirectional hyperlinks of HTML, as well as more sophisticated links. There exist several relationships between resources that linked by XLink. Without supports from XML Repository for these relationship management, there is a huge overhead related to the management of relationships during both application development and maintenance, since the relationships need to be hard-coded directly into the application program itself. In this paper, we propose an XLink supporting system in object repository. We describe the design and implementation of this system on top of XDOM(persistent DOMlink XML repository). To support XLink, our system offers referential relationship semantics, extended link and the expansion of DOM tree for XLink.

• Asia pacific journal of information systems
• /
• v.8 no.3
• /
• pp.21-36
• /
• 1998

Group collaborative systems are recently emerging to support a group of users engaged in common tasks such as group decision making, engineering design, or collaborative writing. Simultaneously, as communications networks and distributed database systems become core underlying architecture of the organization, the need of collaborative systems are gaining more attentions from industry. In such collaborative systems, as the shared objects may evolve constantly or change for operational purposes, providing the users with synchronized and consistent views of the shared object and maintaining the consistency between shared object and replicated objects are important to improve the overall productivity. This paper provides an change management framework for the group collaborative systems to facilitate managing dependency relationships between shared objects and dependents, and coordinating change and propagation activities in distributed computing environments. Specifically, the framework adopts an object-oriented database paradigm and presents several object constructs capturing dependency management and change notification mechanisms. And the proposed framework accommodates both persistent dependents such as replicated data and transient dependents such as various user views in a single formalism. A prototype system is developed on a commercial object-oriented database management system called OBJECTSTORE using the C++ programming language.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.10a
• /
• pp.214-218
• /
• 1998

분산 객체 컴퓨팅 환경이 대두되고 있는 오늘날, 네트워크 상에 분산되어 있는 객체들을 효율적으로 관리할 수 있는 기능이 필요하게 되었다. OMG(Objective Request Broker Architecture)에서는 개체를 바인딩하기 위한 두 가지 형태의 객체 참조, 즉 일시적 객체참조(Transient Object Reference)와 영구적 객체참조(Persistent Object Reference)가 있으며 영구적 객체 참조를 바인딩하기 위해서 ORB는 구현저장소를 제공해야 한다. 이를 위해 CORBA 스펙에서는 구현저장소의 개념만을 정의되어 있을 뿐 인터페이스는 아직 정의되어 있지 않은 상태이다. 본 논문에서는 구현저장소의 도움만을 받아 구현객체를 바인딩 할 수 있도록 하기 위한 구현저장소의 인터페이스를 설계하였다.