ppxscal/embedding_network huggingface dataset:
Computer-Aided Design of Analog Integrated Circuits and Systems
Authors: Brian A. Antao, Georges G. E. Gielen
Venue:  (2002)

:The tools and techniques you need to break the analog design bottleneck!Ten years ago, analog seemed to be a dead-end technology. Today, System-on-Chip (SoC) designs are increasingly mixed-signal designs. With the advent of application-specific integrated circuits (ASIC) technologies that can integrate both analog and digital functions on a single chip, analog has become more crucial than ever to the design process. Today, designers are moving beyond hand-crafted, one-transistor-at-a-time methods. They are using new circuit and physical synthesis tools to design practical analog circuits; new modeling and analysis tools to allow rapid exploration of system level alternatives; and new simulation tools to provide accurate answers for analog circuit behaviors and interactions that were considered impossible to handle only a few years ago.To give circuit designers and CAD professionals a better understanding of the history and the current state of the art in the field, this volume collects in one place the essential set of analog CAD papers that form the foundation of today's new analog design automation tools. Areas covered are:Analog synthesisSymbolic analysisAnalog layoutAnalog modeling and analysisSpecialized analog simulationCircuit centering and yield optimizationCircuit testingComputer-Aided Design of Analog Integrated Circuits and Systems is the cutting-edge reference that will be an invaluable resource for every semiconductor circuit designer and CAD professional who hopes to break the analog design bottleneck.
The Inherent Cost of Nonblocking Commitment
Authors: Cynthia Dwork, Dale Skeen
Venue:  (1983)

A commitment protocol orchestrates the execution of a distributed transaction, allowing each participant to ``vote'''' on the transaction and then applying a pre-specified rule to decide the outcome (commit or abort). A nonblocking is able to correctly terminate a transaction at all operational participants in the presence of any number of benign processor failures. Herein, we derive strong lower bounds for both non-blocking protocols and their less fault-tolerant blocking counterparts. Results on message complexity are both surprising and encouraging: the message complexities of the two classes of protocols are identical. Results on time complexity were less encouraging: nonblocking protocols are approximately 50% more expensive. However, we show how to overlap non-blocking executions of interfering transactions and thereby reduce their extra cost.
The Nonprofits' Guide to Internet Communications Law
Authors: Bruce R. Hopkins, Sheree Parris Nudd
Venue:  (2002)

:This book summarizes, analyzes, and explains the federal, state and local fund-raising law that is applicable to communications by and other activities of tax-exempt organizations by means of the Internet. The focus on specific law is minimal; the book extrapolates guidance from existing legal principles for Internet-using nonprofit organizations.
3D simulation of concrete cracking: probabilistic formulation in a parallel environment
Authors: C. N. M. Paz, L. F. Martha, E. M. R. Fairbairn, J. L. D. Alves, N. F. F. Ebecken, A. L. G. A. Coutinho
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This work presents a probabilistic crack approach based on the Monte Carlo method, implemented in a 3D fully parallelized finite element code (Paz, [1]). The cracking scheme used is the discrete crack approach. In this approach the heterogeneity of the material is taken into account by considering the properties to vary spatially following a normal distribution determined by the mean and the standard deviation of the considered material properties.Fracturing is modeled by 3D interface elements generated in a previously defined region within the mesh (Paz [1]). The interface elements are triangular base prisms connecting adjacent faces of neighboring tetrahedra. These elements simulate crack opening through relative displacements between the triangular faces.
Acceleration Sensing Glove
Authors: John Kangchun Perng, Brian Fisher, Seth Hollar, Kristofer S. J. Pister
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

A glove with 2-axis accelerometers on the finger tips and back of the hand has been built using commercial-off-the-shelf components. Taking advantage of gravity induced acceleration offsets, we have been able to identify pseudo static gestures. We have also developed software that allows the glove to be used as a mouse pointing device for a Windows 95 or NT machine.
Reconstructing the unknown volatility function
Authors: Thomas F Coleman, Yuying Li, Arun Verma
Venue:  (1998)

Using market European option prices, a method for computing a {\em smooth} local volatility function in a 1-factor continuous diffusion model is proposed. Smoothness is introduced to facilitate accurate approximation of the true local volatility function from a finite set of observation data. It is emphasized that accurately approximating the true local volatility function is crucial in hedging even simple European options, and pricing exotic options. A spline functional approach is used: the local volatility function is represented by a spline whose values at chosen knots are determined by solving a constrained nonlinear optimization problem. The optimization formulation is amenable to various option evaluation methods; a partial differential equation implementation is discussed. Using a synthetic European call option example, we illustrate the capability of the proposed method in reconstructing the unknown local volatility function. Accuracy of pricing and hedging is also illustrated. Moreover, it is demonstrated that, using a different constant implied volatility for an option with different strike/maturity can produce erroneous hedge factors. In addition, real market European call option data on the S&P 500 stock index is used to compute the local volatility function; stability of the approach is demonstrated.
Matcher Neural Networks
Authors: Peter Z. Revesz
Venue:  (1989)

This paper presents a powerful new class of neural networks called matcher neural networks. In many ways they are physiologically and psychologically better models for the brain than current connectionist models.
Digital Photography All-in-One Desk Reference For Dummies
Authors: David D. Busch
Venue:  (2003)

:Do you dream in digital color? If you picture yourself sharing great vacation shots with family and friends or restoring your grandmother's baby pictures, this fun reference guide can make that dream come true. Seven minibooks cover equipment from economical to extravagant, studio setup, enhancement and restoration, picture-taking tips, online galleries, and a whole lot more.
Bayesian kernel methods
Authors: Alexander J. Smola, Bernhard Schölkopf
Venue: Advanced lectures on machine learning (2003)

Bayesian methods allow for a simple and intuitive representation of the function spaces used by kernel methods. This chapter describes the basic principles of Gaussian Processes, their implementation and their connection to other kernel-based Bayesian estimation methods, such as the Relevance Vector Machine.
Optimal Software Multicast on Wormhole Switch-based Networks
Authors: Kuo-Pao Fan, Chung-Ta King
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

High bandwidth and low latency switches are commercially available. Using these switches, it has become a popular and cost-effective way to interconnect workstations together as a parallel computing platform. The interconnection topology is usually irregular. On such systems, multicast is an important collective communication operation. In this paper, we study how to perform multicast on irregular switch-based networks assuming no special hardware support. Our proposed multicast algorithm is implemented completely at the software level by sending multiple unicast messages. We also prove that it is optimal in terms of the number of communication steps to accomplish the multicast without channel contention in each step. Performance of the proposed algorithm is evaluated by simulation.
Towards the Semantic Web: Ontology-driven Knowledge Management
Authors: John Davies, Dieter Fensel, Frank van Harmelen
Venue:  (2003)

:"Towards the Semantic Web focuses on the application of Semantic Web technology and ontologies in particular to electronically available information to improve the quality of knowledge management in large and distributed organizations. Covering the key technologies for the next generation of the WWW, this book is a mixture of theory, tools and applications in an important area of WWW research." Aimed primarily at researchers and developers in the area of WWW-based knowledge management and information retrieval. It will also be a useful reference for students in computer science at the postgraduate level, academic and industrial researchers in the field, business managers who are aiming to increase the corporations' information infrastructure and industrial personnel who are tracking WWW technology developments in order to understand the business implications.
An Integrated Bayesian Approach to Layer Extraction from Image Sequences
Authors: P. H. S. Torr, R. Szeliski, P. Anandan
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

This paper describes a Bayesian approach for modeling 3D scenes as a collection of approximately planar layers that are arbitrarily positioned and oriented in the scene. In contrast to much of the previous work on layer based motion modeling, which compute layered descriptions of 2D image motion, our work leads to a 3D description of the scene.We focus on the key problem of automatically segmenting the scene into layers as a precursor to recovery of stereo disparity data. The prior assumptions about the scene are formulated within a Bayesian decision making framework, and are then used to automatically determine the number of layers and the assignment of individual pixels to layers. Although using a collection of 3D layers has been previously proposed as an efficient and effective representation for multimedia applications, results to date have relied on hand segmentation. In contrast, the work described here aims at getting a fully automatic segmentation.
Extension of Piyavskii''s Algorithm to Continuous Global Optimization
Authors: Robert J. Vanderbei
Venue:  (1997)

We use the simple, but little-known, result that a uniformly continuous function on a convex set is $\epsilon$-Lipschitz (as defined below) to extend Piyavskii''s algorithm for Lipschitz global optimization to the larger domain of continuous (not-necessarily-Lipschitz) global optimization.
Impact of On-Chip Inductance When Transitioning from Al to Cu Based Technology
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

How does on-chip inductance impact timing closure when transitioning from Al to Cu based technology? This paper presents some experimental results based on a Al-based 0.18 µm CMOS process and a Cu-based 0.13 µm CMOS process. The results show that the impact of on-chip inductance is slightly more on the Cu-based 0.3 µm process than on the Al-based 0.18 µm process. Furthermore, the results demonstrate that on-chip inductance plays an insignificant role if we assume a perfect power supply network around the interconnect routes. 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
Digital Photography Expert: Portrait Photography
Authors: Michael Freeman
Venue:  (2003)

:Hundreds of beautiful color photographs show how to master photography's most popular subject: the art of portraiture. By combining traditional photographic skills with the limitless possibilities offered by digital, this expert guide helps amateurs successfully portray people in the rituals of daily life, frame the figure in the image, utilize high-speed techniques to catch memorable moments, and create a picture essay to document an event. Find out a variety of ways to photograph groups, babies, and children; capture the fleeting expression; and get the right lighting for character and drama. Follow the tips for shooting unobserved on the street and doing reportage; for using wide-angle or medium telephoto techniques; and for dealing respectfully with other cultures. Be the photographer whom everyone wants to record family gatherings, weddings, and other special occasions. And, of course, there's also advice on taking a formal portrait, including how to set up a makeshift studio.
Mining Association Rules in Text Databases Using Multipass with Inverted Hashing and Pruning
Authors: John D. Holt, Soon M. Chung
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

In this paper, we propose a new algorithm named Multipass with Inverted Hashing and Pruning (MIHP) for mining association rules between words in text databases. The characteristics of text databases are quite different from those of retail transaction databases, and existing mining algorithms cannot handle text databases efficiently because of the large number of itemsets (i.e., words) that need to be counted. Two well-known mining algorithms, the Apriori algorithm [1] and the Direct Hashing and Pruning (DHP) algorithm [8], are evaluated in the context of mining text databases, and are compared with the proposed MIHP algorithm. It has been shown that the MIHP algorithm has better performance for large text databases.
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
Authors: Michael Fredman, Monika Henzinger
Venue:  (1995)

We prove lower bounds on the complexity of maintaining fully dynamic $k$-edge or $k$-vertex connectivity in plane graphs and in $(k-1)$-vertex connected graphs. We show an amortized lower bound of $\Omega (\log n / {k (\log \log n} + \log b))$ per edge insertion, deletion, or query operation in the cell probe model, where $b$ is the word size of the machine and $n$ is the number of vertices in $G$. We also show an amortized lower bound of $\Omega( \log n /(\log \log n + \log b))$ per operation for fully dynamic planarity testing in embedded graphs. These are the first lower bounds for fully dynamic connectivity problems.
A Working-Set Approach to Reduce the Download-Execution Time of Mobile Programs
Authors: Tsutomu GAMOU
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

The on-demand downloading of application code over a wireless network is an emerging paradigm for the distributed environment of mobile computing devices. In this environment, a user must wait while a mobile computing device fetches the application code over the network prior to execution. To reduce this downloading latency, we have developed a download approach based on working sets, and have designed and implemented a working-set generator that defines working sets by focusing on the intervals during which a program refers to functions, variables, and constants. The program invocation times with thisapproach, simulated using trace information obtained from actual program behavior on Linux, have been compared with those of all-at-once, page, class, and symbol download approaches. This simulation showed that the working-set approach can reduce the download-execution time compared to that with the four other approaches. 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
Impact of Data Compression on Energy Consumption of Wireless-Networked Handheld Devices
Authors: Rong Xu, Zhiyuan Li, Cheng Wang, Peifeng Ni
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We investigate the use of data compression to reduce thebattery consumed by handheld devices when downloadingdata from proxy servers over a wireless LAN. To make acareful trade-off between the communication energy and theoverhead to perform decompression, we experiment withthree universal lossless compression schemes, using a popularhandheld device in a wireless LAN environment and wefind interesting facts.The results show that, from the battery-saving perspective,the gzip compression software (based on LZ77) tobe far superior to bzip2 (based on BWT) and compress(based on LZW). We then present an energy model to estimatethe energy consumption for the compressed downloading.With this model, we further reduce the energy costof gzip by interleaving communication with computationand by using a block-by-block selective scheme based on thecompression factor of each block. We also use a thresholdfile size below which the file is not to be compressed beforetransferring.
Specification of a Scilab Meta-Computing Extension
Authors: Sylvain Contassot-Vivier, Frédéric Lombard, Jean-Marc Nicod, Laurent Philippe
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Scilabis an application for numerical algebraic computations developed in the Méta-2 INRIA project. This program contains a toolbox allowing the realization of complex simulations with high transparency for the user. Nevertheless, computation times and data sizes may be quite large. Thus, it seems interesting to provide an access to the power of parallel computers to the Scilab users. A parallel version is already available, Scilab //, but it requires a direct connection to a parallel computer, or a network of workstations. Moreover, the parallelism is explicit and the users must have a good skill in parallelism. This is why we propose, in this article, a Meta-Computing extension of Scilab in order to keep a high level of transparency according to the user. Thus, a non-specialist user will be able to make parallel computations without knowing how the data are distributed and what parallel server has been chosen to make the computations. Moreover, this must be possible from a simple Scilab session running on a classical workstation. The client/server model used in this platform is a classical example of the use of an object-oriented distributed system, like those following the CORBA norm. We describe, in this article, the rules for the use of such a tool and the set of CORBA services, which have to be designed to realize this task. In particular, we point out the need for a localization service and a trader. Some problems like data persistence over the servers and a synchronism between independent Scilab instructions must be studied.
Finite-State Testing and Analysis of Graphical User Interfaces
Authors: Fevzi Belli
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Based on finite-state automata (FSA) and equivalent regular expressions, the paper introduces a holistic view of fault modeling that can be carried out as a complementary step to systemmodeling, revealing much rationalization potential.Appropriate formal notions will be sed to introduce efficient algorithms to systematically generate and select test cases.The completeness of the test can be determined exploiting the link coverage of the state transition diagram of the FSA that models both the desired and undesired behavior of the system under test; this enables a precise scalability of the test and analysis process, leading to a better cost-effectiveness. The elements of the approach will be narrated by realistic examples which will be used also to validate the approach.
Evolution Simulation System for Graphs Isomorphism Discernment
Authors: Vladimir V. Kureichik, Victor M. Kureichik
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The possibility of construction of intelligence systems of decision making support, the simulation of principles of nature evolution development; the adaptation and cooperation with environment; the construction of order of chaos; the homeostas support in artificial systems; the hierarchic self-organization for genetic search to decide combinatorial logical problems on graphs are considered in this paper.The main attention was paid to the development of algorithms of isomorphism identification of the homogeneous graphs with automorphic groups. The genetic algorithm based on logical and greedy heuristics is described to decide this problem. The triune approach based on models of micro-, macro- and meta evolutions to find substitution of graphs isomorphism isproposed. The enlarged scheme of genetic search to decide combinatorial and logical problems on graphs based on informative feedback and concepts of models of integrated evolution with synergetic and homeostatic principles of control is given.
Reality J2EE - Architecting for Flash
Authors: Webster
Venue:  (2003)

:If you're a J2EE software engineer looking to add a little Flash to your front-end, Reality J2EE: Architecting for Flash MX shows you how to integrate Flash and Java using best-practice principles in design, architecture, and software development. The only book to explain Flash from a J2EE developer's perspective, Reality J2EE: Architecting for Flash MX takes you through the complete development of an online banking application, using test-driven development to "design by intention" the server-side Java (using Junit and EJBUnit) and client-side ActionScript (using ActionScript Unit Testing), refactoring best-practice J2EE architectures to accommodate a Flash user interface. Rather than stick you with the student role, this book makes you a full-fledged member of a real-world development team, allowing you to sit in on the process of designing the applications, discussing development problems, and brainstorming to find solutions, with the result being a real, usable product.
Autonomous Navigation in Information Service Systems for Load Balancing User Demands
Authors: Hélène Arfaoui, Kinji Mori
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Autonomous Information Service System is a proposition made to cope with the continuously changing conditions of service provision and utilization in current information systems. The faded information field (FIF), sustained by Push/Pull mobile agent technology, is such a distributed architecture that brings high-assurance of the system through a balanced selective replication of the information. When the demand changes, the information environment is restructured so that the same access time to services for all unspecified users can be achieved in the system. However once the structure is fixed, balancing the incoming demand on the FIF is still required to guarantee the equal access time. Our goal is to warrant the autonomous dispatching of the Pull mobile agents to adjust the demand to the current information environment. In this paper, we explain the concepts and realization of autonomous navigation under the goal of asynchronous load balancing of the pull mobile agent volume inside the FIF structure. The effectiveness of our algorithm has been confirmed by simulation.
A Comparison of Four Methods for Solving Systems of Nonlinear Equations
Authors: Michel Y Cosnard
Venue:  (1975)

In this thesis, Brent''s method and the Brent-Gay version of Brown''s method for solving systems of nonlinear equations are studied. A comparison is then made between these two methods, Powell''s hybrid method and Brown''s original method. The numerical results show that the Brent-Gay version is an improvement of the method and that in the average Brent''s method is the best. Finally, listings of the two studied algorithms and of the test functions are given in the appendices.