Nomenclatura Unesco > (11) Lógica
http://biblioteca.universia.net/html_bura/vernivel/params/nivel/11.html
Mostrando recursos 1 - 20 de 139,690esUniversia Recursos de Aprendizajehttp://biblioteca.universia.net/img/logotipo.jpg
http://biblioteca.universia.net/
Pensamiento científico-creativo y rendimiento académico
http://biblioteca.universia.net/html_bura/ficha/params/title/pensamiento-cientifico-creativo-rendimiento-academico/id/60642211.html
http://revistas.udc.es/index.php/reipe/article/view/24El objetivo del trabajo es estudiar la relación del constructo de pensamiento científico-creativo con el rendimiento académico en una muestra de alumnos adolescentes. Además de ello, se analizará la fiabilidad de la prueba de pensamiento científico-creativo que se va a utilizar en el presente trabajo. En el estudio participaron 98 estudiantes (12-16 años) de un instituto de Educación Secundaria de la Región de Murcia (España). Los instrume...Ruiz, María José; Ferrándiz García, Carmen; Soto Martínez, Gloria; Bermejo García, María Rosario; Sainz Gómez, MartaOptimal Latch Mapping and Retiming within a Tree
http://biblioteca.universia.net/html_bura/ficha/params/title/optimal-latch-mapping-and-retiming-within-tree/id/60641968.html
Abstract. We propose a technology mapping algorithm that takes existing structural tech-nology-mapping algorithms based on dynam-ic programming [1,3,4] and extends them to retime pipelined circuits. If the circuit to be mapped has a tree structure, our algorithm generates an optimal solution compatible with that structure. The algorithm takes into account gate delays and capacitive loads as latches are moved across the logic. It also supports latches with embedded logic: i.e., cells that comb...Joel Grodstein; Eric Lehman; Heather Harkness; Herve Touati; Bill GrundmannSERGOT: A LOGIC PROGRAMMING FRAMEWORK FOR MODELING TEMPORAL OBJECTS 741 F. Nihan Kesim received t...
http://biblioteca.universia.net/html_bura/ficha/params/title/sergot-logic-programming-framework-for-modeling-temporal-objects-741-f/id/60641716.html
Abstract-We present a general approach for modeling temporal aspects of objects in a logic programming framework. Change is formulated in the context of a database which stores explicitly a record of all changes that have occurred to objects and thus (implicitly) all states of objects in the database. A snapshot of the database at any given time is an object-oriented database, in the sense that it supports an object-based data model. An object is viewed as a collection of simple atomic formul...F. Nihan Kesim; E Computer Society; Marek SergotDECISION AND CONTROL MODEL – CASE OF NATIONAL HIGHWAY NETWORK REALISATION PROCESS
http://biblioteca.universia.net/html_bura/ficha/params/title/decision-and-control-model-–-case-of-national-highway-network/id/60641684.html
Abstract: The purpose of this contribution is to establish a unique system of management control over the highway realisation process through both preliminary and building phases. It favours the idea of an intensive, uniform and complete control through all stages in the project. This control model respects the guidelines of quality assurance as defined in ISO 9001 as well as the quality control of the project investment product. Special emphasis is laid on all actions associated with a buil...Generalized Delay Optimization of Resistive Interconnections through an Extension of Logical Effort
http://biblioteca.universia.net/html_bura/ficha/params/title/generalized-delay-optimization-of-resistive-interconnections-through-an-extension-of/id/60641504.html
Abshrrct: Resistance of VLSI interconnections has become sig-nificant due to large die sizes and sub-mkm geometries in high performance designs. Previous studies have proposed optimal repeater schemes wing slmple buffers for delay optimization of the interconnection. This paper proposes a more general approach that handles arbitrary logic gates as well as buffers. The methodology is based on an extension of the concept of logi-cal effort. The optimization yields proper spacing of the given lo...Kumar VenkatPULSE SELECTION CONTROL FOR THE IR FEL PHOTOCATHODE DRIVE LASER
http://biblioteca.universia.net/html_bura/ficha/params/title/pulse-selection-control-for-the-ir-fel-photocathode-drive-laser/id/60641414.html
The method for current control of a photocathode source is described. This system allows for full remote control of a photocathode drive laser for resulting electron beam currents ranging from less than one microamp to a full current of five milliamps. All current modes are obtained by gating the drive laser with a series of electro-optical cells. The system remotely generates this control signal by assuming a mode of operation with the following properties selectable: Current mode as continu...Summary
http://biblioteca.universia.net/html_bura/ficha/params/title/summary/id/60641409.html
This contribution1 examines the different actions taken by Belgian authorities intended directly or indirectly to effect the linguistic integration of immigrant populations.2 After describing migratory movements into Belgium, we present first the logic behind the Belgian policies of integration, looking in turn at the Francophone and the Dutch (Flemish) speaking areas of the country, noting the different dynamics in the two regions. Thereafter, we concentrate however on the situation in Wallo...Silvia LucchiniExpected Current Distributions for CMOS circuits
http://biblioteca.universia.net/html_bura/ficha/params/title/expected-current-distributions-for-cmos-circuits/id/60641313.html
The analysis of CMOS VLSI circuit switching current has become an increasingly important and difficult task from both a VLSI design and simulation software perspective. This paper presents a new static switching current estimation algorithm based on the idea of “Expected Current Distributions ” (ECDs). Unlike previ-ous “expected waveform ” approaches, ECDs model not only the expected value of switching current waveforms over all time, but also the variances and covariances of all waveform seg...Dennis J. Ciplickas; Ronald A. RohrerRV’04 Preliminary Version Monitoring Algorithms for Metric Temporal Logic Specifications
http://biblioteca.universia.net/html_bura/ficha/params/title/rv’04-preliminary-version-monitoring-algorithms-for-metric-temporal-logic-specifications/id/60641175.html
Program execution traces can be so large in practical testing and monitoring appli-cations that it would be very expensive, if not impossible, to store them for detailed analysis. Monitoring execution traces without storing them, can be a nontrivial matter for many specification formalisms, because complex formulae may require a considerable amount of information about the past. Metric temporal logic (MTL) is an extension of propositional linear temporal logic with discrete-time-bounded tem-p...Prasanna ThatiCausal Reasoning with Contexts using Dependent Types
http://biblioteca.universia.net/html_bura/ficha/params/title/causal-reasoning-with-contexts-using-dependent-types/id/60641005.html
In Artificial Intelligence, a crucial requirement is the ability to reason about actions and their effects on the environment. Traditional approaches which rely on classical logic suffer from a number of limitations such as semi-decidability, closed-world assumption, frame problem, and a lack of ability to cope with partial knowledge and dynamic environments. While many so-lutions have been proposed for these topics, difficulties and uncertainties remain, even in the latest papers. In this pa...Richard Dapoigny; Patrick BarlatierDecidable fragments of first-order temporal logics. Annals of Pure and Applied Logic 106:85–134
http://biblioteca.universia.net/html_bura/ficha/params/title/decidable-fragments-of-first-order-temporal-logics-annals-of-pure/id/60640955.html
In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first-order logic. This reduction is then used to single out a number of decidable fragments of first-ord...Ian Hodkinson; Frank Wolter; Michael ZakharyaschevOn the progression of situation calculus basic action theories: Resolving a 10-year-old conjecture
http://biblioteca.universia.net/html_bura/ficha/params/title/on-the-progression-of-situation-calculus-basic-action-theories-resolving/id/60640942.html
In a seminal paper, Lin and Reiter introduced a model-theoretic definition for the progression of the initial knowl-edge base of a basic action theory. This definition comes with a strong negative result, namely that for certain kinds of action theories, first-order logic is not expressive enough to correctly characterize this form of progression, and second-order axioms are necessary. However, Lin and Reiter also considered an alternative definition for progression which is always first-orde...Stavros Vassos; Hector J. LevesqueReliability Study of an Intelligent Transmitter
http://biblioteca.universia.net/html_bura/ficha/params/title/reliability-study-of-an-intelligent-transmitter/id/60640783.html
An intelligent transmitter reliability study has to deal with several issues: various interactions between both material elements and functions; behaviors of components as programmable units and software which are difficult to predict when faults or failures occur, as well as the consequences on functions processing. A “3-step model ” is therefore proposed to include both functional and material aspects, using Goal Tree–Success Tree (GTST), and setting faults and failures as a third full part...Florent Brissaud; Anne Barros; Christophe Bérenguer; Dominique CharpentierP.: Mining First-Order Temporal Interval Patterns with Regular Expression Constraints
http://biblioteca.universia.net/html_bura/ficha/params/title/p-mining-first-order-temporal-interval-patterns-with-regular-expression/id/60640451.html
Abstract. Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of first order temporal pattern, specified in Allen’s Temporal Interval Logic, where time is explicitly rep-resented by intervals. We present the algorithm MILPRIT for mining temporal interval patterns, which uses variants of the classical level-wise search algorithms. MILPRIT allows a broad spectrum of constrai...Ra De Amo; Arnaud Giacometti; Waldecir Pereira JuniorUSING OPC DATA EXCHANGE IN SIMULATION ASSISTED AUTOMATION TESTING
http://biblioteca.universia.net/html_bura/ficha/params/title/using-opc-data-exchange-in-simulation-assisted-automation-testing/id/60640299.html
software design, performance Dynamic process simulation models can be used for testing automation- both control and logic- before the commissioning. This activity requires a flexible, fast and robust connection between automation software and process simulation engines. OPC Data eXchange (DX) specification provides an open and standardized means for configuring connections and exchanging data between various kinds of automation components, e.g. dynamic process simulators and automation softwa...Jyrki Peltoniemi; Matti Paljakka; Tommi KarhelaMany-valued non-deterministic semantics for first-order logics of formal inconsistency
http://biblioteca.universia.net/html_bura/ficha/params/title/many-valued-non-deterministic-semantics-for-first-order-logics-of/id/60640201.html
Abstract. A paraconsistent logic is a logic which allows non-trivial in-consistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsistent logics is da Costa’s approach, which seeks to allow the use of classical logic whenever it is safe to do so, but behaves completely differently when contradictions are involved. da Costa’s approach has led to the family of Logics of Formal (In)consistency (LFIs). In this paper we provide non-deterministic sem...Arnon Avron; Anna ZamanskyFUTURE DEVELOPMENTS OF ICT IN THE BUILDING SECTOR
http://biblioteca.universia.net/html_bura/ficha/params/title/future-developments-of-ict-in-the-building-sector/id/60639940.html
ABSTRACT: Developments in information and communication technology have an impact throughout the entire life cycle of a building, not only from the process and technical point of view but also from the creative design point of view. As a result of developments of advanced modelling software for architectural design, the gap between what the architect can envision and what the building technician or product architect can materialise is enlarging. Future developments in information and communic...İ. S. Sariyildiz; R. Stouffs; Ö. Çiftçioğlu; B. TunçerCPLD-Controlled PICNIC Camera at IOTA
http://biblioteca.universia.net/html_bura/ficha/params/title/cpld-controlled-picnic-camera-at-iota/id/60639854.html
We describe a new near-infrared camera based on the PICNIC array for the Infrared-Optical Telescope Array (IOTA). The camera control is based on a com-plex programmable logic device (CPLD). This architecture allows fast and stable clocking of the PICNIC array, resulting in faster and lower-noise readout. The CPLD architecture also allows on-the-fly reconfiguration of the readout circuit. We demonstrate this capability with the implementation of circuits dedicated to two different functions: i...E. Pedretti; R. Millan-gabet; J. D. Monnier; W. A. Traub; N. P. Carleton; F. P. Schloerb; M. K. BrewerProperty Specication Language and Mining Specications (CS615 Term Paper)
http://biblioteca.universia.net/html_bura/ficha/params/title/property-specication-language-and-mining-specications-cs615-term-paper/id/60639343.html
Formal methods increase a system's reliability to a very large extent. It has still not found wide spread acceptance due to its complex and hard-to-implement nature. The necessity of charting thorough and correct specications of systems is one major deterrent in adopting formal methods. In this report we study two ideas that attempt to reduce this complexity involved in coding system speci cations. Property Specication Language (PSL) is a language used in formal methods to specify logic ...Tejaswi N; Instructor Prof; Supratik ChakrabortyTestability of Complementary Pass Transistor Logic Circuits
http://biblioteca.universia.net/html_bura/ficha/params/title/testability-of-complementary-pass-transistor-logic-circuits/id/60639060.html
Abstract: Testability analysis of basic and complex logic gates employing complementary pass transistor logic (CPL) under various single stuck faults is investigated. Results show that all stuck-on faults, bridging faults and more than 90% stuck-at faults in the basic CPL gates are only detectable by current monitoring generally known as IDDQ testing. It is also shown that all stuck-open faults in the basic CPL gates are only detectable by logic monitoring using appropriate two-pattern test. ...Mohammad Faisal; Abdul Hasib; A. B. M. H. Rashid