ppxscal/embedding_network huggingface dataset:
High dimensional reverse nearest neighbor queries
Authors: Amit Singh, Hakan Ferhatosmanoglu, Ali Şaman Tosun
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, document databases, and bioinformatics. The earlier approaches to solve this problem mostly deal with two dimensional data. However most of the above applications inherently involve high dimensions and high dimensional RNN problem is still unexplored. In this paper, we propose an approximate solution to answer RNN queries in high dimensions. Our approach is based on the strong correlation in practice between k-NN and RNN. It works in two phases. In the first phase the k-NN of a query point is found and in the next phase they are further analyzed using a novel type of query Boolean Range Query (BRQ). Experimental results show that BRQ is much more efficient than both NN and range queries, and can be effectively used to answer RNN queries. Performance is further improved by running multiple BRQ simultaneously. The proposed approach can also be used to answer other variants of RNN queries such as RNN of order k, bichromatic RNN, and Matching Query which has many applications of its own. Our technique can efficiently answer NN, RNN, and its variants with approximately same number of I/O as running a NN query.
Permutation Pseudographs and Contiguity
Authors: Catherine Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald
Venue: Combinatorics, Probability and Computing (2002)

The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation &sgr; of &lcub;1,2,&hellip;, n&rcub; uniformly at random and taking the n edges &lcub;i,&sgr;(i)&rcub;. We prove several contiguity results involving permutation pseudographs (contiguity is a kind of asymptotic equivalence of sequences of probability spaces). Namely, we show that a random 4-regular pseudograph is contiguous with the sum of two permutation pseudographs, the sum of a permutation pseudograph and a random Hamilton cycle, and the sum of a permutation pseudograph and a random 2-regular pseudograph. (The sum of two random pseudograph spaces is defined by choosing a pseudograph from each space independently and taking the union of the edges of the two pseudographs.) All these results are proved simultaneously by working in a general setting, where each cycle of the permutation is given a nonnegative constant multiplicative weight. A further contiguity result is proved involving the union of a weighted permutation pseudograph and a random regular graph of arbitrary degree. All corresponding results for simple graphs are obtained as corollaries.
A note on the numerical solution of high-order differential equations
Authors: Y. Wang, Y. B. Zhao, G. W. Wei
Venue: Journal of Computational and Applied Mathematics (2003)

Numerical solution of high-order differential equations with multi-boundary conditions is discussed in this paper. Motivated by the discrete singular convolution algorithm, the use of fictitious points as additional unknowns is proposed in the implementation of locally supported Lagrange polynomials. The proposed method can be regarded as a local adaptive differential quadrature method. Two examples, an eigenvalue problem and a boundary-value problem, which are governed by a sixth-order differential equation and an eighth-order differential equation, respectively, are employed to illustrate the proposed method.
The workload you have, the workload you would like
Authors: Matteo Golfarelli, Ettore Saltarelli
Venue: Proceedings of the 6th ACM international workshop on Data warehousing and OLAP (2003)

Real data warehouse workloads are often too large and complex to be directly optimized using the algorithms proposed in the literature for view materialization and indexing. In this paper we propose the idea of profile as an instrument for summarizing the workload features in order to help the designer to make the right choices. The ability of the profile to characterize a workload is then exploited to move backward using it as an input for an algorithm that generates a set of queries presenting the desired features. The algorithm proposed is finally used for creating the workloads necessary for testing the correspondence between different profiles and the results of optimization.
Reasoning about arrays
Authors: John C. Reynolds
Venue: ACM SIGPLAN Notices (1980)

The use of complete and precise assertions, developed by Floyd and Hoare, is a powerful method for avoiding programming errors. For nontrivial programs, however, such assertions become extremely tedious when written in first-order predicate calculus.In the case of array-manipulating programs, this tedium can be alleviated by several notational and conceptual devices: (1) partition diagrams, which relate intervals of subscript values; (2) pointwise extension, which reduces the need for explicit quantification; and (3) a hierarchy of useful equivalence relations among array values.The effectiveness of these ideas is illustrated by programs for binary search and for merging.
Algorithms for controlling cooperation between output modalities in 2D embodied conversational agents
Authors: Sarkis Abrilian, Jean-Claude Martin, Stéphanie Buisine
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

Recent advances in the specification of the multimodal behavior of Embodied Conversational Agents (ECA) have proposed a direct and deterministic one-step mapping from high-level specifications of dialog state or agent emotion onto low-level specifications of the multimodal behavior to be displayed by the agent (e.g. facial expression, gestures, vocal utterance). The difference of abstraction between these two levels of specification makes difficult the definition of such a complex mapping. In this paper we propose an intermediate level of specification based on combinations between modalities (e.g. redundancy, complementarity). We explain how such intermediate level specifications can be described using XML in the case of deictic expressions. We define algorithms for parsing such descriptions and generating the corresponding multimodal behavior of 2D cartoon-like conversational agents. Some random selection has been introduced in these algorithms in order to induce some "natural variations" in the agent's behavior. We conclude on the usefulness of this approach for the design of ECA.
A shallow parser based on closed-class words to capture relations in biomedical text
Authors: Gondy Leroy, Hsinchun Chen, Jesse D. Martinez
Venue: Journal of Biomedical Informatics (2003)

Natural language processing for biomedical text currently focuses mostly on entity and relation extraction. These entities and relations are usually pre-specified entities, e.g., proteins, and pre-specified relations, e.g., inhibit relations. A shallow parser that captures the relations between noun phrases automatically from free text has been developed and evaluated. It uses heuristics and a noun phraser to capture entities of interest in the text. Cascaded finite state automata structure the relations between individual entities. The automata are based on closed-class English words and model generic relations not limited to specific words. The parser also recognizes coordinating conjunctions and captures negation in text, a feature usually ignored by others. Three cancer researchers evaluated 330 relations extracted from 26 abstracts of interest to them. There were 296 relations correctly extracted from the abstracts resulting in 90% precision of the relations and an average of 11 correct relations per abstract.
Computing all parametric solutions for blending parametric surfaces
Authors: Sonia Pérez-Díaz, J. Rafael Sendra
Venue: Journal of Symbolic Computation (2003)

In this paper we prove that, for a given set of parametric primary surfaces and parametric clipping curves, all parametric blending solutions can be expressed as the addition of a particular parametric solution and a generic linear combination of the basis of a free module of rank 3. As a consequence, we present an algorithm that outputs a generic expression for all the parametric solutions for the blending problem. In addition, we also prove that the set of all polynomial parametric solutions (i.e. solutions that have polynomial parametrizations) for a parametric blending problem can also be expressed in terms of the basis of a free module of rank 3, and we prove an algorithmic criterion to decide whether there exist parametric polynomial solutions. As a consequence we also present an algorithm that decides the existence of polynomial solutions, and that outputs (if this type of solution exists) a generic expression for all polynomial parametric solutions for the problem.
Supervised term weighting for automated text categorization
Authors: Franca Debole, Fabrizio Sebastiani
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The construction of a text classifier usually involves (i) a phase of term selection, in which the most relevant terms for the classification task are identified, (ii) a phase of term weighting, in which document weights for the selected terms are computed, and (iii) a phase of classifier learning, in which a classifier is generated from the weighted representations of the training documents. This process involves an activity of supervised learning, in which information on the membership of training documents in categories is used. Traditionally, supervised learning enters only phases (i) and (iii). In this paper we propose instead that learning from training data should also affect phase (ii), i.e. that information on the membership of training documents to categories be used to determine term weights. We call this idea supervised term weighting (STW). As an example, we propose a number of "supervised variants" of t f idf weighting, obtained by replacing the idf function with the function that has been used in phase (i) for term selection. We present experimental results obtained on the standard Reuters-21578 benchmark with one classifier learning method (support vector machines), three term selection functions (information gain, chi-square, and gain ratio), and both local and global term selection and weighting.
Model checking mobile ambients
Authors: Witold Charatonik, Silvano Dal Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
Venue: Theoretical Computer Science (2003)

We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replication-free calculus and guarantee-free logic we prove that the problem is PSPACE-complete. For the complexity upper bound, we devise a new representation of processes that remains of polynomial size during process execution; this allows us to keep the model checking procedure in polynomial space. Moreover, we prove PSPACE-hardness of the problem for several quite simple fragments of the calculus and the logic; this suggests that there are no interesting fragments with polynomial-time model checking algorithms.
Grid security: requirements, plans and ongoing efforts
Authors: Frank Siebenlist
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

Currently, members of the Grid community are working within the Global Grid Forum to articulate their security requirements, and to fill the gaps that are perceived to exist within industry-wide standardization efforts. Probably the main difference between the Grid community's requirements and those seen in the rest of the industry is the focus on how we can express, communicate and enforce the different security policies while crossing adminstrative boundaries.This presentation will discuss some Grid specific use cases to emphasize this difference in focus, briefly discuss the Open Grid Services Architecture that provides the framework in which we try to address these requirements, enumerate how security aspects can be addressed by existing standards and where the gaps are, and specifically show some details on our current work to address-many of our distributed authorization problems.
Efficient Polling Schemes for Bluetooth Picocells Revisited
Authors: Ka Lok Chan, Vojislav B. Mi"i", Jelena Mi"i"
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

The performance of asynchronous data traffic in Bluetooth piconets is very much dependent on the choice of the polling scheme. In this paper we consider the problem of designing efficient and fair, yet simple to implement, polling schemes that would achieve best performance (i.e., the lowest end-to-end packet delay) under TCP traffic. A number of such schemes are described and their performance is compared against some benchmark schemesderived from the known results for polling systems.
Net Clustering Based Constructive and Iterative Improvement Approaches for Macro-Cell Placement
Authors: Stelian Alupoaei, Srinivas Katkoori
Venue: Journal of VLSI Signal Processing Systems (2004)

We propose a net clustering based RT-level macro-cell placement approaches. Static timing analysis identifies critical nets and critical primary input/output paths. Net clustering (based on shared macro-cells and net criticality) yields clusters wherein each cluster has strongly interdependent nets. The circuit is modeled as a graph in which each vertex v represents a net and each edge (v,u) a shared cell between nets v and u. The net clusters are obtained by applying a clique partitioning algorithm on the circuit graph. Two approaches to generate placements at RTL are proposed: constructive (cluster growth) approach and iterative improvement (simulated annealing) based approach. In the constructive approach, a cluster-level floorplanning is performed and a cluster ordering is obtained. The cluster ordering is used by a constructive procedure to generate the physical placement. In the case of iterative improvement based approach, a good ordering of clusters is obtained using simulated annealing.We report experimental results for five RTL datapaths implemented in 0.35 &mu;m technology to demonstrate the efficacy of the proposed approaches. We compared the layouts produced by our approaches with those produced by Flint, an automatic floor planner in Lager IV Silicon Compiler [1]. For constructive placement approach, we obtained an average decrease of 43.4% in longest wirelength and 32.4% in total wirelength. The average area reduction is 7.3%. On the other hand, for the SA-based approach, we obtained an average decrease of 57.6% in longest wirelength and 42.2% in total wirelength. The average reduction in the bounding-box area is 12.3%. As expected, the SA-based approach yielded better optimization results, due to its ability to climb out of local minima.
Knowledge-based security administration in a distributed environment
Authors: Christoph Lingenfelder, Sven Lorenz
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

The problem of computer security has recently become more prominent, especially with the growing interest in distributed systems. One major aspect is access control, especially to ensure that only those users who need to work with sensitive data are authorized to do so.A major drawback of most existing systems for security administration is the difficulty to enforce the compliance of an actual implementation with the intended security policies. Traditionally, an enterprise has expected its system administrators to ensure policy compliance. However, the complexity of distributed systems and cumbersome security administration programs make it almost impossible for an administrator to achieve this. Moreover, the same problems exist for an auditor who has to review the security system and check its consistency with enterprise policies.In this article we propose to use knowledge-based methods to support administrators and auditors in their respective tasks. Global enterprise security policies can be laid down in a separate enterprise-wide security database which may then be consulted during normal administrative work.The knowledge-based system itself performs consistency checks of the authorization changes formulated by the administrator and helps to detect holes in the security specification. Whenever the system comes up with an inconsistency the administrator may choose to receive an explanation of why the proposed action would violate the security policies and thus he or she is able to select an appropriate alternative action.Finally, it supports the auditor in finding out whether certain security principles are satisfied by the underlying operational access control system. The auditor can formulate security principles on an intuitive declarative level and have them checked against the existing authorizations.
Treatment of epsilon moves in subset construction
Authors: Gertjan van Noord
Venue: Computational Linguistics (2000)

The paper discusses the problem of determinizing finite-state automata containing large numbers of εmoves. Experiments with finite-state approximations of natural language grammars often give rise to very large automata with a very large number of εmoves. The paper identifies and compares a number of subset construction algorithms that treat εmoves. Experiments have been performed which indicate that the algorithms differ considerably in practice, both with respect to the size of the resulting deterministic automaton, and with respect to practical efficiency. Furthermore, the experiments suggest that the average number of εmoves per state can be used to predict which algorithm is likely to be the fastest for a given input automaton.
Design pattern rationale graphs: linking design to source
Authors: Gail Murphy
Venue:  (2003)

As source code evolves, the reasoning behind certain design decisions is lost, often leading to violations of design goals during program maintenance. This kind of code decay is often caused by changes made by developers who are not adequately aware of the rationale behind the source code. Becoming aware of rationale is difficult for many reasons, including the mismatch between design and source code. The thesis of this research is that a mechanism for tracing design goals through existing documentation to source would enable software developers to have more complete knowledge of design goals relevant to a system, and more confidence in terms of how design goals relate to the source. The technique should be applicable within the context of one software evolution task. To validate the claims of this thesis, we have developed the Design Pattern Rationale Graph (DPRG) approach and associated tool. This dissertation describes this mechanism, and its use in the validation of the thesis claims. A DPRG is a graph formed from the text of design pattern documentation that is linked to a code base. The DPRG allows developers to view design pattern information related to design goals separately, and trace those goals through to their corresponding locations in a code base. The DPRG approach is lightweight: The time and effort required to apply the approach fits within the context of a single task. We demonstrate the validity of the thesis claims by applying the DPRG in several case studies and one experiment. These studies address each claim separately, and do so on a wide range of systems and tasks.
Automatic verb classification based on statistical distributions of argument structure
Authors: Paola Merlo, Suzanne Stevenson
Venue: Computational Linguistics (2001)

Automatic acquisition of lexical knowledge is critical to a wide range of natural language processing tasks. Especially important is knowledge about verbs, which are the primary source of relational information in a sentence---the predicate-argument structure that relates an action or state to its participants (i.e., who did what to whom). In this work, we report on supervised learning experiments to automatically classify three major types of English verbs, based on their argument structure--specifically, the thematic roles they assign to participants. We use linguistically-motivated statistical indicators extracted from large annotated corpora to train the classifier, achieving 69.8% accuracy for a task whose baseline is 34%, and whose expert-based upper bound we calculate at 86.5%. A detailed analysis of the performance of the algorithm and of its errors confirms that the proposed features capture properties related to the argument structure of the verbs. Our results validate our hypotheses that knowledge about thematic relations is crucial for verb classification, and that it can be gleaned from a corpus by automatic means. We thus demonstrate an effective combination of deeper linguistic knowledge with the robustness and scalability of statistical techniques.
On the asymptotic distribution of the least-squares estimators in unidentifiable models
Authors: Taichi Hayasaka, Masashi Kitahara, Shiro Usui
Venue: Neural Computation (2004)

In order to analyze the stochastic property of multilayered perceptrons or other learning machines, we deal with simpler models and derive the asymptotic distribution of the least-squares estimators of their parameters. In the case where a model is unidentified, we show different results from traditional linear models: the well-known property of asymptotic normality never holds for the estimates of redundant parameters.
User interface code generation for EJB-based data models using intermediate form representations
Authors: Branko Milosavljević, Milan Vidaković, Srdjan Komazec, Gordana Milosavljević
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The use of J2EE platform enables data model development based on EJB components. Data modeling concepts of EJB technology, although resembling those of relational databases, are different and need new methods for automated user interface code generation. This paper presents a method for user interface code generation based on intermediate form representations that can be used to build equivalent user interfaces in multiple environments like standalone GUI applications, web, or wireless devices. The structure of the generated system, intermediate form representations, and the functionality of user interface concepts are described in detail.
Character String Predicate Based Automatic Software Test Data Generation
Authors: Ruilian Zhao, Michael R. Lyu
Venue: Proceedings of the Third International Conference on Quality Software (2003)

A character string is an important element inprogramming. A problem that needs further research ishow to automatically generate software test data forcharacter strings. This paper presents a novel approachfor automatic test data generation of program pathsincluding character string predicates, and the effectivenessof this approach is examined on a number of programs.Each element of input variable of a character string isdetermined by using the gradient descent technique toperform function minimization so that the test data ofcharacter string can be dynamically generated. Theexperimental results illustrate that this approach iseffective.
Brevity and clarity in command languages
Authors: James A. Malcolm
Venue: ACM SIGPLAN Notices (1981)

An example from Ellis[4] is used to demonstrate the possibilities for greater clarity of expression in a command language which is separate from, rather than embedded in, a programming language.