This article analyzes the interactions through which primary-care nurses and patients accomplish patient weighing. The analysis is based on videotaped nurse-adult patient interactions in clinics in the area of Southern California. Detailed examination of co-participants' naturally situated weighing conduct shows that parties recurrently deliver utterances that go beyond that required to accompl...

The problem of non-intrusive uncertainty quantification is studied, with a focus on two computational fluid dynamics cases. A collocation method using quadrature or cubature rules is applied, where the simulations are selected deterministically. A one-dimensional quadrature rule is proposed which is nested, symmetric, and has positive weights. The rule is based on the removal of nodes from an e...

Given the class of symmetric discrete weight neural networks with finite state set (0, l}, we prove that there exist iteration modes under these networks which allow to simulate in linear space arbitrary neural networks (non-necessarily symmetric). As a particular result we prove that an arbitrary symmetric neural network can be simulated by a symmetric one iterated sequentially, with some nega...

The Fq code of a symmetric (v,k,λ )design is a subspace generated by the incidence matrix of the symmetric design. In this paper, we examine the minimality of the codewords in the dual codeC⊥ of the binary codeC of a symmetric (v,k,λ )− design. So, we use the relationship between the minimum and maximum nonzero weights in the dual code C⊥ with the number of Fq.

This article investigates discrete-time matrix-weighted consensus of multi-agent networks over undirected and connected graphs. We first present protocols for the agents in common symmetric matrix weights with possibly different update rates switching network topologies. A special type non-symmetric matrix-weights that can render several control scenarios such as ones scaled/rotated updates aff...

We show that, by using multiplicative weights in a game-theoretic thought experiment (and an important convexity result on the composition of multiplicative weights with the relative entropy function), a symmetric bimatrix game (that is, a bimatrix matrix wherein the payoff matrix of each player is the transpose of the payoff matrix of the other) either has an interior symmetric equilibrium or ...

We report exact results on the enumeration of close-packed dimers on a finite kagome lattice with general asymmetric dimer weights under periodic and cylindrical boundary conditions. For symmetric dimer weights, the resulting dimer generating functions reduce to very simple expressions, and we show how the simple expressions can be obtained from the consideration of a spin-variable mapping.

we investigate buchbaum and eisenbud's construction of the second symmetric power $s_r(x)$ of a chain complex $x$ of modules over a commutative ring $r$. we state and prove a number of results from the folklore of the subject for which we know of no good direct references. we also provide several explicit computations and examples. we use this construction to prove the following ...

The question of controllability of natural and man-made network systems has recently received considerable attention. In the context of the human brain, the study of controllability may not only shed light into the organization and function of different neural circuits, but also inform the design and implementation of minimally invasive yet effective intervention protocols to treat neurological...

We consider the problem of embedding the semi-ring of Schur-positive symmetric polynomials into its analogue for the classical types B/C/D. If we preserve highest weights and add the additional Lie-theoretic parity assumption that the weights in images of Schur functions lie in a single translate of the root lattice, there are exactly two solutions. These naturally extend the Kirillov–Reshetikh...