• Korean Journal of Construction Engineering and Management
• /
• v.17 no.3
• /
• pp.143-155
• /
• 2016

Recently, the interest on applying AVM(Around View Monitoring) systems in construction equipments have been increasing due to the demand for better control, work efficiency and safety. Most of the existing AVM systems have been developed focusing on the application in automobiles and only several AVM systems have been developed for construction equipments. However, the original technology of AVM remained the same as in the automobiles that failed to consider the main properties of construction equipments and suggest appropriate range of AVM display (Top-view). Therefore, the purpose of this study is to suggest a pilot type of AVM system for construction equipment. Accordingly, literature review, deduction of main consideration factors, selection of sensors, system design, algorithm development of a pilot type of AVM system for construction equipment have been conducted. A laboratory experiment has also been conducted for the deduction of further improvements. As a result, a minimum image refresh rate of 20 fps has been achieved that clearly reflects the actual situation of the equipment and also, the actual motions of Boom, Arm, Bucket have been displayed appropriately on the AVM system based on the angle data collected by sensors. However, the experiment results have also shown that the following tasks still remain for future work: 1)Improvement of AVM image interpolation, 2)Development of calibration module for variety construction equipment.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.4
• /
• pp.171-180
• /
• 2004

CDP(handoff Call Dropping Probability) and CBP(new Call Blocking Probability) have been used as two important call level QoS parameters in cellular mobile communications. But, many methods to reduce CDP without considering CBP have been studied, and hand-off call priority scheme has been introduced. But the use of hand-off call priority scheme increases CBP and decreases channel utilization rate depending on the number of reserved channel for priority. In this paper, we propose a CAC(Call Admission Control) algorithm with overflow and preemption to solve the problem caused by considering CDP and CBP in calculation of the number of channel reserved. The problem is the increase of CDP as the traffic load increases. In our CAC algorithm, hand-off call is permitted to use(overflow) unreserved and unused channel if there is no reserved and unused channel, and new call is permitted to use(preemption) the channel overflowed by hand-off call if there is no unreserved and unused channel. This mechanism of calculation of the number of reserved channel and CAC algorithm is expected to increase channel utilization rate, and can be applied to media-based QoS provision in cellular mobile communications.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.2
• /
• pp.301-314
• /
• 2016

Juels and Sudan's fuzzy vault scheme has been applied to various researches due to its error-tolerance property. However, the fuzzy vault scheme does not consider the difference between people's preferences, even though the authors instantiated movie lover' case in their paper. On the other hand, to make secure and high performance face authentication system, Nyang and Lee introduced a face authentication system, so-called fuzzy face vault, that has a specially designed association structure between face features and ordinary fuzzy vault in order to let each face feature have different weight. However, because of optimizing intra/inter class difference of underlying feature extraction methods, we can easily expect that the face authentication system does not successfully decrease the face authentication failure. In this paper, for ensuring the flexible use of the fuzzy vault scheme, we introduce the bucket structure, which differently implements the weighting idea of Nyang and Lee's face authentication system, and three distribution functions, which formalize the relation between user's weight of preferences and system implementation. In addition, we suggest a matchmaker scheme based on them and confirm its computational performance through the movie database.

• Korean journal of applied entomology
• /
• v.49 no.2
• /
• pp.105-113
• /
• 2010

Moths were collected using a 22W UV black light trap in June through September in 2005 and May, June, August and September in 2006. The study sites were Namsan (Mt. Nam), Jirisan (Mt. Jiri), Woraksan (Mt. Worak) which are part of the Korean National Long Term Ecological Research (KNLTER). There were two common forest communities, Quercus mongolica and Pinus densiflora. The purpose of this study was to compare species diversity of the major plant feeding Lepidoptera in the two forest types at the regional KNLTER sites. We collected a total of 435 species from the KLTER sites in 2005 and 2006. Abundance of moths was highest at Woraksan (Mt. Worak) followed by Jirisan (Mt. Jiri). The Namsan (Mt. Nam) site had the lowest, with five families (Arctiidae, Geometridae, Noctuidae, Notodontidae, and Pyralidae). Analysis of variance (ANOVA) showed statistically significant differences at sampling date in species abundance as a response variable and at site in species richness as another response variable. Although we expected a distinct cluster with the forest type at each study site, one of ordination analyses, nonmetric multidimensional scaling (NMS), showed distinct clusters with the moth assemblages at each site only but NMS did not show any distinct cluster with the different forest types at each site as we expected.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.3
• /
• pp.566-576
• /
• 2017

Key-value stores proved its superiority by being applied to various NoSQL databases such as Redis, Memcached. Lookup performance is important because key-value store applications performs more lookup than insert operations in most environments. However, in traditional applications, lookup may be slow because hash tables are constructed out of linked-list. Therefore, cuckoo hashing has been getting attention from the academia for constant lookup time, and bucketized cuckoo hashing (BCH) has been proposed since it can achieve high load factor. In this paper, we introduce Sorting Cuckoo which inserts data using insertion sort in BCH structure. Sorting Cuckoo determines the existence of a key with a relatively small memory access because data are sorted in each buckets. In particular, the higher memory load factor, the better lookup performance than BCH's. Experimental results show that Sorting Cuckoo has smaller memory access than BCH's as many as about 19 million (25%) in 10 million negative lookup operations (key is not in the table), about 4 million times (10%) in 10 million positive lookup operations (where it is) with load factor 95%.

• 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.

• Nuclear Medicine and Molecular Imaging
• /
• v.43 no.5
• /
• pp.487-494
• /
• 2009

Purpose: Small size of recombinant scFv antibody has many advantages such as rapid blood clearances and improved targeting antibodies to tumor region. On the other hand owing to small size, number of amino group is insufficient in conjugation with chelator and fluorescence labeling. This study is to introduce poly lysine tag to the C-terminal end of scFv lym-1 sequence for fluorescence chelator conjugation. Materials and Methods: Poly lysine scFv lym-1 gene, cloned into pET-22b (+) vector, was expressed in E. coli BL21 (DE3) strain. Antibody purification was performed with Ni-NTA column and then size exclusion column chromatography. Expression and purification levels of poly lysine tagged scFv lym-1 antibody were confirmed by western blot analysis. I-124, I-125, I-131 and Tc-99m were used for radiolabeling of purified poly lysine scFv lym-1. Flow cytometry analysis of FIT( conjugated poly lysine scFv lym-1 was performed for confirmation of immunoreactivity of human Burkitt's lymphoma cells. Results: Poly lysine scFv lym-1 antibody was purified through two steps and identified as molecular weight of 48 KDa. Radiolabeling yields of I-124, I-125, I-131 and Tc-99m into poly lysine scFv lym-1 were >99%, >99%, >95% and >99%, respectively. Flow cytometry analysis of poly lysine scFv and scFv lym-1 was showed similar immunoreactivity to human Burkitt's lymphoma cells. Conclusion: Poly lysine tag was useful for the sufficient number of amino groups to scFv lym-1 antibody for chelator conjugation with minimizing loss of immunoreactivity.