ppxscal/embedding_network huggingface dataset:
A Genetic Algortithm for Automatic Generation of Test Logic for Digital Circuits
Authors: F. Corno, P. Prinetto, M. Sonza Reorda
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Testing is a key issue in the design and production of digital circuits: the adoption of BIST (Built-In Self-Test) techniques is increasingly popular, but sometimes requires efficient algorithms for the automatic generation of the logic which generates the test vectors applied to the Unit Under Test. This paper addresses the issue of identifying a Cellular Automaton able to generate input patterns to detect stuck-at faults inside a Finite State Machine (FSM). A suitable hardware structure is first identified. A Genetic Algorithm is then proposed, which directly identifies a Cellular Automaton able to reach a very good Fault Coverage of the stuck-at faults. The novelty of the method consists in combining the generation of test patterns with the synthesis of a Cellular Automaton able to reproduce them. Experimental results are provided, which show that in most of the standard benchmark circuits the Cellular Automaton selected by the Genetic Algorithm is able to reach a Fault Coverage close to the maximum one. Our approach is the first attempt of exploiting evolutionary techniques for identifying the hardware for input pattern generation in BIST structures.
Hardware Composition with Hardware Flowcharts and Process Algebras
Authors: Juin-Yeu Joseph Lu, Jang Dae Kim, Shiu-Kai Chin
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Algorithmic state machine (ASM) descriptions or hardware flowcharts have been used successfully to describe and verify large systems like the IBM 3081. Hardware flowcharts are intuitively appealing in their specification of control flow and data path operations. Nevertheless, previous mechanizations of hardware flowcharts lacked a formal semantics which prevented 1) a rigorous analysis of implementations refined from ASM descriptions, and 2) the ability to equate composed ASM descriptions to purely behavioral descriptions. To address these concerns, we describe an algorithmic register transfer language which has a formal semantics along with an algebra which is used to reason about composed ASM descriptions.
Variants of the Chandy-Misra-Bryant Distributed Discrete-Event Simulation Algorithm
Authors: Wen Su, Charles L. Seitz
Venue:  (1988)

No abstract available.
Linear Congruential Generators Over Elliptic Curves
Authors: Sean Hallgren
Venue:  (2001)

Random numbers are useful in many applications such as Monte Carlo simulation, randomized algorithms, games, and password generation. It is important to be able to prove facts about pseudo-random number generators, both about the distribution and the predictability of the pseudo-random numbers. I discuss a pseudo-random number generator based on elliptic curves taken over finite fields. This class of generators can produce provably good pseudo-number generators. Also, I prove that the analog of a faster pseudo-random number generator embedded in an elliptic curve fails to produce good pseudo-random numbers.
New Economy and Economic Growth in Europe and the U. S.
Authors: David B. Audretsch, Paul J. Welfens
Venue:  (2002)

:The New Economy in Europe and the US poses many unexplored issues. The authors present innovative theoretical and empirical analysis on Internet dynamics, productivity growth and organizational changes in selected OECD countries. New empirical findings related to telecommunications, Internet and growth also are presented. Based on the theoretical and empirical analyses various policy options are developed. Policy measures, both at the regional and national levels, can stimulate structural change, knowledge diffusion and economic growth. Different governance strategies for the Internet and e-commerce are identified from a global perspective.
Neural Networks for Wordform Recognition
Authors: Martin Eineborg, Bjorn Gamback
Venue:  (1994)

The paper outlines a method for automatic lexical acquisition using three-layered back-propagation networks. Several experiments have been carried out where the performance of different network architectures have been compared to each other on two tasks: overall part-of-speech (noun, adjective or verb) classification and classification by a set of 13 possible output categories. The best results for the simple task were obtained by networks consisting of 204-212 input neurons and 40 hidden-layer neurons, reaching a classification rate of 93.6%. The best result for the more complex task was 96.4%, which was achieved by a net with 423 input neurons and 80 hidden-layer neurons. These results are rather promising and the paper compares them to the performance reported by rule-based and purely statistical methods; a comparison that shows the neural network completely compatible with the statistical approach. The rule-based method is, however, still better, even though it should noted that the task that the rule-based system performs is somewhat different from that of the neural net.
Incremental Markov-Model Planning
Authors: Richard Washington
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper presents an approach to building plans using partially observable Markov decision processes. The approach begins with a base solution that assumes full observability. The partially observable solution is incrementally constructed by considering increasing amounts of information from observations. The base solution directs the expansion of the plan by providing an evaluation function for the search fringe. We show that incremental observation moves from the base solution towards the complete solution, allowing the planner to model the uncertainty about action outcomes and observations that are present in real domains.
Streaming Audio: The FezGuys' Guide
Authors: Jon Luini, Allen Whitman
Venue:  (2002)

:Streaming Audio: The FezGuys' Guide will introduce you to streaming audio and teach you how to work with the most popular formats, including RealMedia, Windows Media, QuickTime, and MP3. It begins by giving the reader a comprehensive overview of the most up-to-date streaming technologies available and the process of preparing audio for streaming. Then, it walks the reader through encoding into both live and on-demand streams in each format. Following an in-depth walk-through of serving the audio, Streaming Audio: The FezGuys' Guide offers several case studies that carefully break down how streaming audio is used in the real world: the internationally acclaimed rock guitarist Joe Satriani's web site, primarily using on-demand files with the occasional live stream for special events; the ultrahip drum 'n' bass, downtempo and ambient music Internet-only radio station SomaFM offering several live MP3 streams in multiple bi trates; and the FM station that started it all, KPIG-FM, terrestrial broadcast radio that streams it's programming online. Finally, the FezGuys illustrate a variety of advanced techniques, including optimizing, equalizing, creating playlists, batch encoding, dealing with legal issues, and more.
Approximate strong separation with application in fractional graph coloring and preemptive scheduling
Authors: Klaus Jansen
Venue: Theoretical Computer Science (2003)

In this paper we show that approximation algorithms for the weighted independent set and s-dimensional knapsack problem with ratio a can be turned into approximation algorithms with the same ratio for fractional weighted graph coloring and preemptive resource constrained scheduling. In order to obtain these results, we generalize known results by Grötschel, Lovasz and Schrijver on separation, non-emptiness test, Optimization and violation in the direction of approximability.
A Novel Channel-Adaptive Uplink Access Control Protocol for Nomadic Computing
Authors: Yu-Kwong Kwok, Vincent K. N. Lau
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

We consider the uplink access control problem in a mobile computing system, which is based on a cellular phone network in that a user can use the mobile device to transmit voice or file data. This resource management problem is important because efficient solution to uplink access control is critical for supporting a large user population with a reasonable level of quality of service (QoS). While there are a number of recently proposed protocols for uplink access control, these protocols possess a common drawback in that they do not exploit well the burst error properties, which are inevitable in a wireless communication system. In this paper, we propose a novel TDMA-based uplink access protocol, which employs a channel state dependent allocation strategy. Our protocol is motivated by two observations: (1) when channel state is bad, the throughput is low due to large amount of FEC (forward error correction) or excessive ARQ (automatic repeated request) is needed; and (2) because of (1), much of the mobile device's energy is wasted. The proposed protocol works closely with the underlying physical layer in that through observing the channel state information (CSI) of each mobile user, the MAC protocol first segregates a set of users with good CSI from requests gathered in the request contention phase of an uplink frame. The protocol then judiciously allocates channel bandwidth to contending users based on their channel conditions. Simulation results indicate that the proposed protocol considerably outperforms five state-of-the-art protocols in terms of packet loss, delay, and throughput.
It's your choice-on the design and implementation of a flexible metalevel architecture
Authors: C. Zimmermann, V. Cahill
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Traditional configurable operating systems typically provide a fixed and limited set of functionality. We propose a metalevel architecture, where application-defined objects can choose from a rich selection of possible configurations and are therefore able to dynamically change the way in which they are executed to the configuration that suits best. This allows applications to adapt operating system behaviour to even unanticipated requirements during run-time. A distributed application which processes multimedia data serves as an example to illustrate the concepts described.
A PARALLEL RENDERING ALGORITHM FOR MIMD ARCHITECTURES
Authors: Thomas W. Crockett, Tobias Orloff
Venue:  (1991)

Applications such as animation and scientific visualization demand high performance rendering of complex three dimensional scenes. To deliver the necessary rendering rates, highly parallel hardware architectures are required. The challenge is then to design algorithms and software which effectively use the hardware parallelism. This paper describes a rendering algorithm targeted to distributed memory MIMD architectures. For maximum performance, the algorithm exploits both object-level and pixel-level parallelism. The behavior of the algorithm is examined both analytically and experimentally. Its performance for large numbers of processors is found to be limited primarily by communication overheads. An experimental implementation for the Intel iPSC/860 shows increasing performance from 1 to 128 processors across a wide range of scene complexities. It is shown that minimal modifications to the algorithm will adapt it for use on shared memory architectures as well.
A New Hybrid Method for Solving Constraint Optimization Problems in Anytime Contexts
Authors: Samir Loudni, Patrice Boizumault
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

In this paper, we present a new hybrid method for solving constraint optimization problems in anytime contexts. We use the Valued Constraint Satisfaction Problem (VCSP) framework to model numerous discrete optimization problems. Our method (VNS/LDS+CP) combines a Variable Neighborhood Search (VNS) scheme with Limited Discrepancy Search (LDS) using Constraint Propagation (CP) to evaluate cost and legality of moves made by VNS. Our experimental results on real-word problem instances demonstrate that our method clearly outperforms both LNS/CP/GR (another hybrid method which also relies on the VCSP framework) and other standard local search methods as Simulated-Annealing. This confirm the benefit of the use, in a local search, of the LDS partial search with constraint propagation.
Leveraging agent properties to assure survivability of distributed multi-agent systems
Authors: Marshall Brinn, Mark Greaves
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The nature of distributed multi-agent systems makes assuring their survivability under stress particularly challenging. However, the nature of distributed agent-based systems also brings the potential to address these particular challenges, and, indeed, to assure survivability to a degree beyond that possible in non-agent-based architectures. This extended abstract synopsizes a paper detailing approaches that are rooted in the essential properties of agent software architectures to assure the survivability of distributed agent-based systems. Specifically, the paper describes efforts under the DARPA UltraLog program to formulate a survivability argument based on properties of agent architectures. This extended abstract truncates many details from the original; interested readers are encouraged to contact the authors for the complete paper.
BiCGStab(l) for families of shifted linear systems
Authors: A. Frommer
Venue: Computing (2003)

We consider a seed system Ax = b together with a shifted linear system of the form (A + σI)x = b, σ ∈ C, A ∈ Cn×n, b ∈ Cn. We develop modifications of the BiCGStab(l) method which allow to solve the seed and the shifted system at the expense of just the matrix-vector multiplications needed to solve Ax = b via BiCGStab(l). On the shifted system, these modifications do not perform the corresponding BiCGStab(l)-method, but we show, that in the case that A is positive real and σ ≥ 0, the resulting method is still a well-smoothed variant of BiCG. Numerical examples from an application arising in quantum chromodynamics are given to illustrate the efficiency of the method developed.
AutoCAD 2004 and AutoCAD LT 2004: No Experience Required, 3 edition
Authors: David H. Frey
Venue:  (2003)

:AutoCAD 2004 and AutoCAD LT 2004: No Experience Required is your step-by-step introduction to the latest versions of AutoCAD and AutoCAD LT, the industry-leading design and drafting programs used by architects, engineers, drafters, and design teams worldwide. Inside this perfectly-paced guide are the clear-cut explanations and practical, step-by-step tutorials that you need to create, develop, and complete even the most elaborate AutoCAD projects. Gain the Imperative AutoCAD Skills Finding your way around AutoCAD and LT Understanding basic commands Applying AutoCAD's coordinate systems Setting up a drawing Mastering drawing strategies Employing Polar and Object Snap Tracking Setting up layers, colors, and linetypes Using blocks and Wblocks Dragging AutoCAD objects from one drawing to another Generating elevations and orthographic views Working with hatches and fills Controlling text in a drawing Managing external references Setting up layouts and printing an AutoCAD drawing Using AutoCAD's tool palettes Creating and rendering a 3D model Setting up attributes About the Author David Frey has been teaching AutoCAD to AEC design professionals, engineers, and high school students and teachers for ten years. His books for Sybex include three previous best-selling editions of AutoCAD 2002: No Experience Required and AutoCAD 2000 Visual JumpStart. David holds a Master's degree in architecture from UC Berkeley.
The Hidden Power of PhotoShop Elements 2, 1 edition
Authors: Richard Lynch
Venue:  (2002)

:Until now, Adobe Photoshop Elements hasn't been considered powerful or full-featured enough for serious image correction. This book changes that forever. Powerful, advanced tools that lie hidden inside Photoshop Elements are turned loose as you turn through every section and discover new methods. All you need are the techniques found in this book and the author's custom Hidden Power tools included on the CD. These tools are powerful enhancements that unlock key features like Curves, channel separations (RGB and CMYK), and masking. Soon you'll be able to do more than you ever thought possible with your images, including: Radically upgrade the quality of results using channels, custom separations, and image luminosity. Alter reality by creating new photo-realistic objects and adding them to existing images. Create dynamic images for the web using animation, slices, and rollovers. Correct and enhance image tone and color using Curves, Color Balance and custom layer blending tools. Make complicated masks and advanced selections to easily target your corrections Create original, scalable line art for logos by harnessing the power of custom vectors The enclosed CD contains an extraordinary collection of tools that expand what you can do with Photoshop Elements by unveiling powerful features hidden under the hood, including: Calculations, Channels, Clipping Paths, Color Balance, Curves, custom vectors, Masking, Snapshots, Color Separations (RGB, CMYK, Color and Luminosity, and RGBL), enhanced sharpening, and more! The CD also contains 70 image and project files to use while working along with the book's exercises. 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
MACAO - A Journey into CAx Interoperability and Collaborative Design
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The increasing parallelization of development processes as well as the ongoing trends towards virtual product development and outsourcing of development activities strengthen the need for 3D co-operative design via communication networks. Regarding the field of CAx, none of the existing systems meets all the requirements of very complex process chain. This leads to a tremendous need for the integration of heterogeneous CAx systems. Therefore, MACAO, a platform-independent client for a distributed CAx component system, the so-called ANICA CAx object bus, is presented. The MACAO client is able to access objects and functions provided by different CAx servers distributed over a communication network. Thus, MACAO is a new solution for engineering design and visualization in shared distributed virtual environments. This paper describes the underlying concepts, the actual prototype implementation, as well as possible application scenarios in the area of co-operative design and visualization.
Low-rate TCP-targeted denial of service attacks: the shrew vs. the mice and elephants
Authors: Aleksandar Kuzmanovic, Edward W. Knightly
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Denial of Service attacks are presenting an increasing threat to the global inter-networking infrastructure. While TCP's congestion control algorithm is highly robust to diverse network conditions, its implicit assumption of end-system cooperation results in a well-known vulnerability to attack by high-rate non-responsive flows. In this paper, we investigate a class of low-rate denial of service attacks which, unlike high-rate attacks, are difficult for routers and counter-DoS mechanisms to detect. Using a combination of analytical modeling, simulations, and Internet experiments, we show that maliciously chosen low-rate DoS traffic patterns that exploit TCP's retransmission time-out mechanism can throttle TCP flows to a small fraction of their ideal rate while eluding detection. Moreover, as such attacks exploit protocol homogeneity, we study fundamental limits of the ability of a class of randomized time-out mechanisms to thwart such low-rate DoS attacks.
Modelling secure multiagent systems
Authors: Haralambos Mouratidis, Paolo Giorgini, Gordon Manson
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Security plays an important role in the development of multiagent systems. However, a careful analysis of software development processes shows that the definition of security requirements is, usually, considered after the design of the system. This is, mainly, due to the fact that agent oriented software engineering methodologies have not integrated security concerns throughout their developing stages. The integration of security concerns during the whole range of the development stages could help towards the development of more secure multiagent systems. In this paper we introduce extensions to the Tropos methodology to enable it to model security concerns throughout the whole development process. A description of the new concepts is given along with an explanation of how these concepts are integrated to the current stages of Tropos. An example from the health care sector is used to illustrate the above.
The VLSI Revolution in Theoretical Circles
Authors: Arnold Rosenberg
Venue:  (1984)

Presented in these pages are personal observations concerning the effect that Very Large Scale Integrated circuit technology (VLSI) has had on the Theoretical Computer Science field and community, together with some guesses as to why this technological advance has had so much more profound an effect on the Community than have had numerous earlier technological advances. The tale spun includes some sociology, some technology, and some history--as well as some theoretical material, mostly as illustration.
Performance Evaluation of Two-Shadow Speculative Concurrency Control
Authors: Azer Bestavros, Spyridon Braoudakis, Euthimios Panagos
Venue:  (1993)

Abstract Speculative Concurrency Control (SCC) is a new concurrency control approach especially suited for real-time database applications. It relies on the use of redundancy to ensure that serializable schedules are discovered and adopted as early as possible, thus increasing the likelihood of the timely commitment of transactions with strict timing constraints. In a recent publication by two of the authors, SCC-nS, a generic algorithm that characterizes a family of SCC-based algorithms was described, and its correctness established by showing that it only admits serializable histories. In this paper, we evaluate the performance of the Two-Shadow SCC algorithm (SCC-2S), a member of the SCC-nS family, which is notable for its minimal use of redundancy. In particular, we show that SCC-2S (as a representative of SCC-based algorithms) provides significant performance gains over the widely used Optimistic Concurrency Control with Broadcast Commit (OCC-BC), under a variety of operating conditions and workloads.
Soft decision decoding of block codes using artificial neural network
Authors: S. E. El-Khamy, E. A. Youssef, H. M. Abdou
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

A soft decision decoder of linear block codes based on artificial neural networks (ANN) is presented. Various structures of the ANN decoder (ANND) are introduced and compared with the optimum soft-decision decoding (SDD) and hard-decision decoding (HDD) methods. Although the performance of the SDD is still optimum, the massive parallel nature of the neural network is shown to be more suitable to high data rate communication systems for which optimum decoding is impractical because of complexity and time consumption. The proposed ANND bridges the gap in performance and complexity between HDD and SDD. It is shown that the proposed receiver has superior performance in noisy channels with low signal to noise ratios.