Results 51 to 60 of about 3,178 (169)

Implementing the asymptotically fast version of the elliptic curve primality proving algorithm [PDF]

open access: yes, 2005
The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the primality of large numbers. Its running time cannot be proven rigorously, but heuristic arguments show that it should run in time O ((
Morain, François
core   +3 more sources

Cyclemaster Matrices and Primality Testing

open access: yes, 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   +2 more sources

Parental Understandings of ‘Stranger Danger’: Balancing Fear of Victimisation by Strangers Against Enabling Autonomy and Independence in Children

open access: yesChildren &Society, EarlyView.
ABSTRACT For decades, children have been taught about ‘stranger danger’. Fear of the stranger has been associated with overly cautious parenting strategies, and the curtailing of freedoms as children transition to adolescents. This article aims to examine the extent to which parents consider this issue of stranger danger in their decisions to grant ...
Craig Collie
wiley   +1 more source

On Schopenhauer's Debt to Spinoza1

open access: yesEuropean Journal of Philosophy, EarlyView.
Abstract Schopenhauer offers ‘nature is not divine but demonic’ as a direct rebuttal of Spinoza's pantheism, his identification of ‘nature’ with ‘God’. And so, one would think, he ought to have been immune to the ‘Spinozism’ that became, as Heine called it, ‘the unofficial religion’ of the age.
Julian Young
wiley   +1 more source

A novel dual‐decomposition method for non‐convex two‐stage stochastic mixed‐integer quadratically constrained quadratic problems

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley   +1 more source

Multi‐objective maritime vessel routing with safety considerations

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The routing of maritime vessels is a challenging optimization problem that involves finding an adequate balance between conflicting and multiple objectives. This paper proposes a methodology based on inverse optimization to find appropriate objective weights that account for conflicting objectives. To formulate the inverse optimization problem,
Nazanin Sharif   +4 more
wiley   +1 more source

Miller's primality test

open access: yesInformation Processing Letters, 1979
The author presents the following simplification of G. L. Miller's primality criterion [J. Comput. Syst. Sci. 13, 300--317 (1976; Zbl 0349.68025)]. Assume that for every integer \(d\equiv 1\pmod 4\), which is either prime or the product of two primes, the \(L\)-function \(\sum_{k=1}^\infty (k\mid d) k^{-s}\) satisfies the generalized Riemann hypothesis,
openaire   +3 more sources

Integrated location–inventory planning for slow‐moving demands with waiting time limitations

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract This paper studies a stochastic facility location problem integrated with inventory and transportation decisions (SFLPIT) for supply chains with slow‐moving stock‐keeping units (SKUs). Local stores often avoid maintaining such SKUs, resulting in customer demand being fulfilled directly by a central distribution center (DC), where the ...
Jie Chu   +4 more
wiley   +1 more source

Faster Primality Testing [PDF]

open access: yes, 1990
Several major improvements to the Jacobi sum primality testing algorithm will speed it up in such a way that proving primality of primes of up to 500 digits will be a matter of routine. Primes of about 800 digits will take at most one night on a Cray.
Wieb Bosma, Marc-Paul van der Hulst
openaire   +1 more source

Conceptual Anchors in Longitudinal Qualitative Health Research: Using a Methodological Adjunct in Longitudinal Interpretative Phenomenological Analysis

open access: yesJournal of Advanced Nursing, EarlyView.
ABSTRACT Aims To highlight how Longitudinal Experiential Concepts can be used as conceptual anchors within Longitudinal Interpretative Phenomenological Analysis to gain temporal interpretative phenomenological insights, a lack of which can be a criticism levelled at novice nurse or midwife researchers utilising phenomenological research methods ...
Kelda J. Folliard   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy