Results 41 to 50 of about 195 (180)
De los números de Midy a la primalidad
Revista Integración, 2015 Utilizando propiedades de los números de Midy se define el concepto de q-seudoprimo base b, el cual extiende la idea de seudoprimo fuerte base b, y a partir de dicho concepto se establece un nuevo criterio de primalidad que refina el Teorema de ...
John H. Castillo +2 more
doaj
Cyclemaster Matrices and Primality Testing
, 2023 We define the $N \times N$ single variable cyclemaster matrix, and use its determinant to construct a necessary and sufficient test for $N$ to be prime.
Mazur, Marcin, Zemyan, Stephen M.
openaire +3 more sources
When Enzymes Mislead: Assessing the Value of MRCP in Suspected Choledocholithiasis
ANZ Journal of Surgery, EarlyView.ABSTRACT Background The diagnosis of choledocholithiasis (CDL) requires balancing timely intervention against the risks of unnecessary invasive procedures. Although liver function tests (LFTs) are widely used for risk stratification, their static values and short‐term trends remain poorly defined in predicting persistent common bile duct stones.
Renato Pitesa +4 more
wiley +1 more source
Computing Skinning Weights via Convex Duality
Computer Graphics Forum, EarlyView.We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Dickson Pseudoprimes and Primality Testing [PDF]
, 2007 The paper gives a general definition for the concept of strong Dickson pseudoprimes which contains as special cases the Carmichael numbers and the strong Fibonacci pseudoprimes. Furthermore, we give necessary and sufficient conditions for two important classes of strong Dickson pseudoprimes and deduce some properties for their elements. A suggestion of
Winfried B. Müller, Alan Oswald
openaire +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
, 2006 Since the discovery of the utility of the numbers, the human being tried to differentiate them. We decide between them according to whether they are even or odd. Or, according to the fact that they are prime or composite. A natural number n >1 is called a prime number if it has no positive divisors other than 1 and n.
+5 more sources
Contouring Signed Distance Fields by Approximating Gradients
Computer Graphics Forum, EarlyView.Abstract Signed distance fields are often represented by discrete samples (e.g., on a grid). Recovering the contour implicitly represented by the distance samples requires an approximation algorithm. Several recent approaches have shown that exploiting the information carried in each distance sample by explicitly constructing a surface point gives ...
M. Kohlbrenner, M. Alexa
wiley +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
Establishing Shape Correspondences: A Survey
Computer Graphics Forum, EarlyView.Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source