نتایج جستجو برای: valency

تعداد نتایج: 1518  

1996
Dragan Maru

An innnite familiy of 1 2-transitive graphs of valency 4 with alternating cycles of length 4 is given. Besides, an innnite family of 1 2-transitive graphs of valency 4 with vertex stabilizer isomorphic to Z 2 Z 2 , is constructed.

Journal: :Current opinion in cell biology 2003
Christopher V Carman Timothy A Springer

Integrins play critical roles in development, wound healing, immunity and cancer. Central to their function is their unique ability to modulate dynamically their adhesiveness through both affinity- and valency-based mechanisms. Recent advances have shed light on the structural basis for affinity regulation and on the signaling mechanisms responsible for both affinity and valency modes of regula...

2015
Radek Cech Ján Macutek Michaela Koscová

This paper investigates the relation between the number of full valency frames (we do not distinguish between complements and optional adjuncts, both are taken into account) of a verb and the number of its synonyms. It is shown that for Czech verbs from the Prague Dependency Treebank it holds “the greater the full valency of a verb, the more synonyms the verb has”.

1988
Rudi Gebruers

This paper describes a valency model, developed within the Belgian METAL project, aimed at enhancing the modularity and multilinguality of the METAL system. The introduction provides background, section 1 discusses the existing valency framework, and section 2 presents the alternative model. The final section deals with some results and problems with this model.

Journal: :Combinatorica 1981
Miklós Ajtai Paul Erdös János Komlós Endre Szemerédi

a?nl(t+1) where a denotes the maximum size of an independent set in G. We improve this bound for graphs containing no large cliques. 0. Notation n=n(G)=number of vertices of the graph G e=e(G)=number of edges of G h=h(G)=number of triangles in G deg (P)=valency (degree) of the vertex P deg, (P) = triangle-valency of P=number of triangles in G adjacent to P t=t(G)=n f deg (P) = 2eln = average va...

Journal: :Philosophical transactions. Series A, Mathematical, physical, and engineering sciences 2008
J M Herrera A Bachschmidt F Villain A Bleuzen V Marvaud W Wernsdorfer M Verdaguer

Prussian blue (PB) is a well-known archetype of mixed valency systems. In magnetic PB analogues {CxAy[B(CN)6]z}.nH2O (C alkali cation, A and B transition metal ions) and other metallic cyanometallates {Cx(AL)y[B(CN)8]z}.nH2O (L ligand), the presence of two valency states in the solid (either A-B, or A-A' or B-B') is crucial to get original magnetic properties: tunable high Curie temperature mag...

2014
Anna Vernerová Václava Kettnerová Markéta Lopatková

Valency lexicons typically describe only unmarked usages of verbs (the active form); however verbs prototypically enter different surface structures. In this paper, we focus on the so-called diatheses, i.e., the relations between different surface syntactic manifestations of verbs that are brought about by changes in the morphological category of voice, e.g., the passive diathesis. The change i...

2016
Natalia Klyueva Vladislav Kuboň

In this paper, we focus on the incorporation of a valency lexicon into TectoMT system for Czech-Russian language pair. We demonstrate valency errors in MT output and describe how the introduction of a lexicon influenced the translation results. Though there was no impact on BLEU score, the manual inspection of concrete cases showed some improvement.

2002
Rudi Gebruers

This paper describes a valency model, developed within the Belgian METAL project, aimed at enhancing the modularity and multilinguality of the METAL system. The introduction provides background, section 1 discusses the existing valency framework, and section 2 presents the alternative model. The final section deals with some results and problems with this model.

2017
Gabriel Verret

One version of the polycirculant conjecture states that every vertex-transitive graph has a non-identity semiregular automorphism that is, a non-identity automorphism whose cycles all have the same length. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open valency.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید