ppxscal/embedding_network huggingface dataset:
Engines of Logic: Mathematicians and the Origin of the Computer
Authors: Martin Davis
Venue:  (2001)

:Computers are everywhere todayat work, in the bank, in artist's studios, in our pocketsyet they remain to many of us objects of irreducible mystery. How can today's computers perform such a bewildering variety of tasks if computing is just glorified arithmetic? The answer, as Martin Davis lucidly illustrates, lies in the fact that computers are engines of logic. Their hardware and software embody concepts developed over centuries by logicians such as Leibniz, Boole, and Gödel, culminating in the amazing insights of Alan Turing. Readers will come away from this book with a revelatory understanding of how and why computers work. 8 b/w photographs. Published in hardcover as The Universal Computer.Author Biography: Martin Davis's other books include Computability and Unsolvability. A professor emeritus at New York University, he is currently a visiting scholar at the University of California-Berkeley.
Restructuring Gaussian mixture density functions in speaker-independent acoustic models
Authors: Atsushi Nakamura
Venue: Speech Communication (2002)

In continuous speech recognition featuring hidden Markov model (HMM), word N-gram, and time-synchronous beam search, a local modeling mismatch in the HMM will often cause the recognition performance to degrade. To cope with this problem, this paper proposes a method of restructuring Gaussian mixture output probability density functions (pdfs) in a pre-trained speaker-independent HMM set based on speech data. In this method, Gaussians are copied from other mixture pdfs, taking the distribution of local errors into account. This method leads to a restructuring of the mixture pdfs, where some Gaussians are shared by several states and the total number of Gaussians is not modified. Furthermore, the distribution of local errors is extracted by comparing the pre-trained HMM set and the speech data used in the pre-training, and thus new training data are not needed for this restructuring method. Experimental results prove that the proposed restructuring method can effectively restore local modeling mismatches and improve recognition performance.
A Method to Convert HDTV Videos of Broadcast Satellite to RealSystem Multimedia Contents
Authors: Tomoko Yamakawa, Masao Hashiba, Tsukasa Koyama, Kouhei Akazawa
Venue: Journal of Medical Systems (2002)

Recently, the Internet is widely used in the field of medicine. Daily use of e-mail for medical communication is very common. Also various information regarding hospitals can be accessed via the network. Apart from this practical use of the computer network, the mediums of telemedicine, tele-education, and telecare are also available. The Medical Information Network via Communications Satellite for University Hospital (MINCS-UH; http://www.umin.ac.jp/mincs/) was constructed by the Ministry of Education, Culture, Sports, Science and Technology. These programs feature high quality images viewed on High Definition Television (HDTV) through the Broadcast Satellite (BS). We have compiled a video library of MINCS-UH program contents with W-VHS tapes for HDTV and VHS or S-VHS tapes for NTSC, available to medical staff in our university hospital through the Hospital local area network (Hospital intranet). We have also constructed a web-based streaming system that is a low cost, user-friendly multimedia delivery system capable of providing medical lectures. This system was constructed using the RealSystem package with the Internet Protocol (IP) network. Although the image quality of RealSystem is inferior to that of the original video, users can review lectures and medical congress presentations with video and audio through Hospital intranet, at any time that is convenient to them. This system can also be an efficient tool for distance learning and supports the diffusion of up-to-date information and technology to busy physicians via the Internet.
Visual requirement representation
Authors: Deng-Jyi Chen, Wu-Chi Chen, Krishna M. Kavi
Venue: Journal of Systems and Software (2002)

Multimedia technology has played an important role in modern computing because it offers more natural and user-friendly interactions with an automated system. This is particularly true for systems utilizing graphical, icon or window-based input and output. Multimedia technology also facilitates "reuse" more naturally, since the basic components and functions of presentation and animation can be reused for several different animation scenarios. This is evidenced by the rapid prototyping capability of computer and video games where although the characters and story lines change, the basic animation remains constant. In this paper we utilize multimedia technology for eliciting requirements of software systems, particularly those systems that utilize windows- (or graphical)-based interactions with the user. Our methodology will implicitly emphasize reuse since in our approach reusable components include not only code and documents, but also voice narration, animation sequences and message mechanisms. We call such software components as multimedia reusable components (MRCs). Using MRCs, one can view software requirements instead of reading textual representation of the requirements.
Highly accurate closed form approximation for frequency-dependent line impedance of a lossy Silicon substrate IC interconnect
Authors: H. Ymeri, B. Nauwelaers, K. Maex, D. De Roest, M. Stucchi
Venue: Microelectronic Engineering (2002)

A new analytic model is presented to calculate the frequency-dependent distributed self and mutual inductance and the associated distributed series resistance of silicon semiconducting IC interconnects. The method is based on the induced current density distribution inside silicon substrate. The validity of the proposed model has been checked by a comparison with a quasi-TEM spectral domain approach and equivalent-circuit modeling procedure. It is found that the silicon semiconducting substrate skin effect must be considered for the accurate prediction of the high-frequency characteristics of IC interconnects.
Impact of System Partitioning on Test Cost
Authors: Ghassan Al-hayek, Yves Le Traon, Chantal Robach
Venue: IEEE Design Test (1997)

This paper studies the impact of hardware/software partitioning upon the testing cost of codesign systems. The testability of a hierarchical specification is discussed and an estimate proposed to evaluate the cost of system testing. It depends on cost values of hardware/software testing for each unit-level component. These values are provided by a mutation-testing approach applied to both software and hardware implementations. Results show that this approach provides a new helpful partitioning criterion which can be used together with other already known criteria. A case study provided by AÉROSPATIALE illustrates this testing cost oriented partitioning.
The Accuracy of the Computation of Optical Flow and of the Recovery of Motion Parameters
Authors: E. De Micheli, V. Torre, S. Uras
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The accuracy and the dependence on parameters of a general scheme for the analysis of time-varying image sequences are discussed. The approach is able to produce vector fields from which it is possible to recover 3-D motion parameters such as time-to-collision and angular velocity. The numerical stability of the computed optical flow and the dependence of the recovery of 3-D motion parameters on spatial and temporal filtering is investigated. By considering optical flows computed on subsampled images or along single scanlines, it is also possible to recover 3-D motion parameters from reduced optical flows. An adequate estimate of time-to-collision can be obtained from sequences of images with spatial resolution reduced to 128*128 pixels or from sequences of single scanlines passing near the focus of expansion. The use of Kalman filtering increases the accuracy and the robustness of the estimation of motion parameters. The proposed approach seems to be able to provide not only a theoretical background but also practical tools that are adequate for the analysis of time-varying image sequences.
Optimizing Value and Cost in Requirements Analysis
Authors: Ho-Won Jung
Venue: IEEE Software (1998)

When creating a software system, developers are often faced with a long list of requirements and a limited budget. This article gives developers a method to balance the cost and value of the requirements, and then implement the most cost-effective set. The author created a variant of the "knapsack" approach that reduces the complexity of earlier approaches; he presents here two case studies to illustrate its application.
Atomic Delegation: Object-Oriented Transactions
Authors: Mehmet Aksit, Jan Willem Dijkstra, Anand Tripathi
Venue: IEEE Software (1991)

Atomic delegation, an object-oriented linguistic mechanism that allows the creation of dynamically defined classes of atomic actions is presented. When a type is modified, atomic delegation updates functionalities of the the types that delegate to the modified type. This mechanism permits dynamic binding and code reuse in atomic actions. The Sina language is used to illustrate the utility of atomic delegation in the modeling of a real-world problem, involving an office with a number of departments, using object-oriented techniques. Implementation issues are discussed.
Low Expansion Packings and Embeddings of Hypercubes into Star Graphs: A Performance-Oriented Approach
Authors: Marcelo Moraes de Azevedo, Nader Bagherzadeh, Shahram Latifi
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

We discuss the problem of packing hypercubes into an n-dimensional star graph S(n), which consists of embedding a disjoint union of hypercubes U into S(n) with load one. Hypercubes in U have from $\lfloor n/2 \rfloor$ to $(n+1)\cdot \left\lfloor {\log_2\,n} \right\rfloor -2^{\left\lfloor {\log_2n} \right \rfloor +1}+2$ dimensions, i.e., they can be as large as any hypercube which can be embedded with dilation at most four into S(n). We show that U can be embedded into S(n) with optimal expansion, which contrasts with the growing expansion ratios of previously known techniques.We employ several performance metrics to show that, with our techniques, a star graph can efficiently execute heterogeneous workloads containing hypercube, mesh, and star graph algorithms. The characterization of our packings includes some important metrics which have not been addressed by previous research (namely, average dilation, average congestion, and congestion). Our packings consistently produce small average congestion and average dilation, which indicates that the induced communication slowdown is also small. We consider several combinations of node mapping functions and routing algorithms in S(n), and obtain their corresponding performance metrics using either mathematical analysis or computer simulation.
A Heterogeneous Multiprocessor Architecture for Flexible Media Processing
Authors: Martijn J. Rutten, Jos T. J. van Eijndhoven, Egbert G. T. Jaspers, Pieter van der Wolf, Evert-Jan D. Pol, Om Prakash Gangwal, Adwin Timmer
Venue: IEEE Design Test (2002)

Eclipse is a scalable architecture template for designing data-dependent stream-processing subsystems of media-processing SoCs. It combines application configuration flexibility with the efficiency of function-specific coprocessors that concurrently execute the tasks of one or more applications. New media applications such as high definition digital television, set-top boxes with time-shift functionality, 3D games, video conferencing, and MPEG-4 interactivity have generated ademand for increasingly flexible consumer electronics products. These products are evolving into multifunctional devices that combine a set of media applications. The required set of applications and their format vary per product, per country, and over time as standards evolve.
Stack Evaluation of Arbitrary Set-Associative Multiprocessor Caches
Authors: Yuguang Wu, Richard Muntz
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

We propose a simple solution to the problem of efficient stack evaluation of LRU multiprocessor cache memories with arbitrary set-associative mapping. It is an extension of the existing stack evaluation techniques for all set-associative LRU uniprocessor caches. Special marker entries are used in the stack to represent data blocks (or lines) deleted by an invalidation-based cache coherence protocol. A method of marker-splitting is employed when a data block below a marker in the stack is accessed. Using this technique, one-pass trace evaluation of memory access trace yields hit ratios for all cache sizes and set-associative mappings of multiprocessor caches in a single pass over a memory reference trace. Simulation experiments on some multiprocessor trace data show an order-of-magnitude speed-up in simulation time using this one-pass technique.
A new fast algorithm for the unified forward and inverse MDCT/MDST computation
Authors: Vladimir Britanak, K. R. Rao
Venue: Signal Processing (2002)

The modified discrete cosine transform (MDCT) and modified discrete sine transform (MDST) are employed in subband/transform coding schemes as the analysis/synthesis filter banks based on the concept of time domain aliasing cancellation (TDAC). Princen, Bradley and Johnson defined two types of the MDCT, specifically, for an evenly stacked and oddly stacked analysis/synthesis systems. The MDCT is the basic processing component in the international audio coding standards and commercial products for high-quality audio compression. Almost all existing audio coding systems have used the complex-valued or real-valued FFT algorithms, and the DCT/DST of type IV (DCT-IV/DST-IV) for the fast MDCT computation. New fast and efficient algorithm for a unified forward and inverse MDCT/MDST computation in the oddly stacked system is proposed. It is based on the DCT/DST of types II and III (DCT-II/DST-II, DCT-III/DST-III), and the real arithmetic is used only. Corresponding generalized signal flow graph is regular, structurally simple and enables to compute MDCT/MDST and their inverses in general for any N divisible by 4 (N being length of a data sequence). Consequently, the new fast algorithm can be adopted for the MDCT computation in the current audio coding standards such as MPEG family (MPEG-1, MPEG-2, MPEG-2 Advanced Audio Coding and MPEG-4 audio), and in commercial products (proprietary audio coding algorithms) such as Sony MiniDisc/ATRAC/ATRAC2/SDDS digital audio coding systems, the AT & T Perceptual Audio Coder (PAC) or Lucent Technologies PAC/Enhanced PAC/Multichannel PAC, and Dolby Labs AC-3 digital audio compression algorithm. Besides the new fast algorithm has some interesting properties, it provides an efficient implementation of the forward and inverse MDCT computation for layer III in MPEG audio coding, where the length of data blocks N ≠ 2n, Especially, for the AC-3 algorithm, it is shown how both the proposed new MDCT/MDST algorithm and existing fast algorithms/computational architectures for the discrete sinusoidal transforms computation of real data sequences such as the DCT-IV/DST-IV, generalized discrete Fourier transform of type IV (DFT-IV) and generalized discrete Hartley transform of type IV (DHT-IV) can be used for the fast alternate or simultaneous (on-line) MDCT/MDST computation by simple pre-and post-processing of data sequences.
Start with a Digital Camera, 2nd edition
Authors: John Odam
Venue:  (2002)

:Digital photography is well established as the next wave of image creation. Cameras are becoming more affordable, image manipulation technology is becoming more powerful, and an increasing number of users are finding the lure of digital photography too strong to resist. Whether you are about to purchase a digital camera or you already have one and aren't sure what to do with it, this book gives you both the knowledge and the inspiration to create top quality digital photographs and incorporate them into graphic designs. The co-author of the succesful Start with books provides clear guidance, beautiful full color photographs, and simple instructions aimed at getting users started on the road to digital photography.Shows how to create high-quality digital photosProvides design ideas and inspirationIntroduces amateurs and professionals to this new technologyProvides camera buying tips 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 Watermarks: Shedding Light on the Invisible
Authors: Minerva M. Yeung, Boon-Lock Yeo, Matthew Holliman
Venue: IEEE Micro (1998)

We have entered an era where inexpensive and readily available tools and equipment can be used to replicate, manipulate and distribute digital multimedia materials with ease. Often, the replication of digital content can produce perfect copies of the original, manipulation and editing of digital copies can deceive even the most professional eyes, and mass distribution can take place in a matter of seconds, in electronic forms. Misappropriation of digital assets
Distance Visualization: Data Exploration on the Grid
Authors: Ian Foster, Joseph Insley, Gregor von Laszewski, Carl Kesselman, Marcus Thiebaux
Venue: Computer (1999)

Our increased ability to model and measure a wide variety of phenomena has left us awash in data. In the immediate future, the authors anticipate collecting data at the rate of terabytes per day from many classes of applications, including simulations running on teraflop-class computers and experimental data produced by increasingly more sensitive and accurate instruments such as telescopes, microscopes, particle accelerators, and satellites. Generating or acquiring data is not an end in itself but a vehicle for obtaining insights. While data analysis and reduction have a role to play, in many situations we achieve understanding only when a human being interprets the data. Visualization has emerged as an important tool for extracting meaning from the large volumes of data that scientific instruments and simulations produce. The authors describe an online system that supports three-dimensional tomographic image reconstruction--and subsequent collaborative analysis--of data from remote scientific instruments.
Where Design Testing Fits In
Venue: IEEE Software (1990)

No abstract available 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
VHDL: Toward a Unified View of Design
Authors: Allen Dewey, Aart J. de Geus
Venue: IEEE Design Test (1992)

A high-level view of the relevance of and relationships between key events in the development of the very-high-speed integrated circuit (VHSIC) hardware description language (VHDL) is presented. Three phases in the life cycle of the language, the definition, development, and deployment phases, are outlined. The concept of a design information space, a convenient abstraction for categorizing various VHDL efforts and understanding their interrelationships, is introduced. Two representative VHDL examples dealing with performance modeling and testing are discussed. The waveform and vector exchange specification (WAVES) VHDL subset for the exchange of waveform descriptions is described.
Eolo: software for the automatic on-line treatment and analysis of GPS data for environmental monitoring
Authors: M. Amore, A. Bonaccorso, F. Ferrari, M. Mattia
Venue: Computers Geosciences (2002)

Geodetic measurements based on GPS satellite technology allow monitoring of the state of deformation with great precision. Geodetic studies through GPS have proven to be of strategic importance in risk evaluation of various phenomena such as landslides, volcanoes, earthquakes or for the evaluation of the stability of large structures (dykes, bridges, etc.). For control and surveillance purposes, continuous monitoring with real-time acquisition and analysis of data is required. We have developed a software, called Eolo, which allows the management of data from a GPS network using automatic acquisition. The software is the fruit of 5 years experience of working with continuous GPS and has been designed with a modular object-based structure to be extremely flexible and adaptable to different needs. The software allows treatment of raw data, their storage in a database, calculation of the main strain parameters, and the visualisation of all the results. In this sense the software is a powerful tool in the field of environmental monitoring with GPS geodetic techniques. The software is in use for the continuous monitoring of active Sicilian volcanoes.
Backtracking-Based Instruction Scheduling to Fill Branch Delay Slots
Authors: Ivan D. Baev, Waleed M. Meleis, Santosh G. Abraham
Venue: International Journal of Parallel Programming (2002)

Conventional schedulers schedule operations in dependence order and never revisit or undo a scheduling decision on any operation. In contrast, backtracking schedulers may unschedule operations and can often generate better schedules. This paper develops and evaluates the backtracking approach to fill branch delay slots. We first present the structure of a generic backtracking scheduling algorithm and prove that it terminates. We then describe two more aggressive backtracking schedulers and evaluate their effectiveness. We conclude that aggressive backtracking-based instruction schedulers can effectively improve schedule quality by eliminating branch delay slots with a small amount of additional computation.
Imprimitive symmetric graphs, 3-arc graphs and 1-designs
Authors: Sanming Zhou
Venue: Discrete Mathematics (2002)

Let Γ be a G-symmetric graph admitting a nontrivial G-invariant partition B. For B ∈ B, let D(B)=(B,ΓB(B),I) be the 1-design in which αIC for α ∈ B and C ∈ ΓR(B) if and only if α is adjacent to at least one vertex of C, where ΓB(B) is the neighbourhood of B in the quotient graph ΓB of Γ relative to B. In a natural way the setwise stabilizer GB of B in G induces a group of automorphisms of D(B). In this paper, we study those graphs Γ such that the actions of GB on B and ΓB(B) are permutationally equivalent, that is, there exists a bijection ρ :B → ΓB(B) such that ρ(αx) = (ρ(α))x for α ∈ B and x ∈ GB. In this case the vertices of Γ can be labelled naturally by the arcs of B. By using this labelling technique we analyse ΓB, D(B) and the bipartite subgraph Γ[B, C] induced by adjacent blocks B, C of B, and study the influence of them on the structure of Γ. We prove that the class of such graphs Γ is precisely the class of those graphs obtained from G-symmetric graphs Σ and self-paired G-orbits on 3-arcs of Σ by a construction introduced in a recent paper of Li, Praeger and the author, and that Γ can be reconstructed from ΓB via this construction.