• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.6
• /
• pp.121-130
• /
• 2020

In order to provide customized services according to a specific user or environment, various service scenarios should be developed based on context-aware workflow model. As the context-aware workflow model is constructed using limited context information and service information in the service domain, overlapping elements can occur in many service scenarios. The repetitive work process that results from these overlapping elements delays the development process of the service scenario. Therefore, the elements of the context-aware workflow model must be reused to solve the unnecessary work processes of service scenario development. In this paper, we propose a reuse method XML Object in context-aware workflow model to improve the process of service scenario development. The proposed method documents and manages the independent XML Object of the context-aware workflow model and reuses it by invoking the unit document in the service scenario development process. It can also be applied to new service scenarios by changing the attribute values of reusable elements. Experiments show example that the development process of the service scenario is simplified by reusing the elements of the context-aware workflow model.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.131-143
• /
• 2007

The current trends in information technology and intelligent systems use data mining techniques to discover patterns and extract rules from distributed databases. In distributed environment, the extracted rules from data mining techniques can be used in dynamic replications, adaptive load balancing and other schemes. However, transmission of large data through the system can cause errors and unreliable results. This paper proposes the intelligent distributed platform based on dynamic group binding using mobile agents which addresses the use of intelligence in distributed environment. The proposed grouping service implements classification scheme of objects. Data compressor agent and data miner agent extracts rules and compresses data, respectively, from the service node databases. The proposed algorithm performs preprocessing where it merges the less frequent dataset using neuro-fuzzy classifier before sending the data. Object group classification, data mining the service node database, data compression method, and rule extraction were simulated. Result of experiments in efficient data compression and reliable rule extraction shows that the proposed algorithm has better performance compared to other methods.

• The Journal of Bigdata
• /
• v.7 no.2
• /
• pp.91-102
• /
• 2022

As artificial intelligence develops, AI chatbot systems are actively taking place. For example, in public institutions, the use of chatbots is expanding to work assistance and professional knowledge services in civil complaints and administration, and private companies are using chatbots for interactive customer response services. In this study, we propose a scenario-based AI voice chatbot system to reduce museum operating costs and provide interactive guidance services to visitors. The implemented voice chatbot system consists of a watcher object that detects the user's voice by monitoring a specific directory in real-time, and an event handler object that outputs AI's response voice by performing inference by model sequentially when a voice file is created. And Including a function to prevent duplication using thread and a deque, GPU operations are not duplicated during inference in a single GPU environment.

• Journal of Cadastre & Land InformatiX
• /
• v.52 no.1
• /
• pp.105-118
• /
• 2022

The demand for information related to 3D spatial objects model in metaverse, smart cities, digital twins, autonomous vehicles, urban air mobility will be increased. 3D model construction for spatial objects is possible with various equipments such as satellite-, aerial-, ground platforms and technologies such as modeling, artificial intelligence, image matching. However, it is not easy to quickly detect and convert spatial objects that need updating. In this study, based on spatial information (features) and attributes, using matching elements such as address code, number of floors, building name, and area, the converged building DB and the detected building DB are constructed. Both to support above and to verify the suitability of object selection that needs to be updated, one system prototype was developed. When constructing the converged building DB, the convergence of spatial information and attributes was impossible or failed in some buildings, and the matching rate was low at about 80%. It is believed that this is due to omitting of attributes about many building objects, especially in the pilot test area. This system prototype will support the establishment of an efficient drone shooting plan for the rapid update of 3D spatial objects, thereby preventing duplication and unnecessary construction of spatial objects, thereby greatly contributing to object improvement and cost reduction.

• Journal of Korea Spatial Information System Society
• /
• v.1 no.2 s.2
• /
• pp.137-149
• /
• 1999

Spatial database systems in client-server environment have network overload due to the large amount of spatial data transmission. Users use the window query that loads partial region of a whole map for quick response time in the environment. A series of window query such as screen movement, enlargement or shrinkage requires data in similar region and this increases network overload by re-transmitting the same data in intersected region with the earlier transmitted region. Removing the transmitted data from query results can solve this problem. In this paper, we design and implement a spatial object manager in order to remove the intersected region occurred by a series of window query. The spatial object manager manages the object identifiers of transmitted objects and removes transmitted objects from spatial objects of the query result by using the removal technique of the intersected region for the transmission and comparison. We utilize GEOMania Millennium server, an open client-server spatial database system, as spatial object manager in this paper. The result of the performance evaluation shows that the spatial object manager removes the transmission of the data redundancy, reduces network overload and improves the overall system performance.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.383-393
• /
• 2005

Retrieval of images from image databases by spatial relationship can be effectively performed through visual interface systems. In these systems, the representation of image with 2D strings, which are derived from symbolic projections, provides an efficient and natural way to construct image index and is also an ideal representation for the visual query. With this approach, retrieval is reduced to matching two symbolic strings. However, using 2D-string representations, spatial relationships between the objects in the image might not be exactly specified. Ambiguities arise for the retrieval of images of 3D scenes. In order to remove ambiguous description of object spatial relationships, in this paper, images are referred by considering spatial relationships using the spatial location algebra for the 3D image scene. Also, we remove the repetitive spatial relationships using the several reduction rules. A reduction mechanism using these rules can be used in query processing systems that retrieve images by content. This could give better precision and flexibility in image retrieval.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.25-34
• /
• 2011

In this paper we present an integrated design methodology for relational database based on object-oriented analysis and design. The integrated design methodology is based on business profile and has six phases. In the first phase, business use cases are identified and described by macroactivity diagrams and then the macroactivity diagrams are transformed to detailed business activity diagrams by using objects, object flows and business worker's responsibilities. In the third phase, the detailed business activity diagrams are transformed to business class diagrams that describe the static structure of the entire business system based on detailed business activity diagrams. In the four phase, the business class diagrams are transformed to class diagrams that represent the initial conceptual model of the target relational database. In the five phase, we add additional transformations on the class diagrams with generalization and specialization of associations, roles, activities, additional classes and redundant associations. Eventually, the final class diagrams are transformed to relational database schema. The methodology presented in this paper by applying that proposal for organic connection between object-oriented analysis and design methodology and relational database design methodology. And it will be able to deal with integration management. By the integrated design methodology, we can make more easily software systems based on relational database. In the case study, proposal integrated design methodology applied for a visa issuing system.

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.105-116
• /
• 2006

With the development of IT technology, the amount of digital contents used in various environments of wired/wireless networks have been increased hugely and rapidly To protect the loss of the digital contents from the sudden accident, continuous data backup is required. In this paper, we design and implement the backup system that stores digital contents in backup storage by objectifying the contents with a unit of I/O size and giving them the unique E using the properties of digital contents to avoid duplicated store of the same data. The backup system reduces the amount of backup data efficiently by backing up the only one copy of the duplicated data. as a result, the backup system can back up the digital contents more efficiently in a constrained storage space.

• Proceedings of Korean Society of Archives and Records Management
• /
• 2019.05a
• /
• pp.61-67
• /
• 2019

Recently, the central government organizations have changed their Business Management System to the cloud-based On-nara Document 2.0. According to this, the National Archives of Korea is spreading a cloud-based records management system. With the development of digital technology, including cloud computing, preservation and utilization of records must be redesigned continuously to be effective and efficient. It is needed that the process and method of the electronic records management will change from simple digitization of paper-based recording to digital technology. This article offers opinions related to the logical transfer, storage and redundancy elimination of digital objects, machine-readable format, big-data analysis, templates of official documents, and authenticity authentication system based on universally unique identifiers (UUID) and hash value.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.79-89
• /
• 2019

While most research focuses on the k-nearest neighbors (kNN) queries in the database community, an important type of proximity queries called k-farthest neighbors (kFN) queries has not received much attention. This paper addresses the problem of finding the k-farthest neighbors in road networks. Given a positive integer k, a query object q, and a set of data points P, a kFN query returns k data objects farthest from the query object q. Little attention has been paid to processing kFN queries in road networks. The challenge of processing kFN queries in road networks is reducing the number of network distance computations, which is the most prominent difference between a road network and a Euclidean space. In this study, we propose an efficient algorithm called FANS for k-FArthest Neighbor Search in road networks. We present a shared computation strategy to avoid redundant computation of the distances between a query object and data objects. We also present effective pruning techniques based on the maximum distance from a query object to data segments. Finally, we demonstrate the efficiency and scalability of our proposed solution with extensive experiments using real-world roadmaps.