ppxscal/embedding_network huggingface dataset:
Multiple Scan Chains for Power Minimization during Test Application in Sequential Circuits
Authors: Nicola Nicolici, Bashir M. Al-Hashimi
Venue: IEEE Transactions on Computers (2002)

This paper presents a new technique for power minimization during test application in sequential circuits using multiple scan chains. The technique is based on a new design for test architecture and a novel test application strategy which reduces spurious transitions in the circuit under test. To facilitate the reduction of spurious transitions, the proposed design for test architecture is based on classifying scan latches into compatible, incompatible and independent scan latches. Based on their classification, the scan latches are partitioned into multiple scan chains and a single extra test vector associated with each scan chain is computed. A new test application strategy which applies the extra test vector to primary inputs while shifting out test responses for each scan chain, minimizes power dissipation by eliminating the spurious transitions which occur in the combinational part of the circuit. The newly introduced multiple scan chain-based technique does not introduce performance degradation and minimizes clock tree power dissipation with minimal impact on both test area and test data overhead. Unlike previous approaches which are test set dependent and, hence, are not able to handle large circuits due to the complexity of the design space, this paper shows that with low test area and test data overhead substantial savings in power dissipation during test application are achieved in very low computational time for both small and large test sets. For example, in the case of the benchmark circuit s15850 it takes \big.
Low-power VLSI decoder architectures for LDPC codes
Authors: Mohammad M. Mansour, Naresh R. Shanbhag
Venue: Proceedings of the 2002 international symposium on Low power electronics and design (2002)

Iterative decoding of low-density parity check codes (LDPC) using the message-passing algorithm have proved to be extraordinarily effective compared to conventional maximum-likelihood decoding. However, the lack of any structural regularity in these essentially random codes is a major challenge for building a practical low-power LDPC decoder. In this paper, we jointly design the code and the decoder to induce the structural regularity needed for a reduced complexity parallel decoder architecture. This interconnect-driven code design approach eliminates the need for a complex interconnection network while still retaining the algorithmic performance promised by random codes. Moreover, we propose a new approach for computing reliability metrics based on the BCJR algorithm that reduces the message switching activity in the decoder compared to existing approaches. Simulations show that the proposed approach results in power savings of up to 85.64% over conventional implementations.
Pure CORBA: A Code-Intensive Premium Reference
Authors: Fintan Bolton, Eamon Walshe
Venue:  (2001)

:PURE CORBA 3 is a premium, code-intensive reference for professional developers. It focuses on the core specification for CORBA 3 and contains:conceptual overview of CORBA 3.CORBA techniques programming reference that contains thousands of lines of commercial-quality code examples in both C++ and Java (the two most popular languages among CORBA developers).concise reference to the most important parts of the specification,
Teaching introductory Java through LEGO MINDSTORMS models
Authors: David J. Barnes
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

Innovative teachers are continually looking for creative ideas, both to get their ideas across and to hold the interest of their students. One of the latest trends is the use of LEGO&reg; MINDSTORMS&trade; kits [9] in various computing courses. These kits allow a wide variety of physical models to be built, some of which may be programmed via the RCX&trade; processor integrated into them. Using its standard firmware, the RCX device may be programmed through several different specialist languages. However, the additional availability of bytecode-compatible replacement firmware for the RCX makes the use of Java&trade; as the programming language for it a particularly attractive approach. In this paper, we explore some of the issues associated with choosing to program MINDSTORMS models using Java within the context of an introductory programming course. In particular, we consider the impact on the material that is taught, and the use of an appropriate API to support an objects-early programming style.
Low-cycle fatigue behavior and mechanisms of a lead-free solder 96.5Sn/3.5Ag
Authors: Chaosuan Kanchanomai, Yukio Miyashita, Yoshiharu Mutoh
Venue: Journal of Electronic Materials (2002)

Low-cycle fatigue tests of as-cast Sn-Ag eutectic solder (96.5Sn/3.5Ag) were performed using a noncontact strain controlled system at 20°C. The fatigue behavior followed the Coffin-Manson equation with a fatigue-ductility exponent of 0.76. Without local deformation and stress concentration at contact points between the extensometer and the specimen surface in strain-controlled fatigue tests, crack initiation and propagation behavior was observed on the specimen surface using a replication technique. After failure, the longitudinal cross sections were also examined using scanning electron microscopy (SEM). Microcracks initiated from steps at the boundary between the Sn-dendrite and the Sn-Ag eutectic structure and cavities along the boundaries especially around the Ag3Sn particles, Stage II crack propagated in mixed manner with intergranular cracks along the Sn-dendrite boundaries and transgranular cracks through the Sn-dendrites and the Sn-Ag eutectic structure. Propagation of stage II cracks could be expressed by the relation of dac/dN = 4.7 × 10-11[ΔJ]1.5, where ac is the average crack length and ΔJ is the J-integral range. After fatigue tests, small grains were observed in Sn-dendrites near the fracture surface.
Mastering and Using Microsoft Office 2000
Authors: H. Albert Napier, Philip J. Judd
Venue:  (1999)

:With an estimated completion time of 75 + hours, Mastering and Using Microsoft Office 2000 includes extensive end-of-chapter materials that provide reinforcement. It also uses case profiles to demonstrate real world applications of the material and case projects using all Office software to emphasize the application of new skills.
Complete Idiot's Guide to Music on the Internet with MP3
Authors: Nat Gertler, Roy Underhill
Venue:  (1999)

:Authors Roy Underhill and Nat Gertler give you a history of how MP3 came to exist and what the technology is. See how and where to find the technology and the music. Explore the legal issues that are brewing from recording companies and artists, what the implications are for the public, and what can and cannot be digitized. Roy and Nat share with you the "digital successes" of bands and individuals who have prospered through MP3. They offer pointers and tips for would-be artists who want to make a run for the music industry. CD-ROM contains Shareware, MP3 players and encoders, 50+ songs, and long non-music works such as books on tape
The structure of a linear chip firing game and related models
Authors: Eric Goles, Michel Morvan, Ha Duong Phan
Venue: Theoretical Computer Science (2002)

In this paper, we study the dynamics of sand grains falling in sand piles. Usually sand piles are characterized by a decreasing integer partition and grain moves are described in terms of transitions between such partitions. We study here four main transition rules. The worst classical one, introduced by Brylawski (Discrete Math. 6 (1973) 201) induces a lattice structure LB(n) (called dominance ordering) between decreasing partitions of a given integer n. We prove that a more restrictive transition rule, called SPM rule, induces a natural partition of LB(n) in suborders, each one is associated to a fixed point for the SPM rule. In the second part, we extend the SPM rule in a natural way and obtain a model called Linear Chip Firing Game (Theoret. Comput. Sci. 115 (1993) 321). We prove that this new model has interesting properties: the induced order is a lattice, a natural greedoid can be associated to the model and it also defines a strongly convergent game. In the last section, we generalize the SPM rule in another way and obtain other lattice structure parametrized by some , denoted by L(n,), which form a decreasing sequence of lattices when varies in [n+2,n]. For each , we characterize the fixed point of L(n,) and give the value of its maximal sized chain's length. We also note that L(n,n+2) is the lattice of all compositions of n.
Applications Migration; IBM to VAX, 1st edition
Authors: Alan R. Simon, Ted Davis
Venue:  (1992)

:Migrating applications from one computing environment to another is as complex a process as any in the area of computer systems development. This book discusses the many aspects of the migration process, particularly in the area of moving systems from the many IBM environments to those using Digital Equipment's computers.
Introduction to Simulation Using SIMAN, 2nd edition
Authors: C. Dennis Pegden, Randall P. Sadowski, Robert E. Shannon
Venue:  (1995)

:This book,written by the creators of SIMAN,provides an introduction to simulation modeling using the SIMAN simulation language. Basic modeling concepts and various simulation methodologies are discussed to highlight practical applications of simulation and SIMAN. The second edition has been updated to included the latest version of this simulation program,including the Cinema platform and Arena.
Computer Vision, 1st edition
Authors: George Stockman, Linda G. Shapiro
Venue:  (2001)

:Computer Vision presents the necessary theory and techniques for students and practitioners who will work in fields where significant information must be extracted automatically from images. It will be a useful resource automatically from images. It will be a useful resource book for professionals and a core text for both undergraduate and beginning graduate computer vision and imaging courses. Features Topics include image databases an virtual and augmented reality in addition to classical topics. Offers a complete view of two real-world systems that use computer vision. Contains applications from industry, medicine, land use, multimedia, and computer graphics. Includes over 250 exercises and programming projects, 48 separately defined algorithms, and 360 figures. The companion website features include image archive, sample
Approximating the Stretch Factor of Euclidean Graphs
Authors: Giri Narasimhan, Michiel Smid
Venue: SIAM Journal on Computing (2000)

There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in $\IR^d$. t-spanners are Euclidean graphs in which distances between vertices in G are at most t times the Euclidean distances between them; in other words, distances in G are "stretched" by a factor of at most t. We consider the interesting dual problem: given a Euclidean graph G whose vertex set corresponds to the set S, compute the stretch factor of G, i.e., the maximum ratio between distances in G and the corresponding Euclidean distances. It can trivially be solved by solving the all-pairs-shortest-path problem. However, if an approximation to the stretch factor is sufficient, then we show it can be efficiently computed by making only O(n) approximate shortest path queries in the graph G. We apply this surprising result to obtain efficient algorithms for approximating the stretch factor of Euclidean graphs such as paths, cycles, trees, planar graphs, and general graphs. The main idea behind the algorithm is to use Callahan and Kosaraju's well-separated pair decomposition.
Automated knowledge acquisition for instructional text generation
Authors: Cécile Paris, Keith Vander Linden, Shijian Lu
Venue: Proceedings of the 20th annual international conference on Computer documentation (2002)

Language generation systems have often been advocated for use in the generation of user documentation, but in practice, it is hard to use them because of the amount of knowledge they require as input. Without a readily available source of input, the knowledge acquisition bottleneck will prevent generation technology from ever being used. Unfortunately, knowledge acquisition for any domain-varying language generation application is difficult because there is seldom any single knowledge source or acquisition method that is adequate for acquiring the appropriate knowledge. This paper argues that this required knowledge can, in practice, be acquired from a heterogeneous set of complementary sources. It then presents Isolde, a support environment for technical writers that can mine these sources using an extensible set of specially tailored acquisition tools. These tools acquire instructional knowledge on-the-fly and consolidate it into a knowledge base that can drive instructional text generation.
3ds Max 4 Workshop: The Do-It-Yourself Approach to Learning...
Authors: Duane Loose, Dave Campbell
Venue:  (2001)

:3ds max 4 Workshop focuses on developing the skills of beginning and intermediate max 4 users by teaching them how to take advantage of the latest generation of discreet's premier digital content creation tool - 3ds max 4. Written from the point of view of a professional industrial designer, art director, animator and design educator, the Workshop projects in this book create a six-scene short movie titled Area51.avi. The interrelated tutorials on modeling, lighting, material development, special effects, animation, and compositing reveal how to structure your use of max to create professional-quality imagery using the basic tools and techniques inside 3ds max 4. 3ds max 4 Workshop boosts the beginning and intermediate digital artist to a higher level of max proficiency in the shortest time possible by revealing the principles and process used in professional digital content creation.
The Multiple Subset Sum Problem
Authors: Alberto Caprara, Hans Kellerer, Ulrich Pferschy
Venue: SIAM Journal on Optimization (2000)

In the {\em multiple subset sum problem} (MSSP) items from a given ground set are selected and packed into a given number of identical bins such that the sum of the item weights in every bin does not exceed the bin capacity and the total sum of the weights of the items packed is as large as possible.This problem is a relevant special case of the multiple knapsack problem, for which the existence of a polynomial-time approximation scheme (PTAS) is an important open question in the field of knapsack problems. One main result of the present paper is the construction of a PTAS for MSSP.For the bottleneck case of the problem, where the minimum total weight contained in any bin is to be maximized, we describe a 2/3-approximation algorithm and show that this is the best possible approximation ratio. Moreover, PTASs are derived for the special cases in which either the number of bins or the number of different item weights is constant.We finally show that, even for the case of only two bins, no fully PTAS exists for both versions of the problem.
Chrono Cross Official Strategy Guide
Authors: Dan Birlew, Ken Schmidt
Venue:  (2000)

:BradyGAMES Chrono Cross Official Strategy Guide Features: Thorough maps for both worlds and comprehensive side quest coverage. A bestiary and weapons, armor, accessories, and elements lists are included. Plus a detailed walkthrough revealing all side quests and strategies for every important battle!
Ccnp(TM) Support Study Guide (Exam 640-506)
Authors: Syngress Media Inc.
Venue:  (2000)

:The only classroom-based training and self-assessment system! Osborne's CCNP Support Study Guide provides 100% complete coverage of all objectives for exam 640-506. Based on 200,000+ hours of IT training experience,the book contains hundreds of practice exam questions and hands-on exercises. The CD-ROM features full CertTrainer CBT software with interactive tutorials and lab simulations,plus the new ExamSim adaptive test engine. The Only Certification Study System Based on 200,000+ Hours of It Training Experience. 100% complete Coverage - All test objectives for exam 640-506 are covered in detailHands-on Exercises - Step-by-step instruction modeled after classroom labsExam Watch - Warnings based on thorough post-exam research identifying the most troublesome exam topics and how to answer them correctlyThree Types of Practice Questions - Knowledge,scenario,and lab-based questions,all with in-depth answersFrom the Classroom - Discussion of important issues direct from the classroomFull coverage of the topics you need to review,including how to:Troubleshoot LANsIsolate problems in IPX networksUnderstand the output of diagnostic commandsIsolate problems in Frame Relay WANsUse Ping and TraceIsolate problems in ISDN BRI WANsIsolate catalyst problemsUnderstand cable and media distance limitationsUse catalyst POSTCD-ROM features full CertTrainer CBT software and the new ExamSim test engine - more than 200 questions on CD 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 three-dimensional holes closing algorithm
Authors: Zouina Aktouf, Gilles Bertrand, Laurent Perroton
Venue: Pattern Recognition Letters (2002)

Contrary to the 2D case, a 3D hole is not a subset of the 3D space. It is therefore not possible to use connected components search algorithms for detecting and suppressing 3D holes.In this paper, we propose an algorithm for suppressing 3D holes. It is based on properties of the previously introduced notion of topological number. Our algorithm is linear in time and it allows to control the "size" of the holes which are closed. As far as we know, this is the first 3D holes closing algorithm.
The Random Projection Method for Stiff Detonation Capturing
Authors: Weizhu Bao, Shi Jin
Venue: SIAM Journal on Scientific Computing (2001)

In this paper we present a simple and robust random projection method for underresolved numerical simulation of stiff detonation waves in chemically reacting flows. This method is based on the random projection method proposed by the authors for general hyperbolic systems with stiff reaction terms [W. Bao and S. Jin, J. Comput. Phys., 163 (2000), pp. 216--248], where the ignition temperature is randomized in a suitable domain. It is simplified using the equations of instantaneous reaction and then extended to handle the interactions of detonations. Extensive numerical experiments, including interaction of detonation waves, and in two dimensions, demonstrate the reliability and robustness of this novel method.
A Wigner-Measure Analysis of the Dufort--Frankel Scheme for the Schrödinger Equation
Authors: Peter A. Markowich, Paola Pietra, Carsten Pohl, Hans Peter Stimming
Venue: SIAM Journal on Numerical Analysis (2002)

We apply Wigner transform techniques to the analysis of the Dufort--Frankel difference scheme for the Schrödinger equation and to the continuous analogue of the scheme in the case of a small (scaled) Planck constant (semiclassical regime). In this way we are able to obtain sharp conditions on the spatial-temporal grid which guarantee convergence for average values of observables as the Planck constant tends to zero. The theory developed in this paper is not based on local and global error estimates and does not depend on whether or not caustics develop. Numerical test examples are presented to help interpret the theory and to compare the Dufort--Frankel scheme to other difference schemes for the Schr{ödinger equation.
Compiling Source Descriptions for Efficient and Flexible Information Integration
Authors: José Luis Ambite, Craig A. Knoblock, Ion Muslea, Andrew G. Philpot
Venue: Journal of Intelligent Information Systems (2001)

Integrating data from heterogeneous data sources is a critical problem that has received a great deal of attention in recent years. There are two competing approaches to address this problem. The traditional approach, which first appeared in Multibase and more recently in HERMES and TSIMMIS, often called global-as-view, defines the global model as a view on the sources. A more recent approach, sometimes referred to as local-as-view or view rewriting, defines the sources as views on the global model. The disadvantage of the first approach is that a person must re-engineer the definitions of the global model whenever any of the sources change or when new sources are added. The view rewriting approach does not suffer from this drawback, but the problem of rewriting queries into equivalent plans using views is computationally hard and must be performed for each query at run-time.In this paper we propose a hybrid approach that amortizes the cost of query processing over all queries by pre-compiling the source descriptions into a minimal set of integration axioms. Using this approach, the sources are defined in terms of the global model and then compiled into axioms that define the global model in terms of the sources. These axioms can be efficiently instantiated at run-time to determine the most appropriate rewriting to answer a query and facilitate traditional cost-based query optimization. Our approach combines the flexibility of the local-as-view approach with the run-time efficiency of the query processing in global-as-view systems. We have implemented this approach for the SIMS and Ariadne information mediators and provide empirical results that demonstrate that in practice the approach scales to large numbers of sources and that the approach can compile the axioms for a variety of real-world domains in a matter of seconds.
Teach Yourself PCs
Authors: Barry Press, Marcia Press
Venue:  (1998)

:A fast, easy, and economical tutorial that shows readers how to get the most out of PC technology through step-by-step instructions and real-world examples.
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications, 1st edition
Authors: Harri Holma, Antti Toskala
Venue:  (2000)

:Wideband code division multiple access (WCDMA) is the air interface technology selected by European Telecommunications Standard Institute (ETSI) and the major European and Japanese mobile communications operators. This technology is optimized to allow very high-speed multimedia services such as full-motion video, Internet access, and videoconferencing. Universal mobile telephony system (UMTS) refers to the next generation of cellular technology that is also being standardized by ETSI.
Java Programming with CORBA, Third Edition, 3rd edition
Authors: Gerald Brose, Andreas Vogel, Keith Duddy
Venue:  (2001)

:The leading guide for Java developers who build business applications with CORBAAcknowledged experts present advanced techniques and real-world examples for building both simple and complex programs using Java with CORBA. The authors begin with a quick overview of CORBA, Java, object request brokers (ORBs), and EJB components, then quickly move on to show how to use them to build complete Java applications. This new volume features in-depth code examples, as well as expanded coverage of cutting-edge topics, including Portable Object Adaptor (POA), Remote Method Invocation (RMI) over IIOP, and EJB.
Business to Business Internet Marketing: 5 Proven Strategies for Increasing Profits through Internet Direct Marketing, 1st edition
Authors: Barry Silverstein
Venue:  (1998)

:This book shows you how to effectively apply proven direct marketing principles to the new world of Business-to-Business Internet marketing - today's fastest growing segment of online commerce. This practical yet forward-thinking blueprint for success is packed with examples and real-world advice. You'll learn - step by step - five proven strategies for increasing profits by direct marketing to businesses over the internet. Included with the book is a User ID and password necessary for accessing the companion Web site which provides up-to-the-minute internet marketing news, updates to the book, expanded information, and other helpful online marketing resources. This book/Web site combination is unbeatable!