Items of some interest:

Posted on by

These are my recent Pinboard.in links:

  • [1201.5604] Discrete and Fuzzy Dynamical Genetic Programming in the XCSF Learning Classifier System

    "A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results from an investigation into using discrete and fuzzy dynamical system representations within the XCSF Learning Classifier System. In particular, asynchronous Random Boolean Networks are used to represent the traditional condition-action production system rules in the discrete case and asynchronous Fuzzy Logic Networks in the continuous-valued case. It is shown possible to use self-adaptive, open-ended evolution to design an ensemble of such dynamical systems within XCSF to solve a number of well-known test problems."

    Kauffman-networks learning-classifier-systems genetic-programming nudge-targets interesting

  • [1201.4899] I Like Her more than You: Self-determined Communities

    "In this paper we define what we call an affinity system, which is a set of individuals, each with a vector characterizing its preference for all other individuals in the set. The preference of a member can be given either by a ranking of all members or by a weighted vector that defines the degrees of its affinity to others. Affinity systems are useful for modeling social systems as well as general data sets, as social interactions are often determined by affinities among the members. We also define a natural notion of (potentially overlapping) communities in an affinity system, in which the members of a given community collectively prefer each other to anyone else outside the community. Thus these communities are "self-determined" or "self-certified" by the affinity system. We provide a tight polynomial bound on the number of self-determined communities as a function of the robustness of the community. Moreover, we present a polynomial-time algorithm for enumerating these communities, as well as a local algorithm with a strong stochastic performance guarantee that can find a community in time nearly linear in the of size the community.…"

    network-theory social-capital social-dynamics self-assembly agent-based graph-theory algorithms complexology nudge-targets

  • [1201.5076] Technical Report #SEHIR-IE-VA-12-1: Optimal Obstacle Placement with Disambiguations

    "We introduce the optimal obstacle placement with disambiguations problem wherein the goal is to place true obstacles in an environment cluttered with false obstacles so as to maximize the total traversal length of a navigating agent (NAVA). Prior to the traversal, NAVA is given location information and probabilistic estimates of each disk-shaped hindrance (hereinafter referred to as disk) being a true obstacle. The NAVA can disambiguate a disk's status only when situated on its boundary. There exists an obstacle placing agent (OPA) that locates obstacles prior to NAVA's traversal. The goal of OPA is to place true obstacles in between the clutter in such a way that NAVA's traversal length is maximized in a game-theoretic sense.…"

    agent-based game-theory robotics disambiguation-design nudge-targets military-applications algorithms

  • [1010.5017] Collective motion

    "We review the observations and the basic laws describing the essential aspects of collective motion — being one of the most common and spectacular manifestation of coordinated behavior. Our aim is to provide a balanced discussion of the various facets of this highly multidisciplinary field, including experiments, mathematical methods and models for simulations, so that readers with a variety of background could get both the basics and a broader, more detailed picture of the field. The observations we report on include systems consisting of units ranging from macromolecules through metallic rods and robots to groups of animals and people. Some emphasis is put on models that are simple and realistic enough to reproduce the numerous related observations and are useful for developing concepts for a better understanding of the complexity of systems consisting of many simultaneously moving entities. As such, these models allow the establishing of a few fundamental principles of flocking. In particular, it is demonstrated, that in spite of considerable differences, a number of deep analogies exist between equilibrium statistical physics systems and those made of self-propelled (in most cases living) units. In both cases only a few well defined macroscopic/collective states occur and the transitions between these states follow a similar scenario, involving discontinuity and algebraic divergences."

    emergence emergent-design biology ethology complexology models artificial-life nudge-targets

  • [1201.5568] Dynamic trees for streaming and massive data contexts

    "Data collection at a massive scale is becoming ubiquitous in a wide variety of settings, from vast offline databases to streaming real-time information. Learning algorithms deployed in such contexts must rely on single-pass inference, where the data history is never revisited. In streaming contexts, learning must also be temporally adaptive to remain up-to-date against unforeseen changes in the data generating mechanism. Although rapidly growing, the online Bayesian inference literature remains challenged by massive data and transient, evolving data streams. Non-parametric modelling techniques can prove particularly ill-suited, as the complexity of the model is allowed to increase with the sample size. In this work, we take steps to overcome these challenges by porting standard streaming techniques, like data discarding and downweighting, into a fully Bayesian framework via the use of informative priors and active learning heuristics. We showcase our methods by augmenting a modern non-parametric modelling framework, dynamic trees, and illustrate its performance on a number of practical examples. The end product is a powerful streaming regression and classification tool, whose performance compares favourably to the state-of-the-art."

    data-analysis learning-from-data algorithms drinking-from-the-firehose nudge data-mining

Items of some interest:

Posted on by

These are my recent Pinboard.in links:

  • [1201.5440] Self-assembly of anisotropic soft particles in two dimensions

    "The self assembly of core-corona discs interacting via anisotropic potentials is investigated using Monte Carlo computer simulations. A minimal interaction potential that incorporates anisotropy in a simple way is introduced. It consists in a core-corona architecture in which the center of the core is shifted with respect to the center of the corona. Anisotropy can thus be tuned by progressively shifting the position of the core. Despite its simplicity, the system self organize in a rich variety of structures including stripes, triangular and rectangular lattices, and unusual plastic crystals. Our results indicate that the amount of anisotropy does not alter the lattice spacing and only influences the type of clustering (stripes, micells, etc.) of the individual particles."

    self-assembly biologically-inspired simulation pattern-formation condensed-matter

  • [1201.5477] Entropy-growth-based model of emotionally charged online dialogues

    "We analyze emotionally annotated massive data from IRC (Internet Relay Chat) and model the dialogues between its participants by assuming that the driving force for the discussion is the entropy growth of emotional probability distribution. This process is claimed to be correlated to the emergence of the power-law distribution of the discussion lengths observed in the dialogues. We perform numerical simulations based on the noticed phenomenon obtaining a good agreement with the real data. Finally, we propose a method to artificially prolong the duration of the discussion that relies on the entropy of emotional probability distribution."

    oh-look-power-laws flame-wars social-dynamics complexology cultural-dynamics

  • [1201.4955] Coordination, Differentiation and Fairness in a population of cooperating agents

    "In a recent paper, we analyzed the self-assembly of a complex cooperation network. The network was shown to approach a state, where every agent invests the same amount of resources. Nevertheless, highly-connected agents arise that extract extra-ordinarily high payoffs while contributing comparably little to any of their cooperations. Here, we investigate a variant of the model, in which highly-connected agents have access to additional resources. We study analytically and numerically whether these resources are invested in existing collaborations, leading to a fairer load distribution, or in establishing new collaborations, leading to an even less fair distribution of loads and payoffs."

    collaboration social-capital agent-based network-theory complexology nudge-targets

  • [1201.5426] Constraint Propagation as Information Maximization

    "Dana Scott used the partial order among partial functions for his mathematical model of recursively defined functions. He interpreted the partial order as one of information content. In this paper we elaborate on Scott's suggestion of regarding computation as a process of information maximization by applying it to the solution of constraint satisfaction problems. Here the method of constraint propagation can be interpreted as decreasing uncertainty about the solution — that is, as gain in information about the solution. As illustrative example we choose numerical constraint satisfaction problems to be solved by interval constraints. To facilitate this approach to constraint solving we formulate constraint satisfaction problems as formulas in predicate logic. This necessitates extending the usual semantics for predicate logic so that meaning is assigned not only to sentences but also to formulas with free variables."

    computer-science quite-interesting constraint-processing computational-methods

  • [1201.4459] An efficient parallel algorithm for the longest path problem in meshes

    "In this paper, first we give a sequential linear-time algorithm for the longest path problem in meshes. This algorithm can be considered as an improvement of [13]. Then based on this sequential algorithm, we present a constant-time parallel algorithm for the problem which can be run on every parallel machine."

    algorithms graph-theory computational-complexity nudge-targets

  • [1201.4417] Instabilities and Patterns in Coupled Reaction-Diffusion Layers

    "We study instabilities and pattern formation in reaction-diffusion layers that are diffusively coupled. For two-layer systems of identical two-component reactions, we analyze the stability of homogeneous steady states by exploiting the block symmetric structure of the linear problem. There are eight possible primary bifurcation scenarios, including a Turing-Turing bifurcation that involves two disparate length scales whose ratio may be tuned via the inter-layer coupling. For systems of $n$-component layers and non-identical layers, the linear problem's block form allows approximate decomposition into lower-dimensional linear problems if the coupling is sufficiently weak. As an example, we apply these results to a two-layer Brusselator system. The competing length scales engineered within the linear problem are readily apparent in numerical simulations of the full system. Selecting a $sqrt{2}$:1 length scale ratio produces an unusual steady square pattern."

    cute emergent-design pattern-formation complexology nudge-targets nonlinear-dynamics

  • [1201.4737] Production System Rules as Protein Complexes from Genetic Regulatory Networks

    "This short paper introduces a new way by which to design production system rules. An indirect encoding scheme is presented which views such rules as protein complexes produced by the temporal behaviour of an artificial genetic regulatory network. This initial study begins by using a simple Boolean regulatory network to produce traditional ternary-encoded rules before moving to a fuzzy variant to produce real-valued rules. Competitive performance is shown with related genetic regulatory networks and rule-based systems on benchmark problems."

    evolutionary-algorithms production-systems computer-science emergent-design

Items of some interest:

Posted on by

These are my recent Pinboard.in links:

Items of some interest:

Posted on by

These are my recent Pinboard.in links:

  • A Way To Think About Online Courses (By Apple, For Example) | Easily Distracted

    "One thing that struck me during the meeting, though, was that if you created a really rich body of materials that looked somewhat like an “online course”, what you really might be doing was crafting a completely novel form of publication. Imagine a work of historical scholarship that included video of the author giving an explanatory lecture at the beginning of a section of the reading; that had direct links to a huge body of archival pictures, audio recordings, maps, and other supporting materials; that extensively linked to relevant (or competing) analyses available in digital collections like JSTOR; and where the author would appear live once every week to take questions from students reading the book in a class."

    media academic-culture pedagogy publishing a-new-tent-and-a-new-camel

  • Evolution of increased complexity in a molecular machine : Nature : Nature Publishing Group

    "Many cellular processes are carried out by molecular ‘machines’—assemblies of multiple differentiated proteins that physically interact to execute biological functions1, 2, 3, 4, 5, 6, 7, 8. Despite much speculation, strong evidence of the mechanisms by which these assemblies evolved is lacking. Here we use ancestral gene resurrection9, 10, 11 and manipulative genetic experiments to determine how the complexity of an essential molecular machine—the hexameric transmembrane ring of the eukaryotic V-ATPase proton pump—increased hundreds of millions of years ago. We show that the ring of Fungi, which is composed of three paralogous proteins, evolved from a more ancient two-paralogue complex because of a gene duplication that was followed by loss in each daughter copy of specific interfaces by which it interacts with other ring proteins. These losses were complementary, so both copies became obligate components with restricted spatial roles in the complex. Reintroducing a single historical mutation from each paralogue lineage into the resurrected ancestral proteins is sufficient to recapitulate their asymmetric degeneration and trigger the requirement for the more elaborate three-component ring. Our experiments show that increased complexity in an essential molecular machine evolved because of simple, high-probability evolutionary processes, without the apparent evolution of novel functions. They point to a plausible mechanism for the evolution of complexity in other multi-paralogue protein complexes."

    via:cshalizi evolution structural-biology parsimony dangers-of-premature-optimization lesson-for-genetic-programming

  • Bienvenue sur le site de CaRMetal

    geometry simulator nudge-targets