• Journal of the Korea Society of Computer and Information
• /
• v.18 no.1
• /
• pp.137-147
• /
• 2013

The RFID(Radio Frequency Identification) and the WSN(Wireless Sensor Network) have technical similarities and mutual effects, they have been recognized to be studied separately, and sufficient studies have not been conducted on the technical integration of the RFID and the WSN. Therefore, EPC global which realized the issue proposed the EPC(Electronic Produce Code) Sensor Network to efficiently integrate and interoperate the RFID and WSN technologies based on the international standard EPC global network. The proposed EPC Sensor Network technology uses the Complex Event Processing method in the middleware to integrate data occurring through the RFID and the WSN in a single environment and to interoperate the events based on the EPC global network. However, as the EPC Sensor Network technology continuously performs its operation even in the case that the minimum conditions are not to be met to find complex events in the middleware, its operation cost rises. Therefore, to address the problems of the existing system, we defined the minimum conditions of the complex events to detect unnecessary complex events in the middleware, and proposed an algorithm that can extract complex events only when the minimum conditions are to be met. To examine the minimum conditions, a index and a query index are used to extract complex events. To evaluate the performance of the proposed methods, In the case of the method of extracting complex events based on a bitmap index, we used the existing extraction method and NS2 simulation to evaluate its performance and thus to show its good performance in terms of the number of operation and the processing time for the complex events.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.8
• /
• pp.96-105
• /
• 1998

The aim of this paper is to propose the method of WDHMM(Weighted DHMM), using the MLP-VQ for the improvement of speaker-independent connect-digit recognition system. MLP neural-network output distribution shows a probability distribution that presents the degree of similarity between each pattern by the non-linear mapping among the input patterns and learning patterns. MLP-VQ is proposed in this paper. It generates codewords by using the output node index which can reach the highest level within MLP neural-network output distribution. Different from the old VQ, the true characteristics of this new MLP-VQ lie in that the degree of similarity between present input patterns and each learned class pattern could be reflected for the recognition model. WDHMM is also proposed. It can use the MLP neural-network output distribution as the way of weighing the symbol generation probability of DHMMs. This newly-suggested method could shorten the time of HMM parameter estimation and recognition. The reason is that it is not necessary to regard symbol generation probability as multi-dimensional normal distribution, as opposed to the old SCHMM. This could also improve the recognition ability by 14.7% higher than DHMM, owing to the increase of small caculation amount. Because it can reflect phone class relations to the recognition model. The result of my research shows that speaker-independent connected-digit recognition, using MLP-VQ and WDHMM, is 84.22%.

• Journal of the Korean earth science society
• /
• v.28 no.3
• /
• pp.343-356
• /
• 2007

This paper explored the characteristics of the interannual sea surface temperature (SST) variability in the equatorial Pacific by analyzing the simulated data from a newly coupled general circulation model (CGCM). The CGCM simulates well the realistic ENSO variability as well as the mean climatologies including SST, seasonal cycle, precipitation, and subsurface structures. It is argued that the zonal gradient of SST in the equatorial Pacific is responsible for the over-energetic SST variability near the equatorial western boundary in the model. This variability could also be related to the strong westward propagation of SST anomalies which resulted from the enhanced the zonal advection feedback. The simple two-strip model supports this by sensitivity tests. Analysis of the relationship between zonal mean thermocline depth and NINO3 SST index suggested that the ENSO variability is controlled by the recharge-discharge oscillator of the model. The lead-lag regression result reveals that heat buildup process in the western equatorial Pacific associated with the increase of the barrier layer thickness (BLT) is a precedent condition for El $Ni\widetilde{n}o$ to develop.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.5
• /
• pp.51-59
• /
• 2017

In this paper, we propose a gray code order of antenna index permutations for differential spatial modulation (DSM). To facilitate the implementation, the well-known Trotter-Johnson ranking and unranking algorithms are adopted, which result in similar computational complexity to the existing DSM that uses the lexicographic order. The signal-to-noise ratio gain achieved by the proposed gray code order over the lexicographic order is also analyzed and verified via simulations. Based on the gray coding framework, we further propose a diversity-enhancing scheme named intersected gray (I-gray) code order, where the permutations of active antenna indices are selected directly from the odd (or even) positions of the full permutations in the gray code order. From analysis and simulations, it is shown that the I-gray code order can harvest an additional transmit diversity order with respect to the gray code order.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.5
• /
• pp.501-509
• /
• 2002

SGML(ISO 8879) has been proliferated to support various document styles and to transfer documents into different platforms. SGML documents have logical structure information in addition to contents. As SGML documents are widely used, there is an increasing need for database storage and retrieval system using the logical structure of documents. However. traditional search engines using document indexes cannot exploit the logical structure. In this Paper, we have developed an SGML document storage system, which is DTD-independent and store the document type and the document instance separately by using Grove which is the document model for DSSSL and HyTime. We have used the Object Store, an object-oriented DBMS, to store the structure information appropriately without any loss of structural information. Also, we have supported a index structure for search efficiency like the relational DBMS, and constructed an effective user interface which combines content-based search with structure-based search.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.381-396
• /
• 2003

Subsequence matching is an operation that finds subsequences whose changing patterns are similar to a given query sequence from time-series databases. This paper points out the performance bottleneck in subsequence matching, and then proposes an effective method that improves the performance of entire subsequence matching significantly by resolving the performance bottleneck. First, we analyze the disk access and CPU processing times required during the index searching and post processing steps through preliminary experiments. Based on their results, we show that the post processing step is the main performance bottleneck in subsequence matching, and them claim that its optimization is a crucial issue overlooked in previous approaches. In order to resolve the performance bottleneck, we propose a simple but quite effective method that processes the post processing step in the optimal way. By rearranging the order of candidate subsequences to be compared with a query sequence, our method completely eliminates the redundancy of disk accesses and CPU processing occurred in the post processing step. We formally prove that our method is optimal and also does not incur any false dismissal. We show the effectiveness of our method by extensive experiments. The results show that our method achieves significant speed-up in the post processing step 3.91 to 9.42 times when using a data set of real-world stock sequences and 4.97 to 5.61 times when using data sets of a large volume of synthetic sequences. Also, the results show that our method reduces the weight of the post processing step in entire subsequence matching from about 90% to less than 70%. This implies that our method successfully resolves th performance bottleneck in subsequence matching. As a result, our method provides excellent performance in entire subsequence matching. The experimental results reveal that it is 3.05 to 5.60 times faster when using a data set of real-world stock sequences and 3.68 to 4.21 times faster when using data sets of a large volume of synthetic sequences compared with the previous one.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1418-1432
• /
• 1997

Most general content_based image retrieval techniques use color and texture as retrieval indices. In color techniques, color histogram and color pair based color retrieval techniques suffer from a lack of spatial information and text. And This paper describes the design and implementation of content_based image retrieval system using color space and keywords. The preprocessor for image retrieval has used the coordinate system of the existing HSI(Hue, Saturation, Intensity) and preformed to split One image into chromatic region and achromatic region respectively, It is necessary to normalize the size of image for 200*N or N*200 and to convert true colors into 256 color. Two color histograms for background and object are used in order to decide on color selection in the color space. Spatial information is obtained using a maximum entropy discretization. It is possible to choose the class, color, shape, location and size of image by using keyword. An input color is limited by 15 kinds keyword of chromatic and achromatic colors of the Korea Industrial Standards. Image retrieval method is used as the key of retrieval properties in the similarity. The weight values of color space ${\alpha}(%)and\;keyword\;{\beta}(%)$ can be chosen by the user in inputting the query words, controlling the values according to the properties of image_contents. The result of retrieval in the test using extracted feature such as color space and keyword to the query image are lower that those of weight value. In the case of weight value, the average of te measuring parameters shows approximate Precision(0.858), Recall(0.936), RT(1), MT(0). The above results have proved higher retrieval effects than the content_based image retrieval by using color space of keywords.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.97-107
• /
• 2002

In this paper, we propose the realization of on-line handwritten Chinese character recognition for mobile personal digital assistants (PDA). We focus on the development of an algorithm having a high recognition performance under the restriction that PDA requires small memory storage and less computational complexity in comparison with PC. Therefore, we use index matching method having computational advantage for fast recognition and we suggest a unit reconstruction method to minimize the memory size to store the character models and to accomodate the various changes in stroke order and stroke number of each person in handwriting Chinese characters. We set up standard model consisting of 1800 characters using a set of pre-defined units. Input data are measured by similarity among candidate characters selected on the basis of stroke numbers and region features after preprocessing and feature extracting. We consider 1800 Chinese characters adopted in the middle and high school in Korea. We take character sets of five person, written in printed style, irrespective of stroke ordering and stroke numbers. As experimental results, we obtained an average recognition time of 0.16 second per character and the successful recognition rate of 94.3% with MIPS R4000 CPU in PDA.

• Journal of radiological science and technology
• /
• v.36 no.2
• /
• pp.165-173
• /
• 2013

This study was the estimation of the dose distribution for proton, prompt gamma rays and proton induced neutron particles, in case of exposing the proton beam to polymer gel dosimeter and water phantom. The polymer gel dosimeter was compositeness material of Gelatin, Methacrylic acid, Hydroquinone, Tetrakis and Distilled water. The density of gel dosimeter was $1.04g/cm^3$ which was similar to water. The 72, 116 and 140 MeV proton beams were used in the simulation. Proton beam interacted with the nuclei of the phantom and the nuclei in excited states emitted prompt gamma rays and proton induced neutron particles during the process of de-excitation. The proton particles, prompt gamma rays, proton induced neutron particles were detected by polymer gel dosimeter and water phantom, respectively. The gap of the axis for gel was 2 mm. The Bragg-peak for proton particles in gel dosimeter was similar to water phantom. The dose distribution for proton and prompt gamma rays in gel dosimeter and water phantom was approximately identical in case of 72, 116 and 140 MeV for proton beam. However, in case of proton induced neutron particles for 72, 116 and 140 MeV proton beam, particles were not detected in gel dosimeter, while the Water phantom absorbed neutron particles. Considering the resulting data, gel dosimeter which was developed in the normoxic state attentively detected the dose distribution for proton beam exposure except proton induced neutron particles.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.283-303
• /
• 2007

Recently, the study of efficient way to store and retrieve enormous music data is becoming the one of important issues in the multimedia database. Most general method of MIR (Music Information Retrieval) includes a text-based approach using text information to search a desired music. However, if users did not remember the keyword about the music, it can not give them correct answers. Moreover, since these types of systems are implemented only for exact matching between the query and music data, it can not mine any information on similar music data. Thus, these systems are inappropriate to achieve similarity matching of music data. In order to solve the problem, we propose an Efficient Query-By-Humming System (EQBHS) with a content-based indexing method that efficiently retrieve and store music when a user inquires with his incorrect humming. For the purpose of accelerating query processing in EQBHS, we design indices for significant melodies, which are 1) frequent melodies occurring many times in a single music, on the assumption that users are to hum what they can easily remember and 2) melodies partitioned by rests. In addition, we propose an error tolerated mapping method from a note to a character to make searching efficient, and the frequent melody extraction algorithm. We verified the assumption for frequent melodies by making up questions and compared the performance of the proposed EQBHS with N-gram by executing various experiments with a number of music data.