ppxscal/embedding_network huggingface dataset:
SASH: a self-adaptive histogram set for dynamically changing workloads
Authors: Lipyeow Lim, Min Wang, Jeffrey Scott Vitter
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Most RDBMSs maintain a set of histograms for estimating the selectivities of given queries. These selectivities are typically used for cost-based query optimization. While the problem of building an accurate histogram for a given attribute or attribute set has been well-studied, little attention has been given to the problem of building and tuning a set of histograms collectively for multidimensional queries in a self-managed manner based only on query feedback. In this paper, we present SASH, a Self-Adaptive Set of Histograms that addresses the problem of building and maintaining a set of histograms. SASH uses a novel two-phase method to automatically build and maintain itself using query feedback information only. In the online tuning phase, the current set of histograms is tuned in response to the estimation error of each query in an online manner. In the restructuring phase, a new and more accurate set of histograms replaces the current set of histograms. The new set of histograms (attribute sets and memory distribution) is found using information from a batch of query feedback. We present experimental results that show the effectiveness and accuracy of our approach.
On the difficulty of validating voting machine software with software
Authors: Ryan Gardner, Sujata Garera, Aviel D. Rubin
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

We studied the notion of human verification of software-based attestation, which we base on the Pioneer framework. We demonstrate that the current state of the art in software-based attestation is not sufficiently robust to provide humanly verifiable voting machine integrity in practice. We design and implement a self-attesting machine based on Pioneer and modify, and in some cases, correct the Pioneer code to make it functional and more secure. We then implement it into the GRUB bootloader [1], along with several other modifications, to produce a voting machine that authenticates and loads both the Diebold AccuVote-TS voting software as well as its underlying operating system. Finally, we implement an attack on the system that indicates that it is currently impractical for use and argue that as technology advances, the attack will likely become more effective.
Effect of Technology on Near Term Computer Structures
Authors: C. G. Bell, R. Chen, S. Rege
Venue: Computer (1972)

The development of computers has been influenced by three factors: the technology (i.e., the components from which we build); the hardware and software techniques we have learned to use; and the user (market). The improvements in technology seem to dominate in determining the possible resulting structures. Specifically, we can observe the evolution of four classes of computers:
Experimenting with diversity in the model driven development of a railway signaling system
Authors: Michele Banci, Alessandro Fantechi, Stefania Gnesi, Giovanni Lombardi
Venue: Proceedings of the 2007 workshop on Engineering fault tolerant systems (2007)

In this paper we discuss how we have introduced elements of diversity in the experimental model driven development process of a railway signalling system. The experience has been done inside a larger industrial project undertaken to evaluate the feasibility of employing formal modelling and automatic code generation in the development of a new generation of railway signalling systems hosted by a new fault-tolerant platform. The diversity is introduced at the level of the compilation of the generated code, and is aimed to discover possible faults due to the compilation environment or to the underlying operating system. Other forms of diversity will be then experimented in a step by step fashion.
Adaptive uncertainty estimation for particle filter-based trackers
Authors: Andrew D. Bagdanov, Alberto Del Bimbo, Fabrizio Dini, Walter Nunziati
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In particle filter.based visual trackers, dynamic velocity components are typically incorporated into the state update equations. In these cases, there is a risk that the uncertainty in the model update stage can become amplified in unexpected and undesirable ways, leading to erroneous behavior of the tracker. To deal with this problem, we propose a continuously adaptive approach to estimating uncertainty in the particle filter, one that balances the uncertainty in its static and dynamic elements. We provide quantitative performance evaluation of the resulting particle filter tracker on a set of ten video sequences. Results are reported in terms of a metric that can be used to objectively evaluate the performance of visual trackers. This metric is used to compare our modified particle filter tracker and the continuously adaptive mean shift tracker. Results show that the performance of the particle filter is significantly improved through adaptive parameter estimation, particularly in cases of occlusions and nonlinear target motion.
Design and evaluation of a new and effective fairness scheme for multicasting in Internet-scale distributed systems
Authors: Yijun Lu, Hong Jiang
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

This paper argues that simply applying a multiple-tree scheme does not provide sufficient fairness for applications in an Internet-scale distributed system, in terms of performance. Motivated from the observation of the tax and donation systems in our society, we believe that a better way to define fairness, for performance's sake, is to factor in nodes' proportional contributions because it provides the opportunity to support many simultaneous multicasting sessions. This paper then presents a protocol, called FairOM (Fair Overlay Multicast), to enforce proportional contribution among peers in an Internet-scale distributed system.
A library framework for implementing genetic algorithms in Java
Authors: Bartosz Kozlowski, Varvara Fazalova
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

This paper presents a Java based library designed to provide scientists and programmers with a framework, which makes it easy to implement and simulate genetic algorithms. Library's programming interfaces and implementation requirements are introduced. Further we describe the usage of the provided command-line interface and graphical user interface for universal simulator. Three sample problem implementations from the biological and optimization fields are reviewed. Moreover, we consider possible directions for extending the library.
Erratum, September Issue
Venue: Computer (1978)

The article "Computer Science and Computer Engineering Education in the 80's," contained an omission of a reference for Figures 4-6 (pp. 76-77). The reference unintentionally omitted was to the work of Dr. James R. Pinkert and Ms. Kay Schenk, originally published in SIGCSE Bulletin, Vol. 10, No. 1, February 1978, pp. 81-84. We regret the omission. 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
Antitrust Division Gives IEEE Standard Setters the Okay to Ask Patentees How RAND They Are
Authors: Richard Stern
Venue: IEEE Micro (2007)

The policy of the IEEE has long been to avoid embodying patented technology in IEEE standards unless the technology would be made available to users of the standard on reasonable and non-discriminatory (RAND) royalty terms and conditions. But a recurrent problem has been that, once a standard was in place, the patentee and the standard users would have different ideas about what was RAND. The IEEE, with support from the Antitrust Division in the form of business review clearance letter, has now adopted new bylaws on standard-setting activity under which the working group, once it learns that access to a patent may be necessary to implement a given standard, will ask for a letter of assurance from the relevant patent owner, indicating its commitment to RAND licensing. Does the new bylaw go far enough?
Agent Grid Based Enterprise Application Integration
Authors: Maoguang Wang, Zhongzhi Shi, Li Zeng, Fen Lin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Due to the increasing software complexity, how to integrate the legacy data resources and systems is a big challenge for the enterprise. This paper makes full use of agent technologies to establish an agent grid intelligent platform for enterprise heterogeneous system integration. The agent grid intelligent platform adopts a hierarchical integration model and middleware to provide efficient integration capability for different application systems. Finally, this paper introduces the grid based city emergency interaction system to illustrate the AGrIP practical system integration.
A Proposal to Improve IKEv2 negotiation
Authors: Lari Iso-Anttila, Jorma Ylinen, Pekka Loula
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

IKEv2 is a new key exchange protocol in the IPsec network and IKEv2 includes a method to detect when it is under denial-of-service (DoS) attack. In case IKEv2 is not under DoS attack it can use initial exchange, but when IKEv2 is under DoS attack cookie negotiation may be used. Cookie negotiation adds an extra round trip to the initial exchange, and protection that is easy to pass by. The resistance to DoS attacks is actually weaker in IKEv2 than in JFK or Full-SIGMA in different networks. This paper presents improved cookie negotiation to remedy this weakness. The proposed cookie negotiation delays the responder's calculation work to the last second and computational load is kept as low as possible.
An Approach to Analyzing Commonality and Variability of Features using Ontology in a Software Product Line Engineering
Authors: Soon-Bok Lee, Jin-Woo Kim, Chee-Yang Song, Doo-Kwon Baik
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

In a product line engineering, several studies have been made on analysis of feature which determines commonality and variability of product. Fundamentally, because the studies are based on developer's intuition and domain expert's experience, stakeholders lack common understanding of feature and a feature analysis is informal and subjective. Moreover, the reusability of software products, which were developed, is insufficient. This paper proposes an approach to analyzing commonality and variability of features using semantic-based analysis criteria which is able to change feature model of specific domain to featureontology. For the purpose, first feature attributes were made, create a feature model following the Meta model, transform it into feature-ontology, and save it to Meta feature-ontology repository. Henceforth, when we construct a feature model of the same product line, commonality and variability of the features can be extracted, comparing it with Meta feature ontology through a semantic similarity analysis method, which is proposed. Furthermore, a tool for a semantic similarity-comparing algorithm was implemented and an experiment with an electronic approval system domain in order to show the efficiency of the approach Was conducted. A Meta feature model can definitely be created through this approach, to construct a high-quality feature model based on common understanding of a feature. The main contributions are a formulating a method of extracting commonality and variability from features using ontology based on semantic similarity mapping and a enhancement of reusability of feature model.
h-Multigrid for space-time discontinuous Galerkin discretizations of the compressible Navier-Stokes equations
Authors: C. M. Klaij, M. H. van Raalte, H. van der Ven, J. J. W. van der Vegt
Venue: Journal of Computational Physics (2007)

Being implicit in time, the space-time discontinuous Galerkin discretization of the compressible Navier-Stokes equations requires the solution of a non-linear system of algebraic equations at each time-step. The overall performance, therefore, highly depends on the efficiency of the solver. In this article, we solve the system of algebraic equations with a h-multigrid method using explicit Runge-Kutta relaxation. Two-level Fourier analysis of this method for the scalar advection-diffusion equation shows convergence factors between 0.5 and 0.75. This motivates its application to the 3D compressible Navier-Stokes equations where numerical experiments show that the computational effort is significantly reduced, up to a factor 10 w.r.t. single-grid iterations.
Searching Visual Semantic Spaces with Concept Filters
Authors: Eric Zavesky, Zhu Liu, David Gibbon, Behzad Shahraray
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Semantic concepts cement the ability to correlate visual information to higher-level semantic concepts. Traditional image search leverages text associated with images, a low-level content-based matching, or a combination of the two. We propose a new system that uses 374 semantic concepts (derived from the LSCOM lexicon [6]) to semantically facilitate fast exploration of a large set of video data. This new system, when coupled with traditional image search techniques produces a very intuitive and fruitful design for targeted user interaction.
Vulnerability Assessment by Learning Attack Specifications in Graphs
Authors: Virginia N. L. Franqueira, Raul H. C. Lopes
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

This paper presents an evolutionary approach for learning attack specifications that describe attack scenarios. The objective is to find vulnerabilities in computer networks which minimise the cost of an attack with maximum impact. Although we focus on Insider Threat, the proposed approach applies to networks in general, including social networks and computer grid.
Dynamic programming strategies on the decision tree hidden behind the optimizing problems
Authors: Zoltan Katai
Venue: Informatics in education (2007)

The aim of the paper is to present the characteristics of certain dynamic programming strategies on the decision tree hidden behind the optimizing problems and thus to offer such a clear tool for their study and classification which can help in the comprehension of the essence of this programming technique.
Improved Image Coding Algorithm Based on Embedded Zerotree
Authors: Liu Xuhong, Liu Fuheng, Kuang Guijuan, Yi Xiu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

This paper presents an improved embedded zerotree wavelet (EZW) coding algorithm. According to the characteristic of coefficients and human visual system (HVS), an attempt is made to improve Shapiro's EZW algorithm. The improved algorithm pays more attention to the edge of one image because human visual system is sensitive to the distortion of image edge information. Experiments results show that the improved algorithm performs better than EZW in reconstruction image quality, especially in the case of low rate.
A Recursive Partitioning Decision Rule for Nonparametric Classification
Authors: J. H. Friedman
Venue: IEEE Transactions on Computers (1977)

A new criterion for deriving a recursive partitioning decision rule for nonparametric classification is presented. The criterion is both conceptually and computationally simple, and can be shown to have strong statistical merit. The resulting decision rule is asymptotically Bayes' risk efficient. The notion of adaptively generated features is introduced and methods are presented for dealing with missing features in both training and test vectors.
Characterizing Animal Behavior through Audio and Video Signal Processing
Authors: Dan Valente, Haibin Wang, Peter Andrews, Partha P. Mitra, Sigal Saar, Ofer Tchernichovski, Ilan Golani, Yoav Benjamini
Venue: IEEE MultiMedia (2007)

Quantifying animal behavior in neuroscience research is essential for properly interpreting results, ensuring reproducibility of experiments, and providing a more complete picture of the genotype—phenotype relationship in the nervous system context. Because high-throughput experiments increasingly require automated acquisition and analysis of behavioral data, multimedia systems are becoming a vital part of the behavioral neuroscientist's tool kit.
Integration and verification of semantic constraints in adaptive process management systems
Authors: Linh Thao Ly, Stefanie Rinderle, Peter Dadam
Venue: Data Knowledge Engineering (2008)

Adaptivity in process management systems is key to their successful applicability in practice. Approaches have been already developed to ensure system correctness after arbitrary process changes at the syntactical level (e.g., avoiding inconsistencies such as deadlocks or missing input parameters after a process change). However, errors may be still caused at the semantical level (e.g., violation of business rules). Therefore, the integration and verification of domain knowledge will flag a milestone in the development of adaptive process management technology. In this paper, we introduce a framework for defining semantic constraints over processes in such a way that they can express real-world domain knowledge on the one hand and are still manageable concerning the effort for maintenance and semantic process verification on the other hand. This can be used to detect semantic conflicts (e.g., drug incompatibilities) when modeling process templates, applying ad hoc changes at process instance level, and propagating process template modifications to already running process instances, even if they have been already individually modified themselves; i.e., we present techniques to ensure semantic correctness for single and concurrent changes which are, in addition, minimal regarding the set of semantic constraints to be checked. Together with further optimizations of the semantic checks based on certain process meta model properties this allows for efficiently verifying processes. Altogether, the framework presented in this paper provides the basis for process management systems which are adaptive and semantic-aware at the same time.
RapidIO for radar processing in advanced space systems
Authors: David Bueno, Chris Conger, Alan D. George, Ian Troxel, Adam Leko
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2007)

Space-based radar is a suite of applications that presents many unique system design challenges. In this paper, we investigate use of RapidIO, a new high-performance embedded systems interconnect, in addressing issues associated with the high network bandwidth requirements of real-time ground moving target indicator (GMTI), and synthetic aperture Radar (SAR) applications in satellite systems. Using validated simulation, we study several critical issues related to the RapidIO network and algorithms under study. The results show that RapidIO is a promising platform for space-based radar using emerging technology, providing network bandwidth to enable parallel computation previously unattainable in an embedded satellite system.
A Selection Approach of Reverse Logistics Provider Based on Fuzzy AHP
Authors: Ying Zhang, Yanfang Feng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

With the development of reverse logistics, its operation process is getting more and more complex. How enterprise selects the third party reverse logistics providers and entrusts his reverse logistics to them becomes an important decision-making task. In this paper, we adopt fuzzy analytical hierarchy process (FAHP) to discuss a selection approach of reverse logistics provider through a practical case.
The Sign/Logarithm Number System
Authors: E. E. Swartzlander
Venue: IEEE Transactions on Computers (1975)

A signed logarithmic number system, which is capable of representing negative as well as positive numbers is described. A number is represented in the sign/logarithm number system by a sign bit and the logarithm of the absolute value of the number (scaled to avoid negative logarithms).
Preliminary Specification of Spline Curves
Authors: R. P. Dube
Venue: IEEE Transactions on Computers (1979)

An interpolation model in computer-aided geometric design must satisfy at least two conditions: 1) the model must yield a smooth design and 2) modifications to the model must have only a local effect. These constraints on the model usually yield a large number of parameters with which the designer must deaL In this paper we discuss a preprocessor which requires interpolation data as input and produces the necessary data to generate a curve. This preliminary design may then be manipulated in a convenient local manner.
Distance measures for biological sequences: Some recent approaches
Authors: Sabrina Mantaci, Antonio Restivo, Marinella Sciortino
Venue: International Journal of Approximate Reasoning (2008)

Sequence comparison has become a very essential tool in modern molecular biology. In fact, in biomolecular sequences high similarity usually implies significant functional or structural similarity. Traditional approaches use techniques that are based on sequence alignment able to measure character level differences. However, the recent developments of whole genome sequencing technology give rise to need of similarity measures able to capture the rearrangements involving large segments contained in the sequences. This paper is devoted to illustrate different methods recently introduced for the alignment-free comparison of biological sequences. Goal of the paper is both to highlight the peculiarities of each of such approaches by focusing on its advantages and disadvantages and to find the common features of all these different methods.
Scents in Programs: Does Information Foraging Theory Apply to Program Maintenance?
Authors: Joseph Lawrance, Rachel Bellamy, Margaret Burnett
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

During maintenance, professional developers generate and test many hypotheses about program behavior, but they also spend much of their time navigating among classes and methods. Little is known, however, about how professional developers navigate source code and the extent to which their hypotheses relate to their navigation. A lack of understanding of these issues is a barrier to tools aiming to reduce the large fraction of time developers spend navigating source code. In this paper, we report on a study that makes use of information foraging theory to investigate how professional developers navigate source code during maintenance. Our results showed that information foraging theory was a significant predictor of the developers' maintenance behavior, and suggest how tools used during maintenance can build upon this result, simply by adding word analysis to their reasoning systems.