Results 31 to 40 of about 3,178 (169)
this text is in portuguese just so an important security leak within its practical use is kept under the nationality of the author first, it will later be translated in to ...
openaire +1 more source
ABSTRACT A class of one‐dimensional impact and dynamic contact problems taking into account non‐smooth velocities is studied. The new space‐time finite element approximation of dynamic variational inequalities is suggested. The non‐smooth solution for the impact of an obstacle by an elastic bar and its energy conservation under persistency conditions ...
Victor A. Kovtunenko +2 more
wiley +1 more source
ABSTRACT We study eigenvalue problems for the de Rham complex on varying three‐dimensional domains. Our analysis includes the Helmholtz equation as well as the Maxwell system with mixed boundary conditions and non‐constant coefficients. We provide Hadamard‐type formulas for the shape derivatives under weak regularity assumptions on the domain and its ...
Pier Domenico Lamberti +2 more
wiley +1 more source
Deterministic elliptic curve primality proving for a special sequence of numbers
We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm uses O(log N)
Everest +5 more
core +2 more sources
ABSTRACT We are concerned with the stability of a transferable‐utility cooperative (TU) game. First, the concept of core can be weakened so that the blocking of changes is limited to only those with multilateral backings. This principle of consensual blocking, as well as the traditional core‐defining one of unilateral blocking and one straddling in ...
Jian Yang
wiley +1 more source
Quantum Probabilistic Subroutines and Problems in Number Theory
We present a quantum version of the classical probabilistic algorithms $\grave{a}$ la Rabin. The quantum algorithm is based on the essential use of Grover's operator for the quantum search of a database and of Shor's Fourier transform for extracting the ...
A. Carlini +17 more
core +1 more source
Random Primes without Primality Testing
Numerous algorithms call for computation over the integers modulo a randomly-chosen large prime. In some cases, the quasi-cubic complexity of selecting a random prime can dominate the total running time. We propose a new variant of the classic D5 algorithm for "dynamic evaluation", applied to a randomly-chosen (composite) integer.
Giorgi, Pascal +3 more
openaire +2 more sources
An Exact Method for Reliable Shortest Path Problems With Correlation
ABSTRACT Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for
Esteban Leiva +3 more
wiley +1 more source
Melodies of the forest: Nature as an improvisational space for shared creative embodiment
Abstract In an era marked by increasing disconnection from nature, innovative approaches to reconnect with the environment are crucial for both ecological and psychological well‐being. This paper explores how natural environments (a deciduous forest of Quebec in the present case study) can serve as an improvisational space for shared creative ...
Antoine Bellemare‐Pepin +2 more
wiley +1 more source
With the boom in information technology and the penetration of these technologies in an increasing number of areas, such as electronic business, many questions about security arise. Data in electronic form bring many benefits, but they are vulnerable to various abuses. Therefore, data need to be adequately protected.
openaire +3 more sources

