ppxscal/embedding_network huggingface dataset:
Adaptive Processing for Continuous Query over Data Stream
Authors: Misook Bae, Buhyun Hwang, Jiseung Nam
Venue: Proceedings of the 5th international symposium on Parallel and Distributed Processing and Applications (2007)

Stream applications such as sensor data processing, financial tickers and Internet traffic analysis require that information, naturally, occur as a stream of data values. Due to a late and out-of-order arrival of infinite, unbound and multiple input streams, processing continuous queries over them may lead to producing an incorrect answer or delaying query execution. Hence to minimize this waiting time, previous works have used timeout technique without considering the frequency of timeouts. It results in decreasing the accuracy of query execution results, since the more the frequency of timeouts, the more the loss of data. We propose an AP-STO method using StB that stores operator's state and a window time-out method based on the waiting time for the next tuple by resetting the size of a window according to the frequency of timeouts. It reduces a data lost rate and increases the tuples output-rate. We compare AP-STO method with an existing method and use output-rate and response time as criteria for performance evaluation. Our proposed method shows a substantial improvement in system performance in terms of the accuracy of query execution and the increment of tuples output-rate per a query due to the reduction in loss rate of data.
Built-In Indicators to Discover Interesting Drill Paths in a Cube
Authors: Véronique Cariou, Jérôme Cubillé, Christian Derquenne, Sabine Goutier, Françoise Guisnel, Henri Klajnmic
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

OLAP applications are widely used by business analysts as a decision support tool. While exploring the cube, end-users are rapidly confronted by analyzing a huge number of drill paths according to the different dimensions. Generally, analysts are only interested in a small part of them which corresponds to either high statistical associations between dimensions or atypical cell values. This paper fits in the scope of discovery-driven dynamic exploration. It presents a method coupling OLAP technologies and mining techniques to facilitate the whole process of exploration of the data cube by identifying the most relevant dimensions to expand. At each step of the process, a built-in rank on dimensions is restituted to the users. It is performed through indicators computed on the fly according to the user-defined data selection. A proof of the implementation of this concept on the Oracle 10g system is described at the end of the paper.
Consider Multiple Solutions
Authors: Jeff Patton
Venue: IEEE Software (2008)

Design teams rarely consider multiple solution ideas before committing to one. They often forget that an even better idea could be just around the corner, and consider alternative ideas only when they don't like the current one. Using sketchboarding, design studio, or a combination of these two techniques can let teams quickly ideate over many solutions. They then have a chance to arrive at a solution that no one individual had thought of.
Deep Packet Inspection Using Message Passing Networks
Authors: Divya Jain, K Vasanta Lakshmi, Priti Shankar
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

We propose a solution based on message passing bipartite networks, for deep packet inspection, which addresses both speed and memory issues, which are limiting factors in current solutions. We report on a preliminary implementation and propose a parallel architecture.
On Independence and Sensitivity of Statistical Randomness Tests
Authors: Meltem Sönmez Turan, Ali DoĞanaksoy, Serdar Boztaş
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

Statistical randomness testing has significant importance in analyzing the quality of random number generators. In this study, we focus on the independence of randomness tests and its effect on the coverage of test suites. We experimentally observe that frequency, overlapping template, longest run of ones, random walk height and maximum order complexity tests are correlated for short sequences. We also proposed the concept of sensitivity, where we analyze the effect of simple transformations on output p-values. We claim that whenever the effect is significant, the composition of the transformation and the test may be included to the suite as a new test.
The Influence of Training Data Availability Time on Effectiveness of ANN Adaptation Process
Authors: Ewa Dudek-Dyduch, Adrian Horzyk
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In the paper the new approach to create artificial neural networks (ANNs) is proposed. ANN's are inspired by natural neural networks (NNNs) that receive data in time still tuning themselves. In opposite to them ANNs usually work on the training data (TD) acquired in the past and are totally available at the beginning of the adaptation process. Because of this the adaptation methods of the ANNs can be sometimes more effective than the natural training process observed in the NNNs. This paper presents the ability of ANNs to adapt more effectively than NNNs do if only all TD are known before the beginning of the adaptation process. The design and adaptation process of the proposed ANNs is divided into two stages. First, analyze or examining the set of TD. Second, the construction of neural network topology and weights computation. In the paper, two kinds of ANNs which use the proposed construction strategy are presented. The first kind of network is used for classification tasks and the second kind for feature extraction.
Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials
Authors: Stanisław Jarecki, Xiaomin Liu
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We present an efficient implementation of affiliation-hiding envelope and authentication schemes. An envelope scheme enables secure message transmission between two parties s.t. the message can be decrypted only by a receiver who holds a credential from (i.e. is affiliated with) an entity specified by the sender's authorization policy. An envelope scheme is affiliation-hiding if it hides the receiver's affiliation, and if the sender's policy is revealed only to receivers who satisfy it. Similarly, an authentication scheme is affiliation-hiding if it reveals information about affiliations and the authentication policy of a participating party only to counterparties that satisfy this policy.The novelty of our affiliation-hiding envelope scheme is that it remains practical in the multi-affiliation setting without relying on groups with bilinear maps. Namely, it requires O(n) modular exponentiations and communicates O(n) group elements, even if each party has n credentials, and each party's authentication policy specifies n admissible affiliations. Moreover, our affiliation-hiding envelope is chosen-ciphertext secure, which leads to a provably secure affiliation-hiding authentication scheme with same O(n) efficiency in the multi-affiliation setting.
Opportunities and challenges for traceable graph rewriting systems
Authors: Mirko Seifert
Venue: Proceedings of the third international workshop on Graph and model transformations (2008)

Model transformations are a fundamental part of model-driven software development. A widely accepted formal basis for such transformations is Graph Rewriting. For real-world transformations there is a need to examine how well practical demands can rest upon this grounding. To support some of these demands (debugging, dependency visualization and change propagation) we propose the extension of Graph Transformation Systems with tracing. In this paper we investigate, how tracing can facilitate other approaches or even permit new opportunities. We discuss related issues and initial sketches for their solution.
A Model of an Amorphous Computer and Its Communication Protocol
Authors: Lukáš Petrů, Jiří Wiedermann
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We design a formal model of an amorphous computer suitable for theoretical investigation of its computational properties. The model consists of a finite set of nodes created by RAMs with restricted memory, which are dispersed uniformly in a given area. Within a limited radius the nodes can communicate with their neighbors via a single-channel radio. The assumptions on low-level communication abilities are among the weakest possible: the nodes work asynchronously, there is no broadcasting collision detection mechanism and no network addresses. For the underlying network we design a randomized communication protocol and analyze its efficiency. The subsequent experiments and combinatorial analysis of random networks show that the expectations under which our protocol was designed are met by the vast majority of the instances of our amorphous computer model.
Non-linear Reduced Round Attacks against SHA-2 Hash Family
Authors: Somitra Kumar Sanadhya, Palash Sarkar
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

Most of the attacks against (reduced) SHA-2 family in literature have used local collisions which are valid for linearized version of SHA-2 hash functions. Recently, at FSE '08, an attack against reduced round SHA-256 was presented by Nikolić and Biryukov which used a local collision which is valid for the actual SHA-256 function. It is a 9-step local collision which starts by introducing a modular difference of 1 in the two messages. It succeeds with probability roughly 1/3. We build on the work of Nikolić and Biryukov and provide a generalized nonlinear local collision which accepts an arbitrary initial message difference. This local collision succeeds with probability 1. Using this local collision we present attacks against 18-step SHA-256 and 18-step SHA-512 with arbitrary initial difference. Both of these attacks succeed with probability 1. We then present special cases of our local collision and show two different differential paths for attacking 20-step SHA-256 and 20-step SHA-512. One of these paths is the same as presented by Nikolić and Biryukov while the other one is a new differential path. Messages following both these differential paths can be found with probability 1. This improves on the previous result where the success probability of 20-step attack was 1/3. Finally, we present two differential paths for 21-step collisions for SHA-256 and SHA-512, one of which is a new path. The success probabilities of these paths for SHA-256 are roughly 2¿ 15 and 2¿ 17 which improve on the 21-step attack having probability 2¿ 19 reported earlier. We show examples of message pairs following all the presented differential paths for up to 21-step collisions in SHA-256. We also show first real examples of colliding message pairs for up to 20-step reduced SHA-512.
Guiding Organic Management in a Service-Oriented Real-Time Middleware Architecture
Authors: Manuel Nickschas, Uwe Brinkschulte
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

To cope with the ever increasing complexity of today's computing systems, the concepts of organic and autonomic computing have been devised. Organic or autonomic systems are characterized by so-called self-X properties such as self-configuration and self-optimization. This approach is particularly interesting in the domain of distributed, embedded, real-time systems. We have already proposed a service-oriented middleware architecture for such systems that uses multi-agent principles for implementing the organic management. However, organic management needs some guidance in order to take dependencies between services into account as well as the current hardware configuration and other application-specific knowledge. It is important to allow the application developer or system designer to specify such information without having to modify the middleware. In this paper, we propose a generic mechanism based on capabilities that allows describing such dependencies and domain knowledge, which can be combined with an agent-based approach to organic management in order to realize self-X properties. We also describe how to make use of this approach for integrating the middleware's organic management with node-local organic management.
Contrary-to-Duties Constraints: From UML to Relational Model
Authors: Pedro Nogueira Ramos
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Sometimes, because of an atypical situation, an important mandatory association between classes in a UML Class Diagram must be replaced by an optional one. That semantic and functional impoverishment happens because the mandatory constraint must have a boolean value. In this paper we analyze the use of soft constraints in the UML Class Diagram, and their automatic repercussion in the corresponding Relational Model. The soft (deontic) constraints allow the formal representation of requirements, which ideally should always be fulfilled, but can be violated in atypical situations. In this paper we enrich a previous deontic approach, by introducing the ability to explicitly represent the so called Contrary-To-Duties requirements, i.e., domain integrity requirements that emerge as a consequence of an unfulfilled mandatory constraint. We support our approach with the UML/OCL language.
On the Size of the 3D Visibility Skeleton: Experimental Results
Authors: Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k convex polytopes with n edges in total, the worst case size complexity of this data structure is ¿(n 2 k 2) [Brönnimann et al. 07]; whereas for k uniformly distributed unit spheres, the expected size is ¿(k) [Devillers et al. 03].In this paper, we study the size of the visibility skeleton experimentally. Our results indicate that the size of the 3D visibility skeleton, in our setting, is $ C\,k\sqrt{n\,k}$, where C varies with the scene density but remains small. This is the first experimentally determined asymptotic estimate of the size of the 3D visibility skeleton for reasonably large n and expressed in terms of both n and k. We suggest theoretical explanations for the experimental results we obtained. Our experiments also indicate that the running time of our implementation is O(n 3/2 klogk), while its worst-case running time complexity is O(n 2 k 2 logk).
2008 Special Issue: Combining experts in order to identify binding sites in yeast and mouse genomic data
Authors: Mark Robinson, Cristina González Castellano, Faisal Rezwan, Rod Adams, Neil Davey, Alastair Rust, Yi Sun
Venue: Neural Networks (2008)

The identification of cis-regulatory binding sites in DNA is a difficult problem in computational biology. To obtain a full understanding of the complex machinery embodied in genetic regulatory networks it is necessary to know both the identity of the regulatory transcription factors and the location of their binding sites in the genome. We show that using an SVM together with data sampling to classify the combination of the results of individual algorithms specialised for the prediction of binding site locations, can produce significant improvements upon the original algorithms. The resulting classifier produces fewer false positive predictions and so reduces the expensive experimental procedure of verifying the predictions.
Reasoning about Control Flow in the Presence of Transient Faults
Authors: Frances Perry, David Walker
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

A transient fault is a temporary, one-time event that causes a change in state or erroneous signal transfer in a digital circuit. These faults do not cause permanent damage, but when they strike conventional processors, they may result in incorrect program execution. While detecting and correcting faults in first-order data may be accomplished relatively easily by adding redundancy, protecting against faults during control flow transfers is substantially more difficult. This paper analyzes the problem of maintaining the control-flow integrity of a program in the face of transient faults from a formal theoretical perspective. More specifically, we augment the operational semantics of an idealized assembly language with additional rules that model erroneous control-flow transfers. Next, we explain a strategy for detecting control-flow errors based on previous work by Oh [10] and Reis [15]. In order to reason about the correctness of the strategy relative to our fault model, we develop a new assembly-level type system designed to guarantee that any control flow transfer to an incorrect block will be caught before control leaves that block. The key technical result of the paper is a rigorous proof of this fundamental control-flow property for well-typed programs.
A Generalized Differential Evolution Combined with EDA for Multi-objective Optimization Problems
Authors: Wang Chen, Yan-Jun Shi, Hong-Fei Teng
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper proposed a multi-objective evolutionary algorithm (called by GDE-EDA hereinafter). The proposed algorithm combined a generalized differential evolution (DE) with an estimation of distribution algorithm (EDA). This combination can simultaneously use global information of population extracted by EDA and differential information by DE. Thus, GDE-EDA can obtain a better distribution of the solutions by EDA while keeping the fast convergence exhibited by DE. The experimental results of the proposed GDE-EDA algorithm were reported on a suit of widely used test functions, and compared with GDE and NSGA-II in the literature.
High performance discrete Fourier transforms on graphics processors
Authors: Naga K. Govindaraju, Brandon Lloyd, Yuri Dotsenko, Burton Smith, John Manferdelli
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

We present novel algorithms for computing discrete Fourier transforms with high performance on GPUs. We present hierarchical, mixed radix FFT algorithms for both power-of-two and non-power-of-two sizes. Our hierarchical FFT algorithms efficiently exploit shared memory on GPUs using a Stockham formulation. We reduce the memory transpose overheads in hierarchical algorithms by combining the transposes into a block-based multi-FFT algorithm. For non-power-of-two sizes, we use a combination of mixed radix FFTs of small primes and Bluestein's algorithm. We use modular arithmetic in Bluestein's algorithm to improve the accuracy. We implemented our algorithms using the NVIDIA CUDA API and compared their performance with NVIDIA's CUFFT library and an optimized CPU-implementation (Intel's MKL) on a high-end quad-core CPU. On an NVIDIA GPU, we obtained performance of up to 300 GFlops, with typical performance improvements of 2--4x over CUFFT and 8--40x improvement over MKL for large sizes.
CartoonPlus: A New Scaling Algorithm for Genomics Data
Authors: Joanna Jakubowska, Ela Hunt, Matthew Chalmers
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

We focus on visualisation techniques used in genome browsers and report on a new technique, CartoonPlus, which improves the visual representation of data. We describe our use of smooth zooming and panning, and a new scaling algorithm and focus on options. CartoonPlus allows the users to see data not in original size but scaled, depending on the data type which is interactively chosen by the users. In VisGenome we have chosen genes as the basis for scaling. All genes have the same size and all other data is scaled in relationship to genes. Additionally, objects which are smaller than genes, such as micro array probes or markers, are scaled differently to reflect their partitioning into two categories: objects in a gene region and objects positioned between genes. This results in a significant legibility improvement and should enhance the understanding of genome maps.
Boosting the Performance of a Multiobjective Algorithm to Design RBFNNs Through Parallelization
Authors: Alberto Guillén, Ignacio Rojas, Jesus González, Hector Pomares, Luis J. Herrera, Ben Paechter
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Radial Basis Function Neural Networks (RBFNNs) have been widely used to solve classification and regression tasks providing satisfactory results. The main issue when working with RBFNNs is how to design them because this task requires the optimization of several parameters such as the number of RBFs, the position of their centers, and their radii. The problem of setting all the previous values presents many local minima so Evolutionary Algorithms (EAs) are a common solution because of their capability of finding global minima. Two of the most important elements in an EAs are the crossover and the mutation operators. This paper presents a comparison between a non distributed multiobjective algorithm against several parallel approaches that are obtained by the specialisation of the crossover and mutation operators in different islands. The results show how the creation of specialised islands that use different combinations of crossover and mutation operators could lead to a better performance of the algorithm by obtaining better solutions.
A VLSI Architecture for Software Structure: The Intel 8086
Authors: Alfred Hartmann, Scott Fehr
Venue: IEEE Micro (1981)

By supporting modular programs and high-level languages, this microprocessor architecture aids the implementation of complex software.
Evaluation of Feature Subset Selection, Feature Weighting, and Prototype Selection for Biomedical Applications
Authors: Suzanne Little, Ovidio Salvetti, Petra Perner
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

Many medical diagnosis applications are characterized by datasets that contain under-represented classes due to the fact that the disease appears more rarely than the normal case. In such a situation classifiers that generalize over the data such as decision trees and Naïve Bayesian are not the proper choice as classification methods. Case-based classifiers that can work on the samples seen so far are more appropriate for such a task. We propose to calculate the contingency table and class specific evaluation measures despite the overall accuracy for evaluation purposes of classifiers for these specific data characteristics. We evaluate the different options of our case-based classifier and compare the performance to decision trees and Naïve Bayesian. Finally, we give an outlook for further work.