Results 21 to 30 of about 1,293,597 (281)

Chromatic priming in hemianopic visual fields

open access: yesExperimental Brain Research, 2003
In three monkeys made hemianopic by unilateral striate cortical ablation, in one normal monkey and in a human hemianope (GY), we measured reaction times to chromatic targets presented in the normal hemifield as a function of prior chromatic primes in the blind field. The first of our three tasks showed an unspecific priming effect in that the colour of
Cowey, A, Stoerig, P, Hodinott-Hill, I
openaire   +3 more sources

Comparative field performance evaluation of different type of Pusa Electric Power Units

open access: yesThe Indian Journal of Agricultural Sciences, 2022
Pusa developed three walk-behind type electric power units were evaluated in 9.96 ha area for tillage in polyhouse, secondary tillage, planking and weeding-cum interculture operations at research farm of ICAR-IARI during kharif and rabi 2020 and 2021 ...
UTPAL EKKA, S P SINGH, M K SINGH
doaj   +1 more source

A new quantum-safe multivariate polynomial public key digital signature algorithm

open access: yesScientific Reports, 2022
We propose a new quantum-safe digital signature algorithm called Multivariate Polynomial Public Key Digital Signature (MPPK/DS). The core of the algorithm is based on the modular arithmetic property that for a given element g, greater than equal to two ...
Randy Kuang   +2 more
doaj   +1 more source

Trans-saccadic priming in hemianopia: Sighted-field sensitivity is boosted by a blind-field prime

open access: yesNeuropsychologia, 2012
We experience visual stability despite shifts of the visual array across the retina produced by eye movements. A process known as remapping is thought to keep track of the spatial locations of objects as they move on the retina. We explored remapping in damaged visual cortex by presenting a stimulus in the blind field of two patients with hemianopia ...
Kay Ritchie   +2 more
openaire   +3 more sources

Calculation of Fourier-Galois transforms in reduced binary number systems [PDF]

open access: yesКомпьютерная оптика, 2018
The paper proposes a new method for calculating Fourier-Galois transforms (number-theoretical transforms), which are a modular analog of the discrete Fourier transform.
Vladimir Chernov
doaj   +1 more source

An updated meta-analysis of the primed goal-organizational behaviour relationship

open access: yesRoyal Society Open Science, 2023
Environmental cues (e.g. achievement-related words and pictures) can prime/activate, in the absence of awareness, a mental representation of importance stored in memory. Chen et al.'s 2021 Applied Psychology: An International Review 70, 216–253.
Gary P. Latham   +3 more
doaj   +1 more source

Comparison of symbolic and ordinary powers of ideals [PDF]

open access: yes, 2002
In this paper we generalize the theorem of Ein-Lazarsfeld-Smith (concerning the behavior of symbolic powers of prime ideals in regular rings finitely generated over a field of characteristic 0) to arbitrary regular rings containing a field.
Hochster, Melvin, Huneke, Craig
core   +3 more sources

Ternary number systems in finite fields [PDF]

open access: yesКомпьютерная оптика, 2018
The work continues the author's previous study of positional number systems in finite fields. The paper considers ternary number systems and arithmetic operations algorithms for the representation of elements of finite fields in the so-called ternary ...
Vladimir Chernov
doaj   +1 more source

On the Distribution of Atkin and Elkies Primes [PDF]

open access: yes, 2011
Given an elliptic curve E over a finite field F_q of q elements, we say that an odd prime ell not dividing q is an Elkies prime for E if t_E^2 - 4q is a square modulo ell, where t_E = q+1 - #E(F_q) and #E(F_q) is the number of F_q-rational points on E ...
Shparlinski, Igor E.   +1 more
core   +2 more sources

Computation of discrete logarithms in prime fields [PDF]

open access: yesDesigns, Codes and Cryptography, 1991
Let \(p\) be a prime and \(g\), \(x\) integers. The computation of \(y\) such that \(y\equiv g^ x(\mod p)\), \(0\leq y\leq p-1\), is referred to as discrete exponentiation. Given \(p\), \(g\) and \(y\) the computation of \(x\) is referred to as the discrete logarithm problem.
LaMacchia, B. A., Odlyzko, A. M.
openaire   +1 more source

Home - About - Disclaimer - Privacy