Search results for "generalization"
showing 10 items of 250 documents
A New Approach to the Generalization of Darbo’s Fixed Point Problem by Using Simulation Functions with Application to Integral Equations
2019
We investigate the existence of fixed points of self-mappings via simulation functions and measure of noncompactness. We use different classes of additional functions to get some general contractive inequalities. As an application of our main conclusions, we survey the existence of a solution for a class of integral equations under some new conditions. An example will be given to support our results.
The Interaction of Person-Affect-Cognition-Execution (I-PACE) model for addictive behaviors: Update, generalization to addictive behaviors beyond int…
2019
We propose an updated version of the Interaction of Person-Affect-Cognition-Execution (I-PACE) model, which we argue to be valid for several types of addictive behaviors, such as gambling, gaming, buying-shopping, and compulsive sexual behavior disorders. Based on recent empirical findings and theoretical considerations, we argue that addictive behaviors develop as a consequence of the interactions between predisposing variables, affective and cognitive responses to specific stimuli, and executive functions, such as inhibitory control and decision-making. In the process of addictive behaviors, the associations between cue-reactivity/craving and diminished inhibitory control contribute to th…
<p>Generalization in chess thinking</p>
2015
In this work we deal with generalization in chess thinking. Generalization is a complex process based on information people acquired during previous experiences. In the field of chess, chess books, chess education and personal game practice supply the information for generalization to occur. The way in which generalization is performed in chess is still a topic that deserves more research. In this article we dwell on early theories about chess thinking. We underline the role played by what we call configural concepts, in which geometrical patterns and logical expected developments coexist. We suggest that the idea of configural concepts, along with generalization and abduction constitute th…
Modeling Developmental Processes in Psychology
2013
In the present article I suggest first that modeling in psychology can be described as an interactive process between a phenomenon under study (reality) and different levels of theoretical conceptualizations that vary in respect to how directly they can be related to empirical observations and at what level of generalization they operate. Then, I give three examples of my own work concerning building theories and testing models. Next, I discuss some caveats scientists face when building theories and models on the basis of their observations. Finally, I make a few conclusions on the basis of the article. peerReviewed
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…
On Fine and Wilf's theorem for bidimensional words
2003
AbstractGeneralizations of Fine and Wilf's Periodicity Theorem are obtained for the case of bidimensional words using geometric arguments. The domains considered constitute a large class of convex subsets of R2 which include most parallelograms. A complete discussion is provided for the parallelogram case.
Order-disorder phase transition in random-walk networks
2004
In this paper we study in detail the behavior of random-walk networks (RWN's). These networks are a generalization of the well-known random Boolean networks (RBN's), a classical approach to the study of the genome. RWN's are also discrete networks, but their response is defined by small variations in the state of each gene, thus being a more realistic representation of the genome and a natural bridge between discrete and continuous models. RWN's show a clear transition between order and disorder. Here we explicitly deduce the formula of the critical line for the annealed model and compute numerically the transition points for quenched and annealed models. We show that RBN's and the annealed…
A generalization of Sardinas and Patterson's algorithm to z-codes
1993
Abstract This paper concerns the framework of z-codes theory. The main contribution consists in an extension of the algorithm of Sardinas and Patterson for deciding whether a finite set of words X is a z-code. To improve the efficiency of this test we have found a tight upper bound on the length of the shortest words that might have a double z-factorization over X. Some remarks on the complexity of the algorithm are also given. Moreover, a slight modification of this algorithm allows us to compute the z-deciphering delay of X.
Children’s Generalization of Novel Object Names in Comparison Contexts: An eye tracking analysis
2019
International audience; A common result is thatcomparison settings (i.e., several stimuli introduced simultaneously) favor conceptualizationand generalization. In a comparison setting, we manipulated the semantic distance between the two training items (e.g., two bracelets versus a bracelet and a watch), and the semantic distance between the training items and the test items (e.g., a pendant versus a bow tie). We tested 5-and 8-year-old children’s generalization of novel names for objects. This study is the first one to study the temporal dynamics ofcomparison in a generalization task with eye-tracking data. The eye movement data revealed clear patterns of exploration in which participants …
Gray visiting Motzkins
2002
We present the first Gray code for Motzkin words and their generalizations: k colored Motzkin words and Schroder words. The construction of these Gray codes is based on the observation that a k colored Motzkin word is the shuffle of a Dyck word by a k-ary variation on a trajectory which is a combination. In the final part of the paper we give some algorithmic considerations and other possible applications of the techniques introduced here.