A Monolithic and Self-Referenced RF LC Clock Generator Compliant With USB 2.0
- Michael S. Mccorquodale; Justin D. O’day; Scott M. Pernia; Gordon A. Carichner; Sundus Kubba; Richard B. Brown; Senior Member
Abstract—A monolithic and self-referenced radio frequency (RF) LC clock generator that is compliant with USB 2.0 is demonstrated in a system-on-chip (SoC). This work presents the first successful approach to replacing an external crystal (XTAL), the crystal oscillator (XO) and the phase-locked loop for clock generation in an IC supporting USB 2.0 using a standard CMOS fabrication process. It is shown that the primary design challenges with the implemented approach involve maintaining high frequency accuracy and low jitter. Techniques for addressing both are shown. In particular, the presented architecture exploits the effects of frequency division and low far-from-carrier phase noise...
THE RULE OF FORCES, THE FORCE OF RULES
- Anthony De Jasay
All is not well with our politics. Never before in history, perhaps with the exception of ancient Greece, has civil life been politicized to quite the same extent as today. It might appear that society should be better, more fully servedby its government than ever before. Yet few would think that this is the case. The principal products of more intrusive, more caring, and more comprehensive politics seem to be disaffectionwith, and dysfunctionof, government.Where the process has gone furthest, under “real existing socialism, ” failure reached staggering dimensions. But whether governments now profess to live bydemocratic or socialist precepts, or...
Adjunct Elimination in Context Logic for Trees
- Cristiano Calcagno; Thomas Dinsdale-young
Abstract. We study adjunct-elimination results for Context Logic applied to trees, following previous results by Lozes for Separation Logic and Ambient Logic. In fact, it is not possible to prove such elimination results for the original single-holed formulation of Context Logic. Instead, we prove our results for multi-holed Context Logic. 1
NoCEE: Energy macro-model extraction methodology for network on chip routers
- Jeremy Chan; Sri Parameswaran
In this paper we present NoCEE, a fast and accurate method for extracting energy models for packet-switched Network on Chip (NoC) routers. Linear regression is used to model the relationship between events occurring in the NoC and energy consumption. The resulting models are cycle accurate and can be applied to different technology libraries. We verify the individual router estimation models with many different synthetically generated traffic patterns and data inputs. Characterization of a small library takes about two hours. The mean absolute energy estimation error of the resultant models is 5 % (10 % max) against a complete gate level...
Slicing Software for Model Construction \Lambda
- John Hatcliff; Matthew B. Dwyer; Hongjun Zheng
Abstract Applying finite-state verification techniques (e.g., model checking) to software requires that program source code be translated to a finite-state transition system that safely models program behavior. Automatically checking such a transition system for a correctness property is typically very costly, thus it is necessary to reduce the size of the transition system as much as possible. In fact, it is often the case that much of a program's source code is irrelevant for verifying a given correctness property. In this paper, we apply program slicing techniques to remove automatically such irrelevant code and thus reduce the size of the...
Propositional fusion rules
- Anthony Hunter; Rupert Summerton
Abstract. In previous papers, we have presented a logic-based framework for merging structured news reports [14, 16, 15]. Structured news reports are XML documents, where the text entries are restricted to individual words or simple phrases, such as names and domain-specific terminology, and numbers and units. We assume structured news reports do not require natural language processing. In this paper, we present propositional fusion rules as a way of implementing logic-based fusion for structured news reports. Fusion rules are a form of scripting language that define how structured news reports should be merged. The antecedent of a fusion rule is...
and Applications Publication No.
- Anindya Chandra Patthak; David I. Zuckerman; Anna Gál; Charanjit S. Jutla; Adam Klivans; José Felipe Voloch; Anindya Ch; Ra Patthak; Ph. D; Supervisor David; I. Zuckerman
This dissertation is a study of special types of error correcting codes and their applications. It consists of three parts. First, we study Generalized Reed-Muller codes (over prime fields), aka low-degree polynomials. Specifically, we show that these codes are locally testable. Locally testable codes are a class of error-correcting codes with the property that given (black-box access to) a word, it is possible to determine with high prob-ability whether the given word is close to a codeword by querying randomly at a sublinear number of places. Such codes are known to be useful for efficient construc-tions of probabilistically checkable proofs....
A Tunable Body Biasing Scheme for Ultra-Low
- High Speed; Cmos Designs; Jabulani Nyathi; Ieee Brent Bero; Ryan Mckinlay Student
Abstract—Interest in VLSI subthreshold design has recently increased due to the emergence of systems that require ultralow power operation. Further more the ever increasing leakage currents, now used to drive logic make subthreshold design an interesting prospect. Subthreshold sacrifices speed for power creating a clear divide between designing for high speed and ultra-low power. It might be beneficial to allow circuits designed for subthreshold operation to become operable at above threshold voltages (super-threshold), depending on processing needs. In this paper among other things; the feasibility of optimizing device sizes for both subthreshold and above threshold operations is considered. Three widely...
From personal to cultural computing: how to assess a cultural experience
- Matthias Rauterberg
Based on a short overview over the different paradigms for human computer interaction we introduce and discuss the most recent paradigm of cultural computing. Cultural computing addresses underlying and almost unconscious cultural determinants that have since ancient times a strong influence on our way of thinking, feeling and worldview in general. Different cultures worldwide will have different approaches to address their particular cultural determinants. In the East, the project ZENetic Computer is a first and very promising approach for cultural computing addressing Eastern cultural determinants. In the West, we propose an interactive experience based on the narrative ‘Alice’s Adventures in...
Programmable Deterministic Built-in Self-test Abdul-Wahid Hakmi, Hans-Joachim Wunderlich,
- Christian G. Zoellin
Abstract — In this paper, we propose a new programmable deterministic Built-In Self-Test (BIST) method that requires significantly lower storage for deterministic patterns than existing programmable methods and provides high flexibility for test engineering in both internal and external test. Theoretical analysis suggests that significantly more care bits can be encoded in the seed of a Linear Feedback Shift Register (LFSR), if a limited number of conflicting equations is ignored in the employed linear equation system. The ignored care bits are separately embedded into the LFSR pattern. In contrast to known deterministic BIST schemes based on test set embedding, the...
Organized Networks, Transdisciplinarity and New Institutional Forms
- Ned Rossiter
The network models of sociality made possible by information and communication technologies (ICTs) have resulted in new forms of social-technical systems, or what I am calling emergent institutional forms of "organized networks. " While these networks can be called institutional forms insofar as they have a capacity to organize social relations, they are radically dissimilar to the moribund technics of modern institutional forms such as government, union, and firm whose logic of organization is predicated on vertical integration and representative tenets of liberal democracy. Such dynamics are profoundly unsuited to the collaborative and distributive culture of networks peculiar to digital...
Unification-based grammars and complexity classes A simple unification-based formalism is identified, and it is demonstrated how small changes effect its computational complexity. Versions are defined for polynomial time (PTIME), non-deterministic polynomial time (NPTIME), polynomial space (PSPACE), exponential time (EXPTIME), and undecidability (UNDEC). If the grammar is unambiguous or deterministically copying, its recognition problem is solvable in PTIME; the same goes for the polysized and k-ambiguous fragment; if the grammar has no unary cycles, it is solvable in NPTIME; in the abscence of true path equations and global implication, if functional uncertainty is impossible, and no weak precedence is employed (no...
Formal Semantics and Verification for Feature Modeling
- Jing Sun; Yuan Fang Li
Research on features has received much attention in the domain engineering community. Feature modeling plays an important role in the design and implementation of complex software systems. However, the presentation and analysis of feature models are still largely informal. There is also an increasing need for methods and tools that can support automated feature model analysis. This paper presents a formal engineering approach to the specification and verification of feature models. A formal semantics for the feature modeling language is defined using first-order logic. It provides a precise and rigorous formal interpretation for the graphical notation. In addition, further validation...
High-level Proofs of Mathematical Programs Using Automatic Differentiation, Simplification, and some Common Sense
- Richard Fateman
One problem in applying elementary methods to prove correctness of interesting scientific programs is the large discrepancy in level of discourse between low-level proof methods and the logic of scientific calculation, especially that used in a complex numerical program. The justification of an algorithm typically relies on algebra or analysis, but the correctness of the program requires that the arithmetic expressions are written correctly and that iterations converge to correct values in spite of truncation of infinite processes or series and the commission of numerical roundoff errors. We hope to help bridge this gap by showing how we can, in...
- A. Baskar; R. Ramanujam; S. P. Suresh
Knowledge-based modelling of voting protocols We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elections are naturally expressed using standard knowledge operators, and show that the associated logic is decidable (under reasonable assumptions of bounded agents and nonces). 1
Nemos: A framework for axiomatic and executable specifications of memory consistency models
- Yue Yang; Ganesh Gopalakrishnan; Gary Lindstrom; Konrad Slind
Conforming to the underlying memory consistency rules is a fundamental requirement for implementing shared memory systems and writing multiprocessor programs. In order to promote understanding and enable automated verification, it is highly desirable that a memory model specification be both declarative and executable. We have developed a specification framework called Nemos (Non-operational yet Executable Memory Ordering Specifications), which employs a uniform notation based on predicate logic to define shared memory semantics in an axiomatic as well as compositional style. In this paper, we present this framework and discuss how constraint logic programming and SAT solving can be used to make...
A Logic Block Enabling Logic Configuration by Non-Experts in Sensor Networks
- Susan Cotterell; Frank Vahid
Recent years have seen the evolution of networks of tiny low power computing blocks, known as sensor networks. In one class of sensor networks a non-expert user, who has little or no experience with electronics or programming, is required to select, connect and/or configure one or more blocks such that the blocks compute a particular Boolean logic function of sensor values. We describe a series of experiments showing that non-expert users have much difficulty with a block based on Boolean logic truth tables, and that a logic block having a sentence-like structure with some configurable switches yields a better success...
Licensescript: A logical language for digital rights management. Annals of telecommunications special issue on Network and Information systems security
- Cheun Ngen Chong; Ricardo Corin; Jeroen Doumen; Ro Etalle; Pieter Hartel; Yee Wei Law; Andrew Tokmakoff
We propose LicenseScript, a language for digital rights management (DRM) based on multiset rewriting and logic programming. LicenseScript enjoys a precise syntax and semantics, and it is rich enough to embed other rights expression languages (REL). We show that LicenseScript is expressive and flexible by exploring several application domains representing different aspects of DRM. We present an implementation. Finally, we extend the core of the language to account for multiple devices in authorized domains. 1
Campus Grids Meet Applications: Modeling, Metascheduling and Integration
- Yonghong Yan; Barbara M. Chapman
Air Quality Forecasting (AQF) is a new discipline that attempts to reliably predict atmospheric pollution. An AQF application has complex workflows and in order to produce timely and reliable forecast results, each execution requires access to diverse and distributed computational and storage resources. Deploying AQF on grids is one option to satisfy such needs, but requires the related grid middleware to support automated workflow scheduling and execution on grid resources. In this paper, we analyze the challenges in deploying an AQF application in a campus grid environment and present our current efforts to develop a general solution for grid-enabling scientific...
- Ii. Curricula; Mcs Elective I
Inverse functions- Permutation functions. 2. LOGIC 9 Propositional logic – Logical connectives – Truth tables – Normal forms (conjunctive and disjunctive)- Predicate logic- Universal and existential quantifiers-Proof techniques – direct and indirect – Proof by contradiction – Mathematical Induction.