Results 121 to 130 of about 8,223,452 (320)
Compact Independent Sets and Haar Measure [PDF]
Proceedings of the American Mathematical Society, 1972 This is proved: Let H be a closed nondiscrete sub- group of an LCA group G, x E G, and Ec Ga a-compact independ- ent subset of G; then Hn(x+G,E) has zero H-Haar measure. This generalizes a result in Rudin, Foiurier analysis on groups; the proof here is quite different from that given by Rudin. THEOREM 1.
openaire +2 more sources
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set [PDF]
, 2010 An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \ D has at least one neighbor in D and D is an independent set, i.e. no two vertices of D are adjacent in G. Finding a minimum independent dominating
Gaspers, Serge, Liedloff, Mathieu
core
A Cre‐dependent lentiviral vector for neuron subtype‐specific expression of large proteins
FEBS Letters, EarlyView.We designed a versatile and modular lentivector comprising a Cre‐dependent switch and self‐cleaving 2A peptide and tested it for co‐expression of GFP and a 2.8 kb gene of interest (GOI) in mouse cortical parvalbumin (PV+) interneurons and midbrain dopamine (TH+) neurons.
Weixuan Xue +6 more
wiley +1 more source
The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity
FEBS Letters, EarlyView.The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley +1 more source
New Upper Bounds on the Number of Maximum Independent Sets in a Graph
AxiomsAn independent set in a graph comprises vertices that are not adjacent to one another, whereas a clique consists of vertices where all pairs are adjacent.
Vadim E. Levit, Elizabeth J. Itskovich
doaj +1 more source
A note on the transmission feasibility problem in networks
Open Physics, 2018 In the networking designing phase, the network needs to be built according to certain indicators to ensure that the network has the ideal functions and can work smoothly.
Gao Wei, Zhang Yunqing, Chen Yaojun
doaj +1 more source
Solving independent set problems with photonic quantum circuits. [PDF]
Proc Natl Acad Sci U S A, 2023 Yin XF +12 more
europepmc +1 more source
Matroid Valuation on Independent Sets
Journal of Combinatorial Theory, Series B, 1997 Recently \textit{A. W. M. Dress} and \textit{W. Wenzel} [Adv. Math. 93, No. 2, 214-250 (1992; Zbl 0754.05027)] introduced the concept of valuated matroid in terms of a quantitative extension of the basis exchange axiom for matroids. This paper gives two sets of cryptomorphically equivalent axioms of valuated matroids in terms of a function defined on ...
openaire +2 more sources
The role and implications of mammalian cellular circadian entrainment
FEBS Letters, EarlyView.At their most fundamental level, mammalian circadian rhythms occur inside every individual cell. To tell the correct time, cells must align (or ‘entrain’) their circadian rhythm to the external environment. In this review, we highlight how cells entrain to the major circadian cues of light, feeding and temperature, and the implications this has for our
Priya Crosby
wiley +1 more source
Molecular bases of circadian magnesium rhythms across eukaryotes
FEBS Letters, EarlyView.Circadian rhythms in intracellular [Mg2+] exist across eukaryotic kingdoms. Central roles for Mg2+ in metabolism suggest that Mg2+ rhythms could regulate daily cellular energy and metabolism. In this Perspective paper, we propose that ancestral prokaryotic transport proteins could be responsible for mediating Mg2+ rhythms and posit a feedback model ...
Helen K. Feord, Gerben van Ooijen
wiley +1 more source