ppxscal/embedding_network huggingface dataset:
Evolutionary Design of a Fuzzy Rule Base for Solving the Goal-Shooting Problem in the RoboCup 3D Soccer Simulation League
Authors: Mohammad Jafar Abdi, Morteza Analoui, Bardia Aghabeigi, Ehsan Rafiee, Seyyed Mohammad Tabatabaee
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Most of the problems in the RoboCup soccer domain suffer from the noisy perceptions, noisy actions, and continuous state space. To cope with these problems, using Fuzzy logic can be a proper choice, due to its capabilities of inferring and approximate reasoning under uncertainty. However, designing the entire rule base of a Fuzzy rule base system (FRBS) by an expert is a boring and time consuming task and sometimes the performance of the designed Fuzzy system is far from the optimum, especially in cases that the available knowledge of the system is not enough. In this paper, a rule learning method based on the iterative rule learning (IRL) approach is proposed to generate the entire rule base of an FRBS with the help of genetic algorithms (GAs). The advantage of our proposed method compared to similar approaches in the literature is that our algorithm does not need any training set, which is difficult to collect in many cases; cases like most of the problems existing in the RoboCup soccer domain. As a test case, the goal-shooting problem in the RoboCup 3D soccer simulation league is chosen to be solved using this approach. Simulation tests reveal that with applying the rule learning method proposed in this paper on the goal-shooting problem, not only can a rule base with good performance in goal-shooting skill be obtained, but also the number of rules in the rule base can be decreased by using the general rules in constructing the rule base.
Rational Bidding Using Reinforcement Learning
Authors: Nikolay Borissov, Arun Anandasivam, Niklas Wirström, Dirk Neumann
Venue: Proceedings of the 5th international workshop on Grid Economics and Business Models (2008)

The application of autonomous agents by the provisioning and usage of computational resources is an attractive research field. Various methods and technologies in the area of artificial intelligence, statistics and economics are playing together to achieve i) autonomic resource provisioning and usage of computational resources, to invent ii) competitive bidding strategies for widely used market mechanisms and to iii) incentivize consumers and providers to use such market-based systems.The contributions of the paper are threefold. First, we present a framework for supporting consumers and providers in technical and economic preference elicitation and the generation of bids. Secondly, we introduce a consumer-side reinforcement learning bidding strategy which enables rational behavior by the generation and selection of bids. Thirdly, we evaluate and compare this bidding strategy against a truth-telling bidding strategy for two kinds of market mechanisms --- one centralized and one decentralized.
COTraSE: Connection Oriented Traceback in Switched Ethernet
Authors: Marios S. Andreou, Aad van Moorsel
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Layer 2 traceback is an important component of end-to end packet traceback. Whilst IP traceback identifies the origin network, L2 traceback extends the process to provide a more fine-grained result. Other known proposals have exposed the difficulties of L2 traceback in switched ethernet. We build on our earlier work and improve in a number of dimensions. Memory requirements are decreased by maintaining 'connection records' rather than logging all frames. Our switchport resolution algorithm provides error detection by correlating MAC address table values from two adjacent switches. Our solution also takes stock of potential transformations to packet data as this leaves the local network. We have implemented the core algorithm and used data from available WAN traces to demonstrate the potential memory efficiency of our approach.
Gem #21: how to parse an XML text
Authors: Emmanuel Briot
Venue: ACM SIGAda Ada Letters (2008)

Ada Gem #21 -- The World Wide Web Consortium (W3C) develops various specifications around the XML file format. In particular, it specifies various APIs to load, process and write an XML file. Although these APIs are not specified for Ada, XML/Ada tries to conform as closely as possible to them. This gem describes how to use XML/Ada to parse an XML file.
On the Interplay of Aspects and Dynamic Reconfiguration in a Specification-to-Deployment Environment
Authors: Thais Batista, Antônio T. Gomes, Geoff Coulson, Christina Chavez, Alessandro Garcia
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

In this paper, we propose the application of concepts from aspect-oriented software development to facilitate modular treatment of dynamic reconfiguration descriptions in specification-to-deployment environments. Our strategy differs from earlier work in the area by blending aspects and architecture abstractions simply and seamlessly through a special kind of connector --called an aspectual connector -- that encapsulates reconfiguration interactions. More specifically, we propose an aspect-oriented specification-to-deployment environment, called AO-Plastik, that uses our AspectualAcme ADL to specify dynamic reconfiguration by means of aspectual connectors, and maps these specifications onto a reflective component runtime platform.
Initial value problem for fuzzy differential equations under dissipative conditions
Authors: Vasile Lupulescu
Venue: Information Sciences: an International Journal (2008)

A new concept of inner product on the fuzzy space (E^n,D) is introduced, studied and used to prove several theorems stating the existence, uniqueness and boundedness of solutions of fuzzy differential equations. A stability result is also proved in the same context.
Route Cache Based Load Balancing Scheme for Mobile Ad-Hoc Networks
Authors: Young-Duk Kim, Jin-Wook Kim, Won-Seok Kang, Dong-Ha Lee
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

Recently, many on demand routing protocols are suggested to support mobile ad hoc network (MANET) which is self-organized network. The most represented protocols are on-demand routing schemes such as DSR and AODV. These protocols set up routing paths by flooding Route Request (RREQ) packets during route discovery procedure and receive Route Reply (RREP) packets from destination nodes. In order to reduce route discovery latency, every node may use the previous routing information in its route cache and reply RREP instead of the destination. Although the route cache mechanism is simple and efficient approach to enhance the performance, it may result in unnecessary latency when it uses incorrect cache information. In addition, a certain node located around source can be easily congested because it replies every RREQ with RREP and all data flows are concentrated on this node. In this paper, we suggest a dynamic cache monitoring scheme and suppress RREP on heavily congested node to achieve load balancing. To do this, we have defined appropriate queue threshold values and parameters for congestion resolution. We also propose a solution for RREP storm problem which is another side effect of the route cache. Finally throughout the simulation, we have illustrated that proposed scheme shows better performance than the standard algorithm in heavily congested environments.
Re-Engineering a Reverse Engineering Portal to a Distributed SOA
Authors: William M. Mongan, Maxim Shevertalov, Spiros Mancoridis
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

REportal is an existing web-based reverse engineering portal web site that provides access to a suite of reverse engineering and program comprehension tools via a web browser. This abstraction was intended to allow ease of system maintenance by adding and upgrading tools without involving the end user. However, the software tools and server technologies used became deprecated so quickly that it was not possible to take full advantage of the architectural vision. Using a service-oriented architecture, we abstract the process flow of the system from the underlying tools, enabling a wizard-style method of adding services to the system, and facilitating ore "hands-off" maintenance. In this paper, we describe the challenges and benefits of this architectural migration.
Comparison between Physical Image Quality as Measured by a Newly Developed Phantom Dedicated for Digital Mammography QC and That by European Guidelines Methods
Authors: Tetsuro Kusunoki, Masahiro Tagi, Kenji Yosikawa, Hiroshi Arai, Nachiko Uchiyama, Chieko Nagashima, Hiroyuki Kobayashi
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

A quality control system for digital mammography consisting of a phantom for daily constancy test and software for image analysis and data management has been developed. The purpose of this study was to verify the measurement accuracy of the phantom and software, which was carried out by comparison of the result obtained from the method in accordance with European Guidelines for the following image characteristics; 1) Contrast to Noise Ratio (CNR) 2) Geometric distortion 3) Modulation Transfer Function (MTF) 4) Homogeneity 5) Missed tissue at chest wall side and 6) Threshold contrast visibility. In CNR and MTF, relative differences of 10% and 20% respectively were confirmed though, they were due to the difference in samples used for each measurement and in measurement position, and then those differences were identified as being no problem for the constancy test.
Insights from a freeway car-to-car real-world experiment
Authors: Karim Seada
Venue: Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization (2008)

Car-to-car communication is a promising technology for solving several real-life problems on the road. There is a growing research interest in this technology as one of the practical and challenging applications for wireless communication and multi-hop networks. Although there has been a decent amount of research in this topic recently, there is a lack of real-world experimental studies to augment this work. In this paper, we present results from a real-world experiment consisting of 10 cars making loops in a 5-mile segment of a freeway. Each car has a WiFi personal device communicating and forming multi-hop networks with the rest of the devices. By collecting measurements of connectivity and locations from these devices, and analyzing these measurements, we obtain some interesting observations about this environment. For instance, most connections forming in the freeway were between 15 and 30 seconds with a median of 23 seconds. The average distance at connections and disconnections was 133 meters and 500 meters respectively. The distance and relative velocity were observed to have a significant effect on connection forming and duration. Most connections formed were between cars in the opposite directions of the freeway rather than between those going in the same direction. We believe these results are indicative and useful for wireless protocol and application designers.
Directory-Based Metadata Optimizations for Small Files in PVFS
Authors: Michael Kuhn, Julian Kunkel, Thomas Ludwig
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Modern file systems maintain extensive metadata about stored files. While this usually is useful, there are situations when the additional overhead of such a design becomes a problem in terms of performance. This is especially true for parallel and cluster file systems, because due to their design every metadata operation is even more expensive.In this paper several changes made to the parallel cluster file system PVFS are presented. The changes are targeted at the optimization of workloads with large numbers of small files. To improve metadata performance, PVFS was modified such that unnecessary metadata is not managed anymore.Several tests with a large quantity of files were done to measure the benefits of these changes. The tests have shown that common file system operations can be sped up by a factor of two even with relatively few changes.
An Algorithm to Find Overlapping Community Structure in Networks
Authors: Steve Gregory
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint communities, but in many real-world networks communities overlap to some extent. We present a new algorithm for discovering overlapping communities in networks, by extending Girvan and Newman's well-known algorithm based on the betweenness centrality measure. Like the original algorithm, ours performs hierarchical clustering -- partitioning a network into any desired number of clusters -- but allows them to overlap. Experiments confirm good performance on randomly generated networks based on a known overlapping community structure, and interesting results have also been obtained on a range of real-world networks.
Models and Testing --- A Recipe for Improved Effectiveness?
Authors: Paul Baker
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

In an ongoing effort to reduce development costs in spite of increasing system complexity, Motorola has been a long-time adopter of Model-Driven Engineering practices. The foundation of this approach is the creation of rigorous models throughout the development process, thereby, enabling the introduction of automation into the development life cycle and supporting frameworks.
Exploring the Application of Fuzzy Logic and Data Fusion Mechanisms in QAS
Authors: Daniel Ortiz-Arroyo, Hans Ulrich Christensen
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In this paper we explore the application of fuzzy logic and data fusion techniques to improve the performance of passage retrieval in open domain Question Answering Systems (QAS). Our experiments show that our proposed mechanisms provide significant performance improvements when compared to other similar systems.
Improved text entry for mobile devices: alternate keypad designs and novel predictive disambiguation methods
Authors: Peter Tarasewich
Venue:  (2007)

Despite the ever-increasing popularity of mobile devices, text entry on such devices is becoming more of a challenge. Problems primarily lie with shrinking device sizes, which can greatly limit available display space, as well as require unique input modalities and interaction techniques. In attempting to resolve this issue, researchers have found that dictionary-based predictive disambiguation text entry methods are fairly efficient for text entry on devices such as mobile phones that use keypads instead of full keyboards. This type of text entry method "guesses" the word that a user desires by matching their sequence of keystrokes against feasible entries saved in a dictionary. However, word ambiguity, limited dictionary sizes, and large learning curves still prevent this method from being more widely adopted in many situations, and on more mobile devices. Innovative solutions to these problems, focusing on both physical keypad designs and predictive disambiguation methods, are introduced in this dissertation work. The first part of this dissertation describes a set of keypad designs which are optimized under the constraint of keeping characters in alphabetical order across keys. Designs were found that have performance close to that of unconstrained designs, while maintaining better novice usability. The second part proposes a novel predictive disambiguation method which utilizes not only word frequency information, as do most existing dictionary-based predictive disambiguation methods, but also semantic and syntactical text information to help disambiguate the user's desired words. Simulations and an empirical user study have shown improvements in text entry speed of up to 9.6% and reductions in the number of user errors of up to 21.2%. Furthermore, this dissertation presents a new error metric that is capable of revealing more information about user performance during experiments involving text entry methods. In summary, this dissertation work focused on creating and validating improved methods for text entry on mobile devices.
An On-Line Semantic Visualization for Heterogeneous Product Information of the Virtual Organization
Authors: Chengfeng Jian
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

The Semantic annotation is becoming increasingly important for the on-line semantic reconstruction of the heterogeneous product information in the virtual organization (VO) with the semantic grid. Aim at the uniform knowledge representation on the heterogeneous product information of VO, the XOEM+OWL is put forward. And then the XOEM+OWL based production semantic annotation visualization, named a Linked-Entity Visualization (LEV), is introduced. It uses AJAX/SVG to realize the visualization in the display space of the browser. The implementation of this system is shown at last.
Component Selection to Optimize Distance Function Learning in Complex Scientific Data Sets
Authors: Aparna Varde, Stephen Bique, Elke Rundensteiner, David Brown, Jianyu Liang, Richard Sisson, Ehsan Sheybani, Brian Sayre
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Analyzing complex scientific data, e.g., graphs and images, often requires comparison of features: regions on graphs, visual aspects of images and related metadata, some features being relatively more important. The notion of similarity for comparison is typically distance between data objects which could be expressed as distance between features. We refer to distance based on each feature as a component. Weights of components representing relative importance of features could be learned using distance function learning algorithms. However, it is seldom known which components optimize learning, given criteria such as accuracy, efficiency and simplicity. This is the problem we address. We propose and theoretically compare four component selection approaches: Maximal Path Traversal, Minimal Path Traversal, Maximal Path Traversal with Pruning and Minimal Path Traversal with Pruning. Experimental evaluation is conducted using real data from Materials Science, Nanotechnology and Bioinformatics. A trademarked software tool is developed as a highlight of this work.
Teaching Software Development Using Extreme Programming
Authors: Görel Hedin, Lars Bendix, Boris Magnusson
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

Software development is a complex area and extensive practice and reflection is required in order to obtain a good understanding of the different tasks involved in going from idea to deliverable software. To help in providing this understanding, we have developed a team programming course based on extreme programming and a coaching course. We discuss how these courses affect the curriculum, the design of the courses, and our experience from running them for four years, involving over 100 students per year. We also discuss how we have used the extreme programming approach to support the learning cycle through the use of iterative learning, peer learning and a fixed-time budget.
A Novel Modeling Method for Cooperative Multi-robot Systems Using Fuzzy Timed Agent Based Petri Nets
Authors: Hua Xu, Peifa Jia
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

This paper proposes a cooperative multi-robot system (CMRS) modeling method called fuzzy timed agent based Petri nets (FTAPN), which has been extended from fuzzy timed object-oriented Petri net (FTOPN). The proposed FTAPN can be used to model and illustrate both the structural and dynamic aspects of CMRS. Supervised learning is supported in FTAPN. As a special type of high-level object, agent is introduced, which is used as a common modeling object in FTAPN models. The proposed FTAPN can not only be used to model CMRS and represent system aging effect, but also be refined into the object-oriented implementation easily. At the same time, it can also be regarded as a conceptual and practical artificial intelligence (AI) tool for multi-agent system (MAS) into the mainstream practice of software development.
The role of MPI in development time: a case study
Authors: Lorin Hochstein, Forrest Shull, Lynn B. Reid
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

There is widespread belief in the computer science community that MPI is a difficult and time-intensive approach to developing parallel software. Nevertheless, MPI remains the dominant programming model for HPC systems, and many projects have made effective use of it. It remains unknown how much impact the use of MPI truly has on the productivity of computational scientists. In this paper, we examine a mature, ongoing HPC project, the Flash Center at the University of Chicago, to understand how MPI is used and to estimate the time that programmers spend on MPI-related issues during development. Our analysis is based on an examination of the source code, version control history, and regression testing history of the software. Based on our study, we estimate that about 20% of the development effort is related to MPI. This implies a maximum productivity improvement of 25% for switching to an alternate parallel programming model.
The GA-Based Bayes-Optimal Feature Extraction Procedure Applied to the Supervised Pattern Recognition
Authors: Marek Kurzynski, Aleksander Rewak
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The paper deals with the extraction of features for statistical pattern recognition. Bayes probability of correct classification is adopted as the extraction criterion. The problem with complete probabilistic information is discussed and next the Bayes-optimal feature extraction procedure for the supervised classfication is presented in detail. As method of solution of optimal feature extraction a genetic algorithm is proposed. Several computer experiments for wide spectrum of cases were made and their results demonstrating capability of proposed approach to solve feature extraction problem are presented.
A New Alternative Blind Super-Resolution Algorithm Based on Motion Estimation
Authors: Xiao-hua Yuan, Shu-qin Li, Chun-ping Liu, Jing Li
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

In this paper, we propose a new alternative blind SR to estimate motion, blurring, and higher resolution (HR) image alternatively and iteratively in case the three are all unknown. The related ternary optimization is first divided into two alternate and iterative optimizations, in which the unitary one is about motion estimation and the dualistic one is about blurring and HR image estimation, and the dualistic one is divided into two alternate and iterative unitary optimizations again. Then in the related minimization functional, Total Variant regularization is used to conserve local discontinuous of the estimation, Half-quadratic regularization is used to solve the thus induced non-quadratic problem, and additive operator split is used to simplify the related computation. Test results at last show the validity of the proposed SR.