Decision Diagrams (DDs) are a data structure for the representation and manipulation of discrete logic functions often applied in VLSI CAD. Common DDs to represent Boolean functions are Binary Decision Diagrams (BDDs). Multiple-valued logic functions can be represented by Multiple-valued Decision Diagrams (MDDs). The efficiency of a DD representation strongly depends on the variable ordering; t...

A novel spherical convolution is defined through the sifting property of Dirac delta on sphere. The so-called by inner product one function with a translated version another, but adoption an alternative translation operator This follows analogy Euclidean when viewed in harmonic space. satisfies variety desirable properties that are lacking alternate definitions, namely: it supports directional ...

Screening is the process of sifting through a set of factors via experimentation to determine the few important factors that have a substantial effect on a response. When the set of factors is large and interactions are anticipated, screening methods using single fractional factorial designs may require too many observations to be feasible, and the methodology of two-stage group screening has b...

We propose a new algorithm, called linear sifting, for the optimization of decision diagrams that combines the ee-ciency of sifting and the power of linear transformations. We show that the new algorithm is applicable to large examples , and that in many cases it leads to substantially more compact diagrams when compared to simple variable reordering. We show in what sense linear transformation...

We present a new approach to digital forensic evidence acquisition and disk imaging called sifting collectors that images only those regions of a disk with expected forensic value. Sifting collectors produce a sector-by-sector, bit-identical AFF v3 image of selected disk regions that can be mounted and is fully compatible with existing forensic tools and methods. In our test cases, they have ac...

Determinant Decision Diagram (DDD) is a variant of binary decision diagrams (BDDs) for representing symbolic matrix determinants and cofactors in symbolic circuit analysis. DDD-based symbolic analysis algorithms have time and space complexities proportional to the number of DDD vertices. Inspired by the ideas of Rudell, Drechsler, et. al. on BDD minimization, we present lowerbound based exact a...

Understanding of relationships between morphology and ecological performance can help to reveal how natural selection drives biological diversification. We investigate relationships between feeding behavior, foraging performance and morphology within a diverse group of teleost fishes, and examine the extent to which associations can be explained by evolutionary relatedness. Morphological adapta...

In order to simplify a synthesis task for particularly hard functions it is sometimes inevitable to decompose the function in a preprocessing step. We propose a new algorithm for automatically decomposing a target function by extracting a linear lter within the synthesis process. The algorithm is an application of the Linear Sifting algorithm which has been proposed in [6]. Using this method we...

The author of this little work is to be congratulated upon the amount of useful information crammed into such a little space. The references after each chapter are very large in number and go to show the amount of reading that must have been necessary in the process of sifting. The work places before the reader various methods of treatment practised at Home and abroad, and it is the author's in...