• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.484-493
• /
• 2001

As real-time database systems are extended to the distributed computing environment, the need to apply the existing real-time concurrency control schemes to the distributed computing environment has been made. In this paper we propose an efficient concurrency control scheme for distributed real-time database system. Our proposed scheme guarantees a transaction to commit at its maximum, reduces the restart of a transaction that is on the prepared commit phase, and minimizes the time of the lock holding. This is because it raises the priority of the transaction that is on the prepared commit phase in the distributed real-time computing environment. In addition, it reduces the waiting time of a transaction that owns borrowed data and improves the performance of the system, as a result of lending the data that the transaction with the raised priority holds. We compare the proposed scheme with DO2PL_PA(Distributed Optimistic Two-Phase Locking) and MIRROR(Managing Isolation in Replicated Real-time Object Repositories) protocol in terms of the arrival rate of transactions, the size of transactions, the write probability of transactions, and the replication degree of data in a firm-deadline real-time database system based on two-phase commit protocol. It is shown through the performance evaluation that our scheme outperforms the existing schemes.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.6
• /
• pp.460-471
• /
• 2004

Since the RTP is suitable for real-time data transmission in multimedia services like VoD, AoD, and VoIP, it has been adopted as a real-time transport protocol by RTSP, H.323, and SIP. Even though the RTP protocol stack for embedded systems has been in great need for efficient support of multimedia services, such a stack has not been developed yet. In this paper, we explain embeddedRTP which supports the RTP protocol stack at the kernel level so that it is suitable for embedded systems. Since embeddedRTP is designed to reside in the UBP module, existing applications which rely ell TCP/IP services can proceed the same as before, while applications which rely on the RTP protocol stack can request HTP services through embeddedRTp API. EmbeddedRTP stores transmitted RTP packets into per session packet buffer, using the packet's port number and multimedia session information. Communications between applications and embeddedRTP is performed through system calls and signal mechanisms. Additionally, embeddedRTP API makes it possible to develop applications more conveniently. Our performance test shows that packet-processing speed of embeddedRTP is about 7.5 times faster than that oi VCL RTP for multimedia streaming services on PDA in spite that its object code size is reduced about by 58% with respect to UCL RTP's.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.97-106
• /
• 2015

Recently, research on database encryption for data protection and query result authentication methods has been performed more actively in the database outsourcing environment. Existing database encryption schemes are vulnerable to order matching and counting attack of intruders who have background knowledge of the original database domain. Existing query result integrity auditing methods suffer from the transmission overhead of verification object. To resolve these problems, we propose a group-order preserving encryption index and a query result authentication method based on the encryption index. Our group-order preserving encryption index groups the original data for data encryption and support query processing without data decryption. We generate group ids by using the Hilbert-curve so that we can protect the group information while processing a query. Finally, our periodic function based data grouping and query result authentication scheme can reduce the data size of the query result verification. Through performance evaluation, we show that our method achieves better performance than an existing bucket-based verification scheme, it is 1.6 times faster in terms of query processing time and produces verification data that is 20 times smaller.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.201-213
• /
• 2006

A time-series database is a set of time-series data sequences, each of which is a list of changing values of the object in a given period of time. Subsequence matching is an operation that searches for such data subsequences whose changing patterns are similar to a query sequence from a time-series database. This paper addresses a performance issue of time-series subsequence matching. First, we quantitatively examine the performance degradation caused by the window size effect, and then show that the performance of subsequence matching with a single index is not satisfactory in real applications. We argue that index interpolation is fairly useful to resolve this problem. The index interpolation performs subsequence matching by selecting the most appropriate one from multiple indexes built on windows of their inherent sizes. For index interpolation, we first decide the sites of windows for multiple indexes to be built. In this paper, we solve the problem of selecting optimal window sizes in the perspective of physical database design. For this, given a set of query sequences to be peformed in a target time-series database and a set of window sizes for building multiple indexes, we devise a formula that estimates the cost of all the subsequence matchings. Based on this formula, we propose an algorithm that determines the optimal window sizes for maximizing the performance of entire subsequence matchings. We formally Prove the optimality as well as the effectiveness of the algorithm. Finally, we perform a series of extensive experiments with a real-life stock data set and a large volume of a synthetic data set. The results reveal that the proposed approach improves the previous one by 1.5 to 7.8 times.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.2
• /
• pp.609-615
• /
• 2014

Due to the recent global recession, the car industry demand levels have plummeted which led to a crisis in the automotive parts industry for the first time in history. Since the fourth quarter of 2008, the automotive parts manufacturers in America have faced a record loss and those in Japan and Europe who also had a strong track record are facing a weak economy. In addition, the domestic automotive parts industry is also affected by the global economic crisis. This research is that the relative efficiency analysis utilizing the DEA has done on the object of 25 small and medium-sized automotive parts manufacturers publicly listed, As the efficiency analysis result 6 of 25 manufacturers are efficient in CCR model and 12 manufactures have shown efficiency in BCC model, the efficiency analysis in consideration of the manufacturer size. The manufacturers with efficiency 1 in 25 manufacturers are DMU 1, 5, 7, 10, 18, 24 and the relatively benchmarking objects in other manufactures are DMU 1, 10, 24, Based on the results of this research, a direction to the domestic automotive parts manufacturers as well as a significant information will be provided in managing the companies in the future by the improvement of management efficiency through the practical efficiency analysis.

• The KIPS Transactions:PartB
• /
• v.15B no.1
• /
• pp.25-36
• /
• 2008

In this paper, we present a robust hand recognition approach to sudden illumination changes. The proposed approach constructs a background model with respect to hue and hue gradient in HSI color space and extracts a foreground hand region from an input image using the background subtraction method. Eighteen features are defined for a hand pose and multi-class SVM(Support Vector Machine) approach is applied to learn and classify hand poses based on eighteen features. The proposed approach robustly extracts the contour of a hand with variations in illumination by applying the hue gradient into the background subtraction. A hand pose is defined by two Eigen values which are normalized by the size of OBB(Object-Oriented Bounding Box), and sixteen feature values which represent the number of hand contour points included in each subrange of OBB. We compared the RGB-based background subtraction, hue-based background subtraction and the proposed approach with sudden illumination changes and proved the robustness of the proposed approach. In the experiment, we built a hand pose training model from 2,700 sample hand images of six subjects which represent nine numerical numbers from one to nine. Our implementation result shows 92.6% of successful recognition rate for 1,620 hand images with various lighting condition using the training model.

• Journal of Korean Ophthalmic Optics Society
• /
• v.14 no.3
• /
• pp.83-88
• /
• 2009

Purpose: It is said that persons with low vision (LV) require larger object and longer exposure time to make a visual judgment. The spatial summation stands for the increasing of contrast sensitivity (CS), as the target size is enlarged. Likewise, the term temporal summation is used when the CS increases as the exposure duration is extended. The present study investigates whether or not greater target and longer exposure duration is required for LV subjects than for control subjects. Methods: Twenty subjects with LV and twenty age-matched controls took part in the study. The CS was measured with a 2 alternative forced choice stair case for 0.7 and 3.0 cycle per degree (c/d) static sinusoidal gratings within a circular aperture. The results were analyzed by mixed ANOVA (2${\times}$2). Results: As expected, the CS in the LV group were overall depressed. For spatial summation, mixed ANOVA (2 groups${\times}$2 spatial frequencies) gave p values of 0.13 for the effect of group, 0.14 for spatial frequency and there was no interaction (p=0.59). Similarly, for temporal summation the results were p=0.19 for group, 0.31 for spatial frequency and p=0.95 for interaction. Conclusions: Despite the depression of CS in the LV group, a significant difference for spatial and temporal summation between two subject groups was not reached.

• Journal of Distribution Science
• /
• v.12 no.8
• /
• pp.55-69
• /
• 2014

Purpose - Despite the importance of price, many companies do not implement pricing policies smoothly, because typical price management strategies insufficiently consider logistics efficiency and an increase in logistics costs due to logistics waste. This study attempts to examine the effect of product line pricing, which corresponds to product mix pricing, on logistics efficiency in the case of manufacturer A, and analyzes how logistics performance changes in response to these variables. Research design, data, and methodology - This study, based on the case of manufacturer A, involved research through understanding the current status, analyses, and then proposing improvement measures. Among all the products of manufacturer A, product group B was selected as the research object, and its distribution channel and line pricing were examined. As a result of simulation, for products with low loading efficiency, improvement measures such as changing the number of bags in the box were suggested, and a quantitative analysis was conducted on how these measures influence logistics costs. The TOPS program was used for the Pallet loading efficiency simulation tool in this study. To prevent products from protruding out of the pallet, the maximum measurement was set as 0.0mm, and loading efficiency was based on the pallet area, and not volume. In other words, its size (length x width) was focused upon, following the purpose of this study and, then, the results were obtained. Results - As a result of the loading efficiency simulation, when the number of bags in the box was changed for 36 products with low average loading efficiency of 73.7%, as shown in