Wednesday, March 4, 2015

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía
 

rss_1.0 Clasificación por Disciplina

Nomenclatura Unesco > (11) Lógica

Mostrando recursos 121 - 140 de 140,063

121. Hybrid Silicon Nanotechnologies for More-than-Moore and Beyond-CMOS Domains - Hiroshi Mizuta; Yoshishige Tsuchiya
The dawn of the silicon nanoelectronics was seen when the physical gate length of high-performance of CMOS got shorter than 100 nm in 1999 after continuous down-scaling over the last few decades under Moore’s Law. The latest International Technology Roadmap for Semiconductors [1] predicts that such top-down approach will be pursued further in the nanoelectronics regime- known as ‘More Moore ’ approach-and the CMOS gate length will reach 9 nm in 2016. However, maintaining such aggressive top-down trend is getting increasingly difficult both technologically and economically because a number of new “technology boosters ” should be introduced for the next...

122. Alferes. Fault Diagnosis of Distributed Systems using Logic Programming. Procs. VI Simposio de Computadores Tolerantes a Falhas - Iara De Almeida Móra; Jose ́ Alferes
The diagnosis process consists of discovering the differences between the expected and the real behavior of a system unit, and to identify their faulty components. In this paper we report on the experience of using extended logic programming to build an implementation for diagnosing distributed computer systems. Some issue of the diagnosis process are automatically dealt by the contradiction removal methods developed for extended logic programming and the form of the resulting program is rather simple and has a very clear and declarative reading. Resumo O processo do diagnóstico consiste em determinar as diferenças entre o com-portamento esperado e o...

123. INTELLIGENT CONTROLLER FOR MAGNETOSTRICTIVE MICROPOSITIONING DEVICE FOR ULTRA-PRECISION - J. C. Campos Rubio; J. G. Duduch; F. G. Santoro; A. V. Porto; A. E. Gee
Generally, requirements such as high performance and small sizes for mechatronic systems, have led modern industry to design positioning systems with better characteristics of acceleration and positioning accuracy. The increasing demand for components with better metrological and finishing characteristics such as x-ray and infra-red lenses, has prompted the development of a number of types of micropositioning systems that are able to move machine elements in very small displacements with high levels of accuracy. In this work, it is proposed the use of a new type of actuator, which employs the properties of electromagnetic strain of certain metallic alloys (magnetostrictive actuators)....

124. DELIA: Deduction and programming in - Programa Nacional; Manuel Ojeda Aciego; David Pearce; Univ Rey; Juan Carlos
This project deals with the study of mathematical foundations, as well as deduction and programming, for several types of non-classical logics, especially multiple-valued logics and in-termediate logics, with the aim of providing means for intelligent management of information. The classical problem of deduction is, given explicit knowledge expressed in a given formal-ism together with a set of inference rules, to deduce the implicit knowledge which could be relevant for applications. Specifically, we are interested in those knowledge bases containing uncertain or incomplete information, to develop mechanisms of analysis in which vague or imprecise queries are permitted. A first formal framework...

125. Investigating the Complexity of Various Quantum Incrementer Circuits - Presented Carlos; Manuel Torres; Mentor Dr. Selman Hershfield
Implementing Shor's Algorithm with quantum circuits involves many complex operations such as addition and modular exponentiation. The variety and complexity of the quantum gates involved are tremendous. The quantum incrementer is the simplest nontrivial quantum circuit which exhibits basic arithmetic operations such as addition, carry propagation, and the reset of carry, or auxiliary, bits. These operations are ubiquitous in quantum computing; thus, an investigation of this simplest case, the quantum incrementer, offers fundamental insight which can be used to build more complicated circuits. An analysis of various 4-bit incrementer circuits is presented, and is generalized to the n-bit case. Three...

126. SSBDDs: Advantageous Model and Efficient Algorithms for Digital Circuit Modeling, Simulation & Test - A. Jutman; J. Raik; R. Ubar
In this paper we sum up the research that was done during the last decade on the topic of Structurally Synthesized Binary Decision Diagrams (SSBDDs). We describe general properties of SSBDDs that make this model very efficient for circuit structure dependent methods and algorithms. In addition, we describe a deterministic test generation algorithm based on SSBDDs and four efficient simulation methods of different classes: logic simulation, multi-valued simulation, timing simulation, and fault simulation. We investigate and show the origins of their common advantages and draw conclusions, which hold for all the described algorithms. The analysis is made on the basis...

127. Toward the Reconstruction of the Early History of Paraconsistent Logic: The Prerequisites of N.A.Vasiliev's Imaginary Logic
On the basis of recently unknown archive and manuscript documents the article reveals the informal and heuristic prerequisites of N.A.Vasiliev's imaginary logic. N.A.Vasiliev's imaginary logic (1908- 1914) became precursor of paraconsistent logic. His path to imaginary logic was steep and toilsome. The starting point of his way to be found in youth animations and "vague sensations " of the future scholar related to the radically new treatment of contradiction and approach to logic. At present moment we are able to reconstruct the very early history of N.A.Vasiliev's imaginary logic and its formal or informal prerequisites and heuristic prompts. It is...

128. The Logic of Interdisciplinary Studies - Sandra Mathison; Melissa Freeman; Sandra Mathison; Melissa Freeman
Wisconsin-Madison. Additional research is conducted at the Universities of Oklahoma and Washington.

129. On specifying semantics of visual spatial query languages - Volker Haarslev; Michael Wessel
We present a rst treatment dealing with semantics of vi-sual spatial queries languages for GIS using a suitable de-scription logic. This decidable space logic is described and its usefulness for GIS exemplied. The logic supports the speci cation of semantics, reasoning about query subsump-tion and about applying default knowledge. 1

130. Integration of Logic Synthesis and Layout processes by Generating Multiple Choices of Circuit Transformation - Hiroaki Yoshida; Motohiro Sera; Masao Kubo; Masahiro Fujita
In this paper, we propose a new methodology to inte-grate multiple circuit tranformations and routing processes. More specifically, this paper shows ways to utilize multi-ple choices of circuit transformations in routing processes. First, we introduce a new logic representation that imple-ments all possible wire reconnections implicitly by enhanc-ing global flow optimization techniques. Then we present two approaches for performing routing and wire recon-nection simultaneously: exact approach and practical ap-proach with commercial P/R tools. Since our methods take into account multiple circuit transformations during routing phase where the accurate physical information is available, we can obtain better results than the conventional...

131. Towards vague query answering in logic programming for logicbased information retrieval - Umberto Straccia
Abstract. We address a novel issue for logic programming, namely the problem of evaluating ranked top-k queries. The problem occurs for instance, when we al-low queries such as “find cheap hotels close to the conference location ” in which vague predicates like cheap and close occur. Vague predicates have the effect that each tuple in the answer set has now a score in [0,1]. We show how to compute the top-k answers in case the set of facts is huge, without evaluating all the tuples.

132. 1 THE LOGIC OF E-DELIBERATION PARTICIPATION BEYOND CIVIL SOCIETY - Evangelos Liotzis
The logic of e-deliberation exceeds the narrow limits of the so-called “expansion of the public sphere ” which did not lead to the widening of the decision-making processes, which are still run by designated groups. It suggests an opening of the policy-making procedure through electronic discussion forums. Having also in mind state’s need for legitimation (as particular reason for organizing public deliberations), it can be suggested that e-deliberation’s dimensions could lead to the broadening of participation referring to a remarkable group of people beyond civil society. Therefore, a two-way model consisted from the dimensions of the two basic facets of...

133. Cloning Composition and Logical Inference in Neural Networks Using Variable-Free Logic - Helmar Gust
In this paper, we will exemplify compositionality is-sues of neural networks using logical theories. The idea is to implement first-order logic on the neural level by using category theoretic methods in order to get a variable-free representation of logic with only one op-eration (composition). More precisely, logic as well as neural networks are represented as algebraic systems. On the underlying algebraic level it is possible to con-sider compositionality aspects of first-order logical for-mulas and their realization by a neural network. We will demonstrate the approach with some well-known logi-cal inferences using a straightforward implementation of a simple backpropagation network.

134. Urban metabolism and resource optimisation in the urban fabric: The BRIDGE methodology - Nektarios Chrysoulakis
Like any living system, urban communities consume material and energy inputs, process them into usable forms, and eliminate the wastes from the process. This can be seen as "metabolism " of industry, commerce, municipal opera-tions and households. Understanding the pattern of these energy and material flows through a community's economy provides a systemic reading of the present situation for goal and objective setting and development of indicators for sustainability. At present, planning policies often reflect the logic of the market. They would better reflect a vision of urban development, in which environmental and social considerations are fully embedded in spatial...

135. PASSENGER CAR POWERTRAIN: MODEL AND GEAR SHIFT LOGIC - G. Achtenová
The paper describes the modelling and validation of passenger car powertrain. The model is a part of research project focused on automatisation of passenger car transmission, design of a new shift system and solutions for optimal shift strategy.

136. A transformation based algorithm for ternary reversible logic synthesis using universally controlled ternary gates - Erik Curtis; Marek Perkowski
In this paper a synthesis algorithm for reversible ternary logic cascades is presented. The algorithm can find a solution for any reversible ternary function with n inputs and n outputs utilizing ternary inverter gates and the new (quantum realizable) UCTG gates which are a powerful generalization of ternary Toffoli gates and Generalized Ternary Gates [4]. The algorithm is an extension of the algorithm presented by Dueck, Maslov, and Miller in [3]. A unique feature of this algorithm is that it utilizes no extra wires to generate the outputs. A basic compaction algorithm is defined to improve the results of the...

137. A Framework for (Re)Deploying Components in Distributed Real-time and Embedded Systems - N. Shankarany; J. Balasubramaniany; D. Schmidty; G. Biswasy; P. Lardieriz; E. Mulholl; T. Damianoz
This paper describes the Resource Allocation and Control Engine (RACE) that integrates multiple resource manage-ment algorithms for (re)deploying and managing performance of application components in distributed real-time and em-bedded (DRE) systems. RACE enables DRE systems to (re)con gure allocation and control algorithms depending on application characteristics and environmental conditions. It also enables developers to focus on algorithm logic, while reusing many mechanisms used to (re)congure and (re)depl-oy the algorithms on distributed computing nodes. 1.

138. PROFILES IN LOGIC AND MATHEMATICAL PERFORMANCE IN CALCULUS TASKS BY GRADUATE STUDENTS - Marc Rogalski; Janine Rogalski; Université De
The role of proof in maths education has been stressed in numerous studies (Hanna, 2000). In a previous study (Rogalski & Rogalski, 2001) we showed the difficulties students encountered when dealing with implications with a false premise, a case that appears in advanced mathematics. Durand-Guerrier (2003) also emphasises the specific complexity of an implication P(x)=>Q(x), where property P can be or not be satisfied by the objects under analysis. This is often the case in calculus with quantified assertions. Studies concerning this level strongly suggest that there are strong relationships between students ’ logical and mathematical competence. The study which...

139. Functional decomposition of MVL functions using multi-valued decision diagram - Craig Files; Rolf Drechsler; Marek A. Perkowski
In this paper, the minimization of incompletely speci-fied multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning samples can be implemented as minterms in multi-valued logic. The representation, can then be decomposed into smaller blocks, resulting in a reduced problem complexity. This gives induced descriptions through structuring, or fea-ture extraction, of a learning problem. Our approach to the decomposition is based on expressing a multi-valued func-tion (learning problem) in terms of a Multi-valued Decision Diagram that allows the use of Don’t Cares. The inclusion of Don’t Cares is the emphasis for this paper since multi-valued...

140. Complementary self-biased scheme for the robust design of cmos/set hybrid multi-valued logic - Ki-whan Song; Sang Hoon Lee; Dae Hwan Kim; Kyung Rok Kim; Jaewoo Kyung; Gwanghyeon Baek; Chun-an Lee; Jong Duk Lee; Byung-gook Park
We propose a new technique to enhance the characteristics of CMOS/SET hybrid multi-valued logic (MVL) circuits in terms of their stability and performance. A complementary self-biasing method enables the SET/CMOS logic to operate perfectly well at high temperature in which the peak-to-valley current ratio of Coulomb oscillation severely decreases. The suggested scheme is evaluated by SPICE simulation with an analytical SET model, and it is confirmed that even SETs with a large Si island can be utilized efficiently in the multi-valued logic. We demonstrate a quantizer implemented by SETs with a 90-nm-long Si island on the basis of measured device...

Página de resultados:
 

Busque un recurso