• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.945-952
• /
• 2013

The R wave of QRS complex is the most prominent feature in ECG because of its specific shape; therefore it is taken as a reference in ECG feature extraction. But R wave detection suffers from the fact that frequency bands of the noise/other components such as P/T waves overlap with that of QRS complex. ECG signal processing must consider efficiency for hardware and software resources available in processing for miniaturization and low power. In other words, the design of algorithm that exactly detects QRS region using minimal computation by analyzing the person's physical condition and/or environment is needed. Therefore, efficient QRS detection based on SOM(Subtractive Operation Method) is presented in this paper. For this purpose, we detected R wave through the preprocessing method using morphological filter, empirical threshold, and subtractive signal. Also, we applied dynamic backward searching method for efficient detection. The performance of R wave detection is evaluated by using MIT-BIH arrhythmia database. The achieved scores indicate the average of 99.41% in R wave detection.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.531-538
• /
• 2008

With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc network is dynamically to search paths from a source to destination with an efficient routing method, which is an important issue for delay-sensitive real-time application. The main concerns of graph theory in communications are finding connectivity and searching paths using given nodes. A topology of the nodes in ad hoc networks can be modeled as an adjacency matrix. In this paper, based on this adjacency matrix, we propose new path search algorithms using a sequence of matrix calculation. The proposed algorithms can search paths from a destination to a source using connectivity matrix. Two matrix-based algorithms for two different purposes are proposed. Matrix-Based Backward Path Search(MBBS) algorithm is designed for shortest path discovery and Matrix-Based Backward Multipath Search(MBBMS) algorithm is for multipath search.

• Journal of KIISE:Software and Applications
• /
• v.36 no.9
• /
• pp.732-748
• /
• 2009

The technology of Semantic Web realizes the base technology for context-awareness that creates new services by dynamically and flexibly combining various resources (people, concepts, etc). According to the realization of ubiquitous computing technology, many researchers are currently working for the embodiment of web service. However, most studies of them bring about the only predefined results those are limited to the initial description by service designer. In this paper, we propose a new service supporting model to provide an automatic method for plan related tasks which achieve goal state from initial state. The inputs on an planner are intial and goal descriptions which are mapped to the current situation and to the user request respectively. The idea of the method is to infer context from world model by DL-based ontology reasoning using OWL domain ontology. The context guide services to be loaded into planner. Then, the planner searches and plans at least one service to satisfy the goal state from initial state. This is STRIPS-style backward planner, and combine OWL-S services based on AI planning theory that enabling reduced search scope of huge web-service space. Also, when feasible service do not find using pattern matching, we give user alternative services through DL-based semantic searching. The experimental result demonstrates a new possibility for realizing dynamic service modeler, compared to OWLS-XPlan, which has been known as an effective application for service composition.