ppxscal/embedding_network huggingface dataset:
Disproving the fusion hypothesis: an analysis of data fusion via effective information retrieval strategies
Authors: Steven M. Beitzel, Ophir Frieder, Eric C. Jensen, David Grossman, Abdur Chowdhury, Nazli Goharian
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Many prior efforts have been devoted to the basic idea that data fusion techniques can improve retrieval effectiveness. Recent work in the area suggests that many approaches, particularly multiple-evidence combinations, can be a successful means of improving the effectiveness of a system. Unfortunately, the conditions favorable to effectiveness improvements have not been made clear. We examine popular data fusion techniques designed to achieve improvements in effectiveness and clarify the conditions required for data fusion to show improvement. We demonstrate that for fusion to improve effectiveness, the result sets being fused must contain a significant number of unique relevant documents. Furthermore, we show that for this improvement to be visible, these unique relevant documents must be highly ranked. In addition, we present a comprehensive discussion on why previous assumptions about the effectiveness of multiple-evidence techniques are misleading. Detailed empirical results and analysis are provided to support our conclusions.
Tage method for nonlinear singular two point boundary value problem using a fourth order difference scheme
Authors: R. K. Mohanty, P. L. Sachdev, Navnit Jha
Venue: Neural, Parallel Scientific Computations (2003)

In this piece of work, we discuss two parameter alternating group explicit (TAGE) method for the numerical solution of the singular equation. The proposed TAGE method shows the superiority over the corresponding SOR iteration method. The convergence theory is briefly discussed. The proposed method is applicable to problems both in cartesian and polar coordinates and is suitable for use on parallel computers. Computational results are presented to illustrate the utility of the proposed method.
Euler systems of cm points on shimura curves
Authors: Shou-Wu Zhang
Venue:  (2003)

In this thesis, we construct Euler systems of CM points on certain Shimura curves and use them to get some results on Birch and Swinnerton-Dyer conjecture, over anticyclotomic extensions, of the abelian varieties parameterized by those Shimura curves. We also give an application to Diophantine equations over totally real fields.
Auto-synthesis
Authors: Ian Trowell
Venue: Organised Sound (2001)

This article attempts to place the dynamic of popular electronic music, evident since the late 1970s and extending to the current situation, at the forefront of developing both a strategy of critique and a medium for critical reflection. The genres covered include electronic music in and around the time of punk rock, subsequent moves to the forcing ground of pop music with the era of synth-pop, the dynamic upheavals created through the surging form of techno, up to the prevalent genres of micro-sound and electronica. The essence of both the body of critique formulated by the music, and the critical reflection of such critique (as developed in works when a genre of music is said to have &lsquo;passed&rsquo;) is not pinned to a rigid model of assessment. Instead, the strength of popular music's ability to strategise and conduct a critique is considered in the self-same music's ability to subvert the definition and &lsquo;metric spaces&rsquo; of critique as accumulated through previous genres. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The use of mobile agents for clustering in mobile ad hoc networks
Authors: Mieso K. Denko
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

A mobile ad hoc network is a dynamic mobile wireless network that can be formed without the need for any pre-existing wired or wireless infrastructure. One of the main challenges in an ad hoc network is the design of robust routing algorithms that adapt to the frequent and randomly changing network topology. Organizing mobile nodes into manageable clusters can reduce routing overhead and provide more scalable solutions. In this paper we propose a mobile agent-based clustering architecture for routing in mobile ad hoc networks. Using this clustering architecture, hybrid routing schemes can be employed for intra-cluster and inter-cluster routing to improve the performance of routing. All nodes use two mobile agents to perform routing and clustering operations. They collect routing and clustering information and periodically maintain the corresponding tables. We identify various parameters for improving network performance in the proposed clustering architecture. By using some optimal values for these clustering and routing parameters, more robust and scalable routing can be attained.
A simple model of prolog's performance: extensional predicates
Authors: Carlos Escalante
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

The efficiency of query execution in Prolog depends on the order in which subgoals are stated. Optimizing a query consists of reducing the number of alternatives to be explored by finding a more efficient order for the evaluation of subgoals. Query reordering can be particularly important when the code is generated by a translator, such as the GraphLog translator, one of the tools in 4Thought, a collection of software design tools and methods for assisting software designers.Finding better orderings for the subgoals is easier if estimates of the evaluation costs for the individual subgoals are available. The total cost for a particular ordering can be estimated as the sum of the individual costs of the subgoals, where the cost of each subgoal will depend on the degree of instantiation of its arguments as well as on characteristics of the underlying database.A model of execution for Prolog that can be used to determine estimates of execution costs for any possible query is desirable. This model may be related to the costs of primitive operations that occur during query execution, such as variable unification, backtracking, etc. Thus, the problem is reduced to that of finding the expected number of these basic operations that are performed in the evaluation of a given subgoal. We can easily estimate these quantities in the simple case of a query retrieval. All we need is accurate knowledge of the database profile.
The k-Nearest Neighbor Method for Automatic Identification of Wood Products
Authors: Cecilia Fuentealba, Christophe Simon, Denise Choffel, Patrick Charpentier, Daniel Masson
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

The complete follow-up of products from its originto its final use has been strongly developed in the lastyears. In wood industries, the implementation ofordinary identification systems presents implantationproblems, mainly because of the extremely variablenature of the material and the particular features of themanufacturing process. In order to allow follow-up ofproducts, new solutions have been considered by theuse of non-destructive control techniques. Weimplemented an identification system, where eachproduct is considered as unique with unique features.For this research we use a microwave sensor to obtainan intrinsic signal of a wood piece and then perform itsidentification. The objective is to determine a processfor identifying signals. The algorithm for patternidentification developed here is based on the k-nearestneighbor method. To increase performance of thisalgorithm, the signals are pre-treated. Signals alreadyrecorded in the database are positioned in the space ton-dimensions. When a product is to be identified it willalso see its signal positioned; the nearest signal havingas a reference the distance criterion will be located.The identifying algorithm developed shows apercentage of error of 1,5%.
A dynamic data/currency protocol for mobile database design and reconfiguration
Authors: Yanli Xia, Abdelsalam (Sumi) Helal
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper presents flexible protocols for dynamic database design and reconfiguration, enabling mobile database to be designed in such a way that data location, replication and even use semantics can be changed dynamically. In particular, a dual data/currency hoarding and synchronization protocol, a metadata protocol and currency redistribution protocol are proposed. Metadata records the changing characteristics of replicas and currencies are dynamically redistributed to fit the target. Primaries may be diluted, concentrated and transferred in the system. Traditional distributed database is included as home of data. An ad-hoc database may check out its desired data/currency and check them back in when they are no longer accessed by the mobile users. We demonstrate that the flexibility of this approach can significantly improve commit performance under dynamic access and mobility behavior.
IPv6 single-path and multi-path anycast routing protocols performance analysis
Authors: K. H. Tan, Mashkuri Yaacob, T. C. Ling, K. K. Phang
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Anycast is a network service provided in IPv6. A group of servers that provide same services will be assigned the same anycast address. A client wishing to contact the server will send the packets to this anycast address and the anycast-supported router will direct the packets to the nearest server. This paper analyses the performance of single-path and multi-path anycast routing protocols under different traffic load. The analysed results show that the performance of these protocols is very much dependent on the source-receiver distribution. When the traffic load is very high, the results show that multi-path anycast routing does not perform better than single-path anycast routing.
Case study: integrating spatial data display with virtual reconstruction
Authors: Philip Peterson, Brian Hayden, F. David Fracchia
Venue: Proceedings of the conference on Visualization '94 (1994)

In the process of archaeological excavation, a vast amount of data, much of it three-dimensional in nature, is recorded. In recent years, computer graphics techniques have been applied to the task of visualizing such data. In particular, data visualization has been used to accomplish the virtual reconstruction of site architecture and to enable the display of spatial data distributions using three-dimensional models of site terrain. In the case we present here, these two approaches are integrated in the modeling of a prehistoric pithouse. In order to better visualize artifact distributions in the context of site architecture, surface data is displayed as a layer in a virtual reconstruction viewable at interactive rates. This integration of data display with the architectural model has proven valuable in identifying correlations between distributions of different artifact categories and their spatial proximity to significant architectural features.
An efficient method for mining associated service patterns in mobile web environments
Authors: Shin-Mu Tseng, Cing-Fu Tsui
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This research presents a new data mining method that can efficiently discover associated service patterns requested by users in mobile web environments. Although there exist some studies on data mining in mobile systems in recent years, they were mostly focused on topics like moving path mining or service request log mining and the issue of discovering user's associated service patterns with the locations has not been explored. In particular, this problem becomes more complex when the hierarchical concepts of locations and services are considered. In this work, we propose a new data mining method named two-dimensional multi-level association rules mining, which can efficiently discover the associated service request patterns by taking into account the hierarchical characteristics of the location and service concept. To our best knowledge, this is the first work resolving this research issue. Through detailed experimental evaluations under various system conditions, our method was shown to deliver excellent performance in terms of accuracy, completeness, execution efficiency and scalability.
Mapping transparency through metaphor: towards more expressive musical instruments
Authors: Sidney Fels, Ashley Gadd, Axel Mulder
Venue: Organised Sound (2002)

We define a two-axis transparency framework that can be used as a predictor of the expressivity of a musical device. One axis is the player's transparency scale, while the other is the audience's transparency scale. Through consideration of both traditional instruments and new technology-driven interfaces, we explore the role that metaphor plays in developing expressive devices. Metaphor depends on a literature, which forms the basis for making transparent device mappings. We examine four examples of systems that use metaphor: Iamascope, Sound Sculpting, MetaMuse and Glove-TalkII; and discuss implications on transparency and expressivity. We believe this theory provides a framework for design and evaluation of new human&ndash;machine and human&ndash;human interactions, including musical instruments.
Divergence function, duality, and convex analysis
Authors: Jun Zhang
Venue: Neural Computation (2004)

From a smooth, strictly convex function Φ: Rn → R, a parametric family of divergence function DΦ(α) may be introduced: DΦ(α)(x, y) = 4/1 - α2(1 - α/2 Φ(x)+ 1 + α/2 Φ(y) - Φ (1 - α/2x + 1 + α/2y)) for x, y ∈ int dom(Φ) ⊂ Rn, and for α ∈ R, with DΦ(±1) defined through taking the limit of α. Each member is shown to induce an α-independent Riemannian metric, as well as a pair of dual α-connections, which are generally nonflat, except for α = ±1. In the latter case, DΦ(±1) reduces to the (nonparametric) Bregman divergence, which is representable using Φ and its convex conjugate Φ* and becomes the canonical divergence for dually flat spaces (Amari, 1982, 1985; Amari & Nagaoka, 2000). This formulation based on convex analysis naturally extends the information-geometric interpretation of divergence functions (Eguchi, 1983) to allow the distinction between two different kinds of duality: referential duality (α ↔ -α) and representational duality (Φ ↔ Φ*). When applied to (not necessarily normalized) probability densities, the concept of conjugated representations of densities is introduced, so that ±α-connections defined on probability densities embody both referential and representational duality and are hence themselves bidual. When restricted to a finite-dimensional affine submanifold, the natural parameters of a certain representation of densities and the expectation parameters under its conjugate representation form biorthogonal coordinates. The alpha representation (indexed by β now, β ∈ [-1, 1]) is shown to be the only measure-invariant representation. The resulting two-parameter family of divergence functionals D(α,β), (α,β) ∈ [-1, 1] × [-1, 1] induces identical Fisher information but bidual alpha-connection pairs; it reduces in form to Amari's alpha-divergence family when α = ±1 or when β = 1, but to the family of Jensen difference (Rao, 1987) when β = -1.
SmartKom mobile: intelligent ubiquitous user interaction
Authors: Rainer Malaka, Jochen Haeussler, Hidir Aras
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

This paper presents SmartKom Mobile, the mobile version of the SmartKom system. SmartKom Mobile brings together highly advanced user interaction and mobile computing in a novel way and allows for ubiquitous access to multi-domain information. SmartKom Mobile is device-independent and realizes multi-modal interaction in cars and on mobile devices such as PDAs. With its siblings, SmartKom Home and SmartKom Public, it provides intelligent user interfaces for an extremely broad range of scenarios and environments.
Collaborative Information Systems and Business Process Design Using Simulation
Authors: Ray J. Paul, Alan Serrano
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

The Information Systems (IS) community promotes the idea that IS analyst should have a clearunderstanding of the way the organization operates before attempting to propose an IS solution. It is argued that to take a complete advantage of the underlying Information Technology (IT), organizations should first identify any process flaw and then propose a suitable IT solution. Similarly, many process design approaches claim that Business Process (BP) design should be done considering the advantages provided and the limitations imposed by the underlying (IT). Despite this fact research in these domains provides little indication of which mechanisms or tools can help BP and IS analyst to understand the complex relationships amongst these two areas. This paper describes the insights gained during a UK funded research project, namely ASSESS-IT, that aimed to depict the dynamic relationships between IT and BP using simulation. One of the major limitations of the ASSESS-IT project is that it looked at relationship between BP and IT as a three layered structure, namely BP, IS and Computer Networks (CN), and did not explore in detail the relationships between BP andIS alone. This paper uses the outcomes derived from this project and suggests that, is some cases, the relationship between BP and IT could be analyzed by looking at the relationship between BP and IS alone. It then proposes an alternative simulation framework, namely BPISS, that provides the guideline to develop simulation models that portray BP and IS behavior performance measurements, offering in this way an alternative mechanism that can help BP and IS analyst to understand in more detail the dynamic interactions between BP and IS domains.
Biological applications of multi-relational data mining
Authors: David Page, Mark Craven
Venue: ACM SIGKDD Explorations Newsletter (2003)

Biological databases contain a wide variety of data types, often with rich relational structure. Consequently multi-relational data mining techniques frequently are applied to biological data. This paper presents several applications of multi-relational data mining to biological data, taking care to cover a broad range of multi-relational data mining techniques.
An algorithmic approach to knowledge evolution
Authors: Alessio Lomuscio, Mark Ryan
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

Intelligent agents must update their knowledge base as they acquire new information about their environment. The modal logic S5n has been designed for representing knowledge bases in societies of agents. Halpern and Vardi have proposed the notion of refinement of S5n Kripke models in order to solve multi-agent problems in which knowledge evolves. We argue that there are some problems with their proposal and attempt to solve them by moving from Kripke models to their corresponding trees. We define refinement of a tree with a formula, show some properties of the notion, and illustrate with the muddy children puzzle. We show how some diagnosis problems in engineering can be modelled as knowledge-based multi-agent systems, and hence how our approach can address them.
A new algorithm for transistor sizing in CMOS circuits
Authors: C. H. Allen Wu, Nels Vander Zanden, Daniel Gajski
Venue: Proceedings of the conference on European design automation (1990)

This paper describes a new algorithm for automatic transistor sizing in CMOS circuits. The algorithm consists of three phases: critical path analysis, transistor sizing and transistor desizing. This approach is different from conventional sizing methods that optimize a given design locally, using one or several paths at a time. Our algorithm reduces the delays of all paths in a given design simultaneously. Using our transistor desizing approach, the minimal transistor areas can be achieved to meet a set of timing requirements. Furthermore, by tuning NFET and PFET transistor sizes separately, this algorithm has control over rise and fall time delays of a gate depending on the input trigger signal. Experimental results show that this algorithm can improve the delay in approximately linear time.
Experiments in discourse analysis impact on information classification and retrieval algorithms
Authors: J. Morato, J. Llorens, G. Genova, J. A. Moreiro
Venue: Information Processing and Management: an International Journal (2003)

Researchers in indexing and retrieval systems have been advocating the inclusion of more contextual information to improve results. The proliferation of full-text databases and advances in computer storage capacity have made it possible to carry out text analysis by means of linguistic and extralinguistic knowledge. Since the mid 80s, research has tended to pay more attention to context, giving discourse analysis a more central role. The research presented in this paper aims to check whether discourse variables have an impact on modern information retrieval and classification algorithms. In order to evaluate this hypothesis, a functional framework for information analysis in an automated environment has been proposed, where the n-grams (filtering) and the k-means and Chen's classification algorithms have been tested against sub-collections of documents based on the following discourse variables: "Genre", "Register", "Domain terminology", and "Document structure". The results obtained with the algorithms for the different sub-collections were compared to the MeSH information structure. These demonstrate that n-grams does not appear to have a clear dependence on discourse variables, though the k-means classification algorithm does, but only on domain terminology and document structure, and finally Chen's algorithm has a clear dependence on all of the discourse variables. This information could be used to design better classification algorithms, where discourse variables should be taken into account. Other minor conclusions drawn from these results are also presented.
Integrating software productivity tools into Eclipse
Authors: Will Robinson, Ben D'Angelo
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

This paper presents a framework designed to ease the process of building GUIs for software productivity tools in Eclipse. This framework provides a general system with which external tools may display graphs and trees within Eclipse and may link these displays to source code. In addition, our framework can retrieve information from Eclipse, passing it back to the user's external tools for further processing. Combining these pieces of functionality gives users an intuitive and powerful interface to existing productivity tools and provides developers an easy way of extending those tools.The paper also presents examples of two program productivity tools -- a memory leak detector and a security vulnerability detector -- which we have successfully integrated with our framework.