Results 111 to 120 of about 34,680 (295)

GraphReco: Probabilistic Structure Recognition for Chemical Molecules

ChemistryOpen, EarlyView.
Molecule structure images are unfriendly for machine understanding, blocking productivity improvements in chemical data mining, drug discovery, and many other fields. We present a rule‐based probabilistic Optical Chemical Structure Recognition model to explain and tackle the ambiguity challenges in graph assembly.
Haidong Wang, Yuncheng Yu, Jyh‐Charn Liu   +2 more
wiley   +1 more source

Network‐assisted protein identification and data interpretation in shotgun proteomics

Molecular Systems Biology, 2009
Protein assembly and biological interpretation of the assembled protein lists are critical steps in shotgun proteomics data analysis. Although most biological functions arise from interactions among proteins, current protein assembly pipelines treat ...
Jing Li, Lisa J Zimmerman, Byung‐Hoon Park, David L Tabb, Daniel C Liebler, Bing Zhang   +5 more
doaj   +1 more source

Farmers' participation in European Regional Platforms on Coexistence between People and Large Carnivores: Perceived conflict, stakeholder interaction, and evaluation of participatory processes

People and Nature, EarlyView.
Abstract Although there have been several initiatives to establish and support participatory processes on large carnivores based on multi‐stakeholder governance at the regional level in Europe, empirical evidence for their evaluation is still lacking. We employed a survey, which was administered to farmers and other stakeholder groups (e.g.
Tasos Hovardas, Katrina Marsden, Valeria Salvatori   +2 more
wiley   +1 more source

Clique roots of K4-free chordal graphs

Electronic Journal of Graph Theory and Applications, 2019
The clique polynomial C(G, x) of a finite, simple and undirected graph G = (V, E) is defined as the ordinary generating function of the number of complete subgraphs of G. A real root of C(G, x) is called a clique root of the graph G.
Hossein Teimoori Faal
doaj   +1 more source

Clique Cover Width and Clique Sum

, 2015
For a clique cover $C$ in the undirected graph $G$, the clique cover graph of $C$ is the graph obtained by contracting the vertices of each clique in $C$ into a single vertex. The clique cover width of G, denoted by $CCW(G)$, is the minimum value of the bandwidth of all clique cover graphs of $G$. When $G$ is the clique sum of $G_1$ and $G_2$, we prove
openaire   +2 more sources

Polychromatic cliques

Discrete Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hell, Pavol, Montellano-Ballesteros, Juan José   +1 more
openaire   +1 more source

Location‐Assisted Graph‐Based User Scheduling in Multi‐User MIMO LEO NTN Systems

International Journal of Satellite Communications and Networking, EarlyView.
ABSTRACT This paper addresses user clustering and scheduling for multi‐user MIMO low Earth orbit nonterrestrial network systems in full frequency reuse. Since the number of on‐ground user terminals is usually much higher than the number of on‐board LEO satellite antennas, user scheduling becomes a fundamental task.
Bilal Ahmad, Daniel Gaetano Riviello, Bruno De Filippo, Alessandro Guidotti, Alessandro Vanelli‐Coralli   +4 more
wiley   +1 more source

New venture team stability and long‐run organizational growth

Strategic Entrepreneurship Journal, EarlyView.
Abstract Research Summary We explore the impact of new venture team (NVT) stability on long‐run organizational growth. With an instrumental variable design, we leverage a matched employer‐employee dataset of all Danish new ventures from 1981 to 1997. We find strong evidence that NVT stability has a positive effect on organizational growth in employees ...
Jerry Guo, Anders Frederiksen, Lars Frederiksen   +2 more
wiley   +1 more source

Finding One's Place: ESL Teachers' Experiences of Language and Identity in the School Spaces of Quebec

TESOL Quarterly, EarlyView.
Abstract This study investigates how English as a Second Language (ESL) teachers navigate their professional and linguistic identities within Quebec's complex linguistic landscape. Drawing on critical approaches to conceptualizing space, we examine physical and metaphorical spaces in schools as sites of identity negotiation and community building. Data
Philippa Parks, Caroline Riches, Katherine Hardin   +2 more
wiley   +1 more source

Maximizing Cliques in Shellable Clique Complexes

, 2018
In extremal graph theory, the problem of finding the elements of a given class of graphs which contain the most cliques traces its routes back to Tur n's famous theorem. We consider the implications of the connectivity property of simplicial complexes known as shellability on clique complexes associated with graphs.
openaire   +2 more sources