Results 121 to 130 of about 22,397,908 (376)
Network Identification for Diffusively-Coupled Systems with Minimal Time Complexity
The theory of network identification, namely identifying the (weighted) interaction topology among a known number of agents, has been widely developed for linear agents.
Sharf, Miel, Zelazo, Daniel
core
On the Complexity of Branching-Time Logics [PDF]
We classify the complexity of the satisfiability problem for extensions of CTL and UB. The extensions we consider are Boolean combinations of path formulas, fairness properties, past modalities, and forgettable past. Our main result shows that satisfiability for CTL with all these extensions is still in 2-EXPTIME, which strongly contrasts with the ...
openaire +3 more sources
Glutaredoxin (Grx) 3 proteins contain a thioredoxin domain and one to three class II Grx domains. These proteins play a crucial role in iron homeostasis in eukaryotic cells. In human Grx3, at least one of the two Grx domains, together with the thioredoxin domain, is essential for its function in iron metabolism.
Laura Magdalena Jordt+4 more
wiley +1 more source
Rapid equivalent simplification algorithm for complex underground mine ventilation networks
Mine ventilation network equivalent simplification technology is a powerful tool for analyzing fluid networks. However, with the increasing number of tunnels in mine ventilation networks, their complexity also rises, challenging the precision and ...
Jinzhang JIA+3 more
doaj +1 more source
This article proposes the tracking algorithm based on density clustering of time scale and mesoscale eddy of Kalman filtering using the fused SLA data of altimeter.
Ji-Tao Li, Yong-Quan Liang
doaj +1 more source
Learning Sparse Polymatrix Games in Polynomial Time and Sample Complexity [PDF]
We consider the problem of learning sparse polymatrix games from observations of strategic interactions. We show that a polynomial time method based on $\ell_{1,2}$-group regularized logistic regression recovers a game, whose Nash equilibria are the ...
Ghoshal, Asish, Honorio, Jean
core +8 more sources
Low-Complexity Iterative Detection for Orthogonal Time Frequency Space Modulation
We elaborate on the recently proposed orthogonal time frequency space (OTFS) modulation technique, which provides significant advantages over orthogonal frequency division multiplexing (OFDM) in Doppler channels.
Hong, Yi+4 more
core +1 more source
Dimeric pyruvate formate‐lyase cleaves pyruvate using a radical‐based mechanism. G734 serves as a radical storage location, and the radical is transferred to the catalytic C419 residue. Mutation of the C418‐C419 pair causes loss of enzyme activity, but does not impede radical introduction onto G734. Therefore, cis‐ but not trans‐radical transfer occurs
Michelle Kammel+2 more
wiley +1 more source
Total Outer-Independent Domination Number: Bounds and Algorithms
In graph theory, the study of domination sets has garnered significant interest due to its applications in network design and analysis. Consider a graph G(V,E); a subset of its vertices is a total dominating set (TDS) if, for each x∈V(G), there exists an
Paul Bosch+3 more
doaj +1 more source
To explore the impact of the overexpression of the multidrug‐transporter P‐glycoprotein (ABCB1) on membrane fluidity, we compared the transversal gradient of mobility and microviscosity in plasma membranes of drug‐sensitive Chinese hamster ovary cells (AuxB1) and their multidrug‐resistant derivatives (B30) using the fluorescent n‐(9‐anthroyloxy) fatty ...
Roger Busche+2 more
wiley +1 more source