Encouraging Complementary Fuzzy Rules within Iterative Rule Learning

M. Galea, Q. Shen and V. Singh. Encouraging Complementary Fuzzy Rules within Iterative Rule Learning. Proceedings of the 2005 UK Workshop on Computational Intelligence, pages 15-22.

Simultaneous ant colony optimisation algorithms for learning linguistic fuzzy rules

M. Galea and Q. Shen. Simultaneous ant colony optimisation algorithms for learning linguistic fuzzy rules. A. Abraham, C. Grosan and V. Ramos (Eds.), Swarm Intelligence in Data Mining, pages 75-99.

A Want of Order and Good Discipline: Rules, Discretion and the Victorian Prison

null RAE2008

Spatial Pattern Learning, Catastophic Forgetting and Optimal Rules of Synaptic Transmission

It is a neural network truth universally acknowledged, that the signal transmitted to a target node must be equal to the product of the path signal times a weight. Analysis of catastrophic forgetting by distributed codes leads to the unexpected conclusion that this universal synaptic transmission rule may not be optimal in certain neural networks. The distributed outstar, a network designed to support stable codes with fast or slow learning, generalizes the outstar network for spatial pattern learning. In the outstar, signals from a source node cause weights to learn and recall arbitrary patterns across a target field of nodes. The distributed outstar replaces the outstar source node with a source field, of arbitrarily many nodes, where the activity pattern may be arbitrarily distributed or compressed. Learning proceeds according to a principle of atrophy due to disuse whereby a path weight decreases in joint proportion to the transmittcd path signal and the degree of disuse of the target node. During learning, the total signal to a target node converges toward that node's activity level. Weight changes at a node are apportioned according to the distributed pattern of converging signals three types of synaptic transmission, a product rule, a capacity rule, and a threshold rule, are examined for this system. The three rules are computationally equivalent when source field activity is maximally compressed, or winner-take-all when source field activity is distributed, catastrophic forgetting may occur. Only the threshold rule solves this problem. Analysis of spatial pattern learning by distributed codes thereby leads to the conjecture that the optimal unit of long-term memory in such a system is a subtractive threshold, rather than a multiplicative weight.

Predicting the frequency dispersion of electronic hyperpolarizabilities on the basis of absorption data and thomas-kuhn sum rules

Successfully predicting the frequency dispersion of electronic hyperpolarizabilities is an unresolved challenge in materials science and electronic structure theory. We show that the generalized Thomas-Kuhn sum rules, combined with linear absorption data and measured hyperpolarizability at one or two frequencies, may be used to predict the entire frequency-dependent electronic hyperpolarizability spectrum. This treatment includes two- and three-level contributions that arise from the lowest two or three excited electronic state manifolds, enabling us to describe the unusual observed frequency dispersion of the dynamic hyperpolarizability in high oscillator strength M-PZn chromophores, where (porphinato)zinc(II) (PZn) and metal(II)polypyridyl (M) units are connected via an ethyne unit that aligns the high oscillator strength transition dipoles of these components in a head-to-tail arrangement. We show that some of these structures can possess very similar linear absorption spectra yet manifest dramatically different frequency dependent hyperpolarizabilities, because of three-level contributions that result from excited state-to excited state transition dipoles among charge polarized states. Importantly, this approach provides a quantitative scheme to use linear optical absorption spectra and very limited individual hyperpolarizability measurements to predict the entire frequency-dependent nonlinear optical response. Copyright © 2010 American Chemical Society.

No-Holdback allocation rules for continuous-time assemble-to-order systems

This paper analyzes a class of common-component allocation rules, termed no-holdback (NHB) rules, in continuous-review assemble-to-order (ATO) systems with positive lead times. The inventory of each component is replenished following an independent base-stock policy. In contrast to the usually assumed first-come-first-served (FCFS) component allocation rule in the literature, an NHB rule allocates a component to a product demand only if it will yield immediate fulfillment of that demand. We identify metrics as well as cost and product structures under which NHB rules outperform all other component allocation rules. For systems with certain product structures, we obtain key performance expressions and compare them to those under FCFS. For general product structures, we present performance bounds and approximations. Finally, we discuss the applicability of these results to more general ATO systems. © 2010 INFORMS.

A note on stopping rules for iterative regularisation methods and filtered SVD

"This volume contains the proceedings of a meeting held at Montpellier from December 1st to December 5th 1986 .sponsored by the Centre national de la recherche scientifique ."--Preface.

Investigation into a modular rule-based testing method for testing business rules in scheduling applications

Rule testing in transport scheduling is a complex and potentially costly business problem. This paper proposes an automated method for the rule-based testing of business rules using the extensible Markup Language for rule representation and transportation. A compiled approach to rule execution is also proposed for performance-critical scheduling systems.

General rules for predicting where a catalytic reaction should occur on metal surfaces: A density functional theory study of C-H and C-O bond breaking/making on flat, stepped, and kinked metal surfaces

To predict where a catalytic reaction should occur is a fundamental issue scientifically. Technologically, it is also important because it can facilitate the catalyst's design. However, to date, the understanding of this issue is rather limited. In this work, two types of reactions, CH4 CH3 + H and CO C + 0 on two transition metal surfaces, were chosen as model systems aiming to address in general where a catalytic reaction should occur. The dissociations of CH4 - CH3 + H and CO --> C + O and their reverse reactions on flat, stepped, and kinked Rh and Pd surfaces were studied in detail. We find the following: First, for the CH4 Ch(3) + H reaction, the dissociation barrier is reduced by similar to0.3 eV on steps and kinks as compared to that on flat surfaces. On the other hand, there is essentially no difference in barrier for the association reaction of CH3 + H on the flat surfaces and the defects. Second, for the CO C + 0 reaction, the dissociation barrier decreases dramatically (more than 0.8 eV on Rh and Pd) on steps and kinks as compared to that on flat surfaces. In contrast to the CH3 + H reaction, the C + 0 association reaction also preferentially occurs on steps and kinks. We also present a detailed analysis of the reaction barriers in which each barrier is decomposed quantitatively into a local electronic effect and a geometrical effect. Our DFT calculations show that surface defects such as steps and kinks can largely facilitate bond breaking, while whether the surface defects could promote bond formation depends on the individual reaction as well as the particular metal. The physical origin of these trends is identified and discussed. On the basis of our results, we arrive at some simple rules with respect to where a reaction should occur: (i) defects such as steps are always favored for dissociation reactions as compared to flat surfaces; and (ii) the reaction site of the association reactions is largely related to the magnitude of the bonding competition effect, which is determined by the reactant and metal valency. Reactions with high valency reactants are more likely to occur on defects (more structure-sensitive), as compared to reactions with low valency reactants. Moreover, the reactions on late transition metals are more likely to proceed on defects than those on the early transition metals.

How simple grazing rules can lead to persistent boundaries in vegetation communities.

Natural landscape boundaries between vegetation communities are dynamically influenced by the selective grazing of herbivores. Here we show how this may be an emergent property of very simple animal decisions, without the need for any sophisticated choice rules etc., using a model based on biased diffusion. Animal grazing intensity is coupled with plant competition, resulting in reaction-diffusion dynamics, from which stable boundaries spontaneously emerge. In the model, animals affect their resources by both consumption and trampling. It is assumed that forage consists of two heterogeneously distributed competing resource species, one that is preferred (grass) over the other (heather) by the animals. The solutions to the resulting system of differential equations for three cases a) optimal foraging, b) random walk foraging and c) taxis-diffusion are presented. Optimal and random foraging gave unrealistic results, but taxis-diffusion accorded well with field observations. Persistent boundaries between patches of near-monoculture vegetation were predicted, with these boundaries drifting in response to overall grazing pressure (grass advancing with increased grazing and vice versa). The reaction-taxis-diffusion model provides the first mathematical explanation for such vegetation mosaic dynamics and the parameters of the model are open to experimental testing.

Fusion rules for merging uncertain information

In previous papers, we have presented a logic-based framework based on fusion rules for merging structured news reports. Structured news reports are XML documents, where the textentries are restricted to individual words or simple phrases, such as names and domain-specific terminology, and numbers and units. We assume structured news reports do not require natural language processing. Fusion rules are a form of scripting language that define how structured news reports should be merged. The antecedent of a fusion rule is a call to investigate the information in the structured news reports and the background knowledge, and the consequent of a fusion rule is a formula specifying an action to be undertaken to form a merged report. It is expected that a set of fusion rules is defined for any given application. In this paper we extend the approach to handling probability values, degrees of beliefs, or necessity measures associated with textentries in the news reports. We present the formal definition for each of these types of uncertainty and explain how they can be handled using fusion rules. We also discuss the methods of detecting inconsistencies among sources.