ppxscal/embedding_network huggingface dataset:
Efficient Approximation of Spatial Network Queries using the M-Tree with Road Network Embedding
Authors: Kevin Shaw, Elias Ioup, John Sample, Mahdi Abdelguerfi, Olivier Tabone
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

Spatial networks, such as road systems, operate differently from normal geospatial systems because objects are constrained to locations on the network. Performing queries on spatial networks demands entirely different solutions. Most spatial queries make use of an R-Tree to process them efficiently. The M-Tree is a data tree index which is capable of indexing data in any metric space. The M-Tree index can replace the R-Tree index for spatial network queries, such as range and KNN queries. The difficulty is that the M-Tree is only as efficient as the distance algorithm used on the underlying objects. Most network distance algorithms, such as A*, are too slow to allow the M-Tree to operate efficiently on spatial networks. The Truncated Road Network Embedding (tRNE) maps the network into a higher dimensional space where any LP metric can be used to efficiently compute an accurate approximation of network distance. The M-Tree combined with tRNE creates an efficient index structure for computing spatial network queries. The M-Tree substantially outperforms network expansion, the most popular method of computing spatial network queries, when performing spatial network KNN and range queries.
Speaker recognition and speaker normalization by projection to speaker subspace
Authors: Y. Ariki, S. Tagashira, M. Nishijima
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

An individual speaker is thought to have his own subspace in which his phonetic information is included. However, conventional speaker-independent HMMs ignore the speaker subspaces and gather speech data spread widely in the observation space. Then they cause probability distribution flatness of HMMs and the resultant recognition errors. To solve this problem, we propose a method (1) to separate the speaker characteristics by constructing the individual speaker subspace, (2) to recognize speakers based on the subspaces and (3) to produce speaker normalized speech data by projecting speech data into his subspace and to recognize them.
Decision Support Analysis for Software Effort Estimation by Analogy
Authors: Jingzhou Li, Guenther Ruhe
Venue: Proceedings of the Third International Workshop on Predictor Models in Software Engineering (2007)

Effort estimation by analogy (EBA) is an established method for software effort estimation. For this paper, we understand EBA as a meta-method which needs to be instantiated and customized at different stages and decision points regarding a specific context. Some example decision problems are related to the selection of the similarity measures, the selection of analogs for adaptation or the weighting and selection of attributes. This paper proposes a decision-centric process model for EBA by generalizing the existing EBA methods. Typical decision-making problems are identified at different stages of the process as part of the model. Some existing solution alternatives of the decision-making problems are then studied. The results of the decision support analysis can be used for better understanding of EBA related techniques and for providing guidelines for implementation and customization of general EBA. An example case of the process model is finally presented.
The impact of loop unrolling on controller delay in high level synthesis
Authors: Srikanth Kurra, Neeraj Kumar Singh, Preeti Ranjan Panda
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Loop unrolling is a well-known compiler optimization that can lead to significant performance improvements. When used in High Level Synthesis (HLS) unrolling can affect the controller complexity and delay. We study the effect of the loop unrolling factor on the delay of controllers generated during HLS. We propose a technique to predict controller delay as a function of the loop unrolling factor, and use this prediction with other search space pruning methods to automatically determine the optimal loop unrolling factor that results in a controller whose delay fits into a specified time bud-get, without an exhaustive exploration. Experimental results indicate delay predictions that are close to measured delays, yet significantly faster than exhaustive synthesis.
The OAI-ORE effort: progress, challenges, synergies
Authors: Cliff Lynch, Savas Parastatidis, Neil Jacobs, Herbert Van de Sompel, Carl Lagoze
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The panel will discuss various aspects of the ongoing Object Re-Use and Exchange (ORE) effort of the Open Archives Initiative (OAI). OAI-ORE is funded by the Andrew W. Mellon Foundation and is a result of the "Augmenting Interoperability across Scholarly Repositories" meeting that took place in April 2006 at the Mellon Foundation. A panel at JCDL 2006 reported on this meeting. The goal of OAI-ORE is to develop, identify, and profile extensible standards and protocols that allow repositories, agents, and services to interoperate in the context of use and reuse of compound digital objects beyond the boundaries of the holding repositories.
Change management in ontology management systems
Authors: Farshad Fotouhi
Venue:  (2006)

Annotating resources with concepts from ontology is a promising proposition. Ontology is a formal definition of the domain and annotation based on ontology, by removing ambiguity from definition, makes integration between different sources of information possible. In this thesis, we studied the effect of "change in ontology" on information resources. A framework has suggested to store and query ontologies and to populate and manage instances. This ontology management system is called LINGOES and its first application is in linguistic field. One of the major contributions of this thesis is the Ontology of Change that formalizes types of changes between two versions and Delta that represents the actual change between two versions using terminology from Ontology of Change. The other contribution is an Axiomatic Model (A-Model) that is used as schema for instance base. A-Model is a scaled down version of ontology with clear definition for change operations and simple strategies for accessing instances in case of change in ontology. We have also introduced an ontology evolution process to guide user in a step by step process from defining changes to implementing them in ontology and constructing A-Model that corresponds to the ontology. One of the important aspects of this process is a set of transformations that improve quality of ontology by improving metrics that were defined on quality criteria.
Analysis of Timing Requirements for Intrusion Detection System
Authors: Jan Magott, Pawel Skrobanek, Marek Woda
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

An Intrusion Detection System (IDS) is a collection of sensors (often in the form of mobile agents) that collect data (security related events), classify them and trigger an alarm when unwanted manipulations to regular network behaviour is detected. Activities of attackers and network are time dependent. In the paper, Fault Trees with Time Dependencies (FTTD) are used to describe intrusions with emphasis put on timing properties. In FTTD, events and gates are characterized by time parameters. FTTD are used in verification whether the IDS reacts sufficiently quick on the intrusions. As an example, "The Victim trusts the Intruder attack is analysed.
Type-based detection for unknown channels
Authors: D. H. Johnson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

A type is the histogram estimate of a stationary sequence's amplitude distribution. From training data, types are computed and use to determine which training data best describe subsequently obtained observations. Such type-based detectors are asymptotically optimal in the sense that the maximal exponential error rate is achieved. For digital communication systems using direct-sequence signaling, type-based detectors are shown to be effective. Training data are obtained from preambles, and then used to make individual bit decisions. Simulations show that in this communications scenario, type-based detectors yield nearly optimal performance without any a priori channel information.
Image Retrieval based on Wavelet Computation and Neural Network Classification
Authors: A. C. Gonzalez-Garcia, J. H. Sossa-Azuela, E. M. Felipe-Riveron
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

We describe a simple way to retrieve images from a database. During training a wavelet-based description of the histogram of circular window of each image is first obtained using Daubechies 4- wavelet transformation. Resulting coefficients are used to train a neural network (NN). For image retrieval an image is presented to the system. The system responds with the most similar images. Results are given two different databases. With first database a 98.44% of efficiency with training images was obtained; a 50 % was obtained with images different from those used for training. With the second database corresponding efficiencies were of 88% and 64%.
Polynomial Identity Testing for Depth 3 Circuits
Authors: Neeraj Kayal, Nitin Saxena
Venue: Computational Complexity (2007)

We study the identity testing problem for depth 3 arithmetic circuits ( $$\sum\prod\sum$$ circuit). We give the first deterministic polynomial time identity test for $$\sum\prod\sum$$ circuits with bounded top fanin. We also show that the rank of a minimal and simple $$\sum\prod\sum$$ circuit with bounded top fanin, computing zero, can be unbounded. These results answer the open questions posed by Klivans---Spielman (STOC 2001) and Dvir---Shpilka (STOC 2005).
Measuring the intellectual development of students using intelligent assessment software
Authors: B. M. Olds
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Most methods currently available to measure intellectual development in college students are either unreliable or prohibitively expensive and time consuming. To circumvent these difficulties, we have developed Cogito, a software package which used a neural network to find patterns in "noisy" paper-and-pencil data and relate them to the Perry or Reflective Judgment models of intellectual development. If we are successful, Cogito will provide an inexpensive and reliable alternative to current interview or paper-and-pencil tests. Our work to date shows a high correlation between interview and Cogito results.
A Firewall for Routers: Protecting against Routing Misbehavior
Authors: Ying Zhang, Z. Morley Mao, Jia Wang
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

In this work, we present the novel idea of route normalization by correcting on the fly routing traffic on behalf of a local router to protect the local network from malicious and misconfigured routing updates. Analogous to traffic normalization for network intrusion detection systems, the proposed RouteNormalizer patches ambiguities and eliminates semantically incorrect routing updates to protect against routing protocol attacks. Furthermore, it serves the purpose of a router firewall by identifying resource-based attacks against routers. Upon detecting anomalous routing changes, it suggests local routing policy modifications to improve route selection decisions. Deploying a RouteNormalizer requires no modification to routers if desired using a transparent TCP proxy setup. In this paper, we present the detailed design of the RouteNormalizer and evaluate it using a prototype implementation based on empirical BGP routing updates. We validate its effectiveness by showing that many well-known routing problems from operator mailing lists are correctly identified.
Regularly annotated set constraints
Authors: John Kodumal, Alex Aiken
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

A general class of program analyses area combination of context-free and regular language reachability. We define regularly annotated set constraints, a constraint formalism that captures this class. Our results extend the class of reachability problems expressible naturally in a single constraint formalism, including such diverse applications as interprocedural dataflow analysis, precise type-based flow analysis, and pushdown model checking.
Planning in problem solving: a case study in domotics
Authors: J. Bravo
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Simulation environments requiring the creation of a model previous to the simulation stage raise a challenge for the student. In these environments, the realization of the model itself, which is the basis for most of the richness of the acquired knowledge, is a difficult step. This is the reason why in some cases the learning goal is not achieved. We consider it very important to cope with this problem so that better support in model building can improve the free performance of the student. In this sense, we propose to include, before beginning the construction of the model, a tool allowing the expression of a first approach to the solution at a more abstract level. Finally, it is important to point out the necessity of collaboration of both the teacher and the student. In order to facilitate this, we define data structures containing, among other aspects, the student's performance. This performance could be revised by the teacher, who will advise students where to reinforce their knowledge on the modeling process. Collaboration can also provide an effective support for distance learning situations. The application domain is domotics, i.e. the integral automation of buildings and housing.
Verischemelog: Verilog embedded in scheme
Authors: James Jennings, Eric Beuscher
Venue: Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2 (1999)

Verischemelog (pronounced with 5 syllables, veruh-scheme-uh-log) is a language and programming environment embedded in Scheme for designing digital electronic hardware systems and for controlling the simulation of these circuits. Simulation is performed by a separate program, often a commercial product. Verischemelog compiles to Verilog, an industry standard language accepted by several commercial and public domain simulators. Because many design elements are easily parameterized, design engineers currently write scripts which generate hardware description code in Verilog. These scripts work by textual substitution, and are typically ad-hoc and quite limited. Preprocessors for Verilog, on the other hand, are hampered by their macro-expansion languages, which support few data types and lack procedures. Verischemelog obviates the need for scripts and preprocessors by providing a hard-ware description language with list-based syntax, and Scheme to manipulate it. An interactive development environment gives early and specific feedback about errors, and structured access to the compiler and run-time environment provide a high degree of reconfigurability and extensibility of Verischemelog.
Crash-only software
Authors: George Candea, Armando Fox
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Crash-only programs crash safely and recover quickly. There is only one way to stop such software--by crashing it--and only one way to bring it up--by initiating recovery. Crash-only systems are built from crash-only components, and the use of transparent component-level retries hides intra-system component crashes from end users. In this paper we advocate a crash-only design for Internet systems, showing that it can lead to more reliable, predictable code and faster, more effective recovery. We present ideas on how to build such crash-only Internet services, taking successful techniques to their logical extreme.
Training algorithms for a predictive classifier
Authors: P. V. S. Rao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Some aspects of training methods in building a predictive classification model are studied in the context of discriminating between the stop consonants based on their places of articulation. Two training algorithms are taken-up: one from the likelihood training category and the other from the discriminative training category. These algorithms are discussed in a unified framework using information theoretic concepts to bring out their advantages and limitations with reference to the classification task. The experimental studies on recognition confirm the usefulness of exploiting these advantages for modelling the stop consonant transition region by a predictor. A waveform based scalar predictor, trained by the modified maximum likelihood (first) algorithm shows a substantial reduction in pitch pulse interference. The significance of discriminatively training the predictive classifier using a maximum mutual information type (second) algorithm is brought out in a spectral prediction framework.
EC 2007 workshop outline -- DEECS 2007: the 3rd international workshop on data engineering issues in e-commerce and services
Authors: Mehmet Sayal, Martin Hepp
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

This workshop aims to provide a venue for discussion and exchange of ideas on data and knowledge engineering issues in the dynamic environment of e-business, enterprise computing, and business services and transformation.
Libckpt: transparent checkpointing under Unix
Authors: James S. Plank, Micah Beck, Gerry Kingsley, Kai Li
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

Checkpointing is a simple technique for rollback recovery: the state of an executing program is periodically saved to a disk file from which it can be recovered after a failure. While recent research has developed a collection of powerful techniques for minimizing the overhead of writing checkpoint files, checkpointing remains unavailable to most application developers. In this paper we describe libckpt, a portable checkpointing tool for Unix that implements all applicable performance optimizations which are reported in the literature. While libckpt can be used in a mode which is almost totally transparent to the programmer, it also supports the incorporation of user directives into the creation of checkpoints. This user-directed checkpointing is an innovation which is unique to our work.
The Mobile Digital Contents Distribution Scenario
Authors: Enrico Furregoni, Andrea Rangone, Filippo Maria Renga, Marta Valsecchi
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

The purpose of this work is to draw the possible reference scenario for Mobile Digital Contents' distribution and to detect the main macro variables that will drive the evolution process of this market. This paper aims at giving a better understanding of the Mobile Digital Contents' state of the art and the level of interaction between Mobile and other digital contents supply channels (Internet and TV), with a particular focus on the Italian situation. It begins with an analysis of the academic literature in order to create a rational background, and then, thanks to the experience collected during a series of interviews and case studies, it defines the main operating variables that will set the next steps of this markets. We defined three main strategic scenarios in order to better describe the medium long term market's evolution: a) real multichannel, when the customers can have access to the contents from any technology platform in an absolutely transparent way (strong discontinuity); b), commercial complementarity, when the rights' owners maximize the contents' value through the exploitation of a specialised offer for specific channels (medium-low discontinuity); c) absence of channel integration (maintenance of the state of the art). These three possible evolutions in distribution are likely to have a strong impact not only on mobile digital contents but also, in the medium-long term, on the whole digital contents' market.
Game/music interaction: an aural interface for immersive interactive environments
Authors: Chris Nelson, Burkhard C. Wünsche
Venue: Proceedings of the eight Australasian conference on User interface - Volume 64 (2007)

Game music has the potential to be much more than a passive element of the background. The music can and should affect the game play. The game play can and should affect the music. The player's actions can and should influence the direction and evolution of the music. By tightly linking game play and music, the player becomes much more immersed in the experience, and new creative possibilities abound for the developer. This paper presents a framework for linking game play to music by analysing music on a perceptual and a physical level. Real-time processing is achieved by using the GPU as an APU. The usefulness of the framework is demonstrated by two examples of game play synchronised with auditory perceptions. It is our hope that this paper will enable and stimulate the reader to create musically interactive games, and discovering entirely new ideas in this field.
Quorum Based IP Address Autoconfiguration in Mobile Ad Hoc Networks
Authors: Tinghui Xu, Jie Wu
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

IP address autoconfiguration poses a challenge for mobile ad hoc networks (MANETs) since it has to be done to ensure correct routing. Protocols for IP address autoconfiguration can be classified into two categories. In the stateless category, nodes in the network do not keep IP allocation information, thus duplicate address detection (DAD) is used to resolve possible address conflicts. Protocols in the stateful category require nodes, cooperatively or separately, to maintain state information and ensure address uniqueness. They use either a full replication or no replication scheme to maintain IP information. In this paper, we propose a quorum based IP address autoconfiguration protocol in MANETs using partial replication. Making the compromise between message overhead and data consistency, quorum voting enforces data consistency by ensuring a fresh read upon every access so that each node is configured with a unique IP address. The protocol is scalable and no central server is involved. Extensive experiments are implemented comparing the configuration latency, message overhead and address reclamation cost between our protocol and existing stateful protocols. The simulation results show that nodes are configured in lower latency and the message overhead for maintaining the network is fairly low. Moreover, the proposed protocol greatly enhances the address availability by keeping proper redundancy.