ppxscal/embedding_network huggingface dataset:
Extending the concept of awareness to include static and dynamic person information
Authors: Catalina M. Danis
Venue: ACM SIGGROUP Bulletin (2000)

One of the goals of my work is to build Web spaces that promote collaborative activities among people who meet in online environments. In this endeavor, conventional concepts of awareness that stress presence and activity information are critical to informing the design of environments to support interactions among strangers. Knowing that people are around and what they are doing helps set the stage for social interaction. However, the task confronting strangers is to identify the "right" people to interact with. By this I mean, the ones who have the skills, knowledge, interests and motivation to provide value to the other party. Systems that are informed by current concepts of awareness do not help an individual address the selection question.In this position paper, I argue that the current concepts of awareness need to be extended to provide descriptive information about people to support the selection task. The descriptive information is of two types: dynamic and static. Static information is a priori collected characterizations of a person. Such descriptions might include a person's skills, interests, goals and any other data that would enable others to judge whether an interaction with a specific purpose might be of interest. Dynamic data is emergent. It is based on observation of a person's activities and is the by-product of such activity. Participants can use data from these two sources to select people with whom to interact and to guide their interactions.I am applying these notions to a system called ePlace with which I have been working for the past year. ePlace is a 2-D visualization environment that provides visitors to a Web site with awareness of other visitors to that site. It does this through the use of an abstract graphical representation of people and activities [for a detailed description see 8].
Advances in Disk Technology: Performance Issues
Authors: Spencer W. Ng
Venue: Computer (1998)

The past few years have seen rapid advancements in magnetic recording technology, bringing cheaper, smaller, and more capacious disk drives. Some of the advances improve disk performance, but not all. Sometimes an advance may be beneficial or harmful to performance, depending on how or where it is applied. How, for example, does disk density affect data transfer rate? How do multiple platters affect head seek time? And how does partitioning large-capacity drives affect performance for each partition? The answer to these questionsýand others like themýlargely depends on particular configurations and user workload. It is important for both the user and the disk drive designer to be aware that while some advances may bring benefits in other areas, they don't necessarily improve performance. This fact should be considered when weighing technology options. This article explains how to evaluate disk drive technology on performance.
Processor Implementations Using Queues
Authors: Michael K. Milligan, Harvey G. Cragon
Venue: IEEE Micro (1995)

This survey paper examines two processor-memory interface problems - long latency and low bandwidth, and the use of queues to resolve them. Queues are classified by data type and prefetch strategies. Queue characteristics and parameters are also discussed. The use of queues to support variable length instructions and reduce misalignment problems are presented. Several example architectures are given in historical perspective - from the IBM 7030 (Stretch) to the Motorola/Apple/IBM PowerPC 601. Each application is detailed, giving queue configurations and prefetch strategies along with the design decisions that lead to their final architectures.
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
Authors: K. Ramamritham, J. A. Stankovic, P. F. Shiah
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

Efficient scheduling algorithms based on heuristic functions are developed for scheduling a set of tasks on a multiprocessor system. The tasks are characterized by worst-case computation times, deadlines, and resources requirements. Starting with an empty partial schedule, each step of the search extends the current partial schedule by including one of the tasks yet to be scheduled. The heuristic functions used in the algorithm actively direct the search for a feasible schedule, i.e. they help choose the task that extends the current partial schedule. Two scheduling algorithms are evaluated by simulation. To extend the current partial schedule, one of the algorithms considers, at each step of the search, all the tasks that are yet to be scheduled as candidates. The second focuses its attention on a small subset of tasks with the shortest deadlines. The second algorithm is shown to be very effective when the maximum allowable scheduling overhead is fixed. This algorithm is hence appropriate for dynamic scheduling in real-time systems.
Radiometric CCD camera calibration and noise estimation
Authors: G. Healey, R. Kondepudy
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Changes in measured image irradiance have many physical causes and are the primary cue for several visual processes, such as edge detection and shape from shading. Using physical models for charged-coupled device (CCD) video cameras and material reflectance, we quantify the variation in digitized pixel values that is due to sensor noise and scene variation. This analysis forms the basis of algorithms for camera characterization and calibration and for scene description. Specifically, algorithms are developed for estimating the parameters of camera noise and for calibrating a camera to remove the effects of fixed pattern nonuniformity and spatial variation in dark current. While these techniques have many potential uses, we describe in particular how they can be used to estimate a measure of scene variation. This measure is independent of image irradiance and can be used to identify a surface from a single sensor band over a range of situations. Experimental results confirm that the models presented in this paper are useful for modeling the different sources of variation in real images obtained from video cameras.
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression
Authors: Peter L. Hammer, Alexander Kogan
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Horn knowledge bases are widely used in many applications. This paper is concerned with the optimal compression of propositional Horn production rule bases - one of the most important knowledge bases used in practice. The problem of knowledge compression is interpreted as a problem of Boolean function minimization. It was proved in [16] that the minimization of Horn functions, i.e., Boolean functions associated with Horn knowledge bases, is NP-complete.This paper deals with the minimization of quasi-acyclic Horn functions, the class of which properly includes the two practically significant classes of quadratic and of acyclic functions. A procedure is developed for recognizing in quadratic time the quasi-acyclicity of a function given by a Horn CNF, and a graph-based algorithm is proposed for the quadratic time minimization of quasi-acyclic Horn functions.
Efficient Instruction Sequencing with Inline Target Insertion
Authors: W. W. Hwu, P. P. Chang
Venue: IEEE Transactions on Computers (1992)

Inline target insertion, a specific compiler and pipeline implementation method for delayed branches with squashing, is defined. The method is shown to offer two important features not discovered in previous studies. First, branches inserted into branch slots are correctly executed. Second, the execution returns correctly from interrupts or exceptions with only one program counter. These two features result in better performance and less software/hardware complexity than conventional delayed branching mechanisms.
INVEST: An Expert System for Financial Investments
Authors: Stephan Heuer, Ulrich Koch, Colin Cryer
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

A description is given of INVEST, an expert system developed to help make financial decisions. In dialogues with bank officials, INVEST obtains information about a customer's wishes and attempts to make useful and well-founded investment proposals. INVEST is being written as an application of an expert system shell, DONALD, specially developed for this purpose. DONALD is a frame-based system using frame matching as its principal inference mechanism. The inference method and representation of objects as frames are examined in detail, and a brief description of DONALD is given.
An Application of Linear Programming Discriminant Analysis to Classifying and Predicting the Symptomatic Status of HIV/AIDS Patients
Authors: N. K. Kwak, Seong Ho Kim, Chang W. Lee, Tae Sung Choi
Venue: Journal of Medical Systems (2002)

This study presents an application of linear programming discriminant analysis (LPDA) to classify and to predict the symptomatic status of HIV/AIDS patients. We applied LPDA as well as several traditional discriminant analysis methods to the AIDS Cost and Services Utilization Survey data set in order to demonstrate the use of LPDA to classify the symptomatic status of HIV/AIDS patients. The potential benefit of LPDA in terms of the classification accuracy was also analyzed.
On Single-Fault Set Diagnosability in the PMC Model
Authors: J. Stephens, V. Raghavan
Venue: IEEE Transactions on Computers (1993)

A. Somani et al, (1987) introduced the single-fault set diagnosability measure and gave an O(n/sup 3.5/) algorithm for determining it in the PMC model. The authors present a new algorithm for the same problem with a time complexity of only O(n/sup 2.5/).
Control Flow Regeneration for Software Pipelined Loops with Conditions
Authors: Dragan Milicev, Zoran Jovanovic
Venue: International Journal of Parallel Programming (2002)

A new intermediate representation for software pipelined loops with conditions is proposed in the paper. The representation allows separation of operations from different paths and their conditional, as well as speculative scheduling, including speculative computation of conditions. An algorithm that transforms the representation into the executable code is presented. The algorithm uses the notion of finite automata to represent the execution of separate paths as threads of control that are canceled or approved by operations that actually compute the conditions. The approach may be used in conjunction with different scheduling techniques to reconstruct the control flow graph from the final schedule directly. It inherently solves the problems of overlapped predicate lifetimes and speculation. The approach provides also a novel formal model for loop execution.
Nash equilibria, variational inequalities, and dynamical systems
Authors: E. Cavazzuti, M. Pappalardo, M. Passacantando
Venue: Journal of Optimization Theory and Applications (2002)

In this paper, we introduce some relationships between Nash equilibria, variational equilibria, and dynamical equilibria for noncooperative games.
Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity
Authors: L. M. Kirousis, P. Spirakis, P. Tsigas
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We address the problem of reading several variables (components) X/sub 1/,...,X/sub c/,all in one atomic operation, by only one process, called the reader, while each of thesevariables are being written by a set of writers. All operations (i.e., both reads and writes)are assumed to be totally asynchronous and wait-free. For this problem, only algorithmsthat require at best quadratic time and space complexity can be derived from the existingliterature. (The time complexity of a construction is the number of suboperations of ahigh-level operation and its space complexity is the number of atomic shared variables itneeds) In this paper, we provide a deterministic protocol that has linear (in the number ofprocesses) space complexity, linear time complexity for a read operation, and constanttime complexity for a write. Our solution does not make use of time-stamps. Rather, it isthe memory location where a write writes that differentiates it from the other writes.Also, introducing randomness in the location where the reader gets the value that itreturns, we get a conceptually very simple probabilistic algorithm. This algorithm has anoverwhelmingly small, controllable probability of error. Its space complexity, and also the time complexity of a read operation, are sublinear. The time complexity of a write is constant. On the other hand, under the Archimedean time assumption, we get a protocol whose time and space complexity do not depend on the number of writers, but are linearin the number of components only. (The time complexity of a write operation is stillconstant).
Branch Effect Reduction Techniques
Authors: Augustus K. Uht, Vijay Sindagi, Sajee Somanathan
Venue: Computer (1997)

The insatiable demand of both old and new applications demand improved capabilities. Developers must exploit parallelism for all types of programs to realize gains. Multiprocessor, multithreaded, vector, and dataflow computers achieve speedups up to the 1,000's for programs with large amounts of data parallelism or independent control flow. General-purpose code, however, has many conditional branches, irregular control flow, and much less data parallelism. These code characteristics and their detrimental consequences, in the form of branch effects, have severely limited the parallelism that can be exploited. Branch effects result from the uncertainties in the way branches execute. This article surveys techniques to reduce branch effects and describes their relative merits, including examples from commercial machines. Branch effect reduction techniques can be implemented in hardware, software, or both to free up more parallelism and speed up the execution of general-purpose code. Research is bearing fruit: Speedups of 10 or more are being demonstrated in research simulations and may be realized in hardware within a few years.
Effects of substrate bias and temperature during Titanium sputter-deposition on the phase formation in TiSi2
Authors: N. Lundqvist, J. Åberg, S. Nygren, C.-Å. Björmander, S.-L. Zhang
Venue: Microelectronic Engineering (2002)

The formation of titanium disilicide (TiSi2) from Ti deposited using ionized metal plasma under different deposition conditions has been investigated. It is shown that deposition at elevated substrate temperature (450°C) enhances the formation of the low-resistivity C54 TiSi2, especially in patterned narrow lines. Grain-boundary footprint pictures obtained by atomic force microscopy indicate a larger grain-size distribution for the films deposited at higher substrate temperature. Deposition under substrate bias resulted in reduced contact resistivity. However, the use of substrate bias results in increased probability of bridging of silicide over the isolating spacers.
ScanBist: A Multifrequency Scan-Based BIST Method
Authors: Benoit Nadeau-Dostie, Dwayne Burek, Abu S. M. Hassan
Venue: IEEE Design Test (1994)

The authors present ScanBist, a low-overhead, scan-based built-in self-test method, along with its performance in several designs. A novel clock synchronization scheme allows at-speed testing of circuits. This design allows the testing of circuits operating at more than one frequency while retaining the combinational character of the circuit to be analyzed. We can therefore apply scan patterns that will exercise the circuit under test at the system speed, potentially providing a better coverage of delay faults when compared to other self-test methods. Modifications to an existing transition fault simulator account for cases where inputs originating from scan registers clocked at different frequencies drive a gate. We claim to detect transition faults only if the transition originates from the inputs driven by the highest frequency clock. ScanBist is useful at all levels of system packaging assuming that a standard TAP provides the control and boundary scan isolates the circuit from primary inputs and outputs during BIST mode.
Computer Simulations of Protein Dynamics and Thermodynamics
Authors: David Case
Venue: Computer (1993)

The computational challenges of producing realistic biomedical simulations are reviewed. Techniques for applying classical mechanics simulation methods to proteins and ways to solve Newton's equations are discussed. Two recent applications of these methods are examined. The first considers the rate at which molecular oxygen binds to myoglobin, an oxygen-storage protein found in muscle. The second application involves the thermodynamics of the binding of oxygen to hemoglobin, a protein that is the major component of red blood cells. The comparison of this biochemical event to one in which oxygen is bound to an unusual variant of hemoglobin illustrates many of the simulation methods commonly used in the pharmaceutical industry to aid in the drug discovery process.
Microvias: The Next Generation of Substrates and Packages
Authors: Happy Holden
Venue: IEEE Micro (1998)

The silicon revolution continues its rapid advances. New functionality in silicon, more I/Os per components and shrinking discreet components sizes are providing the opportunity for rapid product enhancements. Area array packages and now the new chip-size packages are creating a demand for higher and higher PCB density. The PCB has been the venerable cost-effective packaging solution of choice.
Comments on "Extensions to SQL for Historical Databases"
Authors: R. G. Johnson, N. A. Lorentzos, N. L. Sarda
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

The commenters point out that the author of the above-titled paper failed to acknowledge their contemporary publications of almost identical results and the subsequent, comprehensive refinement of this work. The author replies that he did not have access to their publications. He indicates some differences between their work and his.
On the injective chromatic number of graphs
Authors: Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau
Venue: Discrete Mathematics (2002)

We define the concepts of an injective colouring and the injective chromatic number of a graph and give some upper and lower bounds in general, plus some exact values. We explore in particular the injective chromatic number of the hypercube and put it in the context of previous work on similar concepts, especially the theory of error-correcting codes. Finally, we give necessary, and sufficient conditions for the injective chromatic number te be equal to the degree for a regular graph.
Design and Analysis of Cache Coherent Multistage Interconnection Networks
Authors: A. K. Nanda, L. N. Bhuyan
Venue: IEEE Transactions on Computers (1993)

A directory of state information is introduced into a multistage interconnection network (MIN) switch, and a multiple copy cache coherence protocol is developed. It is shown that the protocol is better than a single copy protocol on this MIN with directories (MIND) scheme. A network called the multistage bus network (MBN), which introduces a bus and multiple snoopers into the switches of a MIN, is presented. The snooping buses form multiple trees with the memories at the roots and the processors at the leaves. Each switch contains directories to hold state information on the shared blocks that is used to filter the coherence traffic from one level to another. The shared requests pass through the directories, whereas the private requests pass directly from the bus in one level to the bus in the next level. Analytical and simulation models for these multistage cache coherent architectures are developed. Both the MIND and the MBN schemes are studied with a simple multiple copy protocol. The results show that the MBN scheme performs better than the MIND or conventional scheme.
The iFlow Address Processor
Authors: Mike O'Connor, Christopher A. Gomez
Venue: IEEE Micro (2001)

The iAP takes advantage of fast, wide embedded dram to perform fast forwarding-table lookups and statistics collection for the next generation of fast, intelligent routers. Its lookup rate of 65.5 million lookups per second allows two lookups per packet at 10 gigabits per second into a 256k entry table.
Mailbox-Based Scheme for Designing Mobile Agent Communication Protocols
Authors: Jiannong Cao, Xinyu Feng, Jian Lu, Sajal K. Das
Venue: Computer (2002)

In various situations, mobile agents at different hosts must cooperate with one another by sharing information and making decisions collectively. To ensure effective interagent communication, communication protocols must track target agent locations and deliver messages reliably.Researchers have proposed a wide range of schemes for agent tracking and reliable message delivery. However, each scheme has its own assumptions, design goals, and methodology. As a result, no uniform or structured methods exist for characterizing current protocols, making it difficult to evaluate their relative effectiveness and performance.The authors propose a mailbox-based scheme for designing mobile agent communication protocols. This scheme assigns each agent a mailbox to buffer messages, but decouples the agent and mailbox to let them reside at different hosts and migrate separately.
Reliable Floating-Point Arithmetic Algorithms for Error-Coded Operands
Authors: Jien-Chung Lo
Venue: IEEE Transactions on Computers (1994)

Reliable floating-point arithmetic is vital for dependable computing systems. It is also important for future high-density VLSI realizations that are vulnerable to soft-errors. However, the direct checking of floating-point arithmetic is still an open problem. The author presents a set of reliable floating-point arithmetic algorithms for low-cost residue encoded and Berger encoded operands, respectively. Closed form equations are derived for floating-point addition, subtraction, multiplication, and division. Given the standard IEEE floating-point numbers, the proposed reliable floating-point multiplication algorithms for low-cost residue encoded operands are extremely low-cost: it requires less than 8% of hardware redundancy in all cases. For reliable floating-point addition and subtraction, the author finds the hardware redundancy ratios of applying low-cost residue code is about the same as that of applying Berger code: less than 40% of hardware redundancy for single precision numbers and about 16% for double precision numbers. For reliable floating-point division, Berger encoded operands yields hardware cost-effectiveness: about 45% for single precision numbers and about 36% for double precision numbers.
Trade spectra of complete partite graphs
Authors: Elizabeth J. Billington, D. G. Hoffman
Venue: Discrete Mathematics (2002)

The trade spectrum of a graph G is essentially the set of all integers t for which there is a graph H whose edges can be partitioned into t copies of G in two entirely different ways. In this paper we determine the trade spectrum of complete partite graphs, in all but a few cases.
Scalable Stability Detection Using Logical Hypercube
Authors: Roy Friedman, Shiri Manor, Katherine Guo
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

This paper proposes to use a logical hypercube structure for detecting message stability in distributed systems. In particular, a stability detection protocol that uses such a superimposed logical structure is presented, and its scalability is being compared with other known stability detection protocols. The main benefits of the logical hypercube approach are scalability, fault-tolerance, and refraining from overloading a single node or link in the system. These benefits become evident both by an analytical comparison and by simulations. Another important feature of the logical hypercube approach is that the performance of the protocol is in general not sensitive to the topology of the underlying physical network.