ppxscal/embedding_network huggingface dataset:
Cyber Rights: Defending Free Speech in the Digital Age
Authors: Mike Godwin
Venue:  (2003)

:Mike Godwin is a twenty-first-century crusader for free speech. As online counsel to the Electronic Frontier Foundation, Godwin is often the one who gets the first panicked calls from Internet bulletin board operators or private citizens when their apartments are searched and computers seized. Deeply involved in civil liberties on the Net, Godwin shares his personal experience as a lawyer in the fight against the controversial Communications Decency Act of 1996. He provides expert analysis of the disturbing case of Jake Baker, whose short stories about rape-torture, published in an Internet newsgroup, resulted in the seizure of his dorm-room computer. Godwin also brings new insight to the Church of Scientology's claims of intellectual property and copyright infringement, popular Web writers Brock Meeks's and Matt Drudge's encounters with libel law, and Phillip Zimmerman's important fight for the freedom to use encryption software. Godwin offers practical guidelines on how to participate in life on the Net with rules for making virtual communities work, the good citizen's guide to copyright on the Web, and how to hack the media to defend freedoms online.
GPRS and 3G Wireless Applications: Professional Developer's Guide
Authors: Christoffer Andersson
Venue:  (2002)

:To ensure competitive advantage for their companies in wireless product development, developers need to understand how wireless technologies work, what impact they have on applications being developed, and how to use them to optimize products for success in the marketplace. Designed to answer these and other wireless development questions, this unique handbook explores how a host of relevant technologies work together with the new worldwide standards for wireless technologies--General Packet Radio Service (GPRS) and Third Generation (3G). Leading expert Christoffer Andersson clearly explains how GPRS and 3G control the mobile environment, then goes on to describe how the emerging radio technology of Bluetooth fits in with WAP and Java, how wireless applications work with HTTP and TCP/IP on the Internet, and how to create "always-on" wireless applications.
Introduction to Quantum Computation Information
Authors: Hoi-Kwong Lo, Sandu Popescu, Tim Spiller
Venue:  (2002)

:This book aims to provide a pedagogical introduction to the subjects of quantum information and computation. Topics include non-locality of quantum mechanics, quantum computation, quantum cryptography, quantum error correction, fault-tolerant quantum computation as well as some experimental aspects of quantum computation and quantum cryptography. Only knowledge of basic quantum mechanics is assumed. Whenever more advanced concepts and techniques are used, they are introduced carefully. This book is meant to be a self-contained overview. While basic concepts are discussed in detail, unnecessary technical details are excluded. It is well-suited for a wide audience ranging from physics graduate students to advanced researchers.
Capturing the quake player: using a BDI agent to model human behaviour
Authors: Emma Norling
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The BDI agent framework is a well-known agent framework, often discussed in the agents literature. The work described here takes advantage of the folk psychological roots of the philosophical underpinnings of BDI to develop and build models of human behaviour. Knowledge elicitation was closely tied to the folk psychological background, and this was then encoded with a BDI-based language. Although some accommodation did have to be made for the gaps between the BDI philosophy and the implementation language, this approach did provide intuitive way of developing and building these models.
QoS Management at the Transport Layer
Authors: V. Tsaoussidis, S. Wei
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This work reports on further implementation and testing of the Application Oriented Transport Protocol (AOTP) [9, 11]. AOTP is an experimental protocol above IP that provides end-to-end transport service with functionality to trade off Reliability, Throughput and/or Jitter in order to support the Application Layer with the required Quality of Service. Our protocol, based on QoS tradeoffs, can favor application- and/or user-specific QoS characteristics of importance, at the expense of others, less significant.In this paper, we outline the protocol's specification and mechanisms. AOTP provides adjustable partially reliable service, priority-based error recovery strategy and dynamic playback management. We have tested the mechanisms using a Video Transmission application and a simulated, low-bandwidth environment with variable error characteristics. We characterize the tradeoffs associated with these mechanisms; we argue that the application layer can yield significant QoS achievements even within the confines of given environmental constraints, when the transport layer utilizes efficiently the tradeoffs developed in the communication system.
Basic theorems for parallel processes in timed $\mu$CRL
Authors: Jan F Groote, J. Wame
Venue:  (1998)

Timed $\mucrl$ is a process algebra-based formalism for the specification and verification of parallel, communicating systems with explicit time \cite{Gr97}. In this paper various basic results are derived, such as theorems for {\it basic forms\/}, the expansion of terms with operators for parallelism, elimination of parallelism, and commutativity and associativity of the merge and communication merge (the operators $\|$ and $|$).
The Impact of Software Structure and Policy on CPU and Memory System Performance
Authors: J. B Chen
Venue:  (1994)

Keywords: Operating systems, memory systems, performance, address tracing 172 pages [FTP: CMU-CS-94-145.ps.Z] Operating systems, when compared to application programs, have received disappointingly little benefit from the performance improvements of the most recent generation of microprocessors. This thesis used complete traces of software activity from a RISC-based uniprocessor to expose the dynamic behavior of operating system execution and explore the sources of poor performance. Traces from both Mach 3.0 and Ultrix implementations of UNIX permitted a study of performance differences between microkernel and monolithic implementations of the same operating system interface. The comparison showed that both system structure and policy implemented in the system have a significant impact on performance. Measurements of X11 workloads showed that memory system behavior for these large workloads differs significantly from the kinds of workloads traditionally used for performance analysis. Structural and behavioral similarities between large X11 workloads and the operating system are reflected in their overall performance. These experiments represent the first application of address tracing with software instrumentation to the study of behavior in a popular operating system. The development of the tools and their application in this research demonstrates that such methods are a powerful tool for understanding behavior and interactions in complex software systems. Overall, the experiments demonstrate that system level effects must be measured for a complete understanding of overall performance. 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
The YATE Fail-Safe Interface: The User's Point of View
Authors: D. Bied-Charreton, D. Guillon, B. Jacques
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

This paper deals with some aspects of the use of self-checking integrated circuits in an application that manages the major risks involved in a transport system.It aims to provide an objective account of the advantages and disadvantages of this type of technology.Attentionhas been focused on the demands made by such integrated circuits on their environment, in particular the CPUs which control them.Nevertheless, much work still needs to be done to bring the design and testing of integrated circuits more in line with the needs of rail safety applications.
The NetSolve Environment: Progressing Towards the Seamless Grid
Authors: Dorian C. Arnold, Jack Dongarra
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The NetSolve software project has matured into a robust system that reliably manages and interconnects disparate computational resources. Resource management and allocation policies, heterogeneity, fault tolerance and security are some of the issues that need to be resolved in such environments. This article is meant to introduce the reader to the NetSolve system and offers a discussion of some of the key developments that have taken place in the project during recent months. T o make the article coherent and somewhat self-contained, brief insight is given into some of the more fundamental aspects of NetSolve; the newer features and enhancements are given a more detailed discussion. For completion, there is a discussion of successful uses and integrations of the NetSolve system.
The PRL Mathematics Environment: A Knowledge Based Medium
Authors: Joseph L. Bates
Venue:  (1986)

NOT SUPPLIED
On Teaching Left-Handed Children to Write
Authors: Dexter Kozen
Venue:  (1987)

It is argued that the handwriting method commonly taught to left-handed children is incorrect and harmful. The disadvantages of this method are noted, and a new method alleviating these disadvantages is proposed. 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
Real-Time Thread Package
Authors: Kostadis Roussos
Venue:  (1996)

Solaris threads and the real-time facilities of the OS are a powerful combination for solving concurrency problems whose correctness depends on timeliness of execution. Unfortunately the RT facilities and Solaris threads cannot be easily combined by application programmers. Furthermore, the constraints on access to the RT facilities limits the potential user base of applications that make use of RT threads. The Real Time Thread Package (RTTP) is a C++ framework, that extends the Brown Thread Package (BTP), and provides a simple mechanism for writing applications that use real-time threads. This paper describes in detail the design and implementation providing both motivation and justification. The paper also discusses an application that used the RTTP in conjunction with a C++ framework for writing Producer-Consumer style programs.
An Elementary Formal Semantics for the Programming Language PL/CS
Authors: Robert L. Constable, James E. Donahue
Venue:  (1976)

The PL/CS language is an instructional variant of PL/C designed to provide a simple, easy-to-understand tool to teach a disciplined style of programming (see [Conway 1976]). This report gives a complete formal semantic specification of the language, following the style of [Scott and Strachey 1972]. In keeping with the goal of simplicity in the design of PL/CS, the formal definition is presented in an hierarchical fashion and uses only elementary mathematical concepts, such as set, relation, and recursive definition. Key Words: programming language semantics, denotational semantics, recursive functions, Pl/I, PL/C, PL/CS.
A Categorical Powerdomain Construction
Authors: Radhakrishnan Jagadeesan
Venue:  (1989)

The class of countably based bifinites (SFP objects) is the usual mathematical framework for carrying out the constructions that arise in the semantics of programming languages. However, A. Jung showed that the construction used to define the domain-theoretic semantics of polymorphic lambda calculus, is not closed on this category. This motivates the search for a suitable category that is closed under all the constructions used in programming language semantics. T. Coquand developed categories of embeddings as a categorical generalization of the domain-theoretic structures used to give semantics of polymorphism. In this paper, we present a categorytheoretic powerdomain construction that is closed on the (extensional) categories of embeddings. The construction is shown to have universal properties that resemble the universal properties of the Plotkin powerdomain.
An Unsupervised Collaborative Learning Method to Refine Classification Hierarchies
Authors: Cédric Wemmert, Pierre Gançarski, Jerzy Korczak
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This article deals with the design of a hybrid learning system. This system integrates different kinds of unsupervised learning methods and gives a set of class hierarchies as the result. The classes in these hierarchies are very similar. The method occurrences compare their results and automatically refine them to try to make them converge towards a unique hierarchy that unifies all the results. Thus, the system decreases the importance of the initial choices made when initializing an unsupervised learning (the choice of the method and its parameters) and to solve some of the limitations of the methods used such as an imposed number of classes, a non-hierarchical result, or the size of the hierarchy.
Technology Idea Journal
Authors: Dwight Gibbs, Mike Toma, Daniel Jaye
Venue:  (2002)

:Bigwig Briefs: Techie Talk includes knowledge excerpts from some of the biggest name CTOs in the world including CTOs from BEA Systems, Novell, Electronic Arts, Valicert, Engage and more on ways for every executive to implement and capitalize on the best technologies in the world. These highly acclaimed CTOs explain the secrets behind using technology to increase efficiencies and profits, and specifically which technologies on the horizon will be important for every organization. Topics also covered include getting your team up to speed from a technology standpoint, managing technology change, keeping up to date with the latest technological developments and the pluses and minuses of specific technologies. A must read for every professional, CEO and CTO, regardless of their lack of knowledge or interest in technology, this book will give you everything you need to harness the power of technology to increase efficiencies and profits for you company.
A New Self-Checking Code-Disjoint Carry-Skip Adder
Authors: D. Marienfeld, E. S. Sogomonyan, V. Ocheretnij, M. Gössel
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

In this paper the first self-checking code-disjoint carry-skip adder is investigated. The adder is code-disjoint with respect to the parity encoded operands and self-testing and fault-secure with respect to all single stuck-at faults of the adder cells.
A Comparison of Task Partitioning Techniques
Authors: M. E. McArdle, C. L. McCreary
Venue:  (1991)

Automatically converting a program into a version for execution on a multiprocessor system involves partitioning and scheduling the tasks of the computation onto processors. Given a program dependence graph representing the computational tasks in a program and the dependencies between those tasks, they must be mapped onto the multiprocessor architecture in order to minimize the total execution time. Three methods of task partitioning are compared: linear clustering, the LAST algorithm, and clan decomposition. It is shown that the partitioning strategy based upon clan decomposition produces superior schedules than those generated by the other techniques.
Networked Wearable Musical Instruments Will Bring A New Musical Culture
Authors: Kazushi Nishimoto, Tadao Maekawa, Yukio Tada, Kenji Mase, Ryohei Nakatsu
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Many people enjoy music daily, but in a very passive way. To more actively enjoy music, some novel musical instruments are necessary. As a candidate for a novel musical instrument, we propose a networked wearable musical instrument. This paper describes the design of the networked musical instrument as well as a prototype system. Furthermore, we demonstrate several possible novel applications of the networked wearable musical instrument. We think that this networked wearable musical instrument will bring us a novel type of musical entertainment and a novel musical culture.
Evaluation of Orientation Interfaces for Wearable Computers
Authors: David A. Ross, Bruce B. Blasch
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

The authors employed wearable technology in the development of an orientation aid for people with severe visual impairment. These people need a means of remaining oriented to their environment as they work their way along using their cane or dog guide. A wearable computer was used as the base for evaluating three novel orientation interfaces - interfaces that resulted from the suggestions of 20 subjects in a previous study. These were: a virtual sound beacon, digitized speech, and a tapping interface. Street crossing was used as a critical orientation situation for interface testing. Significant results were: 1) the tapping interface was usable by all under all conditions, 2) speech was sometimes confusing and not always usable, and 3) the virtual beacons were preferred by many for many situations, but were not usable in very noisy environments or by people with hearing impairments in one or both ears. Investigators concluded the best interface might be one that combines tactile cues with an improved speech output format.
The design of the Venus Operating System
Authors: Barbara H. Liskov
Venue: ACM SIGOPS Operating Systems Review (1972)

The Venus Operating System is an experimental multiprogramming system which supports five or six concurrent users on a small computer. The system was produced to test the effect of machine architecture on complexity of software. The system is defined by a combination of micro-programs and software. The microprogram defines a machine with some unusual architectural features; the software exploits these features to define the operating system as simply as possible. In this paper the development of the system is described, with particular emphasis on the principles which guided the design.
MCSE Training Guide (70-215)
Authors: Dennis Maione
Venue:  (2002)

:Exam 70-215, Installing, Configuring, and Administering Microsoft Windows 2000 Server, measures your ability to implement, administer, and troubleshoot information systems that incorporate Windows 2000 Server. This exam focuses on the server in the roles of file, print, application, and web server. Que Certification has again partnered with some of the most experienced authors and instructors to bring you the best information available to help you pass this core exam and become Microsoft-certified. Designed for current MCPs or MCSEs and network professionals with at least a year of experience, this self-study Training Guide is organized according to the actual exam objectives, equipping you with the knowledge you need to pass the exam. Each book in the best-selling Training Guide series undergoes a stringent review process, including at least two industry experts who serve as technical reviews -- ensuring the books are accurate, comprehensive, and the ultimate resource for your exam-preparation needs.
A Universal Top-Down Fixpoint Algorithm
Authors: Baudouin L Charlier, Pascal Van Hentenryck
Venue:  (1992)

Computing fixpoints and postfixpoints of transformations has numerous applications in computer science. In this paper, we present a universal top-down fixpoint algorithm based on the weak assumption that the transformation is defined by an effective procedure. Given the procedure and a parameter value, the universal algorithm computes the value of the parameter value in the least fixpoint of the transformation has the property of focusing on the subset of elements necessary to compute the result. The total correctness of the algorithm is proven and requires some weak (but rather technical) assumptions. These conditions can be relaxed further if postfixpoints suffice for the application. As a consequence, the algorithm generalizes and abstracts numerous algorithms and provides a versatile alternative to bottom-up algorithms. It has been used to derive specific abstract interpretation algorithms for Prolog, which are practical both in terms of efficiency and accuracy and are, to our knowledge, the fastest algorithms available.
The Priority Inversion Problem and Real-Time Symbolic Model Checking
Authors: Sergio V. Campos
Venue:  (1993)

Priority inversion is a serious problem that can make real-time systems unpredictable in subtle ways. This makes it more difficult to implement and debug such systems. Our work discusses this problem and presents one possible solution. The solution is formalized and verified using temporal logic model checking techniques. In order to perform the verification, the @c(bdd)-based symbolic model checking algorithm given in McMillan''s "Symbolic model checking -- an approach to the state explosion problem" was extended to handle real-time properties using the bounded until operator. We believe that this algorithm, which is based on discrete time, is able to handle many real-time properties that arise in practical problems.
Numerical Analysis in Modern Scientific Computing: An Introduction, 2 edition
Authors: Peter Deuflhard, Andreas Hohmann
Venue:  (2003)

:This text will appeal to undergraduate and graduate students as well as researchers in mathematics, computer science, science, and engineering. At the same time, it is addressed to practical computational scientists who, via self-study, wish to become acquainted with modern concepts of numerical analysis and scientific computing on an elementary level. The sole prerequisite is undergraduate knowledge in linear algebra and calculus.
Intersection Queries in Curved Objects
Authors: K P Agarwal, van M Kreveld, Mark Overmars
Venue:  (1991)

\indent A number of problems of the following type are studied: Given a set of $n$ arcs (disks, circles, circular arcs, Jordan arcs) in the plane, preprocess it into a data structure, such that for a query line (or segment) one can quickly (i) report all arcs intersecting it, or (ii) count the number of arcs intersecting it. We also study the ray shooting problem in disjoint Jordan arcs, and circular arcs. Most of the data structures presented here use near to linear space and have query time near to $O(\sqrt{n}+K)$ or near to $O(n^{2/3}+K)$, where $K$ is the size of the output.