ppxscal/embedding_network huggingface dataset:
Continuous queries in oracle
Authors: Andrew Witkowski, Srikanth Bellamkonda, Hua-Gang Li, Vince Liang, Lei Sheng, Wayne Smith, Sankar Subramanian, James Terry, Tsae-Feng Yu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial databases. The feature is based on the concept of query difference and allows us to monitor real time changes to the query as the result of changes to its underlying tables. The result of a continuous query can be deposited into historical tables or queues for further asynchronous de-queuing, or can invoke a synchronous trigger for procedural processing. The main contribution of our CQ engine is that it allows us to react to complex scenarios of changes to data such as mixed INSERT, DELETE and UPDATE changes, unlike the existing stream processing systems that deal with INSERTS only. We support a wide range of query shapes including inner, semi and anti-joins, aggregates and window functions. More details are given to the efficient computation of query difference for general cases and their optimizations based on semantic constraints. They are shown to improve the response time for practical cases by more than an order of magnitude. We also show how delaying CQ re-computation can improve its performance by batch processing the changes to the base tables.
On the scalability of parallel genetic algorithms
Authors: Erick Cantú-Paz, David E. Goldberg
Venue: Evolutionary Computation (1999)

This paper examines the scalability of several types of parallel genetic algorithms (GAs). The objective is to determine the optimal number of processors that can be used by each type to minimize the execution time. The first part of the paper considers algorithms with a single population. The investigation focuses on an implementation where the population is distributed to several processors, but the results are applicable to more common masterslave implementations, where the population is entirely stored in a master processor and multiple slaves are used to evaluate the fitness. The second part of the paper deals with parallel GAs with multiple populations. It first considers a bounding case where the connectivity, the migration rate, and the frequency of migrations are set to their maximal values. Then, arbitrary regular topologies with lower migration rates are considered and the frequency of migrations is set to its lowest value. The investigationis mainly theoretical, but experimental evidence with an additively-decomposable function is included to illustrate the accuracy of the theory. In all cases, the calculations show that the optimal number of processors that minimizes the execution time is directly proportional to the square root of the population size and the fitness evaluation time. Since these two factors usually increase as the domain becomes more difficult, the results of the paper suggest that parallel GAs can integrate large numbers of processors and significantly reduce the execution time of many practical applications.
Comments on "An O(n) Parallel Multiplier with Bit-Sequential Input and Output"
Authors: H. J. Sips
Venue: IEEE Transactions on Computers (1982)

For the realization of a bit-sequential multiplier with operands of length n, Chen and Willoner1 suggest a circuitry consisting of 2n identical modules. It is shown that if a slightly different arrangement of the modules is taken, the number of modules is reduced to n. Furthermore, the implementation in circuit form can be made more simple.
A Tutorial on Satellite Graphics Systems
Authors: J. D. Foley
Venue: Computer (1976)

Satellite graphics terminals, which include a micro or minicomputer to perform interactive processing, present a number of advantages-not the least of which are accessibility and responsiveness. This paper describes two basic types of satellites and outlines techniques for best exploiting their capabilities.
Data Referencing: An Empirical Investigation
Authors: H. E. Dunsmore
Venue: Computer (1979)

The language features selected affect the difficulty of the programming process. Proper choices of variables referenced and those "alive" per statement may simplify both program construction and maintenance.
An infrastructure for autonomic system development: the selflet approach
Authors: Davide Devescovi, Elisabetta Di Nitto, Raffaela Mirandola
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Autonomic computing is an emergent field for the development of large-scale, self-managing, complex distributed computer-based systems. This paper aims to be a practical approach to Autonomic Computing, by defining and implementing a generic model for autonomic systems, allowing software developers to create autonomic applications using a common and comprehensive infrastructure. In particular, this paper defines a simple but complete model andarchitecture of an autonomic computing element called SelfLet, which could be the building components used to create autonomic systems. SelfLets can be defined by specifying their behaviour, the abilities and goals they need to use and/or provide, and a high-level policy guiding their self-management.
Implementation of Architecture Concepts for Hardware Agent Systems
Authors: J. Schneider, M. Naggatz, R. G. Spallek
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Requirements to implement future information process- ing systems are in particular flexibility, adaptability, and reliability. Agent systems which are known from soft- ware (sw) technology are a new way to implement these information processing systems. Features like autonomy, proactiveness, reactivity, artificial intelligence and fea- tures for self-organisation of agent systems with focus on self-configuring, self-healing, self-optimizing, and self- protecting make agent systems different from conventional systems. Our goal is to provide architecture concepts for hardware (hw) agent systems, embedded hw platforms to create hw agents with the properties of sw agents, and new methods to make these hw agent systems adaptive and fail- safe. This paper describes a specialized embedded hw ar- chitecture utilizing for agent systems with a high degree on flexibility, parallelism and reliability.
Robust Egress Interdomain Traffic Engineering
Authors: Jian Qiu, Lixin Gao
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

BGP is traditionally configured to implement traffic engineering objectives without considering potential network dynamics.This might result in undesirable traffic distribution when network failures occur. In this paper, we present algorithms forinterdomain traffic engineering that achieve the interdomain traffic engineering objectives under network failures. That is,we aim to configure routing policies so that traffic is distributed evenly. More importantly, the configuration is robustin the sense that it is able to achieve the specified traffic engineering goals despite network failures. We first investigatethe coarse-grained robust configurations. The derived configuration can achieve optimal robust traffic engineering objectivesfor most network failures. Further, we develop a greedy algorithm to derive robust BGP configuration for any traffic distributionand link capacities. We use simulations to evaluate the robustness of the derived BGP configurations by applying the algorithmto both transit and stub ASs under realistic traffic demands. Our results show that the derived BGP configurations can improvethe default configuration significantly in terms of achieving the robust traffic engineering objectives. Furthermore, ouralgorithm achieves robust traffic engineering goals without diminishing other routing objectives.
Guest Editorial Software Management: We Must Find a Way
Authors: R. E. Merwin
Venue: IEEE Transactions on Software Engineering (1978)

SOFTWARE management is a term which inspires many different reactions from the broad range of practitioners in the field of data processing. The term has many dimensions ranging from the first and second line manager of a software development activity who plies his trade with little to fall back on other than his prior experience, and native skills and intuition. Contrast this with a senior executive who, because of lack of understanding of software management, is frustrated in trying to determine if his company can produce a software program on schedule and within budget. The data processing landscape is littered with examples of major software developments which faltered and then expired. That this situation should exist, after almost a quarter-century of experience with implementing these systems, is one of the enigmas of the rapidly expanding data processing industry.
A tactile language for intuitive human-robot communication
Authors: Andreas J. Schmid, Martin Hoffmann, Heinz Woern
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

This paper presents a tactile language for controlling a robot through its artificial skin. This language greatly improves the multimodal human-robot communication by adding both redundant and inherently new ways of robot control through the tactile mode. We defined an interface for arbitrary tactile sensors, implemented a symbol recognition for multi-finger contacts, and integrated that together with a freely available character recognition software into an easy-to-extend system for tactile language processing that can also incorporate and process data from non-tactile interfaces. The recognized tactile symbols allow for both a direct control of the robot's tool center point as well as abstract commands like "stop" or "grasp object x with grasp type y". In addition to this versatility, the symbols are also extremely expressive since multiple parameters like direction, distance, and speed can be decoded from a single human finger stroke. Furthermore, our efficient symbol recognition implementation achieves real-time performance while being platform-independent. We have successfully used both a multi-touch finger pad and our artificial robot skin as tactile interfaces. We evaluated our tactile language system by measuring its symbol and angle recognition performance, and the results are promising.
Updating Probabilistic Knowledge Using Imprecise and Uncertain Evidence
Authors: Hexin Lv, Ning Qiu, Yongchuan Tang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper examines how to update a priori knowledge which is representable by a multi-dimensional probability distribution, when one learns that the observation is representable by a cluster of random sets or bodies of evidence defined on different one-dimensional space. In order to resolve this problem, firstly, a set of marginal probability distributions is derived from the set of random sets, where each marginal probability distribution is compatible with the corresponding random set, and is "close' to a priori probability distribution's marginalization with respect to the corresponding universe in the sense of cross-entropy. Then an additively constrained set is derived from all random sets. Lastly, the iterative proportional fitting procedure (IPFP) is used to search the desired probability distribution in the additively constrained set with respect to a priori probability distribution.
Computer Vision Systems for Industrial Inspection and Assembly
Authors: G. J. Agin
Venue: Computer (1980)

Custom-designed computer vision systems are being applied to specific manufacturing tasks. Current development may lead to general-purpose systems for a broad range of industrial 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
Programming with Verification Conditions
Authors: M. H. Van Emden
Venue: IEEE Transactions on Software Engineering (1979)

This paper contains an exposition of the method of programming with verification conditions. Although this method has much in common with the one discussed by Dijkstra in A Disciplne of Programming, it is shown to have the advantage in simplicity and flexibility. The simplicity is the result of the method's being directly based on Floyd's inductive assertions The method is flexible becasue of the way in which the program is constructed in two stages. In the first stage, a set of verification conditions is collected which corresponds to a program in "flowgraph" form. In this stage sequencing control is of no concern to the progmmer. Control is introduced in the second stage, which consists of automatable applications of translation and optimization rules, resulting in conventional code. Although our method has no use for the sequencing primitives of "structured programming," it is highly secure and systematic.
The Use of RBF Based on Fisher Ratio for Eddy Current Nondestructive Detecting System
Authors: Xiaoyun Sun, Donghui Liu, Aihua Li, Liqian Feng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Improved radial basis function (RBF) neural network is applied on eddy current nondestructive quantitative detecting. Owning to the disadvantages of OLS in network structure optimization, authors put forward using Fisher ratio method to optimize the RBF centers, orthogonal transform and forward selection search method are used to optimize structure. The result shows that the neural structure is simplified strongly, the converge precision and class separability is improved, and this method is satisfied to detect online.
Applying machine learning to software fault-proneness prediction
Authors: Iker Gondra
Venue: Journal of Systems and Software (2008)

The importance of software testing to quality assurance cannot be overemphasized. The estimation of a module's fault-proneness is important for minimizing cost and improving the effectiveness of the software testing process. Unfortunately, no general technique for estimating software fault-proneness is available. The observed correlation between some software metrics and fault-proneness has resulted in a variety of predictive models based on multiple metrics. Much work has concentrated on how to select the software metrics that are most likely to indicate fault-proneness. In this paper, we propose the use of machine learning for this purpose. Specifically, given historical data on software metric values and number of reported errors, an Artificial Neural Network (ANN) is trained. Then, in order to determine the importance of each software metric in predicting fault-proneness, a sensitivity analysis is performed on the trained ANN. The software metrics that are deemed to be the most critical are then used as the basis of an ANN-based predictive model of a continuous measure of fault-proneness. We also view fault-proneness prediction as a binary classification task (i.e., a module can either contain errors or be error-free) and use Support Vector Machines (SVM) as a state-of-the-art classification method. We perform a comparative experimental study of the effectiveness of ANNs and SVMs on a data set obtained from NASA's Metrics Data Program data repository.
Discrepancy with respect to convex polygons
Authors: W. W. L. Chen, G. Travaglini
Venue: Journal of Complexity (2007)

We study the problem of discrepancy of finite point sets in the unit square with respect to convex polygons, when the directions of the edges are fixed, when the number of edges is bounded, as well as when no such restrictions are imposed. In all three cases, we obtain estimates for the supremum norm that are very close to best possible.
SemID: Combining Semantics with Identity Management
Authors: Mohammad M. R. Chowdhury, Juan Miguel Gomez, Josef Noll, Angel Garcia Crespo
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

The need for information security and privacy in today's connected systems is overwhelming. In this paper, we focus on the identity management in corporate environment to access various project resources. Capabilities of semantic web technology facilitate the development of proposed SemID ontology that formally represents the identity management domain. It contains roles, policies and rules to control access to resources and to ensure privacy. A use case scenario of project oriented corporate working environment is introduced and then modeled using Protègè ontology editor platform.
Process-centered review of object oriented software development methodologies
Authors: Raman Ramsin, Richard F. Paige
Venue: ACM Computing Surveys (CSUR) (2008)

We provide a detailed review of existing object-oriented software development methodologies, focusing on their development processes. The review aims at laying bare their core philosophies, processes, and internal activities. This is done by using a process-centered template for summarizing the methodologies, highlighting the activities prescribed in the methodology while describing the modeling languages used (mainly diagrams and tables) as secondary to the activities. The descriptions produced using this template aim not to offer a critique on the methodologies and processes, but instead provide an abstract and structured description in a way that facilitates their elaborate analysis for the purposes of improving understanding, and making it easier to tailor, select, and evaluate the processes.
An Interest-Diffused Clustering Routing Algorithm by Bitmap in Wireless Sensor Networks
Authors: Sangjoon Jung, Younky Chung
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

This paper proposes a clustering routing algorithm that conJgures cluster to reduce the number of messages when establishing routing paths. Sensor nodes deployed in a sensing area contain links information about adjacent nodes. While receiving an interest ji-om neighbor nodes, the sensor node broadcasts the interest and own bitmap. Each node keeps link information expressed by bitmap. After broadcasting, each node updates the bitmap when the adjacent nodes broadcast the same interest message. The size of bitmap is restricted, so sensor node must be classzJed into clusters. We try to divide clusters by naming a sub-sink node. Then, all nodes in a certain cluster must report to the sub-sink node. A sub-sink has afirnction to broadcast an interest and to receive data from cluster members. The sub-sink node broadcasts only an interest, because the size of bitmap is restricted and all nodes need not know information about total topologies. The proposed routing algorithm reduces the number of required messages for establishing routing paths in comparison to the previous clustering algorithms.
Tutorial: Static Analysis and Dynamic Testing of Computer Software
Authors: R. E. Fairley
Venue: Computer (1978)

Computer programs can be checked for errors statically and dynamically. Static analysis looks for structural and semantic faults in programs. Dynamic analysis affirms proper operation and helps identify errors.
Making sense: interactive sculptures as tangible design material
Authors: Mads Vedel Jensen, Marcelle Stienstra
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

The field of tangible interaction shows an increasing focus on embodiment; how the body has a central role in how we as human beings experience, understand, and interact with the world we live in. In this paper we present a design exercise that has a strong focus on the body and how interaction is experienced. The exercise utilizes the designer's own bodily experiences in the design of new tangible interfaces. The design exercise was done with a group of design students. We asked them to design interactive sculptures to convey the interaction qualities they had extracted from video material. The interactive sculptures served as a physical reflective tool that allowed the students to test and experience the qualities of interaction they wanted to bring into a new design, before they moved on to designing the actual product. We conclude that interactive sculptures serve as a rich design material that provide the students with relevant insights and a richer vocabulary concerning interaction qualities from a bodily perspective.
Toward Automatic Data Distribution for Migrating Computations
Authors: Lei Pan, Jingling Xie, Ming Kin Lai, Michael B. Dillencourt, Lubomir F. Bic
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a different approach than the conventional solutions that use a SPMD model. This paper focuses on data distribution for NavP. We introduce the Navigational Trace Graph (NTG), a mathematical structure that captures the alignment and distribution preferences of a sequential program. Graph partitioning is applied to NTGs to obtain data distribution solutions. The major advantage is that our methodology can focus exclusively on reducing communication overhead first and later determine the actual computation partition and parallelization, because NavP computations migrate freely across partitions. This is in stark contrast to SPMD, where the data partitioning imposes hard constraints on the threads because they are stationary. We present experimental results to demonstrate the effectiveness of our approach.
Situated Multimodal Documents
Authors: Augusto Celentano, Fabio Pittarello
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The choices made by user in processing a set of documents is related, in a broad sense, to the sum of influences coming from the documents in the user situation, which does not include only physical or technical context parameters, but also the user goal and a set of personal components related to the user goal and to the effect on the user of the document. We use the term situated document to denote such influence. In this paper we propose a model for situated documents and propose a functional architecture for their management.
Run-time mapping and communication strategies for Homogeneous NoC-Based MPSoCs
Authors: G. Sassatelli, N. Saint-Jean, P. Benoit, L. Torres, M. Robert, Cristiane Woszezenki, Ismael Augusto Grehs, Fernando Moraes
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Multi-Processor Systems-on-Chip are becoming increasingly popular in embedded systems for the high degree of performance and flexibility they permit. While most MPSoCs are today highly heterogeneous for better fitting the target applications, homogeneous systems may become in a near future a viable alternative bringing other benefits such as run-time load balancing, high performance and low power consumption. The work presented in this paper relies on a homogeneous NoC-based MPSoC framework we developed which allows us to conduct cycle-accurate evaluations of 2 different techniques: proactive and reactive communications.