• Title/Summary/Keyword: topological pattern

Search Result 51, Processing Time 0.031 seconds

Test Generation for Speed-Independent Asynchronous Circuits with Undetectable Faults Identification

  • Eunjung Oh;Lee, Dong-Ik;Park, Ho-Yong
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.359-362
    • /
    • 2000
  • In this paper, we propose a test pattern generation algorithm on the basis of the identification of undetectable faults for Speed-Independent(SI) asynchronous control circuits. The proposed methodology generates tests from the specification of a target circuit, which describes the behavior of the circuit in the form of Signal Transition Graph (STG). The proposed identification method uses only topological information of a target circuit and reachability information of a fault-free circuit, which is generated in the form of Binary Decision Diagram(BDD) during pre-processing. Experimental results show that high fault coverage over single input stuck-at fault model is obtained for several synthesized SI circuits and the use of the identification process as a preprocessing decreases execution time of the proposed test generation with negligible costs.

  • PDF

Wavelet based Feature Extraction of Human face

  • Kim, Yoon-Ho;Lee, Myung-Kil;Ryu, Kwang-Ryol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.2
    • /
    • pp.349-355
    • /
    • 2001
  • Human have a notable ability to recognize faces, which is one of the most common visual feature in our environment. In regarding face pattern, just like other natural object, a geometrical interpretation of face is difficult to achieve. In this paper, we present wavelet based approach to extract the face features. Proposed approach is similar to the feature based scheme, where the feature is derived from the intensity data without detecting any knowledge of the significant feature. Topological graphs are involved to represent some relations between facial features. In our experiments, proposed approach is less sensitive to the intensity variation.

  • PDF

Bibliometric Analysis of Korean Journals in Arts and Kinesiology - from the Perspective of Authorship

  • Lee, Danielle
    • Journal of Information Science Theory and Practice
    • /
    • v.8 no.3
    • /
    • pp.15-29
    • /
    • 2020
  • This study aims to describe the general patterns of Korean research in Arts and Kinesiology, particularly from the perspective of authorship. Among the 12 sub-areas of Arts and Kinesiology indexed in the Korean Citation Index (KCI), journals in three sub-areas, "Arts," "Design," and "Kinesiology" have the longest publishing histories and produced the largest volume of articles. 68 journals in the "Arts," "Design," and "Kinesiology" sub-areas were accredited in the KCI between 2001 and 2019; 40,955 articles which were published in the journals between the years of accreditation and the end of 2019 serve as the context of this article. Authorship, affiliated institutions and countries, openness to new authors, top researchers, topological properties of authorship networks, overall research performance by authors, and co-authorship patterns were analyzed and compared among three sub-subjects.

Design and Implementation of Circular Dot Pattern Code (CDPC) and Its Recognition Algorithm which is robust to Geometric Distortion and Noise (대화형 인쇄물 구현을 위한 기하변형과 잡음에 강인한 원형 점 패턴코드의 설계와 인식 알고리즘 구현)

  • Shim, Jae-Youn;Kim, Seong-Whan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.1166-1169
    • /
    • 2011
  • In this paper, we design a Circle dot Code, In our scheme, we design a dot patterns for increasing maximum capacity and also for increasing robustness to Affine Transformation. Our code Can be extended according number of data circle. We use three data circle vision code. In this type code, after acquiring camera images for the Circle dot Codes, and perform error correction decoding using four position symbols and six CRC symbols. We perform graph based dot code analysis which determines the topological distance between dot pixels. Our code can be bridged the real world and ubiquitous computing environment.

A Method for Optimal Moving Pattern Mining using Frequency of Moving Sequence (이동 시퀀스의 빈발도를 이용한 최적 이동 패턴 탐사 기법)

  • Lee, Yon-Sik;Ko, Hyun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.1
    • /
    • pp.113-122
    • /
    • 2009
  • Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

Optimization of Structure-Adaptive Self-Organizing Map Using Genetic Algorithm (유전자 알고리즘을 사용한 구조적응 자기구성 지도의 최적화)

  • 김현돈;조성배
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.3
    • /
    • pp.223-230
    • /
    • 2001
  • Since self-organizing map (SOM) preserves the topology of ordering in input spaces and trains itself by unsupervised algorithm, it is Llsed in many areas. However, SOM has a shortcoming: structure cannot be easily detcrmined without many trials-and-errors. Structure-adaptive self-orgnizing map (SASOM) which can adapt its structure as well as its weights overcome the shortcoming of self-organizing map: SASOM makes use of structure adaptation capability to place the nodes of prototype vectors into the pattern space accurately so as to make the decision boundmies as close to the class boundaries as possible. In this scheme, the initialization of weights of newly adapted nodes is important. This paper proposes a method which optimizes SASOM with genetic algorithm (GA) to determines the weight vector of newly split node. The leanling algorithm is a hybrid of unsupervised learning method and supervised learning method using LVQ algorithm. This proposed method not only shows higher performance than SASOM in terms of recognition rate and variation, but also preserves the topological order of input patterns well. Experiments with 2D pattern space data and handwritten digit database show that the proposed method is promising.

  • PDF

EEDARS: An Energy-Efficient Dual-Sink Algorithm with Role Switching Mechanism for Event-Driven Wireless Sensor Networks

  • Eslaminejad, Mohammadreza;Razak, Shukor Abd;Ismail, Abdul Samad Haji
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.10
    • /
    • pp.2473-2492
    • /
    • 2012
  • Energy conservation is a vital issue in wireless sensor networks. Recently, employing mobile sinks for data gathering become a pervasive trend to deal with this problem. The sink can follow stochastic or pre-defined paths; however the controlled mobility pattern nowadays is taken more into consideration. In this method, the sink moves across the network autonomously and changes its position based on the energy factors. Although the sink mobility would reduce nodes' energy consumption and enhance the network lifetime, the overhead caused by topological changes could waste unnecessary power through the sensor field. In this paper, we proposed EEDARS, an energy-efficient dual-sink algorithm with role switching mechanism which utilizes both static and mobile sinks. The static sink is engaged to avoid any periodic flooding for sink localization, while the mobile sink adaptively moves towards the event region for data collection. Furthermore, a role switching mechanism is applied to the protocol in order to send the nearest sink to the recent event area, hence shorten the path. This algorithm could be employed in event-driven and multi-hop scenarios. Analytical model and extensive simulation results for EEDARS demonstrate a significant improvement on the network metrics especially the lifetime, the load and the end-to-end delay.

Spatial Distribution Analysis of Metallic Elements in Dustfall using GIS (GIS를 이용한 강하분진 중 금속원소의 공간분포분석)

  • 윤훈주;김동술
    • Journal of Korean Society for Atmospheric Environment
    • /
    • v.13 no.6
    • /
    • pp.463-474
    • /
    • 1997
  • Metallic elements in dustfall have been known as notable air pollutants directly or indirectly influencing human health and wealth. The first aim of this study was to obtain precise spatial distribution patterns of 5 elements (Pb, Zn, K, Cr, and Al) in dustfall around Suwon area. To predict isometric lines of metal fluxes deposited on unsupervised random sites, the study has applied both spatial statistics as a receptor model and a GIS (geographic information system). Total of 31 sampling sites were selected in the study area (roughly 3 by 3 km grid basis) and dustfall samples were then collected monthly basis by the British deposit gauges from Dec., 1995 to Nov., 1996. The metallic elements in the dustfall were then analyzed by an atomic absorption spectrometer (AAS). On the other hand, a base map overlapped by 7 layers was constructed by using the AutoCAD R13 and ARC/INFO 3.4D. Four different spatial interpolation and expolation techniques such as IDW (inverse distance weighted averaging), TIN (triangulated irregular network), polynomial regression, and kriging technique were examined to compare spatial distribution patterns. Each pattern obtained by each technique was substantally different as varing pollutant types, land of use types, and topological conditions, etc. Thus, our study focused intensively on uncertainty analysis based on a concept of the jackknife and the sum of error distance. It was found that a kriging technique was the best applicalbe in this study area.

  • PDF

The Distortion of Road Distance Perception by the Pattern of Object Distribution - Focused on the Distance Estimation in the Campus by Students - (인공환경 분포방식에 의한 보행거리 인지 변화에 대한 연구 - 대학 캠퍼스 내 보행로의 실제거리와 인지거리의 차이를 중심으로 -)

  • Seo, Kyung Wook
    • KIEAE Journal
    • /
    • v.14 no.4
    • /
    • pp.91-96
    • /
    • 2014
  • The behavior of walking involves our action of seeing things. It is the intention of this research that the cognitive process of perceiving things along the path can affect the way we sense the length of the journey. The theory generally accepted in this line of thought is the 'feature accumulation theory'. It assumes that if the journey includes many objects or memorable features, then our memory recalls that journey much farther than it really was. This study set up a real-life experiment by asking university students about their mental memory of the two different routes in the campus. One is a longer path that has not much to look at except trees and the other a shorter path yet with many buildings, sign boards and street furnitures. The subjects processed their mental image in the brain based on their experience. They showed a strong tendency that the path with more features were remembered longer while that with less features shorter. More interestingly, it was found that as their experience increases, they become more accurate about the exact length of the questioned paths. The result corroborates the theory that human perception of space is based on the topological understanding of surroundings rather than geometric understanding.

Visualization of Vortical Flow Around the Free End Surface of a Finite Circular Cylinder Mounted on a Flat Plate (평판에 고정된 유한 실린더 상면표면 주위에 형성되는 와류유동의 가시화)

  • No, Seong-Cheol;Park, Seung-O
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.25 no.1
    • /
    • pp.71-77
    • /
    • 2001
  • A flow visualization study using the oil film method and the smoke-laser light sheet arrangement is carried out to investigate the three-dimensional flow pattern around the free end surface region of a finite circular cylinder (aspect ratios of 1.25 and 4.25) mounted on a flat plate. The experiment is performed for the cases of two Reynolds numbers: 5.92${\times}$10$^3$and 1.48${\times}$10(sup)5. Various kinds of singular points on the free-end surface are disclosed from the oil surface flow visualization. The smoke-laser light sheet visualization, to aid in understanding the oil streak-line patterns, clearly demonstrates that a pair of tornado-like vortices marched along the downstream together with a pair of side tip vortices. A topological sketch to characterize the surface flow and the four vortices emanating from the top surface is included.