ppxscal/embedding_network huggingface dataset:
Memory requirements for query execution in highly constrained devices
Authors: Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Pervasive computing introduces data management requirements that must be tackled in a growing variety of lightweight computing devices. Personal folders on chip, networks of sensors and data hosted by autonomous mobile computers are different illustrations of the need for evaluating queries confined in hardware constrained computing devices. RAM is the most limiting factor in this context. This paper gives a thorough analysis of the RAM consumption problem and makes the following contributions. First, it proposes a query execution model that reaches a lower bound in terms of RAM consumption. Second, it devises a new form of optimization, called iteration filter, that drastically reduces the prohibitive cost incurred by the preceding model, without hurting the RAM lower bound. Third, it analyses how the preceding techniques can benefit from an incremental growth of RAM. This work paves the way for setting up co-design rules helping to calibrate the RAM resource of a hardware platform according to given application's requirements as well as to adapt an application to an existing hardware platform. To the best of our knowledge, this work is the first attempt to devise co-design rules for data centric embedded applications. We illustrate the effectiveness of our techniques through a performance evaluation.
Query and update efficient B+-tree based indexing of moving objects
Authors: Christian S. Jensen, Dan Lin, Beng Chin Ooi
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

A number of emerging applications of data management technology involve the monitoring and querying of large quantities of continuous variables, e.g., the positions of mobile service users, termed moving objects. In such applications, large quantities of state samples obtained via sensors are streamed to a database. Indexes for moving objects must support queries efficiently, but must also support frequent updates. Indexes based on minimum bounding regions (MBRs) such as the R-tree exhibit high concurrency overheads during node splitting, and each individual update is known to be quite costly. This motivates the design of a solution that enables the B+ -tree to manage moving objects. We represent moving-object locations as vectors that are timestamped based on their update time. By applying a novel linearization technique to these values, it is possible to index the resulting values using a single B+-tree that partitions values according to their timestamp and otherwise preserves spatial proximity. We develop algorithms for range and k nearest neighbor queries, as well as continuous queries. The proposal can be grafted into existing database systems cost effectively. An extensive experimental study explores the performance characteristics of the proposal and also shows that it is capable of substantially outperforming the R-tree based TPR-tree for both single and concurrent access scenarios.
Ranking with semi-supervised distance metric learning and its application to housing potential estimation
Authors: Yangqiu Song, Bin Zhang, Wenjun Yin, Changshui Zhang, Jin Dong
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

This paper proposes a semi-supervised distance metric learning algorithm for the ranking problem. Instead of giving the computer what are the important factors that affect the final rank value, we only give several most certainly ranked points which implicitly contain the knowledge of the ranking factors. Then the computer can automatically use the most certain points and plenty of unlabeded data to learn an informative metric for ranking. This metric not only can help to regress an order in the observed data, but also can be used to retrieve the data by querying new test points. Moreover, the lower-rank distance metric can be used to visualize high-dimensional data. We also present an application to the housing potential estimation problem. It is shown that the algorithm is efficient to help consultants to refine their consulting work.
A novel channel assignment scheme for improving channel reuse efficiency in multi-channel ad hoc wireless networks
Authors: Shih-Lin Wu, Jhen-Yu Yang
Venue: Computer Communications (2007)

How to increase channel reuse efficiency is one of the most important issues in wireless cellular networks. Recently, many multi-channel MAC protocols have been proposed for ad hoc wireless networks. However the channel assignment schemes used in these protocols do not consider the issue of channel reuse. The channel assignment schemes only let a mobile host select a channel from the channels which are not currently being used by its one-hop neighbors. To form a channel reuse pattern, the mobile host should consider its two-hop channel usage and select a channel which is been used by its two-hop neighbors. In this paper, we propose a novel channel assignment scheme for improving the channel reuse efficiency. By overhearing control packets of one-hop neighbors, a host can easily know the channel condition within the range of two-hop hosts and then select a suitable transmitting/receiving data channel to form the better reuse pattern. To enhance the probability of forming channel reuse pattern, we propose a backoff counter adjustment scheme such that a host with more channel information can transmit control packets early than with less channel information. We verify the performance of our protocol via simulations and give some comments on the simulation results.
Back-propagation neural network based importance-performance analysis for determining critical service attributes
Authors: Wei-Jaw Deng, Wen-Chin Chen, Wen Pei
Venue: Expert Systems with Applications: An International Journal (2008)

Importance-performance analysis (IPA) is a simple but effective means of assisting practitioners in prioritizing service attributes when attempting to enhance service quality and customer satisfaction. As numerous studies have demonstrated, attribute performance and overall satisfaction have a non-linear relationship, attribute importance and attribute performance have a causal relationship and the customer's self-stated importance is not the actual importance of service attribute. These findings raise questions regarding the applicability of conventional IPA. Therefore, this study presents a revised IPA which integrates back-propagation neural network and three-factor theory to effectively assist practitioners in determining critical service attributes. Finally, a customer satisfaction improvement case is presented to demonstrate the implementation of the proposed Back-Propagation Neural Network based Importance-Performance Analysis (BPNN-IPA) approach.
PRIMS: making NVRAM suitable for extremely reliable storage
Authors: Kevin M. Greenan, Ethan L. Miller
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

Non-volatile byte addressable memories are becoming more common, and are increasingly used for critical data that must not be lost. However, existing NVRAM-based file systems do not include features that guard against file system corruption or NVRAM corruption. Furthermore, most file systems check consistency only after the system has already crashed. We are designing PRIMS to address these problems by providing file storage that can survive multiple errors in NVRAM, whether caused by errant operating system writes or by media corruption. PRIMS uses an erasure-encoded log structure to store persistent metadata, making it possible to periodically verify the correctness of file system operations while achieving throughput rates of an order of magnitude higher than page-protection during small writes. It also checks integrity on every operation and performs on-line scans of the entire NVRAM to ensure that the file system is consistent. If errors are found, PRIMS can correct them using file system logs and extensive error correction information. While PRIMS is designed for reliability, we expect it to have excellent performance, thanks to the ability to do word-aligned reads and writes in NVRAM.
DATES: Design Analysis Tool for Enterprise Systems
Authors: Cristina Marinescu
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

In the current demonstration we present a new tool which increases the level of understanding and the accuracy of design quality assessment within enterprise systems. This is performed by providing its users with information specific to this type of systems (e.g., accessed tables from a class). In order to validate its usefulness, we perform some experiments on a suite of enterprise systems whose results are briefly presented in the last part of the demo.
The Design of a Computer Graphics Training Program
Authors: Stephen Sawzin
Venue: IEEE Computer Graphics and Applications (1983)

Competence, productivity, and trainee confidence are the major goals of an in-house computer graphics training program for company-specific applications. 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
Labelling of some planar graphs with a condition at distance two
Authors: Sumei Zhang, Qiaoling Ma
Venue: Journal of Applied Mathematics and Computing (2007)

The problem of vertex labeling with a condition at distance two in a graph, is a variation of Hale's channel assignment problem, which was first explored by Griggs and Yeh. For positive integer p ≥ q, the λp,q-number of graph G, denoted λ(G;p, q), is the smallest span among all integer labellings of V(G) such that vertices at distance two receive labels which differ by at least q and adjacent vertices receive labels which differ by at least p. Van den Heuvel and McGuinness have proved that λ(G;p, q) ≤ (4q-2)Δ+10p+38q-24 for any planar graph G with maximum degree Δ. In this paper, we studied the upper bound of λp,q-number of some planar graphs. It is proved that λ(G;p,q) ≤ (2q-1)Δ+2(2p-1) if G is an outerplanar graph and λ(G;p, q) ≤ (2q-1)Δ+6p-4q-1 if G is a Halin graph.
On the Design of Easily Testable Iterative Systems of Combinational Cells
Authors: W. Coy
Venue: IEEE Transactions on Computers (1979)

A design procedure is shown which allows the construction of one-dimensional iterative systems of combinational cells with good single stuck-at fault test complexity. Let S be a system where one of the M input words and two of the N states are defined for test purposes and the cells are realized as AND-EXOR normal form circuits, then S is testable with at most [log2(M x N) + 6] tests fo
Modeling bug report quality
Authors: Pieter Hooimeijer, Westley Weimer
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Software developers spend a significant portion of their resources handling user-submitted bug reports. For software that is widely deployed, the number of bug reports typically outstrips the resources available to triage them. As a result, some reports may be dealt with too slowly or not at all. We present a descriptive model of bug report quality based on a statistical analysis of surface features of over 27,000 publicly available bug reports for the Mozilla Firefox project. The model predicts whether a bug report is triaged within a given amount of time. Our analysis of this model has implications for bug reporting systems and suggests features that should be emphasized when composing bug reports. We evaluate our model empirically based on its hypothetical performance as an automatic filter of incoming bug reports. Our results show that our model performs significantly better than chance in terms of precision and recall. In addition, we show that our modelcan reduce the overall cost of software maintenance in a setting where the average cost of addressing a bug report is more than 2% of the cost of ignoring an important bug report.
Experimental Evaluation of Wireless Simulation Assumptions
Authors: Calvin Newport, David Kotz, Yougu Yuan, Robert S. Gray, Jason Liu, Chip Elliott
Venue: Simulation (2007)

All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. A growing body of research, however, indicates that the behavior of the protocol stack may depend significantly on these underlying assumptions. The standard response to this problem is a call for more realism in designing radio models. But how much realism is enough? This study is the first to approach this question by validating simulator performance (both at the physical and application layers) with the results of real-world data. Referencing an eXtensive set of measurements from a large outdoor routing eXperiment, we start by evaluating the relative realism of common assumptions made in radio model design, identifying those which provide a reasonable approXimation of reality. Although several such investigations have been made for static sensor networks, radio behavior in mobile network deployments is a much less-studied topic. We then reproduce our eXperimental setup in our simulator, and generate the same application-layer metrics under progressively smaller sets of these assumptions. By comparing the simulated outcome to the outcome of our eXperiment, we are able to discern at what point our balance of simplification and realism captures the real behavior of our target environment.
(algorithms)
Authors: Pavel Curtis
Venue: ACM SIGPLAN Lisp Pointers (1988)

Welcome to the first appearance of this new Lisp Pointers department on Algorithms. It has been noted by some editors that most Lisp hackers would rather write code than articles and I suspect that their reading preferences might run the same way. This department is an attempt to cater to those preferences. The articles you'll see here will tend to fit into one or more of three broad categories: &bull; Annotated implementations of interesting and relevant algorithms that make particularly good or novel use of the unique features of the Lisp family of programming languages (e.g., closures, continuations, code as data, polymorphism). &bull; Annotated implementations of algorithms whose subject matter is the Lisp family of languages (e.g., code analysis tools, iteration facilities, generic arithmetic), and &bull; Discussion of performance issues, benchmarking, or implementation experiences for interesting algorithms written in or about the Lisp family of languages.
The Variations, Combination Strategies Analysis of Particle Swarm Optimization
Authors: Xiujuan Lei, Zhongke Shi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper summarizes the particle swarm optimization (PSO) related research to help readers have a comprehensive understanding. Firstly the paper presents the equations of motion and the calculation flow of PSO. Then we analyze the variations of particle swarm optimization and related parameters, includes basic algorithm, PSO with inertia weight and PSO with constriction factor. Thirdly we discuss the combination strategy with other intelligent methods (simulated annealing, genetic algorithm, ant colony optimization and immune operator) and point out the research about mathematics field of PSO is the convergence, which further to be discussed. The conclusion and prospect are in the end.
X-ray metrology for high-k atomic layer deposited HfxZr1-xO2 films
Authors: Jesus J. Gallegos,  III, Dina H. Triyoso, Mark Raymond
Venue: Microelectronic Engineering (2008)

Hafnium-based dielectrics are the most promising material for SiO"2 replacement in future nodes of CMOS technology. While devices that utilize HfO"2 gate dielectrics suffer from lower carrier mobility and degraded reliability, our group has recently reported improved device characteristics with a modified Hf"xZr"1"-"xO"2 [R.I. Hegde, D.H. Triyoso, P.J. Tobin, S. Kalpat, M.E. Ramon, H.-H. Tseng, J.K. Schaeffer, E. Luckowski, W.J. Taylor, C.C. Capasso, D.C. Gilmer, M. Moosa, A. Haggag, M. Raymond, D. Roan, J. Nguyen, L.B. La, E. Hebert, R. Cotton, X.-D. Wang, S. Zollner, R. Gregory, D. Werho, R.S. Rai, L. Fonseca, M. Stoker, C. Tracy, B.W. Chan, Y.H. Chiu, B.E. White, Jr., in: Technical Digest - International Electron Devices Meet, vol. 39, 2005, D.H. Triyoso, R.I. Hegde, J.K. Schaeffer, D. Roan, P.J. Tobin, S.B. Samavedam, B.E. White, Jr., R. Gregory, X.-D. Wang, Appl. Phys. Lett. 88 (2006) 222901]. These results have lead to evaluation of X-ray reflectivity (XRR) for monitoring high-k film thickness and control of Zr addition to HfO"2 using measured film density. In addition, a combination of XRR and spectroscopic ellipsometry (SE) is shown to be a fast and non-intrusive method to monitor thickness of interfacial layer between high-k and the Si substrate.
Image Filtering on .NET-based Desktop Grids
Authors: Christian Vecchiola, Krishna Nadiminti, Rajkumar Buyya
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Image filtering is the use of computer graphics algorithms to enhance the quality of digital images or to extract information about their content. However rendering very large size digital images on a single machine is a performance bottleneck. To address this we propose parallelising this application on a desktop Grid environment. For parallelizing this application we use the Alchemi Desktop Grid environment and the resulting framework is referred to as ImageGrid. ImageGrid allows the parallel execution of linear digital filters algorithms on images. We observed acceptable speed up as a result of parallelising filtering operation through ImageGrid. We run the tests on different data sets by varying the dimension of the images and the complexity of the filters. Results demonstrate potential of Grid computing for desktop applications and that the speed up obtained is more consistent for large images and complex filters.
Dynamic Improvement of Locality in Virtual Memory Systems
Authors: J. -L. Baier
Venue: IEEE Transactions on Software Engineering (1976)

Replacement algorithms for virtual memory systems are typically based on temporal measures of locality, while predictive loading and program restructuring are based on spatial measures of locality. This paper suggests some techniques for dynamically improving the spatial locality of a program via predictive loading and virtual space restructuring, and presents the results of applying these techniques to actual programs. Bounds are derived for the performance of the methods.
Experimental Evaluation for Scalability and QoS in a VOD System
Authors: Dongmahn Seo, Hanmin Bang, Nansook Heo, Inbum Jung, Yoon Kim
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In this paper, the performance scalability in clusterbased Video-On-Demand (VOD) servers is studied with several grouping configurations of cluster nodes. To find performance bottlenecks of VOD servers, the monitoring functions are employed and the maximum Quality of Service (QoS) streams are measured under the various requests including VCR functions. From detailed experimental results, a new admission control method is proposed, that is based on available system resources and the actual amount of resource consumed for QoS streams. The proposed method provides not only the more scalable QoS in cluster-based VOD servers then legacies but also the enhancement of resource utilization by guaranteeing the maximum number of QoS streams than legacies.
RadixZip: linear time compression of token streams
Authors: Binh Dao Vo, Gurmeet Singh Manku
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

RadixZip is a block compression technique for token streams. It introduces RadixZip Transform, a linear time algorithm that rearranges bytes using a technique inspired by radix sorting. For appropriate data, RadixZip Transform is analogous to the Burrows-Wheeler Transform used in bzip2, but is both simpler in operation and more effective in compression. In addition, RadixZip Transform can take advantage of correlations between token streams with no computational overhead. Experiments over practical data show that for common token streams, RadixZip is superior to bzip2.
Measuring Programming Improvement at IBM-FSD
Authors: R. McHenry
Venue: Computer (1975)

The introduction of structured programming into FSD operations and the apparent resulting improvements in the programming process stimulated efforts to measure actual improvement.
Flexible Hierarchies and Fuzzy Knowledge-Based OLAP
Authors: Ermir Rogova, Panagiotis Chountas, Krassimir Atanassov
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper we revise the context of "value uncertainty", as part of an OLAP based environment. A new multidimensional-cubic model named as the IF-Cube is introduced which is able to operate over data with imprecision either in the facts or in the dimensional hierarchies. These query requirements led us to introduce the concept of closure of an Intuitionistic fuzzy set over a universe that has a hierarchical structure, H-IFS. We introduce the automatic recommendation of analysis according to the concepts defined as part of a domain ontology in order to guide the decision making with the aid of H-IFS.
Computer System Measurability
Authors: L. Svobodova
Venue: Computer (1976)

Measurement is a fundamental technique of any discipline or science. In computer engineering, measurement needs can be divided into three categories:
Adaptive, hands-off stream mining
Authors: Spiros Papadimitriou, Anthony Brockwell, Christos Faloutsos
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Sensor devices and embedded processors are becoming ubiquitous. Their limited resources (CPU, memory and/or communication bandwidth and power) pose some interesting challenges. We need both powerful and concise "languages" to represent the important features of the data, which can (a) adapt and handle arbitrary periodic components, including bursts, and (b) require little memory and a single pass over the data. We propose AWSOM (Arbitrary Window Stream mOdeling Method), which allows sensors in remote or hostile environments to efficiently and effectively discover interesting patterns and trends. This can be done automatically, i.e., with no user intervention and expert tuning before or during data gathering. Our algorithms require limited resources and can thus be incorporated in sensors, possibly alongside a distributed query processing engine [9, 5, 22]. Updates are performed in constant time, using logarithmic space. Existing, state of the art forecasting methods (SARIMA, GARCH, etc) fall short on one or more of these requirements. To the best of our knowledge, AWSOM is the first method that has all the above characteristics. Experiments on real and synthetic datasets demonstrate that AWSOM discovers meaningful patterns over long time periods. Thus, the patterns can also be used to make long-range forecasts, which are notoriously difficult to perform. In fact, AWSOM outperforms manually set up auto-regressive models, both in terms of long-term pattern detection and modeling, as well as by at least 10× in resource consumption.
Microsystems Personal Computing Dissected (there's a Piece for Everyone)
Authors: P. Isaacson
Venue: Computer (1977)

What should be the relationship of the computing professional societies to the new guy in town, the computer hobbyist? Before I attempt an answer to that question, let me dispel a few others. 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