ppxscal/embedding_network huggingface dataset:
Secrets of the iPod, 2 edition
Authors: Christopher Breen
Venue:  (2002)

:It's no mystery why the iPod is a marvel: Apple's lightweight portable music player lets you store and organize as many as 2,000 songs on its hard drive. Secrets of the iPod helps you get the most from your iPod -- and unlock its hidden potential. Macworld magazine columnist Chris Breen shows you how to use your iPod, from storing and playing songs to connecting the handheld to your car's cassettle player.
On the effectiveness of genetic search in combinatorial optimization
Authors: Robert Carter, Kihong Park
Venue:  (1994)

Abstract In this paper, we study the efficacy of genetic algorithms in the context of combinatorial optimization. In particular, we isolate the effects of cross-over, treated as the central component of genetic search. We show that for problems of nontrivial size and difficulty, the contribution of cross-over search is marginal, both synergistically when run in conjunction with mutation and selection, or when run with selection alone, the reference point being the search procedure consisting of just mutation and selection. The latter can be viewed as another manifestation of the Metropolis process. Considering the high computational cost of maintaining a population to facilitate cross-over search, its marginal benefit renders genetic search inferior to its singleton-population counterpart, the Metropolis process, and by extension, simulated annealing. This is further compounded by the fact that many problems arising in practice may inherently require a large number of state transitions for a near-optimal solution to be found, making genetic search infeasible given the high cost of computing a single iteration in the enlarged state-space.
European Option Pricing with Fixed Transaction Costs
Authors: Ajay S Aiyer
Venue:  (1996)

In this paper, we study the problem of European option pricing in the presence of fixed transaction costs. The problems of optimal portfolio selection and option pricing in the presence of proportional transaction costs has been extensively studied in the mathematical finance literature. However, much less is known when we have fixed transaction costs. In this paper, we show that calculating the price of an European option involves calculating the value functions of two stochastic impulse control problems and we obtain the explicit expressions for the resultant quasi-variational inequalities satisfied by the value functions and then carry out a numerical calculation of the option price. 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
Time-Communication Tradeoffs for Reliable Broadcast Protocols
Authors: Ozalp Babaoglu, Rogerio Drummond
Venue:  (1985)

In the Reliable Broadcast Problem, a processor disseminates a value to all other processors in a distributed system where both processors and communication components are subject to failures. Solutions to this Reliable Broadcast problem are at the heart of most fault-tolerant applications. We characterize the execution of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures constructed out of fully-connected point-to-point graphs, linear chains, rings, broadcast networks (such as Ethernet) and buses. We derive a protocol that implements Reliable Broadcast for any member within this class. The execution time of the protocol is a linear function of the two parameters that characterize each network instance. The hardware-software tradeoffs that are revealed between performance, resiliency and network cost offer many new alternatives previously not considered in designing fault-tolerant systems.
Solving Dense Nonlinear Least-Squares Problems on a Multiprocessor
Authors: Thomas F. Coleman, Paul E. Plassmann
Venue:  (1990)

We present parallel algorithms for solving nonlinear least-squares problems. The algorithms represent parallel adaptations of the Levenberg-Marquardt algorithm (as implemented in the software package Minpack), a popular and successful serial algorithm. The algorithms are suitable for message-passing multiprocessor computers. Included in our collection of parallel algorithms is an efficient parallel algorithm for determining the Levenberg-Marquardt parameter; a new row-oriented QR factorization algorithm is also provided. Our experiments were performed on an Intel iPSC/2 multiprocessor with 32 nodes: we present experimental results comparing our parallel algorithm with sequential MINPACK code executed on a single processor. These experimental results show that essentially full efficiency is obtained for problems where the row size is sufficiently larger than the number of processors. Our algorithms involve only the simple data movements of an efficient gather/broadcast and a ring embedding. As a consequence, these algorithms are not limited to any particular connectivity topology such as a hypercube. Indeed, our algorithms should be effective on any parallel machine which supports these data movements.
The Boolean Hierarchy: Hardware over NP
Authors: Jin Cai, Lane A. Hemachandra
Venue:  (1985)

In this paper, we study the complexity of sets formed by boolean operations $(\bigcup, \bigcap,$ and complementation) on NP sets. These are the sets accepted by trees of hardware with NP predicates as leaves, and together form the boolean hierarchy. We present many results about the boolean hierarchy: separation and immunity results, complete languages, upward separations, connections to sparse oracles for NP, and structural asymmetries between complementary classes. Some results present new ideas and techniques. Others put previous results about NP and $D^{P}$ in a richer perspective. Throughout, we emphasize the structure of the boolean hierarchy and its relations with more common classes.
Similarity for reuse of specifications in communication software development
Authors: U. Yamamoto, E. S. Lee, N. Shiratori
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

The reuse of existing software is one of the most effective ways for software development. We have focused on the specification process with FDTs (Formal Description Techniques), and have proposed a new concept of similarity based on LTSs (Labelled Transition Systems) as a criterion to reuse specifications. However, it's definition has some problems, such that (a) it can't be applied to an LTS with some loops, and (b) the definition of similarity between actions is not clearly expressed. In this paper, we remove these problems in order for our approach to be widely applicable. For the first problem, we extend the definition of similarity to be able to apply to an LTSs with some loops. For the second one, we consider that the similarity of actions is defined based on not only the name of actions, but also the attribute of actions and the way of occurrence of actions as the temporal ordering
ERMR: a generalised equivalent random method for overflow systems with repacking
Authors: Simon C. Borst, Richard J. Boucherie, Onno J. Boxma
Venue:  (1998)

This note develops two-moment approximations for blocking probabilities in overflow systems with repacking. The approximations are based on fixed point schemes, iteratively relating the arrival rate at the primary channels to the mean number of calls at the overflow channels. The analysis focuses on layered cellular mobile communications networks, but can also be applied to multiple retrial queues sharing a common (finite) orbit. Numerical results show that our approximation is fairly accurate for systems in which the mean repacking rate does not exceed the call arrival rate.
Software Reuse: Architecture, Process, and Organization for Business Success
Authors: Martin L. Griss
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

Systematic software reuse is the most effective way to significantly improve software development. Many organizations adopt object technology expecting significant reuse. Without an explicit reuse process, they will not succeed. Companies succeeding with reuse find that architecture, process, organization, culture, management and other non-technical factors are usually more critical than technology. This talk describes HP's software reuse practice and adoption experience, and a new systematic approach to component-based software engineering based on object-oriented business and system modeling.
Refining Hidden Markov Models with Recurrent Neural Networks
Authors: T. Wessels, C. W. Omlin
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Both hidden Markov models (HMMs) and recurrent neural networks (RNNs) have been applied to sequence recognition problems. While HMMs are easy to train, they generally do not perform satisfactorily on difficult recognition problems. On the other hand, RNNs are excellent recognizers but are very hard to train. Hybrid HMM/NN approaches aim at taking advantage of the strengths of both paradigms while avoiding their respective weaknesses. This paper proposes a novel approach of combining HMMs with RNNs. We discuss an algorithm for directly mapping a trained HMM into RNN architecture and derive a gradient-descent learning algorithm for knowledge refinement.
Transmission function models of infinite population genetic algorithms
Authors: Cees H.M. Kemenade, Joost N. Kok, J. A. L Poutre, D. Thierens
Venue:  (1998)

The so-called transmission function framework is described, and implementations of transmission function models are given for a broad range of genetic algorithms. These models describe GA''s with a population of infinite size. An actual implementation of these models for a non-trivial problem involving deception is given, these models are traced, and the results are visualized by means of population flow diagrams. These diagrams show that cross-competition between different parts of the optimal solution takes place.
Leakage Current Reduction in Sequential Circuits by Modifying the Scan Chains
Authors: Afshin Abdollahi, Farzan Fallah, Massoud Pedram
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Input vector control is an effective technique forreducing the leakage current of combinational VLSIcircuits when these circuits are in the sleep mode. In thispaper a design technique for applying the minimumleakage input to a sequential circuit is proposed. Ourmethod uses the built-in scan-chain in a VLSI circuit todrive it with the minimum leakage vector when it entersthe sleep mode. Using these scan registers eliminates thearea and delay overhead of the additional circuitry thatwould otherwise be needed to apply the minimum leakagevector to the circuit. We show how the proposed techniquecan be used for several different scan-chain architecturesand present the experimental results on the MCNC91benchmark circuits.
Basic Research in Computer Science Final Report: 1990-1993
Authors: Dale A. James, C. R Taylor
Venue:  (1993)

This report documents a broad program of basic and applied information processing research conducted by Carnegie Mellon''s School of Computer Science. The Information Processing Technology Office of the Advanced Research Projects Agency (ARPA) supported this work during the period 1 August 1990 through 2 August 1993. Chapters 1 through 6 present in detail our six major research areas: Image Understanding, VLSI, Object Management, Integrated Architectures for Intelligent Systems, Creating Graphical Applications, and Types in Programming. Each chapter briefly describes the significant results of one research area and provides references for more detailed descriptions in the published literature.
Extensions to Standard ML to Support Transactions
Authors: Jeannette M. Wing, Manuel Fähndrich, J. G Morrisett, Scott Nettles
Venue:  (1992)

A transaction is a control abstraction that lets programmers treat a sequence of operations as an atomic ("all-or-nothing") unit. This paper describes our progress on on-going work to extend SML with transactions. What is novel about our work on transactions is support for multi-threaded concurrent transactions. We use SML''s modules facility to reflect explicitly orthogonal concepts heretofore inseparable in other transaction-based programming languages.
A golden ratio notation for the real numbers
Authors: Pietro Di Gianantonio
Venue:  (1996)

Several methods to perform exact computations on real numbers have been proposed in the literature. In some of these methods real numbers are represented by infinite (lazy) strings of digits. It is a well known fact that, when this approach is taken, the standard digit notation cannot be used. New forms of digit notations are necessary. The usual solution to this representation problem consists in adding new digits in the notation, quite often negative digits. In this article we present an alternative solution. It consists in using non natural numbers as ``base'''', that is, in using a positional digit notation where the ratio between the weight of two consecutive digits is not necessarily a natural number, as in the standard case, but it can be a rational or even an irrational number. We discuss in full detail one particular example of this form of notation: namely the one having two digits ($0$ and $1$) and the golden ratio as base. This choice is motivated by the pleasing properties enjoyed by the golden ratio notation. In particular, the algorithms for the arithmetic operations are quite simple when this notation is used.
Microsoft Office Outlook 2003 Step by Step
Venue:  (2003)

Teach yourself how to use the personal information management and communication power of Outlook 2003-one step at a time! Use easy, self-paced lessons to build exactly the skills you need to manage your e-mail messages, calendar, contacts, and more. 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
IV '97: interactive visualisation through applied virtual reality in construction
Authors: B. Jones, I. Webb
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The paper is concerned with the development of an integrated, open and fully usable virtual reality (VR) environment for the construction industry for use on a low-cost PC (but transportable to other, more sophisticated systems) to make VR accessible and usable by small and medium enterprises (SMEs). The paper describes a new VR system for collaborative interaction in the construction industry that enhances communication between the design team, contractors and sub-contractors through open systems design. It discusses how feedback from potential users of these VR systems is assessed and implemented, to ensure systems are designed to meet user requirements. By enabling the use and integration of a wide variety of multimedia technologies, communication channels between different construction parties become more effective.
Instruction Set Design and Optimizations for Address Computation in DSP Architectures
Authors: Guido Araujo, Ashok Sudarsanam, Sharad Malik
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instruction design which can guarantee minimum overhead for programs that make use of implicit indirect addressing. Second, we give a formulation and propose a solution for the problem of allocating address registers (ARs) for array accesses within loop constructs. Third, we describe retargetable approaches for auto-increment (decrement) optimizations of pointer variables, and loop induction variables. Finally, we use a graph coloring technique to allocate physical ARs to the virtual ARs used in the previous phases. The results show that the combination of the above techniques considerably improves the final code quality for benchmark DSP programs.
Self-organized learning in multi-layer networks
Authors: R. W. Brause
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

Presents a framework for the self-organized formation of high level learning by a statistical preprocessing of features. The paper focuses first on the formation of the features in the context of layers of feature processing units as a kind of resource-restricted associative learning. The author claims that such an architecture must reach maturity by basic statistical proportions, optimizing the information processing capabilities of each layer. The final symbolic output is learned by pure association of features of different levels and kind of sensorial input. Finally, the author also shows that common error-correction learning can be accomplished by a kind of associative learning.
Gaussian Elimination with Pivoting is Optimal
Authors: Narayana S Kamath
Venue:  (1973)

V. Strassen discovered that two matrices of order 2 could be multiplied using 7 multiplications and 18 additions of numberss and has shown that two matrices of order n could be multiplied in less than $4 \cdot 7 n^{\log_{2}7}$ operations, an operation being defined as a multiplication, division, subtraction or addition. Also he has shown that the classical Gaussian elimination is not optimal by giving an algorithm to compute the inverse of a nonsingular matrix with certain principal submatrices nonsingular in less than $5 \cdot 64 n^{\log_{2}7}$ operations. In other words, Strassen''s algorithm provides no room for pivoting. J. Bunch and J. Hopcroft have got rid of the above anomaly and have shown how to obtain the triangular factorization of a permutation of a nonsingular matrix in less than $2 \cdot 44 n^{\log_{2}7}$ operations and the inverse in less than$6 \cdot 83 n^{\log_{2}7}$ operations. In this thesis it is shown, using the results of Strassen and Bunch and Hopcroft, that Gaussian elimination with pivoting is optimal in the sense that the bound for the number of operations required to do Gaussian elimination is the least for ``sufficiently large'''' systems of equations. Also expressions are derived for the various coefficients in the bounds for the various procedures that arise in solving linear systems of equations with the general assumption that two matrices of order u could be multiplied in p multiplications and q additions of numbers. 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
AC Analysis of Thin Gate Oxide MOS with Quantum Mechanical Corrections
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

MOS device scaling into the deep submicron regime inevitably relies on thinner gate oxide and higher substrate doping. Quantum mechanical effects must be considered in device design. This paper presents a density-gradient model which expresses the quantum mechanical effects using macroscopic approximation, and AC analysis based on it. 1D and 2D computer simulations of AC analysis show QM effects on threshold voltage and current with different gate oxide thickness and substrate doping. The computer simulations were done by a PDE solver PROPHET and the capacitance calculation result agrees well with measured data. A simple technique to extract device parameters for circuit design is also presented.
Automatic Text Theme Generation and the Analysis of Text Structure
Authors: Gerard Salton, Amit Singhal
Venue:  (1994)

Non-expository texts are not usually read from cover to cover. Readers are helped in such circumstances by providing selective access to text excerpts as needed. Text themes can be identified representing areas of importance in a text, and summaries can be constructed automatically. In this study, text theme generation and text summarization are related to text struture. It is shown that useful text derivatives are obtainable for texts with diverse structural characteristics.
Self-Testing of FPGA Delay Faults in the System Environment
Authors: Andrzej Krasniewski
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

We propose a procedure for self-testing of an FPGA programmed to implement a user-defined function. The procedure is intended to improve the detectability of FPGA delay faults. This improvement is obtained by modifying the functions of LUTs in the section under test, so that each LUT implements a XOR function. We show that, despite many potential problems, the proposed modification can significantly enhance the susceptibility of FPGA delay faults to random testing.
Version Stamps " Decentralized Version Vectors
Authors: Paulo Sérgio Almeida, Carlos Baquero, Victor Fonte
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Version vectors and their variants play a central role in update tracking in optimistic distributed systems. Existing mechanisms for a variable number of participants use a mapping from identities to integers, and rely on some form of global configuration or distributed naming protocol to assign unique identifiers to each participant. These approaches are incompatible with replica creation under arbitrary partitions, a typical mode of operation in mobile or poorly connected environments. We present an update tracking mechanism that overcomes this limitation; it departs from the traditional mapping and avoids the use of integer counters, while providing all the functionality of version vectors in what concerns version tracking.
Accurate Model of Metal-Insulator-Semiconductor Interconnects
Authors: Gaofeng Wang
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Accurate nonlinear circuit model for metal-insulator-semiconductor (MIS) interconnects is presented based on a device level simulation. The device level simulation gives detailed information regarding field-carrier interactions, semiconductor substrate loss and nonlinearity, as well as slow-wave effect, external bias effect and screening effect of the charged carriers. This model consists of an equivalent transmission line that mimics the energy transport characteristics of the actual MIS interconnect, and provides a generalized nonlinear and electronic tunable circuit model suitable for both small-signal and large-signal analyses.
Error detection in large-scale parallel programs with long runtimes
Authors: Dieter Kranzlmüller, Nam Thoai, Jens Volkert
Venue: Future Generation Computer Systems (2003)

Error detection is an important activity of program development, which is applied to detect incorrect computations or runtime failures of software. The costs of debugging are strongly related to the complexity and the scale of the investigated programs. Both characteristics are especially cumbersome for large-scale parallel programs with long runtimes, which are quite common in computational science and engineering (CSE) applications. A solution is offered by a combination of techniques using the event graph model as a representation of parallel program behaviour. With process isolation, a subset of the original number of processes can be investigated, while the absent processes are simulated by the debugging system. With checkpointing, an arbitrary temporal section of a program's runtime can be extracted for exhaustive analysis without the need to restart the program from the beginning. Additional benefits of the event graph are support of equivalent execution of nondeterministic programs, as well as a comprehensible visualisation as a space-time diagram.