ppxscal/embedding_network huggingface dataset:
Mobile Agents for Distributed and Heterogeneous Information Retrieval
Authors: Subrata Das, Kurt Shuster, Curt Wu, Igor Levit
Venue: Information Retrieval (2005)

The heterogeneous, distributed and voluminous nature of many government and corporate data sources impose severe constraints on meeting the diverse requirements of users who analyze the data. Additionally, communication bandwidth limitations, time constraints, and multiple data formats impose further restrictions on users of these distributed data sources. In this paper, we present an Agent-based Complex QUerying and Information Retrieval Engine (ACQUIRE) for large, heterogeneous, and distributed data sources. ACQUIRE acts as a softbot or interface agent by presenting users with a view of a single, unified, homogenous data source, against which users can pose high-level declarative queries. ACQUIRE translates each such user query into a set of sub-queries by employing a combination of planning and traditional database query optimization techniques. ACQUIRE then spawns a set of mobile agents corresponding to these sub-queries, which in turn retrieve the data from various distributed data sources by dynamically optimizing the retrieval strategy as it is carried out. These mobile agents carry with them data-processing code that can be executed at the remote site, thus reducing the size of data returned by the agent. When all mobile agents have returned, ACQUIRE filters and merges the retrieved data and presents the results to the user. While the system is still very much a work in progress, current validation experiments on simulated NASA Distributed Active Archive Centers (DAACs) have demonstrated that complex queries can be effectively decomposed and retrieved by this approach.
Applying the lessons of the attack on the world trade center, 11th September 2001, to the design and use of interactive evacuation simulations
Authors: C. W. Johnson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

The collapse of buildings, such as terminal 2E at Paris' Charles de Gaule Airport, and of fires, such as the Rhode Island, Station Night Club tragedy, has focused public attention on the safety of large public buildings. Initiatives in the United States and in Europe have led to the development of interactive simulators that model evacuation from these buildings. The tools avoid some of the ethical and legal problems from simulating evacuations; many people were injured during the 1993 evacuation of the World Trade Center (WTC) complex. They also use many concepts that originate within the CHI communities. For instance, some simulators use simple task models to represent the occupants' goal structures as they search for an available exit. However, the recent release of the report from the National Commission on Terrorist Attacks upon the United States (the '9/11 commission') has posed serious questions about the design and use of this particular class of interactive systems. This paper argues that simulation research needs to draw on insights from the CHI communities in order to meet some the challenges identified by the 9/11 commission.
Quotient Graphs for the Analysis of Asymmetric Distributed Systems: Surveying Two Alternative Approaches
Authors: Carlo Bellettini, Lorenzo Capra
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

State-space based techniques represent a powerful analysis tool of discrete-event systems. One way to face the state-space explosion is the exploitation of behavioral symmetries of distributed systems. Well-Formed Coloured Petri Nets (WN) allow the direct construction of a symbolic reachability graph (SRG) that captures symmetries suitably encoded in WN syntax. Most real systems however mix symmetric and asymmetric behaviors. The SRG, and more generally, all those approaches based on a static description of symmetries, have shown not to be effective in such cases. In this paper two quotient graphs are proposed as effective analysis frameworks for asymmetric systems. Both rely on WN syntax extended with relational operators. The first one is an extension of the SRG that exploits local symmetries. The second technique uses linear constraints and substate inclusion in order to aggregate states. An asymmetric distributed leader-election algorithm is used as running example.
Necessary and sufficient conditions on information for causal message ordering and their optimal implementation
Authors: Ajay D. Kshemkalyani, Mukesh Singhal
Venue: Distributed Computing (1998)

This paper formulates necessary and sufficient conditions on the information required for enforcing causal ordering in a distributed system with asynchronous communication. The paper then presents an algorithm for enforcing causal message ordering. The algorithm allows a process to multicast to arbitrary and dynamically changing process groups. We show that the algorithm is optimal in the space complexity of the overhead of control information in both messages and message logs. The algorithm achieves optimality by transmitting the bare minimum causal dependency information specified by the necessity conditions, and using an encoding scheme to represent and transmit this information. We show that, in general, the space complexity of causal message ordering in an asynchronous system is Ω(n2), where n is the number of nodes in the system. Although the upper bound on space complexity of the overhead of control information in the algorithm is O(n2), the overhead is likely to be much smaller on the average, and is always the least possible.
Dyn-MPI: Supporting MPI on Non Dedicated Clusters
Authors: D. Brent Weatherly, David K. Lowenthal, Mario Nakazawa, Franklin Lowenthal
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participating nodes are not dedicated to a parallel application. We are investigating the data distribution problem in non dedicated environments in the context of explicit message-passing programs. To address this problem, we have designed and implemented an extension to MPI called Dynamic MPI (Dyn-MPI). The key component of Dyn-MPI is its run-time system, which efficiently and automatically redistributes data on the fly when there are changes in the application or the underlying environment. Dyn-MPI supports efficient memory allocation, precise measurement of system load and computation time, and node removal. Performance results show that programs that use Dyn-MPI execute efficiently in non dedicated environments, including up to almost a three-fold improvement compared to programs that do not redistribute data and a 25% improvement over standard adaptive load balancing techniques.
Using a genetic algorithm to break Alberti Cipher
Authors: William Servos
Venue: Journal of Computing Sciences in Colleges (2004)

This project was initiated as a continuation of the Morelli, Walde and Servos International Journal on Artificial Intelligence Tools article, "A Study of Heuristic Approaches for Breaking Short Cryptograms," forthcoming in 2004. My study is an investigation into the expanded use of Genetic Algorithms in decryption, particularly with the polyalphabetic Alberti Cipher. The Alberti Cipher was created by Leon Battista Alberti in 1467, and is considered in many ways to be the backbone of modern encryption. Alberti, a Renaissance Man to rival Da Vinci, created the first polyalphabetic cipher. Polyalphabetic ciphers encrypt using more than one alphabet and cannot be solved by letter frequency analysis. So, for a given letter, say 'e' it would be replaced by different letters each occurrence. This differs from simple substitution cipher where a given letter always receives the same substitute, because each consecutive letter in the Alberti cipher is encrypted using a different alphabet than the one proceeding it. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The equivalence of theorem proving and the interconnection problem
Authors: James F. Lynch
Venue: ACM SIGDA Newsletter (1975)

A simple method of converting statements in mathematical logic to equivalent interconnection problems is demonstrated. This shows that if there exists a practical method for solving interconnection problems, then there exists a practical proof procedure for statements in mathematical logic. (In the terminology of Cook [1] and Karp [4], the interconnection problem is NP-complete.) Since such a procedure has been sought for without success for almost 100 years, we should not expect the interconnection problem to be any easier. This holds equally true for finding a method which will route a given percentage of wires.
Supporting Live Development of SOAP and CORBA Servers
Authors: Sajeeva L. Pallemulle, Kenneth J. Goldman, Brandon E. Morgan
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

We present middleware for a Server Development Environment that facilitates live development of SOAP and CORBA servers. As the underlying implementation platform, we use JPie, a tightly integrated programming environment for live software construction of Java applications. JPie provides dynamic classes whose signature and implementation can be modified at run time, with changes taking effect immediately upon existing instances of the class. We extend this model by automating the server deployment process, allowing developers to devote their full attention to the implementation of server logic. Moreover, the live development model enables the construction of server applications while they are running, connected, and communicating with test clients. Combined with our Client Development Environment, these features facilitate the live, simultaneous construction of both the client and server applications.
A quantification of cluster novelty with an application to Martian topography
Authors: Ricardo Vilalta, Tom Stepinski, Muralikrishna Achari, Francisco Ocegueda-Hernandez
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Automated tools for knowledge discovery are frequently invoked in databases where objects already group into some known classification scheme. In the context of unsupervised learning or clustering, such tools delve inside large databases looking for alternative classification schemes that are both meaningful and novel. A quantification of cluster novelty can be looked upon as the degree of separation between each new cluster and its most similar class. Our approach models each cluster and class as a Gaussian distribution and estimates the degree of overlap between both distributions by measuring their intersecting area. Unlike other metrics, our method quantifies the novelty of each cluster individually, and enables us to rank classes according to its similarity to each new cluster. We test our algorithm on Martian landscapes using a set of known classes called geological units; experimental results show a new interpretation for the characterization of Martian landscapes.
Configuring gestures as expressive interactions to navigate multimedia recordings from visits on multiple projections
Authors: Giulio Jacucci, Juha Kela, Johan Plomp
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

The wide availability of digital recording devices leads to investigate how multimedia content can be navigated beyond a desktop computer set up. We present a system and a variety of applications, to navigate multimedia recordings from visits making use of: large multiple projections, location information to organise media and re-experience aspects of visits, physical interfaces as gesture-based interaction and other interfaces that render media more tangible and therefore more readily available. Analysing field trials we discuss the expressiveness and experiential aspects of gesture based interfaces as important features in navigating multimedia in "immersive" environments.
Maran Illustrated Windows XP Guided Tour, Second Edition
Authors: Ruth Maran
Venue:  (2005)

Coverage includes- Features a unique two-pages spread, over 350 full-color, large screen shots, illustrations, helpful introductions, and useful tips that appeal to and engage visual learners and simplify the learning process. Provides extensive coverage of the latest version of Windows, Windows XP, including Windows Security Center, Windows Media Player 10, memory cards, USB flash keys, MP3 players, and DVD players. Using simple, easy-to-understand and concise text, this book covers the essential Windows XP topics for both the Home and Professional versions, making it a great reference for all skill levels. maranGraphics trademark "Diskman" character provides a guided tour of each topic, making even the most challenging subjects fun and approachable. Uses simple, easy-to-understand and concise text and covers over 140 essential topics, making it a great reference for all skill levels. Written using "Visual Grammar," a proven method that combines instructions with full-color screen shots to provide the best synergistic learning experience available.
Education
Authors: Bobby Schnabel
Venue: SIAM Review (2005)

When you think of searching for information on the Web, you probably think of search engines such as Google. But do you think of eigenvectors? You should! Faithful readers of the Education section may recall the connection between information retrieval and numerical linear algebra from the second issue of the Education section, in 1999. In the article "Matrices, Vector Spaces, and Information Retrieval" (volume 41, pp. 335--362), Berry, Drmac, and Jessup described the use of latent semantic analysis, which is based upon the singular value decomposition, for searching document collections. The paper in this issue's Education section, "A Survey of Eigenvector Methods for Web Information Retrieval," extends this topic to the modern world of the Web. As the authors, Amy Langville and Carl Meyer, point out, information retrieval on the Web is significantly more challenging and difficult than information retrieval in a collection of documents, due to the enormous scale of the information space, the critical role of the hyperlink structure of the Web, and the greater fluidity of the space. Their paper summarizes the main approaches that have been taken to ranking Web pages in response to queries in search engines. It shows readily that the two basic approaches both lead to an eigenvector problem that is naturally solved by the power method. In the case of the PageRank method used by Google, this problem can have several billion variables! Fortunately, it does not have to be solved very often. The paper provides examples of the use of many concepts in matrix algebra, including stochastic and irreducible matrices. It also points to various promising areas for additional research. As such, it will be useful both in introductory numerical analysis and numerical linear algebra courses, where its very pleasant style and real-world context should make it popular with students, and in more advanced courses where it will provide a foundation for deeper study. It is fitting that as this paper on information retrieval brings the Education section full circle after six years, leadership of the section is changing hands. By the time this issue is published, the Section Editor role will be in the very capable hands of Professor Andrew Bernoff of Harvey Mudd College. It has been a true pleasure serving as editor of this section, due to the wonderful support of the SIAM staff (thanks particularly to Brian Fauth, Lou Primus, Mitch Chernoff, and Mary Rose Muccie), to a superb editorial board, and, most of all, to the many authors who have contributed their excellent work to SIAM Review. Thanks so much to all of you!
SAFE-OPS: An approach to embedded software security
Authors: Joseph Zambreno, Alok Choudhary, Rahul Simha, Bhagi Narahari, Nasir Memon
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2005)

The new-found ubiquity of embedded processors in consumer and industrial applications brings with it an intensified focus on security, as a strong level of trust in the system software is crucial to their widespread deployment. The growing area of software protection attempts to address the key steps used by hackers in attacking a software system. In this paper, we introduce a unique approach to embedded software protection that utilizes a hardware/software codesign methodology. Results demonstrate that this framework can be the successful basis for the development of embedded applications that meet a wide range of security and performance requirements.
Design and analysis of groupware for large displays
Authors: Elaine M. Huang
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Despite the proliferation of large-scale displays in the workplace, creating groupware applications that take advantage of their potential for collaboration and communication remains challenging. Interactions with large displays yield user experiences that are different from interaction with conventional desktop groupware. Thus, unique hurdles exist for designing large display groupware applications (LDGAs) that are integrated into actual work practice. Our research addresses these challenges through experimental design based on studies of workgroup practices, the formation of a framework of heuristics for LDGA adoption, and its application to the design and analysis of LDGAs.
Low Energy Security Optimization in Embedded Cryptographic Systems
Authors: Catherine H. Gebotys
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

Future embedded and wireless devices will be increasingly powerful supporting many applications including one of the most crucial, security. Although many wireless and embedded devices offer more resistance to bus probing attacks due to their compact size, susceptibility to power/electromagnetic attacks must be analyzed. This paper presents optimized synthesis of new low energy masking countermeasures into cryptographic software. In particular a model for key masking with the objective of minimizing energy overhead is presented. Experimental results using real power measurements are shown to support up to 2.5 energy overhead savings and improved security compared to previous research. With the emergence of security applications in PDAs, cell phones, line card accelerators, etc, optimizing low energy countermeasures for resistance to power/ electromagnetic attacks is crucial for supporting future secure embedded devices.
"A"": A Technique to Improve Perception of Contacts with Under-Actuated Haptic Devices in Virtual Reality
Authors: Anatole Lecuyer, Jean-Marie Burkhardt, Jildaz Le Biller, Marco Congedo
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The objective of this paper is twofold. First, it aims at positioning the performance of under-actuated haptic devices as compared to fully-actuated haptic devices and unactuated devices (i.e. input devices) in virtual reality. Second, it proposes a technique - called "A¿" - to improve the perception of contacts when using an under-actuated haptic device in virtual reality. This technique focuses on point-based haptic exploration. When a contact occurs in the simulation, we suggest to rotate the virtual scene in order to align the contact normal with the direction of the actuated axis (or axes) of the haptic device. With this technique, the virtual scene moves itself automatically to provide a more "realistic" sensation of contact. An experimental evaluation showed first that the performance of under-actuated force-feedback was located between the no-haptic condition (worst performance) and the full-haptic condition (best performance). Second, the use of the A¿ technique decreased strongly the "penetration" inside virtual objects, and thus globally improved the performance of the participants in situation of under-actuation.
Classification of Contour Shapes Using Class Segment Sets
Authors: Kang B. Sun, Boaz J. Super
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Both example-based and model-based approaches for classifying contour shapes can encounter difficulties when dealing with classes that have large nonlinear variability, especially when the variability is structural or due to articulation. This paper proposes a part-based approach to address this problem. Bayesian classification is performed within a three-level framework which consists of models for contour segments, for classes, and for the entire database of training examples. The class model enables different parts of different exemplars of a class to contribute to the recognition of an input shape. The method is robust to occlusion and is invariant to planar rotation, translation, and scaling. Furthermore, the method is completely automated. It achieves 98% classification accuracy on a large database with many classes.
PRC Inc.: description of the PAKTUS system used for MUC-3
Authors: Bruce Loatman
Venue: Proceedings of the 3rd conference on Message understanding (1991)

The PRC Adaptive Knowledge-based Text Understanding System (PAKTUS) has been under development as an Independent Research and Development project at PRC since 1984. The objective is a generic system of tools, including a core English lexicon, grammar, and concept representations, for building natural language processing (NLP) systems for text understanding. Systems built with PAKTUS are intended to generate input to knowledge based systems or data base systems. Input to the NLP system is typically derived from an existing electronic message stream, such as a news wire. PAKTUS supports the adaptation of the generic core to a variety of domains: JINTACCS messages, RAINFORM messages, news reports about a specific type of event, such as financial transfers or terrorist acts, etc., by acquiring sublanguage and domain-specific grammar, words, conceptual mappings, and discourse patterns. The long-term goal is a system that can support the processing of relatively long discourses in domains that are fairly broad with a high rate of success.
What makes users unhappy: share-point team services web server security
Authors: Avi Rushinek, Sara Rushinek
Venue: Ubiquity (2005)

Computer & Internet Security is very important but sometimes it is so confusing and frustrating that it makes users very unhappy to a point where the system is so secure that it cannot be used by its most legitimate users, like system administrators
Explicit and Averaging A Posteriori Error Estimates for Adaptive Finite Volume Methods
Authors: C. Carstensen, R. Lazarov, S. Tomov
Venue: SIAM Journal on Numerical Analysis (2004)

Local mesh-refining algorithms known from adaptive finite element methods are adopted for locally conservative and monotone finite volume discretizations of boundary value problems for steady-state convection-diffusion-reaction equations. The paper establishes residual-type explicit error estimators and averaging techniques for a posteriori finite volume error control with and without upwind in global H1- and L2-norms. Reliability and efficiency are verified theoretically and confirmed empirically with experimental support for the superiority of the suggested adaptive mesh-refining algorithms over uniform mesh refining. A discussion of adaptive computations in the simulation of contaminant concentration in a nonhomogeneous water reservoir concludes the paper.