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

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

Journal: :Automatica 2010
Minghui Zhu Sonia Martínez

Wepropose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely on the input-to-output stability properties of static average consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set ...

Journal: :CoRR 2012
Zhigang Cao Mingmin Yang Xinglong Qu Xiaoguang Yang

We study an extension of the DeGroot model where part of the players may be rebels. The updating rule for rebels is quite different with that of normal players (which are referred to as conformists): at each step a rebel first takes the opposite value of the weighted average of her neighbors’ opinions, i.e. 1 minus that average (the opinion space is assumed to be [0,1] as usual), and then updat...

2015
A. F. Izmailov

This note presents an implicit function theorem for generalized equations, simultaneously generalizing Robinson’s implicit function theorem for strongly regular generalized equations and Clarke’s implicit function theorem for equations with Lipschitz-continuous mappings.

2017
Mohammad Hamidi Arsham Borumand Saeid Violeta Leoreanu-Fotea

The purpose of this paper is to define a new equivalence relation τ∗ on divisible hypergroups and to show that this relation is the smallest strongly regular relation (the fundamental relation) on commutative divisible hypergroups. We show that τ∗ ̸= β∗, τ∗ ̸= γ∗ and, we define a divisible hypergroup on every nonempty set. We show that the quotient of a finite divisible hypergroup by τ∗ is the tr...

Journal: :Australasian J. Combinatorics 2014
Antonio Cossidente Angelo Sonnino

We provide a new construction of the strongly regular graphs associated with the two sporadic simple groups M22 and HS. Further, we give some new constructions of other known strongly regular graphs by taking the orbits of a certain subgroup of M22 on the planes of the Hermitian variety H(5, 4). These geometric constructions can be used to produce cap codes with large parameters and automorphis...

Journal: :Combinatorica 1996
Van H. Vu

For every n positive integer we show the construction of a strongly regular graph of order at most 2 which contains every graph of ordered n as a subgraph. The estimation concerning the construction is best possible.

2010
Catia Cucchiarini Joost van Doremalen Helmer Strik

Various studies have investigated the temporal aspects of non­ native speech and their relation to perceived fluency, because fluency constitutes an important aspect of second language proficiency. For this purpose it is important to determine which measures are most strongly correlated with perceived fluency and how these measures vary. In the present study objective measures related to percei...

Journal: :Electr. J. Comb. 2000
Edward Spence

In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-investigated these graphs and have now been able to determine them all, and so complete the classification. We have discovered that there are precisely 28 non-isomorphic (40, 12, 2, 4) strongly regular graphs. The one tha...

Journal: :J. Comb. Theory, Ser. B 2012
Tao Feng Qing Xiang

Article history: Received 24 August 2010 Available online 8 November 2011

Journal: :Ars Comb. 2013
Ilaria Cardinali Bart De Bruyn

Let ∆ be one of the dual polar spaces DQ(8, q), DQ−(7, q), and let e : ∆ → Σ denote the spin-embedding of ∆. We show that e(∆) is a two-intersection set of the projective space Σ. Moreover, if ∆ ∼= DQ−(7, q), then e(∆) is a (q + 1)-tight set of a nonsingular hyperbolic quadric Q(7, q) of Σ ∼= PG(7, q). This (q + 1)-tight set gives rise to more examples of (q + 1)-tight sets of hyperbolic quadri...

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

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