ppxscal/embedding_network huggingface dataset:
Instruction-Level Distributed Processing
Authors: James E. Smith
Venue: Computer (2001)

For nearly 20 years, microarchitecture research has emphasized instruction-level parallelism (ILP), which improves performance by increasing the number of instructions per cycle. In striving for such parallelism, researchers have exploited advances in chip technology to develop complex, hardware-intensive processors. This trend has resulted in high intellectual complexity in the increasingly intricate schemes for squeezing performance out of second- and third-order effects. To simplify these increasingly complex designs, developers can borrow distributed- systems methods and apply them at the processor level to solve load balance, resource allocation, and communication problems. The current focus on ILP will likely shift to instruction-level distributed processing, emphasizing inter-instruction communication with dynamic optimization and a tight interaction between hardware and low-level software. To help find runtime parallelism, orchestrate distributed hardware resources, and implement power conservation strategies, an additional layer of abstraction-- the virtual machine layer--will likely become an essential ingredient. Finally, new instruction sets may be necessary to better focus on instruction-level communication and dependence, rather than computation and independence as is commonly done today.
A Cooperative Algorithm for Stereo Matching and Occlusion Detection
Authors: C. Lawrence Zitnick, Takeo Kanade
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

This paper presents a stereo algorithm for obtaining disparity maps with occlusion explicitly detected. To produce smooth and detailed disparity maps, two assumptions that were originally proposed by Marr and Poggio are adopted: uniqueness and continuity. That is, the disparity maps have a unique value per pixel and are continuous almost everywhere. These assumptions are enforced within a three-dimensional array of match values in disparity space. Each match value corresponds to a pixel in an image and a disparity relative to another image. An iterative algorithm updates the match values by diffusing support among neighboring values and inhibiting others along similar lines of sight. By applying the uniqueness assumption, occluded regions can be explicitly identified. To demonstrate the effectiveness of the algorithm, we present the processing results from synthetic and real image pairs, including ones with ground-truth values for quantitative comparison with other methods.
Computation of Nonlinear Backscattering Using a High-Order Numerical Method
Authors: G. Fibich, B. Ilan, S. Tsynkov
Venue: Journal of Scientific Computing (2002)

The nonlinear Schr&ouml;dinger equation (NLS) is the standard model for propagation of intense laser beams in Kerr media. The NLS is derived from the nonlinear Helmholtz equation (NLH) by employing the paraxial approximation and neglecting the backscattered waves. In this study we use a fourth-order finite-difference method supplemented by special two-way artificial boundary conditions (ABCs) to solve the NLH as a true boundary value problem. Our numerical methodology allows for a direct comparison of the NLH and NLS models and, apparently for the first time, for an accurate quantitative assessment of the backscattered signal.
A Multistep Approach for Shape Similarity Search in Image Databases
Authors: Mihael Ankerst, Hans-Peter Kriegel, Thomas Seidl
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

Shape similarity search is a crucial task in image databases, particularly in the presence of errors induced by segmentation or scanning images. The resulting slight displacements or rotations have not been considered so far in the literature. We present a new similarity model that flexibly addresses this problem. By specifying neighborhood influence weights, the user may adapt the similarity distance functions to her or his requirements or preferences. Technically, the new similarity model is based on quadratic forms for which we present a multistep query processing architecture particularly for high dimensions as they occur in image databases. Our algorithm to reduce the dimensionality of quadratic form-based similarity queries results in a lower-bounding distance function that is proven to provide an optimal filter selectivity. Experiments on our test database of 10,000 images demonstrate the applicability and the performance of our approach even in high dimensions such as 1,024.
Behavioral Self-Organization in Lifelike Synthetic Agents
Authors: Jiming Liu, Hong Qin
Venue: Autonomous Agents and Multi-Agent Systems (2002)

Modern computer graphics technology has enjoyed rapid development in recent years, attracting researchers and practitioners to explore a wide spectrum of applications ranging from computer-aided graphical design to artificial life and virtual reality. This paper is concerned with the animation-based entertainment use of computer graphics, i.e., to create digitally synthetic agents that can self-animate themselves, adapt to their virtual environments, and learn new behaviors to attain some specific goals. Here we propose a synthetic agent computational architecture called inter-threaded motif-based behavioral self-organization architecture, in which one motif acquires a conditioned association from the presently sensed state of the environment to the requirement of a desired motion as well as a plausible behavioral pattern to enable such a motion, whereas another computes the optimal parameters for the identified behavior in fulfilling the motion requirement. This architecture will enable animated behaviors to be automatically programmed based on the concurrent self-organization of individual motifs as well as their crisscrossing interactions.
A High-Speed, Reconfigurable Fuzzy Logic Controller
Authors: Shuwei Guo, Liliane Peters
Venue: IEEE Micro (1995)

The modular architecture and the reconfigurable inference engine of the analog fuzzy controller increases its flexibility over existing implementations. The high inference speed and the small area make the controller suitable for embedded system applications.
Optimal Level Curves and Global Minimizers of Cost Functionals in Image Segmentation
Authors: Charles Kervrann, Alain Trubuil
Venue: Journal of Mathematical Imaging and Vision (2002)

We propose a variational framework for determining global minimizers of rough energy functionals used in image segmentation. Segmentation is achieved by minimizing an energy model, which is comprised of two parts: the first part is the interaction between the observed data and the model, the second is a regularity term. The optimal boundaries are the curves that globally minimize the energy functional. Our motivation comes from the observation that energy functionals are traditionally complex, for which it is usually difficult to precise global minimizers corresponding to &ldquo;best&rdquo; segmentations. Therefore, we focus on basic energy models, which global minimizers can be characterized. None of the proposed segmentation models captures all the important scene variables but may be useful to get an insight into objects, surfaces or parts of objects in the scene. In this paper, we prove that the set of curves that minimizes the cost functionals is a subset of level lines, i.e. the boundaries of level sets of the image. For the completeness of the paper, we present a fast algorithm for computing partitions with connected components. It leads to a sound initialization-free algorithm without any hidden parameter to be tuned. We illustrate the performance of our algorithm with several examples on both 2D biomedical and aerial images, and synthetic images.
Health information for gay men on the internet
Authors: Gerald Perry
Venue: Health Care on the Internet (2002)

The groundbreaking publication in April 2001 of the Healthy People 2010 Companion Document for Lesbian, Gay, Bisexual and Transgender Health supplement to the nation's Healthy People 2010 prevention agenda marked a crucial milestone for gay men, as well as other sexual minorities in the United States. Based on work done by the Gay and Lesbian Medical Association and scholars at Columbia University, this policy document outlined the most pressing health concerns for Lesbian, Gay, Bisexual and Transgender (LGBT) people. This article identifies those health concerns specific to gay men, and provides a review of highly select Web resources targeting this population.
Educating Experienced IT Professionals by Addressing Industry's Needs
Authors: Dale Callahan, Bob Pedigo
Venue: IEEE Software (2002)

Academia and industry disagree about what students should learn in school and what they should learn on the job. In IT, constantly changing technologies and the increasing emphasis on information as a strategic asset complicate the issue. Chief information officers and IT managers must have the hard technical skills to understand the intricacies of information systems, as well as the skill and knowledge to make strategic business decisions regarding these systems. To address this need, the University of Alabama at Birmingham developed a graduate program specialty in electrical and computer engineering. UAB consulted industry executives to help them develop a curriculum that addresses industry's needs without compromising academic fundamentals.
A Novel Channel-Adaptive Uplink Access Control Protocol for Nomadic Computing
Authors: Yu-Kwong Kwok, Vincent K. N. Lau
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

We consider the uplink access control problem in a mobile nomadic computing system, which is based on a cellular phone network in that a user can use the mobile device to transmit voice or file data. This resource management problem is important because an efficient solution to uplink access control is critical for supporting a large user population with a reasonable level of quality of service (QoS). While there are a number of recently proposed protocols for uplink access control, these protocols possess a common drawback in that they do not adapt well to the burst error properties, which are inevitable in using wireless communication channels. In this paper, we propose a novel TDMA-based uplink access protocol, which employs a channel state dependent allocation strategy. Our protocol is motivated by two observations: 1) when channel state is bad, the throughput is low due to the large amount of FEC (forward error correction) or excessive ARQ (automatic repeated request) that is needed and 2) because of item 1, much of the mobile device's energy is wasted. The proposed protocol works closely with the underlying physical layer in that, through observing the channel state information (CSI) of each mobile device, the MAC protocol first segregates a set of users with good CSI from requests gathered in the request contention phase of an uplink frame. The protocol then judiciously allocates channel bandwidth to contending users based on their channel conditions. Simulation results indicate that the proposed protocol considerably outperforms five state-of-the-art protocols in terms of packet loss, delay, and throughput.
Implementation of Rule-Based Information Systems for Integrated Manufacturing
Authors: G. Harhalakis, C. P. Lin, L. Mark, P. R. Muro-Medrano
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Focuses on the development of a methodology within a software environment for automating the rule-based implementation of specifications of integrated manufacturing information systems. The specifications are initially formulated in a natural language and subsequently represented in terms of a graphical representation by the system designer. A new graphical representation tool is based on updated Petri nets (UPN) that we have developed as a specialized version of colored Petri nets. The rule-based implementation approach utilizes the similarity of features between UPN and the general rule specification language used for the implementation. The automation of the translation of UPN to the rule specification language is expected to considerably reduce the life-cycle for design and implementation of the system. The application presented deals with the control and management of information flow between the computer-aided design, process planning, manufacturing resource planning and shop floor control databases. This provides an integrated information framework for computer integrated manufacturing systems.
Understanding and Managing OOT Adoption
Authors: Anol Bhattacherjee, James Gerlach
Venue: IEEE Software (1998)

While OOT offers a promising new approach to system development, adopting it at a corporate level requires changes in work culture, roles, and processes. Organizational learning theory can illuminate some of the obstacles such changes en-gender and suggest ways for managers to overcome them.
An Integrated Approach to Testing Embedded Cores and Interconnects Using Test Access Mechanism (TAM) Switch
Authors: Subhayu Basu, Indranil Sengupta, Dipanwita Roy Chowdhury, Sudipta Bhawmik
Venue: Journal of Electronic Testing: Theory and Applications (2002)

The present paper introduces a new strategy for testing embedded cores using Test Access Mechanism (TAM) switches. An algorithm has been proposed for testing the cores using the TAM switch architecture. In addition, a scheme for testing the interconnections between cores in parallel is also presented. Experiments have been carried out on several synthetic SOC benchmarks. Results show significant optimization of area overhead as well as test time.
A New Approach to Online Generation of Association Rules
Authors: Charu C. Aggarwal, Philip S. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

We discuss the problem of online mining of association rules in a large database of sales transactions. The online mining is performed by preprocessing the data effectively in order to make it suitable for repeated online queries. We store the preprocessed data in such a way that online processing may be done by applying a graph theoretic search algorithm whose complexity is proportional to the size of the output. The result is an online algorithm which is independent of the size of the transactional data and the size of the preprocessed data. The algorithm is almost instantaneous in the size of the output. The algorithm also supports techniques for quickly discovering association rules from large itemsets. The algorithm is capable of finding rules with specific items in the antecedent or consequent. These association rules are presented in a compact form, eliminating redundancy. The use of nonredundant association rules helps significantly in the reduction of irrelevant noise in the data mining process.
System and architecture-level power reduction of microprocessor-based communication and multi-media applications
Authors: Lode Nachtergaele, Vivek Tiwari, Nikil Dutt
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

Current microprocessor architectures become more and more dominated by the data access bottlenecks in the cache, system bus and main memory subsystems. These also have a major influence on the system (board-level) power consumption. In practice this means lower energy consumption for a given throughput requirement.In the booming domain of (largely embedded) cost-sensitive communication and multi-media applications, more and more implementations make use of microprocessor based platforms for flexibility reasons.However, in order to provide sufficiently high data throughput at reasonable power consumption for these demanding applications, novel solutions for the memory access and data transfer will have to be introduced. These will have to be situated both at the processor architecture and the algorithm/compiler level.The question we want to address in this paper and tutorial is what would these solutions look like. We will show that they will be based on processor architecture optimizations, on novel approaches in the application of compiler technology, and on exploiting the interface between the system hardware and software.
Trends in Silicon-On-Silicon Multichip Modules
Authors: Robert C. Frye, King L. Tai, Maureen Y. Lau, Thaddeus J. Gabara
Venue: IEEE Design Test (1993)

Three example applications of silicon-on-silicon multichip modules are discussed: a module used in a parallel processor, a low-cost silicon module for a high-volume consumer product application, and a high-performance digital telecommunications module. These applications illustrate the changes occurring in this technology and the forces that are driving these changes.
Coding distributive lattices with edge firing games
Authors: Matthieu Latapy, Clémence Magnien
Venue: Information Processing Letters (2002)

In this note, we show that any distributive lattice is isomorphic to the set of reachable configurations of an Edge Firing Game. Together with the result of James Propp, saying that the set of reachable configurations of any Edge Firing Game is always a distributive lattice, this shows that the two concepts are equivalent.
Software Process in the Classroom: The Capstone Project Experience
Authors: David Umphress, T. Dean Hendrix, James H. Cross
Venue: IEEE Software (2002)

A process-oriented perspective on large student projects guides students in integrating end-to-end lifecycle skills and provides consistency of experience among projects. After conducting 49 capstone projects, the authors learned that they must cultivate a process culture; that agile processes provide a bridge from ad hoc course programming assignments to organized project work; process requires a suitable infrastructure of tools and process expertise and they should be written to focus learning.
Hot-Potato Algorithms for Permutation Routing
Authors: Ilan Newman, Assaf Schuster
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

We develop a methodology for the design of hot-potato algorithms for routing permutations. The basic idea is to convert existing store-and-forward routing algorithms to hot-potato algorithms. Using it, we obtain the following complexity bounds for permutation routing:¿n×n Mesh: 7n+o(n) steps.¿ 2n hypercube: O(n2) steps.¿n×n Torus: 4n+o(n) steps.The algorithm for the two-dimensional grid is the first to be both deterministic and asymptotically optimal. The algorithm for the 2n-nodes Boolean cube is the first deterministic algorithm that achieves a complexity of o(2n) steps.
Multidimensional Fechnerian scaling: pairwise comparisons, regular minimality, and nonconstant self-similarity
Authors: Ehtibar N. Dzhafarov
Venue: Journal of Mathematical Psychology (2002)

Stimuli presented pairwise for same-different judgments belong to two distinct observation areas (different time intervals and/or locations). To reflect this fact the underlying assumptions of multidimensional Fechnerian scaling (MDFS) have to be modified, the most important modification being the inclusion of the requirement that the discrimination probability functions possess regular minima. This means that the probability with which a fixed stimulus in one observation area (a reference) is discriminated from stimuli belonging to another observation area reaches its minimum when the two stimuli are identical (following, if necessary, an appropriate transformation of the stimulus measurements in one of the two observation areas). The remaining modifications of the underlying assumptions are rather straightforward, their main outcome being that each of the two observation areas has its own Fechnerian metric induced by a metric function obtained in accordance with the regular variation version of MDFS. It turns out that the regular minimality requirement, when combined with the empirical fact of nonconstant self-similarity (which means that the minimum level of the discrimination probability function for a fixed reference stimulus is generally different for different reference stimuli), imposes rigid constraints on the interdependence between discrimination probabilities and metric functions within each of the observation areas and on the interdependence between Fechnerian metrics and metric functions belonging to different observation areas. In particular, it turns out that the psychometric order of the stimulus space cannot exceed 1.
Routing in Modular Fault-Tolerant Multiprocessor Systems
Authors: M. Sultan Alam, Rami G. Melhem
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

In this paper, we consider a class of modular multiprocessor architectures in which spares are added to each module to cover for faulty nodes within that module, thus forming a fault-tolerant basic block (FTBB). In contrast to reconfiguration techniques that preserve the physical adjacency between active nodes in the system, our goal is to preserve the logical adjacency between active nodes by means of a routing algorithm which delivers messages successfully to their destinations. We introduce two-phase routing strategies that route messages first to their destination FTBB, and then to the destination nodes within the destination FTBB. Such a strategy may be applied to a variety of architectures including binary hypercubes and three-dimensional tori. In the presence of f faults in hypercubes and tori, we show that the worst case length of the message route is min {¿+f, (K+ 1)¿}+c where ¿ is the shortest path in the absence of faults, K is the number of spare nodes in an FTBB, and c is a small constant. The average routing overhead is much lower than the worst case overhead.
VOLATILECALC: a silicate melt-H2O-CO2 solution model written in Visual Basic for excel
Authors: Sally Newman, Jacob B. Lowenstern
Venue: Computers Geosciences (2002)

We present solution models for the rhyolite-H2O-CO2 and basalt-H2O-CO2 systems at magmatic temperatures and pressures below ∼ 5000 bar. The models are coded as macros written in Visual Basic for Applications, for use within Microsoft® Excel (Office'98 and 2000). The series of macros, entitled VOLATILECALC, can calculate the following: (1) Saturation pressures for silicate melt of known dissolved H2O and CO2 concentrations and the corresponding equilibrium vapor composition; (2) open- and closed-system degassing paths (melt and vapor composition) for depressurizing rhyolitic and basaltic melts; (3) isobaric solubility curves for rhyolitic and basaltic melts; (4) isoplethic solubility curves (constant vapor composition) for rhyolitic and basaltic melts; (5) polybaric solubility curves for the two end members and (6) end member fugacities of H2O and CO2 vapors at magmatic temperatures. The basalt-H2O-CO 2 macros in VOLATILECALC are capable of calculating melt-vapor solubility over a range of silicate-melt compositions by using the relationships provided by Dixon (American Mineralogist 82 (1997) 368). The output agrees well with the published solution models and experimental data for silicate melt-vapor systems for pressures below 5000 bar.
Official NetScape Suitespot 3 Book with Cdrom, 10th edition
Authors: Richard Cravens, Larry Budnik
Venue:  (1997)

:Contains an Internet primer and sections on security and site management. Includes detailed sections on LiveWire and database connectivity plus basic information on producing Crossware applications. Enables readers to quickly get up and running usin The only source that provides ways to use each of the nine servers (Enterprise, Catalog, Directory, Proxy, Messaging, Collabra, Calendar, Media and Certificate plus LiveWire Pro and Visual JavaScript) both independently and together. Shows how to construct a network, publish live content on the Web, control access to information and applications, and protect Web-based communications. Official Netscape SuiteSpot 3 Book shows how to use Netscape SuiteSpot 3.0 as a cost-effective solution for creating, deploying, and managing a full-service intranet, extranet, and Internet site. Includes the sample code & JavaScript examples from the book. Contains graphics viewing, conversion, and processing tools; image-map creator. Provides multimedia file management utility and site tracking software. Includes CGI library.