Results 11 to 20 of about 849,929 (252)

Intersection Numbers For Subspace Designs [PDF]

open access: yesJournal of Combinatorial Designs, 2014
Abstract Intersection numbers for subspace designs are introduced and q ‐analogs of the Mendelsohn and Köhler equations are given. As an application, we are able to determine the intersection structure of a putative q ‐analog of the ...
Kiermaier, Michael   +1 more
openaire   +4 more sources

Open Design at the Intersection of Making and Manufacturing [PDF]

open access: yesProceedings of the 2017 CHI Conference Extended Abstracts on Human Factors in Computing Systems, 2017
Copyright © 2017 by the Association for Computing Machinery, Inc. (ACM). This one-day workshop aims to consider the opportunities for HCI at the intersection of maker culture and professional, industrial manufacturing. In particular, we are interested in exploring how the concept of open design could help support productive interactions between ...
David Philip Green   +10 more
openaire   +3 more sources

Intersecting Designs

open access: yesJournal of Combinatorial Theory, Series A, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yair Caro, Raphael Yuster
openaire   +1 more source

Breastfeeding experiences in urban spaces. Intersectional analysis

open access: yes, 2020
This study explores commonalities and differences on experience of breastfeeding in public spaces among different demographic groups, specifically migrant mothers.
Woodcock, Andree; id_orcid   +3 more
core   +4 more sources

The intersection problem for star designs

open access: yesDiscrete Mathematics, 1998
If \(G\) is a simple graph without isolated vertices, \(B\) is called a \(G\)-design if \(B\) is a finite set of graphs, each isomorphic to \(G\), with the property that for every pair \(u,v\) of vertices in the union of their vertex set, there is at most one graph in \(B\) of which \(uv\) is an edge. If \(H\) is the union of the graphs in \(B\), \(B\)
Billington, EJ, Hoffman, DG
openaire   +3 more sources

5-Designs with three intersection numbers

open access: yesJournal of Combinatorial Theory, Series A, 1995
It is proved that the Witt 5-(24,8,1) design is the unique 5-\((v, k, \lambda)\) design with exactly three intersection numbers if \(k- 1\) is a prime or \(\lambda\leq 4\) or at least two intersection numbers are less than 5.
Yury J. Ionin, Mohan S. Shrikhande
openaire   +3 more sources

Open Design, Inclusivity and the Intersections of Making [PDF]

open access: yesProceedings of the 2018 Designing Interactive Systems Conference, 2018
This paper presents insights from an ethnographic study with a diverse population of makers in the city of Newcastle upon Tyne, UK. By engaging individuals, groups and communities who 'make' in different contexts, we reveal under-explored perspectives on 'making' and highlight points of intersection between different kinds of making across the city. We
David Green, David Stanley Kirk
openaire   +1 more source

t-Designs with few intersection numbers

open access: yesDiscrete Mathematics, 1991
The authors present a method to obtain new \(i\)-designs from \(t\)-designs with few intersection numbers provided some numerical conditions are met. Specifically, let \(B\) be a fixed block of a \(t-(v,k,\lambda)\) design having \(j\) distinct intersection numbers. Repeated blocks are allowed. Let \(x\) be an intersection number.
Alexander Pott, Mohan S. Shrikhande
openaire   +2 more sources

Intersections in HCI, Design and Dementia

open access: yesCompanion Publication of the 2019 on Designing Interactive Systems Conference 2019 Companion, 2019
Participatory approaches are used to design interactive systems, services and products to improve their impact and usability. However, these approaches are not always suitable for people with cognitive limitations such as dementia. This workshop will focus on participatory approaches for working with people living with dementia, challenge assumptions ...
Rens Brankaert   +5 more
openaire   +3 more sources

The connectivity of the block-intersection graphs of designs [PDF]

open access: yesDesigns, Codes and Cryptography, 1993
In the paper it is shown that the vertex connectivity of the block-intersection graph of a BIBD equals its minimum degree.
Donovan R. Hare, William McCuaig
openaire   +2 more sources

Home - About - Disclaimer - Privacy