this paper presents a novel method for automatic functional vectors generation from RT-level HDL descriptions based on path coverage and constraint solving. Compared with existing method, the advantage of this method ...
详细信息
this paper presents a novel method for automatic functional vectors generation from RT-level HDL descriptions based on path coverage and constraint solving. Compared with existing method, the advantage of this method includes: 1) it avoids generating redundant constraints, which will accelerate the test generation process, 2) it solves the problem of how to propagate the internal values to the primary inputs with decision models, 3) it can handle various HDL description styles, and various styles of designs. Experimental results conduct on several practical designs show that our method can efficiently improve the functional vectors generation process. the prototype system has been applied to verify RTL description of a real 32-bits microprocessor core and complex bugs remained hidden in the RTL descriptions are detected.
this paper presents a novel method to generate optimized architecture of hardware processes implemented on "system on a programmable chip" (SoPC). the hardware processes are the applications tailored "c...
详细信息
this paper presents a novel method to generate optimized architecture of hardware processes implemented on "system on a programmable chip" (SoPC). the hardware processes are the applications tailored "cells" in the processor-coupled polymorphous fabric (Ch. Wolinski et al., 2003, Ch. Wolinski et al., 2002) implemented on the reconfigurable SoPC platform. In order to obtain optimized high performance pipelined architecture each process implementing repetitive conditional behavior with possible inter-iteration dependencies is scheduled under hardware resource constraints using "fabric cell synthesis tool" (FAST). the scheduling problem is defined and solved using constraints programming approach. this approach makes it possible to obtain optimal solutions in terms of execution time and number of registers for a number of real cases. Our method is illustrated using a simple example and a part of the "CORDIC" application (S.F. Hsiao et al., 1991). the final design is implemented on a reconfigurable platform that shows feasibility of our approach. Optimal schedules are achieved for both discussed applications.
作者:
Snow, PConcord
NH 03303-6134 P.O. Box 6134 United States
Outside of the fuzzy community, questions persist about the most common fuzzy logic as a guide to propositional truth and so, despite many practical successes, about its fitness for describing real phenomena. the pape...
详细信息
ISBN:
(纸本)3540228179
Outside of the fuzzy community, questions persist about the most common fuzzy logic as a guide to propositional truth and so, despite many practical successes, about its fitness for describing real phenomena. the paper assesses the realistic expressiveness of the logic by showing that any ordinary and non-fuzzy linear programming model can be mechanically translated into a fuzzy propositional model, and vice versa. Since linear programs are realistic, versatile, and robust, the fuzzy propositional logic cannot be otherwise.
this paper proposes two integer programming models and their GA-based solutions for optimal concept learning. the models are built to obtain the optimal concept description in the form of propositional logic formulas ...
详细信息
ISBN:
(纸本)3540228179
this paper proposes two integer programming models and their GA-based solutions for optimal concept learning. the models are built to obtain the optimal concept description in the form of propositional logic formulas from examples based on completeness, consistency and simplicity. the simplicity of the propositional rules is selected as the objective function of the integer programming models, and the completeness and consistency of the concept are used as the constraints. Considering the real-world problems that certain level of noise is contained in data set, the constraints in model 11 are slacked by adding slack-variables. To solve the integer programming models, genetic algorithm is employed to search the global solution space. We call our approach IP-AE. Its effectiveness is verified by comparing the experimental results with other well-known concept learning algorithms: AQ15 and C4.5.
this paper proposes agent-based formulation of a Supply Chain Management (SCM) system for manufacturing firms. We model each firm as an intelligent agent, which communicates each other through the blackboard architect...
详细信息
the proceedings contain 142 papers. the special focus in this conference is on Invited Talks;logic and Reasoning;Knowledge Representation and Search;Ontology. the topics include: Biomedical Artificial Intelligence;Ele...
ISBN:
(纸本)3540228179
the proceedings contain 142 papers. the special focus in this conference is on Invited Talks;logic and Reasoning;Knowledge Representation and Search;Ontology. the topics include: Biomedical Artificial Intelligence;Electronics Institutions: Methodology of Multi-agent Systems Development;the Happy Searcher;On the Intended Interpretations of Actions;Temporal Linear logic for Symbolic Agent Negotiation;Dealing with Inconsistent Secure Messages;Answer Set Computation Based on a Minimal Model Generation theorem Prover;What Is a Qualitative Calculus? A General Framework;Qualitative Direction Calculi with Arbitrary Granularity;Power of Brute-Force Search in Strongly-Typed Inductive Functional programming Automation;Ontology Services-Based Information Integration in Mining Telecom Business Intelligence;Indexing Approach for Delivery Demands with Time Constraints;An Hierarchical Terrain Representation for Approximately Shortest Paths;Agents Embodying a Category-Based Learning Process for the ITS Tutor to Self-improve Its Instructional Plans;Circuit Consistencies;Solving Over-Constrained Temporal Reasoning Problems Using Local Search;Methods of Automatic Algorithm Generation;A Novel Heuristic to Solve IA Network by Convex Approximation and Weights;Applying An Improved Heuristic Based Optimiser to Solve a Set of Challenging University Timetabling Problems;Extending Unit Propagation Look-Ahead of DPLL Procedure;Extended Nearest Feature Line Classifier;An Iterative Empirical Classification Scheme;Accelerating Linear Causal Model Discovery Using Hoeffding Bounds;Constrained Variables from Positive Data;Fast Incremental Learning of Linear Model Trees;A Modified Incremental Principal Component Analysis for On-Line Learning of Feature Space and Classifier and Probability Based Genetic programming for Multiclass Object Classification.
We studied the many-valued argumentation frameworks. they allow agents to make arguments with self or other agents under uncertain knowledge which is to be represented in the expressive EGAP (Extended Generalized Anno...
详细信息
We have developed a language called DCPP (Definite Clauses for Planning Processes) to represent knowledge concerning situations changing due to a process. the knowledge coded by DCPP is translated into definite clause...
详细信息
the rules of classical logic may be formulated in pairs corresponding to De Morgan duals: rules about & are dual to rules about V. A line of work, including that of Filinski (1989), Griffin (1990), Parigot (1992),...
详细信息
ISBN:
(纸本)9781581137569
the rules of classical logic may be formulated in pairs corresponding to De Morgan duals: rules about & are dual to rules about V. A line of work, including that of Filinski (1989), Griffin (1990), Parigot (1992), Danos, Joinet, and Schellinx (1995), Selinger (1998,2001), and Curien and Herbelin (2000), has led to the startling conclusion that call-by-value is the de Morgan dual of call-by-name. this paper presents a dual calculus that corresponds to the classical sequent calculus of Gentzen (1935) in the same way that the lambda calculus of Church (1932,1940) corresponds to the intuitionistic natural deduction of Gentzen (1935). the paper includes crisp formulations of call-by-value and call-by-name that are obviously dual;no similar formulations appear in the literature. the paper gives a CPS translation and its inverse, and shows that the translation is both sound and complete, strengthening a result in Curien and Herbelin (2000). Note. this paper uses color to clarify the relation of types and terms, and of source and target calculi. If the URL below is not in blue, please download the color version, which can be found in the ACM Digital Library archive for ICFP 2003, at http://***/proceedings/icfp/archive, or by googling 'wadler dual'.
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differences in the programming effectiveness o...
详细信息
ISBN:
(纸本)9781581137569
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differences in the programming effectiveness of two populations of students: (1) those who studied discrete mathematics through examples focused on reasoning about software and (2) those who studied the same mathematical topics illustrated with more traditional examples. Functional programming played a central role in the study because it provides a straightforward framework for the presentation of concepts such as predicate logic and proof by induction. Such topics can be covered in depth, staying almost entirely within the context of reasoning about software. the intricate complexities in logicthat mutable variables carry withthem need not arise, early on, to confuse novices struggling to understand new ideas. In addition, because functional languages provide useful and compact ways to express mathematical concepts, and because the choice of notation in mathematics courses is often at the discretion of the instructor (in contrast to the notational restrictions often fiercely guarded by the faculty in programming courses), discrete mathematics courses, as they are found in most computer science programs, provide an easy opportunity to enhance the education of students by exposing them to functional programming concepts.
暂无评论