ppxscal/embedding_network huggingface dataset:
Effective tag mechanisms for evolving cooperation
Authors: Matt Matlock, Sandip Sen
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Certain observable features (tags), shared by a group of similar agents, can be used to signal intentions and can be effectively used to infer unobservable properties. Such inference will enable the formulation of appropriate behaviors for interaction with those agents. Tags have been previously shown to be successful in social dilemma situations such as the prisoner's dilemma, and more recently have been shown to be applicable to other games by augmenting the standard tag mechanisms. We examine these more general tag mechanisms, and explain previously reported results by more thoroughly examining their fundamental designs. We show that these new tag mechanisms, along with some adjustments and augmentations, can be effective in enabling stable, socially optimal, and fair cooperative outcomes to emerge in general sum games. We focus, in particular, on general-sum conflicted games, where socially optimal outcomes do not necessarily yield the best results for individual agents. We argue that the improvements and understanding of these mechanisms expands the usability of tag mechanisms for facilitating coordination in multiagent systems. We argue that they allow agents to effectively reuse knowledge learned form interactions with one agent when interacting with other agents sharing the same features.
Automatic Generation of Biped Walk Behavior Using Genetic Algorithms
Authors: Hugo Picado, Marcos Gestal, Nuno Lau, Luis P. Reis, Ana M. Tomé
Venue: Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence (2009)

Controlling a biped robot with several degrees of freedom is a challenging task that takes the attention of several researchers in the fields of biology, physics, electronics, computer science and mechanics. For a humanoid robot to perform in complex environments, fast, stable and adaptive behaviors are required. This paper proposes a solution for automatic generation of a walking gait using genetic algorithms (GA). A method based on partial Fourier series was developed for joint trajectory planning. GAs were then used for offline generation of the parameters that define the gait. GAs proved to be a powerful method for automatic generation of humanoid behaviors resulting on a walk forward velocity of 0.51m/s which is a good result considering the results of the three best teams of RoboCup 3D simulation league for the same movement.
Max Energy Filtering Algorithm for Discrete Cumulative Resources
Authors: Petr Vilím
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasible. However often in practice there are more variables in play: variable durations of activities and variable resource capacity requirements. This paper presents a new algorithm for filtering maximum durations and maximum capacity requirements for discrete cumulative resources. It is also able to handle optional interval variables introduced in IBM ILOG CP Optimizer 2.0. Time complexity of the algorithm is ${\mathcal O}(n {\rm log} n)$. The algorithm is based on never published algorithm by Wim Nuijten and a on slightly modified e-feasibility checking algorithm by Armin Wolf and Gunnar Schrader. The later algorithm is also described in the paper.
Injecting software architectural constraints into legacy scientific applications
Authors: David Woollard, Chris Mattmann, Nenad Medvidovic
Venue: Proceedings of the 2009 ICSE Workshop on Software Engineering for Computational Science and Engineering (2009)

While software architectures have been shown to aid developers in maintenance, reuse, and evolution as well as many other software engineering tasks, there is little language-level support for these architectural concepts in scientific programming languages such as Fortran and C. Because many existing scientific codes are written in legacy languages, it is difficult to integrate them into architected software systems. By wrapping scientific codes in architecturally-aware interfaces, we are able to componentize legacy programs, integrating them into systems built with first-class architectural elements while meeting performance and throughput requirements of scientific codes.
wConnect: a facebook-based developmental learning community to support women in information technology
Authors: Mary Beth Rosson, John M. Carroll, Dejin Zhao, Timothy Paone
Venue: Proceedings of the fourth international conference on Communities and technologies (2009)

The under-representation of women in computer and infor-mation science (CIS) has created a crisis in availability of qualified CIS professionals and diversity of perspectives. Many interventions are being explored but these are primarily institutional programs like curriculum enhancements and mentoring. We describe wConnect, a developmental learning community that leverages social relations and social networking software to support women in CIS. This is a practical issue of some urgency that presents an opportunity for community informatics to impact the CIS profession. We report our progress and lessons learned, so that other organizations can initiate similar outreach activities.
Correlation between ROUGE and human evaluation of extractive meeting summaries
Authors: Feifan Liu, Yang Liu
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

Automatic summarization evaluation is critical to the development of summarization systems. While ROUGE has been shown to correlate well with human evaluation for content match in text summarization, there are many characteristics in multiparty meeting domain, which may pose potential problems to ROUGE. In this paper, we carefully examine how well the ROUGE scores correlate with human evaluation for extractive meeting summarization. Our experiments show that generally the correlation is rather low, but a significantly better correlation can be obtained by accounting for several unique meeting characteristics, such as disfluencies and speaker information, especially when evaluating system-generated summaries.
MPEG-7 Content-Based Descriptor Audio Applications
Authors: Kevin Curran, Elaine Smyth, Paul MC Kevitt, Tom Lunney
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

The purpose of this review paper is to provide a brief overview of the MPEG-7 standard with particular focus on part four, Audio. A summary of existing applications which utilise the MPEG-7 audio descriptors demonstrates that no existing application aims to provide standardised structural descriptions of musical audio for ultimate use within other systems.
Monte-Carlo simulation balancing
Authors: David Silver, Gerald Tesauro
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation policy, so that an accurate spread of simulation outcomes is maintained, rather than optimising the direct strength of the simulation policy. We develop two algorithms for balancing a simulation policy by gradient descent. The first algorithm optimises the balance of complete simulations, using a policy gradient algorithm; whereas the second algorithm optimises the balance over every two steps of simulation. We compare our algorithms to reinforcement learning and supervised learning algorithms for maximising the strength of the simulation policy. We test each algorithm in the domain of 5 x 5 and 6 x 6 Computer Go, using a softmax policy that is parameterised by weights for a hundred simple patterns. When used in a simple Monte-Carlo search, the policies learnt by simulation balancing achieved significantly better performance, with half the mean squared error of a uniform random policy, and similar overall performance to a sophisticated Go engine.
Control strategies and perception effects in co-located and large workspace dynamical encountered haptics
Authors: Paolo Tripicchio, Emanuele Ruffaldi, Carlo Alberto Avizzano, Massimo Bergamasco
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

The present work focuses on perceptual control of haptic manipulation during high frequency interaction with mobile objects. In particular in this work we focused on the analysis of the control and perceptual issues in the throwing and catching in juggling. A training multimodal system that exploits the concepts of co-located visuo-haptic feedback and encountered interfaces was implemented. Using such a system the user juggles with a number of virtual balls that are in contact with him from catch to throw. The control design of the system has been supported by a psychometric validation of the catch contact.
Pedagogical agent research and development: Next steps and future possibilities
Authors: Amy L. Baylor, Ron Cole, Arthur Graesser, W. Lewis Johnson
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

The purpose of this interdisciplinary panel of leading pedagogical agent researchers is to discuss issues regarding implementation of agents as “simulated humans,” pedagogical agent affordances/constraints, and future research and development possibilities.
Generators of the ideal of an algebraic space curve
Authors: E. Fortuna, P. Gianni, B. Trager
Venue: Journal of Symbolic Computation (2009)

In this paper we show that the ideal of any algebraic curve in affine 3-space whose Jacobian matrix has rank at least 1 at every singular point of the curve can be generated by three polynomials and we give constructive procedures to compute such generators.
Analyzing user's book-loan behaviors in Peking university library from social network perspective
Authors: Fei Yan, Ming Zhang, Tao Sun, Yang Lu, Naiyue Zhang, Long Xiao
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

In a university library, students from different background are connected by co-borrowing behaviors which form a knowledge sharing network. This poster presents a novel idea to study the users' book-loan behavior patterns (knowledge sharing patterns) from the social network perspective which enable us to understand the patterns in both the macro-level and micro-level analysis.
Model optimisation for complex systems using fuzzy networks theory
Authors: Nedyalko Petrov, Alexander Gegov
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

This paper presents an application of the novel theory of fuzzy networks for optimising models of systems characterised by uncertainty, non-linearity, modular structure and interactions. The application of the theory is demonstrated for retail price models in the context of converting a multiple rule base fuzzy system (MRBFS) into an equivalent single rule base fuzzy system (SRBFS) by linguistic composition of the individual rule bases. During the conversion process, the transparency of the MRBFS is fully preserved while its accuracy is improved to a level comparable with the accuracy of the SRBFS. This improvement is achieved by increasing the number of linguistic terms for the intermediate variable connecting the individual rule bases.
Author index
Authors: Sagar Chaki, Andres Diaz-Pace, David Garlan, Arie Gurfinkel, Ipek Ozkaya
Venue: Proceedings of the 2009 ICSE Workshop on Modeling in Software Engineering (2009)

Architecture evolution, a key aspect of software evolution, is typically done in an ad hoc manner, guided only by the competence of the architect performing it. This process lacks the rigor of an engineering discipline. In this paper, we argue that architecture evolution must be engineered — based on rational decisions that are supported by formal models and objective analyses. We believe that evolutions of a restricted form — close-ended evolution, where the starting and ending design points are known a priori — are amenable to being engineered. We discuss some of the key challenges in engineering close-ended evolution. We present a conceptual framework in which an architecture evolutionary trajectory is modeled as a sequence of steps, each captured by an operator. The goal of our framework is to support exploration and objective evaluation of different evolutionary trajectories. We conclude with open research questions in developing this framework.
Evolva: A Comprehensive Approach to Ontology Evolution
Authors: Fouad Zablith
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

Ontology evolution is increasingly gaining momentum in the area of Semantic Web research. Current approaches target the evolution in terms of either content, or change management, without covering both aspects in the same framework. Moreover, they are slowed down as they heavily rely on user input. We tackle the aforementioned issues by proposing Evolva, a comprehensive ontology evolution framework, which handles a complete ontology evolution cycle, and makes use of background knowledge for decreasing user input.
Cut It Out!
Authors: Isabel Beichl, Francis Sullivan
Venue: Computing in Science and Engineering (2009)

This issue marks the return of the Computing Prescriptions department; here, the authors describe an algorithm for finding minimum cutsets in connected graphs.
Notes on Factor Graphs
Authors: Francesco Palmieri
Venue: Proceeding of the 2009 conference on New Directions in Neural Networks: 18th Italian Workshop on Neural Networks: WIRN 2008 (2009)

Many applications that involve inference and learning in signal processing, communication and artificial intelligence can be cast into a graph framework. Factor graphs are a type of network that can be studied and solved by propagating belief messages with the sum/product algorithm. In this paper we provide explicit matrix formulas for inference and learning in finite alphabet Forney-style factor graphs, with the precise intent of allowing rapid prototyping of arbitrary topologies in standard software like MATLAB.
Wealth adjustment using a synergy between communication, cooperation, and one-fifth of wealth variables in an artificial society
Authors: Arash Rahman, Saeed Setayeshi, Mojtaba Shamsaei Zafarghandi
Venue: AI Society (2009)

Wealth distribution based on classic sugarscape model leads to a population increase and the Gini coefficient decrease when cooperation and communication parameters are taken into account. In another study, this model was developed by implying a receipt of one-fifth of the assets of the population and derived utilization for poor people. The results showed a relation between mortality decrease, population increase, and Gini coefficient decrease (equality increase). In a synergic process, the wealth adjustment based on sugarscape model underwent some experiments by implying communication and cooperation, and the mechanism of receiving and utilizing the assets. The results show that the population increase and the Gini coefficient decrease play an important role in wealth adjustment.
Situvis: A Visual Tool for Modeling a User's Behaviour Patterns in a Pervasive Environment
Authors: Adrian K. Clear, Ross Shannon, Thomas Holland, Aaron Quigley, Simon Dobson, Paddy Nixon
Venue: Proceedings of the 7th International Conference on Pervasive Computing (2009)

One of the key challenges faced when developing context-aware pervasive systems is to capture the set of inputs that we want a system to adapt to. Arbitrarily specifying ranges of sensor values to respond to will lead to incompleteness of the specification, and may also result in conflicts, when multiple incompatible adaptations may be triggered by a single user action. We posit that the ideal approach combines the use of past traces of real, annotated context data with the ability for a system designer or user to go in and interactively modify the specification of the set of inputs a particular adaptation should be responsive to. We introduce Situvis, an interactive visualisation tool we have developed which assists users and developers of context-aware pervasive systems by visually representing the conditions that need to be present for a situation to be triggered in terms of the real-world context that is being recorded, and allows the user to visually inspect these properties, evaluate their correctness, and change them as required. This tool provides the means to understand the scope of any adaptation defined in the system, and intuitively resolve conflicts inherent in the specification.
A Novel Nonparametric Regression Ensemble for Rainfall Forecasting Using Particle Swarm Optimization Technique Coupled with Artificial Neural Network
Authors: Jiansheng Wu, Enhong Chen
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

In this study, we propose a novel nonparametric regression (NR) ensemble rainfall forecasting model integrating generalized particle swarm optimization (PSO) with artificial neural network (ANN). First of all, the PSO algorithm is used to evolve neural network architecture and connection weights. The evolved neural network architecture and connection weights are input into a new neural network.The new neural network is trained using back-propagation (BP) algorithm, generating different individual neural network. Then, the principal component analysis (PCA) technology is adopted to extract ensemble members. Finally, the NR is used for nonlinear ensemble model. Empirical results obtained reveal that the prediction by using the NR ensemble model is generally better than those obtained using other models presented in this study in terms of the same evaluation measurements. For illustration and testing reveal that the NR ensemble model proposed can be used as an alternative forecasting tool for a Meteorological application in achieving greater forecasting accuracy and improving prediction quality further.
Operational Termination of Membership Equational Programs: the Order-Sorted Way
Authors: Salvador Lucas, José Meseguer
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Our main goal is automating termination proofs for programs in rewriting-based languages with features such as: (i) expressive type structures, (ii) conditional rules, (iii) matching modulo axioms, and (iv) context-sensitive rewriting. Specifically, we present a new operational termination method for membership equational programs with features (i)-(iv) that can be applied to programs in membership equational logic (MEL). The method first transforms a MEL program into a simpler, yet semantically equivalent, conditional order-sorted (OS) program. Subsequent trasformations make the OS-program unconditional, and, finally, unsorted. In particular, we extend and generalize to this richer setting an order-sorted termination technique for unconditional OS programs proposed by Olveczky and Lysne. An important advantage of our method is that it minimizes the use of conditional rules and produces simpler transformed programs whose termination is often easier to prove automatically.
Equational Abstractions for Reducing the State Space of Rewrite Theories
Authors: Lars Helge Haß, Thomas Noll
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The combinatorial explosion of state spaces is the biggest problem in applying model checking methods to concurrent systems. In this paper we present a new state-space reduction technique that is tailored to system specifications in Rewriting Logic, a unified semantic framework for concurrency which is based on conditional term rewriting modulo equational theories. The idea is to hide ''unimportant'' details of the system's behavior (such as internal computations) in the equations, and to represent only ''interesting'' state changes (such as communication operations) by explicit transitions. We show how this optimization can be implemented by transforming the Rewriting Logic specification, avoiding the construction of the full state space. Moreover we establish the correctness of our technique by proving that the original and the reduced system are weakly bisimilar, and demonstrate its usability by applying it to the concurrent functional programming language Erlang.
The IT Girl's Guide to Blogging with Moxie
Authors: Joelle Reeder, Katherine Scoleri
Venue:  (2007)

Want to break into blogging but dont know where to start? Dynamic duo Joelle Reeder and Katherine Scoleri of The Moxie GirlsTM show you how to start your first blog, polish your prose, get involved in blogging communities, make sense of RSS feeds, podcasts, photos and more all with fun, humor and attitude! Inside you will find the need-to-know info to get your blog noticed: How to choose the right blogging platform or content management tool, select a web host, dress up your blog, manage blog content and keep your privates private! When you are ready for more, The Moxie Girls will treat you to insider dish on blog etiquette, analyzing blog traffic, blogging for business, creating podcasts and adding bling to your blog with plugins, add-ons and more. Throw in the refreshing cocktails, beauty tips and gossip with the Girls at the end of each chapter and youll be Blogging with Moxie in no time. So, what are you waiting for? The IT Girls Guide to Blogging With Moxie is packed with the content you need wrapped in casual, engaging dialog and a cheeky, bite-sized format. Bargain-blogging with tools such as WordPress, TypePad, and Vox Choosing a content management system like Expression Engine or Movable Type Managing blog content, using tags and moderating comments Selecting a professional designer and choosing from off-the-rack templates An introduction to podcasting and videocasting Finding, joining and managing blog communities Protecting your online identity Using a blog to better your business
Absorption and scattering properties of water body in Taihu Lake, China: backscattering
Authors: Ronghua Ma, Delu Pan, Hongtao Duan, Qingjun Song
Venue: International Journal of Remote Sensing (2009)

The HydroScat-6 spectral backscattering sensor was used to measure in situ the backscattering coefficients at six wavelengths (442, 488, 532, 589, 676, 852 nm) at 67 samples from all over Taihu Lake, China. The measured raw data were corrected with the tested backscattering probabilities of 0.015, 0.019, 0.030 and 0.050. Combined with simulated data by the optimization algorithm, it shows that the backscattering probability (a ratio between backscattering coefficient and scattering coefficient of suspended particulate matter), with a mean of 0.041 (SD 0.030), is wavelength-dependent and not a constant, and may be expressed as a significant quadratic function of wavelength. The value of backscattering probability can be used to perform the sigma correction for the measured raw data more accurately. Thus, the backscattering may be uncovered as clearly and precisely as possible.