ppxscal/embedding_network huggingface dataset:
Parallel netCDF: A High-Performance Scientific I/O Interface
Authors: Jianwei Li, Wei-keng Liao, Alok Choudhary, Robert Ross, Rajeev Thakur, William Gropp, Rob Latham, Andrew Siegel, Brad Gallagher, Michael Zingale
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Dataset storage, exchange, and access play a critical role in scientific applications. For such purposes netCDF serves as a portable, efficient file format and programming interface, which is popular in numerous scientific application domains. However, the original interface does not provide an efficient mechanism for parallel data storage and access. In this work, we present a new parallel interface for writing and reading netCDF datasets. This interface is derived with minimal changes from the serial netCDF interface but defines semantics for parallel access and is tailored for high performance. The underlying parallel I/O is achieved through MPI-IO, allowing for substantial performance gains through the use of collective I/O optimizations. We compare the implementation strategies and performance with HDF5. Our tests indicate programming convenience and significant I/O performance improvement with this parallel netCDF (PnetCDF) interface.
Algebraic equivalences of nested relational operators
Authors: Hong-Cheu Liu, Jeffery X. Yu
Venue: Information Systems (2005)

Algebraic optimisation is both theoretically and practically important for query processing in complex value databases. In this paper, we consider this issue and investigate some algebraic properties concerning the nested relational operators.The join operation is one of the most time-consuming operations in nested relational query processing. We introduce a new join operator, called P-join, which combines the advantages of Roth's extended natural join and Colby's recursive join for efficient data access. We also investigate some algebraic properties concerning the P-join operator and extended relational operators, which can be used for query optimisation in nested relational databases.We then examine the role of the restructuring operators nest and unnest in their interactions with the extended relational operators proposed by Roth et al. Under certain functional and mutual data dependencies, the six nested relational equations will hold.Finally, we outline the steps of a heuristic optimisation algorithm that utilises algebraic transformation rules developed in this paper and previous related work to transform an initial query to an optimised one that is more efficient to execute.
A Study of Tunnel Vision and Rotation as Aspects of Web Site Visibility
Authors: Rami N. Hasan, M. H. Samadzadeh
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Due to the important role the Internet is playing in today's world, it is essential to understand the different aspects of Web sites and their visibility concerns. The tunnel vision phenomenon, which occurs when Web site users get too familiar with the content and layout of frequently visited Web sites, is one of the main visibility concerns facing information delivery and knowledge exchange through Web sites. Studying the evolution of this phenomenon and the different techniques used to avoid it, is essential in finding ways to enhance Web site visibility. The notion of rotation can be applied to a Web site's components to enhance the visibility of information published on that Web site. Applying rotation to Web sites' components as a technique to enhance visibility was the focus of this study. In order to study the different aspects and the impact of rotation, an experiment was designed and carried out using a Web site. A survey that asked Internet users about different surfing habits and Web site browsing preferences was conducted in order to help study the different aspects of Web site visibility. In order to satisfy the requirement of enhancing Web site visibility, a number of rotation aspects and factors were determined and applied to the Web site used for the experiment.
Concurrent general composition of secure protocols in the timing model
Authors: Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

In the setting of secure multiparty computation, a set of mutually distrustful parties wish to jointly compute some function of their input (i.e., they wish to securely carry out some distributed task). %The joint computation should be such that even In the stand-alone case, it has been shown that every efficient function can be securely computed. However, in the setting of concurrent composition, broad impossibility results have been proven for the case where there is no honest majority (or trusted setup).In this paper, we investigate the feasibility of obtaining secure multiparty protocols in a network where certain time bounds are assumed. Specifically, the security of our protocols rely on the very reasonable assumption that local clocks do not "drift" too much (i.e., it is assumed that they proceed at approximately the same rate). We show that under this mild timing assumption, it is possible to securely compute any functionality under concurrent general composition (as long as messages from the arbitrary other protocols are delayed for a specified amount of time).
Signing individual fragments of an RDF graph
Authors: Giovanni Tummarello, Christian Morbidoni, Paolo Puliti, Francesco Piazza
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statements. Groups of statements signed with this methodology can be safely inserted into any existing triple store without the loss of provenance information since only standard RDF semantics and constructs are used. This methodology has been implemented and is both available as open source library and deployed in a SW P2P project.
The war room command console: shared visualizations for inclusive team coordination
Authors: Ciaran O'Reilly, David Bustard, Philip Morrow
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

Making the structure of software visible during system development helps (i) build a shared understanding of the context for each piece of work, (ii) identify progress with implementation, and (iii) highlight any conflict between individual development activities. Finding an adequate representation for such information is not straightforward, especially for large applications. This paper describes an implementation of such a visualization system designed to explore some of the issues involved. The approach is based on a `War Room Command Console' metaphor and uses a bank of eight linked consoles to present information. The tool was applied to several industrial software systems written in a mixture of Java, C++ and C, one of which was over a million lines of code in size.
Programming and coordinating Grid environments and applications: Research Articles
Authors: Cristina Ururahy, Noemi Rodriguez
Venue: Concurrency and Computation: Practice Experience (2004)

The heterogeneous and dynamic nature of Grid environments place new demands on models and paradigms for parallel programming. In this work we discuss how ALua, a programming system based on a dual programming language model, can help the programmer to develop applications for this environment, monitoring the state of resources and controlling the application so that it adapts to changes in this state. Copyright &copy; 2004 John Wiley & Sons, Ltd.
DBMS[me]
Authors: Craig W. Thompson, Patrick Parkerson
Venue: IEEE Internet Computing (2004)

This issue's column is about time and the deluge of data that we can expect to collect and view ý from the perspective of a subproblem, a database management system that records a person's life in its entirety ý referred to here as DBMS[me] and E-me (that is, a database of me or an electronic model of me).
Numerical analysis on magnetic levitation of liquid metals, using a spectral finite difference scheme
Authors: Kichang Im, Yoshihiro Mochimaru
Venue: Journal of Computational Physics (2005)

A spectral finite difference method is applied to analysis on magnetic levitation as a major unsteady-state problem in magnetohydrodynamics. Vorticity-stream function formulation is introduced in conjunction with Maxwell's equations, and the non-linear term of Ohm's law for a liquid metal is included. For the purpose of analysis treated is a liquid metal occupying a volume such that no shear stresses and no normal velocity components on the free surface are used as dynamic boundary conditions. Externally applied electromagnetic fields consist of no electromagnetic field at infinity and fields produced by circular coils placed horizontally near the liquid metal. Presented are lift force, magnetic fields and flow fields for several parameters. Numerical data for high viscosity on dimensionless force with the dimensionless vertical coil position are qualitatively in good agreement with experimental data for a solid metal [J. Appl. Phys. 23 (1952) 545]. The effects of the Reynolds number, the Strouhal number and the number of the external coil(s) on levitation force, the magnetic field and the flow field are clarified.
Mobile Moods: regulating emotions through color theory on mobile devices
Authors: Sara Czyzewicz
Venue: Journal of Computing Sciences in Colleges (2005)

Mobile technologies have been expanding their role as communication devices with developments such as multimedia messaging (MMS) and hardware sensors. More recent developments focus on relating to users on an emotional level, such as with the context-aware phone, SenSay, which blocks calls if the user is in a coversation, and Seimens, first multimedia handset that allows consumers to express their feelings to others via MMS with 3D-animated emotional characters.
Bacterial identification: algorithms for choosing primers for PCR reactions
Authors: Kamun Chan
Venue: Journal of Computing Sciences in Colleges (2005)

The advent of the polymerase chain reaction (PCR) has transformed the field of molecular biology and allowed scientists to make DNA amplification a routine process. The PCR reaction is particularly useful in classifying and identifying bacterial species and strains. This is specifically true in epidemiology and ecology where identification and classification of bacteria are usually carried out by phenotypic and genotypic methods. Recently, Sales (Bard Senior Project, 2003) proposed a new approach in order to try to distinguish between bacterial species by identifying divergence on a genomic level.
Efficient trajectory joins using symbolic representations
Authors: Petko Bakalov, Marios Hadjieleftheriou, Eamonn Keogh, Vassilis J. Tsotras
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Efficiently and accurately discovering similarities among moving object trajectories is a difficult problem that appears in many spatiotemporal applications. In this paper we consider how to efficiently evaluate trajectory joins, i.e., how to identify all pairs of similar trajectories between two datasets. Our approach represents an object trajectory as a sequence of symbols (i.e., a string). Based on special lower-bounding distances between two strings, we propose a pruning heuristic for reducing the number of trajectory pairs that need to be examined. Furthermore, we present an indexing scheme designed to support efficient evaluation of string similarities in secondary storage. Through a comprehensive experimental evaluation we present the advantages of the proposed techniques.
Breaking the laws of action in the user interface
Authors: Per-Ola Kristensson
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Fitts' law, Steering law and Law of crossing, collectively known as the laws of action, model the speed-accuracy trade-offs in common hci tasks. These laws impose a certain speed ceiling on precise actions in a user interface. My hypothesis is that for some interfaces, the constraints of these laws can be relaxed by using context information of the task. To support this thesis, I present two systems I have developed for pen-based text input on stylus keyboards. These systems break either Fitts' law or the Law of crossing by taking advantage of high-resolution information from the pen, and the fact that words can be seen as patterns traced on the keyboard. Using these systems users can potentially gain higher text entry speed than on a regular stylus keyboard that is limited by the laws of action. I conclude by discussing planned future research, primarily improved visual feedback and empirical evaluation.
Wireless Internet Payment System Using Smart Cards
Authors: Osama Dandash, Xianping Wu, Phu Dung Le
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Advancements in the wireless technology have given rise to various payment methods and protocols. The recent, and probably latest KSL Protocol has been implemented for mobile credit card payments. This paper proposes a Smart Card based Wireless Internet Payment System which is derived from KSL Protocol. A client using a Wireless Smart Card can perform transactions over a wireless LAN which is connected to the Internet via a wired network.
Book review: Representations of Commonsense Knowledge by Ernest Davis Morgan (Kaufmann Publishers, 1990)
Venue: ACM SIGART Bulletin (1992)

A good definition of what constitutes common sense is very difficult to arrive at. The connotation given to this word in this book seems to be:the vast body of knowledge all of us possess regarding entities like space, time, quantities, qualities, flows, chemicals, biological beings, goals, plans, needs, beliefs, intentions, actions, interpersonal relations etc., the complex interactions between them, and our innate ability to do different styles of subtle reasoning with these entities.
The maximum-leaf spanning tree problem: Formulations and facets
Venue: Networks (2004)

The Maximum Leaf Spanning Tree Problem &lpar;MLSTP&rpar; is to find a spanning tree in a given undirected graph, whose number of leaves &lpar;vertices of degree 1&rpar; is maximum. In this article, we consider an integer programming approach to the MLSTP. We provide two formulations of the MLSTP and study the facial structure of polytopes arising from the formulations. Moreover, several relaxation problems are compared. &copy; 2004 Wiley Periodicals, Inc.
TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets
Authors: Jianyong Wang Jiawei Han
Venue: IEEE Transactions on Knowledge and Data Engineering (2005)

Frequent itemset mining has been studied extensively in literature. Most previous studies require the specification of a min_support threshold and aim at mining a complete set of frequent itemsets satisfying min_support. However, in practice, it is difficult for users to provide an appropriate min_support threshold. In addition, a complete set of frequent itemsets is much less compact than a set of frequent closed itemsets. In this paper, we propose an alternative mining task: mining top-k frequent closed itemsets of length no less than min_l, where k is the desired number of frequent closed itemsets to be mined, and min_l is the minimal length of each itemset. An efficient algorithm, called TFP, is developed for mining such itemsets without mins_support. Starting at min_support = 0 and by making use of the length constraint and the properties of top-k frequent closed itemsets, min_support can be raised effectively and FP-Tree can be pruned dynamically both during and after the construction of the tree using our two proposed methods: the closed node count and descendant_sum. Moreover, mining is further speeded up by employing a top-down and bottom-up combined FP-Tree traversing strategy, a set of search space pruning methods, a fast 2-level hash-indexed result tree, and a novel closed itemset verification scheme. Our extensive performance study shows that TFP has high performance and linear scalability in terms of the database size.
Using roles in Java
Authors: Michael Schrefl, Thomas Thalhammer
Venue: Software&mdash;Practice Experience (2004)

Using roles in object-oriented design leads to a more natural representation of a given problem domain. Despite a lot of research into role&ndash;based systems, there is still a gap between conceptual representations of roles and the usage of roles in strongly typed object-oriented programming languages such as C&plus;&plus; or Java. Since these languages associate classes and their instances exclusively and permanently, representing evolving objects that may take on different roles over time is difficult without special support: &lpar;i&rpar; entities must be reclassified any time they evolve and &lpar;ii&rpar; class hierarchies may grow exponentially if entities may take on several independent roles.This article shows how role hierarchies can be easily implemented in Java. It introduces the Java Role Package, which provides a set of classes to support handling of evolving objects without modifying the semantics of Java itself. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Random cubic graphs are not homomorphic to the cycle of size 7
Authors: Hamed Hatami
Venue: Journal of Combinatorial Theory Series B (2005)

We prove that a random cubic graph almost surely is not homomorphic to a cycle of size 7. This implies that there exist cubic graphs of arbitrarily high girth with no homomorphisms to the cycle of size 7.
A visual language for algorithm knowledge representation
Authors: Irina Zheliazkova, Galina Atanasova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Task-oriented design environments (TODEs) are an alternative of domain-oriented environments that support both self-directed learning and individualized planned teaching. One of the key problems of the design and implementation a TODE for algorithms is definition of a visual language for algorithm knowledge representation. The paper presents an exhaustive definition of such a language.
Trees, automata and XML
Authors: Thomas Schwentick
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Formal languages play an important role for many aspects of XML processing. This is obvious for type specifications (as DTD) which use context-free grammars and for navigation in documents (as in XPath) which is based on regular expressions. But the investigation of query, typing, navigation and transformation languages for XML has used many more concepts from Formal Language Theory, in particular many different kinds of string and tree automata.The close connection between automata and logics helps to allow a declarative specification of queries and transformations that can be evaluated or performed by tree automata. This connection also facilitates the investigation of the expressive power of query and transformation languages. Furthermore, in many cases automata characterizations enable static analysis like containment and satisfiability tests for queries or type checking for transformations.The tutorial will give a gentle introduction into the connections between XML languages and various kinds of automata and it will survey some classical and recent results in this area.
Ontology-based interactive information extraction from scientific abstracts: Conference Papers
Authors: David Milward, Marcus Bjäreland, William Hayes, Michelle Maxwell, Lisa Öberg, Nick Tilford, James Thomas, Roger Hale, Sylvia Knight, Julie Barnes
Venue: Comparative and Functional Genomics (2005)

Over recent years, there has been a growing interest in extracting information automatically or semi-automatically from the scientific literature. This paper describes a novel ontology-based interactive information extraction (OBIIE) framework and a specific OBIIE system. We describe how this system enables life scientists to make ad hoc queries similar to using a standard search engine, but where the results are obtained in a database format similar to a pre-programmed information extraction engine. We present a case study in which the system was evaluated for extracting co-factors from EMBASE and MEDLINE. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Book review: EXCEL TIPS, TRICKS, AND TRAPS by Ron Person (Que, 1989)
Venue: ACM SIGSMALL/PC Notes (1990)

This "dictionary" for Excel users provides numerous examples of what the title promises. It assumes that the reader has at least a modest familiarity with the Microsoft Excel spreadsheet program; it will be of little interest to any others. The book is, essentially, a compendium of the kind of tips often found in the user-to-user and help columns in PC-oriented magazines. 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
Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A)
Venue: ACM International Conference Proceeding Series; Vol. 88 (2005)

Previous engineering approaches seem to have precluded the engineering of accessible systems. This is plainly unsatisfactory. Designers, authors, and technologist are at present playing 'catch-up' with a continually moving target in an attempt to retrofit systems. In-fact engineering accessible interfaces is as important as their functionality's and should be an indivisible part of the development. We should be engineering accessibility as part of the development and not as afterthought or because government restrictions and civil law requires us to. These proceedings bring together a cross section of the web design and engineering communities. The papers included here report on developments, discuss the issues, and suggest cross-pollinated solutions.Conventional workshops on accessibility tend to be single disciplinary in nature. However, we are concerned that this focus on a single participant group prevents the cross-pollination of ideas, needs, and technologies from other related but separate fields. As with the first, this second workshop is decidedly cross disciplinary in nature and brings together users, accessibility experts, graphic designers, and technologists from academia and industry to discuss how accessibility can be supported. We also encourage the participation of users and other interested parties as an additional balance to the discussion. Our aim is to focus on accessibility by encouraging participation from many disciplines. Views often bridge academia, commerce, and industry and arguments encompass a range of beliefs across the designaccessibility spectrum.
Notes on linear systems and frequency responses: Research Articles
Authors: Irwin W. Sandberg
Venue: International Journal of Circuit Theory and Applications (2005)

We show that not all continuous multidimensional linear shift-invariant systems are characterized by their frequency responses (even when they exist), but that the members of a certain important large family of multidimensional linear systems are completely characterized by their suitably defined frequency responses. Copyright &copy; 2005 John Wiley & Sons, Ltd.