Design and research of bridge collision avoidance system based on camera calibration technology and motion detection. [PDF]
Wang X, Wang S, Wei Z, Ren R, Huang J.
europepmc +1 more source
Automation and Active Learning for the Multi‐Objective Optimization of Antibody Formulations
Successful antibody formulation necessitates balancing factors such as thermal stability, colloidal stability, and viscosity across a vast excipient design space. This work integrates robotic liquid handling, high‐throughput biophysical characterization, and multi‐objective Bayesian optimization in an iterative closed‐loop Design‐Build‐Test‐Learn cycle.
D. Christopher Radford +3 more
wiley +1 more source
Systematic review of trends in deep learning for UAV cybersecurity. [PDF]
Tariq U, Ahanger TA, Ahmed I.
europepmc +1 more source
Non-IID and aware federated intrusion detection with PBFT with secured model aggregation for multi institutional healthcare internet of things networks. [PDF]
Sengan S, Shieh CS.
europepmc +1 more source
DRL-based multi-objective task scheduling for edge-cloud computing: latency, energy, and SLA optimisation. [PDF]
Sravan P, Shaik MA.
europepmc +1 more source
Error Mitigation Thresholds in Noisy Random Quantum Circuits. [PDF]
Niroula P, Gopalakrishnan S, Gullans MJ.
europepmc +1 more source
A High-Precision Cooperative Localization Method for UAVs Based on Multi-Condition Constraints. [PDF]
Liu H, Jiang W, Long Q, Xia Q, Chen X.
europepmc +1 more source
Construction Method of Multimodal 4D Imaging Radar Dataset for Three-Dimensional Traffic Scenes. [PDF]
Zhao Z +6 more
europepmc +1 more source
Graph invariants are valuable tools for exploring the complex structures of molecular graphs, which have attracted significant interest from researchers across multiple disciplines. Graph theory plays a crucial role in understanding chemical structures and their real-world applications.
Umar Farooq +5 more
openaire +3 more sources
Fault-Tolerant Metric Dimension of Circulant Graphs [PDF]
Let G be a connected graph with vertex set V(G) and d(u, v) be the distance between the vertices u and v. A set of vertices S=s1, s2, …, sk⊂V(G) is called a resolving set for G if, for any two distinct vertices u, v∈V(G), there is a vertex si∈S such that
Yilun Shang +2 more
exaly +2 more sources

