ppxscal/embedding_network huggingface dataset:
A Fast Coupling Aware Delay Estimation Scheme Based on Simplified Circuit Model
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

In this paper, we present a fast coupling aware delay estimation algorithm based on a simplified interconnect circuit model. The interconnect model consist of a coupled PI segment which represents the coupled interconnects after mapping and reduction of general coupled lines. Closed-form analytical formulas are derived for both propagating and crosstalk waveforms. Best-case and worst-case delays are obtained by using superposition to create composite waveforms without expensive search process. The circuit model has been verified by comparing with SPICE simulations, and it provides an efficient and reasonably accurate way to estimate timing transition intervals in presence of cross-coupling. 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
Submit Now: Designing Persuasive Web Sites, 1 edition
Authors: Andrew Chak
Venue:  (2002)

:Usability is not enough. This book shows what it takes to design a site so browsers become buyers: the ultimate measurement of success for an e-commerce site. Designing Persuasive Web Sites: Submit Now examines how customers search, evaluate, and make decisions realistically-not using marketing guesstimates.This book focuses on changing the mindset from selling to customers to helping them buy. It begins by exploring how customers make decisions and how that integrates with the online experience. It presents tangible design ideas that can be instantly applied to sites to make them more effective. Real examples are used to provide insight and inspiration that can be directly applied to a multitude of sites. The book provides a simplified description of the essential process necessary for designing a site that gets visitors to click. It concludes with guidelines to for designing any transaction-oriented site. 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
Adaptive QoS Management Using Layered Multi-Agent System for Distributed Multimedia Applications
Authors: Masakatsu Kosuga, Tatsuya Yamazaki, Nagao Ogino, Jun Matsuda
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Owing to advances in terminal performance and network speed, communication-intensive distributed multimedia applications have grown. Hence the development of end-to-end quality of service (QoS) management mechanisms is increasingly demanded for the applications. Since user's QoS requirements change and available resources for network and terminal fluctuate occasionally, adaptability is required for QoS management mechanisms. In this paper, we propose a multi-agent-based, decentralized, adaptive QoS management framework that is suitable to a distributed multimedia environment. In this framework, the QoS management task is divided into subtasks, and the agents that take charge of the subtasks are designed. The adaptability is realized using collaborative QoS adaptation among the agents. A layered structure of multi-agent system is introduced to segregate long-term QoS adaptation from short-term QoS adaptation. Experimental and simulation results show the validity of layered QoS management using Application Agent (AA) and Stream Agent (SA).
Analysis of an ATM buffer with self-similar ("fractal") input traffic
Authors: N. Likhanov, B. Tsybakov, N. D. Georganas
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

As ATM high-speed, cell-relay networks will most likely first make their impact as backbones interconnecting enterprise networks consisting of Ethernet and other LANs, their proper design and control is crucial. Recent studies of high quality, high resolution traffic measurements in Bellcore Ethernets have revealed that this aggregate Ethernet traffic is self-similar ("fractal") in nature, quite different in "burstiness" features from traffic considered and studied up to now. This paper presents an analytical study of an ATM buffer driven with self-similar traffic. The probability of buffer occupancy is obtained. It is shown that this probability decreases with the buffer size not exponentially, as in traditionally Markovian traffic models, but algebraically.
Real-time Hazard Detection via Machine Vision for Wearable Low Vision Aids
Authors: Jordan Andersen, Eric Seibel
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Description of a machine vision system for the recognition of common navigation hazards for use in a wearable low vision aid.
Cisco Networking Academy Program: Fundamentals of Voice and Data Cabling: Lab Companion
Venue:  (2003)

:The official Lab Companion of the Cisco Networking Academy Program's Fundamentals of Voice and Data Cabling course.Maps to the current Web-based course offered by the Cisco Networking Academy ProgramPrepares students for the BICSI Registered Installer, Level I ExamIncludes hands-on lab exercisesThe Fundamentals of Voice and Data Cabling Lab Companion will be the companion lab manual for a one-semester course on cabling technologies. The course and companion materials provide an introduction to the physical aspects of voice and data network cabling and installation. The review questions and thought exercises included in the lab companion focus on cabling issues related to data and voice connections and provide an understanding of the industry and its worldwide standards, types of media and cabling, physical and logical networks, as well as signal transmission. This book will help students learn how to do the following: read network design documentation, set up part lists and purchase components, pull and mount cable, choose wiring closets, install jacks, and perform cable testing. It will also help develop skills in documentation, design, cable management, and troubleshooting installation issues, as well as laboratory safety, on-the-job safety, and how to work effectively in group environments. The hands-on approach and comprehensive coverage of topics in the Fundamentals of Voice and Data Cabling Lab Companion will be part of a unique learning package to help students prepare for the BICSI Registered Installer, Level 1 exam. 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
Transient and Asymptotic Domain Growth in the 3D Ising Model with Conserved Spin
Authors: G. T. Barkema, J. F. Marko, J. Boer
Venue:  (1994)

We present a study of domain growth in the three-dimensional Ising model with locally conserved magnetization. For the first time in a dynamic Ising model, the theoretically expected growth exponent n 1/3 is confirmed; we observe it over a wide range of temperatures. For low temperatures, the transient phenomena are accurately described by a mean-field model. The algorithm used for this study allows different types of transport processes to be controlled, and can be applied to many other problems.
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors
Authors: Reingold Omer, Vadhan Salil, Author:
Venue:  (2001)

The main contribution of this work is a new type of graph product, which we call the \defword{zig-zag product}. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its size from the large one, its degree from the small one, and its expansion properties from both! Iteration yields simple explicit constructions of constant-degree expanders of every size, starting from one constant-size expander. Crucial to our intuition (and simple analysis) of the properties of this graph product is the view of expanders as functions which act as ``entropy wave'''' propagators --- they transform probability distributions in which entropy is concentrated in one area to distributions where that concentration is dissipated. In these terms, the graph product affords the constructive interference of two such waves. A variant of this product can be applied to extractors, giving the first explicit extractors whose seed length depends (poly)logarithmically on only the entropy deficiency of the source (rather than its length) and that extract almost all the entropy of high min-entropy sources. These high min-entropy extractors have several interesting applications, including the first constant-degree explicit expanders which beat the ``eigenvalue bound.''''
PhotoShop 7: Trade Secrets
Authors: Gavin Croumhout, David Cross, Janee Aronoff, Colin Smith
Venue:  (2002)

:How do you get the best out of Photoshop? It's a combination of knowing what you want and knowing how to do it properly: a mixture of creativity and acumen. As you learn more, you make fewer mistakes, your workflow becomes faster, and you have more time to explore creative possibilities. This book is dedicated to showing you the tricks of the trade, to sharing the insider's knowledge which will speed up your work, and to improving your understanding of Photoshop as a tool. The book is divided into eight chapters, in the first three we look at ways of improving your efficiency, good selection techniques, and how to use layers effectively. In the next three chapters we look at practical applications of Photoshop for retouching and correction, Web graphics and special effects. The final two chapters look at the practicalities of Photoshop's configuration and hardware. Throughout the book, we cover the new features of Photoshop 7, so if you're not yet up to speed with the latest version, we'll show you the way. You've mastered the basics of Photoshop and you're ready to move on to the next level - this book is jam-packed with the hints, tips, and advice from four Photoshop experts that you need to take you there. To get the most information out of each of the authors that we possibly could, we used a collaborative method of writing. Each of the four authors chose two subject areas to be the main writer on, and once they had finished writing the sections, they were passed on to the other three authors for them to add their own tips and tricks to. All these parts then went out to review, and the reviewers (themselves Photoshop users) added their tips to the tip-tank. All of these tips then came together in editorial, where they were ordered and polished. In this way, we hoped to maximize the amount of insightful and essential information, and to give you the greatest benefit.
Practical Multicasting on a Nonbroadcast Subnetwork
Authors: Simon Walton, Mario Gerla
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

LAN multicast is now an essential service for users of the MBone and other IP multicast tools. Traditional IP multicast has travelled over two types of subnetwork: point-to-point links and subnetworks with inherent multicast capability, such as Ethernet and token ring. More recent LANs may be arbitrary mesh networks with no built-in, efficient, multicast capability. The authors describe a successful implementation of multicasting over a 640 Mbit/s, wormhole-routing LAN. The implementation is integrated with the wider-area multicast IP service. Consideration is given to practical issues such as interoperation with existing multicast routing protocols and software, and multicast-group setup latencies.
A Comparative Study on Mirror Image Learning and ALSM
Authors: Tetsushi Wakabayashi, Meng Shi, Wataru Ohyama, Fumitaka Kimura
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper, the effectiveness of a corrective learning algorithm MIL (Mirror Image Learning) [1] [2] is comparatively studied with that of ALSM (Average Learning Subspace Method) [3]. Both MIL and ALSM were proposed to improve the learning effectiveness of class conditionaldistributions. While the ALSM modifies the basis vectors of a subspace by subtracting the autocorrelation matrix for counter classes from the one of its own class, the MIL generates a mirror image of a pattern which belongs to one of a pair of confusing classes to increases the size of the learning sample of the other class. The performance of two algorithms is evaluated on handwritten numeral recognition test for IPTP CDROM1 [4]. Experimental results showthat the recognition rate of subspace method is improved from 99.05% to 99.37% by ALSM and to 99.39% by MIL, respectively. Furthermore, the recognition rate of projection distance method is improved from 99.13% to 99.35% by ALSM and to 99.44% by MIL.
Lightning: A System for Reusing Ray Trace Data for Fast Lighting of 3D Scenes
Authors: Jennifer K. Stewart
Venue:  (1998)

Abstract: The most time-consuming part of lighting 3D scenes in computer graphics is the rendering and re-rendering artists have to do as they edit the lights and their parameters. Most lighting editors have some features to expedite this process, such as low resolution or fast shading render previews, but these typically fail to generate exactly the same shadows, highlights, and reflections that appear when the scene is rendered normally. We present a method for ray tracing 3D scenes where these characteristics are rendered just as accurately as with traditional ray tracing, but in up to 98\ from an initial, expensive, ray trace of the scene, we can re-render subsequent changes to the lights in a small fraction of the time it takes to do a regular ray trace, and far more accurately than using a low resolution or fast shading render preview. 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
An Open Architecture for Secure Interworking Services
Authors: Richard Hayton, Ken Moody
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

There is a developing need for applications and distributed services to cooperate or inter-operate. Current mechanisms can hide the heterogeneity of host operating systems and abstract the issues of distribution and object location. However, in order for systems to inter-operate securely there must also be ways to hide differences in security policies, or at least to support negotiation between them.Other proposals for the interworking of security mechanisms have focused on the enforcement of access policy at the expense of flexibility of expression of policy. This work describes a new architectural approach to security. The key idea is that a process is the universal client entity; a process may act on behalf of an identified individual as in traditional security schemes. More generally, a process may adopt an application-specific name or role, and this is used as the basis for authentication in Oasis. A service may then be written in terms of service-specific categories of clients, decoupled from the mechanisms used to specify and enforce access control policy. This approach allows great flexibility when integrating a number of services, and reduces the mismatch of policies that is common in heterogeneous systems. In addition, Oasis services may be integrated with alternative authentication and access control schemes, providing a truly open architecture.A flexible security definition is meaningless if not backed by a robust and efficient implementation. Oasis has been fully implemented, and is inherently distributed and scaleable. In this paper we describe the general approach then concentrate on revocation, where security designs are most often criticized. Oasis is unique in supporting the rapid and selective revocation of privileges which can cascade between services and organizations.
Middleware Techniques and Optimizations for Real-Time, Embedded Systems
Authors: Douglas C. Schmidt
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Due to constraints on footprint, performance, and weight/power consumption, real-time, embedded system software development has historically lagged mainstream software development methodologies. As a result, real-time, embedded software systems are costly to evolve and maintain. Moreover, they are often so specialized that they cannot adapt readily to meet new market opportunities or technology innovations.
A Thermal-Aware Superscalar Microprocessor
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

A thermal-aware technique is proposed to minimize the performance impact when thermal/power control mechanism is triggered. This technique, called thermal-aware microprocessor (TAM), uses on-chip thermal sensors to detect hot-spots within the microprocessor die. There is a secondary pipeline within the core. It is architecturally simple with ultra low power implementation. This secondary pipeline has two main functions: 1. thermal relieve; 2. ultra low power implementation for certain mobile environment (such as any where any time email connect function). When temperature exceeds a given threshold, the core superscalar pipelines are clock-gated while a secondary in-order pipeline is engaged. Since the secondary pipeline consumes much less power, it will have a much lower temperature, and therefore, it will provide a temporary thermal relieve to the core pipelines when the thermal/power mechanism is triggered. This relief reduces energy loss due to leakage, prevents overheating to improve product reliability, and eases cost for thermal solutions. The TAM can also combine with other low power techniques such voltage scaling to achieve ultra low power for mobile. In the paper, we compared TAM with two other thermal/power control techniques, namely dynamic clock disabling and dynamic frequency scaling. The TAM exhibits an 11.4% improvement in overall energy-performance metric with 4.6% increase in area.
A Scalable Efficient Robust Adaptive (SERA) Architecture for the Next Generation of Web Service
Authors: Jia Wang
Venue:  (1999)

The World Wide Web can be considered as a large distributed information system that provides access to shared data objects. As one of the most popular applications currently running on the Internet, the World Wide Web is of an exponential growth in size, which results in network congestion and server overloading. Web caching has been recognized as one of the effective schemes to alleviate the service bottleneck and reduce the network traffic, thereby minimize the user access latency. In this paper, we propose a Scalable Efficient Robust Adaptive (SERA) Web caching architecture which accommodates the exponential growth and extreme dynamic environment of the World Wide Web. We developed a piggybacked prefetching/pre-resolving scheme, which uses user access pattern and network environment information. Cooperative consistency control mechanism is employed to further improve the performance. In order to assist the cache resolution, an efficient cache routing scheme is employed. A loose group membership is maintained among nearby proxy caches to make the entire caching system scalable and fault tolerant. 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
Distributed Graphplan
Authors: Mark Iwen, Amol Dattatraya Mali
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Significant advances in plan synthesis under classical assumptions have occurred in last seven years. All such efficient planners are centralized planners. One very major development among these is the Graphplan planner. Its popularity is clear from its several efficient adaptations/extensions. Since several practical planning problems are solved in a distributed manner, it is important to adapt Graphplan to distributed planning. This involves dealing with significant challenges like decomposing goal and set of actions without losing completeness. We report two sound two-agent planners DGP (distributed Graphplan) and IG-DGP (interaction graph-based DGP). Decomposition of goal and action set in DGP is carried out manually and that in IG-DGP is carried out automatically based on a new representation called interaction graphs. Our empirical evaluation shows that both these distributed planners are faster than Graphplan. IG-DGP is orders of magnitude faster than Graphplan. IG-DGP is significantly benefitted by the interaction graphs which allow decomposition of a problem into fully independent subproblems under certain conditions. IG-DGP is a hybrid planner in which a centralized planner processes a problem until it becomes separable into two independent subproblems that are passed to a distributed planner. This paper also shows that advances in centralized planning can significantly benefit distributed planners.
An open architecture for software process asset reuse
Authors: B. Boehm, S. Wolf
Venue: Proceedings of the 10th International Software Process Workshop (1996)

The development and reuse of software engineering processes within an organization can be impeded by the lack of a solid process framework. An open process architecture provides a framework through the identification of architectural elements and the specification of element interfaces. This paper introduces one open process architecture and examines some architectural element interfaces.
A Computer System for Checking Proofs
Authors: Scott D. Johnson
Venue:  (1981)

NO SUPPLIED
Beyond independent relevance: methods and evaluation metrics for subtopic retrieval
Authors: Cheng Xiang Zhai, William W. Cohen, John Lafferty
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics of a query topic. In such a problem, the utility of a document in a ranking is dependent on other documents in the ranking, violating the assumption of independent relevance which is assumed in most traditional retrieval methods. Subtopic retrieval poses challenges for evaluating performance, as well as for developing effective algorithms. We propose a framework for evaluating subtopic retrieval which generalizes the traditional precision and recall metrics by accounting for intrinsic topic difficulty as well as redundancy in documents. We propose and systematically evaluate several methods for performing subtopic retrieval using statistical language models and a maximal marginal relevance (MMR) ranking strategy. A mixture model combined with query likelihood relevance ranking is shown to modestly outperform a baseline relevance ranking on a data set used in the TREC interactive track.
User-System Interaction in Automatic Information Retrieval
Authors: Gerard Salton, Donald B. Crouch
Venue:  (1989)

Information retrieval activities are now routinely conducted on-line under the control of search intermediaries or end users. Examples are presented of advanced aids that permit the user to control the search process and obtain improved retrieval output.