• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.2 no.1 s.2
• /
• pp.41-52
• /
• 2003

The purpose of this study was to test the effects of the pedestrian green signal adjustment on clearance of the turning vehicles impeding the through traffic flow at the signalized intersections, and thereby, suggest some operational criteria for adjustment of the pedestrian green signal. In order to test such effects, the pedestrian green time was adjusted so that it could started a few seconds later than the vehicle green time during peak hours, and thereby, the turning vehicle volume not cleared at the intersection was measured by extending the time gap by 2 seconds. (In general, the pedestrian green signal turns on at the same time as the vehicle green signal.) The results of this test can be summed up as follows; first, the longer the time gap was, the turning vehicle volume not cleared from the intersection decreased more. Second, in case there existed a storage space between intersection and crosswalk the effect of the turning vehicles on the through traffic flows was minimal. Third, at the pelican, the effect of the turning vehicles on the through traffic flow was minimal due to the structure of the intersection and the phase sequence. In conclusion, it was found that the adjustment of pedestrian green signal had the effect of enhancing the intersection operation. When adjusting the pedestrian green signal, it was deemed necessary to thoroughly survey the geometric structure of the intersection and collect the data on the turning traffic volume and thereby, apply the results of analysis flexibly to each intersection.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.55-66
• /
• 2006

We propose a progressive image retrieval method based on an efficient combination of multiresolution color and torture features in wavelet transform domain. As a color feature, color autocorrelogram of the hue and saturation components is chosen. As texture features, BDIP and BVLC moments of the value component are chosen. For the selected features, we obtain multiresolution feature vectors which are extracted from all decomposition levels in wavelet domain. The multiresolution feature vectors of the color and texture features are efficiently combined by the normalization depending on their dimensions and standard deviation vector, respectively, vector components of the features are efficiently quantized in consideration of their storage space, and computational complexity in similarity computation is reduced by using progressive retrieval strategy. Experimental results show that the proposed method yields average $15\%$ better performance in precision vs. recall and average 0.2 in ANMRR than the methods using color histogram color autocorrelogram SCD, CSD, wavelet moments, EHD, BDIP and BVLC moments, and combination of color histogram and wavelet moments, respectively. Specially, the proposed method shows an excellent performance over the other methods in image DBs contained images of various resolutions.

• Spatial Information Research
• /
• v.23 no.4
• /
• pp.57-66
• /
• 2015

At these day, owing to functional limitations and cost issues, used image map in web service have a problem which can not make exactly meet the user needs. This study aims to create an individual map for user suitable purposes using HTML5 technology that implement the vector map creation and its functions with services. The results of this study, the invisible problems of the tilting and rotation functions in image-based map utilizing the existing web environment were solved in HTML5 vector map. And to access the map information, by implementing the function of expressing the background and name data to selectively derive, various results were expressed in the map. Also, as a result of a comparison of performance the time required was measured at 0.88sec which comes in the range of the first loading time between 0.78sec and 7.56sec in a commercial map service, which showed the possibility of its commercialization. compared to 180GB of image maps for the production of a national map index system, the volume to produce a vector map was 2.5GB, a decrease by over 90%, which solved the issue of costs for a storage space. As a result, this study of HTML5 vector map design and implementation presented a plan for providing information suitable for the requirements of the users who use spatial information through utilizing a variety of information and expanding functions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.33-42
• /
• 2012

Rapid evolution of wired and wireless technologies results in various types of embedded systems, and the software to be embedded into those devices now needs the flexibility rather than the fixedness which was well-known property for the embedded software in the past. Mobile agent is one of the useful distributed technologies of reducing network load and latency because of its disconnected operations and high asynchrony. In this paper, a component-based mobile agent framework, called EmHUMAN, is designed and implemented for structural embedding into the devices showing different functions and resource constraints. It consists of 3 layers of components. Based on those components, a structural embedding, considering resource constraints of required functions, amount of storage space, computing power, network bandwidth, ${\ldots} $ etc can be performed. The components in each layer can be extended with addition of new components, removing some components and modifying components. EmHUMAN plays the role of a framework for developing mobile agent based distributed systems. It is also a mobile agent system by itself. EmHUMAN provides several utilities as built-in API's, and thus high effectiveness in programming mobile agents can be achieved.

• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.19 no.4
• /
• pp.381-389
• /
• 2009

Confined spaces are inherently dangerous workplace and many fatal and nonfatal accidents have been reported. Even though these accidents occur in various kinds of confined spaces, there has rarely been reported on the health hazard agent, i.e., the types of gases and their concentration ranges. Therefore in this study, we evaluated several toxic and asphyxiating gas concentrations in various confined spaces. We surveyed 57 manholes, 3 sewage treatment plants, 2 yellow radish manufacturing companies and 7 barges to measure the concentrations of oxygen($O_2$), hydrogen sulfide($H_2S$), carbon monoxide(CO), ammonia($NH_3$). Lower Explosion Limits(LEL) and Volatile Organic Compounds (VOCs). Those four types of confined spaces occupies 56% of accidents during last 9 years in Korea. In 57 manholes, the concentration varied according to the types of manholes; rainfall and sewage, and by location; residential and industrial areas. Sewage manhole in industrial area was evaluated as the most hazardous than other types of manhole like rainfall manholes, residential sewage manholes. The highest $H_2S$ concentration and the lowest $O_2$ concentration at sewage manhole in industrial area were 300 ppm, 8.7% respectively. In 3 sewage treatment plants, $H_2S$ and $NH_3$ concentrations were reached up to the 500 ppm and 200 ppm respectively. Two yellow radish manufacturing companies showed the concentrations of 316 ppm, 505.2 ppm, 90 ppm and 15.7% for $H_2S$, CO, VOCs and $O_2$, respectively. Seven barges showed 15.9%~20.9% oxygen concentration. Gas species and concentration ranges varied by the types and location of confined spaces; CO, $H_2S$, $O_2$ could be hazardous in manhole, especially manhole connected to sewage plants. CO, $H_2S$, LEL, $O_2$, $NH_3$ should be controlled in sludge silo and sluge pumping confined spaces in sewage treatment plant. The activity of lifting out radish from the storage tank was evaluated more hazardous rather than the other activities in yellow radish manufacturing industry. The employers must conduct the survey to identify all possible confined spaces in their local workplace prior to performing the tasks. At the national level to reduce the accidents in the confined spaces, we suggest that systemic approach and active education program including possible hazards, standard operation procedures, ventilation plan, and personal protective equipment in confined spaces should be implemented.

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.211-234
• /
• 2007

In e-business, XML is a major format of data and it is essential to efficiently process queries against XML data. XML query caching has received much attention for query performance improvement. In employing XML query caching, some efficient technique of cache replacement is required. The previous techniques considered as a replacement unit either the whole query result or the path in the query result. The former is simple to employ but it is not efficient whereas the latter is more efficient and yet the size difference among the potential victims is large, and thus, efficiency of caching would be limited. In this paper, we propose a new technique where the element in the query result is are placement unit to overcome the limitations of the previous techniques. The proposed technique could enhance the cache efficiency to a great extent because it would not pick a victim whose size is too large to store a new cached item, the variance in the size of victims would be small, and the unused space of the cache storage would be small. A technique of XML semantic cache replacement is presented which is based on the replacement function that takes into account cache hit ratio, last access time, fetch time, size of XML semantic region, size of element in XML semantic region, etc. We implemented a prototype XML semantic cache system that employs the proposed technique, and conducted a detailed set of experiments over a LAN environment. The experimental results showed that our proposed technique outperformed the previous ones.

• Journal of Broadcast Engineering
• /
• v.25 no.1
• /
• pp.25-35
• /
• 2020

Recently, the development of image processing technology, as well as hardware performance, has been continuing the research on 3D point processing technology that provides users with free viewing angle and stereoscopic effect in various fields. Point cloud technology, which is a type of representation of 3D point, has attracted attention in various fields because it can acquired/expressed point precisely. However, since Hundreds of thousands, millions of point are required to represent one 3D point cloud content, there is a disadvantage that a larger amount of storage space is required than a conventional 2D content. For this reason, the MPEG (Moving Picture Experts Group), an international standardization organization, is continuing to research how to efficiently compress, store, and transmit 3D point cloud content to users. In this paper, a V-PCC bitstream generated by a V-PCC (Video-based Point Cloud Compression) encoder proposed by the MPEG-I (Immersive) group is composed of an MPU (Media Processing Unit) defined by the MMT. In addition, by extending the signaling message defined in the MMT standard, a parameter for a segmented transmission method of the 3D point cloud content by area and quality parameters considering the characteristic of the 3D point cloud content, so that the quality parameters can be selectively determined according to the user's request. Finally, in this paper, we verify the result through design/implementation of the verification platform based on the proposed technology.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.513-524
• /
• 2006

Normalization transform is very useful for finding the overall trend of the time-series data since it enables finding sequences with similar fluctuation patterns. The previous subsequence matching method with normalization transform, however, would incur index overhead both in storage space and in update maintenance since it should build multiple indexes for supporting arbitrary length of query sequences. To solve this problem, we propose a single index approach for the normalization transformed subsequence matching that supports arbitrary length of query sequences. For the single index approach, we first provide the notion of inclusion-normalization transform by generalizing the original definition of normalization transform. The inclusion-normalization transform normalizes a window by using the mean and the standard deviation of a subsequence that includes the window. Next, we formally prove correctness of the proposed method that uses the inclusion-normalization transform for the normalization transformed subsequence matching. We then propose subsequence matching and index building algorithms to implement the proposed method. Experimental results for real stock data show that our method improves performance by up to $2.5{\sim}2.8$ times over the previous method. Our approach has an additional advantage of being generalized to support many sorts of other transforms as well as normalization transform. Therefore, we believe our work will be widely used in many sorts of transform-based subsequence matching methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.1
• /
• pp.36-49
• /
• 2005

Recently, many researchers have given high attention to the semantic web services based on the semantic web technology While existing web services use the XML-based web service description language, WSDL, semantic web services are utilizing web service description languages such as DAML-S in ontology languages. The researchers of semantic web services are generally focused on web service discovery, web service invocation, web service selection and composition, and web service execution monitoring. Especially, the semantic web service discovery as the basis to accomplish the ultimate semantic web service environment has some different properties from previous information discovery areas. Hence, it is necessary to develop the storage system and discovery mechanism appropriate to the semantic well description languages. Even though some related systems have been developed, they are not appropriate for the embedded system environment, such as intelligent robotics, in which there are some limitations on memory disk space, and computing power In this regard, we in the embedded system environment have developed the document management system which efficiently manages the web service documents described by DAML-S for the purpose of the semantic web service discovery, In addition, we address the distinguishing characteristics of the system developed in this paper, compared with the related researches.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.119-132
• /
• 2007

In molecular biology, approximate subsequence search is one of the most important operations. In this paper, we propose an accurate and efficient method for approximate subsequence search in large DNA databases. The proposed method basically adopts a binary trie as its primary structure and stores all the window subsequences extracted from a DNA sequence. For approximate subsequence search, it traverses the binary trie in a breadth-first fashion and retrieves all the matched subsequences from the traversed path within the trie by a dynamic programming technique. However, the proposed method stores only window subsequences of the pre-determined length, and thus suffers from large post-processing time in case of long query sequences. To overcome this problem, we divide a query sequence into shorter pieces, perform searching for those subsequences, and then merge their results. To verify the superiority of the proposed method, we conducted performance evaluation via a series of experiments. The results reveal that the proposed method, which requires smaller storage space, achieves 4 to 17 times improvement in performance over the suffix tree based method. Even when the length of a query sequence is large, our method is more than an order of magnitude faster than the suffix tree based method and the Smith-Waterman algorithm.