ppxscal/embedding_network huggingface dataset:
Society Online: The Internet in Context
Authors: Steve Jones, Philip N. Howard
Venue:  (2003)

:Within the developed world, much of society experiences political, economic, and cultural life through a set of communication technologies barely older than many citizens. Society Online: The Internet in Context examines how new media technologies have not simply diffused across society, but how they have rapidly and deeply become embedded in our organizations and institutions. Society Online is not exclusively devoted to a particular technology, or specifically the Internet, but to a range of technologies and technological possibilities labeled "new media." Rather than trying to cover every possible topic relating to new communication technologies, this unique text is organized by how these new technologies mediate the community, political, economic, personal, and global spheres of our social lives. Editors Philip N. Howard and Steve Jones explore the multiple research methods that are required to understand the embeddedness of new media. Society Online discusses the findings of the Pew Internet and American Life Project and is the first book to bring together leading social scientists to provide the most comprehensive and far-reaching Internet research data sets and to contextualize Internet use in modern life. The book features contributions by leading scholars from across the social sciences using a range of research techniques including systematic content analysis; comparative methods; quasi-experimental methods; probit; ordinary least squares and logistic regression analysis; small focus groups; historical, archival, and survey methods; ethnographic and auto-ethnographic work; and comparative analyses of policy traditions to probe, analyze, andunderstand the Internet in the context of everyday life. Society Online is designed for undergraduate and graduate students taking media studies courses in the areas of Communication, Sociology, Political Science, Anthropology, Cultural Studies, Information Sciences, and American Studies.
Real-Time Animated Stippling
Authors: Oscar Meruvia Pastor, Bert Freudenberg, Thomas Strothotte
Venue: IEEE Computer Graphics and Applications (2003)

Stippling is an artistic rendering technique that provides shading and texture when a user places points or stipples on a canvas until the desired darkness is achieved. Computer-generated stippling has focused on producing high-quality 2D renditions for print media; while stippling of 3D models in animations has received little attention. This article describes current advances in stippling for print media and real-time rendering. It then presents an approach to produce animations of 3D models using stippling as a rendering style. The approach ensures frame-to-frame coherence as the model moves and shading changes over time by attaching stipple particles to the surface of the model and smoothly varying their size. The method uses a point hierarchy generated by mixing mesh simplification and subdivision techniques to control the stipple density during rendering. The article presents solutions for rendering animated and static models using conventional and vertex-programmable graphics hardware.
A Proactive Password Checker
Authors: Matt Bishop
Venue:  (1990)

Password selection has long been a difficult issue; traditionally, passwords are either assigned by the computer or chosen by the user. When the computer does the assignments, the passwords are often hard to remember; when the User makes the selection, the passwords are often easy to guess. This paper describes a technique, and a mechanism, to allow users to select passwords which to them are easy to remember but to others would be very difficult to guess. The technique is site, user, and group configurable, and allows rapid changing of constraints impossed upon the passwords. Although experience with this technique has been limited, it appears to have much promise.
Experimental and Simulation Studies of Single-Electron-Transistor-Based Multiple-Valued Logic
Authors: Hiroshi Inokawa, Yasuo Takahashi
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

Periodic drain current-gate voltage characteristics ofsingle-electron transistors (SETs) were utilized toconstruct basic components of multiple-valued logic(MVL), such as a universal literal gate and a quantizer.In order to supplement the small gain and the smallapplicable voltage of the SET, hybrid SET-MOSFETscheme is proposed and demonstrated experimentallyusing CMOS-compatible pattern-dependent oxidation(PADOX) technology.We also succeeded in reproducingthe results using a SPICE circuit simulator with acompact analytical SET model, and estimated theperformance of the proposed MVL.
Towards Fault-Tolerant Process Control Software
Authors: Fred B. Schneider, Richard D. Schlichting
Venue:  (1980)

We show how to construct fault tolerant software for a multiprocessor consisting of N processors, each of which has access to its own local memory, which is volatile, and access to an N-port shared memory, which is non-volatile and fault tolerant. Several ways to implement this non-volatile, fault tolerant, shared memory are described. Software fault tolerance is achieved by structuring a program as a collection of cyclic processes with well defined communications channels and using a simple protocol involving checkpoints.
Parallel Accessible Memory
Authors: Shinji Nakamura
Venue:  (1986)

A new design of a memory device which allows simultaneous access to more than one location is proposed. The unique feature of this multiple accessibility of the memory is realized by applying a binomial concentrator, a type of sparse crossbar interconnection network, to content-addressable memory. The organization of the memory system and the concentration network structure as well as the network characteristics are described along with a distributive control algorithm. Applications of the memory system to parallel processing environments are also included. 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 Message Driven File System: a Network Accessible File System for Fine-Grain Message Passing Multicomputers
Authors: Yair Zadik
Venue:  (1996)

No abstract available.
Computation of the Singular Value Decomposition Using Mesh-Connected Processors
Authors: Richard P. Brent, Franklin T. Luk, Charles Van Loan
Venue:  (1983)

A cyclic Jacobi method for computing the singular value decomposition of an $mxn$ matrix $(m \geq n)$ using systolic arrays is proposed. The algorithm requires $O(n^{2})$ processors and $O(m + n \log n)$ units of time.
Metrics and Models for Cost and Quality of Component-Based Software
Authors: Sahra Sedigh-Ali, Arif Ghafoor, Raymond A. Paul
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Quality and risk concerns currently limit the application of commercial off-the-shelf (COTS) software components to non-critical applications. Software metrics can quantify factors contributing to the overall quality of a component-based system, and models for tradeoffs between cost and various aspects of quality can guide quality and risk management by identifying and eliminating sources of risk. This paper discusses metrics and models that can be used to alleviate quality concerns for COTS-based systems, enabling the use of COTS components in a broader range of applications.
A Knowledge Base for the Optimization of Parallel Query Execution Plans
Authors: Erich Schikuta, Peter Kirkovits
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper we present a knowledge base for the generation and optimization of query execution plans for parallel database systems. This knowledge base builds the basis of a novel extended blackboard architecture for the optimization of parallel query execution plans, which is based on a bottom-up building block approach. It allows to find (near) optimal execution plans out of a possibly huge search space in reasonable time.
New limit theorems for regular diffusion processes with finite speed measure
Authors: J. H Zanten
Venue:  (2000)

We derive limit theorems for diffusion processes that have a finite speed measure. First we prove a number of asymptotic properties of the density $\rho_t = d\mu_t /d\mu$ of the empirical measure $\mu_t$ with respect to the normalized speed measure $\mu$. These results are then used to derive finite dimensional and uniform central limit theorems for integrals of the form $\sqrt{t}\int (\rho_t-1)\,d\nu$, where $\nu$ is an arbitrary finite, signed measure on the state space of the diffusion. We also consider a number of interesting special cases, such as uniform central limit theorems for Lebesgue integrals and functional weak convergence of the empirical distribution function.
An Efficient Data Transmission Technique for VLSI Systems Based on Multiple-Valued Code-Division Multiple Access
Authors: Yasushi Yuminaka, Osamu Katoh, Yoshisato Sasaki, Takafumi Aoki, Tatsuo Higuchi
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper investigates a multiple-valued code-division multiple access (MV-CDMA) technique to achieve efficient data transmission and processing in VLSI systems. CDMA employs a pseudo-random orthogonal m-sequence carrier as a multiplexable information carrier. Orthogonal property of m-sequences enables us to multiplex several computational activities into a single circuit, and execute in parallel using multiplexed data transmission with reduced interconnection. In addition, randomness of m-sequences offers the high tolerance to noise interference.In the case of conventional CDMA, however, co-channel interference due to carrier phase offset error severely restricts the available number of multiplexing. In order to eliminate carrier phase offset error, we propose a new class of multiple-valued m-sequences. An application example of neural networks is discussed to demonstrate the feasibility of MV-CDMA in terms of reducing interconnections and eliminating co-channel interference.
Computation of Prime Implicates and Prime Implicants by a variant of the Davis and Putnam Procedure
Authors: Thierry Castell
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

The problem is the transformation of a conjonctive normal form (CNF) into a minimized (for the set inclusion operator) disjunctive normal form (DNF) and reciprocally. This operation is called the unionist product. For a CNF (resp. DNF), one pass of the unionist product provides the prime implicants (resp. prime implicates); two passes provide the prime implicates (resp. prime implicants). An algorithm built upon the classical Davis and Putnam procedure is presented for calculating, without the explicit minimization for the inclusion, this unionist product.
Unobtrusive Workstation Farming Without Inconveniencing Owners: Learning Backgammon with a Genetic Algorithm
Authors: Paul Darwen
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Most efforts at low-cost parallel computing assume a monopoly on the hardware being used. That all-or-nothing attitude ignores many machines dedicated to other activities, but which sit idle for 16 hours a day. However, naive attempts to utilize idle machines can interfere with their primary purpose. This paper describes the successful effort to unobtrusively farm idle machines, for an artificial intelligence system using a genetic algorithm to learn the game Backgammon. It maintains owners' full access to their machines, without causing any detectable interference.
A General Theory of Semi-Unification
Authors: Said Jahama, A. J. Kfoury
Venue:  (1993)

Abstract Various restrictions on the terms allowed for substitution give rise to different cases of semi-unification. Semi-unification on finite and regular terms has already been considered in the literature. We introduce a general case of semi-unification where substitutions are allowed on non-regular terms, and we prove the equivalence of this general case to a well-known undecidable data base dependency problem, thus establishing the undecidability of general semi-unification. We present a unified way of looking at the various problems of semi-unification. We give some properties that are common to all the cases of semi-unification. We also the principality property and the solution set for those problems. We prove that semi-unification on general terms has the principality property. Finally, we present a recursive inseparability result between semi-unification on regular terms and semi-unification on general terms.
MINDS-II Feedback Architecture: Detection and Correction of Speech Misrecognitions
Authors: Sheryl R. Young, Michael Matessa
Venue:  (1992)

In this paper we describe the architecture and operation of the MINDS-II system. The system analyzes parsed, recognized speech and tries to detect and correct regions containing misrecognitions. The system uses syntactic, semantic, pragmatic and discourse level analyses to both delimit misrecognized input and hypothesize actual spoken content. The heuristics for deriving content hypotheses primarily rely on constraint satisfaction techniques. Hypotheses are expanded into a recursive transition network grammar and are processed with a finite state recognizer. Finally, when multiple phrases are produced in the re-recognition process, each is folded into the entire utterance in order to find which produces the best overall utterance score. Results show this technique reduces speech recognition errors by 50 to 80 percent across multiple test sets.
Parallel Stochastic Finite Element Analysis on Distributed Memory Multiprocessors
Authors: S. Chinchalkar, D. L. Taylor
Venue:  (1991)

This paper describes methods for parallel stochastic finite element analysis using distributed memory multiprocessors. The conventional finite element method is deterministic and fails to account for uncertainties in loads, material properties, geometry and boundary conditions. Stochastic fem can be used to compute the variability in the structural response. It requires considerable more computational effort than the deterministic method, making it necessary to exploit parallelism in order to solve large, realistic structural problems. This paper describes parallel versions of the First Order Second Moment method as well as Monte Carlo simulation for analyzing structures with random material properties. Stochastic fem is composed of several subproblems such as solution of a banded system of equations, the real symmetric eigenvalue problem, sensitivity analysis and structural reanalysis. Parallelism can be exploited at all stages of the solution process. These methods were implemented on an Intel IPSC/2 hypercube. Results show that even for small problems, good speedup can be obtained.
Architectural Support for Parallel Debugging
Authors: A A Lastra, Frank C Starmer
Venue:  (1989)

This paper presents a hardware solution to some of the problems that have been plaguing parallel debugging. Due to the non-determinism exhibited by programs executing on MIMD parallel machines, cyclic debugging, as is practiced on serial machines, does not work properly. Software solutions have been implemented to mimic cyclic debugging, but they exhibit problems and limitations. Efforts that rely solely on software are necessarily affected by the {\em probe effect,} perturbations in the execution sequence caused by the debugging code. Architectural enhancements are proposed for MIMD shared memory machines. They include a scheme for the non-invasive logging of the traffic from the interconnection network to processors. This log allows repetition of the original execution sequence for bug detection, the mode of debugging to which programmers are accustomed. Key ideas presented are the use of extra processors for logging, and the use of local, process specific, clocks for time tagging the logged data as opposed to the use of a global clock. A scheme such as this allows traditional debugging on a parallel machine without the problems inherent in software-only solutions.
An Architecture-Independent Analysis of False Sharing
Authors: Vivek Khera, P R LaRowe,  Jr., S C Ellis
Venue:  (1993)

Efficiently supporting a shared memory paradigm in a large-scale multiprocessor generally involves some form of data caching. One of the drawbacks of caching shared data is the cost of keeping the multiple copies coherent. One source of unnecessary coherency overhead is caused by a problem known as {\em false sharing.} Unfortunately, the lack of a precise, universally accepted, definition of false sharing hinders research to detect and eliminate the problem. We attempt to detect when such a problem exists and to identify the specific root causes of the problem. To accomplish this, we propose an architecture-independent measure of the false sharing exhibited in a reference trace for cache lines of a specified size. We motivate the importance of a concrete measure by demonstrating that false sharing related coherence overhead comprises a significant portion of the coherence costs in real applications, especially when page-granularity coherence is required. Experiments are performed to show the usefulness of this formulation.
Linearity versus non-linearity in forecasting Nile river flows
Authors: Maha Tawfik
Venue: Advances in Engineering Software (2003)

Egypt is almost totally dependent on the Nile River for satisfying about 95% of its water requirements. Aswan High Dam (AHD), located at the most upstream point of the fiver controls Egypt's share of water. Once a release decision is made, there is no chance of retrieving or recovering this released water. Therefore, long- and short-term forecasts of Nile flows at Aswan have been recognized to be of great importance to allow better management and operation of the reservoir.Several autoregressive (AR) models of uni- or multi-site flows upstream of Aswan had been developed to forecast monthly reservoir inflows for some lead-time. Most of these models failed to forecast, with satisfactory accuracy, the peak flows of July, August, and September due to high variability of flows during these months. Some hydrologists contributed this inaccuracy to the linearity assumption embedded in AR models.Artificial neural networks (ANNs) are being tested as a forecast tool to consider the non-linearity. Several neural networks using NeuralystTM software have been investigated against updated AR models. The results indicated that the inclusion of non-linearity in the ANNs forecast might in some cases lead to improved forecast accuracy.
Engineering of component-based systems
Authors: A. W. Brown, K. C. Wallnan
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Many organizations are moving toward greater use of commercial off-the-shelf (COTS) components in the development of application systems. The development of component based systems introduces fundamental changes in the way systems are acquired, integrated, deployed and evolved. We present a reference model for the assembly of component based systems that can be used as the basis for defining a systematic approach to the development of such systems. This reference model is described, and used to explore a number of fundamental development issues.
A Delay-Optimal Quorum-Based Mutual Exclusion Scheme with Fault-Tolerance Capability
Authors: Guohong Cao, Mukesh Singhal, Yi Deng, Naphtali Rishe, Wei Sun
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay trade-off in mutual exclusion algorithms. Lamport's algorithm and Ricart-Agrawal algorithm both have a synchronization delay of {\em $T$}, but their message complexity is {\em $O(N)$}. Maekawa's algorithm reduces message complexity to {\em $O(\sqrt{N})$}; however, it increases the synchronization delay to {\em $2T$}. After Maekawa's algorithm, many quorum-based mutual exclusion algorithms have been proposed to reduce message complexity or increase the resiliency to site and communication link failures. Since these algorithms are Maekawa-type algorithms, they also suffer from long synchronization delay {\em $2T$}. In this paper, we propose a delay-optimal quorum-based mutual exclusion algorithm which reduces the synchronization delay to {\em $T$} and still has the low message complexity {\em $O(K)$} {\em $(K$} is the size of the quorum, which can be as low as {\em $\log N)$}. A correctness proof and detailed performance analysis are provided.
Toward a quality inspection method and management
Authors: A. J. Chruscicki, J. E. , . Jr. Gaffney
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The paper presents some definitions of quality and relates them to the efforts of the USAF Rome Laboratory Software Quality Technology Transfer Consortium (SQTTC) and the Rome Laboratory Software Quality Framework (RLSQF). The paper suggests that the RLSQF might be profitably modified to focus on the use of defect data obtained during the verification activities (inspections and tests) of the software development process.
eArchivarius: accessing collections of electronic mail
Authors: Anton Leuski, Douglas W. Oard, Rahul Bhagat
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We present eArchivarius an interactive system for accessing collections of electronic mail. The system combines search, clustering visualization, and time-based visualization of email messages and people who send or received the messages.
A Path Information Caching and Aggregation Approach to Traffic Source Identification
Authors: Fu-Hau Hsu, Tzi-cker Chiueh
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Probabilistic packet marking (PPM) is a techniquedesigned to identify packet traffic sources with lowstorage and processing overhead on network routers.In most previous PPM approaches, individual pathmessages carry only partial path information. Thesemethods are susceptible to "path falsification" attacks,which greatly reduce their effectiveness. This workproposes a path-falsification-attack free PPM algorithmcalled Path Information Caching and Aggregation(PICA) that records paths of packet streams in fix-lengthpath messages, thus eliminating the need ofpath reconstruction at the receiver end. Besides, byusing a router's forwarding table to decompose packetvolume, this semi-stateful method is more accurate intraffic volume report. It also supports both a packetrate-based path message generation algorithm and aredundant path message suppression mechanism tofurther eliminate path messages with the same destination.Finally, PICA protects PICA routers from beingattacked by faked path messages. We have performeda trace-driven simulation study on the proposed PICAalgorithm and compared its effectiveness with IETF'siTrace scheme by varying the sampling probability,the number of attack sources, and attack traffic rate.Compared to iTrace, the PICA algorithm reduces thetotal number of path messages required by a factorof more than 2, while reporting traffic volume moreaccurately.