ppxscal/embedding_network huggingface dataset:
Aspects of sentence retrieval
Authors: W. Bruce Croft
Venue:  (2006)

Sentence Retrieval is the task of retrieving a relevant sentence in response to a query, a question, or a reference sentence. Tasks such as question answering, summarization, novelty detection, and information provenance make use of a sentence-retrieval module as a preprocessing step. The performance of these systems is dependent on the quality of the sentence-retrieval module. Other tasks such as information extraction and machine translation operate on sentences, either using them as training data, or as the unit of input or output (or both), and may benefit from sentence retrieval to build a training corpus, or as a post-processing step. In this thesis we begin by demonstrating that because sentences are much smaller than documents, the performance of typical document retrieval systems on the retrieval of sentences is significantly worse. We propose several solutions to the problem of sentence retrieval, and investigate these solutions the application areas of sentence retrieval for question answering, novelty detection, and information provenance. The context of a sentence affects its meaning, and we demonstrate that smoothing from the local context of the sentence improves retrieval when the collection to be retrieved from contains many documents of unknown relevance. We show that statistical translation models are appropriate for tasks where the sentence to be retrieved has many terms in common with the query, but still benefits from the addition of related terms and synonyms. We show that queries of very few terms benefit from the translation approach, which incorporates related terms into the query. We show that the family of language modeling approaches, which includes statistical translation models, is not effective for discriminating between sentences that uses the same vocabulary to express the same information, and sentences that use the same vocabulary to express new information. Finally, we demonstrate a conditional model for sentence retrieval for question answering, and show that it outperforms both the translation approaches and the baseline language-modeling approach.
2007 Special Issue: Recurrent neural network modeling of nearshore sandbar behavior
Authors: Leo Pape, B. G. Ruessink, Marco A. Wiering, Ian L. Turner
Venue: Neural Networks (2007)

The temporal evolution of nearshore sandbars (alongshore ridges of sand fringing coasts in water depths less than 10 m and of paramount importance for coastal safety) is commonly predicted using process-based models. These models are autoregressive and require offshore wave characteristics as input, properties that find their neural network equivalent in the NARX (Nonlinear AutoRegressive model with eXogenous input) architecture. Earlier literature results suggest that the evolution of sandbars depends nonlinearly on the wave forcing and that the sandbar position at a specific moment contains 'memory', that is, time-series of sandbar positions show dependencies spanning several days. Using observations of an outer sandbar collected daily for over seven years at the double-barred Surfers Paradise, Gold Coast, Australia several data-driven models are compared. Nonlinear and linear models as well as recurrent and nonrecurrent parameter estimation methods are applied to investigate the claims about nonlinear and long-term dependencies. We find a small performance increase for long-term predictions (>40 days) with nonlinear models, indicating that nonlinear effects expose themselves for larger prediction horizons, and no significant difference between nonrecurrent and recurrent methods meaning that the effects of dependencies spanning several days are of no importance.
On minimizing hierarchical mesh coding overhead: (HASM) hierarchical adaptive structured mesh approach
Authors: W. Badawy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper presents an efficient mesh coding technique suitable for MPEG-4 video applications. The proposed technique significantly reduces the number of bits that are used to describe the mesh topology. It uses an adaptive structured mesh from coarse to fine, which can be coded as a count of splitting instead of nodes' locations. In the case of the quadtree, less than one bit per node can be achieved. This reduction induces an improvement of either the image quality or the global bit rate.
Full-text federated search in peer-to-peer networks
Authors: Jie Lu
Venue: ACM SIGIR Forum (2007)

Peer-to-peer (P2P) networks integrate autonomous computing resources without requiring a central coordinating authority, which makes them a potentially robust and scalable model for providing federated search capability to large-scale networks of text digital libraries. However, P2P networks have so far mostly used simple search techniques based on document names or controlled-vocabulary terms, and provided very limited support for full-text search of document contents.
A cross-referencing-based droplet manipulation method for high-throughput and pin-constrained digital microfluidic arrays
Authors: Tao Xu, Krishnendu Chakrabarty
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Digital microfluidic biochips are revolutionizing high-throughput DNA sequencing, immunoassays, and clinical diagnostics. As high-throughput bioassays are mapped to digital microfluidic platforms, the need for design automation techniques for pin-constrained biochips is being increasingly felt. However, most prior work on biochips CAD has assumed independent control of the underlying electrodes using a large number of (electrical) input pins. We propose a droplet manipulation method based on a "cross-referencing" addressing method that uses "row" and "columns" to access electrodes. By mapping the droplet movement problem to the clique partitioning problem from graph theory, the proposed method allows simultaneous movement of a large number of droplets on a microfluidic array. This in turn facilitates high-throughput applications on a pin-constrained biochip. We use random synthetic benchmarks and a set of multiplexed bioassays to evaluate the proposed method.
MIMO Volterra filter equalization using pth-order inverse approach
Authors: Fang Yangwang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The equalization of nonlinear systems is an important application of Volterra filters. The pth-order inverse is one of the important approaches of Volterra equalization, but up to the present it has only been applied to the single-input multiple-output (SISO) case. The convergence of the Volterra filter equalization and the error bound using the pth-order approximation equalizer instead of the Volterra equalizer have not yet been reported. In this paper, we generalize this method to the multi-input and multi-output (MIMO) Volterra filter case, and discuss the convergence of Volterra filter equalization and the error bound using the pth-order approximation equalizer instead of the Volterra equalizer. The concept of local I/sub 2/ stability for the MIMO Volterra filter is first introduced, and then the algorithmic formula of the pth-order inverse is presented by using the multi-dimensional z-transform. In the end, the convergence of the MIMO Volterra filter equalization and the error bound using the pth-order approximation equalizer instead of the Volterra equalizer are discussed. The proposed algorithms are corroborated with a simulation example.
A bi-dimensional coding scheme applied to audio bitrate reduction
Authors: L. Mainard
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We present an audio bidimensional encoding scheme. Taking advantage of a new complex filter-bank, and of a regular lattice associated with a new hexagonal projection kernel, this scheme provides each step of the encoder and of the decoder with fast algorithms, which keeps the overall complexity low. Moreover variable or fix length encodings are available without a look-up table. The results show a very good quality at 80 kbit/s for monophonic signals, and a significant improvement with respect to normalized algorithms of a similar complexity.
Marking time in sequence mining
Authors: Carl H. Mooney, John F. Roddick
Venue: Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61 (2006)

Sequence mining is often conducted over static and temporal datasets as well as over collections of events (episodes). More recently, there has also been a focus on the mining of streaming data. However, while many sequences are associated with absolute time values, most sequence mining routines treat time in a relative sense, only returning patterns that can be described in terms of Allen-style relationships (or simpler). In this work we investigate the accommodation of timing marks within the sequence mining process. The paper discusses the opportunities presented and the problems that may be encountered and presents a novel algorithm, INTEM&trade;, that provides support for timing marks. This enables sequences to be examined not only in respect of the order and occurrence of tokens but also in terms of pace. Algorithmic considerations are discussed and an example provided for the case of polled sensor data.
From Standard Definition to High Definition Migration in Current Digital Video Broadcasting
Authors: Kamil Bodecek, Vit Novotny
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

Digital video broadcasting -- terrestrial (DVB-T) is important occasion in these days. But HDTV broadcasting is not widely used in Europe in DVB-T nets due high bandwidth requirements. Several solutions of this problem are discussed in this paper. Scalable video coding is the first choice but not very useful. MPEG-4 AVC coding algorithm brings a lot of new features and better compression efficiency also. But differential frame coding is going further. Proposed method can handle a problem with migration from Standard Definition (SD) to High Definition (HD) resolution and saving of the bandwidth in DVB-T nets.
Inference of network properties from active and passive measurements on wired/wireless networks: a modeling approach
Authors: Jim Kurose, Don Towsley
Venue:  (2006)

In this thesis, we propose several inference techniques to discover network properties for wired and wireless networks from active and passive measurements. These techniques are used to identify the existence of a dominant congested link, classify the access network type of an end host, and determine the fraction of wireless traffic in a large network. We first propose a model-based approach that uses periodic end-end probes to identify whether a "dominant congested link" exists along an end-end path. We provide a formal yet intuitive definition of dominant congested link and present two simple hypothesis tests to identify whether such a link exists. We then present and examine several novel model-based approaches for identifying a dominant congested link that are based on interpreting probe loss as an unobserved (virtual) delay. We develop parameter inference algorithms for Hidden Markov Models (HMMs) and Markov models with a hidden dimension to infer this virtual delay. We further estimate the maximum queuing delay of the dominant congested link, once we identify that a dominant congested link exists. We next propose a simple and efficient end-end scheme to classify an access network one of three categories: Ethernet, wireless LAN and low-bandwidth connection. Our scheme leverages off of intrinsic characteristics of the various access networks and utilizes the median and entropy of packet pair interarrival times. Extensive experiments show that our scheme obtains accurate classification results within 2 seconds. Last, we propose a classification scheme to differentiate Ethernet and WLAN TCP flows based on measurements collected passively at the edge of a large network. This classifier computes the fraction of wireless TCP flows, and the degree of belief that a TCP flow traverses a WLAN inside the network. The core of this classifier is an iterative Bayesian inference algorithm developed to obtain the maximum likelihood estimate (MLE) of these quantities. We apply the classifier to various traces collected at the edge of the UMass campus network and infer that 11-14% of all TCP flows coming into UMass campus traverse a 802.11 wireless link within the campus. We also detect wireless usage (through the use of private routers and access points) in areas not covered by the official wireless infrastructure.
On inferences of full hierarchical dependencies
Authors: Sven Hartmann, Sebastian Link
Venue: Proceedings of the thirtieth Australasian conference on Computer science - Volume 62 (2007)

Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its projections without loss of information. Therefore, FHDs generalise multivalued dependencies (MVDs) in which case the number of these projections is precisely two. The implication of FHDs has been defined in the context of some fixed finite universe. This paper identifies a sound and complete set of inference rules for the implication of FHDs. This ax-iomatisation is very reminiscent of that for MVDs. Then, an alternative notion of FHD implication is introduced in which the underlying set of attributes is left undetermined. The main result proposes a finite axiomatisation for FHD implication in undetermined universes. Moreover, the result clarifies the role of the complementation rule as a mere means of database normalisation. In fact, an axiomatisation for FHD implication in fixed universes is proposed which allows to infer any FHDs either without using the complementation rule at all or only in the very last step of the inference. This also characterises the expressiveness of an incomplete set of inference rules in fixed universes. The results extend previous work on MVDs by Biskup.
Increasing TLB reach with multiple pages size subblocks
Authors: M. Piccardi
Venue: Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International (2002)

While superpages are an efficient solution to increase TLB reach, strong requirements for using superpages hinder an actual utilization. Subblock TLBs release some of these requirements and thus increase the actual utilization of superpages by attaching afield per subblock (or base page) in a superpage. On the other hand, its superpage size is strongly restricted because the number of attached fields should be the same with the superpage size in base page unit. We propose VS-TLBs (Variable-size Subblock TLB), which extend subblock TLBs to allow a subblock to be multiple base pages, while the subblock size in subblock TLBs is a base page. Therefore, with the same number of the attached fields, the TLB reach of VS-TLBs becomes much larger than subblock TLBs. By virtue of the increased TLB reach, the number of TLB misses are reduced considerably. We propose two system configurations: VS-TLB alone and VS-hybrid. VS-hybrid replaces the subblock TLB with VS-TLB in the hybrid scheme of the subblock TLB and the shadow memory. The simulation results show that the two proposed configurations reduce 52% and 67% of TLB misses from the results of their parent systems.
A Method to Search ARX Model Orders and Its Application to Sales Dynamics Analysis
Authors: Kenta Fukata, Takashi Washio, Hiroshi Motoda
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

An Auto-Regressive eXogenous input (ARX) model has been widely used in engineering fields to model dynamic response of a system to exogenous factors. A difficulty in this modeling is the determination of an appropriate model complexity, i.e., orders, for given data. In this paper, we develop a new and practical approach to determine the appropriate orders. Moreover, we apply the developed technique to a real marketing data, and analyze dynamic response character of sales amount to advertisement and sales promotion. In marketing study, static response of sales to some exogenous factors such as advertisement and sales promotion have been analyzed. However, if we can model dynamic response of sales to exogenous factors, more precise strategies of the sales to reduce the risk of the item stock management and increase the associated profit can be designed.
Pastures: Towards Usable Security Policy Engineering
Authors: Sergey Bratus, Alex Ferguson, Doug McIlroy, Sean Smith
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Whether a particular computing installation meets its security goals depends on whether the administrators can create a policy that expresses these goals security in practice requires effective policy engineering. We have found that the reigning SELinux model fares poorly in this regard, partly because typical isolation goals are not directly stated but instead are properties derivable from the type definitions by complicated analysis tools. Instead, we are experimenting with a security-policy approach based on copy-on-write "pastures, in which the sharing of resources between pastures is the fundamental security policy primitive. We argue that it has a number of properties that are better from the usability point of view. We implemented this approach as a patch for the 2.6 Linux kernel.
Coverage-Based Testing on Embedded Systems
Authors: X. Wu, J. Jenny Li, D. Weiss, Y. Lee
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

One major issue of code coverage testing is the overhead imposed by program instrumentation, which inserts probes into the program to monitor its execution. In real-time systems, the overhead may alter the program execution behavior or impact its performance due to its strict requirement on timing. Coverage testing is even harder on embedded systems because of their critical and limited memory and CPU resources. This paper describes a case study of a coverage-based testing method for embedded system software focusing on minimizing instrumentation overhead. We ported a code coverage-based test tool to an in-house embedded system, IP phone. In our initial experiments, we found that this tool didn't affect the behavior of the program under test.
Decoding the structure of the WWW: A comparative analysis of Web crawls
Authors: M. Ángeles Serrano, Ana Maguitman, Marián Boguñá, Santo Fortunato, Alessandro Vespignani
Venue: ACM Transactions on the Web (TWEB) (2007)

The understanding of the immense and intricate topological structure of the World Wide Web (WWW) is a major scientific and technological challenge. This has been recently tackled by characterizing the properties of its representative graphs, in which vertices and directed edges are identified with Web pages and hyperlinks, respectively. Data gathered in large-scale crawls have been analyzed by several groups resulting in a general picture of the WWW that encompasses many of the complex properties typical of rapidly evolving networks. In this article, we report a detailed statistical analysis of the topological properties of four different WWW graphs obtained with different crawlers. We find that, despite the very large size of the samples, the statistical measures characterizing these graphs differ quantitatively, and in some cases qualitatively, depending on the domain analyzed and the crawl used for gathering the data. This spurs the issue of the presence of sampling biases and structural differences of Web crawls that might induce properties not representative of the actual global underlying graph. In short, the stability of the widely accepted statistical description of the Web is called into question. In order to provide a more accurate characterization of the Web graph, we study statistical measures beyond the degree distribution, such as degree-degree correlation functions or the statistics of reciprocal connections. The latter appears to enclose the relevant correlations of the WWW graph and carry most of the topological information of the Web. The analysis of this quantity is also of major interest in relation to the navigability and searchability of the Web.
Mobile Location Using Super-resolution Algorithms
Authors: Raul O. Gonzalez-Pacheco, Felipe Catedra
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

This article focuses on the localisation of radiating sources that are in line of sight, using calculations encompassing wide ranges of an electromagnetic signal. The purpose of using the MUSIC algorithm is to consider the distance at which the transmitting antennas are, implementing a measurement procedure throughout simulations. In order to do these simulations we use a tool that determines the value of the real surroundings electromagnetic field under study and that is validated to provide trustworthy results in a reduced runtime. Thus the signal spatial signature is observed.
A Distributed QoS Routing and CAC Framework: Performance Evaluation of Its SSRA and InterD Agents
Authors: Leonard Barolli, Makoto Ikeda, Arian Durresi, Fatos Xhafa, Akio Koyama
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

In order to support multimedia communication, it is necessary to develop routing algorithms which use for routing more than one QoS parameters. This is because new services such as video on demand and remote meeting systems require better QoS. Also, for admission control of multimedia applications different QoS parameters should be considered. In our previous work, we proposed an intelligent routing and CAC strategy using cooperative agents. In this paper, we propose and evaluate the performance of SSRA algorithm and a GA-based InterD agent. Performace evaluation shows that proposed agents have a good behavior.
Database-aware semantically-smart storage
Authors: Muthian Sivathanu, Lakshmi N. Bairavasundaram, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

Recent research has demonstrated the potential benefits of building storage arrays that understand the file systems above them. Such "semantically-smart" disk systems use knowledge of file system structures and operations to improve performance, availability, and even security in ways that are precluded in a traditional storage system architecture. In this paper, we study the applicability of semantically smart disk technology underneath database management systems. For three case studies, we analyze the differences when building database-aware storage. We find that semantically-smart disk systems can be successfully applied underneath a database, but that new techniques, such as log snooping and explicit access statistics, are needed.