ppxscal/embedding_network huggingface dataset:
Preliminary Validation of an Approach Dealing with Processor Obsolescence
Authors: L. Anghel, R. Velazco, S. Saleh, S. Deswaertes, A. El Moucary
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Processor obsolescence is a big concern affecting most equipments involved in safety critical applications (automotive, aerospace, nuclear plants, military applications ¿). Indeed, such applications are active years longer than was originally anticipated.A method for validating the solution consisting in the replacement of a processor not anymore available into the market by its emulated version by means of an FPGA is presented in this paper.The Motorola 6800 processor is used as test vehicle to illustrate the key aspects of the explored validation plan. Significant experimental results and their impact on the HDL description will be discussed.
Patterns within patterns
Authors: Aaron Marcus
Venue: interactions (2004)

Design patterns enable people to envision the future: not only developers, but all stakeholders.
MemMap: Technology Mapping Algorithm for Area Reduction in FPGAs with Embedded Memory Arrays Using Reconvergence Analysis
Authors: Manoj A. Kumar, Jayaram Bobba, V Kamakoti
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Modern day Field Programmable Gate Arrays (FPGA) include in addition to Look-up Tables, reasonably big configurable Embedded Memory Blocks (EMB) to cater to the on-chip memory requirements of systems/applications mapped on them. While mapping applications on to such FPGAs, some of the EMBs may be left unused. This paper presents a methodology to utilize such unused EMBs as large look-up tables to map multi-output combinational sub-circuits of the application, which, otherwise would be mapped on to a number of small Look-Up Tables (LUT) available on the FPGA. This inturn leads to a huge reduction in the area of the FPGA, utilized for mapping an application. Experimental results show that our proposed methodology, when employed on popular benchmark circuits, can lead to additional 50% reduction in area utilized when compared with other methodologies reported in the literature.
Design of Silicon-Based Suspended Inductors for UHF Applications
Authors: F. Sandoval-Ibarra, L. Flores-Gómez
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

In this paper we present technological proceduresto obtain suspended inductors for UHF applications,where the dominant element is the so-called planarinductor. This element does not have up to now a highquality factor Q because in the IC silicon approachinductors suffer of losses due to the conductivesubstrate. Therefore, the performance of a planarinductor is improved by eliminating the siliconsubstrate below the planar spiral (hereafter namedbulkless inductor). Thus, in order to minimizephotolitographic steps, in this paper we are proposinga suitable silicon etching procedure to increase thequality factor of planar inductors by using just 4photolitographic steps. From simulation results weobtained an inductance of 23 nH (5.85 nH per turn)that represents an augment of 750% when it iscompared with a conventional planar inductor.
A Built-in-Self-Test Scheme for Digital to Analog Converters
Authors: Sunil Rafeeque, Vinita Vasudevan
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper describes a new Built-In-Self-Test(BIST)scheme for estimation of static non-linearity errors in digitalto analog converters (DACs). The BIST schememeasures each transition and estimates non-linearity errors.It makes use of a sample and subtract circuit and aVCO. The circuit is designed using 0:35µm CMOS technologyfrom AMS. The simulation results are included inthis paper. Errors estimated using the BIST scheme simulationmatch well with measured errors.
The framework for approximate queries on simulation data
Authors: B. Lee, T. Critchlow, G. Abdulla, C. Baldwin, R. Kamimura, R. Musick, R. Snapp, N. Tang
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

AQSim is a system intended to enable scientists to query and analyze a large volume of scientific simulation data. The system uses the state of the art in approximate query processing techniques to build a novel framework for progressive data analysis. These techniques are used to define a multi-resolution index, where each node contains multiple models of the data. The benefits of these models are twofold: (1) they have compact representations, reconstructing only the information relevant to the analysis, and (2) the variety of models capture different aspects of the data which may be of interest to the user but are not readily apparent in their raw form. To be able to deal with the data interactively, AQSim allows the scientist to make an informed tradeoff between query response accuracy and time. In this paper, we present the framework of AQSim with a focus on its architectural design. We also show the results from an initial proof-of-concept prototype developed at LLNL. The presented framework is generic enough to handle more than just simulation data.
An Enhanced Passive Testing Tool for Network Protocols
Authors: Dongluo Chen, Jianping Wu, Tan Ieong Chu
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

We study passive testing on protocols to detect faults in network devices. An enhanced passive testing tool is developed using integer linear programming in determining the ranges of the variables. On-line pruning reveals the current configuration of the system and the transition covered. Network system monitoring is conducted in a formal and fine-granularity way.
Models of Emerging Contexts in Risky and Complex Decision Settings
Authors: C. Gustav Lundberg
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Key components of the multiple constraint satisfaction framework are explored in a series of experiments set in complex and ambiguous domains. All cases show the prevalence and importance of a purposeful structuring of the information by the participants. The participantsgradually generate coherence even without increasing information. In accordance with multiple constraint satisfaction predictions, the assessments of inferences increasingly spread apart. Also, the correlations between the dependent variable (the decision) and the independent variables, as well as between the independent variables, consistently grow stronger as the participants progress through the decision stages. The information structuring¿ a gradual simplification of the component structure-- is captured as principal components associated with the various decision stages. Neural networks predict the judgments in the various decision stages relatively well. Finally, the role of the ongoing structuring of the underlying information was explored through the application of trained networks to data in other decision stages.
Findings from a Practical Project Concerning Web Usage Mining
Authors: Frank Dellmann, Holger Wulff, Stefan Schmitz
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In a practical project a statistical analysis of the Weblog files of the domain www.volkswagen.de was carriedout by using the CRISP-DM procedure. For the preprocessingphase, more profound findings could be gainedthan are usually described in many studies. Since the aimwas to deduce significant statements while measuring theeffect, tests of significance for e-metrics were used inaddition to the commonly described procedure.
Multi-tiered distributed computing platform
Authors: Andrew Page, Thomas Keane, Richard Allen, Thomas J. Naughton, John Waldron
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

A simple programmable Java platform-independent distributed computation system has been developed to exploit the free resources on computers linked together by a network. It is a multi-tiered distributed system model, which is unbounded in principal. The system consists of an n-ary tree of nodes where the internal nodes perform the scheduling and the leaves do the processing. The scheduler nodes communicate in a peer-to-peer manner and the processing nodes operate in a strictly client-server manner with their respective scheduler. The independent schedulers on each tier dynamically allocate resources between jobs based on the constantly changing characteristics of the underlying network. The system has been evaluated over a network of 90 PCs with a bioinformatics application.
Developing multiagent systems: The Gaia methodology
Authors: Franco Zambonelli, Nicholas R. Jennings, Michael Wooldridge
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2003)

Systems composed of interacting autonomous agents offer a promising software engineering approach for developing applications in complex domains. However, this multiagent system paradigm introduces a number of new abstractions and design/development issues when compared with more traditional approaches to software development. Accordingly, new analysis and design methodologies, as well as new tools, are needed to effectively engineer such systems. Against this background, the contribution of this article is twofold. First, we synthesize and clarify the key abstractions of agent-based computing as they pertain to agent-oriented software engineering. In particular, we argue that a multiagent system can naturally be viewed and architected as a computational organization, and we identify the appropriate organizational abstractions that are central to the analysis and design of such systems. Second, we detail and extend the Gaia methodology for the analysis and design of multiagent systems. Gaia exploits the aforementioned organizational abstractions to provide clear guidelines for the analysis and design of complex and open software systems. Two representative case studies are introduced to exemplify Gaia's concepts and to show its use and effectiveness in different types of multiagent system.
Sensible Authentication
Authors: Bruce Schneier
Venue: Queue (2004)

The problem with securing assets and their functionality is that, by definition, you don’t want to protect them from everybody. It makes no sense to protect assets from their owners, or from other authorized individuals (including the trusted personnel who maintain the security system). In effect, then, all security systems need to allow people in, even as they keep people out. Designing a security system that accurately identifies, authenticates, and authorizes trusted individuals is highly complex and filled with nuance, but critical to security.
Recognizing string graphs in NP
Authors: Marcus Schaefer, Eric Sedgwick, Daniel Štefankovič
Venue: Journal of Computer and System Sciences (2003)

A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curves intersect. We show that string graphs can be recognized in NP. The recognition problem was not known to be decidable until very recently, when two independent papers established exponential upper bounds on the number of intersections needed to realize a string graph (Mutzel (Ed.), Graph Drawing 2001, Lecture Notes in Computer Science, Springer, Berlin; Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-2001)). These results implied that the recognition problem lies in NEXP. In the present paper we improve this by showing that the recognition problem for string graphs is in NP, and therefore NP-complete, since Kratochvíl showed that the recognition problem is NP-hard (J. Combin Theory, Ser. B 52). The result has consequences for the computational complexity of problems in graph drawing, and topological inference. We also show that the string graph problem is decidable for surfaces of arbitrary genus.
Solving Rank-Deficient and Ill-posed Problems Using UTV and QR Factorizations
Authors: Leslie V. Foster
Venue: SIAM Journal on Matrix Analysis and Applications (2003)

The algorithm of Mathias and Stewart [Linear Algebra Appl., 182 (1993), pp. 91--100] is examined as a tool for constructing regularized solutions to rank-deficient and ill-posed linear equations. The algorithm is based on a sequence of QR factorizations. If it is stopped after the first step, it produces the same solution as the complete orthogonal decomposition used in LAPACK's xGELSY. However, we show that for low-rank problems a careful implementation can lead to an order of magnitude improvement in speed over xGELSY as implemented in LAPACK. We prove, under assumptions similar to assumptions used by others, that if the numerical rank is chosen at a gap in the singular value spectrum and if the initial factorization is rank-revealing, then, even if the algorithm is stopped after the first step, approximately half the time its solutions are closer to the desired solution than are the singular value decomposition (SVD) solutions. Conversely, the SVD will be closer approximately half the time, and in this case overall the two algorithms are very similar in accuracy. We confirm this with numerical experiments. Although the algorithm works best for problems with a gap in the singular value spectrum, numerical experiments suggest that it may work well for problems with no gap.
Mobile Shopping Site Selection: The Consumers' Viewpoint
Authors: Jen-Her Wu, Yu-Min Wang, Wei-Chun Tai
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

While mobile technologies and applications are rapidly and widely utilized in electronic commerce, it is extremely important to better understand the evaluative criteria from the consumers' viewpoint in mobile-shopping site selection. This paper investigated the consumer-oriented criteria for mobile shopping site selection. A questionnaire was developed and tested to prove its reliability and validity. Initial analyses of mobile shopping characteristics important for the environment were explored. The final criteria list includes three factors: merchandise, enabling functions, and assurance.
An Approach for Checking Persistent Route Oscillation of BGP
Authors: Hongjun Wang, Ruijun Wang, Chunghong Zhang, Yuan Gao
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

The Border Gateway Protocol allows an autonomous system independently to formulate its own local policies for selecting routes and propagating the route to its neighbor autonomous systems. Without the coordination of autonomous systems, the policies of different ASes can be conflicts that cause route oscillation. Route oscillation can significantly degrade the overall efficiency of the Internet. This paper presents a scheme to check persistent route oscillation of BGP. The scheme is composed of several server/client frameworks distributing on the Internet backbone. The server is responsible for finding the possible oscillation, and constructing the dispute cycle that indicates the existing of policies conflict. Some times, in order to check whether the changing routes form a dispute cycle, the servers need to cooperate. If the dispute cycle can be constructed, then there must be policies conflict. By this means, we can find the ASes and the paths involved in the route oscillation. So we can adjust or modify the interrelated policies of some ASes and make them consistent.
A compositional logic for proving security properties of protocols
Authors: Nancy Durgin, John Mitchell, Dusko Pavlovic
Venue: Journal of Computer Security (2003)

We present a logic for proving security properties of protocols that use nonces (randomly generated numbers that uniquely identify a protocol session) and public-key cryptography. The logic, designed around a process calculus with actions for each possible protocol step, consists of axioms about protocol actions and inference rules that yield assertions about protocols composed of multiple steps. Although assertions are written using only steps of the protocol, the logic is sound in a stronger sense: each provable assertion about an action or sequence of actions holds in any run of the protocol that contains the given actions and arbitrary additional actions by a malicious attacker. This approach lets us prove security properties of protocols under attack while reasoning only about the sequence of actions taken by honest parties to the protocol. The main security-specific parts of the proof system are rules for reasoning about the set of messages that could reveal secret data and an invariant ride called the "honesty rule".
Adding numbers to text classification
Authors: Sofus A. Macskassy, Haym Hirsh
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Many real-world problems involve a combination of both text- and numerical-valued features. For example, in email classification, it is possible to use instance representations that consider not only the text of each message, but also numerical-valued features such as the length of the message or the time of day at which it was sent. Text-classification methods have thus far not easily incorporated numerical features. In earlier work we described an approach for converting numerical features into bags of tokens so that text classification methods can be applied to numerical classification problems, and showed that the resulting learning methods are competitive with traditional numerical classification methods. In this paper we use this as a way to learn on problems that involve a combination of text and numbers. We show that the results outperform competing methods. Further, we show that selecting a best classification method using text-only features and then adding numerical features to the problem (as might happen if numerical features are only later added to a pre existing text-classification problem) gives performance that rivals a more time-consuming approach of evaluating all classification methods using the full set of both text and numerical features.
Computing Silent Gate Models for Noise Analysis from Slew and Delay Tables
Authors: Shabbir Batterywala, Narendra Shenoy
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

In this paper, we present a new approach to calculate the steady state resistancevalues for CMOS library gates. These resistances are defined as simple equivalentmodels with which the gate can be replaced when its output is steady HIGH orsteady LOW. Traditional ASIC libraries are characterized for slew and delay for statictiming signoff. These represent the behavior of gates during switching. However, fornoise analysis we require models for gates when the output is stable. The objective ofthis work is to derive such models from circuits characterized for slew. This enables adesigner to stay in the familiar STA (Static Timing Analysis) environment and performnoise analysis. We write the non-linear current-voltage relationship of the conductingPMOS or NMOS transistor. This relationship is interpreted as a non-linear resistor.We use it to compute output transition times in a simplified circuit. These transitiontimes are matched with appropriate entry in slew table for the gate. The value of non-linearresistor is calculated from this match. The limiting value of this non-linear resistorgives the steady state resistance. The resistance values are compared with thoseobtained using HSPICE simulation. An excellent match is observed. These resistancesare used during noise analysis. For better accuracy a voltage dependent form of theseresistors can be used, which results in a non-linear circuit to be analyzed. An efficientmethod is detailed which uses reduced order models for the interconnect, non-linearport resistance models for the silent gates and standard Thevenin source models forthe transitioning aggressor gates. Equations are formulated in a manner that leadsto a positive definite matrix. It facilitates iterative methods like Gauss Seidel for fastsolution. Experimental results with 0.13um industry examples are given to supportthe suggested methods.
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Authors: Stephen D. Bay, Mark Schwabacher
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal of finding fast algorithms for this task. We show that a simple nested loop algorithm that in the worst case is quadratic can give near linear time performance when the data is in random order and a simple pruning rule is used. We test our algorithm on real high-dimensional data sets with millions of examples and show that the near linear scaling holds over several orders of magnitude. Our average case analysis suggests that much of the efficiency is because the time to process non-outliers, which are the majority of examples, does not depend on the size of the data set.
Parallel programming concepts in a definitional language
Authors: J. L. W. Kessels
Venue: ACM SIGPLAN Notices (1976)

A sequential programming language forces the programmer to prescribe explicitly the order in which the operations in his program have to be executed; even if the order is not relevant to the solution of his problem. The requirement to indicate irrelevant sequencing can be removed if the language provides facilities to specify a task in a nonprocedural manner. In general, a program specified in this way will allow concurrent evaluation.This paper describes a conceptual framework for a high level programming language providing nonprocedural and sequential facilities. In one program nonprocedural and sequential program modules may be nested in an arbitrary order and to an arbitrary depth.
Los Angeles SIGSPACE/SIGSOFT/SIGPLAN December meeting
Authors: David C. Bixler
Venue: ACM SIGPLAN Notices (1981)

Have you ever heard of an AN/UYK-41 or an AN/UYK-49? How about MIL-STD-1750A or MIL-STD-1862? Or Nebula? Do they incorporate innovative techniques as supportive targets for modern HOLs? Will they impact the practices and environments in which we develop computer systems? Well, all of these are new computer systems or computer architecture specifications for DoD; so if you design systems or program computers for military projects, you'll be living with them for the next ten years! Find out what they are, how they came about, and what impact these computer standards will have on you in the future. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player