Exploiting Don\u27t Cares to Enhance Functional Tests

In simulation based design verification, deterministic or pseudo-random tests are used to check functional correctness of a design. In this paper we present a technique generating tests by specifying the don’t care inputs in the functional specifications so as to improve their coverage of both design errors and manufacturing faults. The don’t cares are chosen to maximize sensitization of signals in the circuit. The tests generated in this way require only a fraction of pseudo-exhaustive test patterns to achieve a high multiplicity of fault coverage

Custom Integrated Circuits

Contains reports on twelve research projects.Analog Devices, Inc.International Business Machines, Inc.Joint Services Electronics Program (Contract DAAL03-86-K-0002)Joint Services Electronics Program (Contract DAAL03-89-C-0001)U.S. Air Force - Office of Scientific Research (Grant AFOSR 86-0164)Rockwell International CorporationOKI Semiconductor, Inc.U.S. Navy - Office of Naval Research (Contract N00014-81-K-0742)Charles Stark Draper LaboratoryNational Science Foundation (Grant MIP 84-07285)National Science Foundation (Grant MIP 87-14969)Battelle LaboratoriesNational Science Foundation (Grant MIP 88-14612)DuPont CorporationDefense Advanced Research Projects Agency/U.S. Navy - Office of Naval Research (Contract N00014-87-K-0825)American Telephone and TelegraphDigital Equipment CorporationNational Science Foundation (Grant MIP-88-58764

Custom Integrated Circuits

Contains reports on nine research projects.Analog Devices, Inc.International Business Machines CorporationJoint Services Electronics Program Contract DAAL03-89-C-0001U.S. Air Force - Office of Scientific Research Contract AFOSR 86-0164BDuPont CorporationNational Science Foundation Grant MIP 88-14612U.S. Navy - Office of Naval Research Contract N00014-87-K-0825American Telephone and TelegraphDigital Equipment CorporationNational Science Foundation Grant MIP 88-5876

INVESTIGATION OF THE NETWORK CONSTRUCTION BEHAVIOR ON SOCIAL NETWORKING SITES

By enabling connections between individuals, Social Networking Sites, such as Facebook, promise to create significant individual as well as social value. Encouraging connections between users is also crucial for service providers who increasingly rely on social advertising and viral marketing campaigns as important sources of their revenue. Consequently, understanding user’s network construction behavior becomes critical. However, previous studies offer only few scattered insights into this research question. In order to fill this gap, we employ Grounded Theory methodology to derive a comprehensive model of network construction behavior on social networking sites. In the following step we assess two Structural Equation Models to gain refined insights into the motivation to send and accept friendship requests – two network expansion strategies. Based on our findings, we offer recommendations for social network providers

Parallelism in declarative languages

Imperative programming languages were initially built for uniprocessor systems that evolved out of the Von Neumann machine model. This model of storage oriented computation blocks parallelism and increases the cost of parallel program development and porting. Declarative languages based on mathematical models of computation, seem more suitable for the development of parallel programs. In the first part of this thesis we examine different language families under the declarative paradigm: functional, logic, and constraint languages. Functional languages are based on the abstract model of functions and (lamda)-calculus. They were initially developed for symbolic computation, but today they are commonly used in numerical analysis and many other application areas. Pure lisp is a widely known member of this class. Logic languages are based on first order predicate calculus. Although they were initially developed for theorem proving, fifth generation operating systems are written in them. Most logic languages are descendants or distant relatives of Prolog. Constraint languages are related to logic languages. In a constraint language you define a program object by placing constraints on its structure and its behavior. They were initially used in graphics applications, but today researchers work on using them in parallel computation. Here we will compare and contrast the language classes above, locate advantages and deficiencies, and explain different choices made by language implementors. In the second part of thesis we describe a front end for the CONSUL, a prototype constraint language for programming multiprocessors. The most important features of the front end are compact representation of constraints, type definitions, functional use of relations, and the ability to split programs into multiple files

NASA/FAA helicopter simulator workshop

A workshop was convened by the FAA and NASA for the purpose of providing a forum at which leading designers, manufacturers, and users of helicopter simulators could initiate and participate in a development process that would facilitate the formulation of qualification standards by the regulatory agency. Formal papers were presented, special topics were discussed in breakout sessions, and a draft FAA advisory circular defining specifications for helicopter simulators was presented and discussed. A working group of volunteers was formed to work with the National Simulator Program Office to develop a final version of the circular. The workshop attracted 90 individuals from a constituency of simulator manufacturers, training organizations, the military, civil regulators, research scientists, and five foreign countries

The Injustice of Dynamic Statutory Interpretation

How can we possibly plan our lives on the basis of the law of tomorrow when we can\u27t predict what that law will be? Are courts that are attracted to dynamic statutory interpretation teaching us that we can no longer know and rely on the rule of law in our daily lives because months or years later they can use policy considerations to make new law and apply that law retroactively to us? Doesn\u27t dynamic statutory interpretation amount to unconstitutional ex post facto legislation? Hasn\u27t justice become impossible to get from courts if judges insist on upsetting both sides\u27 expectations of what law was when their case or controversy arose, and instead pull the rug out from under their feet with new law based on the judges\u27 own idea of general social and governmental policy? Isn\u27t this just a case of judges appropriating the rights of the parties, without compensation, in order to announce new social legislation? Isn\u27t this the very definition of injustice

JPEG-like Image Compression using Neural-network-based Block Classification and Adaptive Reordering of Transform Coefficients

The research described in this thesis addresses aspects of coding of discrete-cosinetransform (DCT) coefficients, that are present in a variety of transform-based digital-image-compression schemes such as JPEG. Coefficient reordering; that directly affects the symbol statistics for entropy coding, and therefore the effectiveness of entropy coding; is investigated. Adaptive zigzag reordering, a novel versatile technique that achieves efficient reordering by processing variable-size rectangular sub-blocks of coefficients, is developed. Classification of blocks of DCT coefficients using an artificial neural network (ANN) prior to adaptive zigzag reordering is also considered. Some established digital-image-compression techniques are reviewed, and the JPEG standard for the DCT-based method is studied in more detail. An introduction to artificial neural networks is provided. Lossless conversion of blocks of coefficients using adaptive zigzag reordering is investigated, and experimental results are presented. A versatile algorithm, that generates zigzag scan paths for sub-blocks of any dimensions using a binary decision tree, is developed. An implementation of the algorithm based on programmable logic devices (PLDs) is described demonstrating the feasibility of hardware implementations. Coding of the sub-block dimensions, that need to be retained in order to reconstruct a sub-block during decoding, based on the scan-path length is developed. Lossy conversion of blocks of coefficients is also considered, and experimental results are presented. A two-layer feedforward artificial neural network trained using an error-backpropagation algorithm, that determines the sub-block dimensions, is described. Isolated nonzero coefficients of small significance are discarded in some blocks, and therefore smaller sub-blocks are generated

Respecting the Evidence

Wherein Stedman answers Berliner and Biddle's reply to his review of The Manufactured Crisis

Extrinsic Rewards and Intrinsic Motives: Standard and Behavioral Approaches to Agency and Labor Markets

Employers structure pay and employment relationships to mitigate agency problems. A large literature in economics documents how the resolution of these problems shapes personnel policies and labor markets. For the most part, the study of agency in employment relationships relies on highly stylized assumptions regarding human motivation, e.g., that employees seek to earn as much money as possible with minimal effort. In this essay, we explore the consequences of introducing behavioral complexity and realism into models of agency within organizations. Specifically, we assess the insights gained by allowing employees to be guided by such motivations as the desire to compare favorably to others, the aspiration to contribute to intrinsically worthwhile goals, and the inclination to reciprocate generosity or exact retribution for perceived wrongs. More provocatively, from the standpoint of standard economics, we also consider the possibility that people are driven, in ways that may be opaque even to themselves, by the desire to earn social esteem or to shape and reinforce identity.agency, motivation, employment relationships, behavioral economics