A unified approach is presented for calculation multi-level testability measures and for testability guided hierarchical automated test pattern generation (ATPG) for digital systems. The methods and algorithms are based on path tracing procedures on decision diagrams. On the higher level the system is presented as a network of register transfer level (RTL) components, and on the lower level eac...

This paper introduces several new families of decision diagrams for multi output Boolean functions The in troduced by us families include several diagrams known from literature BDDs FDDs as subsets Due to this property our diagrams can provide a more compact representation of functions than either of the two decision diagrams Kronecker Decision Diagrams KDDs with negated edges are based on thre...

Data structures for Boolean functions build an essential component of design automation tools, especially in the area of logic synthesis. The state of the art data structure is the ordered binary decision diagram (OBDD), which results from general binary decision diagrams (BDDs), also called branching programs, by ordering restrictions. In the context of EXOR-based logic synthesis another type ...

Background: Nephrolithiasis is a global health problem that is growing exponentially in the developed and developing countries. This study aimed to determine the dietary diversity score (DDS) and its association with nutrient adequacy in patients with calcium oxalate kidney stone. Methods: The present cross-sectional study was conducted on 276 male patients with calcium oxalate kidney stone. Th...

Decision diagrams (DDs) are a popular means for decision making, e.g., in clinical guidelines. Some applications require to integrate multiple related yet different diagrams into a single one, for which algorithms have been developed. However, existing merging tools are monolithic, application-tailored programs with no clear interface to the actual merging procedures, which makes their reuse ha...

Data structures for Boolean functions build an essential component of design automation tools, especially in the area of logic synthesis. The state of the art data structure is the ordered binary decision diagram (OBDD), which results from general binary decision diagrams (BDDs), also called branching programs, by ordering restrictions. In the context of EXOR-based logic synthesis another type ...

Solubility parameter-dependent drug releasing property is essential in practical drug delivery systems (DDS), and how to combine magnetic nanoparticles(NPs) and suitable polymer coating towards DDS is always a crucial and valuable challenge in biomedical application. Herein, a controllable drug delivery model with a surface having a chemically tunable solubility parameter is presented using hol...

This study presents a methodology based on Linear Programming for determining the optimal pump schedule on a 24-hour basis, considering as decision variables the continuous pump flow rates which are subsequently transformed into a discrete schedule. The methodology was applied on a case study derived from the benchmark Anytown network. To evaluate the LP reliability, a comparison was made with ...

Known upper bounds on the number of required nodes (size) in the ordered binary and multiple-valued decision diagram (DD) for representation of logic functions are reviewed and reduced by a small constant factor. New upper bounds are derived for partial logic functions containing don't cares and also for complete Boolean functions specified by Boolean expressions. The evaluation of upper bounds...