ppxscal/embedding_network huggingface dataset:
Differential A*
Authors: Karen I. Trovato, Leo Dorst
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

A* graph search effectively computes the optimal solution path from start nodes to goal nodes in a graph, using a heuristic function. In some applications, the graph may change slightly in the course of its use and the solution path then needs to be updated. Very often, the new solution will differ only slightly from the old. Rather than perform the full A* on the new graph, we compute the necessary OPEN nodes from which the revised solution can be obtained by A*. In this "Differential A*" algorithm, the graph topology, transition costs, or start/goals may change simultaneously. We develop the algorithm and discuss when it gives an improvement over simply reapplying A*. We briefly discuss an application to robot path planning in configuration space, where such graph changes naturally arise.
Dynamically Generated Follow-up Questions
Authors: Johanna D. Moore, Vibhu O. Mittal
Venue: Computer (1996)

Automatic text generators are at the heart of systems that provide users with information. The trick is getting the system to answer follow-up questions as naturally as possible. But even in moderately complex domains, the task of handcrafting explanations using "canned" text or templates is so time-consuming and error-prone that it becomes infeasible. Furthermore, these techniques cannot be extended to let a system consider the user's prior knowledge, past problem-solving experiences, or the preceding dialogue. To overcome these limitations, researchers have focused on automatically synthesizing text directly from underlying knowledge bases. Automatic text-generation systems pose new opportunities--and new problems. Studies of human-human interactions show that people often follow up requests for information with more questions. This observation also underscores the need for computer-based information systems to let users ask follow-up questions. This capability is especially crucial in patient education, for example, where misunderstandings could have serious consequences. The ability to handle follow-up requests in context is essential, even crucial, to applications like the patient education system described in this article. The direction we've taken presents one alternative to full-fledged natural language-understanding and makes it possible to design systems by adopting a pragmatic (and possibly more useful) approach of generating choices for the user. Our initial system evaluations reveal that users are comfortable with the interface as a way to ask follow-up questions.
Aggressive Transmissions of Short Messages Over Redundant Paths
Authors: B. Kao, H. Garcia-Molina, D. Barbará
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Fault-tolerant computer systems have redundant paths connecting their components.Given these paths, it is possible to use aggressive techniques to reduce the averagevalue and variability of the response time for short, critical messages. One technique is tosend a copy of a packet over an alternate path before it is known whether the first copyfailed or was delayed. A second technique is to split a single stream of packets overmultiple paths. The authors analyze both approaches and show that they can providesignificant improvements over conventional, conservative mechanisms.
DataPlay's Mobile Information Distribution and Storage Technology
Authors: David H. Davies
Venue: IEEE Micro (2002)

A portable system using small, high-density optical discs with prerecorded content and space for consumer-written data gives content owners noninvasive access control.
The Organization and Performance of a TREAT-Based Production System Compiler
Authors: D. P. Miranker, B. J. Lofaso
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

An ensemble of techniques that compile OPS5 production system programs to executable machine code is described and an increase in the execution speed of production system programs by two orders of magnitude over the commonly used list processing (LISP)-based OPS5 system is demonstrated. The computer is based on the TREAT incremental match algorithm. A version of the TREAT algorithm, formulated in relational algebra, is presented. The compiler employs optimization techniques derived from relational database system. The combination of the TREAT algorithm and the compiling techniques reduces the proportion of time spent in the match phase below the 'greater than 90%' figure often cited by developers of other production system environments.
Concurrent Programming Technologies and Techniques
Authors: N. V. Bocharov
Venue: Programming and Computing Software (2003)

Intensive use of computer experiments in modern science introduces qualitative changes into experimental resources. This implies the change in techniques used to solve relevant problems. An analysis of technological chains (from the problem statement to its solution) shows that often a particular problem can be solved in a variety of ways with the use of modern multiprocessor computers, which are also called supercomputers. The multiplicity of approaches to solving a problem requires that researches possess certain skills in using supercomputers. It is difficult for novice users of multiprocessor computers to find bearings when developing software for solving applied problems. The practice shows that main difficulties reveal themselves when it is required to develop portable and efficient parallel software. This is because tools that facilitate the development and provide full access to debugging information have yet to be elaborated. Actually, the problem is in the absence of standards for development and debugging tools for supercomputers, which is explained by the fact that computer science is yet young. For the same reason, no logically complete basic texts for concurrent programming courses for novices are available. On the basis of Russian-language literature, an attempt is made at setting up &ldquo;beacons&rdquo; that mark certain common and promising technologies in using supercomputers. The emphasis is made on problems encountered by programmers when solving applied problems with the use of supercomputers. The development of multiprocessor computers is closely related to concurrent programming technologies, both universal and oriented to specific supercomputer architectures. By programming technology, i.e., by memory management, we mean the use of tools designed for managing a particular computer system. It should be noted that when developing software for supercomputers (both management software and programs for solving applied problems), one must pay special attention to programming technique, i.e., to designing the logical architecture of a program. This implies the development and extending parallelizing algorithms, which enhances the efficiency of execution on multiprocessor computers. This review was compiled on the basis of publications in Russian journals and in the Russian Internet zone.
A Physical Model-Based Analysis of Heterogeneous Environments Using Sonar-ENDURA Method
Authors: Ö. Bozma, R. Kuc
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A physical model-based analysis of unstructured environments is presented using sonar as a sensing device. Previous methods have relied only on time-of-flight (TOF) methods and have examined only homogenous environments consisting of either smooth or rough surfaces. In this paper, a forward model for the reflection from a class of surfaces with varying degrees of roughness is presented based on the Kirchhoff approximation method. This model integrates different types of environments into a single analytical framework. The echo intensity is parametrized in terms of its energy content and duration, which are functions of the surface roughness, distance, and orientation. The echo-energy and echo-duration maps are introduced to display these parameters. A systematic and robust procedure (ENDURA method) is presented to analyze the reflections and to differentiate and localize the reflecting surfaces. The methodology is verified with experimental results obtained in our laboratory. The results indicate a significant improvement over conventional TOF systems.
Like water for data flow
Authors: Dineh M. Davis
Venue: interactions (2003)

This issue's Whiteboard takes a bit of a different tack from past columns. Rather than exhorting us to follow process A or stop making mistake B, Dineh Davis immerses herself in the almost mystical idea of water as a metaphor for information. She envisions water as helping us understand and appreciate the diversity in humanity's relationships with information and its technology, enabling us to increase user participation in its development. Now, you may see some problems with this idea. But I'd say that they're, er, soluble.<br>---Elizabeth Buie
Innovative Structures for CMOS Combinational Gates Synthesis
Authors: G. Buonanno, D. Sciuto, R. Stefanelli
Venue: IEEE Transactions on Computers (1994)

Design of multiple outputs CMOS combinational gates is studied. Two techniques for minimization of multiple output functions at the switching level are introduced. These techniques are based on innovative transistor interconnection structures named Delta and Lambda networks. The two techniques can be combined together to obtain further area reductions. Different synthesis algorithms are discussed, from exhaustive enumeration to branch and bound to heuristic techniques allowing to speed up the synthesis process. Simulation results for synthesis are introduced to compare the different algorithms. Design examples are also provided. Electrical simulations show that the dynamic behavior of such structures is comparable to the traditional static or domino implementations (obviously the new and traditional structures have the same static behavior).
NAS experiences with a prototype cluster of workstations
Authors: K. Castagnera, D. Cheng, R. Fatoohi, E. Hook, B. Kramer, C. Manning, J. Musch, C. Niggley, W. Saphir, D. Sheppard, M. Smith, I. Stockdale, S. Welch, R. Williams, D. Yip
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

This paper discusses the year-long activity at NAS to implement a large, loose cluster of workstations from the existing Silicon Graphics, Inc. (SGI) pool of systems. Issues related to establishing a loosely coupled cluster of workstations are presented. Included are steps needed to resolve system management issues intended to provided reasonable cycle recovery from these systems without disrupting the primary system users. Performance evaluation tests were run based on the NAS Parallel Benchmarks (NPB) and other codes, including OVERFLOW-PVM, a full-fledged Computational Fluid Dynamics (CFD) application. This paper summarizes the activities related to the prototype cluster and identifies areas that need improvement, development, and research in order to make workstation clusters a viable computing environment for solving aeroscience problems.
Evaluating software engineering standards
Authors: Shari Lawrence Pfleeger, Norman Fenton, Stella Page
Venue: Computer (1994)

The authors report on the results of the Smartie project (Standards and Methods Assessment Using Rigorous Techniques in Industrial Environments), a collaborative effort to propose a widely applicable procedure for the objective assessment of standards used in software development. We hope that, for a given environment and application area, Smartie will enable the identification of standards whose use is most likely to lead to improvements in some aspect of software development processes and products. In this article, we describe how we verified the practicality of the Smartie framework by testing it with corporate partners.
Prediction Markets as Decision Support Systems
Authors: Joyce E. Berg, Thomas A. Rietz
Venue: Information Systems Frontiers (2003)

Valuations from &ldquo;prediction markets&rdquo; reveal expectations about the likelihood of events. &ldquo;Conditional prediction markets&rdquo; reveal expectations conditional on other events occurring. For example, in 1996, the Iowa Electronic Markets (IEM) ran markets to predict the chances that different candidates would become the Republican Presidential nominee. Other concurrent IEM markets predicted the vote shares that each party would receive conditional on the Republican nominee chosen. Here, using these markets as examples, we show how such markets could be used for decision support. In this example, Republicans could have inferred that Dole was a weak candidate and that his nomination would result in a Clinton victory. This is only one example of the widespread potential for using specific decision support markets.
A Distributed Heterogeneous Supercomputing Management System
Authors: Arif Ghafoor, Jaehyung Yang
Venue: Computer (1993)

A general management framework for distributed heterogenous supercomputing systems (DHSSs) that is based on an application-characterization technique is presented. The technique uses code profiling and analytical benchmarking of supercomputers. An optimal scheduling of tasks in these systems is an NP-complete problem. The use of network caching to reduce the complexity associated with the scheduling decisions is discussed. An experimental prototype of a DHSS management system is described.
Binding number conditions for matching extension
Authors: Andrew M. Robertshaw, Douglas R. Woodall
Venue: Discrete Mathematics (2002)

A graph is k-extendable if it has a matching of k edges and every such matching can be extended to a 1-factor. We find a sharp lower bound on the binding number, in terms of n and k, which suffices to ensure that a graph of order n is k-extendable.
Real-time image based lighting in software using HDR panoramas
Authors: Jonas Unger, Magnus Wrenninge, Mark Ollila
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

We present a system allowing real-time image based lighting based on HDR panoramic images [Debevec 1998]. The system performs time-consuming diffuse light calculations in a pre-processing step, which is key to attaining interactivity. The real-time subsystem processes an image based lighting model in software, which would be simple to implement in hardware. Rendering is handled by OpenGL, but could be substituted for another graphics API, should there be such a need. Applications for the technique presented are discussed, and includes methods for realistic outdoor lighting. The system architecture is outlined, describing the algorithms used. Lastly, the ideas for future work that arose during the project are discussed
A Layout-Conscious Iteration Space Transformation Technique
Authors: M. Kandemir, J. Ramanujam, A. Choudhary, P. Banerjee
Venue: IEEE Transactions on Computers (2001)

Exploiting locality of references has become extremely important in realizing the potential performance of modern machines with deep memory hierarchies. The data access patterns of programs and the memory layouts of the accessed data sets play a critical role in determining the performance of applications running on these machines. This paper presents a cache locality optimization technique that can optimize a loop nest even if the arrays referenced have different layouts in memory. Such a capability is required for a global locality optimization framework that applies both loop and data transformations to a sequence of loop nests for optimizing locality. Our method uses a single linear algebra framework to represent both data layouts and loop transformations. It computes a nonsingular loop transformation matrix such that, in a given loop nest, data locality is exploited in the innermost loops, where it is most useful. The inverse of a nonsingular transformation matrix is built column-by-column, starting from the rightmost column. In addition, our approach can work in those cases where the data layouts of a subset of the referenced arrays is unknown; this is a key step in optimizing a sequence of loop nests and whole programs for locality. Experimental results on an SGI/Cray Origin 2000 nonuniform memory access multiprocessor machine show that our technique reduces execution times by as much as 70 percent.
Packet-Switched Optical Networks
Authors: Ben Y. Yu, Paul Toliver, Robert J. Runser, Kung-Li Deng, Deyu Zhou, Ivan Glesk, Paul R. Prucnal
Venue: IEEE Micro (1998)

In this article, we present a platform design for packet-switched OTDM networks operating at ultrafast bit-rates for modern multiprocessor interconnects. The design is implemented in a prototype 8-node transparent shuffle network. The flow control in this network is based on a self-routing scheme developed to reduce the address processing delay at each node and make the network scalable. Deflection routing is used as the contention resolution principle. Several issues on designing optical networks, such as the node configurations and finding the optimal routing algorithm for maximum throughput, are discussed. Subsystem experiments demonstrate the functionality of the components including a 100 Gbps optical packet compressor and a parallel array of Terahertz Optical Asymmetric Demultiplexers (TOADs) used for header address recognition. The overall capability of the ultrafast packet-switched testbed is evaluated.
A Spectral Element Projection Scheme for Incompressible Flow with Application to the Unsteady Axisymmetric Stokes Problem
Authors: Mejdi Azaiez
Venue: Journal of Scientific Computing (2002)

This paper presents a modified Goda scheme in the simulation of unsteady incompressible Navier&ndash;Stokes flows in cylindrical geometries. The study is restricted to the case of axisymmetric flows. For the justification of the robustness of our scheme some computational test cases are investigated. It turns out that by adopting the new approach, a significant accuracy improvement on both pressure and velocity can be obtained relative to the classical Goda scheme.
Seven Steps to Optimizing Data Warehouse Performance
Authors: Rob Armstrong
Venue: Computer (2001)

Most operational systems store data in a normalized model in which certain rules eliminate redundancy and simplify data relationships. While beneficial for the online transaction processing workload, this model can inhibit those same OLTP databases from running analytical queries effectively. Because the analytical systems did not need to support the OLTP workload, many developers began preplanning for the answer sets. Preplanning, however, created problems in four areas: creating summary tables of preaggregated data, placing indexes in the system to eliminatescanning large data volumes, putting data into one table instead of having tables that join together, and storing the data in sorted order. All these activities require prior knowledge of the analysis and reports being requested. Unfortunately, most data warehouse implementations ignore the longer-term goals of analysis and flexibility in the rush to provide initial value. Taking time to consider the project's real purpose, then building a correct foundation for it, can assure a better future for the data warehouse. The implementers, not the user community, should decide whether to use a summary table or functional model. However, the users, not the IT group, must determine which capability needs must be delivered to drive business opportunity.
Using the Memory Channel Network
Authors: Richard Gillett, Richard Kaufmann
Venue: IEEE Micro (1997)

Historically, cluster systems have been connected with standard networking technology. In this presentation, we discuss the experience of using a highly optimized network, Memory ChannelTM for PCI, to enhance both the parallel performance and high-availability aspects of a cluster. Performance results for various approaches to fast messaging will be presented. These results will be compared to the same systems using conventional network technology. Finally, we briefly discuss our short-term futures for Memory Channel.
Fibonacci Cubes-A New Interconnection Technology
Authors: W. J. Hsu
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A novel interconnection topology called the Fibonacci cube is shown to possessattractive recurrent structures in spite of its asymmetric and relatively sparseinterconnections. Since it can be embedded as a subgraph in the Boolean cube(hypercube) and it is also a supergraph of other structures, the Fibonacci cube may findapplications in fault-tolerant computing. For a graph with N nodes, the diameter, theedge connectivity, and the node connectivity of the Fibonacci cube are in the logarithmicorder of N. It is also shown that common system communication primitives can beimplemented efficiently.
Formalization and Analysis of Class Loading in Java
Authors: Akihiko Tozawa, Masami Hagiya
Venue: Higher-Order and Symbolic Computation (2002)

Since Java security relies on the type-safety of the JVM, many formal approaches have been taken in order to prove the soundness of the JVM. This paper presents a new formalization of the JVM and proves its soundness. It is the first model to employ dynamic linking and bytecode verification to analyze the loading constraint scheme of Java2. The key concept required for proving the soundness of the new model is augmented value typing, which is defined from ordinary value typing combined with the loading constraint scheme. In proving the soundness of the model, it is shown that there are some problems inside the current reference implementation of the JVM with respect to our model. We also analyze the findClass scheme, newly introduced in Java2. The same analysis also shows why applets cannot exploit the type-spoofing vulnerability reported by Saraswat, which led to the introduction of the loading constraint scheme.
Generation of all Reed-Muller Expansions of a Switching Function
Authors: B. Vinnakota, V. V. B. Rao
Venue: IEEE Transactions on Computers (1994)

A simple method to determine the Reed-Muller canonical expansion is described. This method is based on array processing techniques similar to those used for the FFT. A specific advantage of the technique is that it can be used with minor modification to determine the expansion when some or all of the input variables are negated.
A Channel Sharing Scheme for Cellular Mobile Communications
Authors: Xing Zhang, Weihua Zhuang
Venue: Wireless Personal Communications: An International Journal (1999)

This paper presents a channel sharing scheme, Neighbor Cell Channel Sharing (NCCS) , based on region partitioning of cell coverage for wireless cellular networks. Each cell is divided into an inner-cell region and an outer-cell region. Cochannel interference is suppressed by limiting the usage of sharing channels in the inner-cell region. The channel sharing scheme achieves a traffic-adaptive channel assignment and does not require any channel locking. Performance analysis shows that using the NCCS scheme leads to a lower call blocking probability and a better channel utilization as compared with other previously proposed channel assignment schemes.
Further Results on the Performance Evaluation of the Split Channel Reservation Multiple Access Protocol ATP-2 for Local Area Networks
Authors: S. A. Koubias, G. D. Papadopoulos
Venue: IEEE Transactions on Computers (1988)

The adaptive reservation protocol, referred to as ATP-2, uses two frequency separated subchannels, the request and information subchannels, for the request and information packets. The nature of the accessing algorithms for these two subchannels characterizes the overall ATP-2 protocol quality. Extended ATP-2 performance results are presented and a comparison is made between the ATP-2 and some other well-known multiple-access protocols.