ppxscal/embedding_network huggingface dataset:
World Without Secrets: Business, Crime, and Privacy in the Age of Ubiquitous Computing
Authors: Richard Hunter
Venue:  (2002)

:Unique, international personal identifiers ... near-instantaneous data mining ... biometric face printing ... intelligent embedded devices everywhere that record, interpret, and transmit virtually everything you say and do. It's not science fiction. Much of this technology is already in place and the rest is on the way. By the end of the current decade we will inhabit a man-made environment of ubiquitous computing in which everything is recorded and nothing is forgotten. World Without Secrets explores the realities and implications of a world in which anyone who wants badly enough to know anything about you, your business, or anything else will be able to get that information. It examines the information-gathering technologies that are and will be deployed -- on our streets, in our offices and public buildings, even in our homes and cars -- and explains their benefits as well as potential serious abuses. This bone-chilling expose investigates the likely impact of ubiquitous computing on every aspect of our business, personal, political, and cultural lives. Will we be safer and our property more secure? When everything is known, how will we decide what's most important to know? Will there be any way to keep confidential information confidential? How will business protect intellectual capital? World Without Secrets also takes you into the "shadow world" of state and private-sector criminals whose livelihood is based on illicit use of growing mountains of information. It offers strategies for surviving and succeeding in a world that is rife with opportunity but dangerous for the wary and unwary alike. And it suggests policy options that can protect individuals and organizations from exploitation and safeguard the implicit contract between employees, businesses, and society itself. Peppered with uncommonly sharp insights into the way we understand information, conduct business, and try to control our surroundings, World Without Secrets breaks new ground in describing the impact of new technologies on the way we live and work. This comprehensive guide to the immediate future is compelling and necessary reading for anyone who wants to prepare personally and professionally for the enormous changes soon to come.
Planning the Construction of a Building
Authors: Martin Aronsson
Venue:  (1993)

The paper describes a tool for generating plans for the construction of a building. The application is implemented in GCLA, together with a simple constraint solving system. The main idea is that experiences from other plans are stored in methods; which are a systematic way of grouping activities together as higher level activities that can solve more complex tasks. Activities are entities that perform some action on a model of the real world, called the global state. Activities have preconditions, i.e. starting conditions, some representation of time and resource consumption, and postconditions, i.e. how and what to change in the global state. Scheduling activities amounts to allocating resources and placing the activities in time. The goal of the planning process, i.e what we want the planning process to achieve, is represented by a geometric model of the changed global state, i.e. a design of the specified building that one wants to build. To create plans, the system is divided into two main phases; the choice-of-method phase and the scheduling phase. In the choice-of-method phase suitable methods are chosen based on experience from the past. Such methods already exists in the building industry, although not in an explicit formal representation. Then the scheduling phase allocates resources and places the activities in time by reasoning about the activities'' change of the global state. The goal of the planning process is that the objects of the specified design should be produced and represented in the global state. The user can change most of the behaviour of the system by indicating what he wants it to do. He can change activities, their preconditions, calculations and postconditions, he can change methods, or add or remove activities to them, he can change resources etc. By this flexibility, the user can form his system to reflect his own preferences about how to plan and what to plan. 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
Certification reports: supporting transactions in wireless systems
Authors: D. Barbara
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

The emergence of small portable computers and the advances in wireless networking have made mobile computing today a reality. Information systems and databases are among the applications that make mobile computing attractive. While the topic of querying data in wireless and mobile systems has received a lot of attention, techniques to efficiently update data in these systems while providing transaction semantics are not fully developed. We present a novel protocol that uses the broadcast facility to help mobile units do some of the work of verifying if the transactions being run by them need to be aborted. Only when the mobile unit cannot detect any conflict is the server involved in completing the verification. Of course, if the transaction can commit, the server will install the valves in the central database and notify the mobile units (again, using the broadcast channel). The protocol uses a modified version of optimistic control. We study the performance of the protocol by means of a detailed simulation.
File-Access Characteristics of Parallel Scientific Workloads
Authors: Nils Nieuwejaar, David Kotz, Apratim Purakayastha, Carla S Ellis, Michael Best
Venue:  (1995)

Phenomenal improvements in the computational performance of multiprocessors have not been matched by comparable gains in I/O system performance. This imbalance has resulted in I/O becoming a significant bottleneck for many scientific applications. One key to overcoming this bottleneck is improving the performance of parallel file systems. The design of a high-performance parallel file system requires a comprehensive understanding of the expected workload. Unfortunately, until recently, no general workload studies of parallel file systems have been conducted. The goal of the CHARISMA project was to remedy this problem by characterizing the behavior of several production workloads, on different machines, at the level of individual reads and writes. The first set of results from the CHARISMA project describe the workloads observed on an Intel iPSC/860 and a Thinking Machines CM-5. This paper is intended to compare and contrast these two workloads for an understanding of their essential similarities and differences, isolating common trends and platform-dependent variances. Using this comparison, we are able to gain more insight into the general principles that should guide parallel file-system design.
A Decentralized Scheme for Multi-Node Broadcasting on Hypercubes
Authors: Yoshiyuki Hayakawa, Satoshi Fujita, Masafumi Yamashita
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper, we study the following multi-node broadcast problem on hypercubes, which is an asynchronous and repetitive version of all-to-all broadcast problem. Suppose that nodes of a hypercube asynchronously repeat broadcasting a piece of information called a token. They can asynchronously initiate their broadcasts while other broadcasts are in process. The multi-node broadcast problem, which we discuss in this paper, is the problem of completing each of these broadcasts quickly. It is neither the broadcast problem, which assumes that no nodes initiate a broadcast while a broadcast is in process, nor the gossip problem, which assumes that all nodes initiate broadcasts simultaneously. We propose an adaptive scheme {\sf SORT} for solving the problem in such a way that each initiator of a broadcast determines the broadcast route based only on local information. The effectiveness of {\sf SORT} is demonstrated by simulations.
Mcsa/MCSE: Windows 2000 Network Management Study Guide
Authors: Michael Chacon, James Chellis, Matthew Sheltz
Venue:  (2002)

:Here's the book you need to prepare for Exam 70-218, Managing a Microsoft Windows 2000 Network Environment. This study guide provides: In-depth coverage of official exam objectives Practical information on managing a Windows 2000 network Hundreds of challenging review questions, in the book and on the CD Leading-edge exam preparation software, including a testing engine, flashcards, and simulation software. Authoritative coverage of all exam objectives, including: Creating, configuring, securing, and troubleshooting file, print, and web resources Configuring, administering, and troubleshooting the network infrastructure Managing servers and client computers Configuring, securing, and troubleshooting remote access Managing and troubleshooting active directory organizational units and group policy Featured on the CD The enclosed CD is packed with vital preparation tools and materials, beginning with the Sybex EdgeTest testing engine for the Windows 2000 Network Management exam. Loaded with hundreds of practice questions, it lets you test yourself chapter by chapter or according to objective areas. You'll also find electronic flashcards for your PC and Palm handhelds, two bonus exams that will help you prepare for the test, WinSim 2000 product simulation software, and a fully searchable electronic version of the book. About the Authors Michael Chacon, MCT and MCSE, is senior solutions manager for Netigy Corporation. He is an internationally known advisor, lecturer, and columnist. James Chellis, MCT and MCSE, is CEO of EdgeTek, a Microsoft Certified Solution Providerspecializing in training and courseware development. Anil Desai, MCSE, MCSD, MCDBA, is a consultant working in Austin, Texas. He is also a regular contributor to Microsoft Certified Professional magazine. Matthew Sheltz, MCP, is a software engineer and systems administrator for EdgeTek Education.
Determination of factors which impact on IT students' propensity to cheat
Authors: Judy Sheard, Angela Carbone, Martin Dick
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

There is a large body of research that indicates the practice of cheating amongst students in the tertiary sector is widespread. Various studies have also attempted to determine reasons why students decide to cheat, or not to cheat. Although some common factors have been identified, there are indications that the level of cheating varies across disciplines of study, suggesting that there may be factors in specific learning situations that have influence on a student's propensity to cheat. This paper reports on two studies, one which investigates the cheating practices of IT students and their attitudes toward cheating, and the other which investigates the work practices of IT students. These studies identify particular problems that IT students face in their learning and give insights into situations which can lead to poor learning practices and, in the worst cases, cheating.
An Effective Current Source Cell Model for VDSM Delay Calculation
Authors: Alexander Korshak
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

We present a new approach to model delay of the digital cell in VDSM IC designs. It provides higher accuracy for both delay and transition time than the conventional effective capacitance approximation. The cell is modeled by an effective current source that emulate the behavior of the transistor network. The proposed model is based upon the standard timing tables of the characterized cell.
Partial Lookup Services
Authors: Qixiang Sun, Hector Garcia-Molina
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Lookup services are used in many Internet applicationsto translate a key (e.g., a file name) into an associated set ofentries (e.g., the location of file copies). The key lookupscan often be satisfied by returning just a few entries insteadof the entire set. However, current implementations oflookup services do not take advantage of this usage pattern.In this paper, we formalize the notion of a partial lookup servicethat explicitly supports returning a subset of the entriesper lookup. We present four schemes for building a partiallookup service, and propose various metrics for evaluatingthe schemes. We show that a partial lookup service mayhave significant advantages over conventional ones in termsof space usage, fairness, fault tolerance, and other factors.
Inter-flows jitter analysis for multimedia traffic in ATM networks
Authors: S. El-Henaoui, R. Coelho, S. Tohme
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Multimedia traffic is a special traffic consisting of different components (video, voice and data) belonging all to the same application and hence being strictly temporarily bounded. The jitter impact on multimedia (MM) traffic in ATM networks is analyzed. The inter-flows jitter (IFJ) parameter, that defines the jitter between several associated traffic flows is introduced. Furthermore, the jitter and IFJ are studied under two different multiplexing schemes namely, "all in one virtual path (VP)" and "one VP for each". An IFJ recovery mechanism (IFJ-rm) is finally proposed to restore the original traffic. Simulation results for the IFJ-rm under different scheduling disciplines are presented and discussed.
A Trust Region and Affine Scaling Interior Point Method for Nonconvex Minimization with Linear Inequality Constraints
Authors: T. F. Coleman, Yuying Li
Venue:  (1997)

A trust region and affine scaling interior point method (TRAM) is proposed for a general nonlinear minimization with linear inequality constraints in [8]. In the proposed approach, a Newton step is derived from the complementarity conditions. Based on this Newton step, a trust region subproblem is formed, and the original objective function is monotonically decreased. Explicit sufficient decrease conditions are proposed for satisfying complementarity, dual feasibility and second order optimality. The objective of this paper is to establish global and local convergence properties of the proposed trust region and affine scaling interior point method. It is shown that the proposed decrease conditions are sufficient for achieving complementarity, dual feasibility and second order optimality respectively. It is also established that a trust region solution is asymptotically in the interior of the proposed trust region subproblem and a damped trust region step can achieve quadratic convergence.
Characteristics of WWW Client-based Traces
Authors: Carlos Cunha, Azer Bestavros, Mark Crovella
Venue:  (1995)

Abstract The explosion of WWW traffic necessitates an accurate picture of WWW use, and in particular requires a good understanding of client requests for WWW documents. To address this need, we have collected traces of actual executions of NCSA Mosaic, reflecting over half a million user requests for WWW documents. In this paper we present a descriptive statistical summary of the traces we collected, which identifies a number of trends and reference patterns in WWW use. In particular, we show that many characteristics of WWW use can be modelled using power-law distributions, including the distribution of document sizes, the popularity of documents as a function of size, the distribution of user requests for documents, and the number of references to documents as a function of their overall rank in popularity (Zipf''s law). In addition, we show how the power-law distributions derived from our traces can be used to guide system designers interested in caching WWW documents. --- Our client-based traces are available via FTP from http://www.cs.bu.edu/techreports/1995-010-www-client-traces.tar.gz http://www.cs.bu.edu/techreports/1995-010-www-client-traces.a.tar.gz
A Two-Phase Process for Software Architecture Improvement
Authors: R. Krikhaar, A. Postma, A. Sellink, M. Stroucken, C. Verhoef
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Software architecture is important for large systems in which it is the main means for, among other things, controlling complexity. Current ideas on software architectures were not available more than ten years ago. Software developed at that time has been deteriorating from an architectural point of view over the years, as a result of adaptations made in the software because of changing system requirements. Parts of the old software are nevertheless still being used in new product lines. To make changes in that software, like adding features, it is imperative to first adapt the software to accommodate those changes. Architecture improvement of existing software is therefore becoming more and more important.This paper describes a two-phase process for software architecture improvement, which is the synthesis of two research areas: the architecture visualisation and analysis area of Philips Research, and the transformation engines and renovation factories area of the University of Amsterdam. Software architecture transformation plays an important role, and is to our knowledge a new research topic. Phase one of the process is based on Relation Partition Algebra (RPA). By lifting the information to higher levels of abstraction and calculating metrics over the system, all kinds of quality aspects can be investigated. Phase two is based on formal transformation techniques on abstract syntax trees. The software architecture improvement process allows for a fast feedback loop on results, without the need to deal with the complete software and without any interference with the normal development process.
Reducing Multiple Object Motion Planning To Graph Searching
Authors: John E. Hopcroft, Gordon Wilfong
Venue:  (1984)

In this paper we study the motion planning problem for multiple objects where an object is a 2-dimensional body whose faces are line segments parallel to the axes of $R^{2}$ and translations are the only motions allowed. Towards this end we analyze the structure of configuration space, the space of points that correspond to positions of the objects. In particular, we consider CONNECTED, the set of all points in configuration space that correspond to configurations of the objects where the objects form one connected component. We show that CONNECTED consists of faces of various dimensions such that if there is a path in CONNECTED between two 0-dimensional faces (vertices) of CONNECTED then there is a path between them along 1-dimensional faces (edges) of CONNECTED. It is known that if there is a motion between the configurations. Thus by the result of this paper the existence of a motion between two vertices of CONNECTED implies a motion corresponding to a path along edges of CONNECTED. Hence we have reduced the motion planning problem from a search of a high dimensional space to a graph searching problem. Searching the graph of vertices and edges of CONNECTED for a path has a prohibitive worse-case complexity because of the large number of vertices and edges. However, if the search generates edges and vertices only as they are needed, a practical and efficient algorithm may be possible using some effective heuristic. From this result it is shown that motion planning for rectangles in a rectangular boundary is in PSPACE. Since it is known that the problem is PSPACE-hard we conclude it is a PSPACE-complete problem.
Low-power and High-Speed V VLSI Design with Low Supply Voltage through Cooperation between Levels
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

In this paper, methods to achieve low-power and high-speed VLSI's are described with the emphasis on cooperation between levels. To suppress the leakage current in a standby mode, Boosted Gate MOS (BGMOS) is effective, which is based on cooperation between technology level and circuit level. To reduce the power in an active mode, VDD-hopping and VTH-hopping are promising, which are cooperative approaches between circuit and software. Power consumed in interconnect system is another issue in low-voltage deep-submicron designs. A cooperative approach between VLSI and assembly to the interconnect power problem is also discussed.
Organization of a Microprocessor Design Process Using Internet-Based Interoperable Workflows
Authors: Artur Kokoszka, Dariusz Obrebski
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The paper presents a new approach towards large system design in distributed teams based on a workflow technology. The techniques applied introduce interoperability among design tools across computing platforms and organization borders. They result in an improved quality of wide area engineering collaboration. After a short discussion about selected aspects of the applied workflow technology from an electronic design engineers' perspective, an Internet-based distributed design process of IP components with emphasis on specific elements of microprocessor designs is introduced. As an example, we present a workflow that enables integration and interoperability of selected IP design tasks, represented as parallel and serial sets of the workflow activities. The workflows that were employed in the design process had been developed for the purpose of design task integration in the pan-European project E-Colleg. They can be effectively adopted by distributed teams working on multiple sites, multiple platforms for remote project management.
Re-examining the potential effectiveness of interactive query expansion
Authors: Ian Ruthven
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Much attention has been paid to the relative effectiveness of interactive query expansion versus automatic query expansion. Although interactive query expansion has the potential to be an effective means of improving a search, in this paper we show that, on average, human searchers are less likely than systems to make good expansion decisions. To enable good expansion decisions, searchers must have adequate instructions on how to use interactive query expansion functionalities. We show that simple instructions on using interactive query expansion do not necessarily help searchers make good expansion decisions and discuss difficulties found in making query expansion decisions.
Automated Assessment: How Confident Are We?
Authors: Jonathan Allan, Tony Allen, Nasser Sherkat
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper highlights the research issues associated with the automated assessment ofhandwritten s ripts and introduces the theoretical S oring Confidence with the aim to develop previous work [1 ].Using this concept, in a 3 word response environment,we prove that it is theoretically possible to achieve a Scoring Confidence greater than 98%using recognition rates as low as 81%to produce actual response yields of 50%.These results are verified byexperiment.