Results 171 to 180 of about 1,278 (205)
Analysing All-Optical Random Bit Sequences Using Gap-Based Approaches. [PDF]
Lange C, Ahrens A, Singh J, Grote O.
europepmc +1 more source
Vibrations in matter, from spider webs to molecules, water to flames, share a grammar with music. We propose that creativity emerges when constraints force expansion beyond existing possibilities. Selective imperfection restores balance, enabling invention.
Markus J. Buehler
wiley +1 more source
OTVLD-Net: An Omni-Dimensional Dynamic Convolution-Transformer Network for Lane Detection. [PDF]
Wu Y, Zhang Z, Chen H, Jian L.
europepmc +1 more source
Motive and Opportunity: Order Choice in a Limit Order Book With Dispersed Information
ABSTRACT We test predictions of market microstructure theory relating to the determinants of order choice in a limit order book where information is dispersed among traders. Using an experimental limit order book, with a large state space, we find that informed traders exhibit patience, compatible with the ‘waiting game’ behaviour described in Foster ...
James Steeley +2 more
wiley +1 more source
Gradient Descent Provably Escapes Saddle Points in the Training of Shallow ReLU Networks. [PDF]
Cheridito P, Jentzen A, Rossmannek F.
europepmc +1 more source
Artificial intelligence–driven decoupling structure–activity relationship for lithium‐ion batteries
Artificial intelligence can efferently accelerate the high‐throughput screening of battery materials, the analysis of multiphase mechanisms, and the precise prediction of capacity and cycle life. This review systematically summarizes the applications of machine learning (ML) in decoupling the complex structure‐activity relationships of lithium‐ion ...
Tao Wang +6 more
wiley +1 more source
A Multi-Strategy Enhanced Whale Optimization Algorithm for Long Short-Term Memory-Application to Short-Term Power Load Forecasting for Microgrid Buildings. [PDF]
Qu L, Teng Q, Mai H, Chen J.
europepmc +1 more source
A Coarse Geometric Approach to Graph Layout Problems
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
A multi-image codebook approach for secure text transmission. [PDF]
Rashid OF, Tuama SA, Al-Shahwani H.
europepmc +1 more source

