Results 81 to 90 of about 2,188,345 (345)
Extrusion deformation estimation method of oil and gas string basedon AIC-RBF
It is difficult to measure the deformation of oil and gas strings affected by the ground movement for a long time. In order to solve this problem, an inversion algorithm for extrusion deformation estimation of oil and gas strings based on pulsed eddy ...
Xuanyong ZHOU +5 more
doaj +1 more source
We introduce a computational workflow that combines quantum chemical calculations and machine learning techniques to predict the catalytic performance of a wide range of catalysts in the nitrogen reduction reaction (NRR). The analysis of the trained models provides insights into the complex structure–activity relationship in experimental catalytic ...
Leonardo Di Ciano +5 more
wiley +1 more source
Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds [PDF]
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes can be solved in polynomial time using dedicated algorithms.
Maciej Gazda, Tim A.C. Willemse
doaj +1 more source
This study explores how machine learning models, trained on small experimental datasets obtained via Phase Doppler Anemometry (PDA), can accurately predict droplet size (D32) in ultrasonic spray coating (USSC). By capturing the influence of ink complexity (solvent, polymer, nanoparticles), power, and flow rate, the model enables precise droplet control
Pieter Verding +5 more
wiley +1 more source
Polynomial time algorithm for solving k-coverage problem in wireless sensor networks
How to solve the k-coverage problem,which was divided into worst-case and best-case,inside the two-dimensional target area in wireless sensor networks was explored,and a polynomial time algorithm for solving this problem was put forward.In this algorithm,
Qi WANG, Zheng’an XIAO, Huaixing WANG
doaj +2 more sources
Critical Slowing Down in Polynomial Time Algorithms [PDF]
4 pp., 3 ...
openaire +3 more sources
Broadband angle of arrival estimation methods in a polynomial matrix decomposition framework
A large family of broadband angle of arrival estimation algorithms are based on the coherent signal subspace (CSS) method, whereby focussing matrices appropriately align covariance matrices across narrowband frequency bins.
Mohamed Alrmah +9 more
core +1 more source
Milled polycrystalline NMC811 cathode (MPC NMC) with smaller secondary particle and higher surface area had 1) greater cathode tortuosity, 2) reduced surface Ni on the cycled MPC cathodes consistent with surface reconstruction, and 3) increased Ni deposition from cathode‐anode crosstalk, manifesting in lower functional capacity and higher impedance ...
Edelmy J. Marin Bernardez +22 more
wiley +1 more source
On search, decision, and the efficiency of polynomial-time algorithms
Recent advances in well-quasi-order theory have troubling consequences for those who would equate tractability with polynomial-time complexity. In particular, there is no guarantee that polynomial-time algorithms can be found just because a problem has been shown to be decidable in polynomial time.
Michael R. Fellows, Michael A. Langston
openaire +1 more source
Flexible sweat sensor patch integrating graphene‑interfaced gold microelectrodes functionalized with bio‑receptors and ion‑selective membrane, coupled with a capillary‑driven microfluidic layer and portable potentiostat electronics for multiplexed monitoring of inflammatory, metabolic, and electrolyte biomarkers in microliter sweat volumes.
Roomia Memon +4 more
wiley +1 more source

