Search results for "generalization"
showing 10 items of 250 documents
Loop-free Gray code algorithm for the e-restricted growth functions
2011
The subject of Gray codes algorithms for the set partitions of {1,2,...,n} had been covered in several works. The first Gray code for that set was introduced by Knuth (1975) [5], later, Ruskey presented a modified version of [email protected]?s algorithm with distance two, Ehrlich (1973) [3] introduced a loop-free algorithm for the set of partitions of {1,2,...,n}, Ruskey and Savage (1994) [9] generalized [email protected]?s results and give two Gray codes for the set of partitions of {1,2,...,n}, and recently, Mansour et al. (2008) [7] gave another Gray code and loop-free generating algorithm for that set by adopting plane tree techniques. In this paper, we introduce the set of e-restricte…
Further generalization of fixed point theorems in Menger PM-spaces
2015
In this work, we establish some fixed point theorems by revisiting the notion of ψ-contractive mapping in Menger PM-spaces. One of our results (namely, Theorem 2.3) may be viewed as a possible answer to the problem of existence of a fixed point for generalized type contractive mappings in M-complete Menger PM-spaces under arbitrary t-norm. Some examples are furnished to demonstrate the validity of the obtained results.
Hard to catch: Experimental evidence supports evasive mimicry
2021
Most research on aposematism has focused on chemically defended prey, but the signalling difficulty of capture remains poorly explored. Similar to classical Batesian and Müllerian mimicry related to distastefulness, such ‘evasive aposematism' may also lead to convergence in warning colours, known as evasive mimicry. A prime candidate group for evasive mimicry areAdelphabutterflies, which are agile insects and show remarkable colour pattern convergence. We tested the ability of naive blue tits to learn to avoid and generalizeAdelphawing patterns associated with the difficulty of capture and compared their response to that of birds that learned to associate the same wing patterns with distast…
Interpretable Option Discovery Using Deep Q-Learning and Variational Autoencoders
2021
Deep Reinforcement Learning (RL) is unquestionably a robust framework to train autonomous agents in a wide variety of disciplines. However, traditional deep and shallow model-free RL algorithms suffer from low sample efficiency and inadequate generalization for sparse state spaces. The options framework with temporal abstractions [18] is perhaps the most promising method to solve these problems, but it still has noticeable shortcomings. It only guarantees local convergence, and it is challenging to automate initiation and termination conditions, which in practice are commonly hand-crafted.
Sources and Boundaries of Institutional and Linguistic Normativity. Towards a Critical Social Ontology.
2013
Since Hegel and until speech acts theory and contemporary social ontology it came to full development the idea that most of reasons, duties, rights, entitlements, have to do, against Kant, with our participation to social, linguistic and institutional practices of the lifeform to which we belong rather than or more than with our dealing with “substantive moral principles”. But if we accept, with Hegel, that every individual rational determination of the will is justified as such only as a part of our collective Sittlichkheit (Hegel, 1967, cf. Di Lorenzo Ajello, 2009); if we accept from speech acts theory that there are commitments, rights and entitlements specific to every type of speech ac…
Suppression of mirror generalization for reversible letters: Evidence from masked priming
2011
Abstract Readers of the Roman script must “unlearn” some forms of mirror generalization when processing printed stimuli (i.e., herb and herd are different words). Here we examine whether the suppression of mirror generalization is a process that affects all letters or whether it mostly affects reversible letters (i.e., b / d ). Three masked priming lexical decision experiments were conducted to examine how the cognitive system processes mirror images of reversible vs. non-reversible letters embedded in Spanish words. Repetition priming effects relative to the mirror-letter condition were substantially greater when the critical letter was reversible (e.g., idea - IDEA vs. ibea - IDEA ) than …
Assigning discounts in a marketing campaign by using reinforcement learning and neural networks
2009
In this work, RL is used to find an optimal policy for a marketing campaign. Data show a complex characterization of state and action spaces. Two approaches are proposed to circumvent this problem. The first approach is based on the self-organizing map (SOM), which is used to aggregate states. The second approach uses a multilayer perceptron (MLP) to carry out a regression of the action-value function. The results indicate that both approaches can improve a targeted marketing campaign. Moreover, the SOM approach allows an intuitive interpretation of the results, and the MLP approach yields robust results with generalization capabilities.
Dissipative terms of thermal nature in the theory of an ideal monoatomic superfluid
1996
A dissipative model of helium II was built up in previous works, using a 13-field extended thermodynamic theory formulated by Liu and Muller. In this work a generalization of such model is presented, where an extended thermodynamics with 14 fields due to Kremer is used. It is shown that the fourteenth field is able to account for the experimental data concerning the second sound attenuation. Further, the proposed theory is able to explain the Osborne experiment. Finally, a comparison with the two-fluid model is performed, emphasizing the different ways in which the dissipative phenomena are explained by the two theories.
Iterative Reconstruction of Memory Kernels.
2017
In recent years, it has become increasingly popular to construct coarse-grained models with non-Markovian dynamics to account for an incomplete separation of time scales. One challenge of a systematic coarse-graining procedure is the extraction of the dynamical properties, namely, the memory kernel, from equilibrium all-atom simulations. In this article, we propose an iterative method for memory reconstruction from dynamical correlation functions. Compared to previously proposed noniterative techniques, it ensures by construction that the target correlation functions of the original fine-grained systems are reproduced accurately by the coarse-grained system, regardless of time step and disc…
Extracting similar sub-graphs across PPI Networks
2009
Singling out conserved modules (corresponding to connected sub-graphs) throughout protein-protein interaction networks of different organisms is a main issue in bioinformatics because of its potential applications in biology. This paper presents a method to discover highly matching sub-graphs in such networks. Sub-graph extraction is carried out by taking into account, on the one side, both protein sequence and network structure similarities and, on the other side, both quantitative and reliability information possibly available about interactions. The method is conceived as a generalization of a known technique, able to discover functional orthologs in interaction networks. Some preliminar…