ppxscal/embedding_network huggingface dataset:
Efficient Approximate Query Processing in Peer-to-Peer Networks
Authors: Benjamin Arai, Gautam Das Dimitrios Gunopulos, Vana Kalogeraki
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Peer-to-peer (P2P) databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large-scale ad hoc analysis queries, for example, aggregation queries, on these databases poses unique challenges. Exact solutions can be time consuming and difficult to implement, given the distributed and dynamic nature of P2P databases. In this paper, we present novel sampling-based techniques for approximate answering of ad hoc aggregation queries in such databases. Computing a high-quality random sample of the database efficiently in the P2P environment is complicated due to several factors: the data is distributed (usually in uneven quantities) across many peers, within each peer, the data is often highly correlated, and, moreover, even collecting a random sample of the peers is difficult to accomplish. To counter these problems, we have developed an adaptive two-phase sampling approach based on random walks of the P2P graph, as well as block-level sampling techniques. We present extensive experimental evaluations to demonstrate the feasibility of our proposed solution.
Low complexity optimal multiple access joint detection for linearly dependent user sets
Authors: R. E. Learned
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The general problem of joint detection of linearly dependent users in an uncoded multiple access (MA) system is N-P hard. We look to exploit the existing structure in our problem so that low complexity algorithms may be devised to yield the optimal solution. Advantage is taken over the design of user signatures in a typical MA communication system. By imposing a hierarchical cross-correlation structure on the user signature waveforms, the receiver design problem is reduced so that it is no longer N-P complete. A tree joint detection algorithm which takes advantage of such a cross-correlation structure is presented. The tree detector gives the optimal estimate with an extremely low computational complexity that is typically low-order-polynomial in the number of users. This is an enormous savings in computations over the O(2/sup K/) computations needed if the signatures did not exhibit any structure.
Client-Based Spatial Browsing on the World Wide Web
Authors: Frantisek Brabec, Hanan Samet
Venue: IEEE Internet Computing (2007)

Being able to visualize both spatial and nonspatial data is becoming increasingly important to today's Internet users. Spatial data viewers and query tools can aid in visualization, but they should also let users access data instantly and with minimal effort. The authors explore new ways to allow visualization of data stored in a central server database on a simple client. They also consider usage scenarios in which transferring the whole database to the client for processing isn't feasible due to the amount of data on the server, insufficient computing power on the client, and a slow link between the two.
On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication
Authors: Kannan Srinathan, N. R. Prasad, C. Pandu Rangan
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

In the perfectly secure message transmission (PSMT) problem, two synchronized non-faulty players (or processors), the Sender S and the Receiver R are connected by n wires (each of which facilitates 2-way communication); S has a message, represented by a sequence of - elements from a finite field, that he wishes to send to R; after exchanging messages in phases R should correctly obtain S's message, while an adversary listening on and actively controlling any set of t (or less) wires should have no information about S's message. Similarly, in the problem of perfect reliable message transmission (PRMT), the receiver R should correctly obtain S's message, in spite of the adversary actively controlling any set of t (or less) wires.
Design Methodology and CAD Tools for Prototyping Delta-Sigma Fractional-N Frequency Synthesizers
Authors: Himanshu Arora, Nikolaus Klemmer, Thomas Jochum, Patrick Wolf
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

In this paper we present the design flow for a fractional-N (frac-N) frequency synthesizer prototype from the system level conceptualization of the PLL to its hardware implementation. The prototyping hardware consists of a of frac-N PLL IC designed in TSMC 0.18ìm mixed signal/RF CMOS process mounted on a RF prototype impedance controlled board. The RF board is interfaced to a digital delta sigma modulator (DSM) realized in a Xilinx FPGA on a commercial evaluation board. Matlab was employed for the system level PLL design. The TSMC 0.18ìm CMOS Process Design Kit was used for the frac-N IC realization. Verilog HDL was used for the implementation of the DSM in the FPGA. With an FPGA based DSM platform, prototypes for different communication modulation formats, and for different DSM topologies, different order integrators, and different dithering schemes can be evaluated quickly and economically. We elaborate on our software selection for the design flow in the University environment. In addition to discussing the prototype design methodology, we present the simulated and measured results for the MASH-11 and MASH- 12 frac-N synthesizers. The prototype encompassed all possible aspects of a complex hardware system design: an IC design, RF board design, board-to-board interface issues and the Verilog coding of DSMs in an FPGA. This process served as a useful tool for learning the various aspects of RF hardware design.
Segmental prototype interpolation coding
Authors: C. S. Xydeas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Current parametric speech coding schemes can achieve high communications quality speech at bit rates in the range of 2.4 to 1.5 kbits/sec. Most schemes sample and quantise, at regular intervals, the "tracks in time" generated by the parameters of the speech production model. As a result, reconstructed "parameter tracks" do not evolve "smoothly" with time. Furthermore, no advantage is taken of the "linguistic event" nature of speech. In this paper, model parameter "time tracks" are split into non-overlapping speech "event" related segments. These segment based evolutions of model parameters are then vector quantised to provide at the receiver a smooth and subjectively meaningful reconstruction. Thus the paper presents an application of this generic segmental speech model quantisation approach to a 1.5 kbits/sec prototype interpolation coding (PIC) system. Results indicate that the proposed methodology can almost halve the bit rate of this PIC system while preserving overall recovered speech quality.
Predicting file system actions from prior events
Authors: Thomas M. Kroeger, Darrell D. E. Long
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

We have adapted a multi-order context modeling technique used in the data compression method Prediction by Partial Match (PPM) to track sequences of file access events. From this model, we are able to determine file system accesses that have a high probability of occurring as the next event. By prefetching the data for these events, we have transformed an LRU cache into a predictive cache that in our simulations averages 15% more cache hits than LRU. In fact, on average our four-megabyte predictive cache has a higher cache hit rate than a 90 megabyte LRU cache.
Interactive presentation: Evaluation of test measures for LNA production testing using a multinormal statistical model
Authors: J. Tongbong, S. Mir, J. L. Carbonero
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

For Design-For-Test (DFT) purposes, analogue and mixed-signal testing has to cope with the difficulty of test evaluation before production. This paper aims at evaluating test measures for RF components in order to optimize production test sets and thus reduce test cost. For this, we have first developed a statistical model of the performances and possible test measures of the Circuit Under Test (a Low Noise Amplifier). The statistical multi-normal model is derived from data obtained using Monte-Carlo circuit simulation (five hundred iterations). This statistical model is then used to generate a larger circuit population (one million instances) from which test metrics can be estimated with ppm precision at the design stage, considering just process deviations. With the use of this model, a trade-off between defect level and yield loss resulting from process deviations is used to set test limits. After fixing test limits, we have carried out a fault simulation campaign to verify the suitability of the different test measurements, targeting both catastrophic and single parametric faults. Catastrophic faults are modelled by shorts and opens. A parametric fault is defined as the minimum value of a physical parameter that causes a specification to be violated. Test metrics are then evaluated for the LNA case-study. As a result, test metrics for functional measurements such as S-parameters and Noise Figure are compared with low cost test measurements such as RMS and peak-to-peak current consumption and output voltage, input/output impedance, and the correlation between current consumption and output voltage.
OODCE: a C++ framework for the OSF distributed computing environment
Authors: John Dilley
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

This paper presents a method for developing object-oriented distributed applications using the C++ and DCE technologies. The core of this package is a DCE IDL-to-C++ compiler and a set of C++ classes providing easy access to DCE functionality. Using this approach we were able to develop more object-oriented distributed applications, and saw a significant decrease in application code size. This contributed to an increase in developer productivity and code maintainability.
Wavelet packets based features selection for voiceless plosives classification
Authors: E. Lukasik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

There are contradictory reports on the usefulness of the wavelet packet transform (WPT) for feature extraction. This is mainly the case of signals of non-stationary character. In this paper we examine this tool for a category of short non-stationary speech signals, namely voiceless plosive consonants /p/, /t/, /k/. Three approaches to feature selection have been implemented: best basis search algorithm over the averaged wavelet packet coefficients of all data, local discriminant basis (LDB) algorithm, i.e. application of the best basis algorithm on the discriminant measure between coefficients in three classes and singular value decomposition (SVD) of the entropy matrices calculated from the wavelet packets for each class. The experiments conducted over the context independent plosives from speech database of Polish gave a classification rate higher for WPT based features than for traditional DFT based cepstral coefficients.
Capacity of Cellular CDMA Systems with Integrated Voice and Data Services
Authors: Z. Liu, J. Almhana, R. McGorman, C. Li
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

In this paper we analyze the capacity of a CDMA system supporting integrated voice and data services. The bit energyto- interference ratios for voice and data services are each modeled using lognormal distributions, and an integrated capacity formula based on a lognormal approximation is proposed. The capacity formula defines an admission scheme to guarantee with a predefined probability the total interference is less than the maximum acceptable interference. Under the assumption of Poisson arrivals for voice and data services, Kaufman's method is applied to calculate the blocking probabilities for voice and data services. Numerical results are provided to illustrate the proposed procedure.
Certified self-modifying code
Authors: Hongxu Cai, Zhong Shao, Alexander Vaynberg
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

Self-modifying code (SMC), in this paper, broadly refers to anyprogram that loads, generates, or mutates code at runtime. It is widely used in many of the world's critical software systems tosupport runtime code generation and optimization, dynamic loading and linking, OS boot loader, just-in-time compilation, binary translation,or dynamic code encryption and obfuscation. Unfortunately, SMC is alsoextremely difficult to reason about: existing formal verification techniques-including Hoare logic and type system-consistentlyassume that program code stored in memory is fixedand immutable; this severely limits their applicability and power. This paper presents a simple but novel Hoare-logic-like framework that supports modular verification of general von-Neumann machine code with runtime code manipulation. By dropping the assumption that code memory is fixed and immutable, we are forced to apply local reasoningand separation logic at the very beginning, and treat program code uniformly as regular data structure. We address the interaction between separation and code memory and show how to establish the frame rules for local reasoning even in the presence of SMC. Our frameworkis realistic, but designed to be highly generic, so that it can support assembly code under all modern CPUs (including both x86 andMIPS). Our system is expressive and fully mechanized. We prove itssoundness in the Coq proof assistant and demonstrate its power by certifying a series of realistic examples and applications-all of which can directly run on the SPIM simulator or any stock x86 hardware.
Pruning SIFT for scalable near-duplicate image matching
Authors: Jun Jie Foo, Ranjan Sinha
Venue: Proceedings of the eighteenth conference on Australasian database - Volume 63 (2007)

The detection of image versions from large image collections is a formidable task as two images are rarely identical. Geometric variations such as cropping, rotation, and slight photometric alteration are unsuitable for content-based retrieval techniques, whereas digital watermarking techniques have limited application for practical retrieval. Recently, the application of Scale Invariant Feature Transform (SIFT) interest points to this domain have shown high effectiveness, but scalability remains a problem due to the large number of features generated for each image. In this work, we show that for this application domain, the SIFT interest points can be dramatically pruned to effect large reductions in both memory requirements and query run-time, with almost negligible loss in effectiveness. We demonstrate that, unlike using the original SIFT features, the pruned features scales better for collections containing hundreds of thousands of images.
Salamander: the quest to build a useful handheld computing environment
Authors: Alexander Guy
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

As of late, the availability of commercial, off the shelf, handheld devices has grown dramatically. It is now possible to walk into most consumer electronic stores, and purchase a handheld device capable of running a fully fledged operating system such as Linux or NetBSD. The only major differences found in these handheld devices, as compared to their desktop counterparts, are related to hardware. The computing and storage resources available to users and applications are under much different constraints. In addition, input and output mechanisms are generally quite different. Because of this, although the existing application base is available (e.g. GNOME, KDE, and other X applications), their use is in many cases infeasable (although much code and experience can be gained). Salamander is a project aimed at developing a useful handheld computing environment. Based on UNIX-like operating systems, with X as the windowing environment, Salamander exists to provide an open-source suite of Personal Information Management (PIM) tools and a support structure for applications on current and next-generation handhelds.
Tripartite Ramsey numbers for paths
Authors: András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Venue: Journal of Graph Theory (2007)

In this article, we study the tripartite Ramsey numbers of paths. We show that in any two-coloring of the edges of the complete tripartite graph K(n, n, n) there is a monochromatic path of length (1 - o(1))2n. Since R(P2n+1,P2n+1)=3n, this means that the length of the longest monochromatic path is about the same when two-colorings of K3n and K(n, n, n) are considered. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 164&ndash;174, 2007
Architecture of Scalable Embedded Device Management System with Configurable Plug-In Translator
Authors: Hideya Ochiai, Hiroshi Esaki
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Ubiquitous computer network shall include wide variety of devices. This means that the ubiquitous network certainly increases the heterogeneity of nodes connected to the Internet, while increasing the number of nodes. This paper proposes a system architecture to solve this architectural challenge by the introduction of two sub-systems: "Configurable Plug-In Translator System" and "Dynamic Management Script Resolver System". The translator system provides generalized interfaces to applications, by absorbing the heterogeneous low-level interfaces with script execution engine. Here, the behavior of every remote node is described by the script language. The resolver system achieves a global scale script repository, using DNS, inheriting the advantages of DNS, i.e., scalability, robustness and authority management capability. The integration of these two sub-systems autonomously provides application software with generalized interfaces to access any remote device node on the global Internet
Fast and Robust Graphic Character Verification System for TV Sets
Authors: Antonio Rama, Ramon Alujas, Francesc Tarres
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

In this paper, we present a flexible system to verify any kind of graphic TV character or symbol in television charts. The proposed approach is very robust towards translations, rotations, changes in scale and illumination variations of the graphic characters. Another important attribute of the proposed system is its speed. The system should be very fast since the characters have to be verified in a real production line of TV sets. The proposed system is composed of fast and accurate preprocessing modules in order to normalize the characters, and a PCAbased verification method. Results show a very high performance with verification rates over the 99.8%.
Best practices: Hispanic serving institutions and the production of future Latino doctorates in science and engineering
Authors: M. Quintana-Baker
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

This study expands research begun as a baccalaureate origins study of Latino (US citizens) who obtained their doctorates in science and engineering between 1993 and 1997. Data was disaggregated according to gender, Hispanic subgroup, and broad field of science. Institutions were ranked according to their rate of productivity in these categories, regardless of their size. Hispanic Serving Institutions (HSIs) figured prominently in these rankings. Recruitment and retention strategies, as well as cultural characteristics, at eleven of the most productive HSIs have been studied in an effort to develop a research-based set of best practices in the production of future Latino doctorates in S&E at Hispanic Serving Institutions. 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
Fast implementation technique for improving throughput of RLS adaptive filters
Authors: K. Nishikawa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper proposes a fast implementation technique for RLS adaptive filters. The technique has an adjustable parameter to trade the throughput and the rate of convergence of the filter according to the applications. The conventional methods for improving the throughput do not have this kind of adjustability so that the proposed technique will expand the area of applications for the RLS algorithm. We show that the improvement of the throughput can be easily achieved by rearranging the formula of the RLS algorithm and that there are no need for faster PEs for the improvement.
A co-evolutionary framework for clustering in information retrieval systems
Authors: A. Aizawa
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper presents a co-evolutionary framework for clustering in text-based information retrieval systems. The prominent feature of the proposed method is that documents and terms are clustered simultaneously into overlapping multiple clusters. The mathematical formulation and implementation of the clustering method are briefly introduced, together with some experimental results.
Comparison of Text Models for BWT
Authors: Jan Lansky, Katsiaryna Chernik, Zuzana Vlickova
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Burrows-Wheeler Transform (BWT) is a compression method, which reorders an input string into the the form, which is preferable to another compression. Usually, Move-To-Front transform and then Huffman coding is used to the permutated string. The original method [1] from 1994 was designed for alphabet compression. In 2001, a new version working with word alphabet was introduced [2]. The newest version copes with syllable alphabet [3].
A Data Forest: Multi-Dimensional Visualization
Authors: Ronan Jamieson, Vassil Alexandrov
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

As Terabyte datasets become the norm, the focus has shifted away from our ability to produce and store ever larger amounts of data, onto its utilization. It is becoming increasingly difficult to gain meaningful insights into the data produced. Also many forms of the data we are currently producing cannot easily fit into traditional visualization methods. This paper presents a new and novel visualization technique based on the concept of a Data Forest. Our Data Forest has been designed to be used with virtual reality (VR) as its presentation method. VR is a natural medium for investigating large datasets. Our approach can easily be adapted to be used in a variety of different ways, from a stand alone single user environment to large multi-user collaborative environments. A test application is presented using multi-dimensional data to demonstrate the concepts involved.