Measurement of point velocities in turbulent liquid flow

Turbulent water flow velocity distribution using hot-wire anemometer and photographic technique

Solid metabolic waste transport and stowage investigation

The basic Waste Collection System (WCS) design under consideration utilized air flow to separate the stool from the WCS user and to transport the fecal material to a slinger device for subsequent deposition on a storage bowel. The major parameters governing stool separation and transport were found to be the area of the air inlet orifices, the configuration of the air inlet orifice and the transport air flow. Separation force and transport velocity of the stool were studied. The developed inlet orifice configuration was found to be an effective design for providing fecal separation and transport. Simulated urine tests and female user tests in zero gravity established air flow rates between 0.08 and 0.25 cu sm/min (3 and 9 scfm) as satisfactory for entrapment, containment and transport of urine using an urinal. The investigation of air drying of fecal material as a substitute for vacuum drying in a WCS breadboard system showed that using baseline conditions anticipated for the shuttle cabin ambient atmosphere, flow rates of 0.14 cu sm/min (5 cfm) were adequate for drying and maintaining biological stability of the fecal material

Accurate measurement of telemetry performance

Performance of high rate telemetry stations used in the Deep Space Network is verified. Measurement techniques are discussed

The Minimum Wiener Connector

The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector: given a connected graph $G=(V,E)$ and a set $Q\subseteq V$ of query vertices, find a subgraph of $G$ that connects all query vertices and has minimum Wiener index. We show that The Minimum Wiener Connector admits a polynomial-time (albeit impractical) exact algorithm for the special case where the number of query vertices is bounded. We show that in general the problem is NP-hard, and has no PTAS unless $\mathbf{P} = \mathbf{NP}$. Our main contribution is a constant-factor approximation algorithm running in time $\widetilde{O}(|Q||E|)$. A thorough experimentation on a large variety of real-world graphs confirms that our method returns smaller and denser solutions than other methods, and does so by adding to the query set $Q$ a small number of important vertices (i.e., vertices with high centrality).Comment: Published in Proceedings of the 2015 ACM SIGMOD International Conference on Management of Dat

Green cities and health: a question of scale?

<p><b>Background:</b> Cities are expanding and accommodating an increasing proportion of the world's population. It is important to identify features of urban form that promote the health of city dwellers. Access to green space has been associated with health benefits at both individual and neighbourhood level. We investigated whether a relationship between green space coverage and selected mortality rates exists at the city level in the USA.</p> <p><b>Methods:</b> An ecological cross-sectional study. A detailed land use data set was used to quantify green space for the largest US cities (n=49, combined population of 43 million). Linear regression models were used to examine the association between city-level ‘greenness’ and city-level standardised rates of mortality from heart disease, diabetes, lung cancer, motor vehicle fatalities and all causes, after adjustment for confounders.</p> <p><b>Results:</b> There was no association between greenness and mortality from heart disease, diabetes, lung cancer or automobile accidents. Mortality from all causes was significantly higher in greener cities.</p> <p><b>Conclusions:</b> While considerable evidence suggests that access to green space yields health benefits, we found no such evidence at the scale of the American city. In the USA, greener cities tend also to be more sprawling and have higher levels of car dependency. Any benefits that the green space might offer seem easily eclipsed by these other conditions and the lifestyles that accompany them. The result merits further investigation as it has important implications for how we increase green space access in our cities.</p&gt

Emotional Strategies as Catalysts for Cooperation in Signed Networks

The evolution of unconditional cooperation is one of the fundamental problems in science. A new solution is proposed to solve this puzzle. We treat this issue with an evolutionary model in which agents play the Prisoner's Dilemma on signed networks. The topology is allowed to co-evolve with relational signs as well as with agent strategies. We introduce a strategy that is conditional on the emotional content embedded in network signs. We show that this strategy acts as a catalyst and creates favorable conditions for the spread of unconditional cooperation. In line with the literature, we found evidence that the evolution of cooperation most likely occurs in networks with relatively high chances of rewiring and with low likelihood of strategy adoption. While a low likelihood of rewiring enhances cooperation, a very high likelihood seems to limit its diffusion. Furthermore, unlike in non-signed networks, cooperation becomes more prevalent in denser topologies.Comment: 24 pages, Accepted for publication in Advances in Complex System

Romantic Partnerships and the Dispersion of Social Ties: A Network Analysis of Relationship Status on Facebook

A crucial task in the analysis of on-line social-networking systems is to identify important people --- those linked by strong social ties --- within an individual's network neighborhood. Here we investigate this question for a particular category of strong ties, those involving spouses or romantic partners. We organize our analysis around a basic question: given all the connections among a person's friends, can you recognize his or her romantic partner from the network structure alone? Using data from a large sample of Facebook users, we find that this task can be accomplished with high accuracy, but doing so requires the development of a new measure of tie strength that we term `dispersion' --- the extent to which two people's mutual friends are not themselves well-connected. The results offer methods for identifying types of structurally significant people in on-line applications, and suggest a potential expansion of existing theories of tie strength.Comment: Proc. 17th ACM Conference on Computer Supported Cooperative Work and Social Computing (CSCW), 201

A Parameterized Centrality Metric for Network Analysis

A variety of metrics have been proposed to measure the relative importance of nodes in a network. One of these, alpha-centrality [Bonacich, 2001], measures the number of attenuated paths that exist between nodes. We introduce a normalized version of this metric and use it to study network structure, specifically, to rank nodes and find community structure of the network. Specifically, we extend the modularity-maximization method [Newman and Girvan, 2004] for community detection to use this metric as the measure of node connectivity. Normalized alpha-centrality is a powerful tool for network analysis, since it contains a tunable parameter that sets the length scale of interactions. By studying how rankings and discovered communities change when this parameter is varied allows us to identify locally and globally important nodes and structures. We apply the proposed method to several benchmark networks and show that it leads to better insight into network structure than alternative methods.Comment: 11 pages, submitted to Physical Review