Results 251 to 260 of about 1,713,760 (284)
Some of the next articles are maybe not open access.
On the Complexity of the Dual Bases of the Gaussian Normal Bases
Algebra Colloquium, 2015In this paper, we study the complexity of the dual bases of the Gaussian normal bases of type (n, t), for all n and t = 3, 4, 5, 6, of š¯”½qn over š¯”½q and provide conditions under which the complexity of the Gaussian normal basis of type (n, t) is equal to the complexity of the dual basis over any finite field.
Mishra, Alok +2 more
openaire +2 more sources
An alernative test for normality based on normalized spacings
Journal of Statistical Computation and Simulation, 1995The Shapiro-Wilk statistic and its modifications are widely used for assessing the assumption that a sample was drawn from a normal distribution. Many of the modifications simplified the calculation of the test statistic but resulted in a loss of power.
Ling. Chen, Samuel S. Shapiro
openaire +1 more source
Bootstrap-Based Normal Reconstruction
2012We propose a bootstrap-based method for normal estimation on an unorganised point set. Experimental results show that the accuracy of the method is comparable with the accuracy of the widely used Principal Component Analysis. The main advantage of our approach is that the variance of the normals over the bootstrap samples can be used as a confidence ...
Ahmad Lutfi Amri Ramli +1 more
openaire +1 more source
Cohort-Based Score Normalization
2014Automatic biometric authentication has long been an active research filed driven by its wide range of pratical applications. An authentication framework typically involves two stages: the enrollment stage (bulding a template model for each user) and the test stage (validating the authenticity of a query sample to its claimed identity).
TISTARELLI, Massimo, Sun Y.
openaire +2 more sources
Normalization Properties of Schauder Bases
Proceedings of the London Mathematical Society, 197100 that x = 2 n this basis is normalized so that \\yn\\ = 1. In topological terms this means that (yn) is bounded and 'bounded away from zero' in the sense that there exists a neighbourhood V of 0 such that yn $ V for all n. These two properties are extremely useful in the theory of bases in Banach spaces. The purpose of this paper is to consider these
openaire +1 more source
NORMAL BASES FOR FUNCTION FIELDS
Bulletin of the Australian Mathematical SocietyAbstractIn function fields in positive characteristic, we provide a concrete example of completely normal elements for a finite Galois extension. More precisely, for a nonabelian extension, we construct completely normal elements for Drinfeld modular function fields using Siegel functions in function fields.
openaire +1 more source
The normal acidā€“base status of mice
Respiratory Physiology & Neurobiology, 2012Rodent models are commonly used for various physiological studies including acid-base regulation. Despite the widespread use of especially genetic modified mice, little attention have been made to characterise the normal acid-base status in these animals in order to reveal proper control values.
Iversen, Nina Kerting +3 more
openaire +3 more sources
2020
The topic of this chapter is the celebrated primitive normal basis theorem: for every extension E/F of Galois fields, there exists a primitive element of E which is normal over F. We will provide a complete proof for this fundamental result, which does not rely on the use of computers at all; all necessary calculations can easily be checked using a ...
Dirk Hachenberger, Dieter Jungnickel
openaire +1 more source
The topic of this chapter is the celebrated primitive normal basis theorem: for every extension E/F of Galois fields, there exists a primitive element of E which is normal over F. We will provide a complete proof for this fundamental result, which does not rely on the use of computers at all; all necessary calculations can easily be checked using a ...
Dirk Hachenberger, Dieter Jungnickel
openaire +1 more source
1993
With the development of coding theory and the appearance of several cryptosystems using finite fields, the implementation of finite field arithmetic, in either hardware or software, is required. Work in this area has resulted in several hardware and software designs or implementations [7, 8, 22, 23, 24, 27], including single-chip exponentiators for the
Ian F. Blake +4 more
openaire +1 more source
With the development of coding theory and the appearance of several cryptosystems using finite fields, the implementation of finite field arithmetic, in either hardware or software, is required. Work in this area has resulted in several hardware and software designs or implementations [7, 8, 22, 23, 24, 27], including single-chip exponentiators for the
Ian F. Blake +4 more
openaire +1 more source