ppxscal/embedding_network huggingface dataset:
Resource limitations, transmission costs and critical thresholds in scale-free networks
Authors: Chung-Yuan Huang, Chuen-Tsai Sun, Chia-Ying Cheng, Yu-Shiuan Tsai
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Whether or not a critical threshold exists when epidemic diseases are spread in complex networks is a problem attracting attention from researchers in several disciplines. In 2001, Pastor-Satorras and Vespignani used a computational simulations approach to show that epidemic diseases which spread through scale-free social networks do not have positive critical thresholds. In other words, even if a disease has almost no chance of being transmitted from one person to another, it can still spread throughout a scale-free network. However, they ignored two key factors that have a large impact on epidemic dynamics: economic resource limitations and transmission costs. Every infection event entails tangible or intangible costs in terms of time, energy, or money to the carrier, recipient, or both. Here we apply an agent-based modeling and network-oriented computer simulation approach to analyze the influences of resource limitations and transmission costs on epidemic dynamics and critical thresholds in scale-free networks. Our results indicate that when those resources and costs are taken into consideration, the epidemic dynamics of scale-free networks are very similar to those of homogeneous networks, including the presence of significant critical thresholds. It is hoped that our data will help epidemiologists, public health professionals, and computer scientists working with core questions of epidemic diseases, estimates of epidemic dynamics and spreading, and effective public health policies and immunization strategies.
Entropy Based Diversity Measures in Evolutionary Mobile Robot Navigation
Authors: Tomás Arredondo,  V., Wolfgang Freund, César Muñoz
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In this paper we analyze entropy based measures in various motivation and environmental configurations of mobile robot navigation in complex environments. These entropy based measures are used to probe and predict various environmental and robot configurations that can provide for the emergence of highly fit robotic behaviors. The robotic system uses a neural network to evaluate measurements from its sensors in order to establish its next behavior. Genetic algorithms, fuzzy based fitness and Action-based Environment Modeling (AEM) all take a part toward training the robot. The research performed shows the utility of using these entropy based measures toward providing the robot with good training conditions.
Risk Assessment of Computer Controlled Systems
Authors: M. O. Fryer
Venue: IEEE Transactions on Software Engineering (1985)

Software is increasingly being used to control and monitor systems for which safety and reliability are critical. When comparing software designs for such systems, an evaluation of how each design can contribute to the risk of system failure is desirable. Unfortunately, the science of risk assessment of combined hardware and software systems is in its infancy. Risk assessment of combined hardware/software systems is often based on oversimplified assumptions about software behavior.
Features of Sequential Nonlinear Mapping
Authors: Algirdas Mykolas Montvilas
Venue: Informatica (2003)

In the paper the sequential nonlinear mapping has been investigated in order to reveal its features. The method was investigated by a plenty of experiments using various sorts of data. For illustrations there are presented results using &ldquo;marginal&rdquo; data: the first data gives the smallest mapping error, and the other data gives the largest one. The sequential nonlinear mapping has been investigated according ability to differ the data groups (clustering) when at the beginning the number of groups is taken to be less than really exists. It was showed that the sequential nonlinear mapping differs the groups of data well even though the number of them is taken to be less by one than really exists. The experiments show that the factor for correction co-ordinates on the plane for the sequential nonlinear mapping can be taken in the range from 0.25 to 0.75. Mapping errors depend on both the sort of initial conditions and the nature of data.
Acoustic Analysis of Adult Speaker Age
Authors: Susanne Schötz
Venue: Speaker Classification I: Fundamentals, Features, and Methods (2007)

Information about the age of the speaker is always present in speech. It is used as perceptual cues to age by human listeners, and can be measured acoustically and used by automatic age estimators. This chapter offers an introduction to the phonetic study of speaker age, with focus on what is known about the acoustic features which vary with age. The age-related acoustic variation in temporal as well as in laryngeally and supralaryngeally conditioned aspects of speech has been well documented. For example, features related to speech rate, sound pressure level (SPL) and fundamental frequency (F0) have been studied extensively, and appear to be important correlates of speaker age. However, the relationships among the correlates appear to be rather complex, and are influenced by several factors. For instance, differences have been reported between correlates of female and male age, between speakers of good and poor physiological condition, between chronological age and perceived age, and also between different speech sample types (e.g. sustained vowels, read or spontaneous speech). More research is thus needed in order to build reliable automatic classifiers of speaker age.
The Sturm-Liouville operator on the space of functions with discontinuity conditions
Authors: Ö. Uur, M. U. Akhmet
Venue: Computers Mathematics with Applications (2006)

The Sturm-Liouville differential operators defined on the space of discontinuous functions, where the moments of discontinuity of the functions are interior points of the interval and the discontinuity conditions are linear have been studied. Auxiliary results concerning the Green's formula, boundary value, and eigenvalue problems for impulsive differential equations are emphasized.
Extending Software Architecting Processes with Decision-Making Activities
Authors: Rafael Capilla, Francisco Nava
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)

The traditional perspective on software architecture has paid much attention to architecting as a development process aimed at creating the architecture of a software system, as well as the documentation used to communicate the architecture to the stakeholders by means of several architectural views. Recently, the software architecture research community has faced the need to record, manage, and document the design decisions and the rationale that lead to such architecture. Because architectures are the result of a set of design decisions, this design rationale must be properly recorded and managed as a complementary process to the modelling activity. In this paper we detail different types of decision-making activities aimed at creating and using design decisions and how these can be supported with tool support.
Improving the performance of evolutionary algorithms in imaging optimization
Authors: Izidor Gertner
Venue:  (2008)

This research applies Evolutionary algorithms (EAs) to the task of finding a proper mapping between geometrically distorted images, which arises in applications like image registration and object recognition. The task is formulated as an imaging optimization problem of minimizing the difference between the images. The objective of the research is to improve the computational performance of EAs in imaging optimization, by developing a fairly general approach based on a broader hybridization of EAs with the following techniques. (1) Augmenting EAs with local optimization technique, in the form of a two-phase (random/direct) cyclic search procedure reducing the excessive computational cost of local search. (2) Utilizing a frontal algorithm of forming new population assuring its diversity, and restoring the fair and effective usage of the search space disrupted by evolutionary operators. (3) Utilizing Image local response which directly extracts the main shape features; reduces the computational cost of fitness evaluation; and provides an efficient image model for adaptive local search, reduction of parameter space, and multi-sensor image fusion. (4) Introducing an advanced image model which reduces the amount of processed information, and includes the following steps: computing Image response, building response histogram, decomposing image into sections, decomposing sections into quadtrees, and defining the main shape feature, a hull. (5) Representing the sought image mapping as a piece-wise affine transformation allowing for significant mutual distortion of the compared images, so that different image sections have their respective local affine transformations. (6) Organizing image sections in a tree-structure which is processed in a hierarchical top-to-bottom manner, with local transformations of parental sections serving as initial approximations for local transformations of the offspring. (7) Utilizing multiple aligned populations aimed at increasing the coherence and robustness of the mapping during simultaneous processing of multiple views. (8) Utilizing multi-objective optimization, where different fitness functions are processed at the different computational stages, thus increasing the confidence of the search. (9) Implementing optimization search as two consecutive passes. During the first pass, global optimization seeks for a proper mapping of the image hull. During the second pass, the hull transformation is used as an initial solution for the final piece-wise optimization.
The CRUTIAL Architecture for Critical Information Infrastructures
Authors: Paulo Veríssimo, Nuno F. Neves, Miguel Correia, Yves Deswarte, A. Abou Kalam, Andrea Bondavalli, Alessandro Daidone
Venue: Architecting Dependable Systems V (2008)

In this chapter we discuss the susceptibility of critical information infrastructures to computer-borne attacks and faults, mainly due to their largely computerized nature, and to the pervasive interconnection of systems all over the world. We discuss how to overcome these problems and achieve resilience of critical information infrastructures, through adequate architectural constructs. The architecture we propose is generic and may come to be useful as a reference for modern critical information infrastructures. We discuss four main aspects: trusted components which induce prevention; middleware devices that achieve runtime automatic tolerance and protection; trustworthiness monitoring mechanisms detecting and adapting to non-predicted situations; organization-level security policies and access control models capable of securing global information flows.
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
Authors: Daisuke Suzuki
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation architecture proposed by us comprises three main techniques. The first technique is to improve the Montgomery multiplication algorithm in order to maximize the performance of the multiplication unit in FPGA. The second technique is to improve and balance the circuit delay. The third technique is to ensure and make fast the scalability of the effective FPGA resource. We propose a circuit architecture that can handle multiple data lengths using the same circuits. In addition, our architecture can perform fast operations using small-scale resources; in particular, it can complete 512-bit modular exponentiation in 0.26 ms by means of XC4VF12-10SF363, which is the minimum logic resources in the Virtex-4 Series FPGAs. Also, the number of SLICEs used is approx. 4000 to make a very compact design. Moreover, 1024-, 1536- and 2048-bit modular exponentiations can be processed in the same circuit with the scalability.
Transfer Learning in Reinforcement Learning Problems Through Partial Policy Recycling
Authors: Jan Ramon, Kurt Driessens, Tom Croonenborghs
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

We investigate the relation between transfer learning in reinforcement learning with function approximation and supervised learning with concept drift. We present a new incremental relational regression tree algorithm that is capable of dealing with concept drift through tree restructuring and show that it enables a Q-learner to transfer knowledge from one task to another by recycling those parts of the generalized Q-function that still hold interesting information for the new task. We illustrate the performance of the algorithm in several experiments.
Robust Retrieval Experiments at the University of Hildesheim
Authors: Ben Heuwing, Thomas Mandl
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper reports on experiments submitted for the robust task at CLEF 2007. We applied a system previously tested for ad-hoc retrieval. Experiments were focused on the effect of blind relevance feedback and named entities. Experiments for mono-lingual English and French are presented. A topic analysis of post run results shows directions for future research.
Search-based refactoring: an empirical study
Authors: Mark O'Keeffe, Mel Ó Cinnéide
Venue: Journal of Software Maintenance and Evolution: Research and Practice (2008)

Object-oriented systems that undergo repeated addition of functionality commonly suffer a loss of quality in their underlying design. This problem must often be remedied in a costly refactoring phase before further maintenance programming can take place. Recently search-based approaches to automating the task of software refactoring, based on the concept of treating object-oriented design as a combinatorial optimization problem, have been proposed. However, because search-based refactoring is a novel approach it is yet to be established as to which search techniques are most suitable for the task. In this paper we report the results of an empirical comparison of simulated annealing (SA), genetic algorithms (GAs) and multiple ascent hill-climbing (HCM) in search-based refactoring. A prototype automated refactoring tool is employed, capable of making radical changes to the design of an existing program in order that it conforms more closely to a contemporary quality model. Results show HCM to outperform both SA and GA over a set of five input programs. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Using Process Tailoring to Manage Software Development Challenges
Authors: Peng Xu, Balasubramaniam Ramesh
Venue: IT Professional (2008)

To ensure high-quality software processes and leverage best practices, project managers strive to tailor standard processes such as the rational unified process or those developed within their own organizations. Software process tailoring is the activity of tuning a process to meet the needs of a specific project. Despite the critical role that tailoring software processes plays in ensuring project success, few guidelines on it are available for practitioners. The authors conducted an empirical study in two organizations and developed a framework to guide process tailoring.
High Performance Session State Management Scheme for Stateful Packet Inspection
Authors: Seungyong Yoon, Byoungkoo Kim, Jintae Oh, Jongsoo Jang
Venue: Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services (2007)

This paper relates to a method for performing Stateful Packet Inspection(SPI) in real time using a session table management scheme that allows more efficient generation of session state information. SPI is an important technique to reduce false positive alerts in network intrusion detection system(NIDS). As the number of session increases, this technique requires a higher processing speed, thereby causing performance problems. However, existing software-based solutions cannot perform real-time packet inspection ensuring the wire speed. To guarantee both performance and functionality with respect to statefulness, we designed and implemented SPI-based intrusion detection module in a FPGA to help alleviating a bottleneck in network intrusion detection systems in this paper.
Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations
Authors: Jean-Michel Fourneau
Venue: Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering (2008)

We present a new kind of synchronization which allows Continuous Time Stochastic Automata Networks (SAN) to have a product form steady-state distribution. Unlike previous models on SAN with product form solutions, our model allows synchronization between three automata but functional rates are not allowed. The synchronization is not the usual "Rendez-Vous" but an ordered list of transitions. Each transition may fail. When a transition fails, the synchronization ends but all the transitions already executed are kept. This synchronization is related to the triggered customer movement between queues in a network and this class of SAN is a generalization of Gelenbe's networks with triggered customer movement.
Mobile Opportunistic Planning: Methods and Models
Authors: Eric Horvitz, Paul Koch, Muru Subramani
Venue: Proceedings of the 11th international conference on User Modeling (2007)

We present a study exploring the promise of developing computational systems to support the discovery and execution of opportunistic activities in mobile settings. We introduce the challenge of mobile opportunistic planning, describe a prototype named Mobile Commodities, and focus on the construction and use of probabilistic user models to infer the cost of time required to execute opportunistic plans.
Abstraction in FPGA implementation of neural networks
Authors: Arif Selçuk Öǧrenci
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

A model for FPGA implementation of multilayer perceptron neural networks is presented. The model tries to incorporate object oriented design principles in the analysis, training, and design of components using hardware description languages. The synthesis will be based on the tools supplied by the FPGA vendors. The results indicate that the method can be utilized, and it can be further improved to create a general methodology that bridges the gap between hardware and software in embedded system design.
Relational Neural Gas
Authors: Barbara Hammer, Alexander Hasenfuss
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

We introduce relational variants of neural gas, a very efficient and powerful neural clustering algorithm, which allow a clustering and mining of data given in terms of a pairwise similarity or dissimilarity matrix. It is assumed that this matrix stems from Euclidean distance or dot product, respectively, however, the underlying embedding of points is unknown. One can equivalently formulate batch optimization in terms of the given similarities or dissimilarities, thus providing a way to transfer batch optimization to relational data. For this procedure, convergence is guaranteed and extensions such as the integration of label information can readily be transferred to this framework.
Models in Conflict --- Towards a Semantically Enhanced Version Control System for Models
Authors: Kerstin Altmanninger
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

For a widespread success of the model-driven paradigm, appropriate tools such as "Version Control Systems" (VCS) allowing for consistency maintenance between concurrently edited model versions are required to adequately support a model-based development process. Initial attempts for graph-based versioning of model artifacts are either tightly coupled to the modeling environment, not flexible with respect to the used modeling language or cannot interpret the model's semantics. On basis of those characteristics, the goal of the outlined thesis presented in this paper is to provide mechanisms to detect conflicting modifications between parallel edited model versions more accurately. By reducing falsely indicated conflicts and by finding additional semantic conflicts, the resolution process can be simplified by means of appropriate techniques for comparison, conflict detection, conflict resolution and merge.
Letters: Upper bound on pattern storage in feedforward networks
Authors: Pramod L. Narasimha, Michael T. Manry, Francisco Maldonado
Venue: Neurocomputing (2008)

An upper bound on pattern storage is stated for nonlinear feedforward networks with analytic activation functions, like the multilayer perceptron and radial basis function network. The bound is given in terms of the number of network weights, and applies to networks having any number of output nodes and arbitrary connectivity. Starting from the strict interpolation equations and exact finite degree polynomial models for the hidden units, a straightforward proof by contradiction is developed for the upper bound. Several networks, trained by conjugate gradient, are used to demonstrate the tightness of the bound for random patterns.
Discrete Dynamics of Two-Dimensional Nonlinear Hybrid Automata
Authors: Lorenzo Sella, Pieter Collins
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

In this paper, we develop an algorithm to compute under- and over-approximations to the discrete dynamics of a hybrid automaton. We represent the approximations to the dynamics as sofic shifts, which can be generated by a discrete automaton. We restrict to two-dimensional systems, since these give rise to one-dimensional return maps, which are significantly easier to study. Given generic non-degeneracy conditions, the under- and over-approximations computed by our algorithm converge to the discrete dynamics of the hybrid automaton. We apply the algorithms to two simple nonlinear hybrid systems, an affine switching system with hysteresis, and the singularly forced van der Pol oscillator.
R-FRTDP: A Real-Time DP Algorithm with Tight Bounds for a Stochastic Resource Allocation Problem
Authors: Camille Besse, Pierrick Plamondon, Brahim Chaib-Draa
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

Resource allocation is a widely studied class of problems in Operation Research and Artificial Intelligence. Specially, constrained stochastic resource allocation problems, where the assignment of a constrained resource do not automatically imply the realization of the task. This kind of problems are generally addressed with Markov Decision Processes (mdps). In this paper, we present efficient lower and upper bounds in the context of a constrained stochastic resource allocation problem for a heuristic search algorithm called Focused Real Time Dynamic Programming (frtdp). Experiments show that this algorithm is relevant for this kind of problems and that the proposed tight bounds reduce the number of backups to perform comparatively to previous existing bounds.