this paper proposes the design and Paramics-based evaluation of a two-stage fuzzy logic traffic signal controller (TSTFC) for an isolated intersection. the fuzzy controller employs traffic intensity-based two stage fu...
详细信息
Modern digital circuits consist of logic gates implemented in the complementary metal oxide semiconductor (C-MOS) technology. the time taken for a logic gate output to change after one or more inputs have changed is c...
详细信息
ISBN:
(纸本)0769522645
Modern digital circuits consist of logic gates implemented in the complementary metal oxide semiconductor (C-MOS) technology. the time taken for a logic gate output to change after one or more inputs have changed is called the delay of the gate. A conventional CMOS gate is designed to have the same input to output delay irrespective of which input caused the output to change. We propose a new gate design that has different delays along various input to output paths within the gate. this is accomplished by inserting selectively sized "permanently on" series. transistors at the inputs of the logic gate. We demonstrate the use of the variable input delay CMOS gates for a totally glitch-free minimum dynamic power implementation of a digital circuit. Applying a previously described linear programming method to the c7552 benchmark circuit, we obtained a power saving of 58% over an unoptimized design. this power consumption was 18% lower than that for an alternative low power design using conventional CMOS gates. All circuits had the same overall delay. Since the overall delay was not allowed to increase, the glitch elimination with conventional gates required insertion of delay buffers on non-critical paths. the use of the variable input delay gates drastically reduced the required number of delay buffers.
the proceedings contain 8 papers. the special focus in this conference is on Rules and Reasoning. the topics include: On the Complexity of Learning Description logic Ontologies;explanation via Machine Arguing;stream R...
ISBN:
(纸本)9783030600662
the proceedings contain 8 papers. the special focus in this conference is on Rules and Reasoning. the topics include: On the Complexity of Learning Description logic Ontologies;explanation via Machine Arguing;stream Reasoning: From theory to Practice;temporal Ontology-Mediated Queries and First-Order Rewritability: A Short Course;an Introduction to Answer Set programming and Some of Its Extensions;declarative Data Analysis Using Limit Datalog Programs.
the proceedings contain 30 papers. the special focus in this conference is on Foundations of Software Technology and theoretical Computer Science. the topics include: Replacement in monotone Boolean networks: An algeb...
ISBN:
(纸本)9783540138839
the proceedings contain 30 papers. the special focus in this conference is on Foundations of Software Technology and theoretical Computer Science. the topics include: Replacement in monotone Boolean networks: An algebraic perspective;A new characterization of BPP;treating terminals as function values of time;logics of knowledge, games and dynamic logic;persistent first class procedures are enough;abstraction concepts for modeling screen oriented dialogue interfaces;VLSI systems for design rule checks;bounds on the length of convex partitions of polygons;On mapping cube graphs onto VLSI arrays;logical specification and implementation;a linear-time algorithm for determining the intersection type of two star polygons: Extended abstract;eliminating cascading rollback in structured databases;recognition and top-down generation of β-acyclic database schemes;universal and representative instances using unmarked nulls;on some computational problems related to data base coding;generic oracles;approximation algorithm for maximum independent set in planar traingle-free graphs;grid file algorithms: An analysis in the biased case;on the mean weight balance factor of binary trees;an efficient algorithm for random sampling without replacement;process specification of logic programs;proof rules for communication abstractions;functional programming systems revisited;models and transformations for nondeterministic extensions of functional programming;degrees of non-determinism and concurrency: A Petri net view;proof rules for communication abstractions;a distributed algorithm for detecting communication deadlocks;on the existence and construction of robust communication protocols for unreliable channels.
this work presents the development of a new systematic technique to target fresh water consumption and wastewater generation for systems involving multiple contaminants when all options of water minimization including...
详细信息
We describe an abstract proof-theoretic framework based on normal-form proofs, defined using well-founded orderings on proof objects. this leads to robust notions of canonical presentation and redundancy. Fairness of ...
详细信息
ISBN:
(纸本)9783540710691
We describe an abstract proof-theoretic framework based on normal-form proofs, defined using well-founded orderings on proof objects. this leads to robust notions of canonical presentation and redundancy. Fairness of deductive mechanisms - in this general framework - leads to completeness or saturation. the method has so far been applied to the equational, Horn-clause, and deduction-modulo cases.
In constraint programming, a priori choices statically determine strategies that are crucial for resolution performances. However, the effect of strategies is generally unpredictable. We propose to dynamically change ...
详细信息
ISBN:
(纸本)3540298967
In constraint programming, a priori choices statically determine strategies that are crucial for resolution performances. However, the effect of strategies is generally unpredictable. We propose to dynamically change strategies showing bad performances. When this is not enough to improve resolution, we introduce some meta-backtracks. Our goal is to get good performances without the know-how of experts. Some first experimental results show the effectiveness of our approach.
In their Unifying theories of programming (UTP), Hoare & He use the alphabetised relational calculus to give denotational semantics to a wide variety of constructs taken from different programming paradigms. A key...
详细信息
ISBN:
(纸本)3540213775
In their Unifying theories of programming (UTP), Hoare & He use the alphabetised relational calculus to give denotational semantics to a wide variety of constructs taken from different programming paradigms. A key concept in their programme is the design: the familiar precondition-postcondition pair that describes the contract between a programmer and a client. We give a tutorial introduction to the theory of alphabetised relations, and its sub-theory of designs. We illustrate the ideas by applying them to theories of imperative programming, including Hoare logic, weakest preconditions, and the refinement calculus.
A system for controlling the traffic lights in an urban network is described. the system consists of a control unit that governs the traffic lights at a single intersection. the behavior of each control unit is govern...
详细信息
A system for controlling the traffic lights in an urban network is described. the system consists of a control unit that governs the traffic lights at a single intersection. the behavior of each control unit is governed by a logic program. the decision process of each control unit is independent from other control units, and is based on the traffic conditions of the streets that converge in the intersection. A developing system called FasTraC (Fast Traffic Control) has been created to provide the designer with a powerful tool to develop and maintain the control units of the decentralized control system.
暂无评论