ppxscal/embedding_network huggingface dataset:
Early Detection of Design Sensitivities that Cause Yield Loss for New Products
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper describes an analytical method for detecting IC design sensitivities that adversely affect wafer probe yields. The same method can also detect systematic process problems that affect probe yields. The method not only detects these sensitivities, but also can give valuable information about why the probe yield is affected. Also, quantitative yield limits can be calculated for each sensitivity thus making it possible to create a yield loss pareto and concentrate yield improvement efforts on those sensitivities causing the greatest loss. This method has proven to be accurate and reliable when performed on data from significantly fewer wafers than might be required for other techniques. An automated computer program has been developed by the authors to perform the analysis. 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
Relations Between Some Quantities in Classical Thermodynamics and Abstract Dynamics. Beyond Hyperbolicity
Authors: A. M. Mesón, F. Vericat
Venue: Journal of Dynamical and Control Systems (2003)

Formal relationships among statistical mechanics, multifractal analysis, and dynamical systems with weaker conditions than the existence of Markov partitions are presented. The hypotheses we consider are Bowen's expansiveness and specification property, so that more general dynamical systems than, for instance, mixing hyperbolic systems can be included in our formalism.
Efficiency of the domain decomposition method for the parallelization of implicit finite element code
Authors: G. P. Nikishkov, A. Makinouchi
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

An analytical model is presented for estimating parallel efficiency of the domain decomposition method which is used for the parallelization of implicit finite element code. Serial and parallel finite element codes with domain decomposition and direct LDU solution of equation systems are developed. Dependencies of parallel efficiency on problem size are obtained for IBM SP2 with 4,6 and 8 processor nodes. It is shown that interprocessor load balancing during assembly-decomposition phase which can be achieved by partitioning into unequal subdomains increase parallel efficiency considerably. Predicted and measured values of parallel efficiency are in reasonable agreement.
Approximating Concurrent Flow with Uniform Demands and Capacities: An Implementation
Authors: Philip N. Klein, Sarah Kang
Venue:  (1991)

We have implemented the concurrent flow approximation algorithm described in ``Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities,'''' by Klein, Stein, and Tardos, which appeared in STOC 90. The implemented algorithm works for unit demands and unit capacities, and makes use of the idea of randomized path selection introduced in that paper. We make use of a simplification of the path selection technique proposed by A. Golderg. The implemented algorithm differs from the published algorithm in another respect as well: an effort is made to keep small the number of flow paths used to realize the concurrent flow. This paper describes our experience with the implementation thus far and our plans for further experimentation.
Multi-User VRML Environment for Teaching VRML: Immersive Collaborative Learning
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

VRML-based environments can be used very effectively for teaching a variety of online courses. This paper describes the development of an Internet-based collaborative learning environment in which VRML is not only the means but also the subject of teaching. Such a VRML environment is designed to assist and support employees of the 'New Media' industries enrolled on short courses run by the Interactive Media Group in the School of Computing, University of Plymouth.This paper focuses on some key issues in the design of the VRML teaching environment and using it for real-time and on-demand course delivery. One of the most interesting issues is the experience of learning and teaching VRML while being within a VRML world. Such an immersive method of learning provides students with unique experiences and significantly increases the efficiency of the learning process.
A first step toward chromosome analysis by compression algorithms
Authors: E. Rivals, J. Delahaye, M. Dauchet, O. Delgrange
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

The authors use Kolmogorov complexity and compression algorithms to study DOS-DNA (DOS: defined ordered sequence). This approach gives quantitative and qualitative explanations of the regularities of apparently regular regions. The authors present the problem of the coding of approximate multiple tandem repeats in order to obtain compression. Then the authors describe an algorithm that allows one to find efficiently approximate multiple tandem repeats. Finally, the authors briefly describe some of their results.
On the Exact Size of the Binary Space Partitioning of Sets of Isothetic Rectangles with Applications
Authors: Berman Piotr, DasGupta Bhaskar, Muthukrishnan S.
Venue:  (2000)

We show an upper bound of 3n on size of the Binary Space Partitioning (BSP) tree for a set of n isothetic rectangles, and an upper bound of 2n if the rectangles tile the underlying space. This improves the previous bounds of 4n. The BSP tree is one of the most popular data structures and even ``small'''' factor improvements of 4/3 or 2 we show improves the performance of applications relying on the BSP tree. Furthermore, our upper bounds yield improved approximation algorithms for several rectangular tiling problems in the literature. We also a show a lower bound of 2n in the worst case for a BSP for n isothetic rectangles, and a lower bound of 1.5n if they must form a tiling of the space.
Implementing Polymorphic Typing in a Logic Programming Language
Authors: Keehang Kwon, Gopalan Nadathur, Sue D Wilson
Venue:  (1993)

Introducing types into a logic programming language leads to the need for {\em typed} unification within the computation model. In the presence of Polymorphism and higher-order features, this aspect forces analysis of types at run-time. We propose extensions to the Warren Abstract Machine (WAM) that permit such analysis to be done with reasonable efficiency. Much information about the structures of types is present at compile-time, and we show that this information can be used to considerably reduce the work during execution. We illustrate our ideas in the context of a typed version of Prolog. We describe a modified representation for terms, new instructions and additional data areas that in conjunction with existing WAM structures suffice to implement this language. The nature of compiled code is illustrated through examples, and the kind of run-time overheads that are incurred for processing types is analyzed, especially in those cases where others have shown that type checking can be eliminated during execution. The ideas presented here are being used in an implementation of the higher-order language called $\lambda$Prolog.
Multimedia Real-Time Disk Scheduling by Hybrid Local/Global Seek-Optimizing Approaches
Authors: Ray-I Chang, Wei-Kuan Shih, Ruei-Chuan Chang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Real-time disk scheduling is one of the most important problems in designing a multimedia system. It has been proved to be NP-Complete. In these years, various approaches are proposed to improve disk throughput under guaranteed real-time requirements. SCAN-EDF, which utilizes SCAN to reschedule tasks in a real-time EDF schedule, is one of the best-known real-time disk scheduling methods. Since tasks rescheduled in SCAN-EDF should have the same deadline, its efficiency depends on the number of tasks with the same deadlines. If all tasks have different deadlines, the schedule result of SCAN-EDF would be the same as EDF.In this paper, we improve SCAN-EDF by applying different hybrid local-merging and global-inserting schemes. Different from SCAN-EDF, in our method, tasks rescheduled by SCAN may have different deadlines. Our efficiency is not limited on the number of tasks that have the same deadlines. Experiments show that the proposed method is significantly better than SCAN-EDF. Comparing by disk throughput, the amount of our improvement obtained is 24% more than the best-known SCAN-EDF method.
Real World Color Management
Authors: Bruce Fraser, Chris Murphy, Fred Bunting
Venue:  (2002)

:Graphic arts professionals know that the goal of maintaining color fidelity throughout a print or Web design project can be an elusive one. What you see on the screen might look like the sample you hold in your hand, but what about the final product? From swatch to screen, from proof to final output, the way to make sure your results match your expectations -- and those of your clients -- is through color management, and Real World Color Management is the industrial-strength, under-the-hood guide. Industry experts Bruce Fraser, Chris Murphy, and Fred Bunting pack every page with tips and techniques to help you build and fine-tune ICC profiles, develop a color-managed workflow, understand the craft of converting from one color space to another, and manage color using popular graphics applications. You'll also gain insight into color theory and color models, and learn how various devices interpret, display, and reproduce color.
The Word-Level Models for Efficient Computation of Multiple-Valued Functions. PART 1: LAR Based Model
Authors: Svetlana N. Yanushkevich, Piotr Dziurzanski, Vlad P. Shmerko
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

A new model of a multi-level combinational Multiple-Valued Logic (MVL)circuit with no feedback and no learning is introduced. This model includes Neuron-Like Gates (NLGs), each represents a level of the MVL circuit, so that the number of NLGs in the corresponding Neural-Like Network (NLN)s equal to the number of levels n the circuit. The formal description of an NLG is a Linear Arithmetic Expression (LAR)that is directly mapped to the Linear word-level Decision Diagram (LDD)planar by its nature. Thus, an l -level MVL circuit is described by a set of l LDDs. The experiments on simulation of large MVL circuits show that the LDD format of an MVL circuit consumes 5-20 times less memory than EDIF and ISCAS formats. The proposed technique allows to simulate an arbitrary MVL circuit by an NLN and corresponding set of LDDs. In particular, we successfully simulated an NLN with about 250 NLGs corresponding to an MVL circuit with more than 8000 ternary gates that has been impossible by any recently reported threshold gate-based network.
Evaluation of a Load Profiling Approach to Routing Guaranteed Bandwidth Flows
Authors: Ibrahim Matta, Azer Bestavros
Venue:  (1997)

Abstract To support the diverse Quality of Service (QoS) requirements of real-time (e.g. audio/video) applications in integrated services networks, several routing algorithms that allow for the reservation of the needed bandwidth over a Virtual Circuit (VC) established on one of several candidate routes have been proposed. Traditionally, such routing is done using the least-loaded concept, and thus results in balancing the load across the set of candidate routes. In a recent study, we have established the inadequacy of this load balancing practice and proposed the use of load profiling as an alternative. Load profiling techniques allow the distribution of ``available'''' bandwidth across a set of candidate routes to match the characteristics of incoming VC QoS requests. In this paper we thoroughly characterize the performance of VC routing using load profiling and contrast it to routing using load balancing and load packing. We do so both analytically and via extensive simulations of multi-class traffic routing in Virtual Path (VP) based networks. Our findings confirm that for routing guaranteed bandwidth flows in VP networks, load balancing is not desirable as it results in VP bandwidth fragmentation, which adversely affects the likelihood of accepting new VC requests. This fragmentation is more pronounced when the granularity of VC requests is large. Typically, this occurs when a common VC is established to carry the aggregate traffic flow of many high-bandwidth real-time sources. For VP-based networks, our simulation results show that our load-profiling VC routing scheme performs better or as well as the traditional load-balancing VC routing in terms of revenue under both skewed and uniform workloads. Furthermore, load-profiling routing improves routing fairness by proactively increasing the chances of admitting high-bandwidth connections.
Wearable Sensor Badge and Sensor Jacket for Context Awareness
Authors: Jonny Farringdon, Andrew J. Moore, Nancy Tilbury, James Church, Pieter D. Biemond
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

The addition of sensors to wearable computers allows them to adapt their functions to more suit the activities and situation of their wearers. Here a wearable sensor badge is described constructed from (hard) electronic components, which can sense perambulatory activities for context-awareness. A wearable sensor jacket is described that uses advanced knitting techniques to form (soft) fabric stretch sensors positioned to measure upper limb and body movement. Worn on-the-hip, or worn as clothing, these unobtrusive sensors supply abstract information about your current activity to your other wearable computers.
Image Representations and Feature Selection for Multimedia Database Search
Authors: Theodoros Evgeniou, Massimiliano Pontil Constantine Papageorgiou Tomaso Poggio
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

The success of a multimedia information system depends heavily on the way the data is represented. Although there are “natural” ways to represent numerical data, it is not clear what is a good way to represent multimedia data, such as images, video, or sound. In this paper, we investigate various image representations where the quality of the representation is judged based on how well a system for searching through an image database can perform—although the same techniques and representations can be used for other types of object detection tasks or multimedia data analysis problems. The system is based on a machine learning method used to develop object detection models from example images that can subsequently be used for examples to detect—search—images of a particular object in an image database. As a base classifier for the detection task, we use support vector machines (SVM), a kernel-based learning method. Within the framework of kernel classifiers, we investigate new image representations/kernels derived from probabilistic models of the class of images considered and present a new feature selection method which can be used to reduce the dimensionality of the image representation without significant losses in terms of the performance of the detection-search-system.
Open Issues on TCP for Mobile Computing
Authors: Vassilis Tsaoussidis, Ibrahim Matta
Venue:  (2001)

Abstract We discuss the design principles of TCP within the context of heterogeneous wired/wireless networks and mobile networking. We identify three shortcomings in TCP''s behavior: (i) the protocol''s error detection mechanism, which does not distinguish different types of errors and thus does not suffice for heterogeneous wired/wireless environments, (ii) the error recovery, which is not responsive to the distinctive characteristics of wireless networks such as transient or burst errors due to handoffs and fading channels, and (iii) the protocol strategy, which does not control the tradeoff between performance measures such as goodput and energy consumption, and often entails a wasteful effort of retransmission and energy expenditure. We discuss a solution-framework based on selected research proposals and the associated evaluation criteria for the suggested modifications. We highlight an important angle that did not attract the required attention so far: the need for new performance metrics, appropriate for evaluating the impact of protocol strategies on battery-powered devices.
On-Line Monitor Design of Finite-State Machines
Authors: Feng Gao, John P. Hayes
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

On-line monitoring is a useful technique for ensuring system reliability. By continuously supervising the system's operation, a wide range of problems, such as physical defects, transient faults and design errors, can be detected. A monitor M*'s behavior can be viewed as an abstraction of the target system M's behavior, and can be represented by a homomorphic mapping from M to M*. We present a systematic procedure to select homomorphisms and measure their costs. Experimental results are also presented which quantify some basic trade-offs between area overhead and fault coverage.
Prediction-Capable Data Compression Algorithms for Improving Transmission Efficiency on Distributed Systems
Authors: Hann-Huei Chiou, Alexander I-Chi Lai, Chin-Laung Lei
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Network bandwidth is a kind of limited and precious resources in modern distributed computing environments. Insufficient bandwidth will severely degrade the performance of a distributed computing task in exchanging massive data among the networked hosts. A feasible solution to save bandwidth is to incorporate data compression during transmission time. However, blind or unconditional compression may only result in waste of CPU power and even slow down the overall network transfer rate, if the data to transmit are hard to compress.In this paper we present a prediction-capable lossless data compression algorithm to address this problem. By adapting to the compression speed of a host CPU, current system load, and network speed, our algorithm can accurately estimate the compression time of each data block given, and decide whether it should be compressed or not. Experimental results indicate that our prediction mechanism is both efficient and effective, achieving 93% of prediction accuracy at the cost of only 3.2% of the execution time of unconditional compression.
Chess: A Psychiatrist Matches Wits with Fritz
Authors: Ernest F. Pecci, Garry Kasparov
Venue:  (2002)

:This compilation of over 125 games systematically illustrates a strategy that succeeds in beating today's best computer chess programs. With a detailed description of the steps that lay the groundwork for victory, this manual includes easy-to-follow diagramed chessboards to illustrate each move. It also contains a description of the conventional principles of chess as well as the strategic differences of computer chess.Author Biography: Ernest F. Pecci, M.D., is a retired psychiatrist. He lives in Walnut Creek, California.
Hodge decompositions on the boundary of non-smooth domains: the non-simply connected case
Authors: A. Buffa
Venue:  (2000)

This paper concerns the characterization of tangential traces for the space ${\bf }H({\bf curl},\Omega)$, when $\Omega$ is a Lipschitz polyhedron in $R^3$ under general topology assumptions. Suitable spaces of tangential vector fields are introduced and characterized. Hodge decompositions are provided and they involve the first cohomology space of the boundary $\Gamma$. Such a space is characterized and a basis is furnished. 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
Dynamic Reliability Indices for Multi-State System
Authors: Elena N. Zaitseva
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

The Multi-State System reliability is investigated in thispaper.The new class of Reliability Indices is obtained.Wehave called these indices as Dynamic Reliability Indices.These indices estimate influence upon the Multi-StateSystem reliability by the capacity levels of a systemcomponent.The Multiple-Valued Logic mathematical toolsare used for calculation of Dynamic Reliability Indices.
Electronic and Magnetic Structures of the Rare-Earth Compounds: R2Fe17NE
Authors: S. S. Jaswal, D. J. Sellmyer, W. B. Yelon, G. C. Hadjipanayis, Y. Z. Wang
Venue:  (1991)

Structural and magnetic properties of the rare-earth compounds R2FE17N_E_ have been studied with neutron-diffraction measurements and self-consistent spin-polarized electronic-structure calculations. The diffraction results indicate for the Nd compound that N goes into two sites in two or more phases of varying fractional N occupations. For the Y compound, N occupies only one site. Electronic-structure calculations for Y2Fe17 and Y2Fe17N3 give excellent results for sitedependent Fe moments, and, with spin-fluctuation theory, explain the large change in the Curie temperature on nitrogenation.
Premiere and After Effects Studio Secrets, 1 edition
Authors: Stan II Carver, Jordan Wollman
Venue:  (2002)

:Adobe designed Premiere and After Effects to work together. Now, for the first time, top digital media experts show you how to coax the most from that partnership, using dozens of examples, case histories, and over 500 lavish full-color illustrations. Learn professional secrets for creating live graphics, compressing video for the Web, becoming an independent filmmaker, producing unforgettable wedding videos, and much more. You'll benefit from both their artistic inspiration and their decades of experience in everything from cell animation and developing Hollywood-style special effects to creating stock footage on a budget and editing for Generation X.
Application Specific Image Compression for Virtual Conferencing
Authors: Jiangfeng Ding, Jon C. Furgeson, Edwin H.-M. Sha
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Image compression has been an important research topic for many years. There are many kinds of compression techniques, but most of these do not fully take advantage of the characteristics of a target application. An example is virtual conferencing, one of the most popular applications in multimedia, which demands a huge network bandwidth. The paper presents an application-specific image compression technique focusing on virtual conferencing. The paper proposes a compression technique that compresses the image background and foreground (the face part) with different compression qualities. Compared to standard JPEG compression, our algorithms may reduce half of the image file size with a reasonably clear quality of background. This paper discusses how to divide an image into a background part and a foreground part automatically, and how to design and compare several different algorithms for compressing these two parts with different quality.