Results 71 to 80 of about 106,267,892 (346)
ABSTRACT Rice production sustains food security and rural livelihoods across many low‐income countries but remains highly vulnerable to climate‐related hazards, including floods, droughts, salinity intrusion and heat stress, which reduce yields and threaten the long‐term sustainability of rice production.
Apurbo Sarkar +4 more
wiley +1 more source
Les sens procéduraux intersubjectifs de la particule UP
In this paper I adopt the tenets of historical pragmatics and make use of previous scholarly work on the adverbial particle up to present hypotheses on the existence in PDE and historical development of two intersubjective procedural meanings of the ...
Fabienne Toupin
doaj +1 more source
Lasso for hierarchical polynomial models
Abstract The divisibility conditions implicit in a polynomial hierarchy suggest parameter constraints in regression. With this idea, we establish strong and weak hierarchies for both the lasso and relaxed lasso. Our proposal extends prior work on hierarchical lasso, which was mainly concerned with models of degree 2.
H. Maruri‐Aguilar, S. Lunagómez
wiley +1 more source
Reflex seizures and epilepsy surgery: A network approach case‐based exploration
Abstract Context Reflex seizures (RS) are defined by their consistent provocation by specific stimuli, encompassing a broad range from elementary sensory inputs to complex cognitive tasks. While RS are often encountered in clinical practice, their surgical management remains sparsely reported and poorly systematized.
Olivier Aron +6 more
wiley +1 more source
Phase Transitions Related to the Pigeonhole Principle [PDF]
Since Jeff Paris introduced them in the late seventies [Par78], densities turned out to be useful for studying independence results. Motivated by their simplicity and surprising strength we investigate the combinatorial complexity of two such densities which are strongly related to the pigeonhole principle.
Michiel De Smet, Andreas Weiermann
openaire +2 more sources
The Strong Nash‐Williams Orientation Theorem for Rayless Graphs
ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley +1 more source
Most primitive groups are full automorphism groups of edge-transitive hypergraphs [PDF]
We prove that, for a primitive permutation group G acting on a set X of size n, other than the alternating group, the probability that Aut (X,YG) = G for a random subset Y of X, tends to 1 as n → ∞.
Cameron, Peter Jephson +2 more
core +1 more source
ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source
Data Set Formation Method for Checking the Quality of Learning Language Models of the Transitive Relation in the Logical Conclusion Problem Context [PDF]
Andriy Berko +2 more
openalex +1 more source
ABSTRACT Lovász et al. proved that every six‐edge‐connected graph has a nowhere‐zero three‐flow. In fact, they proved a more technical statement, which says that there exists a nowhere‐zero three‐flow that extends the flow prescribed on the incident edges of a single vertex z $z$ with bounded degree. We extend this theorem of Lovász et al.
Arnbjörg Soffía Árnadóttir +5 more
wiley +1 more source

