This paper presents an efficient approach to generate tests for gate delay faults. Unlike other known algorithms which try to generate a 'good' delay test the presented algorithm is complete in the sense that if a delay test exists it will generate an optimal delay test. An optimal delay test for a gate delay fault is a test that sensitizes the longest functional path through the fault site. Es...

Erdős and Hajnal [4] conjectured that, for any graph H, every graph on n vertices that does not have H as an induced subgraph contains a clique or a stable set of size n for some ε(H) > 0. The conjecture is known to be true for graphs H with |V (H)| ≤ 4. One of the two remaining open cases on five vertices is the case where H is a four-edge path, the other case being a cycle of length five. In ...

Inherited myopathies are a heterogeneous group of disabling disorders with still barely understood pathological mechanisms. Around 40% of afflicted patients remain without a molecular diagnosis after exclusion of known genes. The advent of high-throughput sequencing has opened avenues to the discovery of new implicated genes, but a working list of prioritized candidate genes is necessary to dea...

Recent advances in computer technology in terms of speed, cost, tremendous amount of computing power and decrease data processing time has spurred increased interest in data mining applications to extract useful knowledge from data. Over the last couple of years, data mining technology has been successfully employed to various business domains and scientific areas. Various data mining technique...

In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. The mining of association rules can be mapped into the problem of discovering large itemsets where a large itemset is a group of items which appear in a suucient number of transactions. The problem of discovering large itemsets can be solved by constructing a candidate set of i...

Uncertain data sets have become popular in recent years because of advances in recent years in hardware data collection technology. In uncertain data sets, the values of the underlying data sets may not be fully specified. In this chapter, we will discuss the frequent pattern mining for uncertain data sets. We will show how the broad classes of algorithms can be extended to the uncertain data s...

A quantummechanics based method is presented to generate sets of digital angles that may be well suited to describe projections on discrete grids. The resulting angle sets are an alternative to those derived using the Farey fractions from number theory. The Farey angles arise naturally through the definitions of the Mojette and Finite Radon Transforms. Often a subset of the Farey angles needs t...

Large-scale variations still pose a challenge in unconstrained face detection. To the best of our knowledge, no current face detection algorithm can detect a face as large as 800 × 800 pixels while simultaneously detecting another one as small as 8 × 8 pixels within a single image with equally high accuracy. We propose a two-stage cascaded face detection framework, Multi-Path Region-based Convo...

High-throughput genetic screens have exponentially increased the functional annotation of the genome over the past 10 years. Likewise, genome-scale efforts to map DNA methylation, chromatin state and occupancy, messenger RNA expression patterns, and disease-associated genetic polymorphisms, and proteome-wide efforts to map protein-protein interactions, have also created vast resources of data. ...