ppxscal/embedding_network huggingface dataset:
A Trustable Brokerage Solution for Component and Service Markets
Authors: Colin Atkinson, Daniel Brenner, Oliver Hummel, Dietmar Stoll
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

As other engineering disciplines have often demonstrated, the costs and risks involved in developing new products are significantly reduced by the emergence of effective component markets. However, such markets have yet to appear in software engineering. In this paper we present an approach that addresses one of the main outstanding obstacles to software component markets --- the overhead involved in establishing confidence in a component or service. The approach employs a new test definition metaphor which allows potential users to establish whether components do what they are supposed to do without giving them full access. We refer to this as the "black box brokerage" model for software markets which protects the interests of component providers as well as component users, and thus improves the economic motivation for reusing components. In the paper we also describe how a black box broker can be efficiently implemented, outline a new testing metaphor and explain its natural synergies with test-driven reuse.
Spreading Messages
Authors: Ching-Lueh Chang, Yuh-Dauh Lyuu
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We model a network in which messages spread by a simple directed graph G = (V,E) [8] and a function ¿: V¿¿ mapping each v ¿ V to a positive integer less than or equal to the indegree of v. The graph G represents the individuals in the network and the communication channels between them. An individual v ¿ V will be convinced of a message when at least ¿(v) of its in-neighbors are convinced. Suppose we are to convince a message to all individuals by convincing a subset S ¿ V of individuals at the beginning and then let the message spread. We study minimum-sized sets S needed to convince all individuals at the end. In particular, our results include a lower bound on the size of a minimum S and the NP-completeness of computing a minimum S. Our lower bound utilizes a technique in [9]. Finally, we analyze the special case where each individual is convinced of a message when more than half of its in-neighbors are convinced.
Prototyping sensor-actuator networks for home automation
Authors: Matthias Gauger, Daniel Minder, Pedro José Marrón, Arno Wacker, Andreas Lachenmann
Venue: Proceedings of the workshop on Real-world wireless sensor networks (2008)

Integrating actuators into sensor networks is often considered to be the next logical step in the evolution of wireless sensor networks. However, few practical examples of such sensor and actuator networks have been demonstrated so far. In this paper, we present a prototype system that supports the easy prototyping of such applications in the area of home automation. We demonstrate the utility of this system with a simple light control application built on top of it. We also report first experiences and insights gained with the help of real-world experiments.
Virtual Capacity and Dimensioning Issues in Multilayer Networks
Authors: Michal Kucharzak, Leszek Koszalka, Andrzej Kasprzak
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

A term Virtual Capacity layer concerns multilayered model of the network. That kind of models refer to networks compounded of different layers of resources where different topologies in each layer are possible. Virtual Capacity (VC) layer describes a network topology which is situated directly above transport layer. This paper focuses on topology of VC layer and its influence on the dimensioning issue defined for multilayered networks involving two layers of resources. Consider core telecommunication network in Poland originated by Polish Telecom as physical transport network, authors examined different network topologies of VC layer for dimensioning optimization problem.
Sliding Mode Control of a Wastewater Plant with Neural Networks and Genetic Algorithms
Authors: Miguel A. Jaramillo-Morán, Juan C. Peguero-Chamizo, Enrique Martínez De Salazar, Montserrat García Del Valle
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

In this work a simulated wastewater treatment plant is controlled with a sliding mode control carried out with softcomputing techniques. The controller has two modules: the first one performs the plant control when its dynamics lies inside an optimal working region and is carried out by a neural network trained to reproduce the behavior of the technician who controls an actual plant, while the second one drives the system dynamics towards that region when it works outside it and is carried out by a corrective function whose parameters have been adjusted with a genetic algorithm. The controller so defined performs satisfactory even when extreme inputs are presented to the model.
A Heuristic Method for Balanced Graph Partitioning: An Application for the Demarcation of Preventive Police Patrol Areas
Authors: Thiago Assunção, Vasco Furtado
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

In this paper we describe a heuristic method, based on graph-partitioning algorithms, with the purpose of improving the demarcation of areas for police patrolling. This demarcation seeks to homogenize the number of crimes among the patrol regions. If the map of a particular region is taken as a graph, we can say that the problem faced by police forces (typically preventive police) is similar to the problem of finding balanced connected q partitions of graphs (BCPq). Since this is a problem belonging to the NP-Hard class, approximate algorithms are the most suitable for solving such a problem. The method described in this article obtains results nearest those considered optimal for the more general case of BCPq, for q ¿ 2.
Exploration of the Influence of Program Inputs on CMP Co-scheduling
Authors: Yunlian Jiang, Xipeng Shen
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Recent studies have showed the effectiveness of job co-scheduling in alleviating shared-cache contention on Chip Multiprocessors. Although program inputs affect cache usage and thus cache contention significantly, their influence on co-scheduling remains unexplored. In this work, we measure that influence and show that the ability to adapt to program inputs is important for a co-scheduler to work effectively on Chip Multiprocessors. We then conduct an exploration in addressing the influence by constructing cross-input predictive models for some memory behaviors that are critical for a recently proposed co-scheduler. The exploration compares the effectiveness of both linear and non-linear regression techniques in the model building. Finally, we conduct a systematic measurement of the sensitivity of co-scheduling on the errors of the predictive behavior models. The results demonstrate the potential of the predictive models in guiding contention-aware co-scheduling.
Adaptive One-Way Functions and Applications
Authors: Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

We introduce new and general complexity theoretic hardness assumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than traditional cryptographic hardness assumptions; however, assuming their validity we can resolve a number of long-standing open problems in cryptography.
Towards Roundtrip Engineering - A Template-Based Reverse Engineering Approach
Authors: Manuel Bork, Leif Geiger, Christian Schneider, Albert Zündorf
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

Model driven development suggests to make models the main artifact in software development. To get executable models in most cases code generation to a "traditional" programming language like e.g. Java is used. To obtain customizable code generation template-based approaches are applied, commonly. So, to adapt the generated code to platform specific needs templates are modified by the user. After code generation, in real world application the generated code is often changed e.g. by refactorings. To keep the code and the model synchronous reverse engineering is needed. Many approaches use a Java parser and a mapping from the Java parse tree to the UML model for this task. This causes maintenance issues since every change to a template potentially results in a change to this parse tree - model mapping. To tackle this maintenance problem our solution does not use a common language parser but uses the templates as a grammar to parse the generated code, instead. This way changes to the templates are automatically taken into account in the reverse engineering step. Our approach has been implemented and tested in the Fujaba CASE tool as a part of the model and template-based code generator CodeGen2 [11].
Optimization of the Area under the ROC Curve
Authors: Cristiano Leite Castro, Antonio Padua Braga
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

In this paper, we propose a new binary classification algorithm (AUCtron), based on gradient descent learning, that directly optimizes AUC (Area Under the ROC Curve). We compare it with a linear classifier and with AUCsplit proposed. The AUCtron algorithm implicitly considers class prior probabilities in the decision criteria. Our results demonstrated that AUC is a sensitive enough metric that when used in small and imbalanced data sets may lead to a better separation.
Design Issues in Parallel Array Languages for Shared Memory
Authors: James Brodman, Basilio B. Fraguela, María J. Garzarán, David Padua
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

The Hierarchically Tiled Array (HTA) is a data type that facilitates the definition and manipulation of arrays partitioned into tiles. The data type allows to exploit those tiles to attain both locality and parallelism. Parallel programs written with HTAs are based in data parallelism, and provide the programmer with a single-threaded view of the execution. In our experience, HTAs help to develop parallel codes in a much more productive way than other parallel programming approaches. While we have worked extensively with HTAs in distributed memory environments, only recently have we began to consider their adaption to shared memory environments such as those found in multicore systems. In this paper we review the design issues, opportunities and challenges that this migration raises.
Cooperative Multisite Production Re-scheduling
Authors: Jaime Lloret, Jose P. Garcia-Sabater, Juan A. Marin-Garcia
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

One of the main issues in cooperative enterprise planning and scheduling is how to re-assign tasks without involving too many components of every enterprise and implying too many changes in the whole system. We propose a new system that is able to re-schedule tasks in cooperative multisite production automatically avoiding one of the main problems that have schedule programmers that are in charge of two or more cooperative enterprises. The system is based on making virtual groups of machines that perform the same tasks and establishes links between machines from different groups. We will describe the algorithm in detail and we will validate it using a case of study. Results show that our proposal gives better performance.
Robot Building for Preschoolers
Authors: Peta Wyeth, Gordon Wyeth
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

This paper describes Electronic Blocks, a new robot construction element designed to allow children as young as age three to build and program robotic structures. The Electronic Blocks encapsulate input, output and logic concepts in tangible elements that young children can use to create a wide variety of physical agents. The children are able to determine the behavior of these agents by the choice of blocks and the manner in which they are connected. The Electronic Blocks allow children without any knowledge of mechanical design or computer programming to create and control physically embodied robots. They facilitate the development of technological capability by enabling children to design, construct, explore and evaluate dynamic robotics systems. A study of four and five year-old children using the Electronic Blocks has demonstrated that the interface is well suited to young children. The complexity of the implementation is hidden from the children, leaving the children free to autonomously explore the functionality of the blocks. As a consequence, children are free to move their focus beyond the technology. Instead they are free to focus on the construction process, and to work on goals related to the creation of robotic behaviors and interactions. As a resource for robot building, the blocks have proved to be effective in encouraging children to create robot structures, allowing children to design and program robot behaviors.
Managing Model Conflicts in Distributed Development
Authors: Antonio Cicchetti, Davide Ruscio, Alfonso Pierantonio
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

The growing complexity of current software systems naturally conveyed their development toward incremental and distributed approaches to speed up the process. Several developers update the same artefact operating concurrent manipulations which need to be coherently combined. The interaction among those changes inevitably involves conflicts which must be detected and reconciled.This paper proposes a domain specific language able to define and manage conflicts caused by cooperative updates over the same model elements. The approach relies on a model-based representation of model differences and enables the specification and the detection of both syntactical and semantic conflicts.
Covering Minkowski sum boundary using points with applications
Authors: Jyh-Ming Lien
Venue: Computer Aided Geometric Design (2008)

Minkowski sum is a fundamental operation in many geometric applications, including robotic motion planning, penetration depth estimation, solid modeling, and virtual prototyping. However, due to its high computational complexity and several non-trivial implementation issues, computing the exact boundary of the Minkowski sum of two arbitrary polyhedra is generally a difficult task. In this work, we propose to represent the boundary of the Minkowski sum approximately using only points. Our results show that this point-based representation can be generated efficiently. An important feature of our method is its straightforward implementation and parallelization. We demonstrate that the point-based representation of the Minkowski sum boundary can indeed provide similar functionality as the mesh-based representations can. We show several applications in motion planning, penetration depth approximation and geometric modeling. An implementation of the proposed method can be obtained from our project webpage.
Optimization and reconstruction over graphs
Authors: Richard M. Karp
Venue:  (2007)

We study several instances of the following combinatorial optimization problem: Efficiently find a graph that satisfies, to the extent possible, a given set of constraints. The thesis begins with two NP-hard problems: The Minimum-Degree Minimum Spanning Tree (MBDST) problem is to find, given a graph, an MST of minimum degree. The Minimum Bounded-Degree Spanning Tree (MBDST) problem is to find, given a graph and an integer B, a minimum-cost tree in the set of spanning trees of degree at most B. We present the first polynomial-time constant-factor approximation algorithm for the MDMST problem, which uses the push-relabel framework developed by Goldberg [20] for the max-flow problem. It improves Fischer's local-search algorithm [14]. Via an analysis by K&ouml;nemann and Ravi [34], our algorithm implies the first polynomial-time constant-factor bi-criteria approximation algorithm for the MBDST problem. It also works for a new generalization of the MDMST problem. Other results include the first true MBDST approximation algorithms: a polynomial-time algorithm incurring no error in cost, and a quasi-polynomial-time algorithm, based on augmenting paths, that significantly improves the error in degree by finding a spanning tree of optimal cost and degree B+ Olognloglog n . Our cost-bounding method requires finding MSTs that meet both upper and lower degree bounds. The second part of the thesis considers the problem of reconstructing a directed graph, given the vertices and an oracle for the reachability relation. We show this reduces to the problem of sorting a partially ordered set (poset). Sorting algorithms obtain information about a poset by queries that compare two elements. We give an algorithm that sorts a width-w poset of size n and has query complexity O( wn + n log n), meeting the information-theoretic lower bound. We describe a variant of Mergesort that has query complexity O(wnlogn), matching the upper bound shown by Faigle and Tur&aacute;n [13], and total complexity O(w 2n log n). The exact total complexity of sorting remains unresolved. We also give upper and lower bounds for several related problems, including biding the minimal elements in a poset, which we show has query and total complexity &Theta;(wn), and its generalization, k-selection.
Research on Optimization Algorithm for Attribute Reduction of Decision System
Authors: Yang Wang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Attribute reduction is one of the central issue in the theoretical research of rough set, aiming at the NP-hard problem of acquiring minimal reduction and all reduction, an optimization algorithm is proposed to construct reduction tree based on discernibility matrix for acquiring attribute reduction. The discernibility set is acquired by improving discernibility matrix first, then the core and reduction candidate information are obtained, finally the minimal reduction and all reduction are sought fast and effectively by considering attribute frequency as heuristic information, and time cost of the algorithm is analyzed. The time complexity of the algorithm is lower than other presented algorithms.
Local Descriptor by Zernike Moments for Real-Time Keypoint Matching
Authors: Sun-Kyoo Hwang, Mark Billinghurst, Whoi-Yul Kim
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

This paper presents a real-time keypoint matching algorithm using a local descriptor derived by Zernike moments. From an input image, we find a set of key-points by using an existing corner detection algorithm. At each keypoint we extract a fixed size image patch and compute a local descriptor derived by Zernike moments. The proposed local descriptor is invariant to rotation and illumination changes. In order to speed up the computation of Zernike moments, we compute the Zernike basis functions in advance and store them in a set of lookup tables. The matching is performed with an Approximate Nearest Neighbor (ANN) method and refined by a RANSAC algorithm. In the experiments we confirmed that videos of frame size 320x240 with the scale, rotation, illumination and even 3D viewpoint changes are processed at 25~30Hz using the proposed method. Unlike existing keypoint matching algorithms, our approach also works in real-time for registering a reference image.
Information Amount Determination for Joint Problem of Filtering and Generalized Extrapolation of Stochastic Processes with Respect to the Set of Continuous and Discrete Memory Observations
Authors: Nikolas Dyomin, Irina Safronova, Svetlana Rozhkova
Venue: Informatica (2003)

This paper considers an information aspect of the problem of the joint filtering and generalized extrapolation, when the output of observation channels (data transmission) is the realizations set of the processes with continuous and discrete time, which depend on both the current and the past values of unobservable process (useful signal). The relations defining time evolution of Shannon information are obtained. The particular problems of the memory channels information efficiency and optimal transmission of stochastic processes, with applying the general results are considered.
Delineation of Valleys and Valley Floors
Authors: Ralph K. Straumann, Ross S. Purves
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

Methods to automatically derive landforms have typically focused on pixel-based, bottom-up approaches and most commonly on the derivation of to pographic eminences. In this paper we describe an object-based, top-down algo rithm to identify valley floors. The algorithm is based on a region growing ap proach, seeded by thalwegs with pixels added to the region according to a threshold gradient value. Since such landforms are fiat we compare the results of our algorithm for a particular valley with a number of textual sources de scribing that valley. In a further comparison, we computed a pixel-based six-fold morphometric classification for regions we classified as either being, or not being, valley floor. The regions classified as valley floor are dominated by pla nar slopes and channels, though the algorithm is robust enough to allow local convexities to be classified as within the valley floor. Future work will explore the delineation of valley sides, and thus complete valleys.
System-Level Performance Metrics for Multiprogram Workloads
Authors: Stijn Eyerman, Lieven Eeckhout
Venue: IEEE Micro (2008)

Assessing the performance of multiprogram workloads running on multithreaded hardware is difficult because it involves a balance between single-program performance and overall system performance. This article argues for developing multiprogram performance metrics in a top-down fashion starting from system-level objectives. The authors propose two performance metrics: average normalized turnaround time, a user-oriented metric, and system throughput, a system-oriented metric.
On the Role of Architectural Design Decisions in Software Product Line Engineering
Authors: Rafael Capilla, Muhammad Ali Babar
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

An increased attention to documenting architectural design decisions and their rationale has resulted in several approaches and prototype tools for capturing and managing architectural knowledge. However, most of them are focused on architecting single products and little attention has been paid to include design decisions in the context of product line architectures. This paper reports our work on analyzing the existing work on architectural design decisions for the specific needs of software product line engineering. We have studied two existing tools for managing design decisions to identify the changes required in these tools for supporting product line specific requirements. Based on this study, we report the extensions required in the data models of the tools and propose a unified data model to guide the tool development research for supporting explicitly the relationships between design decisions and variability models for software product line engineering.