• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.451-459
• /
• 2007

RFID it reads information which is it writes, the semiconductor chip for and the radio frequency system which uses the hazard antenna it has built-in transmission of information it talks. Formation which is transmitted like this collection and America which it filtrates wey the RFID search service back to inform the location of the server which has commodity information which relates with an object past record server. The hazard where measurement analysis result the leader for electronic interference does not occur consequently together from with verification test the power level which is received from the antenna grade where it stands must maintain minimum -55dBm and the electronic interference will not occur with the fact that, antenna and reel his recognition distance the maximum 7m until the recognition which is possible but smooth hazard it must stand and and with the fact that it will do from within and and and 3-4m it must be used Jig it is thought.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.642-649
• /
• 2018

The Modbus protocol is the most widely used protocol for connecting multiple slave control units (SCUs) in the master control unit. However, the Modbus protocol does not identify which SCU response message corresponds to the service request message. Therefore, when using the Modbus protocol, one service request message can be transmitted after processing the previous message. In this paper, we propose a Modbus application protocol with an index code and a service code to solve the problem. As a result of experimentation, it is possible to transmit the next service request message without processing the previous service request message. And when a communications error occurs, it is possible to identify what type of error occurred using an error detection algorithm. Also, with simultaneous multiple service requests, the proposed protocol can improve processing time by about 66.2%, compared to the original Modbus protocol.

• The KIPS Transactions:PartD
• /
• v.14D no.3 s.113
• /
• pp.293-302
• /
• 2007

The study of the web graph yields valuable insight into web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution, also it is useful for understanding the evolution process of web graph and predicting the scale of the Web. In this paper, we report experimental results on properties of the Korea web graph with over 116 million pages and 2.7 billion links. We indicate to study the Korea web properties such as the power law phenomenon and then to analyze the similarity and difference between the global and Korea web graph. Our analysis reveals the Korea web graph have different properties compared with the global web graph from the structure to the evolution of the Web. Finally, a number of measurements of the evolution of the Korea web graph ill be represented.

• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.359-366
• /
• 2009

Analysis of 3-dimensional (3D) protein structure plays an important role of structural bioinformatics. The protein structure alignment is the main subjects of the structural bioinformatics and the most fundamental problem. Protein Structures are flexible and undergo structural changes as part of their function, and most existing protein structure comparison methods treat them as rigid bodies, which may lead to incorrect alignment. We present a new method that carries out the flexible structure alignment by means of finding SSPs(Similar Substructure Pairs) and flexible points of the protein. In order to find SSPs, we encode the coordinates of atoms in the backbone of protein into RDA(Relative Direction Angle) using local similarity of protein structure. We connect the SSPs with Floyd-Warshall algorithm and make compatible SSPs. We compare the two compatible SSPs and find optimal flexible point in the protein. On our well defined performance experiment, 68 benchmark data set is used and our method is better than three widely used methods (DALI, CE, FATCAT) in terms of alignment accuracy.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.183-193
• /
• 2019

Process mining is an analytical technique aimed at obtaining useful information about a process by extracting a process model from events log. However, most existing process models are deterministic because they do not include stochastic elements such as the occurrence probabilities or execution times of activities. Therefore, available information is limited, resulting in the limitations on analyzing and understanding the process. Furthermore, it is also important to develop an efficient methodology to discover the process model. Although genetic process mining algorithm is one of the methods that can handle data with noises, it has a limitation of large computation time when it is applied to data with large capacity. To resolve these issues, in this paper, we define a stochastic process tree and propose a tabu search-genetic process mining (TS-GPM) algorithm for a stochastic process tree. Specifically, we define a two-dimensional array as a chromosome to represent a stochastic process tree, fitness function, a procedure for generating stochastic process tree and a model trace as a string of activities generated from the process tree. Furthermore, by storing and comparing model traces with low fitness values in the tabu list, we can prevent duplicated searches for process trees with low fitness value being performed. In order to verify the performance of the proposed algorithm, we performed a numerical experiment by using two kinds of event log data used in the previous research. The results showed that the suggested TS-GPM algorithm outperformed the GPM algorithm in terms of fitness and computation time.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.353-360
• /
• 2004

The study on scene change detection in the compressed MPEG videos has been done by various approaches. However, most of these approacher accomplished scene change detection by carrying out decoding processes and then by comparing pixels with pixels. This approach it not suitable for real time applications owing to much computing time of decoding processes. Recently, the study on scene change detection algorithms using only information of compressed domain is becoming Increasingly important. In this paper, we propose a sequential access method as an efficient scene change detection algorithm in the compressed domain. According to the type of pictures in the compressed MPEG video streams (divided in I-blocks and each I-block into P-blocks), the proposed algorithm provides effective scene change detection by applying sequential access and block by block mechanism. The proposed sequential access method provides fast and accurate detection operation by reducing checking procedures of unnecessary pictures due to molt of operations in compressed domain and checking by block units. Also, this approach uses optimal algorithm to provide fast and accurate detection operation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.23-30
• /
• 2007

RFID it reads information which is it writes, the semiconductor chip for and the radio frequency system which uses the hazard antenna it has built-in transmission of information it talks. Formation which is transmitted like this collection and America which it filtrates wey the RFID search service back to inform the location of the server which has commodity information which relates with an object past record server. The hazard where measurement analysis result the leader for electronic interference does not occur consequently together from with verification test the power level which is received from the antenna grade where it stands must maintain minimum -55dBm and the electronic interference will not occur with the fact that, antenna and reel his recognition distance the maximum 7m until the recognition which is possible but smooth hazard it must stand and and with the fact that it will do from within and and and 3-4m it must be used Jig it is thought.

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

Current techniques for road-traffic monitoring rely on sensors which have limited capabilities, are costly and disruptive to install. The use of video cameras coupled with computer vision techniques offers an attractive alternative to current sensors. Video based traffic monitoring systems are now being considered key points of advanced traffic management systems. In this paper, we propose the new method which extract the traffic information using video camera. The proposed method uses an adaptive updating scheme for background in order to reduce the false alarm rate due to various noises in images. also, the proposed extraction method of traffic information calculates the traffic volume ratio of vehicles passing through predefined detection area, which is defined by the length of profile occupied by cars over that of overall detection area. Then the ratio is used to define 8 different states of traffic and to interpret the state of vehicle flows. The proposed method is verified by an experiment using CCTV traffic data from urban area.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.13-22
• /
• 2004

Because video sequence consists of dynamic objects in nature, the object motion in video is an effective feature in describing the contents of video sequence and motion feature plays an important role in video retrieval. In this paper, we propose a method that converts motion vectors (MVs) to a uniform set on MPEG coded domain, independent of the frame type and the direction of prediction, and utilizes these normalized MVs (N-MVs) as motion descriptor to understand video contents. We describe a frame-type independent representation of the various types of frames presented in an MPEG video in which all frames can be considered equivalently, without full-decoding. In the experiments, we show that the proposed method is better than the conventional one in terms of performance.

• Journal of Broadcast Engineering
• /
• v.20 no.3
• /
• pp.449-463
• /
• 2015

Video object tracking is important for variety of applications, such as security, video indexing and retrieval, video surveillance, communication, and compression. This paper proposes an object tracking method in HEVC bitstreams. Without pixel reconstruction, motion vector (MV) and size of prediction unit in the bitstream are employed in an Spatio-Temporal Markov Random Fields (ST-MRF) model which represents the spatial and temporal aspects of the object's motion. Coefficient-based object shape adjustment is proposed to solve the over-segmentation and the error propagation problems caused in other methods. In the experimental results, the proposed method provides on average precision of 86.4%, recall of 79.8% and F-measure of 81.1%. The proposed method achieves an F-measure improvement of up to 9% for over-segmented results in the other method even though it provides only average F-measure improvement of 0.2% with respect to the other method. The total processing time is 5.4ms per frame, allowing the algorithm to be applied in real-time applications.