ppxscal/embedding_network huggingface dataset:
Parallelizing a Defect Detection and Categorization Application
Authors: Leonid Glimcher, Gagan Agrawal, Sameep Mehta, Ruoming Jin, Raghu Machiraju
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

This paper presents a case study in creating a parallel and scalable implementation of a scientific data analysis application.We focus on a defect detection and categorization application which analyzes datasets produced by Molecular Dynamics (MD) simulations. In parallelizing this application, we had the following three goals.First, we obviously wanted to achieve high parallel efficiency.Second, we wanted to create an implementation that can scale to disk-resident datasets. Third, we wanted to create an easy to maintain and modify implementation, which is possible only through using high-level interfaces.We used a number of techniques for organizing the input data, achieving load balance, and efficiently parallelizing the step for updating and matching with the defect catalog.To meet our third goal, we used a system called FREERIDE (FRamework for Rapid Implementation of Datamining Engines), which was originally developed for parallelizing data mining algorithms. We have carried out a detailed evaluation of our implementation. The main observations from our experiments are as follows: 1) our implementation achieves high parallel efficiency, 2) the execution time remains proportional to the amount of computation even as the dataset becomes disk-resident, and 3) our scheme for load balancing and the method we use for parallelizing updating and matching of the defect catalog are crucial for parallel efficiency of the defect categorization phase.
Agents of the mind
Authors: James C. Houk
Venue: Biological Cybernetics (2005)

The higher order circuitry of the brain is comprised of a large-scale network of cerebral cortical areas that are individually regulated by loops through subcortical structures, particularly through the basal ganglia and cerebellum. These subcortical loops have powerful computational architectures. Using, as an example, the relatively well-understood processing that occurs in the cortical/basal ganglionic/cerebellar distributed processing module that generates voluntary motor commands, I postulate that a network of analogous agents is an appropriate framework for exploring the dynamics of the mind.
The Road Rager: making use of traffic encounters in a mobile multiplayer game
Authors: Liselott Brunnberg
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

We present Road Rager, a prototype built in order to explore our hypothesis that proximity and a possibility to identify other players during temporary encounters could spur social interaction and enhance a mobile gaming experience. In this case, it is a multiplayer game designed to enable passengers in different cars to play against each other during a meeting in traffic. Using such meetings as resource opens new interesting possibilities for novel and engaging mobile experiences. In this paper we present the game concept, the implementation and the possibilities to interact - designed to successfully benefit from the dynamic and vivid mobile context created during a traffic encounter. We also present a technical test and some initial user feedback on the gaming experience.
GE NLToolset: description of the system as used for MUC-4
Authors: George Krupka, Paul Jacobs, Lisa Rau, Lois Childs, Ira Sider
Venue: Proceedings of the 4th conference on Message understanding (1992)

The GE NLTOOLSET is a set of text interpretation tools designed to be easily adapted to new domains. This report summarizes the system and its performance on the MUC-4 task.
Improved cross-language retrieval using backoff translation
Authors: Philip Resnik, Douglas Oard, Gina Levow
Venue: Proceedings of the first international conference on Human language technology research (2001)

The limited coverage of available translation lexicons can pose a serious challenge in some cross-language information retrieval applications. We present two techniques for combining evidence from dictionary-based and corpus-based translation lexicons, and show that backoff translation outperforms a technique based on merging lexicons.
The role of time in information processing: a survey
Authors: A. Bolour, T. L. Anderson, L. J. Dekeyser, H. K. T. Wong
Venue: Issue 80 (April 1982) (1982)

Numerous researchers in a handful of disciplines have been concerned, in recent years, with the special role (or roles) that time seems to play in information processing. Designers of computerized information systems have had to deal with the fact that when an information item becomes outdated, it need not be forgotten. Researchers in artificial intelligence have pointed to the need for a realistic world model to include representations not only for snapshot descriptions of the real world, but also for histories, or the evolution of such descriptions over time. Many logicians have regarded classical logic as an awkward tool for capturing the relationships and the meaning of statements involving temporal reference, and have proposed special "temporal logics" for this purpose. Finally, the analysis of tensed statements in natural language is a principal concern of researchers in linguistics.
Results from Measuring the Performance of the NAS Benchmarks on the Current Generation of Parallel Computers and Observations Drawn from these Measurements
Authors: Daniel M. Pressel
Venue: Proceedings of the 2004 Users Group Conference (2004)

The NAS Division at NASA Ames Research Center has developed a highly respected and widely used set of benchmarks for parallel computers. These benchmarks are based on the needs of computational fluid dynamics applications, but appear to have relevance to other disciplines as well. Unfortunately, NAS last published a collection of results for a wide range of systems in November of 1997. Given the rapid level of change in the field of computers in general, and high performance parallel computing, it seemed appropriate to try and fill in some of the gaps. As such, the major computational assets of the ARL-MSRC is being benchmarked, with the intent to publish the results on an ARL website. While making these measurements, several observations and conclusions were drawn. These observations and conclusions will be discussed at length in this document.
A New Immune Genetic Algorithm and Its Application in Redundant Manipulator Path Planning
Authors: Xiaoping Luo, Wei Wei
Venue: Journal of Robotic Systems (2004)

In this paper, first the immune system is analyzed in a relatively deeper and all-sided point of view reflecting the fresh research in biology. Second, based on the previous statements, a new optimization method, the immune genetic algorithm (IGA), is presented by simulating the behavior of the biological immune system and is proved to converge to the global optimum with probability 1. Third, a new method on the multi-object optimization that is transformed into a single-object one is proposed based on the joints' best compliance in the redundant robot path planning using IGA. Last, the experiment results show that the method of this article behaves more successfully. &copy; 2004 Wiley Periodicals, Inc.
Comparing Restoration Concepts Using Optimal Network Configurations with Integrated Hardware and Routing Decisions
Authors: Sebastian Orlowski, Roland Wessäly
Venue: Journal of Network and Systems Management (2005)

We investigate the impact of link and path restoration on the cost of telecommunication networks. The main observation is that the cost of an optimal network configuration is almost independent of the restoration concept if (i) the installation of network elements (ADMs, DXCs, or routers) and interface cards, (ii) link capacities, and (iii) working and restoration routings are simultaneously optimized.We present a mixed-integer programming model which integrates all these decisions. Using a branch-and-cut algorithm (with column generation to deal with all admissible routing paths), we solve structurally different real-world based problem instances and show that the cost of optimal solutions is almost independent of the used restoration concept.In addition, we optimize spare capacities based on predetermined shortest working paths with respect to different link weights. On our test instances, the additional cost of solutions obtained with this sequential approach, compared to simultaneous optimization of working and restoration routings, varies between 0 and 164%.
Two New Four-Error-Correcting Binary Codes
Authors: Patric R. Östergård
Venue: Designs, Codes and Cryptography (2005)

Two four-error-correcting binary codes of length 21 and 22 and of cardinality 64 and 80, respectively, are constructed. The codes consist of a union of cosets of linear codes with dimension 3 and were found by a maximum clique algorithm.
A hardware/software simulator to unify courses in the computer science curriculum
Authors: Lubomir Ivanov, John S. Mallozzi
Venue: Journal of Computing Sciences in Colleges (2004)

We present the design of a small but efficient computer system, a software simulator with a graphical user interface, and supporting software designed to integrate the educational experience of students taking courses in Computer Organization and Architecture, Operating Systems, and Compiler Design. We demonstrate the essential links among these three areas of Computer Science, and discuss how to integrate the developed system and software into the course material of the above-mentioned courses.
Recognizing Berge Graphs
Authors: Maria Chudnovsky, Gérard Cornuéjols Xinming Liu, Paul Seymour, Kristina Vušković
Venue: Combinatorica (2005)

A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V (G)|9). This is independent of the recent proof of the strong perfect graph conjecture.
Fixed-outline floorplanning based on common subsequence
Authors: Rong Liu, Sheqin Dong, Xianlong Hong
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In this paper, an efficient algorithm addressed to fixed-outline floorplanning is presented. The proposed algorithm takes sequence pair as representation and has following main features: (1) it uses common subsequence and penalty function to bound the variations of the widths of the floorplans to a quite small range; (2) a simple cost function which has no items about the heights of the floorplans is presented; (3) two-stage simulated annealing is adopted to minimize the wirelength. Experimental results show that the proposed algorithm is superior to other state-of-the-art fixed-outline floorplanning approaches in the following aspects: (1) it can achieve high successful probabilities, even with tight outlines and large aspect ratios given; (2) the feasibility of the given outline will be evaluated at the beginning of the floorplanning, which can save much time when infeasible outline is given. Besides, the experimental results on wirelength optimization are also promising.
Design requirements for more flexible structured editors from a study of programmers' text editing
Authors: Andrew J. Ko, Htet Htet Aung, Brad A. Myers
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

A detailed study of Java programmers' text editing found that the full flexibility of unstructured text was not utilized for the vast majority of programmers' character-level edits. Rather, programmers used a small set of editing patterns to achieve their modifications, which accounted for all of the edits observed in the study. About two-thirds of the edits were of name and list structures and most edits preserved structure except for temporary omissions of delimiters. These findings inform the design of a new class of more flexible structured program editors that may avoid well-known usability problems of traditional structured editors, while providing more sophisticated support such as more universal code completion and smarter copy and paste.
Performance Analysis of MPI Collective Operations
Authors: Jelena Pjesivac-Grbovic, Thara Angskun, George Bosilca, Graham E. Fagg, Edgar Gabriel, Jack J. Dongarra
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

Previous studies of application usage show that the performance of collective communications are critical for high-performance computing and are often overlooked when compared to the point-to-point performance. In this paper, we analyze and attempt to improve intra-cluster collective communication in the context of the widely deployed MPI programming paradigm by extending accepted models of point-to-point communication, such as Hockney, LogP/LogGP, and PLogP. The predictions from the models were compared to the experimentally gathered data and our findings were used to optimize the implementation of collective operations in the FT-MPI library.
Distributed Tarpitting: Impeding Spam Across Multiple Servers
Authors: Tim Hunter, Paul Terry, Alan Judge
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

This paper describes an Irish ISP's attempts to combat the abuse of resources caused by unsolicited commercial email. We describe the extension of a multicast system, used to implement POP-before-SMTP relaying, to share information about remote mail servers between multiple mail systems. The information may then be used to tarpit abusive servers - placing delays between SMTP protocol answers thus mitigating their impact on our systems. We then examine how effective this has been, and come up with some ideas for future development.We also discuss building a policy around this and other measures we use to combat spam. An ISP is in the business of sending and receiving mail - this makes slowing or blocking mail a delicate subject.
Sams Teach Yourself Exchange Server 2003 in 10 Minutes (Sams Teach Yourself in 10 Minutes)
Authors: James Walker
Venue:  (2005)

In your daily maintenance routine of your company's Microsoft Exchange Server, you probably run into bumps along the way. Sams Teach Yourself Exchange Server 2003 in 10 Minutes is a great, quick-reference guide to the most common tasks you perform as an Exchange Server administrator. Use this guide as a basis for practical knowledge and solutions to problems with managing mailboxes, performing database maintenance, Outlook Web access, performance optimization and group policy management. When all you need is a quick-hit of information so you can quickly get back to work, Sams Teach Yourself Exchange Server 2003 in 10 Minutes is your best option.
Book review: Knowledge Representation and Defeasible Reasoning. Edited by Henry E. Kyburg, Jr., Ronald P. Loui, and Greg N. Carlson (Kluwer Academic Press)
Venue: ACM SIGART Bulletin (1991)

This book is a collection of papers stemming from a meeting held in Rochester in the spring of 1987. The meeting brought together people from three areas: Artificial Intelligence, Philosophy, and Computational Linguistics. From the introduction:The idea behind the meeting ... was to bring all three groups together for the purpose not merely of exchanging ideas ... but for the purpose of exchanging technology, theorems, axioms --- the stuff of which substantive, permanent, scientific progress is made.
An architects guide to enterprise application integration with J2EE and .NET
Authors: Ian Gorton, Anna Liu
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Architects are faced with the problem of building enterprise scale information systems, with streamlined, automated internal business processes and web-enabled business functions, all across multiple legacy applications. The underlying architectures for such systems are embodied in a range of diverse products known as Enterprise Application Integration (EAI) technologies. In this tutorial, we highlight some of the major problems, approaches and issues in designing EAI architectures and selecting appropriate supporting technology. An architect's perspective on designing large-scale integrated applications is taken, and we discuss requirements elicitation, architecture patterns, EAI technology and features, and risk mitigation. J2EE and .NET technologies are used to illustrate the capabilities of state-or-the-art integration technologies.
A Multi-Spectral Image Database and Its Application to Image Rendering across Illumination
Authors: Steven Hordley, Graham Finalyson, Peter Morovic
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

We present a database of full spatial and spectral resolution images of everyday objects captured with a novel multi-spectral device: the Applied Spectral Imaging © Spectracube camera. We summarise the operation of the device and present a study of its spectral accuracy before demonstrating the usefulness of the data set by using it to evaluate different White Point Correction transforms: transforms which map RGBs under one illuminant to a corresponding set of RGBs under a different light. We find that while the best transforms can often give results close to the results obtained using spectral techniques, the results are both image and illuminant dependent and in a number of cases all transforms tested introduce significant errors.
EOSDIS Petabyte Archives: Tenth Anniversary
Authors: Jeanne Behnke, Tonjua Hines Watts, Ben Kobler, Dawn Lowe, Steve Fox, Richard Meyer
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

One of the world's largest scientific data systems, NASA's Earth Observing System Data and Information System (EOSDIS) has stored over three petabytes of earth science data in a geographically distributed mass storage system. Design for this system began in the early 1990s and included a presentation of the design of the mass storage system at this conference in 1995. Many changes have occurred in the ten years since that presentation, much of it performed while the system was operational. In its first operational year (2000), the EOSDIS system had increased NASA's collection of earth science data holdings eight-fold. Today, EOSDIS collects over 7,000 gigabytes of data per week, almost 60 times more than the Hubble Space Telescope. This load represents major challenges for ingest into the mass storage system, as well as for timely and balanced data distribution out of the mass storage system. This paper discusses the evolution of the EOSDIS archives focusing primarily on the mass storage system component of the archive. We present the lessons that were learned over the years and some directions that we are taking for the future.
Fast Mode Decision for H.264/AVC Based on Macroblock Correlation
Authors: Hong Zhu, Cheng-ke Wu, Yang-li Wang, Yong Fang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

H.264/AVC encoder complexity is remarkable due to mainly variable block size ME and exhaustive RDO mode decision. This makes application of H.264/AVC in network especially wireless environments very difficult. To reduce encoder complexity, in this paper, statistical characteristics of modes among adjacent macroblocks (MBs) spatially and temporally are first studied using H.264 reference software. Then a fast algorithm is presented to reduce jointly the computational load of mode decision and ME. The main ideas are as follows: (1) Candidate modes for current MB are first inferred from mode and motion information of defined reference MBs and then partial RDO approach is applied to make target selection; (2) ME is considered as a part of mode decision and no ME is required for particular modes that are eliminated in advance; (3) The exhaustive RDO method is invoked only if average distortion of the reference MBs goes beyond a predefined threshold. Simulation results demonstrate that our scheme can reduce encoder complexity significantly while coding efficiency is only slightly decreased.
Embedded MPLS Architecture
Authors: Raymond Peterkin, Dan Ionescu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

This paper presents a hardware architecture for Multi Protocol Label Switching (MPLS). MPLS is a protocol used primarily to prioritize internet traffic and improve bandwidth utilization. Furthermore it increases the performance of internet applications and overall efficiency. However, most existing MPLS solutions are entirely software based. MPLS performance can be enhanced by executing core tasks (i.e. label stack modification) in hardware while allowing other tasks to be executed in software to guard against performance degradation. This paper proposes a hardware/software design of MPLS on an FPGA for increased performance and efficiency. Greatest emphasis is placed on the hardware components.
A Unified Formal Specification for a Multi-Consistency Replication System for DHTs
Authors: Anne-Marie Bosneag, Monica Brockmeyer
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

In the modern Internet, scalable and reliable storage mechanisms have become a requirement. Distributed Hash Tables provide scalable management of storage, but donýt support consistency of replicated mutable data. In this paper, we argue that replication is an intrinsic building block of computer-based systems and we present a formal model for specifying replication services that provide support for a range of consistency policies and take into account fault tolerance, liveness and application-specific data constraints. This unified model is general and expressive, permitting a better understanding of the space of possible consistency semantics and protocols, and facilitating the notion of a contract between a client and the service. The model is applied to a multi-consistency replication system designed to be deployed on Distributed Hash Tables. We outline design choices in the replication layer, formally analyze the requirements for several consistency semantics, sketch the implementation and detail the application of the formal model to the eventual consistency protocol.
Historical spatio-temporal aggregation
Authors: Yufei Tao, Dimitris Papadias
Venue: ACM Transactions on Information Systems (TOIS) (2005)

Spatio-temporal databases store information about the positions of individual objects over time. However, in many applications such as traffic supervision or mobile communication systems, only summarized data, like the number of cars in an area for a specific period, or phone-calls serviced by a cell each day, is required. Although this information can be obtained from operational databases, its computation is expensive, rendering online processing inapplicable. In this paper, we present specialized methods, which integrate spatio-temporal indexing with pre-aggregation. The methods support dynamic spatio-temporal dimensions for the efficient processing of historical aggregate queries without a priori knowledge of grouping hierarchies. The superiority of the proposed techniques over existing methods is demonstrated through a comprehensive probabilistic analysis and an extensive experimental evaluation.