ppxscal/embedding_network huggingface dataset:
Using MPI Communication Patterns to Guide Source Code Transformations
Authors: Robert Preissl, Martin Schulz, Dieter Kranzlmüller, Bronis R. Supinski, Daniel J. Quinlan
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Optimizing the performance of HPC software requires a high-level understanding of communication patterns as well as their relation to source code structures. We describe an algorithm to detect communication patterns in parallel traces and show how these patterns can guide static code analysis. First, we detect patterns that identify potential bottlenecks in MPI communication traces. Next, we associate the patterns with the corresponding nodes in an abstract syntaxtree using the ROSE compiler framework. Finally we perform static analysis on the annotated control flow and system dependence graphs to guide transformations such as code motion or the automatic introduction of MPI collectives.
Performance Evaluation of Fuzzy Ant Based Routing Method for Connectionless Networks
Authors: Seyed Javad Mirabedini, Mohammad Teshnehlab
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

This paper introduces a novel algorithm, called FuzzyAntNet inspired by swarm intelligence and optimized by fuzzy systems. FuzzyAntNet is a new routing algorithm which is constructed by the communication model observed in ant colonies, and enhanced with fuzzy systems. Two special characteristics of this method are scalability to network changes and capability to recognize the best route from source to destination with low delay, traffic and high bandwidth. Using Ants (or agents) in this method cause to avoid congestion in data packet transmission because Ants walk through paths and intermediate routers and gather information about their delay, congestion and in return, they update the current delay of each visited link and consequently they bring up to date the routing probabilities table for every traversed router. We compare FuzzyAntNet with other routing algorithms such as AntNet and Destination Sequenced Distance Vector (DSDV).
Key Management Based on Hierarchical Secret Sharing in Ad-Hoc Networks
Authors: Chuangui Ma, Rui Cheng
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

A hierarchical key sharing model in ad-hoc is presented and a key management protocol based on this model is designed. Nodes were divided into two parts in the network, server nodes and ordinary nodes. The shares hold by server nodes include more information than ordinary ones. Key reconstruction is implemented by collaboration of k nodes(including at least k 1 server nodes). Key share distribution, key reconstruction, key share refreshing and recovery are discussed in this paper. The presented protocols improve the availability and enhance the security compared with the existing partially and fully distributed schemes respectively.
A New Method for Sharpening Color Images Using Fuzzy Approach
Authors: M. Wilscy, Madhu S. Nair
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Image sharpening refers to any enhancement technique that highlights edges and fine details in an image. The conventional methods for sharpening the images has several drawbacks such as, complex and slow calculations, color loss, anisotropy effects etc. In this paper, a new fuzzy filter is proposed for sharpening the color images. The sharpening fuzzy filter consists of two sub-filters. The first sub-filter computes fuzzy distances between the central pixel and its neighbourhood for each color component. These distances determine the edge information present at each pixel. The purpose of the second sub-filter is to apply a sharpening parameter ¿ and a correction term ¿ to each pixel neighbourhood (3×3 window) thereby enhancing the edge information to get the sharpened image. The performance of the filter has been tested on various standard images and comparison is done both visually and quantitatively with other conventional sharpening filters.
Pro PerformancePoint Server 2007: Building Business Intelligence Solutions
Authors: Philo Janus
Venue: Pro (2008)

Pro PerformancePoint Server 2007 is Microsofts latest product in its line of business intelligence applications, a piece of software that gathers data from corporate databases and delivers it to an end user in a friendly, graphical fashion. PerformancePoint offers the next step in the digitization world. Businesses now have gigabytes upon terabytes of data in databases; theres a need to interpret the data and glean key business insights from it and PerformancePoint. Author Philo Janus walks you through the business process management and architecture of the PerformancePoint product before delving into developing a complete business intelligence solution, from start to finish. What youll learn Develop an endtoend business intelligence solution. Harness and massage data using SQL Server Integration Services, SQL Server Analysis Services, and SQL Server Reporting Services. Use ProClarity Analytics to get a better view on corporate performance data. Build a portal with key performance indicators and business scorecards using PerformancePoint, Excel Services, and Microsoft Office SharePoint Server 2007. Build out a complete business scorecard. Develop tools for business planning and forecasting. Who is this book for? If youre interested in harvesting data from your corporate databases, developing solutions to represent it visually to different audiences in your business, and slicing and dicing that information in a variety of different ways, PerformancePointand this bookare for you. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career.
Shape Discrimination in Active Touch: Effects of Exploratory Direction and Their Exploitation
Authors: Knut Drewing
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

The active control of exploratory movements is an integral part of active touch. In two experiments we investigated (and manipulated) the relationship between the haptic discrimination of small bumps and the direction of exploratory movements relative to the body. Shape discrimination performance systematically varied with the direction of stimulus exploration. Further, if they were rewarded for good perceptual performance and had the choice, participants displayed clear strategic preferences for certain exploratory directions. Chosen directions, at least on average, were accompanied by low discrimination thresholds. Overall, the findings emphasize the necessity to focus at the explorator's active contribution to haptic perception, and provide the first hints that exploratory behavior might be exploited to optimize haptic perception.
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
Authors: Arpita Patra, Ashish Choudhary, C. Pandu Rangan
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

In this paper, we design URMT and USMT protocols which are communication optimal in amortized sense and first of their kind.
A BYY Split-and-Merge EM Algorithm for Gaussian Mixture Learning
Authors: Lei Li, Jinwen Ma
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Gaussian mixture is a powerful statistic tool and has been widely used in the fields of information processing and data analysis. However, its model selection, i.e., the selection of number of Gaussians in the mixture, is still a difficult problem. Fortunately, the new established Bayesian Ying-Yang (BYY) harmony function becomes an efficient criterion for model selection on the Gaussian mixture modeling. In this paper, we propose a BYY split-and-merge EM algorithm for Gaussian mixture to maximize the BYY harmony function by splitting or merging the unsuited Gaussians in the estimated mixture obtained from the EM algorithm in each time dynamically. It is demonstrated well by the experiments that this BYY split-and-merge EM algorithm can make both model selection and parameter estimation efficiently for the Gaussian mixture modeling.
Performance Problem Determination Using Combined Dependency Analysis for Reliable System
Authors: Shunshan Piao, Jeongmin Park, Eunseok Lee
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

Performance problems such as Service Level Objective violations are determined by specific approach are particularly important since it can significantly improve system reliability. In this paper, we propose an improved performance problem determination mechanism by using combined dependency analysis. Using the proposed preprocessing in prior research, a compact model is created hierarchically. We use temporal inference which associates time with the created models and occurring symptoms, then post symptom into created model to provide probabilistic reasoning. The results of dependency reasoning are combined with the closeness evaluation between symptom and created model. Combined inference is applied according to the characteristic of environment knowledge. Using the improved combined approach enables us to extend problem localization in various situations and it provides much accurate and efficient problem determination technique for reliable system. Performance problem determination using the combined dependency analysis is illustrated to prove the availability and accuracy for improving system reliability.
Approximating the Interval Constrained Coloring Problem
Authors: Ernst Althaus, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, Julián Mestre
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

We consider the interval constrained coloring problem, which appears in the interpretation of experimental data in biochemistry. Monitoring hydrogen-deuterium exchange rates via mass spectroscopy experiments is a method used to obtain information about protein tertiary structure. The output of these experiments provides data about the exchange rate of residues in overlapping segments of the protein backbone. These segments must be re-assembled in order to obtain a global picture of the protein structure. The interval constrained coloring problem is the mathematical abstraction of this re-assembly process.The objective of the interval constrained coloring problem is to assign a color (exchange rate) to a set of integers (protein residues) such that a set of constraints is satisfied. Each constraint is made up of a closed interval (protein segment) and requirements on the number of elements that belong to each color class (exchange rates observed in the experiments).We show that the problem is NP-complete for arbitrary number of colors and we provide algorithms that given a feasible instance find a coloring that satisfies all the coloring requirements within ±1 of the prescribed value. In light of our first result, this is essentially the best one can hope for. Our approach is based on polyhedral theory and randomized rounding techniques. Furthermore, we develop a quasi-polynomial-time approximation scheme for a variant of our problem where we are asked to find a coloring satisfying as many fragments as possible.
A Case Study on the Impact of Refactoring on Quality and Productivity in an Agile Team
Authors: Raimund Moser, Pekka Abrahamsson, Witold Pedrycz, Alberto Sillitti, Giancarlo Succi
Venue: Balancing Agility and Formalism in Software Engineering: Second IFIP TC 2 Central and East European Conference on Software Engineering Techniques, CEE-SET 2007, Poznan, Poland, October 10-12, 2007, Revised Selected Papers (2008)

Refactoring is a hot and controversial issue. Supporters claim that it helps increasing the quality of the code, making it easier to understand, modify and maintain. Moreover, there are also claims that refactoring yields higher development productivity --- however, there is only limited empirical evidence of such assumption. A case study has been conducted to assess the impact of refactoring in a close-to industrial environment. Results indicate that refactoring not only increases aspects of software quality, but also improves productivity. Our findings are applicable to small teams working in similar, highly volatile domains (ours is application development for mobile devices). However, additional research is needed to ensure that this is indeed true and to generalize it to other contexts.
Implementation Issues of Early Application Identification
Authors: Laurent Bernaille, Renata Teixeira
Venue: Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet (2007)

The automatic identification of applications associated with network traffic is an essential step to apply quality-of-service policies and profile network usage. Our prior work proposes Early Application Identification, a method that accurately identifies the application after the first four packets of a TCP connection. However, an online implementation of this method faces two challenges: it needs to run at high speed and with limited memory. This paper addresses these issues. We propose an algorithm that implements Early Application Identification plus a number of computation and memory optimizations. An evaluation using traffic traces collected at our university network shows that this implementation can classify traffic at up to 6 Gbit/s. This speed is more than enough to classify traffic at current edge networks.
Opponent modelling in automated multi-issue negotiation using Bayesian learning
Authors: Koen Hindriks, Dmytro Tykhonov
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

The efficiency of automated multi-issue negotiation depends on the availability and quality of knowledge about an opponent. We present a generic framework based on Bayesian learning to learn an opponent model, i.e. the issue preferences as well as the issue priorities of an opponent. The algorithm proposed is able to effectively learn opponent preferences from bid exchanges by making some assumptions about the preference structure and rationality of the bidding process. The assumptions used are general and consist among others of assumptions about the independency of issue preferences and the topology of functions that are used to model such preferences. Additionally, a rationality assumption is introduced that assumes that agents use a concession-based strategy. It thus extends and generalizes previous work on learning in negotiation by introducing a technique to learn an opponent model for multi-issue negotiations. We present experimental results demonstrating the effectiveness of our approach and discuss an approximation algorithm to ensure scalability of the learning algorithm.
Reactive Rules on the Web
Authors: Bruno Berstel, Philippe Bonnard, François Bry, Michael Eckert, Paula-Lavinia Pătrânjan
Venue: Reasoning Web: Third International Summer School 2007, Dresden, Germany, September 3-7, 2007, Tutorial Lectures (2007)

Reactive rules are used for programming rule-based, reactive systems, which have the ability to detect events and respond to them automatically in a timely manner. Such systems are needed on the Web for bridging the gap between the existing, passive Web, where data sources can only be accessed to obtain information, and the dynamic Web, where data sources are enriched with reactive behavior. This paper presents two possible approaches to programming rule-based, reactive systems. They are based on different kinds of reactive rules, namely Event-Condition-Action rules and production rules. Concrete reactive languages of both kinds are used to exemplify these programming paradigms. Finally the similarities and differences between these two paradigms are studied.
Structure Restriction for Tracking Through Multiple Views and Occlusions
Authors: B. Martínez, A. Pérez, L. Ferraz, X. Binefa
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

The last advances on multiple kernel tracking consider the kernels as estimators of target features. The state space of the target is defined by the individual state space of these features.The aim of this work is to construct an algorithm robust against three dimensional rotations and partial occlusions. For this purpose, we take as the state space the two dimensional position of the features and an indicator of occlusions. We extract the three dimensional structure of the target from the first tracked frames and estimate the projection of this structure on each frame. By using this information, we are able to predict the position of a feature even when the kernel provides a wrong estimation, for example during an occlusion. The experimental results showed a good performance correcting errors and in presence of partial occlusions.
A tractable and expressive class of marginal contribution nets and its applications
Authors: Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficiently compute solution concepts assuming such representations. Marginal contribution nets (MC-nets), introduced by Ieong and Shoham, are one of the simplest and most influential representation schemes for coalitional games. MC-nets are a rule-based formalism, in which rules take the form pattern &rarr; value, where "pattern" is a Boolean condition over agents, and "value" is a numeric value. Ieong and Shoham showed that, for a class of what we will call "basic" MC-nets, where patterns are constrained to be a conjunction of literals, marginal contribution nets permit the easy computation of solution concepts such as the Shapley value. However, there are very natural classes of coalitional game that require an exponential number of such basic MC-net rules. We present read-once MC-nets, a new class of MC-nets that is provably more compact than basic MC-nets, while retaining the attractive computational properties of basic MC-nets. We show how the techniques we develop for read-once MC-nets can be applied to other domains, in particular, computing solution concepts in network flow games on series-parallel networks.
On Utilizing Qualitative Preferences in Web Service Composition: A CP-net Based Approach
Authors: Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Traditional approaches to Web service composition have focused on either generating compositions that match the structural and functional requirements of the user, or using quantitative optimization techniques over non-functional attributes. However, users preferences and trade-offs are often qualitative over non-functional attributes of the goal service like security, performance, cost. We propose to capture such requirements as qualitative preferences in addition to structural and functional constraints of the composite goal service. We analyze the theory of CP-nets as a formal model for representing and reasoning with qualitative preferences, and show how it can be used to improve the quality of the generated composition and scalability of the composition algorithm.
A Mumford-Shah model on lattice
Authors: Lu Yu, Qiao Wang, Lenan Wu, Jun Xie
Venue: Image and Vision Computing (2008)

Mumford-Shah piecewise smooth functional is a variational PDE model widely used in image segmentation and smoothing. An analogous discrete model which models image as an MRF has also been built. In this paper, we propose another discrete Mumford-Shah piecewise smooth model on lattice from a different perspective. We present a discrete objective functional, as well as the method to find the solution. Only two simple and deterministic optimization techniques, that is, derivation and greedy algorithm are used in the model to seek the solution. Compared with traditional continuous model, the model in this paper is much simpler and the approach is much easier and faster.
A Turning Point Analysis from Mobile Web 1.0 to Mobile Web 2.0: Lessons from Mobile Content Start-Up Company Growth and Downturn in Japan
Authors: Toshihiko Yamakami
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

The rapid growth of the mobile Internet in Japan leveraged new content providers specializing in the mobile Web. With the saturation of the Japanese mobile Internet, many content providers have faced downturns in the new landscape. Some exceptions provide hints for turning point analysis, and new directions for consumer-based mobile business. The author describes the current mobile Internet business model landscape in Japan with a perspective from mobile Web 1.0 to mobile Web 2.0. It also indicates differences from the PC Internet in terms of the portal growth model.
Distributed Multi-layered Network Management for NEC Using Multi-Agent Systems
Authors: Richard Vaughan, James Wise, Paul Huey, Michael Alcock, Jonathan Vaughan, Steven Shingler, Graham Atkins
Venue: Agents and Peer-to-Peer Computing: 5th International Workshop, AP2PC 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers (2006)

Within the military environment it is important that effective communication lines are maintained so that critical messages are able to reach their destinations and remain secure. Currently the bulk of the communications infrastructure is preplanned prior to mission start, and requires manual intervention when reality fails to match the plan. The communication systems need to be highly flexible, and adaptable in the face of (unforeseen) hostile and adverse conditions.We believe that this is where a combination of a distributed agent-based system and a reconfigurable peer-to-peer overlay network can be used help to provide a communication system that is robust and highly adaptable in the face of ever changing and adverse conditions with a minimal amount of planning and enable us to reduce the burden placed on dedicated staff in the field.
Robot Simulation of Sensory Integration Dysfunction in Autism with Dynamic Neural Fields Model
Authors: Winai Chonnaparamutt, Emilia I. Barakova
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This paper applies dynamic neural fields model [1,23,7] to multimodal interaction of sensory cues obtained from a mobile robot, and shows the impact of different temporal aspects of the integration to the precision of movements. We speculate that temporally uncoordinated sensory integration might be a reason for the poor motor skills of patients with autism. Accordingly, we make a simulation of orientation behavior and suggest that the results can be generalized for grasping and other movements that are performed in three dimensional space. Our experiments show that impact of temporal aspects of sensory integration on the precision of movement are concordant with behavioral studies of sensory integration dysfunction and of autism. Our simulation and the robot experiment may suggest ideas for understanding and training the motor skills of patients with sensory integration dysfunction, and autistic patients in particular, and are aimed to help design of games for behavioral training of autistic children.