Results 1  10
of
5,602
NSEMIGROUPS WITH IDENTITY ELEMENT
, 1983
"... Throughout this paper, we denote by Z+, Z \ respectively, the additive semigroup of all positive integers, of all nonnegative integers. Let G be an abelian group and I be a function of G x G into Z+ which satisfies the following conditions. (1.1) /(a, /?) = 7(0, a) foralla, /? e G. ..."
Abstract
 Add to MetaCart
Throughout this paper, we denote by Z+, Z \ respectively, the additive semigroup of all positive integers, of all nonnegative integers. Let G be an abelian group and I be a function of G x G into Z+ which satisfies the following conditions. (1.1) /(a, /?) = 7(0, a) foralla, /? e G.
On Additive Mappings in Rings with Identity Element
"... Let R be an associative ring with identity element, F: R → R, D: R → R and T: R → R all additive mappings and n ≥ 1 a fixed integer. We prove that (i) if R is (n+1)!torsion free any ring such that F (xn+1) = F (x)xn+xD(x)xn−1+x2D(x)xn−2+ · · ·+xnD(x) holds for all x ∈ R, then D is a Jordan deriva ..."
Abstract
 Add to MetaCart
Let R be an associative ring with identity element, F: R → R, D: R → R and T: R → R all additive mappings and n ≥ 1 a fixed integer. We prove that (i) if R is (n+1)!torsion free any ring such that F (xn+1) = F (x)xn+xD(x)xn−1+x2D(x)xn−2+ · · ·+xnD(x) holds for all x ∈ R, then D is a Jordan
The Sybil Attack
, 2002
"... Largescale peertopeer systems face security threats from faulty or hostile remote computing elements. To resist these threats, many such systems employ redundancy. However, if a single faulty entity can present multiple identities, it can control a substantial fraction of the system, thereby unde ..."
Abstract

Cited by 1518 (1 self)
 Add to MetaCart
Largescale peertopeer systems face security threats from faulty or hostile remote computing elements. To resist these threats, many such systems employ redundancy. However, if a single faulty entity can present multiple identities, it can control a substantial fraction of the system, thereby
The Laplacian Pyramid as a Compact Image Code
, 1983
"... We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixeltopixel correlations a ..."
Abstract

Cited by 1388 (12 self)
 Add to MetaCart
We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixeltopixel correlations
A connectionist implementation of identical elements. In
 In Proceedings of the Twenty Seventh Ann. Conf. Cognitive Science Society Proceedings. Lawerence Erlbaum: Mahwah NJ (2005
"... In training two networks on tasks that are different on the surface, but similar, or even isomorphic, at a higher level of description, similarities between the network solutions are plausible if not expected. Such similarities tend to become evident when two networks with shared weights are tra ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In training two networks on tasks that are different on the surface, but similar, or even isomorphic, at a higher level of description, similarities between the network solutions are plausible if not expected. Such similarities tend to become evident when two networks with shared weights are trained on similar tasks. After training, the shared weights were used as part of a third network that was trained on a third task similar to the first two. This “head start ” results in significantly shorter training times than a network that starts with random weights. Shared hidden unit response profiles were analyzed across networks trained on structurally analogous tasks to reveal parallel, but nonidentical features. Background Experimental evidence for transfer was described early in
Analogical Mapping by Constraint Satisfaction
 COGNITIVE SCIENCE 13, 295 (1989)
, 1989
"... A theory of analogical mopping between source and target analogs based upon interacting structural, semantic, and pragmatic constraints is proposed here. The structural constraint of fsomorphfsm encourages mappings that maximize the consistency of relational corresondences between the elements of th ..."
Abstract

Cited by 397 (29 self)
 Add to MetaCart
is sensitive to semantic and prag matic information if it is available,.and yet able to compute mappings between formally isomorphic analogs without any similar or identical elements. The theory Is able to account for empirical findings regarding the impact of consistenty and similarity on human processing
Permutation Groups Whose NonIdentity Elements Have K Fixed Points
"... In this note I prove an asymptotic structure theorem for groups with the property that any nonidentity element xes exactly k points. I also look briey at the innite analogue, and at a conjectured analogue for groups with prescribed sets of xedpoint numbers. Let K be a set of nonnegative integ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this note I prove an asymptotic structure theorem for groups with the property that any nonidentity element xes exactly k points. I also look briey at the innite analogue, and at a conjectured analogue for groups with prescribed sets of xedpoint numbers. Let K be a set of non
TC: A Revised Identical Elements Model of Arithmetic Fact Representation
 J Exp Psychol Learn Mem Cogn
"... Bourne, 1994) states that, for each triplet of numbers (e.g., 4, 7, 28) that are related by complementary multiplication and division problems, there are 3 independent fact representations in memory: (4, 7, x) 3 28; (28 / 7) 3 4; and (28 / 4) 3 7. In this article, the author reviews the evidence for ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Bourne, 1994) states that, for each triplet of numbers (e.g., 4, 7, 28) that are related by complementary multiplication and division problems, there are 3 independent fact representations in memory: (4, 7, x) 3 28; (28 / 7) 3 4; and (28 / 4) 3 7. In this article, the author reviews the evidence for this model, considers alternative accounts, and proposes a simple and empirically motivated revision to the model that (a) accommodates conflicting results, (b) provides a novel account of the ties effect, and (c) makes new and nonintuitive predictions for the factoring operation (e.g., factoring of 28 into 4 and 7). The author reports 3 experiments designed to test these predictions and discusses implications for arithmetic instruction. There is general agreement in the cognitive literature that adult performance on singledigit multiplication and division problems (e.g., 4 7 and 28 / 7) primarily involves fact recall (for reviews, see Ashcraft, 1992, 1995), although other strategies are sometimes used (e.g., LeFevre & Morris, 1999). There is debate, however, on the relation between multiplication and division fact representations. At the broadest level, there are two opposing theoretical
Freeform Surface CopyandPaste: A Mechanism for Transferring BrandIdentity Elements from One Object to Another
 CDROM Proceedings of DETC2003
, 2003
"... The goal of this work is to provide industrial designers with an intuitive mechanism for transferring brandidentity elements from one object to another, and to allow manual modifications of physical prototype details to be scanned and reincorporated back into original digital models. An algorithm t ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The goal of this work is to provide industrial designers with an intuitive mechanism for transferring brandidentity elements from one object to another, and to allow manual modifications of physical prototype details to be scanned and reincorporated back into original digital models. An algorithm
Results 1  10
of
5,602