this paper describes the architecture of a time-multiplexed Programmable Array logic (PLA) designed for structured ASIC technology. Time multiplexing is realized by storing sixteen PLA configurations in on-chip memory...
详细信息
ISBN:
(纸本)9781424484584
this paper describes the architecture of a time-multiplexed Programmable Array logic (PLA) designed for structured ASIC technology. Time multiplexing is realized by storing sixteen PLA configurations in on-chip memory. this inactive an-chip memory is distributed around the chip allowing single cycle configuration change and it can be accessed either from off -chip or from internal logic. functional testing proves that the structure can be used to emulate multiple independent, communicating designs in virtual hardware environment. Implementation results on structured ASIC validated the solution from both area and timing perspective.
Graphics Processing Units (GPUs) are gaining popularity for parallelization of general purpose applications. GPUs are massively parallel processors with huge performance in a small and readily available package. At th...
详细信息
Context-aware application should behave suitably according to the changing context of the pervasive computing environment. Several programming paradigms and languages have been proposed to facilitate development of co...
详细信息
Context-aware application should behave suitably according to the changing context of the pervasive computing environment. Several programming paradigms and languages have been proposed to facilitate development of co...
详细信息
ISBN:
(纸本)9781424447763
Context-aware application should behave suitably according to the changing context of the pervasive computing environment. Several programming paradigms and languages have been proposed to facilitate development of context-aware application, but they are either lack of sufficient flexibility or somewhat complex to program. A table-driven programming paradigm is proposed in this paper to overcome shortcomings of those approaches. Virtual tables constructed and maintained by system connect knowledge of both developer and space manager while separate dependency between context and application logic from base program. Validation and evaluation show that the paradigm is easy to be implemented and deployed, meanwhile brings better usability and adaptability.
the proceedings contain 22 papers. the topics discussed include: solving the wise mountain man riddle with answer set programming;a general framework for revising belief bases using qualitative Jeffrey9;s rule;comb...
ISBN:
(纸本)9780980284065
the proceedings contain 22 papers. the topics discussed include: solving the wise mountain man riddle with answer set programming;a general framework for revising belief bases using qualitative Jeffrey's rule;combining motion planning with an action formalism;tractable first-order Golog with disjunctive knowledge bases;a psychological study of comparative non-monotonic preferences semantics;a semantical account of progression in the presence of defaults;Parthood simpliciter vs. temporary Parthood;evaluation of epilog: a reasoner for episodic logic;a BDI agent architecture for a POMDP planner;defaults in action: non-monotonic reasoning about states in action calculi;progressing basic action theories with non-local effect actions;next steps in propositional horn contraction;modelling cryptographic protocols in a theory of action;on joint ability in the presence of sensing;and definability and process ontologies.
this paper presents a novel methodology to obtain the entire power versus delay tradeoff curve for the critical paths of a combinational logic circuit in a very efficient way using genetic algorithm (GA). In order to ...
详细信息
this paper presents a novel methodology to obtain the entire power versus delay tradeoff curve for the critical paths of a combinational logic circuit in a very efficient way using genetic algorithm (GA). In order to evaluate the proposed GA method a wide set of two-level and multi-level networks from the MCNC'91 benchmark suite was processed. the proposed optimization using the GA methodology is several times better than linear programming (LP) technique in terms of CPU time. On the other hand the minimum power dissipation obtained by GA and LP methods are very close to each other to within 0.3%.
Narrowing extends rewriting withlogic capabilities by allowing logic variables in terms and replacing matching with unification. Narrowing has been widely used in different contexts, ranging from theorem proving to l...
详细信息
ISBN:
(数字)9783540789697
ISBN:
(纸本)9783540789680
Narrowing extends rewriting withlogic capabilities by allowing logic variables in terms and replacing matching with unification. Narrowing has been widely used in different contexts, ranging from theorem proving to language design. Surprisingly, the termination of narrowing has been mostly overlooked. In this paper, we present a new approach for analyzing the termination of narrowing in left-linear constructor systems-a widely accepted class of systems-that allows us to reuse existing methods in the literature on termination of rewriting.
Since linear logic was proposed by Girard, a number of type systems inspired by linear logic (or substructural logics in general) have been proposed. Examples include linear type systems, where the weakening and contr...
详细信息
ISBN:
(数字)9783540789697
ISBN:
(纸本)9783540789680
Since linear logic was proposed by Girard, a number of type systems inspired by linear logic (or substructural logics in general) have been proposed. Examples include linear type systems, where the weakening and contraction rules are restricted, and ordered type systems, where the exchange rule is also restricted. those type systems turned out to be very useful for reasoning about temporal properties of programs, like a memory cell is deallocated only once, or a memory cell is never read or written after it is deallocated. In this talk, I will focus on substructural type systems for program analysis, and review their principles and applications [1,2,3,4,5]. 1 will also discuss some emerging techniques and future directions of substructural-type-based program analysis.
Uncertainty in logicprogramming has been investigated since about 25 years, publishing papers dealing with various approaches to semantics and different applications. this paper is intended as a first step towards th...
详细信息
ISBN:
(数字)9783540789697
ISBN:
(纸本)9783540789680
Uncertainty in logicprogramming has been investigated since about 25 years, publishing papers dealing with various approaches to semantics and different applications. this paper is intended as a first step towards the investigation of uncertainty in Constraint functionallogicprogramming. We revise an early proposal, namely van Emden's Quantitative logicprogramming [22], and we improve it in two ways. Firstly, we generalize van Emden's QLP to a generic scheme QLP(D) parameterized by any given Qualification Domain D, which must be a lattice satisfying certain natural axioms. We present several interesting instances for D, one of which corresponds to van Emden's QLP. Secondly, we generalize van Emden's results by providing stronger ones, concerning both semantics and goal solving. We present Qualified SLD Resolution over D, a sound and strongly complete goal solving procedure for QLP(D), which is applicable to open goals and can be efficiently implemented using CLP technology over any constraint domain C-D able to deal with qualification constraints over D. We have developed a prototype implementation for van Emden's QLP as an instance of QLP(D), on top of the CFLP system TOY.
Finite maps or finite relations between infinite sets do not even form a category, since the necessary identities are not finite. We show relation-algebraic extensions of semigroupoids where the operations that would ...
详细信息
Finite maps or finite relations between infinite sets do not even form a category, since the necessary identities are not finite. We show relation-algebraic extensions of semigroupoids where the operations that would produce infinite results have been replaced with variants that preserve finiteness, but still satisfy useful algebraic laws. the resulting theories allow calculational reasoning in the relation-algebraic style with only minor sacrifices;our emphasis on generality even provides some concepts in theories where they had not been available before. the semigroupoid theories presented in this paper also can directly guide library interface design and thus be used for principled relation-algebraic programming;an example implementation in Haskell allows manipulating finite binary relations as data in a point-free relation-algebraic programming style that integrates naturally withthe current Haskell collection types. this approach enables seamless integration of relation-algebraic formulations to provide elegant solutions of problems that, with different data organisation, are awkward to tackle. (C) 2007 Elsevier Inc. All rights reserved.
暂无评论