• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.6
• /
• pp.2256-2262
• /
• 2010

The requirements for automated handing of business process and its monitoring usually have a proprietary form for each enterprise. Unlike the conventional database transaction, business process takes long time for its completion and incorporates very complex handling logics along with business situations. Since those handling logics are frequently changing in accordance with the business policies or environment, enterprises want to integrally capture the whole business semantics while monitoring those process instances. In this paper, we adopted GMA(Grid Monitoring Architecture) for the integrated monitoring of business processes. The GMA(Grid Monitoring Architecture) is a very scalable architecture to effectively monitor and manage monitoring information under the heterogeneous environment. By introducing complex event handling features into GMA to support various processing logics, we could implement a system that enables automated execution and high-level monitoring of business processes.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.610-617
• /
• 2003

Similarity matching in video database is of growing importance in many new applications such as video clustering and digital video libraries. In order to provide efficient access to relevant data in large databases, there have been many research efforts in video indexing with diverse spatial and temporal features. however, most of the previous works relied on sequential matching methods or memory-based inverted file techniques, thus making them unsuitable for a large volume of video databases. In order to resolve this problem, this paper proposes an effective and scalable indexing technique using a trie, originally proposed for string matching, as an index structure. For building an index, we convert each frame into a symbol sequence using a window order heuristic and build a disk-resident trie from a set of symbol sequences. For query processing, we perform a depth-first search on the trie and execute a temporal segmentation. To verify the superiority of our approach, we perform several experiments with real and synthetic data sets. The results reveal that our approach consistently outperforms the sequential scan method, and the performance gain is maintained even with a large volume of video databases.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.30-38
• /
• 2004

In many scientific and commercial applications such as Earth Observation System (EOSDIS) and mobile Phone services tracking a large number of clients, it is a daunting task to archive and index ever increasing volume of complex data that are continuously added to databases. To efficiently manage multidimensional data in scientific and data warehousing environments, R-tree based index structures have been widely used. In this paper, we propose a scalable technique called seeded clustering that allows us to maintain R-tree indexes by bulk insertion while keeping pace with high data arrival rates. Our approach uses a seed tree, which is copied from the top k levels of a target R-tree, to classify input data objects into clusters. We then build an R-tree for each of the clusters and insert the input R-trees into the target R-tree in bulk one at a time. We present detailed algorithms for the seeded clustering and bulk insertion as well as the results from our extensive experimental study. The experimental results show that the bulk insertion by seeded clustering outperforms the previously known methods in terms of insertion cost and the quality of target R-trees measured by their query performance.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.146-151
• /
• 2009

A reward of the work which used physical computing in fields artistic modern installation is becoming large. But the example that used a robot cannot try to easily look it up on a tool of the drawing which isn't robot use for interaction. I will mention it about a user and a drawing system design and the developmental process which I can communicate with at these papers. I used a Mindstorm NXT system to have been said in Lego companies in the robot which composed working environment, and I classified it to virtual environments that I forecasted environmental actual drawing this, and I did simulate. I used an Icommand library to control a NXT system, and drawing used a processing library in actual environments for the purpose of in order to to express to virtual environment. I got image information, and I expressed to a vector method SVG file to bases for line drawing. This system can have already made it according to demand of a user as real-time communication is possible by bluetooth working together. These figures can work to one performance not being stopping to the results of already in processes doing drawing.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1095-1104
• /
• 2004

An electronic services which are based on Internet/Intranet business transactions are available to e-market places and get the broader business concepts. Component-based e-commerce technology is a recent trend towards resolving the e-commerce chanange at both system and ap-plication levels. The basic capabilities of component based systems should include the plug and play features at various granularities, interoper-ability across networks and mobility in various networking environments. E-business application developers are attempting to more towards web-service as a mechanism for developing component-based web-applications. Traditional process and development models are inadequately architectured to meet the rapidly evolving needs for the future of scalable web services. In this thesis, we focus specifically on the issues of e-business system architecture based on web service for establishing e-business system. We specifies and identifies design pattern for applying e-business domain in the context of multiple entities. We investigate prototype and frameworks to develope components for e-business application based suggested process. We present a worked example to demonstrate the behavior of Customer Authentication System(CAS) development with component and recommend process. Final]Y, we indicate and view on future directions in component-based development in the context of electronic business.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.767-774
• /
• 2006

In order to support overlay multicast with scalability and reliability, in this paper, we introduced a new multicast tree construction method and a regional multicast. The architecture we introduce efficiently transmits streaming data to the users from multicast source in an environment in which non-multicast network and multicast network. The new multicast tree construction method enables the connection with a remote relay which is an optimum condition in case there is no relay in subnet. Besides, by defining a new service type to traffic class of IPv6 header, a selective adoption or FEC and a distinctive transmission became possible. In order to verify the effect of the solution we suggested, we embodied an environment which is similar to the actual service environment by a simulator and tested it. The result of the test shows that the proposed method is more efficient than the traditional unicast approach method and the existing overlay multicast.

• KIISE Transactions on Computing Practices
• /
• v.20 no.11
• /
• pp.604-609
• /
• 2014

Decoding processes in portable media players have a high computational cost, resulting in high power consumption by the CPU. If decoding computations are reduced, the power consumed by the CPU is also be reduced, but such a choice generally results in a degradation of the video quality for the users, so it is essential to address this tradeoff. We proposed a new CPU power management scheme that can make use of the scalability property available in the H.164/SVC standard. We first proposed a new video quality model that makes use of a video quality metric(VQM) in order to efficiently take into account the different quantization factors in the SVC. We then propose a new dynamic voltage scaling(DVS) scheme that can selectively combine the previous decoding times and frame sizes in order to accurately predict the next decoding time. We then implemented a scheme on a commercial smartphone and performed a user test in order to examine how users react to the VQM difference. Real measurements show that the proposed scheme uses up to 34% fewer energy than the Linux DVFS governor, and user tests confirm that the degradation in the quality is quite tolerable.

• Journal of KIISE
• /
• v.44 no.12
• /
• pp.1245-1251
• /
• 2017

In this study we present a novel directory architecture that can dynamically allocate a directory entry for a cache block on demand at runtime only when the block is shared by more than one core. Thus, we do not maintain coherence for private blocks, substantially reducing the number of directory entries. Even for shared blocks, we allocate directory entry dynamically only when the block is actively shared, further reducing the number of directory entries at runtime. For this, we propose a new directory architecture called dynamic directory table (DDT), which is implemented as a cache of active directory entries. Through our detailed simulation on PARSEC benchmarks, we show that DDT can outperform the expensive full-map directory by a slight margin with only 17.84% of directory area across a variety of different workloads. This is achieved by its faster access and high hit rates in the small directory. In addition, we demonstrate that even smaller DDTs can give comparable or higher performance compared to recent directory optimization schemes such as SPACE and DGD with considerably less area.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.605-614
• /
• 2009

Despite its graceful bandwidth saving nature, IP multicast has not been successful in widely spreading and using. Challenging includes policy and technological issues such as inter-domain routing, multicast availability and reachability. Properly detecting and isolating the faults would be the first step to stabilize IP multicast. In this paper, we introduce a scalable multicast monitoring framework. To efficiently cope with multicast network and networking problems, it enlarges its monitoring scopes from collecting delivery statistics to verifying end-to-end multicast availability, reachability and interactivity. We carry out various networking experiments to verify the scalability and feasibility of the proposed framework.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.8
• /
• pp.293-298
• /
• 2014

Detecting and understanding the changes between RDF data is crucial in the evolutionary process, synchronization system, and versioning system on the web of data. However, current researches on detecting changes still remain unsatisfactory in that they did neither consider the large scale of RDF data nor accurately produce the RDF deltas. In this paper, we propose a scalable and effective change detection using a MapReduce framework which has been used in many fields to process and analyze large volumes of data. In particular, we focus on the structure-based change detection that adopts a strategy for the comparison of blank nodes in RDF data. To achieve this, we employ a method which is composed of two MapReduce jobs. First job partitions the triples with blank nodes by grouping each triple with the same blank node ID and then computes the incoming path to the blank node. Second job partitions the triples with the same path and matchs blank nodes with the Hungarian method. In experiments, we show that our approach is more accurate and effective than the previous approach.