• Journal of KIISE:Software and Applications
• /
• v.37 no.4
• /
• pp.239-251
• /
• 2010

In modern distributed enterprise applications that have multilayered architecture, business entities are a kind of crosscutting concerns running through service components that implements business logic in each layer. When business entities are modified, service components related to them should also be modified so that they can deal with those business entities with new types, even though their functionality remains the same. Our previous paper proposed what we call the DTT (Data Type-Tolerant) component model to efficiently process the variability of business entities, which are data externalized from service components. While the DTT component model, by removing direct coupling between service components and business entities, exempts the need to rewrite service components when business entities are modified, it incurs the burden of implementing data type converters that mediate between them. To solve this problem, this paper proposes a method to use ontology as the metadata of both SCDTs (Self-Contained Data Types) in service components and business entities, and a method to generate data type converter code using the ontology. This ontology-based DTT component model greatly enhances the reusability of service components and the efficiency in processing data variability by allowing the computer to automatically generate data type converters without error.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.81-92
• /
• 2011

There has been a number of attempts to apply 3D CAD data created in the design stage of product life cycle to various applications of the other stages in related industries. But, 3D CAD data requires a large amount of computing resources for data processing, and it is not suitable for post applications such as distributed collaboration, marketing tool, or Interactive Electronic Technical Manual because of the design information security problem and the license cost. Therefore, various lightweight visualization formats and application systems have been suggested to overcome these problems. However, most of these lightweight formats are dependent on the companies or organizations which suggested them and cannot be shared with each other. In addition, product structure information is not represented along with the product geometric information. In this paper, we define a dataset called prod-X3D(Enhanced X3D Dataset for Web-based Visualization of 3D CAD Product Model) based on the international standard graphic format, X3D, which can represent the structure information as well as the geometry information of a product, and propose a translation method from 3D CAD data to an prod-X3D.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.631-640
• /
• 2003

Because of multi-hop wireless communication, P2P applications in ad hoc networks suffer poor performance. We Propose neighbor caching strategy to overcome this shortcoming and show it is more efficient than self caching that nodes store data in theirs own cache individually. A node can extend its caching storage instantaneously with neighbor caching by borrowing the storage from idle neighbors, so overcome multi-hop wireless communications with data source long distance away from itself. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The node that uses the ranking based prediction can select the neighbor that has high possibility to keep data for a long time and avoid caching the low ranked data. Therefore the ranking based prediction improves the throughput of neighbor caching. In the simulation results, we observe that neighbor caching has better performance, as large as network size, as long as idle time, and as small as cache size. We also show the ranking based prediction is an adaptive algorithm that adjusts times of data movement into the neighbor, so makes neighbor caching flexible according to the idleness of nodes

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.17-23
• /
• 2016

In the future network such as Internet of Things (IoT), the number of computing devices are expected to grow exponentially, and each of the things communicates with the others and acquires information by itself. Due to the growing interest in IoT applications, the broadcasting in Opportunistic ad-hoc networks such as Machine-to-Machine (M2M) is very important transmission strategy which allows fast data dissemination. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose a fuzzy logic based probabilistic multi-hop broadcast (FPMCAST) algorithm which statistically disseminates data accordingly to the remaining energy rate, the replication density rate of sending node, and the distance rate between sending and receiving nodes. In proposed FPMCAST, the inference engine is based the fuzzy rule base which is consists of 27 if-then rules. It maps input and output parameters to membership functions of input and output. The output of fuzzy system defines the fuzzy sets for rebroadcasting probability, and defuzzification is used to extract a numeric result from the fuzzy set. Here Center of Gravity (COG) method is used to defuzzify the fuzzy set. Then, the performance of FPMCAST is evaluated through a simulation study. From the simulation, we demonstrate that the proposed FPMCAST algorithm significantly outperforms flooding and gossiping algorithms. Specially, the FPMCAST algorithm has longer network lifetime because the residual energy of each node consumes evenly.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.10
• /
• pp.797-808
• /
• 2019

In a closed workplace, the management of the workplace is important because the environmental data at the workplace has a great influence on the safety of workers. Today's industrial sites are transformed into data-based factories that collect and analyze data through sensors in those sites, requiring a management system to ensure safety. In general, a safety management system stores and manages data on a central server associated with a database. Since such management system introduces high possibility of forgery and loss of data, workers often suspect the reliability of the information on the management system. In this paper, we present a worker safety management system based on the EOS blockchain which is considered as third-generation blockchain technology. The developed system consists of a set of smart contracts on the EOS blockchain and 3 decentralized applications associated with the blockchain. According to the roles of users, the worker and manager applications respectively perform the process of initiating or terminating tasks as blockchain transactions. The entire transaction history is distributed and stored in all nodes participating in the blockchain network, so forgery and loss of data is practically impossible. The system administrator application assigns the account rights of workers and managers appropriate for performing the functions, and specifies the safety standards of IoT data for ensuring workplace safety. The IoT data received from sensor platforms in workplaces and the information on initiation, termination or approval of tasks assigned to workers, are explicitly stored and managed in the EOS smart contracts.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.1-11
• /
• 2009

XQuery query proposed by W3C is one of the standard query languages for XML data and is widely accepted by many applications. Therefore the studies for efficient Processing of XQuery query have become a topic of critical importance recently and the optimization of XQuery query is one of new issues in these studies. However, previous researches just focus on the optimization techniques for a specific XML data management system and these optimization techniques can not be used under the any XML data management systems. Also, some previous researches use predefined XML data structure information such as XML schema or DTD for the optimization. In the real situation, however applications do not all refer to the structure information for XML data. Therefore, this paper analyzes only a XQuery query and optimize by using itself of the XQuery query. In this paper, we propose 3 kinds of optimization method that considers the characteristic of XQuery query. First method removes the redundant expressions described in XQuery query second method replaces the processing order of operation and clause in XQuery query and third method rewrites the XQuery query based on FOR clause. In case of third method, we consider FOR clause because generally FOR clause generates a loop in XQuery query and the loop often rises to execution frequency of redundant operation. Through a performance evaluation, we show that the processing time for rewritten queries is less than for original queries. also each method in our XQuery query optimizer can be used separately because the each method is independent.

• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.955-972
• /
• 2003

As the next significant software abstraction, software agents have generated lots of excitements in recent years because of its promise as a new paradigm for conceptualizing, designing, and implementing software systems. This promise is particularly attractive for creating software that operates in environments that are distributed, open, and complex, such as the Internet. The effort of developing agent systems have, however, suffered from lack of generalized agent architecture because of various properties of an agent and nonexistence of a standard agent architecture. An agent architecture is an important criterion in order to not only identify agents in their domain but also determine the software architecture of the system. The major contribution of the work described here is an object-oriented design of an agent architecture that addresses fundamental properties, which are autonomy and interaction. Object-oriented design method is used for identifying the internal modules of an agent architecture and organizing correlation between the modules are identified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.899-912
• /
• 2000

PVM provides users with a single image of high performance parallel computing machine by collecting machines distributed over a network. Low communication overhead is essential to effectively run applications on PVM based platforms. In the original PVM, three times of memory copies are required for a PVM task to send a message to a remote task, which results in performance degradation. We propose a zero-copy model using global shared memory that can be accessed by PVM tasks, PVM daemon, and network interface card(NIC). In the scheme, a task packs data into global shared memory, and notify daemon that the data is ready to be sent, then daemon routes the data to a remote task to which it is sent with no virtual data copy overhead. Experimental result reveals that the message round trip time between two machines is reduced significantly in the proposed zero-copy scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12A
• /
• pp.971-981
• /
• 2009

The coordination of distributed entities and events requires time synchronization. Precision time synchronization enables a variety of extensions of applications and provides much accurate information. The IEEE 1588 precision time protocol (PTP) provides a standard method to synchronize devices in a network. This paper deals with the design and implementation of a PTP gateway to extend IEEE 1588 to Zigbee networks. The PTP gateway can not only extend IEEE 1588 to Zigbee networks but also share the same time reference using IEEE 1588 between two or more Zigbee networks. This paper also presents experiments and performance evaluation of time synchronization using the PTP gateway. Our result established a method for nodes in a network to maintain their clocks to within a 300 nanosecond offset from the reference clock of a master node via Ethernet.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.545-554
• /
• 2004

WebDAV is a protocol to support collaboration among the workers in geographically distant locations through the Internet. WebDAV extends the web communication protocol HTTP/1.1 to provide a standard infrastructure for supporting asynchronous collaboration for various contents across the Internet. To provide the WebDAV functionality in legacy applications such as web-based collaborative systems or document management systems, those systems need to be implemented additionally to handle the WebDAV methods and headers information. In this paper, we developed an Apache-based WebDAV server, named DAVinci(WebDAV Is New Collaborative web-authoring Innovation)which supports the WebDAV specification. DAVinci was implemented as a form of service provider on a mod_dav Apache module. Mod_day, which is an Apache module, is an open source module to provide WebDAV capabilities in an Apache web server. We used a file system for storing resources and the PostgreSQL database for their properties. In addition, the system provides a consistency manager to guarantee that both resources and properties are maintained without inconsistency between resources and their properties.