Results 141 to 150 of about 249,312 (242)

Voluntary Collective Action to Address Growing Agricultural Challenges in Two Countries: Experimental Insights and Commonalities

open access: yesApplied Economic Perspectives and Policy, EarlyView.
ABSTRACT We conducted two framed field economic experiments with citrus farmers in Florida, United States and soybean farmers in Argentina to investigate their willingness to coordinate pest and weed management efforts. Despite the contrast between these two agricultural contexts, we find striking behavioral commonalities.
Ariel Singerman, Sergio H. Lence
wiley   +1 more source

Vector-exponential time-series modeling for polynomial J-spectral factorization

open access: yes, 2005
An iterative algorithm to perform the J-spectral factorization of a para-Hermitian matrix is presented. The algorithm proceeds by computing a special kernel representation of an interpolant for a sequence of points and associated directions determined ...
Pendharkar, Ishan   +2 more
core   +1 more source

A New Approach Combining RSA and ElGamal Algorithms: Advancements in Encryption and Digital Signatures Using Gaussian Integers

open access: yesJordanian Journal of Computers and Information Technology
This article introduces a novel approach that integrates the ElGamal and RSA algorithms to advance the security and efficiency of public-key cryptosystems.
Yahia Awad   +3 more
doaj   +1 more source

Solution to the General Inner-Outer and Spectral Factorization Problems [PDF]

open access: yes, 1998
In this paper we solve two open problems in linear system theory: the computation of the spectral and inner-outer factorizations of a rational matrix G in the most general setting.
Varga, A., Oara, C.
core  

Learning regime‐dependent governing equations: A symbolic decision tree approach

open access: yesAIChE Journal, EarlyView.
Abstract Many chemical engineering systems are governed by mechanisms that switch across operating regimes, making the data‐driven discovery of regime‐dependent governing equations essential for predictive modeling, optimization, and control. We propose symbolic decision trees for the data‐driven discovery of regime‐dependent governing equations.
Ilias Mitrai   +2 more
wiley   +1 more source

Classification and experimental studies of the factorization algorithms efficiency

open access: yesСучасний стан наукових досліджень та технологій в промисловості
The subject of the study is factorization algorithms, namely experimental testing of the efficiency of modern algorithms for integer factorization, identifying patterns between factorization algorithms and the size of the numbers being factorized in ...
Володимир Пєвнєв   +1 more
doaj   +1 more source

Particle Swarm Optimization Algorithm for Integer Factorization Problem (IFP)

open access: yes, 2015
This paper presents particle swarm optimization (PSO) method to find the prime factors of a composite number. Integer factorization is a well known NP hard problem and security of many cryptosystem is based on difficulty of integer factorization.
Sangita Neog, Bhargab Choudhury
core  

Comparison of DeePMD, MTP, GAP, ACE and MACE Machine‐Learned Potentials for Radiation‐Damage Simulations: A User Perspective

open access: yesAdvanced Intelligent Discovery, EarlyView.
The authors evaluated six machine‐learned interatomic potentials for simulating threshold displacement energies and tritium diffusion in LiAlO2 essential for tritium production. Trained on the same density functional theory data and benchmarked against traditional models for accuracy, stability, displacement energies, and cost, Moment Tensor Potential ...
Ankit Roy   +8 more
wiley   +1 more source

Coupling and particle number intertwiners in the Calogero model

open access: yesJournal of High Energy Physics
It is long known that quantum Calogero models feature intertwining operators, which increase or decrease the coupling constant by an integer amount, for any fixed number of particles.
Francisco Correa   +2 more
doaj   +1 more source

On the Factorizations of Integers via Division Algorithms for Polynomials

open access: yesMathematics
We introduce and study several conditions related to the factorization problem of composite numbers. For this purpose, we employ cyclotomic polynomials, Sylvester resultants, and the Fermat equation. For instance, we show that for m∈N and distinct primes
Guram Donadze, Adrian Vasiu
doaj   +1 more source

Home - About - Disclaimer - Privacy