We studied effects of nitrogen incorporation in high-k stack gate structures on the program/erase current and retention current for performance improvement of nanoscale nonvolatile memory devices, using a numerical mo...
详细信息
ISBN:
(纸本)9781424421039
We studied effects of nitrogen incorporation in high-k stack gate structures on the program/erase current and retention current for performance improvement of nanoscale nonvolatile memory devices, using a numerical model based on solutions to the Schrodinger-Poisson equations. In particular, comparisons are made for gate current behavior with different tunnel barrier stacks and materials. the changes of the barrier height and dielectric constant in the high-k dielectric stacks enable us to obtain favorable program/erase current and retention current to satisfy the requirements for nonvolatile memory devices. We found that a suitable range of the nitrogen content will enable boththe basic requirements for programming and data retention to be satisfied.
Ontario Power Generation Nuclear (OPGN) has a 4 x 880 MWe CANDU nuclear station at its Darlington Nuclear Division located in Bowmanville. the station has been operating a Tritium Removal Facility (TRF) and a D2O stat...
Ontario Power Generation Nuclear (OPGN) has a 4 x 880 MWe CANDU nuclear station at its Darlington Nuclear Division located in Bowmanville. the station has been operating a Tritium Removal Facility (TRF) and a D2O station Upgrading Plant (SUP) since 1989. Both facilities were designed with a Distributed Control System (DCS) and programmable logic controllers (PLC) for process control. this control system was replaced with a DCS only, in 1998. A dynamic plant simulator was developed for the Darlington TRF (DTRF) and the SUP, as part of the computer control system replacement. the simulator was used to test the new software, required to eliminate the PLCs. the simulator is now used for operator training and testing of process control software changes prior to field installation. Dynamic simulation will be essential for the ITER isotope separation system, where the process is more dynamic than the relatively steady-state DTRF process. this paper describes the development and application of the DTRF and SUP dynamic simulator, its benefits, architecture, and the operational experience withthe simulator.
A Kripke Semantics is defined for a higher-order logicprogramming language with constraints, based on Church's theory of Types and a generic constraint formalism. Our syntactic formal system, hoHH(C) (higher-orde...
详细信息
ISBN:
(纸本)9783540732273
A Kripke Semantics is defined for a higher-order logicprogramming language with constraints, based on Church's theory of Types and a generic constraint formalism. Our syntactic formal system, hoHH(C) (higher-order hereditary Harrop formulas with constraints), which extends lambda Prolog's logic, is shown sound and complete. A Kripke semantics for equational reasoning in the simply typed lambda-calculus (Kripke Lambda Models) was introduced by Mitchell and Moggi in 1990. Our model theory extends this semantics to include full impredicative higher-order intuitionistic logic, as well as the executable hoHH fragment with typed lambda-abstraction, implication and universal quantification in goals and constraints. this provides a Kripke semantics for the full higher-order hereditarily Harrop logic of lambda Prolog as a special case (withthe constraint system chosen to be,13,beta,eta-conversion).
In the first part of the paper I investigate categorical models of multiplicative biadditive intuitionistic linear logic, and note that in them some surprising coherence laws arise. the thesis for the second part of t...
详细信息
ISBN:
(纸本)9783540732273
In the first part of the paper I investigate categorical models of multiplicative biadditive intuitionistic linear logic, and note that in them some surprising coherence laws arise. the thesis for the second part of the paper is that these models provide the right framework for investigating differential structure in the context of linear logic. Consequently, within this setting, I introduce a notion of creation operator (as considered by physicists for bosonic Fock space in the context of quantum field theory), provide an equivalent description of creation operators in terms of creation maps, and show that they induce a differential operator satisfying all the basic laws of differentiation (the product and chain rules, the commutation relations, etc.).
In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the lambda-calculus, ...
详细信息
ISBN:
(纸本)9783540732273
In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the lambda-calculus, specifically a variant which manipulates formally "applicative contexts" and inverts the associativity of "applicative terms". Herbelin worked with a fragment of sequent calculus with constraints on left introduction. In this paper we complete Herbelin's programme for full sequent calculus, that is, sequent calculus without the mentioned constraints, but where permutative conversions necessarily show up. this requires the introduction of a lambda-like calculus for full sequent calculus and an extension of natural deduction that gives meaning to "applicative contexts" and "applicative terms". Such extension is a calculus with modus ponens and primitive substitution that refines von Plato's natural deduction;it is also a "coercion calculus", in the sense of Cervesato and Pfenning. the proof-theoretical outcome is noteworthy: the puzzling relationship between cut and substitution is settled;and cut-elimination in sequent calculus is proven isomorphic to normalisation in the proposed natural deduction system. the isomorphism is the mapping that inverts the associativity of applicative terms.
A system of rule extraction out of a complex hierarchical classifier is proposed in this paper. there are several methods for rule extraction out of trained artificial neural networks (ANN's), but these methods do...
详细信息
ISBN:
(纸本)9783540715894
A system of rule extraction out of a complex hierarchical classifier is proposed in this paper. there are several methods for rule extraction out of trained artificial neural networks (ANN's), but these methods do not scale well, i.e. results are satisfactory for small problems. For complicated problems hundreds of rules are produced, which are hard to govern. In this paper a hierarchical classifier with a tree-like structure and simple ANN's at nodes, is presented, which splits the original problem into several sub-problems that overlap. Node classifiers are all weak (i.e. with accuracy only better than random), and errors are corrected at lower levels. Single sub-problems constitute of examples that were hard to separate. Such architecture is able to classify better than single network models. At the same time IF-thEN rules are extracted, which only answer which sub-problem a given example belongs to. Such rules, by introducing hierarchy, are simpler and easier to modify by hand, giving also a better insight into the original classifier behaviour.
Wireless sensor networks (WSNs) are evolving to support sense-and-react applications, where actuators are physically interspersed withthe sensors that trigger them. this solution maximizes localized interactions, imp...
详细信息
ISBN:
(纸本)9783540767770
Wireless sensor networks (WSNs) are evolving to support sense-and-react applications, where actuators are physically interspersed withthe sensors that trigger them. this solution maximizes localized interactions, improving resource utilization and reducing latency w.r.t. solutions with a centralized sink. Nevertheless, application development becomes more complex: the control logic must be embedded in the network, and coordination among multiple tasks is needed to achieve the application goals. this paper presents TeenyLIME, a WSN middleware designed to address the above challenges. TeenyLIME provides programmers withthe high-level abstraction of a tuple space, enabling data sharing among neighboring devices. these and other WSN-specific constructs simplify the development of a wide range of applications, including sense-and-react ones. TeenyLIME yields simpler, cleaner, and more reusable implementations, at the cost of only a very limited decrease in performance. We support these claims through a source-level, quantitative comparison between implementations based on TeenyLIME and on mainstream approaches, and by analyzing measures of processing overhead and power consumption obtained through cycle-accurate emulation.
Wireless sensor networks (WSNs) are evolving to support sense-and-react applications, where actuators are physically interspersed withthe sensors that trigger them. this solution maximizes localized interactions, imp...
详细信息
ISBN:
(纸本)9783540767770
Wireless sensor networks (WSNs) are evolving to support sense-and-react applications, where actuators are physically interspersed withthe sensors that trigger them. this solution maximizes localized interactions, improving resource utilization and reducing latency w.r.t. solutions with a centralized sink. Nevertheless, application development becomes more complex: the control logic must be embedded in the network, and coordination among multiple tasks is needed to achieve the application *** paper presents TeenyLIME, a WSN middleware designed to address the above challenges. TeenyLIME provides programmers withthe high-level abstraction of a tuple space, enabling data sharing among neighboring devices. these and other WSN-specific constructs simplify the development of a wide range of applications, including sense-and-react ones. TeenyLIME yields simpler, cleaner, and more reusable implementations, at the cost of only a very limited decrease in performance. We support these claims through a source-level, quantitative comparison between implementations based on TeenyLIME and on mainstream approaches, and by analyzing measures of processing overhead and power consumption obtained through cycle-accurate emulation.
Genetic Parallel programming (GPP) is a novel Genetic programming paradigm. Based on the GPP paradigm and a local search operator - FlowMap, a logic circuit synthesizing system integrating GPP and FlowMap, a Hybridize...
详细信息
ISBN:
(纸本)9781595931863
Genetic Parallel programming (GPP) is a novel Genetic programming paradigm. Based on the GPP paradigm and a local search operator - FlowMap, a logic circuit synthesizing system integrating GPP and FlowMap, a Hybridized GPP based logic Circuit Synthesizer (HGPPLCS) is developed. To show the effectiveness of the proposed HGPPLCS, six combinational logic circuit problems are used for evaluations. Each problem is run for 50 times. Experimental results show that boththe lookup table counts and the propagation gate delays of the circuits collected are better than those obtained by conventional design or evolved by GPP alone. For example, in a 6-bit one counter experiment, we obtained combinational digital circuits with8 four-input lookup tables in 2 gate level on average. It utilizes 2 lookup tables and 3 gate levels less than circuits evolved by GPP alone.
the proceedings contain 39 papers. the topics discussed include: nonmonotonic reasoning in FLORA-2;data integration and answer set programming;unfounded sets for disjunctive logic programs with arbitrary aggregates;on...
详细信息
ISBN:
(纸本)3540285385
the proceedings contain 39 papers. the topics discussed include: nonmonotonic reasoning in FLORA-2;data integration and answer set programming;unfounded sets for disjunctive logic programs with arbitrary aggregates;on modular translations and strong equivalence;guarded open answer set programming;external sources of computation for answer set solvers;answer sets for propositional theories;on the local closed-world assumption of data-sources;game-theoretic reasoning about actions in nonmonotic causal theories;some logical properties of nonmonotic causal theories;solving hard ASP programs efficiently;mode-directed fixed point computation;nested epistemic logic programs;and a social semantics for multi-agent systems.
暂无评论