Mostrando recursos 110,721 - 110,740 de 167,149

  1. $rec.titulo

    Neri Oxman; Digital Craft
    Abstract A clear distinction generally exists between processes of design generation and processes of design production. The profusion of digital fabrication tools and technologies make evident such distinctions in the context of design production but at the same time carry potential for material and fabrication-based processes promoting generative design methods. Such strategic application and customization of digital fabrication tools, inherent in and inclusive to the process of design generation, require the knowledge and skillset of production associating material to its fabrication and assembly methods. The paper addresses the area of material fabrication based design and the term Digital Craft is...

  2. Text Statistics Tool Box For Natural Language Processing

    Cheng Hu
    Text statistics are frequently used in stylometry and cryptography studies. In this paper, some text statistics tools are developed in ISO Prolog for natural language processing. Details are given on the usage of 21 user-callable predicates. Logic and limitations of the program are also discussed. 1

  3. Procedural Language Design Issues Procedures: A Control Abstraction

    Sebesta Th
    ffl A lambda expression (functional) ffl A horn clause (logic programming) Procedures modularize program structure

  4. Experimental cooperative control of fixed-wing unmanned aerial vehicles

    Selcuk Bayraktar; Georgios E. Fainekos
    Abstract — Recent years have seen rapidly growing interest in the development of networks of multiple unmanned aerial vehicles (U.A.V.s), as aerial sensor networks for the purpose of coordinated monitoring, surveillance, and rapid emergency response. This has triggered a great deal of research in higher levels of planning and control, including collaborative sensing and exploration, synchronized motion planning, and formation or cooperative control. In this paper, we describe our recently developed experimental testbed at the University of Pennsylvania, which consists of multiple, fixed-wing UAVs. We describe the system architecture, software and hardware components, and overall system integration. We then derive...

  5. Dynamic-cut with definitional trees, in

    Rafael Caballero; Francisco J. López-fraguas
    Abstract. The detection of deterministic computations at run-time can be used to introduce dynamic cuts pruning the search space and thus increasing the efficiency of Functional-Logic systems. This idea was introduced in an early work of R. Loogen and S. Winkler. However the proposal of these authors cannot be used in current implementations because it did not consider non-deterministic functions and was not oriented to the demand driven strategy. Our work adapts and extends the technique, both showing how to deal with non-deterministic computations and how definitional trees can be employed to locate the places where the cuts will be...

  6. Contents

    Pawel Marciniewski
    The data acquisition in high energy physics experiments is typically started by a pulse from a fast coincidence-based trigger system. It is essential that such a system can identify an event in a shortest possible time and with as good selectivity as possible. In order to meet these requirements, several new techniques and developments in the domain of signal discrimination and rapid hit-topology analysis are presented. Two digital rise-time compensation methods were developed to improve the time resolution of the comparatively slow signals from inorganic scintillators. Both methods utilize double threshold analog comparators and digital processing logic. A unique adaptive...

  7. Common Syntax of the DFG-Schwerpunktprogramm DeduktionVersion 1.5

    Abstract A common exchange format for logic problems to be used by members of the DFG-SchwerpunktprogrammDeduktion is introduced. It is thought to be a format that can easily be parsed such that it forms a compromise between the needs of the different groups. The language is partly more general than other popular exchangeformats such as Otter or TPTP in allowing non-clausal and sorted formulae, several proof formats as well as user-defined operators. The latter feature makes it also useful for non-classical logics. 1 Introduction The language proposed in the following is intended to be a common exchange format for logic...

  8. Appears in the Proceedings of the 14 th International Symposium on High-Performance Computer Architecture Regional Congestion Awareness for Load Balance in Networks-on-Chip

    Paul Gratz; Boris Grot; Stephen W. Keckler
    Interconnection networks-on-chip (NOCs) are rapidly replacing other forms of interconnect in chip multiprocessors and system-on-chip designs. Existing interconnection networks use either oblivious or adaptive routing algorithms to determine the route taken by a packet to its destination. Despite somewhat higher implementation complexity, adaptive routing enjoys better fault tolerance characteristics, increases network throughput, and decreases latency compared to oblivious policies when faced with nonuniform or bursty traffic. However, adaptive routing can hurt performance by disturbing any inherent global load balance through greedy local decisions. To improve load balance in adapting routing, we propose Regional Congestion Awareness (RCA), a lightweight technique to...

  9. Fuzzy Logic Control of a Non-linear Structural

    Rahmi Guclu; Hakan Yazici; Downloaded From
    Abstract: In this paper, the problem of active vibration control of multi-degree-of-freedom structures is considered. Fuzzy logic and PID controllers are designed to suppress structural vibrations against earthquakes under the non-linear soil-structure interaction. The advantage of the fuzzy logic approach is the ability to handle the non-linear behavior of the system. Non-linear behavior of the soil is modeled in the dynamics of the structural system with non-linear hysteric restoring forces. The simulated system has fifteen degrees of freedom, which is modeled using spring-mass-damper subsystems. A structural system was simulated against the ground motion of the destructive Kocaeli earthquake (M �...

  10. Implementation and Experimental Validation of a MATLAB Based Control Architecture for Multiple Robot Outdoor Navigation

    L. Doitsidis; A. L. Nelson; K. P. Valavanis; M. T. Long; R. R. Murphy
    Abstract — Design, implementation and experimental validation of a MATLAB based autonomous robot control framework is presented, supported by, and integrated into a distributed field robot architecture known as distributed-SFX. The MATLAB based framework is composed of multi sensor fuzzy logic robot controllers that utilize laser, GPS and odometer data, fusing such sensor data and filtering out noise, to improve collision free navigation. Extensive outdoor environment experiments with single and multiple mobile robots are performed to demonstrate waypoint and goal point navigation, and raster scan search patterns in unknown environments with static and dynamic obstacles. Results and videos are provided...

  11. Temporal verification theories for Javalike classes

    Suad Alagić; Mark Royer; Dennis Crews
    Abstract. We consider Java-like object types equipped with assertions as in recent proposals and implementations. The first issue that we consider is the formal notion of an object-oriented type extended with logicbased constraints along with the notions of inheritance and substitutability for such extended types. The second issue is a suitable logic for explicitly expressing properties of sequences of object states, particular cases of which appear for mutator methods in Java-related and other object-oriented assertion languages. The third issue is a suitable prover technology and the required techniques for verifying properties of object types extended with logic-based constraints. We present...

  12. Propensities in Branching Space-times Theory and in Probabilistic Causal Calculus

    Mika Oksanen
    In this article I compare two theories of propensities that have been developed in philosophical logic and discuss the possibility of combining their basic ideas into a single theory. The first of these theories is the theory of objective transition probabilities that has been developed by Tomasz Placek in [7] and by Thomas Müller in [5] on the basis of Nuel Belnap’s theory of branching space-times (BST), first developed in [2]. The second of these theories is the probabilistic causal calculus of James H. Fetzer and Donald Nute, developed by them together in [4] and by Fetzer alone in [3]...

  13. Perceptually-supported image editing of text and graphics

    Eric Saund; David Fleet; Daniel Larner; James Mahoney
    This paper presents a novel image editing program emphasizing easy selection and manipulation of material found in informal, casual documents such as sketches, handwritten notes, whiteboard images, screen snapshots, and scanned documents. The program, called ScanScribe, offers four significant advances. First, it presents a new, intuitive model for maintaining image objects and groups, along with underlying logic for updating these in the course of an editing session. Second, ScanScribe takes advantage of newly developed image processing algorithms to separate foreground markings from a white or light background, and thus can automatically render the background transparent so that image material can...

  14. Double Reduction of Ada-ECATNet Representation using Rewriting Logic

    Noura Boudiaf, et al.
    One major difficulty that faces developers of concurrent and distributed software is analysis for concurrency based faults like deadlocks. Petri nets are used extensively in the verification of correctness of concurrent programs. ECATNets [2] are a category of algebraic Petri nets based on a sound combination of algebraic abstract types and high-level Petri nets. ECATNets have 'sound' and 'complete' semantics because of their integration in rewriting logic [12] and its programming language Maude [13]. Rewriting logic is considered as one of very powerful logics in terms of description, verification and programming of concurrent systems. We proposed in [4] a method...


    Alexander S. Kleshchev; Irene L. Artemjeva; Andrey Shelestov; Er Lobunets; Michael Korbakov
    International Journal "Information Theories & Applications " Vol.12 In this article unenriched logical relationship systems are introduced on the basis of the applied logic languages. Every such a system represents a class of enriched logical relationship systems. Every enriched logical relationship system determines a set of its solution. In this article notions of equivalence, isomorphism, homomorphism, and product are introduced for unenriched logical relationship systems.

  16. Today

    Matthew Stone; Week Theory Of Representation
    – Symbols can correspond to entities and relationships – Do logic on symbols Week 3: Practice of representation – What really happens now? Example, more concrete Step 1: IM = � Step 2: TELL(IM, f(a,c)) – Give IM the information that the individual represented by a stands in the relation represented by f to the individual represented by c.

  17. 2PADCL: Two phase drive adiabatic dynamic CMOS logic

    Yasuhiro Takahashi; Youhei Fukuta; Toshikazu Sekine
    Abstract — This paper proposes a novel two-phase drive adiabatic dynamic CMOS logic circuit (2PADCL). The proposed 2PADCL uses two complementary sinusoidal power supply clocks and resembles behavior of static CMOS. As a result, the delay time of the 2PADCL is shorter than that of the conventional ADCL circuit in the second and subsequent stages. The structure of 2PADCL can be also directly derived from static CMOS logic circuits. From the simulation results, we show that the energy consumption of the 2PADCL circuit is lower than those of other diode based adiabatic logic circuits. Keywords—adiabatic logic, low power, two-phase power...

  18. Abstract Application of High-κ Gate Dielectrics and Metal Gate Electrodes to enable Silicon and Non-Silicon Logic Nanotechnology

    Robert Chau; Justin Brask; Suman Datta; Gilbert Dewey; Mark Doczy; Brian Doyle; Jack Kavalieros; Ben Jin; Matthew Metz; Amlan Majumdar; Marko Radosavljevic
    High-κ gate dielectrics and metal gate electrodes are required for enabling continued equivalent gate oxide thickness scaling, and hence high performance, and for controlling gate oxide leakage for both future silicon and emerging non-silicon nanoelectronic transistors. In addition, high-κ gate dielectrics and metal gates are required for the successful demonstration of high performance logic transistors on high-mobility non-silicon substrates with high ION/IOFF ratios.

  19. 16 Performance Evaluation within a Networked Enterprise: Balancing Local Objectives and Network Relations

    Jordan Srour; Tamas Mahr; Mathijs De Weerdt; Rob Zuidwijk; Hans Moonen
    Measuring the performance of a company within a network of companies is neither a simple nor straightforward activity. In a networked enterprise, aside from traditional performance indicators based on quantifiable (physical) metrics, it is also important to capture performance measures denoting the quality of customer and partner relations. These factors are, however, much harder to quantifiably measure and compare. Furthermore, it is challenging to utilize a relationship performance measure as part of a decision support mechanism. This is due to the fact that connecting the measure to a meaningful business strategy can be difficult. This paper shows how the domain...

  20. A New Algorithm for Global Fault Collapsing into Equivalence and Dominance Sets

    A. V. S. S. Prasad, et al.
    Nodes in a dominance graph represent faults of a circuit. A directed edge from node fi to node fj means that fault fj dominates fi. The equivalence of faults fi and fj is indicated by the presence of simultaneous edges fi! fj and fj! fi. When local dominance and equivalence relations are included in this graph, its transitive closure provides the collapsed fault sets. Pre-collapsed fault sets of standard cells and other logic blocks can be stored in a graph library for hierarchical fault collapsing. Examples show how more compact fault sets are obtained by using functional equivalences that can...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.