• Title/Summary/Keyword: D-Rules

Search Result 468, Processing Time 0.024 seconds

Efficient Image Retrieval using Minimal Spatial Relationships (최소 공간관계를 이용한 효율적인 이미지 검색)

  • Lee, Soo-Cheol;Hwang, Een-Jun;Byeon, Kwang-Jun
    • Journal of KIISE:Databases
    • /
    • v.32 no.4
    • /
    • pp.383-393
    • /
    • 2005
  • Retrieval of images from image databases by spatial relationship can be effectively performed through visual interface systems. In these systems, the representation of image with 2D strings, which are derived from symbolic projections, provides an efficient and natural way to construct image index and is also an ideal representation for the visual query. With this approach, retrieval is reduced to matching two symbolic strings. However, using 2D-string representations, spatial relationships between the objects in the image might not be exactly specified. Ambiguities arise for the retrieval of images of 3D scenes. In order to remove ambiguous description of object spatial relationships, in this paper, images are referred by considering spatial relationships using the spatial location algebra for the 3D image scene. Also, we remove the repetitive spatial relationships using the several reduction rules. A reduction mechanism using these rules can be used in query processing systems that retrieve images by content. This could give better precision and flexibility in image retrieval.

Implementation of D-algorithm by using PROLOG (PRLOG에 의한 D-algorithm의 구현에 관한 연구)

  • 김명기;문영덕
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.35 no.3
    • /
    • pp.87-94
    • /
    • 1986
  • This paper introduce a new test generation method based on built-in data base which is suitable for generating of test set by using PROLOG language. The program presented in this paper deals with all the information required for fault detection from the rules describing output signals and internal signals. Example shows the validity of proposed PROLOG program which results in a effective generation of test set comparable to the conventional D-algorithm.

  • PDF

Automated Test Data Generation for Testing Programs with Multi-level Stack-directed Pointers (다단계 스택 지향 포인터가 있는 프로그램 테스트를 위한 테스트 데이터 자동 생성)

  • Chung, In-Sang
    • The KIPS Transactions:PartD
    • /
    • v.17D no.4
    • /
    • pp.297-310
    • /
    • 2010
  • Recently, a new testing technique called concolic testing receives lots of attention. Concolic testing generates test data by combining concrete program execution and symbolic execution to achieve high test coverage. CREST is a representative open-source test tool implementing concolic testing. Currently, however, CREST only deals with integer type as input. This paper presents a new rule for automated test data generation in presence of inputs of pointer type. The rules effectively handles multi-level stack-directed pointers that are mainly used in C programs. In addition, we describe a tool named vCREST implementing the proposed rules together with the results of applying the tool to some C programs.

XML Language for Generating J2ME MIDlet User Interfaces (J2ME MIDlet 사용자 인터페이스 자동생성을 위한 XML언어)

  • Chang, Park-Ki;Seo, Seong-Chae;Kim, Byung-Ki
    • The KIPS Transactions:PartD
    • /
    • v.15D no.3
    • /
    • pp.327-336
    • /
    • 2008
  • Many XML-compliant UIDLs(User Interface Description Languages) have been developed to specify user interfaces. Although previous UIDLs are helpful to describe user interfaces of web and desktop applications, they are not available of developing UI of mobile applications. In this paper, in order to effectively specify user interfaces of MIDlet which is application model on J2ME(Java Platform, Micro Edition), we propose MIML(Midlet Interface Markup Language) and present transformation rules to generate source codes from MIML. Further, we enhance the usability of MIML through J2MERenderer which is a tool using presented rules. The proposed method can specify user interfaces of mobile applications and allow developers to keep productivity and consistency in development phase.

Prefix Cuttings for Packet Classification with Fast Updates

  • Han, Weitao;Yi, Peng;Tian, Le
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1442-1462
    • /
    • 2014
  • Packet classification is a key technology of the Internet for routers to classify the arriving packets into different flows according to the predefined rulesets. Previous packet classification algorithms have mainly focused on search speed and memory usage, while overlooking update performance. In this paper, we propose PreCuts, which can drastically improve the update speed. According to the characteristics of IP field, we implement three heuristics to build a 3-layer decision tree. In the first layer, we group the rules with the same highest byte of source and destination IP addresses. For the second layer, we cluster the rules which share the same IP prefix length. Finally, we use the heuristic of information entropy-based bit partition to choose some specific bits of IP prefix to split the ruleset into subsets. The heuristics of PreCuts will not introduce rule duplication and incremental update will not reduce the time and space performance. Using ClassBench, it is shown that compared with BRPS and EffiCuts, the proposed algorithm not only improves the time and space performance, but also greatly increases the update speed.

An Efficient Algorithm For Mining Association Rules In Main Memory Systems (대용량 주기억장치 시스템에서 효율적인 연관 규칙 탐사 알고리즘)

  • Lee, Jae-Mun
    • The KIPS Transactions:PartD
    • /
    • v.9D no.4
    • /
    • pp.579-586
    • /
    • 2002
  • This paper propose an efficient algorithm for mining association rules in the large main memory systems. To do this, the paper attempts firstly to extend the conventional algorithms such as DHP and Partition in order to be compatible to the large main memory systems and proposes secondly an algorithm to improve Partition algorithm by applying the techniques of the hash table and the bit map. The proposed algorithm is compared to the extended DHP within the experimental environments and the results show up to 65% performance improvement in comparison to the expanded DHP.

A Method for Mining Interval Event Association Rules from a Set of Events Having Time Property (시간 속성을 갖는 이벤트 집합에서 인터벌 연관 규칙 마이닝 기법)

  • Han, Dae-Young;Kim, Dae-In;Kim, Jae-In;Na, Chol-Su;Hwang, Bu-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.2
    • /
    • pp.185-190
    • /
    • 2009
  • The event sequence of the same type from a set of events having time property can be summarized in one event. But if the event sequence having an interval, It is reasonable to be summarized more than one in independent sub event sequence of each other. In this paper, we suggest a method of temporal data mining that summarizes the interval events based on Allen's interval algebra and finds out interval event association rule from interval events. It provides better knowledge than others by using concept of an independent sub sequence and finding interval event association rules.

Assessment Using the ICF-core set for Children and Youth with Cerebral Palsy: A Single Case Study

  • Yun, YuNa;Choi, GoEun;Lim, Hyoung won
    • The Journal of Korean Physical Therapy
    • /
    • v.31 no.2
    • /
    • pp.103-110
    • /
    • 2019
  • Purpose: This study evaluated the usefulness of International Classification of Functioning, disability and health core set for children and youths with cerebral palsy (ICF-core set for CP) by comparing the Gross Motor Function Measure-88 (GMFM-88), which is the most widely used outcome measure in children with cerebral palsy (ICF-core set for CP). Method: One subject (Female, 14) was evaluated by GMFM-88 and ICF-core set for CP. In addition, the concept of GMFM-88 was compared with the concept of the ICF-core set for CP in compliance with ICF linking rules. The numerical values both of the GMFM-88 categories and the ICF-core set for CP's items were compared. Results: The ICF b760 was linked to the GMFM-88 59~61. d415 was linked to 57~58 of GMFM-88. d450 was linked to GMFM-88's 65~72. d455 was linked to GMFM-88 at 77and 80~83. Conclusion: The association of the ICF-core set for CP and GMFM-88 was confirmed. In addition, the number of categories of ICF-core set for CP was smaller than the number of items of GMFM-88. In conclusion, the ICF-core set for CP is an evaluation tool that can identify the various features of children. In addition, GMFM-88 was linked to the ICF core set for CP according to the ICF linking rules.

Parametric Modeling Method for 3D Assembly Design of Parts Composing Superstructure Module on Modular Steel Bridge (모듈러 강교량 상부모듈 구성파트의 3차원 조립설계를 위한 파라메트릭 모델링 방법)

  • Lee, Sang Ho;An, Hyun Jung
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.33 no.1
    • /
    • pp.35-46
    • /
    • 2013
  • A parametric modeling method, one of the core technology of BIM (Building Information Modeling), is proposed for efficient 3D assembly design among components of a superstructure module of modular steel bridge. Assembly system is classified into 3 levels as LoD (Level of Details) for 3D assembly design of the parts. Components forming 3D shape of the parts are identified and defined as parameters, variables depending on parameters, or constants independent of the parameters. Then, spatial assembly rules among the parts are defined according to the assembly system. Positional relations among the identified shape components are defined for mating spatial position and geometrical relations are defined for constraining degree of freedom on X, Y, and Z axis. Finally, a standardized template is designed by applying the rules to 3D based assembly design for the parts of the superstructure module. In addition, applicability of the parametric modeling method is demonstrated by testing the shape variation of the superstructure module according to changing the defined parameters.

Real-Time Fraud Detection using Data Quality Diagnosis Techniques for R&D Grant (데이터 품질진단 기법을 이용한 연구개발비 이상거래 실시간 탐지)

  • Jang, Ki-Man;kim, Chang-Su;Jung, Hoe-kyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.11
    • /
    • pp.2609-2614
    • /
    • 2015
  • National research and development projects institutions have implemented various measures in order to prevent R&D expenses abuse and negate enforcement. but it reveals a limit to prevent abuse of R&D expenses[1,2]. In this paper, to prevent abuses resulting from the R & D for the unusual trading post caught collecting information from the R & D phase implementation plan to detect unusual transactions. The results are subjective and research institutions, and specialized agencies to take advantage of shared, real-time cross-linkage between the credit card companies. Studies of data quality diagnostic techniques developed for this purpose related regulations and manuals, Q & A, FAQ, Outside-in business rules that derive from a variety of information, such as personnel interviews (Outside-In) was used for analysis.