ppxscal/embedding_network huggingface dataset:
Optimal Randomized Parallel Algorithms for Computational Geometry I
Authors: H J Reif, Sandeep Sen
Venue:  (1988)

We present parallel algorithms for some fundamental problems in computational geometry which have running time of $O(logn)$ using $n$ processors, with very high probability (approaching 1 as $n~ \rightarrow~ \infty$). These include planar point location, triangulation and trapezoidal decomposition. We also present optimal algorithms for 3-D maxima and two-set dominance counting by an application of integer sorting. Most of these algorithms run on CREW PRAM model and have optimal processor-time product which improve on the previously best known algorithms of Atallah and Goodrich [3] for these problems. The crux of these algorithms is a useful data structure which emulates the plane sweeping paradigm used for sequential algorithms. We extend some of the techniques used by Reischuk [22] Reif and Valiant [21] for flashsort algorithm to perform divide and conquer in a plane very efficiently leading to the improved performance by our approach.
Modeling sensory representations in brain: new methods for studying functional architecture reveal unique spatial patterns
Authors: D. R. Roberts, C. Koutsougeras, R. J. Nudo, C. G. Cusick
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

We review experimental methods used to study cortex functional architecture, including the optical imaging technique. Information gained from studies of stimulus evoked brain activity will aid our understanding of sensory coding and information processing in central nervous systems and should be incorporated into biologically plausible models of cortical function.
A Practical Algorithm for Finding Matrix Representations for Polycyclic Groups
Authors: Eddie H. Lo, Gretchen Ostheimer
Venue:  (1997)

We describe a new algorithm for finding matrix representations for polycyclic groups given by finite presentations. In contrast to previous algorithms, our algorithm is efficient enough to construct representations for some interesting examples. The examples which we studied included a collection of free nilpotent groups, and our results here led us to a theoretical result concerning such groups.
A Multicast Synchronization Protocol for Real Time Distributed Systems
Authors: A. Abouaissa, A. Benslimane
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

High speed networks can support real-time multimedia applications. However, the nature of the asynchronous transmission, and the absence of a physical global clock can disrupt the temporal relationships among media units. Delta -causal ordering is a communication abstraction designed to maintain these temporal relationships within some tolerable bound. The delta value represents the limited lifetime during which a message m can be used by a destination process. In this paper, we develop a new real-time causal ordering protocol, in a distributed system S, where all participants can start to playback, simultaneously, the same media unit. We validate this model by using CPN (Colored Petri Nets) to obtain a state space graph. The objective is to study the behavior of this model, by verifying different properties such as, boundedness, liveness. The simulation result shows that this model respects the real-time causal ordering, in the context of multicast communications.
A self-referential agent-based model that consists of a large number of agents moving stochastically in a discrete bounded domain
Authors: Minoru Tabata, Nobuoki Eshima
Venue: Applied Mathematics and Computation (2003)

In order to describe interregional migration, we construct two models that consist of a large number of agents who relocate stochastically within a bounded discrete domain. Each agent of the models moves in order to obtain higher desirability. One is a model whose agents take only the present behavior of agents into account. The other is a model that contains agents relocating on the basis of a conjecture about the behavior (in the future) of agents. We assume that the agents of the latter model form the conjecture by making use of the model containing themselves. In this sense, we can say that the latter model has self-reference. The purpose of the present paper is to study the asymptotic behavior of these two models.
Heterogeneous Parallelization of the Linkmap Program
Authors: Aaditya Rai, Noe Lopez-Benitez, J. D. Hargis, S. E. Poduslo
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Sequential genetic algorithms have many successful applications in very different domains, but they have a main drawback in their utilization. Evaluations are very time-consuming, e.g., a pedigree consisting of fifty-five nodes takes about seventy minutes on a DEC-Alpha processor and about two hundred and seventy minutes on a 166MHz Pentium for certain likelihood calculations. This time increases exponentially with the increase in the size of the pedigree. In order to solve these shortcomings and to study new models of higher efficiency, parallel platforms are being used for genetic programs. LINKAGE is a software package for performing genetic likelihood calculations; FASTLINK is an improved, faster version of it. This paper provides a parallel implementation of the 'Linkmap' program (one of the four programs in LINKAGE/FASTLINK) for a heterogeneous environment, using static and a dynamic strategy for task allocation. It was found that the increased performance by the dynamic strategy was close to the estimated maximum speedup.
Fractal summarization: summarization based on fractal theory
Authors: Christopher C. Yang, Fu Lee Wang
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

In this paper, we introduce the fractal summarization model based on the fractal theory. In fractal summarization, the important information is captured from the source text by exploring the hierarchical structure and salient features of the document. A condensed version of the document that is informatively close to the original is produced iteratively using the contractive transformation in the fractal theory. User evaluation has shown that fractal summarization outperforms traditional summarization.
Scheduling with Global Information in Distributed Systems
Authors: Fabrizio Petrini, Wu-chun Feng
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Buffered co-scheduling is a distributed scheduling methodology for time-sharing communicating processes in a distributed system, e.g., PC cluster. The principle mechanisms involved in this methodology are communication buffering and strobing. With communication buffering, communication generated by each processor is buffered and performed at the end of regular intervals (or time slices) to amortize communication and scheduling overhead. This regular communication structure is then leveraged by introducing a strobing mechanism, which performs a total exchange of information at the end of each time slice. Thus, a distributed system can rely on this global information to more efficiently schedule communicating processes rather than rely on isolated or implicit information gathered from local events between processors.In this paper, we describe how buffered co-scheduling is implemented in the context of our SMART simulator. We then present performance measurements for two synthetic workloads and demonstrate the effectiveness of buffered co-scheduling under different computational granularities, context-switch times, and time-slice granularities.
Sparse Null Bases and Marriage Theorems
Authors: Alex Pothen
Venue:  (1985)

NOT SUPPLIED
Active Blobs
Authors: Stan Sclaroff, John Isidoro
Venue:  (1997)

Abstract Active blobs, a new region-based approach to nonrigid motion tracking is described. Active blobs employ a view-based representation; each object is defined in terms of a deformable, active blob of color pixels. Shape is defined in terms of a triangulated finite element model that captures object shape plus a color texture map that captures object appearance. Active blobs also provide normalization with respect to some photometric variations. Nonrigid shape registration and motion recovery is achieved by posing the problem as an energy-based, robust minimization procedure. The active blob formulation is robust to occlusions, shadows, and specular highlights.
Godel, von Neumann and the P=?NP Problem
Authors: Juris Hartmanis
Venue:  (1989)

In a 1956 letter, Godel asked von Neumann about the computational complexity of an NP complete problem. In this column, we review the historic setting of this period, discuss Godel''s amazing letter and why von Neumann did not solve the P = ?NP problem.
Guaranteeing Quality of Service for the Web using Application REQUested IP over ATM
Authors: Werner Almesberger, Eric Gauthier, Jean Le Boudec, Philippe Oechslin
Venue:  (1995)

When using the Web over the TCP/IP protocol suite of the Internet there is (yet) no possibility to guarantee bandwidth or delay for the transmission of a document. For the multimedia documents of the Web, transmission with guaranteed quality of service (QoS) is however very desirable. ATM networks which are being deployed now are one means of solving this problem. They offer high bandwidths and QoS negotiation at connection establishment. Current implementations of IP over ATM do not pass these advantages of the underlying network to the application level. Making the hypothesis that standard solutions involving RSVP and NHRP will not soon be available we present a service built on a dual stack (IP \& ATM) approach which allows to transport IP streams over application requested ATM connections. We show how this service can be used to offer guaranteed QoS to Web users on ATM while preserving compatibility with users which can not benefit of ATM connections. Finally we show how this solution can even provide better QoS to Web users not directly connected to ATM.
Solving constraint satisfaction problems by a genetic algorithm adopting viral infection
Authors: H. Kanoh, K. Hasegawa, M. Matsumoto, S. Nishihara, N. Kato
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

Several approximate algorithms have been reported to solve large constraint satisfaction problems (CSPs) in a practical time. While these papers discuss techniques to escape from local optima, the present paper describes a method that actively performs global search. The present method is to improve the rate of search of genetic algorithms using viral infection instead of mutation. The partial solutions of a CSP are considered to be viruses and a population of viruses is created as well as a population of candidate solutions. Search for a solution is conducted by crossover infection substitutes the gene of a virus for the locus decided by the virus. Experimental results using randomly generated CSPs prove that the proposed method is faster than a usual genetic algorithm in finding a solution when the constraint density of a CSP is low.
Enhancing Qualitative Relative Orientation with Qualitative Distance for Robot Path Planning
Authors: M. T. E. Monferrer, F. T. Lobo
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Humans reason about different aspects of space (such as relative orientation, cardinal directions, distance, size and shape of objects) quite easily. With the aim of simulating human behavior, several models for these spatial concepts have been developed in the later years. Cognitive considerations have made these frameworks qualitative because it seems to deal better with the imprecision that human perception provides. Unfortunately no operational model which allows to reason with all these spatial aspects in an integrated way has been developed up to now. The first aim of our research has been the integration of different spatial concepts which is accomplished by the definition of an operational model based on First Order Predicate Logic. Constraint Logic Programming extended with Constraint handling Rules provides the level of abstraction suited for the integration of qualitative relative orientation and qualitative distance. The second aim of our work is to apply qualitative spatial reasoning to robot path planning.
The need for matching visualisation techniques to client understanding in the UK construction industry
Authors: M. Ormerod, G. Aouad
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

An empirical study of the methods available for visualisation of proposed building structures was undertaken at the University of Salford. This formed the basis for a structured survey of 103 construction related professionals. Their views were obtained on the mediums currently being used in the construction industry, the effectiveness of these mediums to communicate information; and the applicability of visualisation techniques within their own organisation. The results highlight the need for further investigation and research into visualisation techniques, particularly in connection with the needs and understanding of construction industry clients. This corroborates the findings of the recent Latham Working Groups, who place great emphasis on the need for improved communication and image within the construction industry.
Graphics Programming with GDI+
Authors: Mahesh Chand
Venue:  (2003)

“Graphics Programming with GDI+ explores and exploits a wonderful range of GDI+ programming concepts, techniques, and applications for programmers of beginner to intermediate abilities. Being a prolific contributor to the Internet community of developers, Mahesh Chand is offering what seems to be a natural extension of what he does best-sharing his programming skills with other talented programmers. Each chapter compels to the next.” ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ -Jason Hattingh, Director, Greystone Digital FX“Mahesh does a very good job getting .NET developers up to speed using the GDI+ features supported in the .NET Framework. There is good coverage of graphics fundamentals that helps the reader better understand the concepts of graphics programming with GDI+, and there are some excellent sample applications that demonstrate the graphics topics covered to reinforce the concepts presented.” ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ -Charles G. Parker, President, Parallel Consulting, Inc.“Graphics Programming with GDI+ is a comprehensive reference for anyone who wants to leverage this technology. It presents a clear discussion of the topics in such a manner that is comprehensible to the beginner, but sufficiently in-depth to challenge seasoned programmers.” ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ -Deborah J. Bechtold, MCSD, MCDBA"This is the most comprehensive book about graphics programming using GDI+ so far. This book will be a very useful handbook for everyone who does graphics programming for Windows."ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ ï¾ -Min Liu, Software Design Engineer of GDI+, Microsoft CorporationGraphics Programming with GDI+ is the .NET developer's guide to writing graphics applications for Windows and the Web. Through the use of detailed examples it provides experienced programmers with a deep understanding of the entire GDI+ API defined in the .NET Framework class library.The book begins with an introduction to GDI+ and the basics of graphics programming in Windows. The core of the book is a hands-on guide to practical topics, including how to use Windows Forms and optimize GDI+ performance. Chapters demonstrate how to develop real-world tools such as GDI+Painter, GDI+Editor, ImageViewer, and ImageAnimator. The author provides extensive reusable sample code in C# throughout, and complete downloadable source code in C# and Visual Basic .NET is available online, as are color versions of screen shots from the book.Key topics include: How GDI+ compares to GDI How GDI+ is defined and used in the .NET Framework How to draw, paint, and fill graphics objects Viewing and manipulating images Transforming graphics objects, images, and colors Printing in .NET How to develop GDI+ Web applications How to optimize drawing quality and performance Interactive color blending and transparent colors GDI interoperability Answers to frequently asked GDI+ questionsGraphics Programming in GDI+ is the most in-depth treatment available on writing effective graphics applications for the .NET Framework.
Supercade: A Visual History of the Videogame Age 1971-1984
Authors: Van Burnham
Venue:  (2003)

:"From Pong to Pac-Man, Asteroids to Zaxxon - more than fifty million people around the world have come of age within the electronic flux of videogames, their subconscious forever etched with images projected from arcade and home videogame systems." From the first interactive blips of electronic light at Brookhaven National Labs and the creation of Spacewar! at the Massachusetts Institute of Technology; to the invention of the TV Game Project and the myriad systems of Magnavox, Atari, Coleco, and Mattel that followed; through the rise of the Golden Age of videogames and forward into the imagination of millions, Supercade is the first book to illustrate and document the history, legacy, and visual language of the videogame phenomenon.
A Minimax Game of Power Control in a Wireless Network under Incomplete Information
Authors: Heikkinen Tiina
Venue:  (1999)

The purpose of this paper is to study optimal transmit power control and capacity of a wireless multimedia network, where there is incomplete information about the link gain coefficients. Previously, Perron-Frobenius theory has been applied to the study of optimal power control under complete information about the link gain matrix and the interference matrix. This paper derives a characterization of optimal power vector and capacity in terms of an incomplete-information-matrix-game against nature choosing the elements of the link gain and interference matrices. A game theoretical rationale for not using power control is given.
Granularity Control for Distributed Execution of Logic Programs
Authors: George Xirogiannis
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Distributed execution of logic programs requires a match of granularity between a program and the distributed multi-processor it runs on to exploit its potential for performance fully. This paper presents methods to control the granularity of tasks on distributed heterogeneous processors effectively. It considers the characteristics of such platforms and relates the amount of local computation with the significant communication overheads by introducing the notion of a collection of parallel tasks. The experimental results indicate that the proposed controls can model all kinds of predicates (recursive, mutually recursive etc.) satisfactorily and improve the performance of various forms of parallelism (AND, OR, combinations
The birth and death process of hypercycle spirals
Authors: Kazumasa Oida
Venue: Proceedings of the eighth international conference on Artificial life (2002)

The behavior of hypercycle spirals in a two-dimensional cellular automaton model is analyzed. Each of these spirals can be approximated by an Archimedean spiral and the center, width, and phase of the hypercycle spiral change according to Brownian motion. A barrier exists between two spirals if the phase synchronization hypothesis is taken into account, and the occurrence rate of pair decay (the simultaneous disappearance of two spirals) can be explained by the random walk simulation with the barrier. Adjacent species violation is shown to be a necessary condition for creating new spirals. A hypercycle system can live long if the spirals in the system are somewhat unstable, since new spirals cannot emerge when existing spirals are too stable.
The case against stack-oriented instruction sets
Authors: Glenford J. Myers
Venue: ACM SIGARCH Computer Architecture News (1977)

Stack-oriented (reverse-Polish-oriented) instruction sets have been claimed to be superior to register-oriented instruction sets. This paper refutes this claim and also shows that a third form is more desirable.
Application and user interface migration from BASIC to Visual C++
Authors: G. Antoniol, R. Fiutem, E. Merlo, P. Tonella
Venue: Proceedings of the International Conference on Software Maintenance (1995)

An approach to reengineer BASIC PC legacy code into modern graphical systems is proposed. BASIC has historically been one of the first languages available on PCs. Based on it, small or medium size companies have developed systems that represent valuable company assets to be preserved. Our goal is the automatic migration from the BASIC character oriented user interface to a graphical environment which includes a GUI builder, and compiles event driven C/C++ code. For this purpose a conceptual representation in terms of abstract graphical objects and call-backs has been inferred from the original code, and a translator from BASIC to C has been developed. Moreover the GUI builder internal representation has been generated, so that the user interface can be interactively fine-tuned by the programmer. We present and discuss BASIC peculiarities, with preliminary results on code translation. For the explanation of our approach to user interface migration an example is used throughout the text.
A Scan-Bist Environment for Testing Embedded Memories
Authors: F. Karimi, F. Lombardi
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

This paper presents a new IEEE 1149.1 compatible architecture as an intermediate environment for testing embedded memories. A BIST structure and a boundary scan are used for testing various memory configurations for programmability as well as improved controllability and observability. Its novelty is that features such as modularity, scalability with word size and adaptability to different memory configurations and testing requirements, are accomplishedat relative ease. In the boundary scan, user-defined test modes are utilized so that basic modications to the elements of a seed algorithm can be generated very efficiently.
Using personal computers in operating system courses
Authors: Per Brinch Hansen
Venue: ACM SIGOPS Operating Systems Review (1983)

By using personal computers it is now possible to make operating system courses for computer science students as practical as compiler courses. This paper describes a course in which undergraduates use the programming language Edison to build operating systems for IBM Personal Computers.
Load Balancing with Multiple Token Policy
Authors: Parag Kulkarni, Indranil Sengupta
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

In distributed systems uneven arrivals of the tasks may overload few hosts where as some of the hosts are lightly loaded. This load imbalance prevents distributed systems from delivering its performance to its capacity. Load balancing has been advocated as a means of improving performance and reliability of distributed systems. A new load balancing approach [14] is proposed to deal with this problem. In this paper, we extend this model with multiple tokens. With some parameters in the algorithm set to intelligent values, the algorithm promises better load balancing results.