ppxscal/embedding_network huggingface dataset:
A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
Authors: Brendan Vastenhouw, Rob H. Bisseling
Venue: SIAM Review (2005)

A new method is presented for distributing data in sparse matrix-vector multiplication. The method is two-dimensional, tries to minimize the true communication volume, and also tries to spread the computation and communication work evenly over the processors. The method starts with a recursive bipartitioning of the sparse matrix, each time splitting a rectangular matrix into two parts with a nearly equal number of nonzeros. The communication volume caused by the split is minimized. After the matrix partitioning, the input and output vectors are partitioned with the objective of minimizing the maximum communication volume per processor. Experimental results of our implementation, Mondriaan, for a set of sparse test matrices show a reduction in communication volume compared to one-dimensional methods, and in general a good balance in the communication work. Experimental timings of an actual parallel sparse matrix-vector multiplication on an SGI Origin 3800 computer show that a sufficiently large reduction in communication volume leads to savings in execution time.
Mercer Kernels for Object Recognition with Local Features
Authors: Siwei Lyu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

A new class of kernels for object recognition based on local image feature representations are introduced in this paper. These kernels satisfy the Mercer condition and incorporate multiple types of local features and semilocal constraints between them. Experimental results of SVM classifiers coupled with the proposed kernels are reported on recognition tasks with the COIL-100 database and compared with existing methods. The proposed kernels achieved competitive performance and were robust to changes in object configurations and image degradations.
Integrated information management: an interactive, extensible architecture for information retrieval
Authors: Eric Nyberg, Hal Daume
Venue: Proceedings of the first international conference on Human language technology research (2001)

Most current IR research is focused on specific technologies, such as filtering, classification, entity extraction, question answering, etc. There is relatively little research on merging multiple technologies into sophisticated applications, due in part to the high cost of integrating independently-developed text processing modules.
Minimization of basic quality indices in linear discrete systems
Authors: O. N. Kiselev
Venue: Automation and Remote Control (2005)

A method of synthesis of controllers for one-dimensional linear discrete control systems is put forward, which optimizes a transition function relative to basic quality indices such as the overshoot or the settling time. This method rests on the conditions of the finite duration of a transient process, which determines the convexity of objective functions by the parameters of a controller and systematically enables reducing the optimization problems to the standard algorithm of linear programming.
A sensor-based, web service-enabled, emergency medical response system
Authors: Nada Hashmi, Dan Myung, Mark Gaynor, Steve Moulton
Venue: Proceedings of the 2005 workshop on End-to-end, sense-and-respond systems, applications and services (2005)

Recent advances in low power wireless sensor networks are enabling new and exciting applications for wireless devices. At the same time, the power and flexibility of web services is expanding the power of the internet. Herein, we describe a scalable emergency medical response system that couples the efficient data collection of sensor networks with the flexibility and interoperability of a web services architecture
Adobe Acrobat 7 in the Office
Authors: Donna Baker
Venue:  (2005)

Offering a raft of Microsoft Office collaboration features (plus the ability to review and comment on Acrobat Pro--created documents using just Reader), Acrobat is no longer just for pre-press and creative professionals. Acrobat can simplify workflows in all kinds of business settings. All you need is this handy guide to delineate those uses and show you how you can put Acrobat to work to make your own life easier! In these pages, veteran author Donna L. Baker uses cases studies and real-world examples to show you how to use Acrobat for everything from sending documents securely to creating forms and building presentations. Each case study details the most efficient ways to convert source documents into PDF documents, and reveals the how's and whys of using Acrobat in specific situations--from creating an annual report to setting up an email ordering system for a take-out restaurant. You'll learn how to create archives of Outlook email threads, manage document feedback, embed fonts, and more on your way to Acrobat proficiency.
On the size of the search space of join optimization
Authors: Cong-cong Xing, Bill P. Buckles
Venue: Journal of Computing Sciences in Colleges (2005)

A fundamental issue when we deal with the analysis of the join optimization problem in database systems is: How large is the search space? This paper presents a complete answer to this question. The result shows that the size of the search space is far beyond exponential, which poses a great challenge for finding an e_cient polynomial time algorithm for solving the join optimization problem. On the other hand, it prompts attempts to prove that the join optimization problem is NP-complete. Our work is the initial step for further study on the join optimization problem.
Minimal March Tests for Unlinked Static Faults in Random Access Memories
Authors: G. Harutunyan, V. A. Vardanian, Y. Zorian
Venue: Proceedings of the 23rd IEEE VLSI Test Symposium (2005)

New minimal March test algorithms are proposed for detection of (all) unlinked static faults in Random Access Memories. In particular, a new minimal March MSS test of complexity 18N is introduced detecting all realistic simple static faults, as March SS (22N), (S. Hamdioui, van de Goor, Rodgers, MTDT 2002).
Sequence alignment on the Cray MTA-2: Research Articles
Authors: Shahid H. Bokhari, Jon R. Sauer
Venue: Concurrency and Computation: Practice Experience (2004)

Several variants of standard algorithms for DNA sequence alignment have been implemented on the Cray Multithreaded Architecture-2 (MTA-2). We describe the architecture of the MTA-2 and discuss how its hardware and software enable efficient implementation of parallel algorithms with little or no regard for issues of partitioning, mapping or scheduling. We describe how we ported variants of the naive algorithm for exact alignment and the dynamic programming algorithm for approximate alignment to the MTA-2 and provide detailed performance measurements. It is shown that, for the dynamic programming algorithm, the use of the MTA's &lsquo;Full&sol;Empty&rsquo; synchronization bits leads to almost perfect speedup for large problems on one to eight processors. These results illustrate the versatility of the MTA's architecture and demonstrate its potential for providing a high-productivity platform for parallel processing. Copyright &copy; 2004 John Wiley & Sons, Ltd.Affectionately dedicated to the memory of Harry F. Jordan
Freedom and constraint in the creative process in digital fine art: an AHRB invited workshop
Authors: John Haworth, Sue Gollifer, James Faure-Walker, Paul Coldwell, Tom Kemp, Jon Pengelly
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The workshop will explore in depth the nature of freedom and constraint in the creative process in digital fine art from the perspective of embodied mind. The problem is crucial to our understanding of the creative process in fine art. The aims and objectives of the workshop are to bring into visibility critical insights into the creative process, thereby potentially empowering digital artists.
Letter to the editor: accelerated convergence in Newton's method for approximating square roots
Authors: M. A. Hernández, N. Romero
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, we construct a modification of Newton's method to accelerate the convergence of this method to the approximation of the positive square root of a positive real number. From this modification, we can define a new iterative process with prefixed order q ∈ N, q ≥ 2.
Using a Layered Markov Model for Distributed Web Ranking Computation
Authors: Jie Wu, Karl Aberer
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

The link structure of the Web graph is used in algorithms such as Kleinbergýs HITS and Googleýs PageRank to assign authoritative weights to Web pages and thus rank them. Both require a centralized computation of the ranking if used to rank the complete Web graph. In this paper, we propose a new approach based on a Layered Markov Model to distinguish transitions among Web sites and Web documents. Based on this model, we propose two different approaches for computation of ranking of Web documents, a centralized one and a decentralized one. Both produce a well-defined ranking for a given Web graph. We then formally prove that the two approaches are equivalent. This provides a theoretical foundation for decomposing link-based rank computation and makes the computation for a Web-scale graph feasible in a decentralized fashion, such as required for Web search engines having a peer-to-peer architecture. Furthermore, personalized rankings can be produced by adapting the computation at both the local layer and the global layer. Our empirical results show that the ranking generated by our model is qualitatively comparable to or even better than the ranking produced by PageRank.
Emerging areas in undergraduate computer science education
Authors: Lawrence D'Antonio, Kathleen Harmeyer, Amruth N. Kumar, Michael Olan, Brad Richards, Rose K. Shumba, Linda Wilkens
Venue: Journal of Computing Sciences in Colleges (2004)

Computer Science is a discipline in a state of continual change. As a discipline that borders on many other disciplines such as engineering, mathematics, physics, and psychology, and more recently, as a science that can be applied to many fields such as biology, entertainment, commerce, and communication, Computer Science continues to reinvent itself every 5--7 years. In this context, it is only prudent for Computer Science educators to scan the horizon for emerging areas of the discipline that might affect their curriculum and the way they teach. Emerging areas today include computer and network security, information assurance, robotics, bioinformatics, animation, game programming, web application development, embedded computing, and wireless computing, to name just a few. The value that offering courses in these emerging areas will add to a student's education may make all the difference in an increasingly global job market.
Breaking through the syntax barrier: searching with entities and relations
Authors: Soumen Chakrabarti
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search systems will either let users express information needs naturally and analyze them more intelligently, or allow simple enhancements that add more user control on the search process. The data model will exploit graph structure where available, but not impose structure by fiat. First generation Web search, which uses graph information at the macroscopic level of inter-page hyperlinks, will be enhanced to use fine-grained graph models involving page regions, tables, sentences, phrases, and real-world-entities. New algorithms will combine probabilistic evidence from diverse features to produce responses that are not URLs or pages, but entities and their relationships, or explanations of how multiple entities are related.
On the scalability and capacity of planar wireless networks with omnidirectional antennas: Research Articles
Authors: Onur Arpacioglu, Zygmunt J. Haas
Venue: Wireless Communications Mobile Computing (2004)

An Erratum has been published for this article inWe extend the previously well-known results on the capacity of wireless networks and present the implications of our results on network scalability. In particular, we find bounds on the maximum achievable per-node end-to-end throughput, &lambda;e, and the maximum number of simultaneously successful wireless transmissions, Ntmax, under a more general network scenario than previously considered. Furthermore, in the derivation of our results, we make no restrictions on the mobility pattern of the nodes or on the number simultaneous transmissions and&#x002F;or receptions that nodes are capable of maintaining. In our derivation, we analyze the effect of parameters such as the area of the network domain, A, the path loss exponent, &gamma;, the processing gain, G, and the SINR threshold, &beta;. Specifically, we prove the following results for a wireless network of N nodes that are equipped with omnidirectional antennas: &lambda;e is &Theta;(1&#x002F;N) under very general conditions. This result continues to hold even when the communication bandwidth is divided into sub-channels of smaller bandwidth. Ntmax has an upper bound that does not depend on N, which is the simultaneous transmission capacity of the network domain, NtQ. For a circular network domain, NtQ is O(Amin&lcub;&gamma;&#x002F;2,1&rcub;) if &gamma;&ne;2 and O(A&#x002F;log(A)) if &gamma;&thinsp;=&thinsp;2. In addition, NtQ is O(&gamma;2) and O(G&#x002F;&beta;). Moreover, lack of attenuation and lack of space are equivalent, where NtQ cannot exceed 1&thinsp;+&thinsp;G&#x002F;&beta;. As N&thinsp;&rarr;&thinsp;&infin; a desired per-node end-to-end throughput is not achievable, unless the average number of hops between a source and a destination does not grow indefinitely with N, A grows with N and N is O(Amin&lcub;&gamma;&#x002F;2,1&rcub;) if &gamma;&ne;2 and O(A&#x002F;log(A)) if &gamma;&thinsp;=&thinsp;2. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Efficient and precise dynamic impact analysis using execute-after sequences
Authors: Taweesup Apiwattanapong, Alessandro Orso, Mary Jean Harrold
Venue: Proceedings of the 27th international conference on Software engineering (2005)

As software evolves, impact analysis estimates the potential effects of changes, before or after they are made, by identifying which parts of the software may be affected by such changes. Traditional impact-analysis techniques are based on static analysis and, due to their conservative assumptions, tend to identify most of the software as affected by the changes. More recently, researchers have begun to investigate dynamic impact-analysis techniques, which rely on dynamic, rather than static, information about software behavior. Existing dynamic impact-analysis techniques are either very expensive---in terms of execution overhead or amount of dynamic information collected---or imprecise. In this paper, we present a new technique for dynamic impact analysis that is almost as efficient as the most efficient existing technique and is as precise as the most precise existing technique. The technique is based on a novel algorithm that collects (and analyzes) only the essential dynamic information required for the analysis. We discuss our technique, prove its correctness, and present a set of empirical studies in which we compare our new technique with two existing techniques, in terms of performance and precision.
Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
Authors: Darryn Bryant, Daniel Horsley, Barbara Maenhaut
Venue: Journal of Combinatorial Theory Series B (2005)

Two theorems are proved in this paper. Firstly, it is proved that there exists a decomposition of the complete graph of order n into t edge-disjoint 2-regular subgraphs of orders m1, m2,...,mt if and only if n is odd, 3≤mi ≤ n for i = 1, 2,...,t, and m1 + m2 +...+ mt = (n 2). Secondly, it is proved that if there exists partial decomposition of the complete graph Kn of order n into t cycles of lengths m1, m2,..., mt, then there exists an equitable partial decomposition of Kn into t cycles of lengths m1, m2,..., mt. A decomposition into cycles is equitable if for any two vertices u and v, the number of cycles containing u and the number of cycles containing v differ by at most 1.
SNIF: social networking in fur
Authors: Jonathan Gips, Noah Fields, Philip Liang, Arnaud Pilpré
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We present SNIF: Social Networking in Fur, a system that allows pet owners to interact through their pets' social networks. SNIF comprises inexpensive hardware that can be unobtrusively and transparently affixed to pet collars and paraphernalia in order to augment pet-to-pet, pet-to-owner, and owner-to-owner interactions. SNIF devices aggregate pertinent environmental, social, and individual information that can be broadcast or addressed to other participating community members.
Stabilization of tag-mediated interaction by sexual reproduction in an evolutionary agent system
Authors: F. Alkemade, D. D.B. Bragt, J. A. L Poutre
Venue:  (2000)

The evolution of cooperation in a system of agents playing the iterated prisoner''s dilemma (IPD) is investigated. We present results for the standard two-person IPD as well as the more general N-person IPD (NIPD) game. In our computational model, agents can recognize each other and decide whether to interact or not, based upon ``tags'''' (labels). We consider the evolutionary stability of the evolving populations. Previous work is extended by introducing sexual reproduction (recombination) of agents and by analyzing its influence on the evolving populations. We observed the occasional formation of very stable cooperative societies, as opposed to previous results without sexual reproduction. These cooperative societies are able to resist invasions of ``mimics'''' (defecting agents with the tag of a cooperating agent).
BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Contents-Based Relations
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Traditional searching and browsing functions for bibliographic databases no longer enable researchers to deal efficiently with the rapidly growing number of scientific publications. Our project BibRelEx aggregates expert knowledge on a body of scientific literature and makes it available to researchers who wish to explore the literature. We take a two-pronged approach: First, we collect expert annotations on publications and their semantic relationships to other publications. Second, we let researchers explore this semantically enriched body of literature and knowledge through visualizations. Hence, we enable researchers to track relevant documents based on their colleagues' expertise. We are testing our approach with a bibliographic database in a computational geometry.
Multiresolution data modelling for irregular data fields based on wavelets
Authors: Feng Dong, Jiaoying Shi
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

In many applications of scientific visualization, the data fields are so large that they are very expensive to store, transmit and render. Multiresolution offers a promising new approach for addressing these difficulties on a simple, unified way. Wavelets provide an extremely useful mathematical toolkit for hierarchically decomposing functions in ways that are both efficient and theoretically sound. This paper focuses on extension of wavelet based multiresolution to arbitrary topological data grid. Using wavelet transform, the method proposed here obtains a unique shape description of an irregular data field. A biorthogonal volume wavelet is constructed. Recursive subdivision is applied to irregular data field and leads to a collection of refinable scaling functions and hence to a sequence of nested linear spaces, as required by multiresolution. In order to overcome the subdivision connectivity restriction, an applicable method is presented to convert the completely arbitrary data field to multiresolution so that the technique for creating multiresolution can be used.
On Designing Constrained Local Access Networks
Authors: H. Dai, S. Fujino
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Most network design problems are computationally intractable. For obtaining approximations, greedy heuristics are commonly employed. The Esau-Williams algorithm adopts a better greedy heuristic in solving (constrained) capacitated minimum spanning tree (CMST) problem, using a trade off function computing the potential saving in the cost of a link. In this study, thecomponent-oriented tradeoff computation is employed instead of the node-oriented oneto implement the heuristic efficiently. The improved Esau-Williams algorithm is modified for variations of the CMST problems with order, degree, and depth constraints.
Compiler Optimization of Array Data Storage
Authors: Rajiv Gupta, James Kajiya
Venue:  (1990)

The literature has witnessed much work aimed at improving the efficiency of mernory systems. The motivation is obvious: the high cost of page faults in hierarchical stores. Most architectures, including vector processors, shared - and distributed - memory multiprocessors, and interleaved memories, similarly reward data locality and predictable patterns of access. Most current endeavors, however, prefix the storage organization of data operands and either manipulate loops in the code, tailor algorithms, or tune prefetching strategies and replacement policies. A methodology and an algorithm for automatically organizing the storage of array data for efficient access by the executing code are described. The simple techniques presented may be incorporated in a compiler and are complementary to the other optimizations in the literature. Furthermore, examples in Fortran 8X and Fortran 77 pseudo-code support the general applicability of the work to programming languages, both scalar as well as array. Notwithstanding the column-major storage constraints, a technique for optiimizing storage in Fortran 77 is outlined. The prudence of of a compiler-optimized approach over a user-optimized approach to data storage organization is discussed.