ppxscal/embedding_network huggingface dataset:
A disquieting output error
Authors: William R. Knight
Venue: ACM SIGNUM Newsletter (1977)

What use to compute accurately the inverse of a matrix or the solution of a differential equation if the output routine mangles the accurate answer? No program is better than the output service which prints its results. This note reports a horrid malfunction of a particular output facility.
n-State Quantum Coin Flipping Protocol
Authors: Atsushi Waseda, Masakazu Soshi, Atsuko Miyaji
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

We propose the n-state quantum coin flipping protocol by generalizing the three states protocol proposed by Ambainis. Furthermore, we conduct security analysis on our protocol and show that in our protocol we can reduce the bias of one player arbitrarily, but at the cost of increase of the bias of the other.
Comprehension by Derivation
Authors: Douglas R. Smith
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

We argue that to comprehend a software system is to have a handle on its requirements, specifications, and design decisions. These kinds of information support the reuse of system code for a variety of purposes and support its ongoing extension, migration, and evolution. Our work at Kestrel Institute has focused on ways to mechanize the development and evolution of software from formal specifications. By-products of such a process include formal records of design decisions and proofs, as well as executable code. In this approach, reuse can take place at non-code levels, including domain theories, specifications, and design knowledge. Evolution takes place by modifying requirements, specifications, or design decisions, and then reusing previous design structures. When restricted to particular application domains, the generation of correct-by-construction code from specifications can be completely automatic.
End-to-end estimation of the available bandwidth variation range
Authors: Manish Jain, Constantinos Dovrolis
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

The available bandwidth (avail-bw) of a network path is an important performance metric and its end-to-end estimation has recently received significant attention. Previous work focused on the estimation of the average avail-bw, ignoring the significant variability of this metric in different time scales. In this paper, we show how to estimate a given percentile of the avail-bw distribution at a user-specified time scale. If two estimated percentiles cover the bulk of the distribution (say 10% to 90%), the user can obtain a practical estimate for the avail-bw variation range. We present two estimation techniques. The first is iterative and non-parametric, meaning that it is more appropriate for very short time scales (typically less than 100ms), or in bottlenecks with limited flow multiplexing (where the avail-bw distribution may be non-Gaussian). The second technique is parametric, because it assumes that the avail-bw follows the Gaussian distribution, and it can produce an estimate faster because it is not iterative. The two techniques have been implemented in a measurement tool called Pathvar. Pathvar can track the avail-bw variation range within 10-20%, even under non-stationary conditions. Finally, we identify four factors that play a crucial role in the variation range of the avail-bw: traffic load, number of competing flows, rate of competing flows, and of course the measurement time scale.
Hardness of the undirected edge-disjoint paths problem
Authors: Matthew Andrews, Lisa Zhang
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We show that there is no log 1 over 3-ε M approximation for the undirected Edge-Disjoint Paths problem unless NP ⊆ ZPTIME(npolylog(n), where M is the size of the graph and ε is any positive constant. This hardness result also applies to the undirected All-or-Nothing Multicommodity Flow problem and the undirected Node-Disjoint Paths problem.
Bringing the Wireless Internet to UMTS Devices: A Case Study with Music Distribution
Authors: Marco Roccetti, Paola Salomoni, Vittorio Ghini, Stefano Ferretti
Venue: Multimedia Tools and Applications (2005)

Wireless networking is becoming an increasingly important communication means. Entry points to content delivery networks (e.g. portals) have to cope with the primary necessity of distributing multimedia contents to 3G mobile devices. In this paper we discuss the software architecture of a wireless Internet application we have designed and implemented to support the distribution of Mp3-based songs to 3G UMTS devices. Alongside the operational description of the proposed architecture, efforts have been made to examine the effects that Internet traffic has on the performance of UMTS networks, due to the distribution of Mp3 files by means of our wireless application. The download time measurements we have experimentally obtained show that combining modern 3G mobile network technologies with an appropriate structuring of the wireless Internet application may be very effective for the fast distribution of pre-recorded music to mobile clients.
Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors
Authors: Sameer M. Bataineh
Venue: Journal of Parallel and Distributed Computing (2005)

Message-passing network-based multicomputer systems emerge as a potential economical candidate to replace supercomputers. Despite enormous effort to evaluate the performance of those systems and to determine an optimum scheduling algorithm (which is known as an NP-complete), we still lack a complete and a good performance model to analyze distributed computing systems. The model is complete if all system parameters, network parameters, communication overhead parameters, and application parameters are considered explicitly in the solution. A good performance model, like a good scientific theory, should be able to explain all normal behavior, predict any abnormality in the system, and allow the designer to adjust some of the parameters, while abstracting unimportant details. In this paper, we develop a good and complete performance model, which predicts a minimum finish time, equally the maximum speed up. In addition, we develop a closed form solution which forecasts the optimum share of the parallel job (task) that has to be assigned to each processor (node). Task assignment may then be undertaken in a distributed manner, which enhances the distributive nature of the system and, thus, improve system performance. Most importantly, our analytical solution presents a mechanism to select, based on system and application parameters, the optimum number of processors (nodes) that has to be assigned to a given parallel job. The model helps the designer to study the effect of each individual parameter on the overall system performance. This then becomes a tool for a designer of a multicomputer system to manage limited resources in an optimal manner paying attention only to those parameters that are most critical.
Sams Teach Yourself Red Hat Desktop 4 All in One (Sams Teach Yourself)
Authors: Aron Hsiao
Venue:  (2005)

Join an estimated 85% of the U.S. Linux market in using Red Hat's Linux distributions by learning it from a Fedora authority. Sams Teach Yourself Red Hat Fedora 4 All in One is a starter kit that will help you install, configure, and use Red Hat's Fedora 4 distribution and desktop applications. The easy-to-understand, step-by-step instructions will also show you how to: Use the OpenOffice.org productivity suite and other leading applications. Troubleshoot hardware issues and install new components. Set up a small Linux-based network to share files and resources.Also included is a DVD, which will provide you with the complete Fedora Core Linux distribution, OpenOffice.org desktop suite, and the leading applications for e-mail, Web browsing, and graphics. Find out how you can safely and reliably use Linux and Linux-based applications to accomplish your day-to-day work in the office and at home with Sams Teach Yourself Red Hat Fedora 4 All in One.
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs
Authors: Elena Riccio Davidson, Thomas H. Cormen
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We describe new features of FG that are designed to improve performance and extend the range of computations that fit into its framework. FG (short for Framework Generator) is a programming environment for parallel programs running on clusters. It was originally designed to mitigate latency in accessing data by running a program as a series of asynchronous stages that operate on buffers in a linear pipeline. To improve performance, FG now allows stages to be replicated, either statically by the programmer or dynamically by FG itself. FG also now alters thread priorities to use resources more efficiently; again, this action may be initiated by either the programmer or FG. To extend the range of computations that fit into its framework, FG now incorporates fork-join and DAG structures. Not only do fork-join and DAG structures allow for more programs to be designed for FG, but they also can enable significant performance improvements over linear pipeline structures.
A simple example of an ill-conditioned matrix
Authors: Garry J. Tee
Venue: ACM SIGNUM Newsletter (1972)

The following example has been found useful in courses of Numerical Analysis, for illustrating the concept of ill-conditioning.
Efficient Evaluation of Alternatives for Assembly of Services
Authors: Nikhil Barthwal, Murray Woodside
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

Component Based Software Engineering (CBSE) provides rapid development using well-tested components with established properties. Performance and other nonfunctional properties can also be analyzed by building models from sub-models, calibrated for the components. Further there can be many choices of components to build systems, which can provide alternatives. The choice can be governed by goal functions which evaluate the predicted performance. This paper describes a systematic approach to find the feasible combinations of alternatives, and to rank them based on predicted performance. It extends the CBML (Component Based Modeling Language) for defining components in layered queuing models for software performance.
Visual Tracking in the Presence of Motion Blur
Authors: Hailin Jin, Paolo Favaro, Roberto Cipolla
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We consider the problem of visual tracking of regions of interest in a sequence of motion blurred images. Traditional methods couple tracking with deblurring in order to correctly account for the effects of motion blur. Such coupling is usually appropriate, but computationally wasteful when visual tracking is the lone objective. Instead of deblurring images, we propose to match regions by blurring them. The matching score for two image regions is governed by a cost function that only involves the region deformation parameters and two motion blur vectors. We present an efficient algorithm to minimize the proposed cost function and demonstrate it on sequences of real blurred images.
Fault-Tolerant Group Membership Protocols Using Physical Robot Messengers
Authors: Rami Yared, Xavier Defago, Takuya Katayama
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In this paper, we consider a distributed system that consists of a group of teams of worker robots that rely on physical robot messengers for the communication between the teams. Unlike traditional distributed systems, there is afinite amount of messengers in the system, and thus a team can send messages to other teams only when some messenger robot is available locally. It follows that a careful management of the messengers is necessary to avoid the starvation of some teams. Concretely, the paper proposes algorithms to provide group membership and view synchrony among robot teams. We look at the problem in the face of failures, in particular when a certain number of messenger robots can possibly crash.
Projecting the flow variables for hub location problems
Venue: Networks (2004)

We consider two formulations for the uncapacitated hub location problem with single assignment &lpar;UHL&rpar;, which use multicommodity flow variables. We project out the flow variables and determine some extreme rays of the projection cones. Then we investigate whether the corresponding inequalities define facets of the UHL polyhedron. We also present two families of facet defining inequalities that dominate some projection inequalities. Finally, we derive a family of valid inequalities that generalizes the facet defining inequalities and that can be separated in polynomial time. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;2&rpar;, 84&ndash;93 2004
Children's and adults' multimodal interaction with 2D conversational agents
Authors: Stéphanie Buisine, Jean-Claude Martin
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Few systems combine both Embodied Conversational Agents (ECAs) and multimodal input. This research aims at modeling the behavior of adults and children during their multimodal interaction with ECAs. A Wizard-of-Oz setup was used and users were video-recorded while interacting with 2D ECAs in a game scenario with speech and pen as input modes. We found that frequent social cues and natural Human-Human syntax condition the verbal interaction of both groups with ECAs. Multimodality accounted for 21% of inputs: it was used for integrating conversational and social aspects (by speech) into task-oriented actions (by pen). We closely examined temporal and semantic integration of modalities: most of the time, speech and gesture overlapped and produced complementary or redundant messages; children also tended to produce concurrent multimodal inputs, as a way of doing several things at the same time. Design implications of our results for multimodal bidirectional ECAs and game systems are discussed.
The robots are coming
Authors: Lars Erik Holmquist
Venue: interactions (2005)

On the Edge will place the spotlight on exciting, unusual and often controversial developments from the world of interaction design. It will discuss issues that challenge the current norm---whether in industry or academia---in a way that is not possible in either a shallow news article or a formal research paper. Topics can include a cool gadget that's just been launched in Tokyo's Akihabara district, or some far out research prototype presented at the latest SIGGRAPH or UbiComp conference. I will also introduce concepts and methods that put a new perspective on the profession. Prototypes are cool, but unless they come with a well-grounded theory and a connection to the world outside the lab, they will soon be forgotten and left in a pile together with last year's Tamagotchis and CHI papers. How can interaction designers---who already maintain a precarious balancing act on the borderline between art and science---create products and interfaces that have the potential to change peoples' lives, while simultaneously serving all their masters: commerce and culture, research and intuition, engineering and design, and so on? Welcome to life On The Edge.
A method for computer synthesis of radio signals for the next generation personal communication systems
Authors: Borislav Y. Bedzhev, Zhaneta N. Tasheva, Borislav P. Stoyanov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The spread spectrum signals have large application in modern personal communication systems, but they must meet many requirements such as: complex pseudorandom structure, ideal autocorrelation function, close to zero cross-correlation function for all of the signals used in the communication system. With regard to these requirements, recently some theorists proposed a new architecture for the next generation wideband wireless communications, based on so named Orthogonal Complementary Codes (OCC). The most distinguishable advantage of this architecture is possibility to operate without multiple access interference. As a result, the system capacity, secrecy, and electromagnetic compatibility can be improved significantly. Due to positive features of the OCC in a previous paper we generalized the OCC conception. On this base, in the present paper we prove a method for creating of generalized OCC with unlimited code length. It is realized as a computer program which automates all procedures during the OCC synthesis.
Designing Partially Survivable Cellular Telecommunications Networks
Authors: Syam Menon, Ali Amiri
Venue: Information Technology and Management (2005)

In a cellular telecommunications network, a mobile telephone switching office (MTSO) co-ordinates the activities of the mobile units either directly or via intermediate base transceivers or hubs. In order to increase reliability, cells often split their traffic via multiple hubs--this ensures partial survivability in the face of equipment failures. One version of this problem was presented in Dutta and Kubat [4] where it was solved heuristically. In this paper, we show how this problem can be reduced to a significantly smaller one--one which can be solved to optimality almost instantaneously even for instances much larger than those presented in Dutta and Kubat [4]. Results from extensive computational tests are presented on various channel capacities, ranging from DS-1 to OC-192. The optimal approach is observed to provide better solutions in less time than the heuristic approach, thereby rendering the use of heuristic approaches unnecessary.
Inescapable Data: Harnessing the Power of Convergence
Authors: Chris Stakutis, John Webster
Venue:  (2005)

How "data everywhere" transforms business, technology, and the way you live A pioneering look at grand, new efficiencies forthcomingAs communications, computing, and data storage converge, data is becoming utterly ubiquitous...and that changes everything. In this book, two leading data management visionaries reveal how data transforms the way you do business, the technologies you use, the investments you make, the life you live, and the world you live in.Chris Stakutis and John Webster draw on interviews with nearly 50 leading experts: technologists, sociologists, entrepreneurs, consultants, researchers, media leaders, and futurists alike. You'll discover how today's "primordial soup" of wired and wireless gadgetry is quickly coalescing into something immensely more powerful, driving applications you thought were pure science fiction. You'll also gain deep insight into the profound implications of ubiquitous data capture: implications that touch everything from your bedroom to the battlefield: The emerging "Connectivity Divide." Which side of the chasm are you on? Inescapable data's technical components: Async communications, pervasive computing devices, wireless, and XML Global calendars, momentary enterprises: Transforming your life and business Uncontrolled information availability: Its risks to your security and well-being The future of technical infrastructure, grids, smart storage, and beyond Radical, new modes of information delivery: Nonnumeric, nontextual, unobtrusive Future tech: From holographic displays to fertility "wall clocks" Your DNA on a chip: The heart of your personal health and wellness program© Copyright Pearson Education. All rights reserved.
Mapping the future in science-intensive industries: lessons from the pharmaceutical industry
Authors: J. W. Cortada, H. E. Fraser
Venue: IBM Systems Journal (2005)

Companies operating in industries that are subject to fundamental changes caused by innovations in science or technology search for ways to anticipate future business and scientific or technological developments so that they can react to them in profitable ways. Using the example of the pharmaceutical industry, which is currently moving from chemically based medications to targeted treatments based on biology, we demonstrate a process for forecasting how the future will look a decade from now. Illustrating the process with a variety of studies already done on this industry, we provide a strategy for mapping the future as well as an analysis of the strengths and limitations of our planning approach. We argue that this approach is applicable to both science-based and technology-based industries.
SAP R/3 Handbook, Third Edition, 3 edition
Authors: Jose Antonio Hernandez
Venue:  (2005)

Table of contentsChapter 1: SAP: From SAP R/3 to SAP NetWeaverChapter 2: The Architecture of the SAP Web Application ServerChapter 3: SAP NetWeaver: An OverviewChapter 4: Using SAP SystemsChapter 5: Upgrading to SAP R/3 Enterprise: The First Step into SAP NetWeaverChapter 6: The Change and Transport SystemChapter 7: Development Options with SAP Solutions: ABAP EngineChapter 8: User Management and Security in SAP EnvironmentsChapter 9: Web Application Server System ManagementChapter 10: Performance and Troubleshooting with SAP SolutionsChapter 11: SAP for IT Managers: Implementation, Planning, Operation, and Support of SAP SystemsINDEX
Optimizing Reduction Computations In a Distributed Environment
Authors: Tahsin Kurc, Feng Lee, Gagan Agrawal, Umit Catalyurek, Renato Ferreira, Joel Saltz
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

We investigate runtime strategies for data-intensive applications that invovle generalized reductions on large, distributed datasets.Our set of strategies includes replicated filter state, partitioned filter state, and hybrid options between these two extremes.We evaluate these strategies using emulators of three real applications, different query and output sizes, and a number of configurations.We consider execution in a homogeneous cluster and in a distributed environment where only a subset of nodes hst the data.Our results show replicating the filter state scales well and outperforms other schemes, if sufficient memory is available and sufficient computation is involved to offset the cost of global merge step.In other cases, hybrid is usually the best.Moreover, in almost all cases, the performance of the hybrid strategy is quite close to the best strategy. Thus, we believe that hybrid is an attractive approach when the relative performance of different schemes cannot be predicted.