justin

Today I read a paper titled “Remembering what we like: Toward an agent-based model of Web traffic”

The abstract is:
Analysis of aggregate Web traffic has shown that PageRank is a poor model of how people actually navigate the Web.

Using the empirical traffic patterns generated by a thousand users over the course of two months, we characterize the properties of Web traffic that cannot be reproduced by Markovian models, in which destinations are independent of past decisions.

In particular, we show that the diversity of sites visited by individual users is smaller and more broadly distributed than predicted by the PageRank model; that link traffic is more broadly distributed than predicted; and that the time between consecutive visits to the same site by a user is less broadly distributed than predicted.

To account for these discrepancies, we introduce a more realistic navigation model in which agents maintain individual lists of bookmarks that are used as teleportation targets.

The model can also account for branching, a traffic property caused by browser features such as tabs and the back button.

The model reproduces aggregate traffic patterns such as site popularity, while also generating more accurate predictions of diversity, link traffic, and return time distributions.

This model for the first time allows us to capture the extreme heterogeneity of aggregate traffic measurements while explaining the more narrowly focused browsing patterns of individual users.

Today I read a paper titled “A Formal Measure of Machine Intelligence”

The abstract is:
A fundamental problem in artificial intelligence is that nobody really knows what intelligence is.

The problem is especially acute when we need to consider artificial systems which are significantly different to humans.

In this paper we approach this problem in the following way: We take a number of well known informal definitions of human intelligence that have been given by experts, and extract their essential features.

These are then mathematically formalised to produce a general measure of intelligence for arbitrary machines.

We believe that this measure formally captures the concept of machine intelligence in the broadest reasonable sense.

Today I read a paper titled “Human Activity in the Web”

The abstract is:
The recent information technology revolution has enabled the analysis and processing of large-scale datasets describing human activities.

The main source of data is represented by the Web, where humans generally use to spend a relevant part of their day.

Here we study three large datasets containing the information about Web human activities in different contexts.

We study in details inter-event and waiting time statistics.

In both cases, the number of subsequent operations which differ by tau units of time decays power-like as tau increases.

We use non-parametric statistical tests in order to estimate the significance level of reliability of global distributions to describe activity patterns of single users.

Global inter-event time probability distributions are not representative for the behavior of single users: the shape of single users’inter-event distributions is strongly influenced by the total number of operations performed by the users and distributions of the total number of operations performed by users are heterogeneous.

A universal behavior can be anyway found by suppressing the intrinsic dependence of the global probability distribution on the activity of the users.

This suppression can be performed by simply dividing the inter-event times with their average values.

Differently, waiting time probability distributions seem to be independent of the activity of users and global probability distributions are able to significantly represent the replying activity patterns of single users.

Today I read a paper titled “Optimising the topology of complex neural networks”

The abstract is:
In this paper, we study instances of complex neural networks, i.e.

neural netwo rks with complex topologies.

We use Self-Organizing Map neural networks whose n eighbourhood relationships are defined by a complex network, to classify handwr itten digits.

We show that topology has a small impact on performance and robus tness to neuron failures, at least at long learning times.

Performance may howe ver be increased (by almost 10%) by artificial evolution of the network topo logy.

In our experimental conditions, the evolved networks are more random than their parents, but display a more heterogeneous degree distribution.

Today I read a paper titled “Facing the Facts”

The abstract is:
Human error research on overconfidence supports the benefits of early visibility of defects and disciplined development.

If risk to the enterprise is to be reduced, individuals need to become aware of the reality of the quality of their work.

Several cycles of inspection and defect removal are inevitable.

Software Quality Management measurements of defect density and removal efficiency are applicable.

Research of actual spreadsheet error rates shows data consistent with other software depending on the extent to which the work product was reviewed before inspection.

The paper argues that the payback for an investment in early review time is justified by the saving in project delay and expensive errors in use.

‘If debugging is the process of removing bugs, then programming must be the process of putting them in’ – Anon.

Today I read a paper titled “Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments”

The abstract is:
We develop and analyze algorithms for dispersing a swarm of primitive robots in an unknown environment, R.

The primary objective is to minimize the makespan, that is, the time to fill the entire region.

An environment is composed of pixels that form a connected subset of the integer grid.

There is at most one robot per pixel and robots move horizontally or vertically at unit speed.

Robots enter R by means of k>=1 door pixels Robots are primitive finite automata, only having local communication, local sensors, and a constant-sized memory.

We first give algorithms for the single-door case (i.e., k=1), analyzing the algorithms both theoretically and experimentally.

We prove that our algorithms have optimal makespan 2A-1, where A is the area of R.

We next give an algorithm for the multi-door case (k>1), based on a wall-following version of the leader-follower strategy.

We prove that our strategy is O(log(k+1))-competitive, and that this bound is tight for our strategy and other related strategies.

Today I read a paper titled “Multiagent Approach for the Representation of Information in a Decision Support System”

The abstract is:
In an emergency situation, the actors need an assistance allowing them to react swiftly and efficiently.

In this prospect, we present in this paper a decision support system that aims to prepare actors in a crisis situation thanks to a decision-making support.

The global architecture of this system is presented in the first part.

Then we focus on a part of this system which is designed to represent the information of the current situation.

This part is composed of a multiagent system that is made of factual agents.

Each agent carries a semantic feature and aims to represent a partial part of a situation.

The agents develop thanks to their interactions by comparing their semantic features using proximity measures and according to specific ontologies.

Today I read a paper titled “Wavelet and Curvelet Moments for Image Classification: Application to Aggregate Mixture Grading”

The abstract is:
We show the potential for classifying images of mixtures of aggregate, based themselves on varying, albeit well-defined, sizes and shapes, in order to provide a far more effective approach compared to the classification of individual sizes and shapes.

While a dominant (additive, stationary) Gaussian noise component in image data will ensure that wavelet coefficients are of Gaussian distribution, long tailed distributions (symptomatic, for example, of extreme values) may well hold in practice for wavelet coefficients.

Energy (2nd order moment) has often been used for image characterization for image content-based retrieval, and higher order moments may be important also, not least for capturing long tailed distributional behavior.

In this work, we assess 2nd, 3rd and 4th order moments of multiresolution transform — wavelet and curvelet transform — coefficients as features.

As analysis methodology, taking account of image types, multiresolution transforms, and moments of coefficients in the scales or bands, we use correspondence analysis as well as k-nearest neighbors supervised classification.

Today I read a paper titled “Lattice Gas Cellular Automata for Computational Fluid Animation”

The abstract is:
The past two decades showed a rapid growing of physically-based modeling of fluids for computer graphics applications.

In this area, a common top down approach is to model the fluid dynamics by Navier-Stokes equations and apply a numerical techniques such as Finite Differences or Finite Elements for the simulation.

In this paper we focus on fluid modeling through Lattice Gas Cellular Automata (LGCA) for computer graphics applications.

LGCA are discrete models based on point particles that move on a lattice, according to suitable and simple rules in order to mimic a fully molecular dynamics.

By Chapman-Enskog expansion, a known multiscale technique in this area, it can be demonstrated that the Navier-Stokes model can be reproduced by the LGCA technique.

Thus, with LGCA we get a fluid model that does not require solution of complicated equations.

Therefore, we combine the advantage of the low computational cost of LGCA and its ability to mimic the realistic fluid dynamics to develop a new animating framework for computer graphics applications.

In this work, we discuss the theoretical elements of our proposal and show experimental results.

Today I read a paper titled “Covering selfish machines”

The abstract is:
We consider the machine covering problem for selfish related machines.

For a constant number of machines, m, we show a monotone polynomial time approximation scheme (PTAS) with running time that is linear in the number of jobs.

It uses a new technique for reducing the number of jobs while remaining close to the optimal solution.

We also present an FPTAS for the classical machine covering problem (the previous best result was a PTAS) and use this to give a monotone FPTAS.

Additionally, we give a monotone approximation algorithm with approximation ratio \min(m,(2+\eps)s_1/s_m) where \eps>0 can be chosen arbitrarily small and s_i is the (real) speed of machine i.

Finally we give improved results for two machines.

Our paper presents the first results for this problem in the context of selfish machines.

Today I read a paper titled “A Recommender System based on the Immune Network”

The abstract is:
The immune system is a complex biological system with a highly distributed, adaptive and self-organising nature.

This paper presents an artificial immune system (AIS) that exploits some of these characteristics and is applied to the task of film recommendation by collaborative filtering (CF).

Natural evolution and in particular the immune system have not been designed for classical optimisation.

However, for this problem, we are not interested in finding a single optimum.

Rather we intend to identify a sub-set of good matches on which recommendations can be based.

It is our hypothesis that an AIS built on two central aspects of the biological immune system will be an ideal candidate to achieve this: Antigen – antibody interaction for matching and antibody – antibody interaction for diversity.

Computational results are presented in support of this conjecture and compared to those found by other CF techniques.

Today I read a paper titled “Uncovering Plagiarism Networks”

The abstract is:
Plagiarism detection in educational programming assignments is still a problematic issue in terms of resource waste, ethical controversy, legal risks, and technical complexity.

This paper presents AC, a modular plagiarism detection system.

The design is portable across platforms and assignment formats and provides easy extraction into the internal assignment representation.

Multiple similarity measures have been incorporated, both existing and newly-developed.

Statistical analysis and several graphical visualizations aid in the interpretation of analysis results.

The system has been evaluated with a survey that encompasses several academic semesters of use at the authors’ institution.

Today I read a paper titled “Design of an Electro-Hydraulic System Using Neuro-Fuzzy Techniques”

The abstract is:
Increasing demands in performance and quality make drive systems fundamental parts in the progressive automation of industrial processes.

Their conventional models become inappropriate and have limited scope if one requires a precise and fast performance.

So, it is important to incorporate learning capabilities into drive systems in such a way that they improve their accuracy in realtime, becoming more autonomous agents with some degree of intelligence.

To investigate this challenge, this chapter presents the development of a learning control system that uses neuro-fuzzy techniques in the design of a tracking controller to an experimental electro-hydraulic actuator.

We begin the chapter by presenting the neuro-fuzzy modeling process of the actuator.

This part surveys the learning algorithm, describes the laboratorial system, and presents the modeling steps as the choice of actuator representative variables, the acquisition of training and testing data sets, and the acquisition of the neuro-fuzzy inverse-model of the actuator.

In the second part of the chapter, we use the extracted neuro-fuzzy model and its learning capabilities to design the actuator position controller based on the feedback-error-learning technique.

Through a set of experimental results, we show the generalization properties of the controller, its learning capability in actualizing in realtime the initial neuro-fuzzy inverse-model, and its compensation action improving the electro-hydraulics tracking performance.

Today I read a paper titled “Camera motion estimation through planar deformation determination”

The abstract is:
In this paper, we propose a global method for estimating the motion of a camera which films a static scene.

Our approach is direct, fast and robust, and deals with adjacent frames of a sequence.

It is based on a quadratic approximation of the deformation between two images, in the case of a scene with constant depth in the camera coordinate system.

This condition is very restrictive but we show that provided translation and depth inverse variations are small enough, the error on optical flow involved by the approximation of depths by a constant is small.

In this context, we propose a new model of camera motion, that allows to separate the image deformation in a similarity and a “purely” projective application, due to change of optical axis direction.

This model leads to a quadratic approximation of image deformation that we estimate with an M-estimator; we can immediatly deduce camera motion parameters.

Today I read a paper titled “Qualitative Study of a Robot Arm as a Hamiltonian System”

The abstract is:
A double pendulum subject to external torques is used as a model to study the stability of a planar manipulator with two links and two rotational driven joints.

The hamiltonian equations of motion and the fixed points (stationary solutions) in phase space are determined.

Under suitable conditions, the presence of constant torques does not change the number of fixed points, and preserves the topology of orbits in their linear neighborhoods; two equivalent invariant manifolds are observed, each corresponding to a saddle-center fixed point.

Today I read a paper titled “Agent-Based Perception of an Environment in an Emergency Situation”

The abstract is:
We are interested in the problem of multiagent systems development for risk detecting and emergency response in an uncertain and partially perceived environment.

The evaluation of the current situation passes by three stages inside the multiagent system.

In a first time, the situation is represented in a dynamic way.

The second step, consists to characterise the situation and finally, it is compared with other similar known situations.

In this paper, we present an information modelling of an observed environment, that we have applied on the RoboCupRescue Simulation System.

Information coming from the environment are formatted according to a taxonomy and using semantic features.

The latter are defined thanks to a fine ontology of the domain and are managed by factual agents that aim to represent dynamically the current situation.

Today I read a paper titled “Bin Packing Under Multiple Objectives – a Heuristic Approximation Approach”

The abstract is:
The article proposes a heuristic approximation approach to the bin packing problem under multiple objectives.

In addition to the traditional objective of minimizing the number of bins, the heterogeneousness of the elements in each bin is minimized, leading to a biobjective formulation of the problem with a tradeoff between the number of bins and their heterogeneousness.

An extension of the Best-Fit approximation algorithm is presented to solve the problem.

Experimental investigations have been carried out on benchmark instances of different size, ranging from 100 to 1000 items.

Encouraging results have been obtained, showing the applicability of the heuristic approach to the described problem.