Thursday, November 27, 2014

 

 



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 141 - 160 de 132,391

141. Petr Kašpar The Logic of UNASUR: Its Origins and Institutionalization <Master Thesis> The logic of UNASUR: Its Origins and Institutionalization
The thesis takes a form of a single case study, where the main focus is put on South American integration. For this dynamic continent the term integration is nothing new and dates back to colonial times. Through the centuries, much effort was put into promoting “regional awareness ” or even building one South American nation. Nevertheless, it was the breakdown of Second World War in 20 century, that allowed regionalism to fully develop and increasing number of new institutions were mushrooming. A few decades later, in 1980s, thanks to many circumstances, so called “second wave” of regionalism arose and new...

142. A Probabilistic Boolean Logic and its Meaning - Lakshmi N. B. Chakrapani; Krishna V. Palem
We introduce a novel probabilistic Boolean logic (pbl) in which the probabilistic disjunction, conjunction and negation operators, provide the “output ” expected of their deterministic counterparts, with a probability p. By design, this output can be incorrect with a probability (1 − p). In order to distinguish our approach to injecting probabilities into Boolean logic from past approaches, we introduce a semantic model based on the novel notion of event sets. To the best of our knowledge, event sets provide a novel meaning to truth when Boolean logic and probability are combined. Building on this, we continue to show that...

143. Explaining software defects using topic models - Tse-hsun Chen; Stephen W. Thomas; Ahmed E. Hassan
Abstract—Researchers have proposed various metrics based on measurable aspects of the source code entities (e.g., methods, classes, files, or modules) and the social structure of a software project in an effort to explain the relationships between soft-ware development and software defects. However, these metrics largely ignore the actual functionality, i.e., the conceptual concerns, of a software system, which are the main technical concepts that reflect the business logic or domain of the system. For instance, while lines of code may be a good general measure for defects, a large entity responsible for simple I/O tasks is likely to have fewer...

144. ‘ A house is a machine for living in…’ - Bill Hillier; Bill Hillier
Since The social logic of space was published in 1984,

145. Florian Lonsing Dependency Schemes and Search-Based QBF Solving - Florian Lonsing; This Work
QBF solving: variable dependencies. Dependency schemes to improve QBF solvers. DepQBF: search-based QBF solver, integrates dependency schemes. QBFEVAL’10 (568 formulae) – without preprocessing

146. Kleene Algebra with Tests and Coq Tools for While Programs - Damien Pous
Abstract. We present a Coq library about Kleene algebra with tests, including a proof of their completeness over the appropriate notion of languages, a decision procedure for their equational theory, and tools for exploiting hypotheses of a certain kind in such a theory. Kleene algebra with tests make it possible to represent if-then-else state-ments and while loops in most imperative programming languages. They were actually introduced by Kozen as an alternative to propositional Hoare logic. We show how to exploit the corresponding Coq tools in the context of program verification by proving equivalences of while programs, correct-ness of some standard...

147. Parallelization of Sudoku - Alton Chiu; Ehsan Nasiri; Rafat Rashid
Sudoku is a logic-based number-placement puzzle game where the players goal is to complete a nxn table such that each row, column and box contains every number in the set {1,..., n} exactly once. In this report, we attempted to generate a highly parallelized Sudoku solver using the pthreads library on the Linux kernel. Based on our run-time evaluation, we achieved an average speedup of 4.6 times over the serial implementation by using locking and yielding methods with four threads. We believe further speedup can be gained by making better use of threads in our message passing version or by...

148. 3URGXFW6HOHFWLRQ*XLGH - Spartan- Fpgas; Xcslx Xcslx; Xcslx Xcslx; Xcslx Xcslx; Xcslx Xcslx; Xcslxt Xcslxt; Xcslxt Xcslxt Xcslxt
Notes: 1. Each slice contains four LUTs and eight flip-flops. 2. Spartan-6 FPGA logic cell ratings reflect the increased logic capacity offered by the new 6-input LUT architecture. 3. Block RAM are fundamentally 18Kb in size. Each block can also be used as two independent 9 Kb blocks. 4. Each CMT contains two DCMs and one PLL. 5. Each DSP48A1 slice contains an 18x18 multiplier, an adder, and an accumulator. 6. The LX device pinouts are not compatible with the LXT device pinouts. 7. CPG196 and TQG144 do not have memory controller support.-3N is not available for these packages.

149. Research Article Modeling and Fuzzy PDC Control and Its Application to an Oscillatory TLP Structure - Cheng-wu Chen
Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. An analytical solution is derived to describe the wave-induced flow field and surge motion of a deformable platform structure controlled with fuzzy controllers in an oceanic environment. In the controller design procedure, a parallel distributed compensation PDC scheme is utilized to construct a global fuzzy logic controller by blending all local state feedback controllers. The Lya-punov method is used to carry out stability analysis of a real system structure. The corresponding boundary value problems are then incorporated into scattering and...

150. Xquery processing in the mapreduce framework - Caetano Sauer
This master’s thesis addresses the mapping of declarative query processing and computation to the programming model of MapReduce. MapReduce is a popular framework for large-scale data analysis on cluster architectures. Its popularity arises from the fact that it provides dis-tribution transparency, which is based on the computation patterns of functional list process-ing. This work proposes a translation mechanism which maps XQuery expressions to MapRe-duce programs, allowing the transparent, parallel execution of data-processing queries in a distributed environment. Our approach reuses the compilation logic of an existing XQuery processor and extends it with the MapReduce programming model and distribution aware-ness. This...

151. Acceptance, Usability and Usefulness of WebLab-Deusto from the Students Point of View”, Acceptance, Usability and Usefulness of WebLab-Deusto from Students Point of View - J. García-zubia; U. Hernández; I. Angulo; P. Orduña; J. Irurzun
Abstract—In the engineering curriculum, remote labs are becoming a popular learning tool. The advantages of these laboratories and the different deployments have been analyzed many times, but in this paper we want to show the results of the students ’ opinion about WebLab-Deusto as a learning tool. This work is focused on the subjects Programmable Logic (PL) in the third year of Electronics Engineering and in Electronics Design (ED) of the fifth year of the same degree. The paper presents the results of the surveys done by students since 2004. This survey consists of fifteen questions and its main objective...

152. Theory Propagation and Rational-Trees - Jacob M. Howe; Andy King
SAT Modulo Theories (SMT) is the problem of determining the satisfiability of a formula in which constraints, drawn from a given constraint theory T, are composed with logical connectives. The DPLL(T) approach to SMT has risen to prominence as a technique for solving these quantifier-free problems. The key idea in DPLL(T) is to closely couple unit propagation in the propositional part of the problem with theory propagation in the constraint component. In this pa-per it is demonstrated how reification provides a natural way for orchestrating this in the setting of logic programming. This allows an elegant implementation of DPLL(T) solvers...

153. A Random Walk Down the Genomes: DNA - Evolution In Valis
W hile chemistry and physics are thesubstrate of biology, researchers nowbelieve that a better understanding ofbiology will come through informa-tion-theoretic studies of genomes, providing new insights into DNA’s role in govern-ing metabolic and regulatory pathways. Conse-quently, the mathematical approaches derived from systems sciences—dynamical systems, control the-ory, game theory, information and decision theory, and mathematical logic—are playing increasingly important roles in biological research. Understanding the evolutionary processes that act on these “codes of life”—including point muta-tion, recombination, gene conversion, replication slippage, DNA repair, translocation, imprinting, and horizontal transfer—requires the ability to analyze vast amounts of continually generated genomic data. The challenges,...

154. Journal of Visual Languages & ComputingJournal of Visual Languages and Computing
The expressiveness of spider diagrams augmented with constants Gem Stapletona,,1,2,4, John Taylora,3, order predicate logic. We extend the spider diagram language to include constant spiders which ARTICLE IN PRESS www.elsevier.com/locate/jvlc

155. A Middleware Aided Robust and Fault Tolerant Dynamic Reconfigurable Architecture - Yannick Dadji; Björn Osterloh; Harald Michalik
Abstract — Dynamic reconfiguration enhances embedded system with at run-time adaptive functionality and is an improvement in terms of resource utilization and system adaptability. SRAM-based FPGAs provides a dynamic reconfigurable platform with high logic density. The requirements for such an embedded high flexible system based on FPGAs are robustness and reliability to prevent operation interrupts or even system failures. The complexity of a dynamic reconfigurable system with adaptive processing module demands high effort for the user. Therefore a high level abstraction of the communication issues is required to support application development by an appropriate middleware. To achieve such a flexible...

156. '6+42*&+6 - Matthias Brückmann; Klaus-manfred Schöne; Stefan Junginger; Diana Boudinova
'6+42*&+6 Abstract: An important objective of nearly all EAM initiatives is the standardization and consolidation of the IT landscape. This can be seen on several levels, e.g. on the application landscape level, the software level, the hardware level, etc. This paper presents a stepwise approach for consolidating IT landscapes on the technology, software and hardware level which considers the specifics of large IT organizations and is implemented in one of the largest IT service providers of Germany's public civil administration. It is based on metrics which use concepts from fuzzy logic. In particular, these metrics allow measuring the degree of...

157. Hardware/Software Organization of a High-Performance ATM Host Interface - C. Brendan; S. Traw; Jonathan M. Smith
Concurrent increases in network bandwidths and processor speeds have created a performance bottleneck at the workstation-to-network host interface. This is especially true for BISDN networks where the fixed length ATM cell is mismatched with application requirements for data transfer; a successful hardware/software architecture will resolve such differences and offer high end-to-end performance. The solution we report carefully splits protocol processing functions into hardware and software implementations. The interface hardware is highly parallel and performs all per-cell functions with dedicated logic to maximize performance. Software provides support for the transfer of data between the interface and application memory, as well as...

158. 1POLIS: A Probabilistic Summarisation Logic for Structured Documents - Jan Frederik Forst
2Declaration of originality I hereby declare that this thesis, and the research to which it refers, are the product of my own work, and that any ideas or quotations from the work of other people, published or otherwise, are fully acknowledged in accordance with the standard referencing practices of the discipline. The material contained in this thesis has not been submitted, either in whole or in part, for a degree or diploma or other qualification at the University of London or any other University. Some parts of this work have been previously published as:

159. Planning Model Part 1: Model Characteristics - David Yates; Member Iwra
Management (IWRM) model seamlessly integrates water supplies generated through watershed-scale hydrologic processes with a water management model driven by water demands and environmental requirements and is governed by the natural watershed and physical network of reservoirs, canals, and diversions. This version (WEAP21) extends the previous WEAP model by introducing the concept of demand priorities and supply preferences, which are used in a linear programming heuristic to solve the water allocation problem as an alternative to multi-criteria weighting or rule-based logic approaches. WEAP21 introduces a transparent set of model objects and procedures that can be used to analyze a full range...

160. An Epistemic Formulation of Information Flow Security - Arbob Ahmad; Robert Harper
The non-interference (NI) property defines a program to be secure if changes to high-security inputs cannot alter the values of low-security outputs. NI indirectly states the epistemic property that no low-security principal acquires knowledge of high-security data. We consider a directly epistemic account of information flow (IF) security focusing on the knowledge flows engendered by the pro-gram’s execution. Storage effects are of primary interest, since prin-cipals acquire knowledge from the execution only through these ef-fects. The IF properties of the individual effectful actions are char-acterized using a substructural epistemic logic that accounts for the knowledge transferred through their execution. We...

 

Busque un recurso