The spectrograph ESPRESSO recently obtained a limit on the variation of fine-structure constant, $\alpha$, through measurements along line sight bright quasar with precision $1.36$ ppm at $1\sigma$ level. This imposes new constraints cosmological models varying $\alpha$. We assume such model where electromagnetic sector is coupled to scalar field dark energy responsible for current acceleration...

Two polymorphs of indomethacin were investigated by 1H MAS and CRAMPS, and 1H-13C CPMAS and HETCOR NMR techniques. The obtained spectra clearly elucidated the structural differences between the polymorphs, especially the different numbers of indomethacin molecules within the crystallographic asymmetric units and the different schemes of hydrogen bonding among the molecules. Known structure of i...

This paper describes a new method for exact hazard-free logic minimization of Boolean functions. Given an incompletelyspecified Boolean function, the method produces a minimal sumof-products implementation which is hazard-free for a given set of multiple-input changes, if such a solution exists. The method is a constrained version of the Quine-McCluskey algorithm. It has been automated and appl...

Bootstrapping has a tendency, called semantic drift, to select instances unrelated to the seed instances as the iteration proceeds. We demonstrate the semantic drift of bootstrapping has the same root as the topic drift of Kleinberg’s HITS, using a simplified graphbased reformulation of bootstrapping. We confirm that two graph-based algorithms, the von Neumann kernels and the regularized Laplac...

Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound variables (variable partitioning problem) for disjoint (disjoint serial) decomposition, such that the decomposed circuits are smaller in size and its truth table representation have maximal don’t cares. A novel pruned bre...

This paper presents a new approach to a classical two-level logic minimization problem. The approach is simple and efficient. It does not require sophisticated techniques or software packages such as BDDs, a class of Branch-and-Bound procedures, etc. A graph model is used to capture relations among closely related Boolean terms. Graph edges are dynamically assigned priority that allows us to ef...

We report research on the assessment of Boolean minimization in symbolic empirical learning. We view training examples as logical expressions and implement Boolean Minimization (BM) heuristics to optimize input and to learn symbolic knowledge rules. We base our work on a BM learning system called BML . BML includes three components : a preprocessing, a BM, and a postprocessing component. The sy...

We propose a new way of decomposing completely or incompletely specified Boolean functions into a set of unate functional blocks to obtain a good initial structure for logic synthesis. The input to our algorithm is a flattened netlist. The output is a multi-level netlist that can be efficiently implemented using a logic synthesis tool. Experimental results on Espresso PLA benchmarks employing a...