Do We Want to Measure the Quality of Care for Vulnerable Older People? The ACOVE Approach. Syracuse Seminar on Aging.

There's limited information available about measuring the quality of medical care that is targeted to the needs of older patients. And there's very limited pressure on the system to provide high quality geriatric care. Why is that? Because the quality measures haven't been adequately developed and implemented, and it's more difficult to measure care for an older sample. Measuring care for ill older adults is complex, because they tend to have multiple medical conditions, and they demonstrate substantial variation in goals for care (Wenger and colleagues 2007). The Assessing Care of Vulnerable Elders (ACOVE) project began in 1998 as a collaboration between RAND Health and Pzizer Inc to develop and apply quality indicators (QIs) for assessment and treatment targeted at vulnerable older persons. The project involved defining and identifying the target population, identifying health conditions that cover much of the medical care provided to this population, developing quality-of-care indicators to measure how well those conditions are being addressed, and applying thoseindicators to determine the actual quality of care received by older adults.health care, medical care, elderly, assessment, geriatrics, gerontology

Saturation numbers in tripartite graphs

Given graphs $H$ and $F$, a subgraph $G\subseteq H$ is an $F$-saturated subgraph of $H$ if $F\nsubseteq G$, but $F\subseteq G+e$ for all $e\in E(H)\setminus E(G)$. The saturation number of $F$ in $H$, denoted $\text{sat}(H,F)$, is the minimum number of edges in an $F$-saturated subgraph of $H$. In this paper we study saturation numbers of tripartite graphs in tripartite graphs. For $\ell\ge 1$ and $n_1$, $n_2$, and $n_3$ sufficiently large, we determine $\text{sat}(K_{n_1,n_2,n_3},K_{\ell,\ell,\ell})$ and $\text{sat}(K_{n_1,n_2,n_3},K_{\ell,\ell,\ell-1})$ exactly and $\text{sat}(K_{n_1,n_2,n_3},K_{\ell,\ell,\ell-2})$ within an additive constant. We also include general constructions of $K_{\ell,m,p}$-saturated subgraphs of $K_{n_1,n_2,n_3}$ with few edges for $\ell\ge m\ge p>0$.Comment: 18 pages, 6 figure

Planar digraphs without large acyclic sets

Given a directed graph, an acyclic set is a set of vertices inducing a subgraph with no directed cycle. In this note we show that there exist oriented planar graphs of order $n$ for which the size of the maximum acyclic set is at most $\lceil \frac{n+1}{2} \rceil$, for any $n$. This disproves a conjecture of Harutyunyan and shows that a question of Albertson is best possible.Comment: 3 pages, 1 figur

Graph Saturation in Multipartite Graphs

Let $G$ be a fixed graph and let ${\mathcal F}$ be a family of graphs. A subgraph $J$ of $G$ is ${\mathcal F}$-saturated if no member of ${\mathcal F}$ is a subgraph of $J$, but for any edge $e$ in $E(G)-E(J)$, some element of ${\mathcal F}$ is a subgraph of $J+e$. We let $\text{ex}({\mathcal F},G)$ and $\text{sat}({\mathcal F},G)$ denote the maximum and minimum size of an ${\mathcal F}$-saturated subgraph of $G$, respectively. If no element of ${\mathcal F}$ is a subgraph of $G$, then $\text{sat}({\mathcal F},G) = \text{ex}({\mathcal F}, G) = |E(G)|$. In this paper, for $k\ge 3$ and $n\ge 100$ we determine $\text{sat}(K_3,K_k^n)$, where $K_k^n$ is the complete balanced $k$-partite graph with partite sets of size $n$. We also give several families of constructions of $K_t$-saturated subgraphs of $K_k^n$ for $t\ge 4$. Our results and constructions provide an informative contrast to recent results on the edge-density version of $\text{ex}(K_t,K_k^n)$ from [A. Bondy, J. Shen, S. Thomass\'e, and C. Thomassen, Density conditions for triangles in multipartite graphs, Combinatorica 26 (2006), 121--131] and [F. Pfender, Complete subgraphs in multipartite graphs, Combinatorica 32 (2012), no. 4, 483--495].Comment: 16 pages, 4 figure

Kinematic Analysis and Trajectory Planning of the Orthoglide 5-axis

The subject of this paper is about the kinematic analysis and the trajectory planning of the Orthoglide 5-axis. The Orthoglide 5-axis a five degrees of freedom parallel kinematic machine developed at IRCCyN and is made up of a hybrid architecture, namely, a three degrees of freedom translational parallel manip-ulator mounted in series with a two degrees of freedom parallel spherical wrist. The simpler the kinematic modeling of the Or-thoglide 5-axis, the higher the maximum frequency of its control loop. Indeed, the control loop of a parallel kinematic machine should be computed with a high frequency, i.e., higher than 1.5 MHz, in order the manipulator to be able to reach high speed motions with a good accuracy. Accordingly, the direct and inverse kinematic models of the Orthoglide 5-axis, its inverse kine-matic Jacobian matrix and the first derivative of the latter with respect to time are expressed in this paper. It appears that the kinematic model of the manipulator under study can be written in a quadratic form due to the hybrid architecture of the Orthoglide 5-axis. As illustrative examples, the profiles of the actuated joint angles (lengths), velocities and accelerations that are used in the control loop of the robot are traced for two test trajectories.Comment: Appears in International Design Engineering Technical Conferences \& Computers and Information in Engineering Conference, Aug 2015, Boston, United States. 201

Isoperimetric inequalities of Euclidean type in metric spaces

No Abstrac