ppxscal/embedding_network huggingface dataset:
Non-linear prefixes in query languages
Authors: Antonio Badia, Stijn Vansummeren
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

In first order logic there are two main extensions to quantification: generalized quantifiers and non-linear prefixes. While generalized quantifiers have been explored from a database perspective, non-linear prefixes have not-most likely because of complexity concerns. In this paper we first illustrate the usefulness of non-linear prefixes in query languages by means of example queries. We then introduce the subject formally, distinguishing between two forms of non-linearity: branching and cumulation. To escape complexity concerns, we focus on monadic quantifiers. In this context, we show that branching does not extend the expressive power of first order logic when it is interpreted over finite models, while cumulation does not extend the expressive power when it is interpreted over bounded models. Branching and cumulation do, however, allow us to formulate some queries in a succinct and elegant manner. When branching and cumulation are interpreted over infinite models, we show that the resulting language can be embedded in an infinitary logic proposed by Libkin. We also discuss non-linear prefixes from an algorithmic point of view.
Research Library: A New Look of Academic Digital Libraries
Authors: Aditya M. Bhide, Yoo Jae Heung, Choi Mun Kee
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Information technology has leverage the efficiency of research activities in many aspects. There is a dramatic increment in the numbers of academic digital libraries these days; but it is observed that most of them are not exploited to their full usage. We propose a web application in form of research library where one can customize research resources to fit their needs. Research library is a specialized academic digital library which also enables researchers to create a virtual space where they can integrate their own research resources. This paper introduces user interface prototype which mainly differentiates such research library from any other current web applications or libraries. The light is also thrown on its key features. The research library can be viewed as a new look of academic digital library which is treated as noisy environment most of the time by researchers.
Characteristics of the Vold-Kalman order tracking filter
Authors: H. Herlufsen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The filter characteristics of the Vold-Kalman (1993, 1960, 1961) order tracking filter are presented. Both the frequency response as well as the time response and their time-frequency relationship have been investigated for different filter types and guidelines for optimum choice of filter parameters are presented. The Vold-Kalman filter allows for the high performance simultaneous tracking of orders in systems with multiple independent shafts. With this new filter and using multiple tacho references, waveforms, as well as amplitude and phase may be extracted without the beating interactions that are associated with conventional methods. Orders extracted as waveforms have no phase bias, and may hence be used for playback, synthesis and tailoring.
Spike-timing-dependent plasticity for neurons with recurrent connections
Authors: A. N. Burkitt, M. Gilson, J. L. van Hemmen
Venue: Biological Cybernetics (2007)

The dynamics of the learning equation, which describes the evolution of the synaptic weights, is derived in the situation where the network contains recurrent connections. The derivation is carried out for the Poisson neuron model. The spiking-rates of the recurrently connected neurons and their cross-correlations are determined self- consistently as a function of the external synaptic inputs. The solution of the learning equation is illustrated by the analysis of the particular case in which there is no external synaptic input. The general learning equation and the fixed-point structure of its solutions is discussed.
Privacy protection in personalized search
Authors: Xuehua Shen, Bin Tan, ChengXiang Zhai
Venue: ACM SIGIR Forum (2007)

Personalized search is a promising way to improve the accuracy of web search, and has been attracting much attention recently. However, effective personalized search requires collecting and aggregating user information, which often raise serious concerns of privacy infringement for many users. Indeed, these concerns have become one of the main barriers for deploying personalized search applications, and how to do privacy-preserving personalization is a great challenge. In this paper, we systematically examine the issue of privacy preservation in personalized search. We distinguish and define four levels of privacy protection, and analyze various software architectures for personalized search. We show that client-side personalization has advantages over the existing server-side personalized search services in preserving privacy, and envision possible future strategies to fully protect user privacy.
Security Monitoring Using Wireless Sensor Networks
Authors: Abdellah Chehri, Paul Fortier, Pierre-Martin Tardif
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

The underground environment is a harsh and hazardous workspace for plant and personnel. It is damp, dusty and hot, there is a risk of roof and rock falling and the atmosphere can be potentially explosive. Recent incidents are a reminder of how crucial safety is in mining. The increasing miniaturization of RF devices and microelectromechanical systems (MEMS) and the advances in wireless technologies have generated a great deal of research interest in the area of wireless sensor networks (WSN). Sensor networks provide a promising infrastructure for gathering information about parameters of the physical world. Such networks have many applications in military and civilian environments. In this paper, a new wireless sensor network architecture is introduced for surveillance and security monitoring of underground mines and confined areas.
Local embeddings of metric spaces
Authors: Ittai Abraham, Yair Bartal, Ofer Neiman
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

In many application areas, complex data sets are often representedby some metric space and metric embedding is used to provide a more structured representation of the data. In many of these applications much greater emphasis is put on the preserving the local structure of the original space than on maintaining its complete structure. This is also the case in some networking applications where "small world" phenomena in communication patterns has been observed. Practical study of embedding has indeed involved with finding embeddings with this property. In this paper we initiate thestudy of local embeddings of metric spaces and provide embeddings with distortion depending solely on the local structureof the space.
Anonymous Transmission of Quantum Information
Authors: Jan Bouda, Josef Sprojcar
Venue: Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies (2007)

We propose first protocol for anonymous distribution of quantum information that can be used to implement either channel with anonymous sender or channel with anonymous receiver. Our protocol achieves anonymity and message secrecy with unconditional security. It uses classical anonymous transfer. It tolerates disruption of the protocol, but the number of disrupters must be limited by the quantum Gilbert-Varshamov bound. This bound can be exceeded provided a specific entanglement distillation procedure will be used. A different version of the protocol tolerates any number of disrupters, but is secure only when receiver does not actively cooperate with other corrupted participants. Simplified version of this protocol was experimentally realized for 5 participants, but with different motivation, see [1].
Pivot-Free Block Matrix Inversion
Authors: Stephen M. Watt
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

We present a pivot-free deterministic algorithm for the inversion of block matrices. The method is based on the Moore-Penrose inverse and is applicable over certain general classes of rings. This improves on previous methods that required at least one invertible on-diagonal block, and that otherwise required row- or column-based pivoting, disrupting the block structure. Our method is applicable to any invertible matrix and does not require any particular blocks to invertible. This is achieved at the cost of two additional specialized matrix multiplications and, in some cases, requires the inversion to be performed in an extended ring.
PRACTI replication
Authors: Nalini Belaramani, Mike Dahlin, Lei Gao, Amol Nayate, Arun Venkataramani, Praveen Yalagandula, Jiandan Zheng
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

We present PRACTI, a new approach for large-scale replication. PRACTI systems can replicate or cache any subset of data on any node (Partial Replication), provide a broad range of consistency guarantees (Arbitrary Consistency), and permit any node to send information to any other node (Topology Independence). A PRACTI architecture yields two significant advantages. First, by providing all three PRACTI properties, it enables better trade-offs than existing mechanisms that support at most two of the three desirable properties. The PRACTI approach thus exposes new points in the design space for replication systems. Second, the flexibility of PRACTI protocols simplifies the design of replication systems by allowing a single architecture to subsume a broad range of existing systems and to reduce development costs for new ones. To illustrate both advantages, we use our PRACTI prototype to emulate existing server replication, client-server, and object replication systems and to implement novel policies that improve performance for mobile users, web edge servers, and grid computing by as much as an order of magnitude.
Effective speaker adaptations for speaker verification
Authors: Sungjoo Ahn
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper concerns effective speaker adaptation methods to solve the over-training problem in speaker verification, which frequently occurs when modeling a speaker with sparse training data. While various speaker adaptations have already been applied to speech recognition, these methods have not yet been formally considered in speaker verification. This paper proposes speaker adaptation methods using a combination of maximum a posteriori (MAP) and maximum likelihood linear regression (MLLR) adaptations, which are successfully used in speech recognition, and applies to speaker verification. Our aim is to remedy the small training data problem by investigating effective speaker adaptations for speaker modeling. Experimental results show that the speaker verification system using a weighted MAP and MLLR adaptation outperforms that of the conventional speaker models without adaptation by a factor of up to 5 times. From these results, we show that the speaker adaptation method achieves significantly better performance even when only small training data is available for speaker verification.
Electronic conferencing in undergraduate engineering classes
Authors: V. A. Burrows
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Two different electronic conferencing programs have been used in undergraduate engineering classes at Arizona State University, USA. The capabilities of these programs are compared to faculty-generated "wants" and "needs" for electronic conferencing. Classroom experience with small and large, lower and upper division engineering classes are described, and student feedback is used to highlight specific strengths and weaknesses of the conferencing programs described. The authors have found that faculty and student satisfaction with electronic conferencing depends very strongly on the organization of topics within the conference, on ease of learning of the conferencing program, on the appearance of the program interface, on simplicity of program use and on the quality of instructional materials, whether online or offline. Specific examples are cited. Potential future applications of electronic conferencing in an academic environment go well beyond conferencing within a course, and include departmental, programmatic and student organization bulletin boards, cross-department, cross-college and even inter-university topical bulletin boards, and there is strong potential for such programs to facilitate direct contact between industry and students within the context of course topics. 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
Courier Assignment in Social Networks
Authors: Jeffrey V. Nickerson, Stephan Olariu
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Integration is important in politics, business, and technology. In all these fields, the definition of integration is vague. We build a formal measure of integration based on the latency of communication, and show how it can be used to optimize a courier assignment problem. Through simulation, we show how networks grow as couriers are added. Our measure captures the tradeoff between locality and expansion, as well as providing a model for triangle closure. Finally, we form conjectures about political integration which can be tested through empirical research.
Effective heuristic methods of dna strand design
Authors: Dan C. Tulpan
Venue:  (2006)

Sets of DNA strands that satisfy combinatorial and thermodynamic properties play an important role in various approaches to biomolecular computations, nano structure design, molecular tagging, and DNA microarrays. The problem of designing such sets of DNA strands appears to be computationally hard. This thesis introduces new algorithms for design of DNA strand sets that satisfy any of several combinatorial and thermodynamic constraints, which aim to maximize desired hybridization between strands and their complements, while minimizing undesired cross-hybridizations. To heuristically search for good strand sets for bio-computing applications, our algorithms use a conflict-driven stochastic local search approach, which is known to be effective in solving comparable search problems.We describe new and improved thermodynamic measures of the quality of strand sets. With respect to these measures of quality, our algorithms consistently find, within reasonable time, sets that are significantly better than previously published sets in the literature. We also present a detailed analysis and selection of heuristics for improving the quality of DNA strand selection criteria with direct applications in microarray probe design.
Query-load balancing in structured overlays
Authors: Anwitaman Datta, Roman Schmidt, Karl Aberer
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take care of it. We expose that caching, while necessary, is not in itself sufficient. We then provide simple and effective load-aware variants of the standard greedy routing used in overlays, exploiting routing redundancy originally needed for fault-tolerance, to achieve very good query loadbalancing.
An optimal replacement policy for a two-component series system assuming geometric process repair
Authors: Guan Jun Wang, Yuan Lin Zhang
Venue: Computers Mathematics with Applications (2007)

This article studies a series repairable system consisting of two non-identical components and one repairer. It is assumed that each component after repair in the system is not ''as good as new''. Under this assumption, by using a geometric process repair model, a replacement policy (M,N) is considered, based on the number of failures of component 1 and component 2. The problem is to determine an optimal replacement policy (M^*,N^*) such that the long-run expected cost per unit time is minimized. The explicit expression for the long-run expected cost per unit time is derived and the corresponding optimal replacement policy can be determined analytically or numerically. Finally, an appropriate numerical example is given to illustrate some theoretical results included the sensitivity analysis and the uniqueness of the optimal replacement policy (M^*,N^*).
Quantum period reconstruction of approximate sequences
Authors: Igor E. Shparlinski, Arne Winterhof
Venue: Information Processing Letters (2007)

We consider the problem of determining the period of a sequence over an unknown finite field, given a black-box which returns only a few most significant bits of the sequence elements. For sequences with small autocorrelation we prove the existence of a polynomial time quantum algorithm for the above problem based on an algorithm of Hales and Hallgren.
A P2P Sensor Framework for Collaborative Robots Manipulation
Authors: Abdur Rahman, Suruz Miah, Wail Gueaieb, Abdulmotaleb El Saddik
Venue: Proceedings of the Second International Conference on Systems (2007)

We propose an open hardware and software architecture for the cooperative coordination of multiple mobile robots operating in a common environment. It is designed to meet the stringent requirements of loosely coupled multi-robot architectures, such as flexibility, reliability, and fault-tolerance. As such, the proposed architecture enables the robots to deal with various types of uncertainties in their operating environments. The proposed architecture takes advantage of scalable sensorybased P2P framework. It also offers an inter-robot communication protocol, which is specifically designed to satisfy the requirements of physical sensory data publishing and fusion. The architecture is implemented and evaluated on a team of indoor mobile robots. The test results manifest the architecture's distinguished features and capabilities.
DfT for the Reuse of Networks-on-Chip as Test Access Mechanism
Authors: Alexandre M. Amory, Frederico Ferlini, Marcelo Lubaszewski, Fernando Moraes
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

This paper presents new DfT modules required to use networks-on- chip as test access mechanism. We demonstrate that the proposed DfT modules can be also implemented on top of low cost networks-on-chip, i.e. networks without complex services. The DfT modules, which consist of test wrappers and test pin interfaces, are designed such that both the tester and CUTs transport test data unaware of the network. We analyse the DfT modules in terms of silicon area and test time, considering different network and test configurations.
Engineering change protocols for behavioral synthesis
Authors: D. Kirovski
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Rapid prototyping and development of in-circuit and FPGA-based emulators as key accelerators for fast time-to-market has resulted in a need for fast error correction mechanisms. The fabricated or emulated prototypes upon error diagnosis require quick and as much as possible flexible engineering change (EC). However, this problem has initiated research activity mainly in the logic synthesis domain. We introduce the first set of EC protocols for behavioral synthesis. The protocols support both the pre- and post-processing EC paradigms. In addition, instead of developing special algorithms for EC which is the adopted research model, as a key contribution, we show that using protocols which facilitate constraint manipulation of the initial design specification there is no need for development of specialized EC algorithms. The EC process is performed using the standard optimization algorithms on the modified design. Nevertheless, as shown on a number of behavioral synthesis tasks including: resource assignment, design partitioning, and operation scheduling, the approach provides variable and guaranteed flexibility for incremental synthesis with minimal hardware overhead.
A Customized Open Source Content Management System to Support Collaborative Distance Learning: The J@LON Platform
Authors: Pascal Staccini, Christophe Bordonado, Jerome Alet, Michel Joubert, Jean-Charles Dufour, Marius Fieschi
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Aimed at supporting a distance learning graduate course in "Quality and Risk Management in Healthcare" (ESSQU@D course), a collaborative learning environment has been designed and implemented (J@LON platform). This full web based authoring tool is based on an object-oriented programming framework (Zope) and implements both native and customized features of a content management product (Plone). The system handles a core component, called a lesson. It allows teachers to aggregate single resources (documents, quiz, glossary term...). It provides students with a consistent and structured view of the content of a lesson. The web based platform was initially developed to meet specific needs of the medicine campus. It has been extended to support the whole publishing process of pedagogical resources in the university. Its integration in the university information system is partly achieved with single sign on features (CAS authentication). Access to a centralized description of curricula still remains to enhance: it depends on an institutional reviewing of the database according to the policies of License, Master, and Doctorate schema. A multidisciplinary configuration of the platform is available, allowing students and teachers to be involved in several courses handled by a same instance of Zope / Plone.