ppxscal/embedding_network huggingface dataset:
An Approach for Selection of Test Points for Analog Fault Diagnosis
Authors: Kranthi K. Pinjala, Bruce C. Kim
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper presents an algorithm for selection of test points in frequency domain analysis of analog circuits. The proposed algorithm aims to find optimum number of test points to isolatefaults based on minimization of ambiguity groups using an information measure. This techniquecan be used for identifying catastrophic faults. The algorithm is composed of two stages. In the first stage a fault dictionary is created and in the second stage required test points are selected based on the information measure provided by the test points.Two example circuits are presented to demonstrate the effectiveness of the proposed algorithm.
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998
Authors: Cynthia Dwork, Moni Naor, Omer Reingold, Larry Stockmeyer
Venue: Journal of the ACM (JACM) (2003)

We prove that three apparently unrelated fundamental problems in distributed computing, cryptography, and complexity theory, are essentially the same problem. These three problems and brief descriptions of them follow. (1) The selective decommitment problem. An adversary is given commitments to a collection of messages, and the adversary can ask for some subset of the commitments to be opened. The question is whether seeing the decommitments to these open plaintexts allows the adversary to learn something unexpected about the plaintexts that are unopened. (2) The power of 3-round weak zero-knowledge arguments. The question is what can be proved in (a possibly weakened form of) zero-knowledge in a 3-round argument. In particular, is there a language outside of BPP that has a 3-round public-coin weak zero-knowledge argument? (3) The Fiat-Shamir methodology. This is a method for converting a 3-round public-coin argument (viewed as an identification scheme) to a 1-round signature scheme. The method requires what we call a "magic function" that the signer applies to the first-round message of the argument to obtain a second-round message (queries from the verifier). An open question here is whether every 3-round public-coin argument for a language outside of BPP has a magic function.It follows easily from definitions that if a 3-round public-coin argument system is zero-knowledge in the standard (fairly strong) sense, then it has no magic function. We define a weakening of zero-knowledge such that zero-knowledge &rArr; no-magic-function still holds. For this weakened form of zero-knowledge, we give a partial converse: informally, if a 3-round public-coin argument system is not weakly zero-knowledge, then some form of magic is possible for this argument system. We obtain our definition of weak zero-knowledge by a sequence of weakenings of the standard definition, forming a hierarchy. Intermediate forms of zero-knowledge in this hierarchy are reasonable ones, and they may be useful in applications. Finally, we relate the selective decommitment problem to public-coin proof systems and arguments at an intermediate level of the hierarchy, and obtain several positive security results for selective decommitment.
Preference formulas in relational queries
Authors: Jan Chomicki
Venue: ACM Transactions on Database Systems (TODS) (2003)

The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and extraction to reduce the volume of data presented to the user. They are also used to keep track of user profiles and formulate policies to improve and automate decision making.We propose here a simple, logical framework for formulating preferences as preference formulas. The framework does not impose any restrictions on the preference relations, and allows arbitrary operation and predicate signatures in preference formulas. It also makes the composition of preference relations straightforward. We propose a simple, natural embedding of preference formulas into relational algebra (and SQL) through a single winnow operator parameterized by a preference formula. The embedding makes possible the formulation of complex preference queries, for example, involving aggregation, by piggybacking on existing SQL constructs. It also leads in a natural way to the definition of further, preference-related concepts like ranking. Finally, we present general algebraic laws governing the winnow operator and its interactions with other relational algebra operators. The preconditions on the applicability of the laws are captured by logical formulas. The laws provide a formal foundation for the algebraic optimization of preference queries. We demonstrate the usefulness of our approach through numerous examples.
Dependability Analysis of CAN Networks: An Emulation-Based Approach
Authors: J. Pérez, M. Sonza Reorda, M. Violante
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Today many safety-critical applications are based on distributed systems where several computing nodes exchange information via suitable network interconnections. An example ofthis class of applications is the automotive field, where developers are exploiting the CAN protocol for implementing the communication backbone. The capability of accurately evaluating the dependability properties of such a kind of systems is today a major concern. Inthis paper we present a new environment that can be fruitfully exploited to assess the effects of faults in CAN-based networks. The entire network is emulated via an ad-hoc hardware/software system that allows easily evaluating the effects of faults in all the networkcomponents, namely the network nodes, the protocol controllers and the transmission channel. In this paper, we report a detailed description of the environment we set-up and we present some preliminary results we gathered to assess the soundness of the proposed approach.
Top-Down eLearning Tools for Hardware Logic Design
Authors: Norihiro Fujii, Shuichi Yukita, Nobuhiko Koike, Tosiyasu L. Kunii
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

New top-down eLearning tools for hardware logicdesign courses using the cellular methods are presentedthat enable students to keep focusing on their primaryinterests so that they can achieve complex logic circuitsdesign successfully. In a modern logic design classroom,hardware description languages such as VerilogHDL aremostly used to describe circuits for FPGAs. The circuit ineach module is described in VerilogHDL and the entirecircuit is implemented by combination of designedmodules. These HDL descriptions are wrapped in XMLand enriched by a specially extended XML vocabulary, inorder to share designed modules among learners on theWeb. Although XML gives us a common and convenientWeb framework, it becomes difficult to verify, validate,and maintain conformance among designed modules ifthe system becomes very large. To overcome this problem,we employed the cellular models that ensure theconsistency among design modules and support a top-downdesign methodology. The proposed top-downeLearning tools can generate these circuit design data,distribute them to the learner, and manage the designdatabase. The circuit design data wrapped in XMLvocabulary are offered to the learner as a self-learningmaterial of the courseware using the top-down (i.e. goal-oriented)method, according to the demand and thepurpose of the learner. This paper also presents the basicXML vocabulary design to describe hardware modulesefficiently, and introduces the structure and the functionof the proposed system which implements these eLearningtools.
An Experimentation Framework for Evaluating Disassembly and Decompilation Tools for C++ and Java
Authors: Lori Vinciguerra, Linda Wills, Nidhi Kejriwal, Paul Martino, Ralph Vinciguerra
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

The inherent differences between C++ and Javaprograms dictate that the methods used for reverseengineering their compiled executables will be language-specific. This paper looks at the history of decompilers,disassemblers, and obfuscators in C++ and Java andpresents the current state of the art for binary reverseengineering. An experimentation framework forevaluating tools is described, including methodology,benchmark programs, metrics, and reverse engineeringtasks. Preliminary results of experiments conducted sofar to assess the capability of a small select set of chosenpopular tools are given. These results reveal language-specific differences in the feasibility of the binary reverseengineering tasks on input programs with varying degreesof obfuscation (e.g., stripped vs. unstripped binaries). Inaddition, the results reveal the relative effort required tocomplete a task and an assessment of the value of thetools and techniques.
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Authors: Stefanos Kaxiras, Georgios Keramidas
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

High-speed routers often use commodity, fully-associative,TCAMs (Ternary Content AddressableMemories) to perform packet classification and routing(IP-lookup). We propose a memory architecture calledIPStash to actasa TCAMreplacement,offering atthesame time, better functionality, higher performance,and significant power savings. The premise of our workis that full associativity is not necessary for IP-lookup.Rather, we show that the required associativity is simplya function of the routing table size. We propose a memoryarchitecture similar to set-associative caches butenhanced with mechanisms to facilitate IP-lookup andin particular longest prefix match. To perform longestprefix match efficiently in a set-associative array werestrict routing table prefixes to a small number oflengths using a controlled prefix expansion technique.Since this inflates the routing tables, we use skewedassociativity to increase the effective capacity of ourdevices. Compared to previous proposals, IPStash doesnot require any complicated routing table transformationsbut more importantly, it makes incrementalupdates to the routing tables effortless. The proposedarchitecture is also easily expandable. Our simulationsshow that IPStash is both fast and power efficient comparedto TCAMs. Specifically, IPStash devices -builtin the same technology as TCAMs- can run at speedsin excess of 600 MHz, offer more than twice the searchthroughput (>200Msps), and consume up to 35% lesspower (for the same throughput) than the best commerciallyavailable TCAMs when tested with real routingtables and IP traffic.
Response Surface Modeling of 100nm CMOS Process Technology using Design of Experiment
Authors: H. C. Srinivasaiah, Navakanta Bhat
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

100nm CMOS technology has been characterizedthrough Design of Experiment (DOE) and statisticalmodeling. Initially, a set of 21 process parameters (factors)have been identified to determine their impact on transistorperformance metrics such as threshold voltage Vt, sub-thresholdslope SS, drive current Iddrive, leakage currentIdleak, both in saturation and linear region.Through firstorder linear modeling of Vt, SS, Iddrive, and Idleak, a subset of 10 most significant process parameters are picked usingPlackett-Burman screening experiment for both NMOSand PMOS devices. Significant process parameters whichimpact the device characteristics are seen to be different,for NMOS and PMOS devices, inspite of a common processflow. Response surfaces (RS) have been built in terms of these 10 parameters for NMOS device. Statistical parametersof the device characteristics fluctuations like mean(µ)and standard deviation (\sigma) for Vt, SS, Iddrive, Idleak andGm (maximum transconductance), have been determinedby Monte carlo (MC) analysis of these response surfaces.Application of the Transmission of Moment Technique(TMT) on these models is shown to be a simple means todetermine µ and \sigma of the device characteristics, with simplemathematical calculations.
The role of knowledge artifacts in innovation management: the case of a chemical compound designer CoP
Authors: Stefania Bandini, Ettore Colombo, Gianluca Colombo, Fabio Sartori, Carla Simone
Venue: Communities and Technologies (2003)

The paper describes how the experience we gained in the interaction with a community of professionals, the Compound Designer CoP (involved in tire production), led to the identification of the role Knowledge Artifacts can play in the definition of computational supports of innovation management in the specific domain of chemical formulation for rubber compounds. The paper reports on an experience gained in a project we are involved in and on the technology that has been designed to support knowledge and innovation management in the involved company.
Wire Swizzling to Reduce Delay Uncertainty Due to Capacitive Coupling
Authors: Puneet Gupta, Andrew B. Kahng
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Reduction of worst-case delay and delay uncertainty due to capacitivecoupling is a still unsolved problem in physical design.We describe a routing only layout solution - swizzling - whichreduces worst-case coupling delay for long parallel wires suchas in wide on-chip global buses. We understand that swizzlingis a folklore in structured-custom design community but we arethe first to describe the method and analyze the potential benefitsin literature. We give a general method for construction of goodswizzling patterns. We also give empirically determined, optimalswizzling patterns for various technology nodes and typicalrepeater intervals. From our results, we see up to 31.5%reduction in worst-case delay and 34% reduction in delay uncertainty.
Information seeking and sharing in design teams
Authors: Steven Poltrock, Jonathan Grudin, Susan Dumais, Raya Fidel, Harry Bruce, Annelise Mark Pejtersen
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Information retrieval is generally considered an individual activity, and information retrieval research and tools reflect this view. As digitally mediated communication and information sharing increase, collaborative information retrieval merits greater attention and support. We describe field studies of information gathering in two design teams that had very different products, disciplinary backgrounds, and tools. We found striking similarities in the kinds of information they sought and the methods used to get it. For example, each team sought information about design constraints from external sources. A common strategy was to propose ideas and request feedback, rather than to ask directly for recommendations. Some differences in information seeking and sharing reflected differences in work contexts. Our findings suggest some ways that existing team collaboration tools could support collaborative information retrieval more effectively.
On Vertex-Triads in 3-Connected Binary Matroids
Authors: Haidong Wu
Venue: Combinatorics, Probability and Computing (1998)

A cocircuit C&#x002A; in a matroid M is said to be non-separating if and only if M&#x2216;C&#x002A;, the deletion of C&#x002A; from M, is connected. A vertex-triad in a matroid is a three-element non-separating cocircuit. Non-separating cocircuits in binary matroids correspond to vertices in graphs. Let C be a circuit of a 3-connected binary matroid M such that &#x2223;E(M)&#x2223;&ge;4 and, for all elements x of C, the deletion of x from M is not 3-connected. We prove that C meets at least two vertex-triads of M. This gives direct binary matroid generalizations of certain graph results of Halin, Lemos, and Mader. For binary matroids, it also generalizes a result of Oxley. We also prove that a minimally 3-connected binary matroid M which has at least four elements has at least &frac12;r&#x002A;(M)+1 vertex-triads, where r&#x002A;(M) is the corank of the matroid M. An immediate consequence of this result is the following result of Halin: a minimally 3-connected graph with n vertices has at least 2n+6&#x002F;5 vertices of degree three. We also generalize Tutte's Triangle Lemma for general matroids.
Adopting the entrepreneurial process in the study of information systems and small business
Authors: M. Gordon Hunter, Wayne A. Long
Venue: Managing IT in government business & communities (2003)

This document suggests the adoption of the Theory of Entrepreneurship by researchers who investigate the use of information systems by small businesses. The majority of existing research into this area tends to adopt results determined from investigations of larger businesses. Thus, the uniqueness of small business is not considered. Concepts such as strategic orientation, decision-making, and resource poverty contribute to the unique situation and approach taken by small business managers. The Theory of Entrepreneurship responds to these concepts. The framework suggests that organizations evolve and that entrepreneurs throughout this evolution face various challenges. The components of the Theory of Entrepreneurship are described here, in concert with the challenge to researchers to consider adopting this framework when conducting investigations into how information systems may be employed to support small business.
David vs. Goliath: An Analysis of Asymmetric Mixed-Strategy Games and Experimental Evidence
Authors: Wilfred Amaldoss, Sanjay Jain
Venue: Management Science (2002)

Mixed strategies are widely used to model strategic situations in diverse fields such as economics, marketing, political science, and biology. However, some of the implications of asymmetric mixed-strategy solutions are counterintuitive. We develop a stylized model of patent race to examine some of these implications. In our model two firms compete to develop a product and obtain a patent. However, one firm values the patent more because of its market advantages, such as brand reputation and distribution network. Contrary to some intuition, we find that the firm that values the patent less is likely to invest more aggressively in developing the product and will also win the patent more often. We argue that the reason for these counterintuitive results is inherent in the very concept of mixed strategy solution. In a laboratory test, we examine whether subjects' behavior conforms to the equilibrium predictions. We find that the aggregate behavior of our subjects is consistent with the game-theoretic predictions. With the help of the experience-weighted attraction (EWA) learning model proposed by Camerer and Ho (1999), we show that adaptive learning can account for the investment behavior of our subjects.We find that the EWA learning model tracks the investment decisions of our subjects well, whether we hold out trials or an entire group of subjects.
Temporal logic properties of Java objects
Authors: Radu Iosif, Riccardo Sisto
Venue: Journal of Systems and Software (2003)

Applying finite-state verification techniques to software systems looks attractive because they are capable of detecting very subtle defects in the logic design of these systems. Nevertheless, the integration of existing formal verification tools within programming environments is not yet easy, mainly because of the semantic gap between widely used programming languages and the languages used to describe system requirements. In this paper, we propose a formal requirement specification notation based on linear temporal logic, with regard to object oriented program elements, such as classes and interfaces. The specification is inherently object oriented and is meant for the verification of concurrent and distributed software systems.
An evaluation of the incorporation of a semantic network into a multidimensional retrieval engine
Authors: Jinho Lee, David Grossman, Ratko Orlandic
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

This paper describes a new method for incorporating a hierarchical category dimension into an Information Retrieval framework. The approach is to use the synonym sets and the hyponym ("is-a") relations defined within Wordnet in order to derive a conceptual hierarchical category dimension. The hierarchical nature of a category dimension not only provides an overview of a set of documents but also facilitates the effectiveness and the efficiency of searching documents. An evaluation is performed on two different types of models and the multidimensional approach shows a significant reduction in the number of page accesses over a large document collection.
Improving formatting documents by coupling formatting systems
Authors: Fateh Boulmaiz, Cécile Roisin, Frédéric Bes
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

In this paper, we present a framework for coupling an existing formatting system such as SMIL[7] and Madeus[13] with a formatting control system XEF[10]. This framework allows the coupling process to be performed at two levels: 1) the language level, which is concerned with how to link the control features of XEF and the elements of an existing formatting system, and 2) the formatter level, which deals with the creation of a new formatter by formatter composition.The overall objective is to provide more powerful and flexible formatting services to cover new needs such adaptive and/or generated presentations.
Intelligent Content-Based Retrieval for P2P Networks
Authors: Rodionov Maxim, Siu Cheung Hui
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Currently, most peer-to-peer (P2P) systems aredesigned for file sharing by network participants. Simplemeta-data search mechanism will be sufficient to supportsearching and retrieving shared files over P2P networks.However, to share document information such as newsarticles, scientific publications, company reports, etc., acontent-based search mechanism is needed to provideefficient content-based retrieval. In this paper, wepropose an intelligent P2P content-based documentretrieval system known as iSearch-P2P. In iSearch-P2P,we have incorporated an intelligent technique based onthe Fuzzy Adaptive Resonance Theory (Fuzzy ART)neural network to perform document clustering in orderto support content-based publishing and retrieval overP2P networks. With intelligent content-based search, theiSearch-P2P system supports scalability and avoidsindexing and query flooding problems of most existingP2P systems. In this paper, we describe the architecture,the publishing and retrieval processes, implementationand performance evaluation of the proposed iSearch-P2Psystem.
Wireless Location Privacy Protection
Authors: Bill Schilit, Jason Hong, Marco Gruteser
Venue: Computer (2003)

Positioning technologies have the potential to intrude on personal privacy.
Enhancing RUP business model with client-oriented requirements models
Authors: María Carmen Leonardi
Venue: UML and the unified process (2003)

This chapter presents a strategy for the construction of RUP business models using client-oriented requirements models that are written in natural language. The RUP business model, whose objective is to understand the context of the system, is represented with business use cases and a business objects model. As there is no concrete strategy for its development, an integration of client-oriented requirements models and strategies that enhance the construction process of the business model, while keeping the RUP philosophy of using the language of the customer for the first stages of development, are proposed in this chapter. These models describe the context of the system from a different perspective through the use of a lexical model to describe the vocabulary, a model of scenarios to describe the behavior, and a business rules model to describe the policies of the organization. These models are manipulated through a set of heuristics in order to define the UP business model and to enhance traceability between the models. We use a case study to exemplify the strategy throughout the entire chapter.