ppxscal/embedding_network huggingface dataset:
Using metadata for developing automated Web system interface
Authors: Abdualrraouf A. Elbibas, M. J. Ridley
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

In this paper we look into implementing a web interface design for applications that have a database element, we look at how and to what extent we can use information (Metadata) held in system catalog tables in databases to produce a better and automated Web interface that can easily accommodate changes in the underlying data model by altering those tables, rather than requiring changes to the interface code. We use Java and particularly Java Database Connectivity (JDBC), which provides a very general method for addressing databases and also includes Metadata features.
Quality Meshing with Weighted Delaunay Refinement
Authors: Siu-Wing Cheng, Tamal K. Dey
Venue: SIAM Journal on Computing (2004)

Delaunay meshes with bounded circumradius to shortest edge length ratio have been proposed in the past for quality meshing. The only poor quality tetrahedra, called slivers, that can occur in such a mesh can be eliminated by the sliver exudation method. This method has been shown to work for periodic point sets, but not with boundaries. Recently a randomized point-placement strategy has been proposed to remove slivers while conforming to a given boundary. In this paper we present a deterministic algorithm for generating a weighted Delaunay mesh which respects the input boundary and has no poor quality tetrahedron including slivers. As in previous work, we assume that no input angle is acute. Our result is achieved by combining the weight pumping method for sliver exudation and the Delaunay refinement method for boundary conformation.
Online duplicate document detection: signature reliability in a dynamic retrieval environment
Authors: Jack G. Conrad, Xi S. Guo, Cindy P. Schriber
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

As online document collections continue to expand, both on the Web and in proprietary environments, the need for duplicate detection becomes more critical. Few users wish to retrieve search results consisting of sets of duplicate documents, whether identical duplicates or close matches. Our goal in this work is to investigate the phenomenon and determine one or more approaches that minimize its impact on search results. Recent work has focused on using some form of signature to characterize a document in order to reduce the complexity of document comparisons. A representative technique constructs a 'fingerprint' of the rarest or richest features in a document using collection statistics as criteria for feature selection. One of the challenges of this approach, however, arises from the fact that in production environments, collections of documents are always changing, with new documents, or new versions of documents, arriving frequently, and other documents periodically removed. When an enterprise proceeds to freeze a training collection in order to stabilize the underlying repository of such features and its associated collection statistics, issues of coverage and completeness arise. We show that even with very large training collections possessing extremely high feature correlations before and after updates, underlying fingerprints remain sensitive to subtle changes. We explore alternative solutions that benefit from the development of massive meta-collections made up of sizable components from multiple domains. This technique appears to offer a practical foundation for fingerprint stability. We also consider mechanisms for updating training collections while mitigating signature instability. Our research is divided into three parts. We begin with a study of the distribution of duplicate types in two broad-ranging news collections consisting of approximately 50 million documents. We then examine the utility of document signatures in addressing identical or nearly identical duplicate documents and their sensitivity to collection updates. Finally, we investigate a flexible method of characterizing and comparing documents in order to permit the identification of non-identical duplicates. This method has produced promising results following an extensive evaluation using a production-based test collection created by domain experts.
The best simple code generation technique for WHILE, FOR, and DO loops
Authors: Forest Baskett
Venue: ACM SIGPLAN Notices (1978)

This code generation technique for WHILE, FOR, and DO loops is simple to implement and usually results in the best loop code in the absence of flow analysis. Also the technique makes it possible to move code from inner loops without doing flow analysis and without ever moving code from a less frequently executed block to a more frequently executed block.
PSOS Revisited
Authors: Peter G. Neumann, Richard J. Feiertag
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

This paper provides a retrospective view of the designof SRI's Provably Secure Operating System (PSOS), a formallyspecified tagged-capability hierarchical system architecture.It examines PSOS in the light of what has happenedin computer system developments since 1980, andassesses the relevance of the PSOS concepts in that light.
Document replication and distribution in extensible geographically distributed web servers
Authors: Ling Zhuo, Cho-Li Wang, Francis C. M. Lau
Venue: Journal of Parallel and Distributed Computing (2003)

A geographically distributed web server (GDWS) system consists of multiple server nodes interconnected by a metropolitan area network (MAN) or a wide area network (WAN). It can achieve better efficiency in handling ever-increasing web requests than centralized web servers because its throughput will not be limited by available bandwidth connecting to a central server. The key research issue in the design of GDWS is how to replicate and distribute the documents of a website among the server nodes. This paper proposes a density-based replication scheme and applies it to our proposed Extensible GDWS architecture. We adopted a partial duplication scheme where document replication targets only at hot objects in a website. To distribute the replicas generated via the density-based replication scheme, we propose four different document distribution algorithms: Greedy-cost, Maximal-density, Greedy-penalty, and Proximity-aware. A proximity-based routing mechanism is designed to incorporate these algorithms for achieving better web server performance in a WAN environment. Simulation results show that the Greedy-penalty algorithm yields most stable load-balancing performance, and the Greedy-cost algorithm causes least internal traffic. Our scheme can achieve 80% of the performance of full-replication, with half the disk space.
Enabling distributed QoS management utilizing active network technology
Authors: Stavros Vrontis, Irene Sygkouna, Maria Chantzara, Eystathios Sykas
Venue: Network control and engineering for Qos, security and mobility II (2003)

This paper deals with the QoS management issue utilizing the active network technology. The disadvantages of the centralized network management are presented and the current solutions for distributed network management are discussed. The proposed architecture focuses on the QoS management for DiffServ architecture. The improvements that our architecture offers are presented through a service example, which involves QoS configurations.
Optimization techniques for multiple output function synthesis
Authors: G. Buonanno, D. Sciuto, R. Stefanelli
Venue: Proceedings of the conference on European design automation (1991)

Design of multiple outputs CMOS combinational gates is considered. Two techniques for minimization of multiple output functions at the switching level are introduced. These techniques are based on innovative transistor interconnection structures named Delta and Lambda networks. A branch and bound algorithm to be used for complex gate synthesis is presented. Design examples are also provided. It is shown that the two techniques can be combined together, if necessary, to obtain further area reductions.
Correspondence Matching with Modal Clusters
Authors: Marco Carcassoni, Edwin R. Hancock
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Abstract--The modal correspondence method of Shapiro and Brady aims to match point-sets by comparing the eigenvectors of a pairwise point proximity matrix. Although elegant by means of its matrix representation, the method is notoriously susceptible to differences in the relational structure of the point-sets under consideration. In this paper, we demonstrate how the method can be rendered robust to structural differences by adopting a hierarchical approach. To do this, we place the modal matching problem in a probabilistic setting in which the correspondences between pairwise clusters can be used to constrain the individual point correspondences. We demonstrate the utility of the method on a number of synthetic and real-world point-pattern matching problems.
Parallel genehunter: implementation of a linkage analysis package for distributed-memory architectures
Authors: Gavin C. Conant, Steven J. Plimpton, William Old, Andreas Wagner, Pamela R. Fain, Theresa R. Pacheco, Grant Heffelfinger
Venue: Journal of Parallel and Distributed Computing (2003)

We present a parallel algorithm for performing multipoint linkage analysis of genetic marker data on large family pedigrees. The algorithm effectively distributes both the computation and memory requirements of the analysis. We discuss an implementation of the algorithm in the Genehunter linkage analysis package (version 2.1), enabling Genehunter to run on distributed-memory platforms for the first time. Our preliminary benchmarks indicate reasonable scalability of the algorithm even for fixed-size problems, with parallel efficiencies of 75% or more on up to 128 processors. In addition, we have extended the hard-coded limit of 16 non-founding individuals in Genehunter 2.1 to a new limit of 32 non-founding individuals.
List Improper Colourings of Planar Graphs
Authors: R. Škrekovski
Venue: Combinatorics, Probability and Computing (1999)

A graph G is m-choosable with impropriety d, or simply (m, d)&#x002A;-choosable, if for every list assignment L, where &#x2223;L(v)&#x2223;&ge;m for every v&isin;V(G), there exists an L-colouring of G such that each vertex of G has at most d neighbours coloured with the same colour as itself. We show that every planar graph is (3, 2)&#x002A;-choosable and every outerplanar graph is (2, 2)&#x002A;-choosable. We also propose some interesting problems about this colouring.
A cartesian grid method for modeling multiple moving objects in 2D incompressible viscous flow
Authors: David Russell, Z. Jane Wang
Venue: Journal of Computational Physics (2003)

We present an efficient method for solving 2D incompressible viscous flows around multiple moving objects. Our method employs an underlying regular Cartesian grid to solve the system using a streamfunction-vorticity formulation and with discontinuities representing the embedded objects. The no-penentration condition for the moving geometry is satisfied by superposing a homogenous solution to the Poisson's equation for the streamfunction. The no-slip condition is satisfied by generating vorticity on the surfaces of the objects. Both the initial Poisson solution and the evaluation of the homogenous solution require embedding irregular discontinuities in a fast Poisson solver. Computation time is dictated by the time required to do a fast Poisson solution plus solve an integral form of Laplace's equation. There is no significant increase in computational cost if the geometry of the embedded objects is variable and moving relative to the underlying grid. We test the method against the canonical example of flow past a cylinder, and obtained new results on the flow and forces of two cylinders moving relative to each other.
Blender as an educational tool
Authors: Jason van Gumster
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

With the ubiquity of technology increasing, teaching artists has become more multifaceted. Art students are typically taught to think very openly and conceptually. While extremely beneficial, a problem arises when graduating artists have no developed means of analytical problem solving, putting them at a disadvantage when dealing with the technology they use to create their art. It is critical that computing courses that include programming be introduced early in an art student's career, exposing them to the knowledge of how their tools work. A solution to this is to use the open source 3D modeling and animation suite, Blender, and its integration with the Python scripting language as a means of teaching this valueable way of thinking to artists. 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
Spam filters: bayes vs. chi-squared; letters vs. words
Authors: Cormac O'Brien, Carl Vogel
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

We compare two statistical methods for identifying spam or junk electronic mail. Spam filters are classifiers which determine whether an email is junk or not. The proliferation of spam email has made electronic filtering vitally important. The magnitude of the problem is discussed. We examine the Naive Bayesian method in relation to the 'Chi by degrees of Freedom' approach, the latter used in the field of authorship identification. Both methods produce very promising results. However, the 'Chi by degrees of Freedom' has the advantage of providing significance measures, which will help to reduce false positives. Statistics based on character-level tokenization proves more effective than word-level.
Social network fragments: an interactive tool for exploring digital social connections
Authors: Danah Boyd, Jeffrey Potter
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

We present a novel application for interactively visualizing the interpersonal networks that emerge during email interactions. While people have complex email interrelationships, no previous tools allow examining one's overall network.
The Determination of the Chain Good Weight Hierarchies with High Dimension
Authors: Yuan Luo, Wende Chen, A. J. Han Vinck
Venue: SIAM Journal on Discrete Mathematics (2004)

There are a large number of linear block codes satisfying the chain condition. Their weight hierarchies are called chain good and form an important group in classifying all possible weight hierarchies. In this paper, we present a series of new sufficient conditions to determine which kinds of sequences are chain good weight hierarchies. Our results are efficient for the determination of the chain good weight hierarchies with high dimension.
Semantic analysis for a speech user interface in an intelligent tutoring system
Authors: Yuexi Ren, Mark Hasegawa-Johnson, Stephen E. Levinson
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

In this paper, we describe the strategy of semantic analysis for a speech user interface that is designed for a multimodal intelligent tutoring system. The semantic analysis involves three phases: semantic parsing, salient words/phrases spotting, and accented word detection. Semantic parsing attempts to represent the recognized sentence with a well-formed semantic frame. The recognized sentence consists of the a posterior most probably hypothesized words given the acoustic evidence, and is compliant with the grammatical knowledge that is represented by a semantic language model. The salient words/phrases are useful when semantic parsing fails. The accented words are useful when the user response is out of our expectations, and assist to make the computer agent smarter and smarter.
Mutual disambiguation of 3D multimodal interaction in augmented and virtual reality
Authors: Ed Kaiser, Alex Olwal, David McGee, Hrvoje Benko, Andrea Corradini, Xiaoguang Li, Phil Cohen, Steven Feiner
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

We describe an approach to 3D multimodal interaction in immersive augmented and virtual reality environments that accounts for the uncertain nature of the information sources. The resulting multimodal system fuses symbolic and statistical information from a set of 3D gesture, spoken language, and referential agents. The referential agents employ visible or invisible volumes that can be attached to 3D trackers in the environment, and which use a time-stamped history of the objects that intersect them to derive statistics for ranking potential referents. We discuss the means by which the system supports mutual disambiguation of these modalities and information sources, and show through a user study how mutual disambiguation accounts for over 45% of the successful 3D multimodal interpretations. An accompanying video demonstrates the system in action.
Interleaving media data for MPEG-4 presentations
Authors: Jeff Boston, Michelle Kim, William Luken, Edward So, Steve Wood
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

A composite multimedia presentation may be represented by a sequence of virtual media data packets. An algorithm is presented for ordering these virtual media data packets so as to minimize the initial delay required to transfer the composite stream from a media server to a client. This algorithm has been implemented as part of the IBM Toolkit for MPEG-4.
An Economy-based Accounting Infrastructure for the DataGrid
Authors: Rosario M. Piro, Andrea Guarise, Albert Werbrouck
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

A distributed grid computing environment, like the EuropeanDataGrid (EDG), that manages enormous numbersof computing resources (in terms of processing power, diskspace, memory usage, etc.) and astronomical amounts ofscientific data, requires mechanisms for a balanced accessof many thousands of simultaneous users. The DataGrid AccountingSystem (DGAS), that we present in this paper, isdesigned to support an economy-based approach to regulatingthe distribution of the resources among the authorizedGrid users. We describe two possible models for resourcepricing and a utility function for economic brokering.
A concepts-first introduction to computer science
Authors: Kenneth J. Goldman
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

We present a unique "concepts-first" curriculum that exposes students without programming experience to the intellectual depth and breadth of computer science through hands-on experience with software development. The curriculum is supported by JPie, a tightly integrated programming environment that enables live construction of Java applications through direct manipulation of graphical representations of programming abstractions. The curriculum, projects, and classroom experience are described.
A study on program level dependency of implemented algorithms on its potential operands
Authors: S. K. Bandyopadhyay
Venue: ACM SIGPLAN Notices (1981)

The concept of program level in the implementation of algorithm using any programming language gives its measure ranging between &le;1 and > 0. Program level tends towards the higher value when higher level language is used. It is argued that for general purpose computer applications no high level programming language can really achieve program level 'one'. The paper describes an analytical method of determining the value of program level when any algorithm is implemented using a set of permitted vocabulary. The study reveals that there is a maximum limit of program level which is functionally dependent on the potential operands of the algorithm. The value of maximum program level that can be obtained out of a programming language is found to be inversely related to the potential operands of the algorithm. Existence of high negative correlation coefficient between potential operands and program level obtained from the experimental data further supports the inverse relationship.
Discovery of climate indices using clustering
Authors: Michael Steinbach, Pang-Ning Tan, Vipin Kumar, Steven Klooster, Christopher Potter
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

To analyze the effect of the oceans and atmosphere on land climate, Earth Scientists have developed climate indices, which are time series that summarize the behavior of selected regions of the Earth's oceans and atmosphere. In the past, Earth scientists have used observation and, more recently, eigenvalue analysis techniques, such as principal components analysis (PCA) and singular value decomposition (SVD), to discover climate indices. However, eigenvalue techniques are only useful for finding a few of the strongest signals. Furthermore, they impose a condition that all discovered signals must be orthogonal to each other, making it difficult to attach a physical interpretation to them. This paper presents an alternative clustering-based methodology for the discovery of climate indices that overcomes these limitiations and is based on clusters that represent regions with relatively homogeneous behavior. The centroids of these clusters are time series that summarize the behavior of the ocean or atmosphere in those regions. Some of these centroids correspond to known climate indices and provide a validation of our methodology; other centroids are variants of known indices that may provide better predictive power for some land areas; and still other indices may represent potentially new Earth science phenomena. Finally, we show that cluster based indices generally outperform SVD derived indices, both in terms of area weighted correlation and direct correlation with the known indices.
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
Authors: Fabián A. Chudak, David B. Shmoys
Venue: SIAM Journal on Computing (2004)

We consider the uncapacitated facility location problem. In this problem, there is a set of locations at which facilities can be built; a fixed cost fi is incurred if a facility is opened at location i. Furthermore, there is a set of demand locations to be serviced by the opened facilities; if the demand location j is assigned to a facility at location i, then there is an associated service cost proportional to the distance between i and j, cij. The objective is to determine which facilities to open and an assignment of demand points to the opened facilities, so as to minimize the total cost. We assume that the distance function c is symmetric and satisfies the triangle inequality. For this problem we obtain a (1+2/e)-approximation algorithm, where $1+2/e \approx 1.736$, which is a significant improvement on the previously known approximation guarantees.The algorithm works by rounding an optimal fractional solution to a linear programming relaxation. Our techniques use properties of optimal solutions to the linear program, randomized rounding, as well as a generalization of the decomposition techniques of Shmoys, Tardos, and Aardal [Proceedings of the 29th ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 265--274].