ppxscal/embedding_network huggingface dataset:
Quality Assurance in perfSONAR Release Management
Authors: Jeff W. Boote, Andreas Hanemann, Loukik Kudarimoti, Panagiotis Louridas, Luis Marta, Michalis Michael, Nicolas Simar, Ilias Tsompanidis
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

Software release management is closely related to the management of software quality since only software with assured quality should be provided to users. While established best practices exist for the development of software within an organization, new challenges arise with the introduction of Service Oriented Architectures which make it possible to develop loosely-coupled systems potentially involving different organizations. For these systems it is not sufficient to test parts individually, but the collaboration issues need to be taken into account. In the perfSONAR project a set of loosely-coupled web services has been developed to perform and manage measurements of network performance in research backbone networks. For the transition of the service development into the provisioning of permanently operated services, a release management process has been devised. It is presented in this paper highlighting the aspects being taken into account. These are also relevant for similar projects where Service Oriented Architectures are deployed.
Arithmetic Computing Based Chinese Automatic Parsing Method
Authors: Xiao Yang, Jiancheng Wan, Ling Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Cohesion degree is an important feature in differentiating ambiguous Chinese phrases. At the present time, there are no module in computer-oriented linguistic theories to represent this information and it is represented by additional statistical modules. The Binary Combinatorial Grammar (BCG) is based on arithmetic computing and integrates the cohesion degree as the priorities between operators. In order to resolve the share space problem and to improve the efficiency of operator-precedence shift-reduce parsing algorithm, the notion of precedence is introduced to the CYK algorithm to determine the combinatorial direction and to prune a portion of unnecessary subtrees during the parsing process. In the experiment of Chinese BCG parsing, all of the spent time, produced edges and result trees in the precedence based CYK algorithm are much less than that of the traditional CYK algorithm and the operator precedence based shift-reduce algorithm.
Seeing like an interface
Authors: Paul Dourish
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Mobile and ubiquitous computing systems are increasingly of interest to HCI researchers. Often, this has meant considering the ways in which we might migrate desktop applications and everyday usage scenarios to mobile devices and mobile contexts. However, we do not just experience technologies in situ -- we also experience everyday settings through the technologies we have at our disposal. Drawing on anthropological research, I outline an alternative way of thinking about the relationship between technology and "seeing" everyday life and everyday space.
High Bandwidth Anomalies in Cluster and Grid Data Transfer
Authors: Carlo Barrios-Hernandez, Yves DENNEULIN, Michel RIVEILL
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The performance of the intensive communications in clusters and grids is critical during the execution time of the parallel programs. We have detected anomalies during test on the Grid 5000 infrastructure as losses of bandwidth. This paper describes effectuated tests, analyses the results and propose a model for bandwidth lost in intensive data transfer on high scalable architectures.
Letters: Robust stability analysis of competitive neural networks with different time-scales under perturbations
Authors: A. Meyer-Bäse, R. Roberts, H. G. Yu
Venue: Neurocomputing (2007)

We establish robust stability results for competitive neural networks with different time-scales under parameter perturbations and determine conditions that ensure the existence of asymptotically stable equilibria of the perturbed neural system. It is assumed that the system uncertainties are limited by the upper bounds of their norms. We derive a Lyapunov function for the coupled system and a maximal upper bound for the fast time-scale associated with the neural activity state.
False positive or false negative: mining frequent itemsets from high speed transactional data streams
Authors: Jeffery Xu Yu, Zhihong Chong, Hongjun Lu, Aoying Zhou
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The problem of finding frequent items has been recently studied over high speed data streams. However, mining frequent itemsets from transactional data streams has not been well addressed yet in terms of its bounds of memory consumption. The main difficulty is due to the nature of the exponential explosion of itemsets. Given a domain of I unique items, the possible number of itemsets can be up to 2I - 1. When the length of data streams approaches to a very large number N, the possibility of an itemset to be frequent becomes larger and difficult to track with limited memory. However, the real killer of effective frequent itemset mining is that most of existing algorithms are false-positive oriented. That is, they control memory consumption in the counting processes by an error parameter ε, and allow items with support below the specified minimum support s but above s-ε counted as frequent ones. Such false-positive items increase the number of false-positive frequent itemsets exponentially, which may make the problem computationally intractable with bounded memory consumption. In this paper, we developed algorithms that can effectively mine frequent item(set)s from high speed transactional data streams with a bound of memory consumption. While our algorithms are false-negative oriented, that is, certain frequent itemsets may not appear in the results, the number of false-negative itemsets can be controlled by a predefined parameter so that desired recall rate of frequent itemsets can be guaranteed. We developed algorithms based on Chernoff bound. Our extensive experimental studies show that the proposed algorithms have high accuracy, require less memory, and consume less CPU time. They significantly outperform the existing false-positive algorithms.
A high order ENO conservative Lagrangian type scheme for the compressible Euler equations
Authors: Juan Cheng, Chi-Wang Shu
Venue: Journal of Computational Physics (2007)

We develop a class of Lagrangian type schemes for solving the Euler equations of compressible gas dynamics both in the Cartesian and in the cylindrical coordinates. The schemes are based on high order essentially non-oscillatory (ENO) reconstruction. They are conservative for the density, momentum and total energy, can maintain formal high order accuracy both in space and time and can achieve at least uniformly second-order accuracy with moving and distorted Lagrangian meshes, are essentially non-oscillatory, and have no parameters to be tuned for individual test cases. One and two-dimensional numerical examples in the Cartesian and cylindrical coordinates are presented to demonstrate the performance of the schemes in terms of accuracy, resolution for discontinuities, and non-oscillatory properties.
Coordination in Service Oriented Architectures Using Transaction Processing Concepts
Authors: Peter Hrastnik, Werner Winiwarter
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Service oriented architectures (SOAs) provide an architectural paradigm to develop and evolve enterprise information systems. A key feature of SOAs is compensability of services. Such service assemblies require high coordination efforts to reliably produce a valid result. Transactional processing concepts are widely used to tackle coordination requirements in tightly-coupled distributed systems like J2EE or CORBA. However, in loosely-coupled systems like SOAs, the use of transaction processing systems is uncommon, although proposals for doing transaction processing in Web services systems (an implementation option for SOAs) exist. In this paper, general aspects of a transaction processing system are introduced that can be reasonably used for the coordination of services in SOAs. We present an approach and a corresponding implementation of a transaction processing system for service oriented architectures that adheres to the above-mentioned characteristics.
Synthesis of Holograms fROM Computer-Generated Output
Authors: J. C. Newell
Venue: Computer (1975)

It has long been accepted that construction of holograms by computer simulation of Maxwell's equations of wave propagation is extremely difficult and expensive. A noteworthy and considerably less expensive departure from computer hologram generation in the strict sense is the binary Fourier hologram1 12
Relational Dependency Networks
Authors: Jennifer Neville, David Jensen
Venue: The Journal of Machine Learning Research (2007)

Recent work on graphical models for relational data has demonstrated significant improvements in classification and inference when models represent the dependencies among instances. Despite its use in conventional statistical models, the assumption of instance independence is contradicted by most relational data sets. For example, in citation data there are dependencies among the topics of a paper's references, and in genomic data there are dependencies among the functions of interacting proteins. In this paper, we present relational dependency networks (RDNs), graphical models that are capable of expressing and reasoning with such dependencies in a relational setting. We discuss RDNs in the context of relational Bayes networks and relational Markov networks and outline the relative strengths of RDNs---namely, the ability to represent cyclic dependencies, simple methods for parameter estimation, and efficient structure learning techniques. The strengths of RDNs are due to the use of pseudolikelihood learning techniques, which estimate an efficient approximation of the full joint distribution. We present learned RDNs for a number of real-world data sets and evaluate the models in a prediction context, showing that RDNs identify and exploit cyclic relational dependencies to achieve significant performance gains over conventional conditional models. In addition, we use synthetic data to explore model performance under various relational data characteristics, showing that RDN learning and inference techniques are accurate over a wide range of conditions.
Using knowledge partitioning to investigate the psychological plausibility of mixtures of experts
Authors: Sébastien Hélie, Gyslain Giguère, Denis Cousineau, Robert Proulx
Venue: Artificial Intelligence Review (2006)

Over the years, the presence of knowledge partitioning (KP) in human function learning data has been used to argue that mixture-of-experts models (MOE) constitute a psychologically plausible explanation of human performance, and that the experts used by humans are always linear. These claims recently led to the proposition of the population of linear experts model (POLE). In this paper, variations of the firefighting paradigm developed by Lewandowsky and his colleagues, which initiated research about KP, were used to explore the psychological plausibility of MOE in general and POLE in particular. In a first experiment, these statements were tested by modifying the test display of the firefighting paradigm. The results showed that adding irrelevant information to the display resulted in a smaller proportion of partitioning participants. Also, some participants used non-linear experts to partition the stimulus space. This new type of KP was further explored in a second study, which included more training sessions. The results suggest that linear KP disappears with practice and that non-linear partitioning reflects the incapacity to correctly estimate the position of the function's vertex. It is concluded that MOE are adequate psychological models, but that the linearity and ubiquity claims of the POLE model need to be weakened.
Mining Complex Hydrobiological Data with Galois Lattices
Authors: A. Bertaux, A. Braud, F. Le Ber
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We have used Galois lattices for mining hydrobiological data. These data are about macrophytes, that are macroscopic plants living in water bodies. These plants are characterized by several biological traits, that own several modalities. Our aim is to cluster the plants according to their common traits and modalities and to find out the relations between traits. Galois lattices are efficient methods for such an aim, but apply on binary data. In this article, we detail a few approaches we used to transform complex hydrobiological data into binary data and compare the first results obtained thanks to Galois lattices.
Inferences, suppositions and explanatory extensions in argument interpretation
Authors: Sarah George, Ingrid Zukerman, Michael Niemann
Venue: User Modeling and User-Adapted Interaction (2007)

We describe a probabilistic approach for the interpretation of user arguments that integrates three aspects of an interpretation: inferences, suppositions and explanatory extensions. Inferences fill in information that connects the propositions in a user's argument, suppositions postulate new information that is likely believed by the user and is necessary to make sense of his or her argument, and explanatory extensions postulate information the user may have implicitly considered when constructing his or her argument. Our system receives as input an argument entered through a web interface, and produces an interpretation in terms of its underlying knowledge representation--a Bayesian network. Our evaluations show that suppositions and explanatory extensions are necessary components of interpretations, and that users consider appropriate the suppositions and explanatory extensions postulated by our system.
A novel diagnostic scheme for the classification of pistons
Authors: Thompson Sarkodie-Gyan, Dezhong Hong, Andrew W. Campbell
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

In this paper, a computer vision system for diagnosing pistons during the process of manufacture is designed. In fact, it is almost always readily possible to fit the incorrect piston to an engine because a number of similar piston types exhibit very slight differences but with the same overall diameter. Within a family, the difference is very subtle and may be simply a change in the shape of the bowl in the crown of the piston. Hereby, a vision based measurement system is designed to confirm the identity of the piston just after it has been fitted to the engine assembly. Structured laser lines are employed to obtain depth information on the piston crowns. A unique calibration technique involving an optical system is introduced in the scheme, in order to achieve precise 3D measurements. Since some pistons have shining surfaces, the reflection on the crowns influences the detection of the laser line, hence the dispersion of the laser lines increases the difficulty of locating the laser lines. The concept of fuzzy sets is employed to describe the features of the pistons to enable the measurement system to be more tolerant to the various pistons and to be able to obtain more accuracy in the recognition scheme.
Geometry Textures
Authors: Rodrigo de Toledo, Bin Wang, Bruno Levy
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

In highly tessellated models, triangles are very small compared to the entire object, representing at the same time its macro- and mesostructures. The main idea in this work is to use a visualization algorithm that is adequate to mesostructure but applied to the whole object. Tessellated models are converted into geometry textures, a geometric representation for surfaces based on height maps. In rendering time, the fine-scale details are reconstructed with LOD speed-up while preserving original quality.
Model and algorithms for the Multicommodity Traveling Salesman Problem
Authors: Joao Sarubbi, Geraldo Robson Mateus, Henrique Pacca Luna, Gilberto Jr. de Miranda
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

We are introducing in this article the Multicommodity Traveling Salesman Problem (MTSP), where the objective is to deliver all the demands of different commodities by a tour that minimizes the sum of the fixed and variable costs for the selected arcs. The MTSP yields then a large scale mixed integer linear programming problem. In this article we devise a Lagrangean based heuristic approach to tackle this more general TSP variant.
Data access patterns in the Amazon.com technology platform
Authors: Werner Vogels
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The Amazon.com technology platform provides a set of highly advanced business and infrastructure services implemented using ultra-scalable distributed systems technologies. Within this environment we can identify a number of specific data access patterns, each with their own availability, consistency, performance and operational requirements in order to serve a collection of highly diverse business processes. In this presentation we will reviews these different patterns in detail and discuss which technologies are required to support them in an always-on environment.
The Oregon Report Software Engineering: The Turning Point
Authors: A. I. Wasserman
Venue: Computer (1978)

In 10 years, the pursuit of software engineering has produced a wealth of good ideas. The time has come to put them to work.
Physics Experiment Could Spawn Permanent Computing Grid
Authors: Pam Frost Gorder
Venue: Computing in Science and Engineering (2007)

The world's biggest physics experiment starts in May 2008. To support it, the world's biggest computing experiment has already begun. The payoffs could reach far beyond physics.
Security/Policy
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Very large scale computations are now becoming routinely used as a methodology to undertake scientific research. In this context, 'provenance systems' are regarded as the equivalent of the scientist's logbook for in silico experimentation: provenance captures the documentation of the process that led to some result. Using a protein compressibility analysis application, we derive a set of generic use cases for a provenance system. In order to support these, we address the following fundamental questions: what is provenance? How to record it? What is the performance impact for grid execution? What is the performance of reasoning? In doing so, we define a technology-independent notion of provenance that captures interactions between components, internal component information and grouping of interactions, so as to allow us to analyze and reason about the execution of scientific processes. In order to support persistent provenance in heterogeneous applications, we introduce a separate provenance store, in which provenance documentation can be stored, archived and queried independently of the technology used to run the application. Through a series of practical tests, we evaluate the performance impact of such a provenance system. In summary, we demonstrate that provenance recording overhead of our prototype system remains under 10% of execution time, and we show that the recorded information successfully supports our use cases in a performant manner. 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
On Bandwidth-Efficient Overlay Multicast
Authors: De-Nian Yang, Wanjiun Liao
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

In this paper, we propose a new multicast delivery mechanism for bandwidth-demanding applications in IP networks. Our mechanism, referred to as Multiple- estination Overlay Multicast (MOM), combines the advantages of IP multicast and overlay multicast. We formulate the Multiple-destination Overlay Multicast routing problem as an optimization problem. We then design an algorithm based on Lagrangean relaxation on our formulation and propose a distributed protocol based on the algorithm. For network operators, MOM consumes less network bandwidth than both IP multicast and overlay multicast. For end users, MOM uses less interface bandwidth than overlay multicast.
Performance Modelling of TXOP Differentiation in Infrastructure-Based WLANs
Authors: Geyong Min, Jia Hu, Mike E. Woodward
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

As the Access Point (AP) is responsible for forwarding all the frames to and from the infrastructure-based WLANs, the network performance is significantly degraded by the unbalanced traffic loads. A potential solution is to assign different Transmission Opportunities (TXOPs) to AP and other mobile stations, respectively. This study develops an analytical model to investigate the performance of infrastructure-based WLANs with the TXOP differentiation under the unbalanced traffic loads. The analytical model is validated through extensive ns2 simulation experiments.
A Robust GF(p) Parallel Arithmetic Unit for Public Key Cryptography
Authors: Santosh Ghosh, Monjur Alam, Indranil Sen Gupta, Dipanwita Roy Chowdhury
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

This paper presents the architecture and FPGA implementation of a robust GF(p) parallel arithmetic unit. The most efficient modular multiplication, inversion and division units greatly reduce the clock cycles requirement for point operations applicable to Elliptic Curve Cryptography. The parallel arithmetic unit helps to achieve a high speed up in cryptographic applications. The architecture can resist the cryptographic timing attack. Integrated input and output interface units provide lower bandwidth requirement to plug in the architecture with automated cryptographic systems. The design exhibits its elegance among competitive architecture with respect to throughput and robustness.
Algorithms for solving systems of linear diophantine equations in residue rings
Authors: S. L. Kryvyi
Venue: Cybernetics and Systems Analysis (2007)

Algorithms are proposed that construct the basis of the set of solutions to a system of homogeneous or inhomogeneous linear Diophantine equations in a residue ring modulo n when the prime factors of n are known.