Using Logic Synthesis and Circuit Reasoning for Equivalence Checking

2011 ◽  
Vol 201-203 ◽  
pp. 836-840
Author(s):  
Quan Run Fan ◽  
Feng Pan ◽  
Xin Dong Duan
Keyword(s):  
Logic Synthesis ◽  
Experimental Result ◽  
Equivalence Checking ◽  
Structure Information ◽  
Preliminary Experimental Result ◽  
Sat Solver

The existing SAT based algorithms combines two circuits into a miter, and then convert the miter into a CNF formula. After that, a SAT solver is invoked to check the satisfiability of the CNF formula. However, when a miter is converted into CNF formula, the structure information of the circuit is lost. Therefore,we are motivated to solve the problem of miter satisfiability using circuit reasoning. We use logic synthesis first to simplify the circuit, and then use a backtracking method to check the satisfiability of the miter. The preliminary experimental result sindicate that our approach is efficient.

Performance Evaluation of Minimum Quantity Lubrication With Exfoliated Graphite Nanoplatelets in Turning Titanium Alloy

2018 ◽  
Author(s):  
Dinh Nguyen ◽  
Pil-Ho Lee ◽  
Yang Guo ◽  
Patrick Kwon ◽  
Kyung-Hee Park
Keyword(s):  
Minimum Quantity Lubrication ◽  
Exfoliated Graphite ◽  
Experimental Result ◽  
Graphite Nanoplatelets ◽  
Crater Wear ◽  
Minimum Quantity ◽  
Preliminary Experimental Result ◽  
Tribological Surfaces ◽  
Exfoliated Graphite Nanoplatelets ◽  
Carbide Inserts

This paper evaluates the performances of dry, minimum quantity lubrication (MQL) and MQL with nanofluid in turning the most common titanium (Ti) alloy, Ti-6Al-4V, in a solution treated and aged (STA) microstructure. In particular, the nanofluid evaluated here is vegetable oil (rapeseed) mixed with small concentrations of exfoliated graphite nanoplatelets (xGnP). The focus of this paper is on turning process because it poses a challenging condition to apply oil droplets directly onto the tribological surfaces of a cutting tool due to the continuous engagement of tool and work material. A series of turning experiments was conducted with uncoated carbide inserts while measuring the cutting forces with the dynamometer under various conditions to determine its effectiveness and optimal MQL condition in turning. The worn inserts are retrieved to measure flank and crater wear using confocal microscopy. This preliminary experimental result shows that the use of MQL and nanofluid is effective in improving the machinability of Ti alloys in turning processes.

A Circuit-Based SAT Solver for Logic Synthesis

2021 ◽  
Author(s):  
He-Teng Zhang ◽  
Jie-Hong R. Jiang ◽  
Alan Mishchenko
Keyword(s):  
Logic Synthesis ◽  
Sat Solver

Development of a New Vibrator for Elliptical Vibration Texturing

2011 ◽  
Author(s):  
Ping Guo ◽  
Kornel F. Ehmann
Keyword(s):  
Resonant Mode ◽  
Experimental Result ◽  
Design Parameters ◽  
Vibration Modes ◽  
Turning Process ◽  
Vibration Cutting ◽  
Elliptical Vibration ◽  
Preliminary Experimental Result ◽  
Elliptical Vibration Texturing ◽  
Cutting Direction

Inspired by the idea of vibro-mechanical texturing, which adds a tertiary motion to the tool tip in the conventional turning process, and the elliptical vibration cutting process, which adds vibrations both in the cutting direction and feed direction, this paper proposes a new design for an ultrasonic vibrator for the elliptical vibration texturing process. The elliptical locus lies in the plane that is defined by the cutting and the radial directions. The device could be easily adapted for elliptical cutting applications by changing the orientation of the tool tip. The vibrator works in the resonant mode, with in-phase and anti-phase vibration modes at a nearly identical natural frequency. Simulations and experiments have been carried out to study and verify different vibration modes of the system. Different design parameters have been analyzed to control the elliptical trajectory of the tool tip. A set of preliminary experimental result of elliptical vibration texturing is also provided.

scholarly journals Framework for Generating Configurable SAT Solvers

2011 ◽  
Vol 6 (1) ◽  
pp. 50-59
Author(s):  
Bernardo C. Vieira ◽  
Fabrício V. Andrade ◽  
Antônio O. Fernandes
Keyword(s):  
State Of The Art ◽  
The State ◽  
Equivalence Checking ◽  
Decision Heuristics ◽  
Sat Solvers ◽  
The Third ◽  
Sat Solver ◽  
Run Time

The state-of-the-art SAT solvers usually share the same core techniques, for instance: the watched literals structure, conflict clause recording and non-chronological backtracking. Nevertheless, they might differ in the elimination of learnt clauses, as well as in the decision heuristic. This article presents a framework for generating configurable SAT solvers. The proposed framework is composed of the following components: a Base SAT Solver, a Perl Preprocessor, XML files (Solver Description and Heuristics Description files) to describe each heuristic as well as the set of heuristics that the generated solver uses. This solvers may use several techniques and heuristics such as those implemented in BerkMin, and in Equivalence Checking of Dissimilar Circuits, and also in Minisat. In order to demonstrate the effectiveness of the proposed framework, this article also presents three distinct SAT solver instances generated by the framework to address a complex and challenging industry problem: the Combinational Equivalence Checking problem (CEC).The first instance is a SAT solver that uses BerkMin and Dissimilar Circuits core techniques except the learnt clause elimination heuristic that has been adapted from Minisat; the second is another solver that combines BerkMin and Minisat decision heuristics at run-time; and the third is yet another SAT solver that changes the database reducing heuristic at run-time. The experiments demonstrate that the first SAT solver generated is a faster solver than state-of-the-art SAT solver BerkMin for several instances as well as for Minisat in almost every instance.

scholarly journals Numerical Simulation of Gas-Liquid Two-Phase Flow in a Horizontally Placed Hydrophobic Rectangular Channel (Part 2, Influence of Abrupt Contraction)

2012 ◽  
Vol 31 (4-5) ◽  
pp. 411-413
Author(s):  
Y. Ueda ◽  
T. Nakajima ◽  
T. Ishii ◽  
R. Tsujino ◽  
M. Iguchi
Keyword(s):  
Two Phase Flow ◽  
Rectangular Channel ◽  
Experimental Result ◽  
Inertia Force ◽  
Phase Flow ◽  
Bubble Behavior ◽  
Fluid System ◽  
Two Phase ◽  
Preliminary Experimental Result ◽  
Abrupt Contraction

AbstractThis paper computationally visualizes two-phase flow patterns through a horizontally placed hydrophilic or hydrophobic rectangular channel with an abrupt contraction. The rectangular duct used in this study has a thickness narrower than the Laplace constant so that the surface tension governs the fluid system rather than the inertia force. In particular, the computed bubble behavior at the abrupt contraction seemed to be a similar nature against the preliminary experimental result.

BDD-Based Combinatorial Keyword Query Processing under a Taxonomy Model

2012 ◽  
Vol 3 (4) ◽  
pp. 52-62
Author(s):  
Shin-ichi Minato ◽  
Nicolas Spyratos
Keyword(s):  
Digital Libraries ◽  
Large Scale ◽  
Intelligent System ◽  
Real Life ◽  
Experimental Result ◽  
Easy Access ◽  
Compact Representation ◽  
Keyword Query ◽  
Preliminary Experimental Result ◽  
Efficient Data

Digital libraries are one of the key systems for an IT society, and supporting easy access to them is an important technical issue between a human and an intelligent system. Here the authors consider a publish/subscribe system for digital libraries which continuously evaluates queries over a large repository containing document descriptions. The subscriptions, the query expressions and the document descriptions, all rely on a taxonomy that is a hierarchically organized set of keywords, or terms. The digital library supports insertion, update and removal of a document. Each of these operations is seen as an event that must be notified only to those users whose subscriptions match the document's description. In this chapter, the authors present a novel method of processing such keyword queries. Their method is based on Binary Decision Diagram (BDD), an efficient data structure for manipulating large-scale Boolean functions. The authors compile the given keyword queries into a BDD under a taxonomy model. The number of possible keyword sets can be exponentially large, but the compiled BDD gives a compact representation, and enabling a highly efficient matching process. In addition, the authors' method can deal with any Boolean combination of keywords from the taxonomy, while the previous result considered only a conjunctive keyword set. In this chapter, they describe the basic idea of their new method, and then the authors show their preliminary experimental result applying to a document set with large-scale keyword domain under a real-life taxonomy structure.

scholarly journals Preliminary experimental result on the mean lifetime of the 10.94 MeV state of16O

1969 ◽  
Vol 1 (15) ◽  
pp. 798-798
Author(s):  
I. Filosofo ◽  
E. Fuschini ◽  
C. Maroni ◽  
A. Uguzzoni ◽  
E. Verondini
Keyword(s):  
Experimental Result ◽  
Preliminary Experimental Result ◽  
Mean Lifetime ◽  
The Mean

BDD-Based Combinatorial Keyword Query Processing under a Taxonomy Model

2010 ◽  
pp. 26-39
Author(s):  
Shin-ichi Minato ◽  
Nicolas Spyratos
Keyword(s):  
Digital Libraries ◽  
Large Scale ◽  
Intelligent System ◽  
Real Life ◽  
Experimental Result ◽  
Easy Access ◽  
Compact Representation ◽  
Keyword Query ◽  
Preliminary Experimental Result ◽  
Efficient Data

Digital libraries are one of the key systems for an IT society, and supporting easy access to them is an important technical issue between a human and an intelligent system. Here we consider a publish/subscribe system for digital libraries which continuously evaluates queries over a large repository containing document descriptions. The subscriptions, the query expressions and the document descriptions, all rely on a taxonomy that is a hierarchically organized set of keywords, or terms. The digital library supports insertion, update and removal of a document. Each of these operations is seen as an event that must be notified only to those users whose subscriptions match the document‘s description. In this chapter, the authors present a novel method of processing such keyword queries. Our method is based on Binary Decision Diagram (BDD), an efficient data structure for manipulating large-scale Boolean functions. The authors compile the given keyword queries into a BDD under a taxonomy model. The number of possible keyword sets can be exponentially large, but the compiled BDD gives a compact representation, and enabling a highly efficient matching process. In addition, our method can deal with any Boolean combination of keywords from the taxonomy, while the previous result considered only a conjunctive keyword set. In this chapter, they describe the basic idea of their new method, and then the authors show their preliminary experimental result applying to a document set with large-scale keyword domain under a real-life taxonomy structure.

Sign in / Sign up

Export Citation Format

Share Document