ppxscal/embedding_network huggingface dataset:
Interactive presentation: Automatic test pattern generation for maximal circuit noise in multiple aggressor crosstalk faults
Authors: Kunal P. Ganeshpure, Sandip Kundu
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Decreasing process geometries and increasing operating frequencies have made VLSI circuits more susceptible to signal integrity related failures. Capacitive crosstalk is one of the causes of such kind of failures. Crosstalk fault results from switching of neighboring lines that are capacitively coupled. Long nets are more susceptible to crosstalk faults because they tend to have a higher coupling capacitance to overall capacitance ratio. A typical long net has multiple aggressors. In generating patterns to create maximal crosstalk noise, it may not be possible to activate all aggressors at the same time. Therefore, pattern generation must focus on activating a maximal subset of aggressors weighted by actual coupling capacitance values. This is a variant of max-satisfiability problem. Unlike a traditional max-satisfiability problem, here we must deal with signal propagation to an observable output. In this paper, we present a novel solution that combines 0-1 Integer Linear Program (ILP) with traditional stuck-at fault ATPG. The maximal aggressor activation is formulated as a linear programming problem while the fault effect propagation is treated as an ATPG problem. The problems are separated by min-cut circuit partitioning technique based on Kernighan-Lin-Fiduccia-Mattheyses (KLFM) method. This proposed technique was applied to ISCAS 85 benchmark circuits. Results indicated that 75-100% of the aggressors could be switched for generating crosstalk noise while satisfying requirement of sensitizing a path to the output.
Problem-solving tools for engineering students
Authors: B. R. Dewey
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The common first course in the engineering curriculum has evolved from drafting/graphics to one in computer applications. Goals for such a course include the introduction of engineering methodologies, stimulation of interest in the study of engineering, and development of skills in using certain "tools". Candidate computing tools should solve equations such as those in engineering applications and produce various presentation graphics. High level programming languages have been in engineering curricula since the 1970s. Various solution programs have become available. The intuitive graphical user interface makes the use of spreadsheets appealing. As features have been added, we have found increasing use of spreadsheets for problem solving. An introductory course emphasizes basics, while subsequent courses introduce applications that work well on spreadsheets. 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
A physically based model for the registration of a 2D image sequence
Authors: Jiang Qian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper describes a new approach that registers two images based on a physically deformable model. No prior knowledge about the types of geometric transformations is required for registration. Instead, our approach simulates the manual registration process and models the registration as the deformation of an elastic material governed by physical laws. Before registration, the contours of the images are extracted. The registration consists of two steps. The physically deformable model is applied first to deform one contour, called the start contour, to match the other, the goal contour. The result is point correspondences between the contours. Then an intensity transformation is estimated from the matching points to warp one image towards the other.
Recovering device drivers
Authors: Michael M. Swift, Muthukaruppan Annamalai, Brian N. Bershad, Henry M. Levy
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

This paper presents a new mechanism that enables applications to run correctly when device drivers fail. Because device drivers are the principal failing component in most systems, reducing driver-induced failures greatly improves overall reliability. Earlier work has shown that an operating system can survive driver failures [33], but the applications that depend on them cannot. Thus, while operating system reliability was greatly improved, application reliability generally was not. To remedy this situation, we introduce a new operating system mechanism called a shadow driver. A shadow driver monitors device drivers and transparently recovers from driver failures. Moreover, it assumes the role of the failed driver during recovery. In this way, applications using the failed driver, as well as the kernel itself, continue to function as expected. We implemented shadow drivers for the Linux operating system and tested them on over a dozen device drivers. Our results show that applications and the OS can indeed survive the failure of a variety of device drivers. Moreover, shadow drivers impose minimal performance overhead. Lastly, they can be introduced with only modest changes to the OS kernel and with no changes at all to existing device drivers.
Police radio for multimedia communications based on 800 MHz wireless trunking system and GPS techniques
Authors: Minggang Ma, Xiao Jiao, Xinquan Tan, Xu Chen
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper describes a recently developed remote monitoring system, based on a combination of embedded computing, digital signal processing, wireless communications, GPS, and trunking system technologies. The system includes mini camera, portable mobile trunking radio installed inside each monitored vehicle and a central station located in police office. The trunking system we used is 800 MHz Motorola's TETRA system.
Intersections of multiple cone classes for signal modeling and detection
Authors: S. A. Ramprashad
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The use of cone classes for signal detection and estimation is relatively new. Cone classes and the cone detector have shown potential as a viable alternative to subspace detection. The addition of new quadratic forms that model a wider range of signal characteristics, and the extension to using intersections of single cones, now makes it possible to apply cone classes to a wider range of practical problems. These extensions have resulted in a number of different types of intersection classes. Each type requires a different algorithm to implement the generalized likelihood ratio test (GLRT) used for signal detection. The authors classify these types and outline the possible solutions to implement the GLRT. New examples of signal classes modeled using cones are also given.
Multi-Class Measurement Based Admission Control for a QoS Framework with Dynamic Resource Management
Authors: Thomas Bohnert, Edmundo Monteiro
Venue: Journal of Network and Systems Management (2007)

The advent of a Premium Service (PS) featuring Internet is still pending, mainly due its difficult deployment. But do we really need Quality of Service like PS? Likely no. We are therefore investigating an alternative QoS model, which is more flexible to deploy at the expense of looser QoS guarantees. We call it a Better-than-Best-Effort (BBE) service. What distinguishes our approach from traditional ones is dynamic resource management based on measurements and ruled by Perceptual QoS. What yet has been missing was Admission Control (AC) and in this paper we present our latest advance. Based on the existence of measurements taken by the queueing module, we developed a Measurement Based AC algorithm. Design goal was simplicity and general applicability in terms of independence from statistical assumptions. Likely the most interesting finding is that even a very simple design proofed to be reasonably effective for our BBE service, mainly due to a cross-layer design, i.e. cooperation between dynamic resource management on queuing level and AC. This is the conclusion a comprehensive simulative performance evaluating.
Multi-person interaction and activity analysis: a synergistic track- and body-level analysis framework
Authors: Sangho Park, Mohan M. Trivedi
Venue: Machine Vision and Applications (2007)

This paper presents a synergistic track- and body-level analysis framework for multi-person interaction and activity analysis in the context of video surveillance. The proposed two-level analysis framework covers human activities both in wide and narrow fields of view with distributed camera sensors. The track-level analysis deals with the gross-level activity patterns of multiple tracks in various wide-area surveillance situations. The body-level analysis focuses on detailed-level activity patterns of individuals in isolation or in groups. &#x2018;Spatio-temporal personal space&#x2019; is introduced to model various patterns of grouping behavior between persons. &#x2018;Adaptive context switching&#x2019; is proposed to mediate the track-level and body-level analysis depending on the interpersonal configuration and imaging fidelity. Our approach is based on the hierarchy of action concepts: static pose, dynamic gesture, body-part action, single-person activity, and group interaction. Event ontology with human activity hierarchy combines the multi-level analysis results to form a semantically meaningful event description. Experimental results with real-world data show the effectiveness of the proposed framework.
Eyes on the road, hands on the wheel: thumb-based interaction techniques for input on steering wheels
Authors: Iván E. González, Jacob O. Wobbrock, Duen Horng Chau, Andrew Faulring, Brad A. Myers
Venue: Proceedings of Graphics Interface 2007 (2007)

The increasing quantity and complexity of in-vehicle systems creates a demand for user interfaces which are suited to driving. The steering wheel is a common location for the placement of buttons to control navigation, entertainment, and environmental systems, but what about a small touchpad? To investigate this question, we embedded a Synaptics StampPad in a computer game steering wheel and evaluated seven methods for selecting from a list of over 3000 street names. Selection speed was measured while stationary and while driving a simulator. Results show that the EdgeWrite gestural text entry method is about 20% to 50% faster than selection-based text entry or direct list-selection methods. They also show that methods with slower selection speeds generally resulted in faster driving speeds. However, with EdgeWrite, participants were able to maintain their speed and avoid incidents while selecting and driving at the same time. Although an obvious choice for constrained input, on-screen keyboards generally performed quite poorly.
Neuro-fuzzy based approach for hybrid force/position robot control
Authors: Y. Touati, K. Djouani, Y. Amirat
Venue: Integrated Computer-Aided Engineering (2004)

This paper presents neuro-fuzzy control approach for MIMO systems. Motivated by the hybrid force/position control of robot manipulator problem, a systematic design procedure is proposed for fuzzy rules generation and optimization. The construction of the proposed neuro-fuzzy controller consists in three phases. In the first phase, which is called parameters learning phase, the neuro-fuzzy system is considered as feed-forward neural network and back-propagation learning algorithm is then applied for parameters identification in order to map Input/Output data. In the second phase, a new clustering algorithm based on the inclusion concept is used for optimal clusters identification. Finally, the fuzzy rules base is generated and optimized. The performances of the control approach are improved by introducing a Reference Model (RM), which is able to cope with Robot/Environment interaction variations. A 2 DOF planar manipulator force/position control simulation is presented and results discussed.
Binary Arithmetic
Authors: Neville Holmes
Venue: Computer (2007)

The basic aspects of computer arithmetic are how numbers are represented and the operations performed on those representations.
Statistically-hiding commitment from any one-way function
Authors: Iftach Haitner, Omer Reingold
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We give a construction of statistically-hiding commitment schemes (ones where the hiding propertyholds information theoretically), based on the minimal cryptographic assumption that one-way functions exist. Our construction employs two-phase commitment schemes, recently constructed by Nguyen, Ong and Vadhan (FOCS '06), and universal one-way hash functions introduced and constructedby Naor and Yung (STOC '89) and Rompel (STOC '90).
On the partial terminal Steiner tree problem
Authors: Sun-Yuan Hsieh, Huang-Ming Gao
Venue: The Journal of Supercomputing (2007)

We investigate a practical variant of the well-known graph Steiner tree problem. For a complete graph G = ( V,E ) with length function l:E ¿ R + and two vertex subsets R ¿ V and R ¿ ¿ R, a partial terminal Steiner tree is a Steiner tree which contains all vertices in R such that all vertices in R ¿ R ¿ belong to the leaves of this Steiner tree. The partial terminal Steiner tree problem is to find a partial terminal Steiner tree T whose total lengths ¿ (u,v) ¿T l ( u,v ) is minimum. In this paper, we show that the problem is both NP-complete and MAX SNP-hard when the lengths of edges are restricted to either 1 or 2. We also provide an approximation algorithm for the problem.
FPGA Implementation of Low Power Parallel Multiplier
Authors: Sanjiv Kumar Mangal, Raghavendra B. Deshmukh, Rahul M. Badghare, R. M. Patrikar
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In the fast growing communication field, requirements of low power designs are increasing to reduce the power losses and decrease the thermal losses in the same ratio. Multiplier is an arithmetic circuit that is extensively used in common DSP and Communication applications. This paper presents low power multiplier design methodology that inserts more number of zeros in the multiplicand thereby reducing the number of switching activities as well as power consumption. Use of look up table is an added feature to this design. Modifying the structure of adders further reduces switching activity.
Don't optimize existing protocols, design optimizable protocols
Authors: Jiayue He, Jennifer Rexford, Mung Chiang
Venue: ACM SIGCOMM Computer Communication Review (2007)

As networks grow in size and complexity, network management has become an increasingly challenging task. Many protocols have tunable parameters, and optimization is the process of setting these parameters to optimize an objective. In recent years, optimization techniques have been widely applied to network management problems, albeit with mixed success. Realizing that optimization problems in network management are induced by assumptions adopted in protocol design, we argue that instead of optimizing existing protocols, protocols should be designed with optimization in mind from the beginning. Using examples from our past research on traffic management, we present principles that guide how changes to existing protocols and architectures can lead to optimizable protocols. We also discuss the trade-offs between making network optimization easier and the overhead these changes impose.
Stratified Bounded Affine Logic for Logarithmic Space
Authors: Ulrich Schopp
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

A number of complexity classes, most notably PTIME, have been characterised by sub-systems of linear logic. In this paper we show that the functions computable in log-arithmic space can also be characterised by a restricted version of linear logic. We introduce Stratified Bounded Affine Logic (SBAL), a restricted version of Bounded Linear Logic, in which not only the modality ! but also the universal quantifier is bounded by a resource polynomial. We show that the proofs of certain sequents in SBAL represent exactly the functions computable logarithmic space. The proof that SBAL-proofs can be compiled to LOGSPACE functions rests on modelling computation by interaction dialogues in the style of game semantics. We formulate the compilation of SBAL-proofs to space-efficient programs as an interpretation in a realisability model, in which realisers are taken from a Geometry of Interaction situation.
Scheme-Based Systematic Exploration of Natural Numbers
Authors: Madalina Hodorog, Adrian Craciun
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by Bruno Buchberger. We illustrate with examples from the exploration: (i) the invention of new concepts (functions, relations) in the theory, using knowledge schemes, (ii) the invention of new propositions, using proposition schemes, (iii) the invention of problems, using knowledge schemes, (iv) the introduction of new reasoning rules, by lifting knowledge to the inference level, after their correctness was proved.
Locality and Loop Scheduling on NUMA Multiprocessors
Authors: Hui Li, Sudarsan Tandri, Michael Stumm, Kenneth C. Sevcik
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

An improtant issue in the parallel execution of loops is how to partition and schedule the loops onto the available processors. While most existing dynamic scheduling algorithms manage to load imbalance well, they fail to take locality into account and therefore perform poorly on parallel systems with non-uniform memory access times.
Optimality conditions and duality for a class of nondifferentiable multi-objective fractional programming problems
Authors: Sanming Liu, Enmin Feng
Venue: Journal of Global Optimization (2007)

A class of multi-objective fractional programming problems (MFP) are considered where the involved functions are locally Lipschitz. In order to deduce our main results, we give the definition of the generalized (F,¿,¿,d)-convex class about the Clarke's generalized gradient. Under the above generalized convexity assumption, necessary and sufficient conditions for optimality are given. Finally, a dual problem corresponding to (MFP) is formulated, appropriate dual theorems are proved.
A Service-Oriented Data Integration and Analysis Environment for In Silico Experiments and Bioinformatics Research
Authors: Xiaorong Xiang, Gregory Madey, Jeanne Romero-Severson
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In this paper, we present a practical experiment of building a service-oriented system upon current web services technologies and bioinformatics middleware. The system allows scientists to extract data from heterogeneous data sources and generate phylogenetic comparisons automatically. This can be difficult to accomplish using manual search tools since sequence data is rapidly accumulating. A web-based environment enables scientists to more effectively define a task, perform the task at a desired time, monitor the execution status, and view the results. The first prototype of this system is being evaluated on a phylogenetic research application, Mother of Green (MoG). Our evaluation demonstrates that a service-oriented architecture can accelerate scientific research, increase research productivity, and provide a new approach to doing science. We also discuss issues in design and implementation of the system and identify our future research directions to enhance the system.
Notes from the second USENIX workshop on electronic commerce
Authors: Michael Harkavy, Andrew Myers, J. D. Tygar, Alma Whitten, H. Chi Wong
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

These are notes taken from the Second USENIX Workshop on Electronic Commerce from November 1996. They record presentations and questions from this workshop.
A theoretical & empirical znalysis of evolutionary testing and hill climbing for structural test data generation
Authors: Mark Harman, Phil McMinn
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

Evolutionary testing has been widely studied as a technique for automating the process of test case generation. However, to date, there has been no theoretical examination of when and why it works. Furthermore, the empirical evidence for the effectiveness of evolutionary testing consists largely of small scale laboratory studies. This paper presents a first theoretical analysis of the scenarios in which evolutionary algorithms are suitable for structural test case generation. The theory is backed up by an empirical study that considers real world programs, the search spaces of which are several orders of magnitude larger than those previously considered.
Architecture and Design Intent: An Experience Report
Authors: Paul S. Grisham, Matthew J. Hawthorne, Dewayne E. Perry
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

As part of a graduate course on software architecture and design intent, we designed a class project in which teams of students performed software engineering tasks that required them to understand the design of an open source project and evolve the architectural design in response to a set of additional functional requirements. The students used intentbased design approaches and notation systems to document intent for architectural design features. We use the students' experiences with these methodologies to explore the potential usefulness of intent-based modeling approaches to system architecture, and also to gain insight into directions for further research.
Video understanding for complex activity recognition
Authors: Florent Fusier, Val&#x00e9;ry Valentin, Fran&#x00e7;ois Br&#x00e9;mond, Monique Thonnat, Mark Borg, David Thirde, James Ferryman
Venue: Machine Vision and Applications (2007)

This paper presents a real-time video understanding system which automatically recognises activities occurring in environments observed through video surveillance cameras. Our approach consists in three main stages: Scene Tracking, Coherence Maintenance, and Scene Understanding. The main challenges are to provide a robust tracking process to be able to recognise events in outdoor and in real applications conditions, to allow the monitoring of a large scene through a camera network, and to automatically recognise complex events involving several actors interacting with each others. This approach has been validated for Airport Activity Monitoring in the framework of the European project AVITRACK.