ppxscal/embedding_network huggingface dataset:
New and improved constructions of non-malleable cryptographic protocols
Authors: Rafael Pass, Alon Rosen
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitments. Our constructions rely on the existence of (standard) collision resistant hash functions. Previous constructions either relied on the existence of trapdoor permutations and hash functions that are collision resistant against sub-exponential sized circuits, or required a super-constant number of rounds.Additional results are the first construction of a non-malleable commitment scheme that is statistically hiding (with respect to opening), and the first non-malleable protocols that satisfy a strict polynomial-time simulation requirement. The latter are constructed by additionally assuming the existence of trapdoor permutations.Our approach differs from the approaches taken in previous works in that we view non-malleable zero-knowledge as a building-block rather than an end goal. This gives rise to a modular construction of non-malleable commitments and results in a somewhat simpler analysis.The techniques that we use to construct our zero-knowl-edge protocol are non black-box, but are different than the non black-box techniques previously used in the context of non-malleable coin-tossing.
Combining Sets with Cardinals
Authors: Calogero G. Zarba
Venue: Journal of Automated Reasoning (2005)

We introduce a quantifier-free set-theoretic language for combining sets with elements in the presence of the cardinality operator. We prove that the language is decidable by providing a combination method specifically tailored to the combination domain of sets, cardinal numbers, and elements. Our method uses as black boxes a decision procedure for the elements and a decision procedure for cardinal numbers. To be correct, our method requires that the theory of elements be stably infinite. However, we show that if we restrict set variables to range over finite sets only, then one can modify our method so that it works even when the theory of the elements is not stably infinite.
Determination of the candidate arc set for the asymmetric traveling salesman problem
Authors: Sang-Ho Kwon, Hun-Tae Kim, Maing-Kyu Kang
Venue: Computers and Operations Research (2005)

As size of the traveling salesman problem (TSP) increases, it is unreasonable to find efficiently an optimum or near-optimum. Instead of considering all arcs, if we select and consider only some arcs more likely to be included in an optimal solution, we can find efficiently an optimum or near-optimum. A candidate arc set is a group of some good arcs. For the lack of study in the asymmetric TSP, it needs to research systematically for the candidate arc set of the asymmetric TSP. In this paper, we suggest a regression function determining a candidate arc set for the asymmetric TSP. We established the regression function based on 2100 experiments, and we proved the goodness of fit for it through various 787 problems. Also, we applied it to the Out-of-Kilter heuristic. We tested it on 220 random instances and 23 real-world instances. Because the complexity of the heuristic depends on the number of arcs and we considered only the candidate arc set, we found good solutions about 2-5 fold faster than considering all arcs.
Improved timing control for web server systems using internal state information
Authors: Xue Liu, Rong Zheng, Jin Heo, Lui Sha
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

How to effectively allocate system resource to meet the Service Level Agreement (SLA) of Web servers is a challenging problem. In this paper, we propose an improved scheme for autonomous timing performance control in Web servers under highly dynamic traffic loads. We devise a novel delay regulation technique called Queue Length Model Based Feedback Control utilizing server internal state information to reduce response time variance in presence of bursty traffic. Both simulation and experimental studies using synthesized workloads and real-world Web traces demonstrate the effectiveness of the proposed approach.
Tracking Multiple Mouse Contours (without Too Many Samples)
Authors: Kristin Branson, Serge Belongie
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a particle filtering algorithm for robustly tracking the contours of multiple deformable objects through severe occlusions. Our algorithm combines a multiple blob tracker with a contour tracker in a manner that keeps the required number of samples small. This is a natural combination because both algorithms have complementary strengths. The multiple blob tracker uses a natural multitarget model and searches a smaller and simpler space. On the other hand, contour tracking gives more fine-tuned results and relies on cues that are available during severe occlusions. Our choice of combination of these two algorithms accentuates the advantages of each. We demonstrate good performance on challenging video of three identical mice that contains multiple instances of severe occlusion.
Automatic discovery of covariant read-only fields
Authors: Jens Palsberg, Tian Zhao, Trevor Jim
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2005)

Read-only fields are useful in object calculi, pi calculi, and statically typed intermediate languages because they admit covariant subtyping, unlike updateable fields. For example, Glew's translation of classes and objects to an intermediate calculus relies crucially on covariant subtyping of read-only fields to ensure that subclasses are translated to subtypes.In this article, we present a type inference algorithm for an Abadi--Cardelli object calculus in which fields are marked either as updateable or as read-only. The type inference problem is P-complete, and our algorithm runs in O(n3) time. The same complexity results hold for the calculus in which the fields are not explicitly annotated as updateable or read-only; perhaps surprisingly, the annotations do not make type inference easier. We show that type inference is equivalent to the problem of solving type constraints, and this forms the core of our algorithm and implementation.
Distributed approximation: a survey
Authors: Michael Elkin
Venue: ACM SIGACT News (2004)

Recently considerable progress was achieved in designing efficient distributed approximation algorithms, and in demonstrating hardness of distributed approximation for various problems. In this survey we overview the research in this area and propose several directions for future research.
A Direct Out-of-Core Solver for CGWAVE on the Cray X1
Authors: Fred T. Tracy, Thomas C. Oppe, Zeki Demirbilek
Venue: Proceedings of the 2004 Users Group Conference (2004)

CGWAVE is a general-purpose, state-of-the-art wave-prediction model. It is applicable to the estimation of wave fields in harbors, open coastal regions, coastal inlets, around islands, and around fixed or floating structures. CGWAVE generates a system of simultaneous linear complex equations that are difficult to solve. Some iterative solvers do not converge at all, while others struggle to converge. A direct, banded, out-of-core solver that utilized reordering of the nodes to reduce the size of the bandwidth was written. The solver was then optimized for the US Army Engineer Research and Development Center Major Shared Resource Center (ERDC MSRC) Cray X1. This paper will describe the details of how this work was performed and give performance results on the ERDC MSRC Cray X1.
Real-world learning with Markov logic networks
Authors: Pedro Domingos
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Machine learning and data mining systems have achieved many impressive successes, but to become truly widespread they must be able to work with less help from people. This requires automating the data cleaning and integration process, handling multiple types of objects and relations at once, and easily incorporating domain knowledge. In this talk, I describe how we are pursuing these aims using Markov logic networks, a representation that combines first-order logic and probabilistic graphical models. Data from multiple sources is integrated by automatically learning mappings between the objects and terms in them. Rich relational structure is learned using a combination of ILP and statistical techniques. Knowledge is incorporated by viewing logic statements as soft constraints on the models to be learned. Application to a real-world university domain shows our approach to be accurate, efficient, and less labor-intensive than traditional ones.
A characterization of first-order topological properties of planar spatial data
Authors: Michael Benedikt, Jan Van den Bussche, Christof Löding, Thomas Wilke
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Closed semi-algebraic sets in the plane form a powerful model of planar spatial datasets. We establish a characterization of the topological properties of such datasets expressible in the relational calculus with real polynomial constraints. The characterization is in the form of a query language that can only talk about points in the set and the "cones" around these points.
2-Arc-transitive regular covers of complete graphs Having the covering transformation group Zp3
Authors: Shao-Fei Du, Jin Ho Kwak, Ming-Yao Xu
Venue: Journal of Combinatorial Theory Series B (2005)

A family of 2-arc-transitive regular covers of a complete graph is investigated. In this paper, we classify all such covering graphs satisfying the following two properties: (1) the covering transformation group is isomorphic to the elementary abelian p-group Zp3, and (2) the group of fiber-preserving automorphisms acts 2-arc-transitively. As a result, new infinite families of 2-arc-transitive graphs are constructed.
Adaptive programming in JAsCo
Authors: Wim Vanderperren, Davy Suvée, Bart Verheecke, María Agustina Cibrán, Viviane Jonckers
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

In this paper we propose an extension to JAsCo for supporting Adaptive Programming in a Component-Based Software Development context. JAsCo is an aspect-oriented programming language targeted at Component-Based Software Development and allows encapsulating crosscutting concerns using highly reusable aspect beans. Adaptive Programming on the other hand, allows capturing crosscutting concerns by structure-shy adaptive visitors. We propose to implement an adaptive visitor as a regular JAsCo aspect bean. Hence, the reusability of an adaptive visitor is improved because the same visitor can be reused within different component contexts. We introduce JAsCo traversal connectors to deploy adaptive visitors, implemented as JAsCo aspect beans, upon a concrete component traversal. In addition, these traversal connectors allow to explicitly specify how the behavior of several adaptive visitors, instantiated onto the same component traversal, needs to be combined by making use of the JAsCo precedence and combination strategies. A prototype implementation of the JAsCo Adaptive Programming extension, which employs the DJ library, is available. As a proof of concept, we present an extended case study in the context of the Web Service Management Layer (WSML) project. In this case study, a set of visitors implemented in JAsCo is reused to accomplish multiple tasks.
The design of a dense PCB using an interactive DA system
Authors: David Rager, Herb Weiner
Venue: ACM SIGDA Newsletter (1978)

Historically, there have been two approaches to the use of computers for the design of printed circuit boards: Computer Aided Design (CAD) wherein a designer carries out the design of the board and a computer, coupled with graphics hardware (usually a storage tube) and software is used to carry out graphic handling and bookkeeping tasks; and Design Automation (DA) wherein a sophisticated placement and routing program, usually installed on a large computer, is used in a batch process mode to carry out the design according to necessarily limited algorithms. When either of these approaches is used in conjunction with dense PCB designs, the results have been unsatisfactory: From CAD because of a feeling that "the computer should be able to help me more in solving this knotty problem"; and from DA because the results of the automated process are usually so poor as to approach being worthless: that is, the effort to complete the design approaches the level of difficulty of designing the card manually from the beginning. The use of a computer-based design system for the design of dense printed circuit boards (PCB's) has thus been an elusive goal.
Using ECA rules to implement mobile query agents for fast-evolving pure P2P database systems
Authors: Verena Kantere, Aris Tsois
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

A challenging issue in fast-evolving pure P2P networks is the design of an appropriate mechanism for processing queries. Since both the data content of the peers as well as their acquaintances, change rapidly the typical P2P querying techniques become inappropriate. We are interested in P2P networks where peers are mobile and own a database. In this dynamic context the usage of a Mobile Agent framework appears very promising. The paper investigates the issues related to the above problem and proposes a P2P and Mobile Agent architecture based on Active Database technology. We argue that, the employment of ECA rules both for answering queries and deploying agents leads to an efficient as well as simple query processing technique. Furthermore, the proposed mobile agent system architecture offers a number of advantages due to the performance and scalability that can be achieved using Active Databases.
Generating blending surfaces with a Pseudo-Lévy series solution to fourth order partial differential equations
Authors: L. H. You, Jian J. Zhang, P. Comninos
Venue: Computing (2003)

In our previous work, a more general fourth order partial differential equation (PDE) with three vector-valued parameters was introduced. This equation is able to generate a superset of the blending surfaces of those produced by other existing fourth order PDEs found in the literature. Since it is usually more difficult to solve PDEs analytically than numerically, many references are only concerned with numerical solutions, which unfortunately are often inefficient. In this paper, we have developed a fast and accurate resolution method, the pseudo-Lévy series method. Due to its analytical nature, the comparison with other existing methods indicates that the developed method can generate blending surfaces almost as quickly and accurately as the closed form resolution method, and has higher computational accuracy and efficiency than existing Fourier series and pseudo-spectral methods as well as other numerical methods. In addition, it can be used to solve complex surface blending problems which cannot be tackled by the closed form resolution method. To demonstrate the potential of this new method we have applied it to various surface blending problems, including the generation of the blending surface between parametric primary surfaces, general second and higher degree surfaces, and surfaces defined by explicit equations.
SCTP-Based Middleware for MPI in Wide-Area Networks
Authors: H. Kamal, B. Penoff, A. Wagner
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

SCTP (Stream Control Transmission Protocol) is a recently standardized transport level protocol that has several features not present in TCP. These features make SCTP a better transport level protocol to support MPI (Message Passing Interface). MPI is a message passing library that is widely used to parallelize scientific and compute intensive programs. Recently there has been interest in porting MPI programs to execute in a Wide Area Network. We evaluated the use of SCTP and designed and modified a public domain version of the MPI middleware to use SCTP. We describe the advantages and disadvantages of SCTP and describe the changes that were necessary to the MPI middleware.
Towards understanding programs through wear-based filtering
Authors: Robert DeLine, Amir Khella, Mary Czerwinski, George Robertson
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

Large software projects often require a programmer to make changes to unfamiliar source code. This paper presents the results of a formative observational study of seven professional programmers who use a conventional development environment to update an unfamiliar implementation of a commonly known video game. We describe several usability problems they experience, including keeping oriented in the program's source text, maintaining the number and layout of open text documents and relying heavily on textual search for navigation. To reduce the cost of transferring knowledge about the program among developers, we propose the idea of wear-based filtering, a combination of computational wear and social filtering. The development environment collects interaction information, as with computational wear, and uses that information to direct the attention of subsequent users, as with social filtering. We present sketches of new visualizations that use wear-based filtering and demonstrate the feasibility of our approach with data drawn from our study.
Product Eigenvalue Problems
Authors: David S. Watkins
Venue: SIAM Review (2005)

Many eigenvalue problems are most naturally viewed as product eigenvalue problems. The eigenvalues of a matrix $A$ are wanted, but $A$ is not given explicitly. Instead it is presented as a product of several factors: $A = A_{k}A_{k-1}\cdots A_{1}$. Usually more accurate results are obtained by working with the factors rather than forming $A$ explicitly. For example, if we want eigenvalues/vectors of $B^{T}B$, it is better to work directly with $B$ and not compute the product. The intent of this paper is to demonstrate that the product eigenvalue problem is a powerful unifying concept. Diverse examples of eigenvalue problems are discussed and formulated as product eigenvalue problems. For all but a couple of these examples it is shown that the standard algorithms for solving them are instances of a generic $GR$ algorithm applied to a related cyclic matrix.
On mass conservation in least-squares methods
Authors: P. Bolton, R. W. Thatcher
Venue: Journal of Computational Physics (2005)

We compare three least-squares finite element reformulations of the Stokes equations, paying particular attention to mass conservation. The first problem we approximate has a simple analytical solution over a convex region. Even for this simple problem, without special treatment of the conservation of mass term, very poor numerical solutions may result. Sufficiently weighting this term leads to a dramatic improvement in the results over a range of test problems.
Lessons learned from organizing: 1995 -- 2004
Authors: Lorne Olfman, Conrad Shayo
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

The main objective of this panel is to provide a forum for past conference chairs, program chairs, and others, to discuss lessons learned from organizing the past 10 SIGMIS-CPR conferences and how the lessons can make future conferences even more successful.
A DAML+OIL-compliant Chinese lexical ontology
Authors: Yu-Sheng Lai, Ren-Jr Wang, Wei-Tek Hsu
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

This paper presents an ongoing task that will construct a DAML+Oil-compliant Chinese Lexical Ontology. The ontology mainly comprises three components: a hierarchical taxonomy consisting of a set of concepts and a set of relations describing the relationships among the concepts, a set of lexical entries associated with the concepts and relations, and a set of axioms describing the constraints on the ontology. It currently contains 1,075 concepts, 65,961 lexical entries associated with the concepts, 299 relations among the concepts excluding the hypernym and hyponym relations, 27,004 relations between the lexical entries and the concepts, and 79,723 relations associating the lexical entries with the concepts.
Delayed two-streams division, a diversity technique to improve signal transmission in relatively fast flat fading channels
Authors: Mohammad Ali Khalighi, Laurent Ros
Venue: Signal Processing (2005)

We consider in this paper a combination of data symbols that serves to provide time diversity and to reduce flat fading effect at receiver, when no other source of diversity is available. This technique, called delayed two-streams division (D2SD), is particularly interesting in relatively fast fading channels. By D2SD, the stream of the data symbols is divided into two substreams, the symbols of which are mixed pairwise together, and transmitted through the channel by a sufficiently long time delay between each pair. At receiver, a simple detector based on maximum likelihood criterion is used to "equalize" the symbol combination made at transmitter. The presented results show that with the negligible complexity added to the system, and while implying no loss in the spectral efficiency nor any increase in the transmit power, D2SD permits to obtain a considerable improvement in the receiver performance. Selection of the design parameters of D2SD is discussed for different cases of fading statistics, based on the bit error probability criterion.
Performance of a multiscan track-to-track association technique
Authors: Wei Mei, Gan-lin Shan
Venue: Signal Processing (2005)

The formula for calculating the theoretical probability of false association for the technique of track-to-track association (TTTA) using multiscan data is presented. The multiscan TTTA technique and the single-scan TTTA technique are studied by analysis and simulation. The conclusion is that the theoretical performance of the multiscan method is better than that of the single-scan method; however the practical performance of the former evaluated in our simulation is much worse than its theoretical performance, yet could still be more or less better than that of the latter. The reason is that estimation errors of the sensor-level tracks are strongly dependent across time.
Odysseus: A High-Performance ORDBMS Tightly-Coupled with IR Features
Authors: Kyu-Young Whang, Min-Jae Lee, Jae-Gil Lee, Min-Soo Kim, Wook-Shin Han
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We propose the notion of tight-coupling [8] to add new data types into the DBMS engine. In this paper, we introduce the Odysseus ORDBMS and present its tightly-coupled IR features (U.S. patented). We demonstrate a web search engine capable of managing 20 million web pages in a non-parallel configuration using Odysseus.