• Journal of KIISE:Software and Applications
• /
• 제27권7호
• /
• pp.691-701
• /
• 2000

Software documents consists of a number of objects and relationships between them, and structure of documents can be changed frequently. In this paper, we propose a version storage and consistency management model for fine-grained software objects based on operations applied to edit software objects. An object has an interface and can be updated only through operations defined in its interface. Operations applied to objects are recorded in the operation history, which is used to retrieve versions of a document and manage consistency between documents. Because versions of an object are stored and retrieved using the operation delta, it is not needed to compare versions of a document to extract delta and it is easy to identify the changes between versions in order to propagate the changes. Consistencies between documents are managed using dependencies between objects and kinds of the operations applied to the objects. Therefore unnecessary version propagation can be avoided. This paper presents a formal model of version retrieval and consistency management at the fine-grained level based on operations applied to the objects.

• The KIPS Transactions:PartA
• /
• 제16A권2호
• /
• pp.125-134
• /
• 2009

This paper proposes a change management system of sensor network applications based on version synchronization that supports to effectively manage defect correction of applications, change of functions for applications or improvement of applications without suspending the sensor network. The proposed change management system consists of the NADE which is an application development environment, the Node Management Server, and the Node Agent. NADE is an Eclipse-based development environment for developing applications which are installed into nodes. NADE is also connected with CVSNT which is a version management tool and performs application version management using the CVSNT. Node Management Server manages nodes to maintain latest versions of applications by synchronizing versions of applications which are performed on the nodes with the versions of applications which are developed in the NADE. Node Agent which is loaded into the node periodically sends the version information of the application to the server, and stores and updates the version information of the application. Through the proposed change management system, applications of nodes are automatically updated when versions of applications are changed by correcting defects, changing functions or improving applications. Therefore, the user can effectively manage the execution of sensor network system without suspending or delaying the sensor network. Also, visibility of change management for sensor network applications will be improved.

• Journal of the Korea Computer Industry Society
• /
• 제2권8호
• /
• pp.1099-1108
• /
• 2001

In this paper, we proposed an efficient method of management in which various design objects in the environments for distributed software development. Those design objects are created in the environments for distributed software development based on Unified Modeling Language as well as versions of source codes. In this research, a version control technique has been specially focused that is based on our proposed version rules to consistently control versions from web-based distributed software development which enables developers to independently manage distributed objects from the software development platform. Based on the version control technique, we have designed a web-based rule-control version management model that has been proposed here.

• Journal of the Korea Society for Simulation
• /
• 제11권2호
• /
• pp.55-66
• /
• 2002

VHDL has been. widely used in modeling and simulation of hardware designs. However, complex relationship between components of the designs makes the VHDL modeling problem very difficult. Furthermore, after the initial creation of VHDL models, they evolve into many versions over their lifetime. To cope with such difficulties, this paper proposes a new methodology for the management of VHDL models supporting versions. Its conceptual bases are system entity structure and relational database. Within the methodology, a family of hierarchical structures of a design is organized in the form of VHDL model structure. It is, in turn, represented in the form of relational tables. Once the model structure is built in such a way, a specific simulation model which meets design objective is pruned from the model structure. The details of VHDL codes are systematically synthesized by combining it with the primitive models in a model base. These algorithms are also defined in terms of relational algebraic operations.

• The Transactions of the Korea Information Processing Society
• /
• 제5권12호
• /
• pp.3036-3046
• /
• 1998

Various versions can be generated in course of development of object-oriented software in a distributed system. Research methods are required for the efficient management of these various versions, For this reason, this paper proposes a model of version which is based on five dimensional object space this is extended from FONASSE data model shich we have suggested. We developed a method of version numbering for the effective managa of the versions. for make software developers manage versions efficiently, we design and implement local version manager by using TCI/TK and C' in Solaris 2.5.

• The KIPS Transactions:PartD
• /
• 제11D권7호
• /
• pp.1349-1356
• /
• 2004

The interest of version management is increasing in electronic commerce requiring data mining and documents processing system related to digital governmentapplications. In this paper, we define a change set that is to manage historicalinformation and to maintain XML documents during a long period of time and propose several storage policies of XML documents using a change set. A change set includes a change oper-ation set and temporal dimensions and a change operation set is composed with schema change operations and data change operations. We pro-pose three storage policies using a change set. Three storage policies are (1) storing all the change sets, (2) storing the change sets and the versions periodically. (3) storing the aggregation of change sets and the versions at a point of proper time. Also, we compare the performance between the existing storage policy and the proposed storage policies. Though the performance evaluation, we show that the method to store the aggregation of change sets and the versions at a point of proper time outperforms others.

• Journal of Korea Society of Digital Industry and Information Management
• /
• 제9권3호
• /
• pp.39-48
• /
• 2013

Ontology has an important role in semantic web to construct and query semantic data. When system make changes to ontologies, questions arise about versioning of these changes. Applying this changes on a dynamic environment is even more important. To apply these changes, change specification method is needed. Early studies show RDF-based syntax for the operations between old and new ontologies. When several ontology versions can be used for some query, if possible, using possible newest version ontology with prospective use is best way to process the query. Prospective use of ontology means using a newer version of an ontology with a data source that conforms to a more recent ontology. In this paper, for prospective use of ontology version, structure of change specification of class and property through several ontology versions is proposed. From this, efficient adaptive ontology version selection for a query can be possible. Algorithm for structure of version transition representation is proposed and simulation results show possible newest version number for queries.

• Journal of the Korean Society for information Management
• /
• 제7권2호
• /
• pp.138-149
• /
• 1990

The present study is aimed at the comparative evaluation of several CD-ROM MEDLINE versions for biomedical information retrieval and searching. The CD-ROM MEDLINE has recently been introduced in Korea and is actively using for health and medical professionals as an effective delivery tool of biomedical information. And this evaluative study revealed some different advantages and disadvantages in searching information among several CD-ROM MEDLINE versions. The present study also provides some findings of CD-ROM user's information seeking behaviors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제14권1호
• /
• pp.233-241
• /
• 2010

CoSlide is a collaborative system, extending the Jakarta Slide WebDAV server. The CoSlide server provides group workspaces for collaborators. CoSpace is a client which supports various collaborative authoring activities on the CoSlide server through the WebDAV protocol. CoSpace provides graphic user interfaces to support effective interaction among the collaborators, managing the shared resources for them. However, during collaboration, simultaneous modifications on the content of shared resources might cause conflicts among the content of the revisions made by the collaborators, leading to serious problems on project progress. In this paper, we describe an extension of the CoSpace client to solve the problem. The extended CoSpace client supports the remote version management facility through which the collaborators can manage the versions of the associated server resources in the distance. Also, to identify the changes of the text files such as program source codes, the extended client provides the facility for comparing two versions and displaying the differences in a visual manner. In addition, it provides the version management of a whole workspace and the removal of all the unnecessary versions of the designated resources.

• ETRI Journal
• /
• 제31권3호
• /
• pp.333-335
• /
• 2009

To match the requirements of heterogeneous mobile devices, video objects may be transcoded, which requires considerable CPU resources. Alternatively, multiple versions of the same video may be stored on servers, but this requires a lot of disk space. We formulate the trade-off between the versions that are stored on disk and the need for transcoding. We propose an optimal solution to this formulation based on dynamic programming. Experiments show that our scheme allows up to 68% more clients to be admitted than conventional schemes when a reasonable amount of storage is available.