Block Design Games

1961 ◽  
Vol 13 ◽  
pp. 110-128 ◽  
Author(s):  
A. J. Hoffman ◽  
Moses Richardson
Keyword(s):  
Linear Programming ◽  
Graph Theory ◽  
Network Flows ◽  
Automorphism Groups ◽  
Block Design ◽  
The Other ◽  
Block Designs ◽  
Simple Games ◽  
Extensive Family ◽  
Natural Way

In this paper, we define and begin the study of an extensive family of simple n-person games based in a natural way on block designs, and hitherto for the most part unexplored except for the finite projective games (13). They should serve at least as a proving ground for conjectures about simple games. It is shown that many of these games are not strong and that many do not possess main simple solutions. In other cases, it is shown that they have no equitable main simple solution, that is, one in which the main simple vector has equal components. On the other hand, the even-dimensional finite projective games PG(2s, pn) with s > 1 possess equitable main simple solutions, although they are not strong either. These results are obtained by means of the study of the possible blocking coalitions. Interpretations in terms of graph theory, network flows, and linear programming are discusssed, as well as k-stability, automorphism groups, and some unsolved problems.

Performance of Senile and Healthy Aged Persons on the Bip Bender Test

1969 ◽  
Vol 28 (3) ◽  
pp. 695-698 ◽  
Author(s):  
Arthur Canter ◽  
John J. Straumanis
Keyword(s):  
Brain Damage ◽  
Block Design ◽  
The Other ◽  
Block Designs ◽  
Healthy Elderly ◽  
Other Hand ◽  
Organic Brain

The standard Bender test and its repetition on Canter's BIP paper along with the WAIS Vocabulary and Block Designs were administered to 16 senile and 17 healthy elderly Ss. The defects of the senile Ss were clearly revealed by the tests but the conventional use of Bender error scores and the discrepancy between Vocabulary and Block Design scores would also identify at least a fourth of the healthy elderly as having mild to moderate deficit consistent with organic brain damage. On the other hand, the BIP reflected the normal perceptuomotor performance of the healthy Ss while retaining sensitivity to the degree of organicity of the senile Ss.

scholarly journals Block Design-Based Asynchronous Neighbor Discovery Protocol for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Sangil Choi ◽  
Wooksik Lee ◽  
Teukseob Song ◽  
Jong-Hoon Youn
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Simulation Study ◽  
Mathematical Proof ◽  
Block Design ◽  
Wireless Sensor ◽  
Neighbor Discovery ◽  
Block Designs ◽  
Worst Case ◽  
Neighbor Discovery Protocol

Neighbor discovery is a significant research topic in wireless sensor networks. After wireless sensor devices are deployed in specific areas, they attempt to determine neighbors within their communication range. This paper proposes a new Block design-based Asynchronous Neighbor Discovery protocol for sensor networks calledBAND. We borrow the concept of combinatorial block designs for neighbor discovery. First, we summarize a practical challenge and difficulty of using the original block designs. To address this challenge, we create a new block generation technique for neighbor discovery schedules and provide a mathematical proof of the proposed concept. A key aspect of the proposed protocol is that it combines two block designs in order to construct a new block for neighbor discovery. We analyze the worst-case neighbor discovery latency numerically between our protocol and some well-known protocols in the literature. Our protocol reveals that the worst-case latency is much lower than others. Finally, we evaluate the performance ofBANDand existing representative protocols through the simulation study. The results of our simulation study show that the average and maximum latency ofBANDis about 40% lower than that of existing protocols. Furthermore,BANDspends approximately 30% less energy than others during the neighbor discovery process.

scholarly journals Quantification of Avoidable Yield Losses in Oilseed Brassica Caused by Insect Pests

2011 ◽  
Vol 51 (1) ◽  
pp. 38-43 ◽  
Author(s):  
Jagdev Kular ◽  
Sarwan Kumar
Keyword(s):  
Seed Yield ◽  
Yield Loss ◽  
Insect Pests ◽  
Block Design ◽  
Maximum Yield ◽  
The Other ◽  
Yield Losses ◽  
Eruca Sativa ◽  
Mustard Aphid ◽  
Randomized Block Design

Quantification of Avoidable Yield Losses in OilseedBrassicaCaused by Insect PestsA six year field study was conducted from 2001-2002 to 2006-2007 at Punjab Agricultural University, Ludhiana, India to study the losses in seed yield of differentBrassicaspecies (B. juncea, B. napus, B. carinata, B. rapaandEruca sativa) by the infestation of insect pests. The experiment was conducted in two different sets viz. protected/sprayed and unprotected, in a randomized block design, with three replications. Data on the infestation of insect pests, and seed yield were recorded at weekly intervals and at harvest, respectively. The loss in seed yield, due to mustard aphid and cabbage caterpillar, varied from 6.5 to 26.4 per cent.E. sativasuffered the least loss in seed yield and harboured the minimum population of mustard aphid (2.1 aphids/plant) and cabbage caterpillar (2.4 larvae/plant). On the other hand,B. carinatawas highly susceptible to the cabbage caterpillar (26.2 larvae/plant) and suffered the maximum yield loss (26.4%).

On the SL(2, C)-representation rings of free abelian groups

2018 ◽  
Vol 167 (02) ◽  
pp. 229-247
Author(s):  
TAKAO SATOH
Keyword(s):  
Abelian Group ◽  
Upper Bound ◽  
Automorphism Groups ◽  
Free Abelian Group ◽  
Abelian Groups ◽  
Free Groups ◽  
The Other ◽  
Subsequent Research ◽  
Representation Rings ◽  
Free Abelian Groups

AbstractIn this paper, we study “the ring of component functions” of SL(2, C)-representations of free abelian groups. This is a subsequent research of our previous work [11] for free groups. We introduce some descending filtration of the ring, and determine the structure of its graded quotients.Then we give two applications. In [30], we constructed the generalized Johnson homomorphisms. We give an upper bound on their images with the graded quotients. The other application is to construct a certain crossed homomorphisms of the automorphism groups of free groups. We show that our crossed homomorphism induces Morita's 1-cocycle defined in [22]. In other words, we give another construction of Morita's 1-cocyle with the SL(2, C)-representations of the free abelian group.

Least Absolute Regression Residuals: Analyses of Block Designs

1998 ◽  
Vol 83 (3) ◽  
pp. 923-929 ◽  
Author(s):  
Kenneth J. Berry ◽  
Paul W Mielke
Keyword(s):  
Euclidean Geometry ◽  
Block Design ◽  
Latin Square ◽  
Block Designs ◽  
Regression Residuals

Residuals obtained from least sum of absolute deviations regression are analyzed by a procedure consistent with Euclidean geometry. Applications to a one-way block design, a two-way block design, and a Latin square design are illustrated and evaluated.

scholarly journals Uji Ketahanan Klon Kentang Hasil Pesilangan Atlantic x Repita terhadap Penyakit Hawar Daun Phytophthora infestans

Agrikultura ◽  
2018 ◽  
Vol 29 (2) ◽  
pp. 100
Author(s):  
Helmi Kurniawan ◽  
Ineu Sulastrini ◽  
Tarkus Suganda
Keyword(s):  
Late Blight ◽  
Phytophthora Infestans ◽  
Field Test ◽  
Block Design ◽  
Environmentally Friendly ◽  
Statistical Test ◽  
The Other ◽  
Resistant Variety ◽  
Resistance Level ◽  
Randomized Block Design

ABSTRACTResistance Test of Potato Clones Derived from Crossing of Atlantic x Repita to Late Blight (Phytophthora infestans)Late blight, incited by Phytophthora infestans is the most destructive disease of potato. The management that is effective and environmentally-friendly is the use of resistant variety. The objective of this study was to test the resistance of the six potato clones (AR 04, AR 05, AR 06, AR 07, AR 08 and AR 09) derived from crossing var. Atlantic x var. Repita to late blight caused by P. infestans. Var. Atlantic, Repita and Granola were used as susceptible, resistant and susceptible but the most-grown variety, respectively. Field test was located in Ciwidey, one of the potato growing center where late blight is endemic since potatoes are continuously grown. The treatments were arranged in a randomized block design with 3 replicates. The result showed that clones AR 07 and AR 08 were more resistant than the other potato clones, but it still below the resistance level var. Repita. However, based on statistical test on the diseases development (AUDPC), clone AR 08 could be categorized as resistant, equal with of the resistance level of var. Repita.Keywords: Potato clones, Rsistance, P. infestansABSTRAKPenyakit hawar daun yang disebabkan Phytopthora infestans merupakan penyakit utama pada tanaman kentang. Pengendalian yang efektif dan ramah lingkungan adalah dengan penanaman varietas tahan. Penelitian ini bertujuan untuk menguji ketahanan 6 klon kentang (AR 4, AR5, AR6, AR7, AR 8, dan AR9) yang merupakan hasil persilangan antara var. Atlantic (produksi tinggi tetapi rentan) dengan var. Repita, sebagai tetua tahan terhadap penyakit hawar daun yang disebabkan oleh P. infestans. Varietas Atlantic, Repita dan Granola digunakan sebagai pembanding. Pengujian ketahanan dilakukan di Ciwidey, yang merupakan salah satu sentra produksi kentang di Jawa Barat dan endemik penyakit hawar daun. Perlakuan ditata menggunakan Rancangan Acak Kelompok dengan 3 ulangan. Hasil penelitian menunjukkan bahwa klon AR 07 dan Klon AR 08 memiliki ketahanan yang lebih baik dibanding klon-klon kentang lainnya, namun tingkat ketahanannya masih di bawah cv Repita. Namun, berdasarkan uji statistik terhadap nilai perkembangan penyakit (AUDPC) klon AR 08 dapat dikategorikan tahan, sama dengan derajat tahan var. Repita.Kata Kunci: Klon kentang, Ketahanan, P. infestans

scholarly journals A SURVEY ON THE AUTOMORPHISM GROUPS OF THE COMMUTING GRAPHS AND POWER GRAPHS

2019 ◽  
pp. 729
Author(s):  
Mahsa Mirzargar
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
The Other ◽  
Power Graph ◽  
Commuting Graph ◽  
Vertex Set ◽  
Delta G ◽  
Nite Group

Let G be a nite group. The power graph P(G) of a group G is the graphwhose vertex set is the group elements and two elements are adjacent if one is a power of the other. The commuting graph \Delta(G) of a group G, is the graph whose vertices are the group elements, two of them joined if they commute. When the vertex set is G-Z(G), this graph is denoted by \Gamma(G). Since the results based on the automorphism group of these kinds of graphs are so sporadic, in this paper, we give a survey of all results on the automorphism group of power graphs and commuting graphs obtained in the literature.

scholarly journals On Division Versus Saturation in Pseudo-Boolean Solving

2019 ◽  
Author(s):  
Stephan Gocht ◽  
Jakob Nordström ◽  
Amir Yehudayoff
Keyword(s):  
Linear Programming ◽  
Cutting Planes ◽  
The Other ◽  
Sat Solving ◽  
Linear Combinations ◽  
Division Rule ◽  
Clause Learning

The conflict-driven clause learning (CDCL) paradigm has revolutionized SAT solving over the last two decades. Extending this approach to pseudo-Boolean (PB) solvers doing 0-1 linear programming holds the promise of further exponential improvements in theory, but intriguingly such gains have not materialized in practice. Also intriguingly, most PB extensions of CDCL use not the division rule in cutting planes as defined in [Cook et al., '87] but instead the so-called saturation rule. To the best of our knowledge, there has been no study comparing the strengths of division and saturation in the context of conflict-driven PB learning, when all linear combinations of inequalities are required to cancel variables. We show that PB solvers with division instead of saturation can be exponentially stronger. In the other direction, we prove that simulating a single saturation step can require an exponential number of divisions. We also perform some experiments to see whether these phenomena can be observed in actual solvers. Our conclusion is that a careful combination of division and saturation seems to be crucial to harness more of the power of cutting planes.

Sign in / Sign up

Export Citation Format

Share Document