Common adversaries form alliances: modelling complex networks via anti-transitivity

Anti-transitivity captures the notion that enemies of enemies are friends, and arises naturally in the study of adversaries in social networks and in the study of conflicting nation states or organizations. We present a simplified, evolutionary model for anti-transitivity influencing link formation in complex networks, and analyze the model's network dynamics. The Iterated Local Anti-Transitivity (or ILAT) model creates anti-clone nodes in each time-step, and joins anti-clones to the parent node's non-neighbor set. The graphs generated by ILAT exhibit familiar properties of complex networks such as densification, short distances (bounded by absolute constants), and bad spectral expansion. We determine the cop and domination number for graphs generated by ILAT, and finish with an analysis of their clustering coefficients. We interpret these results within the context of real-world complex networks and present open problems

A soja no Brasil: história e estatística.

Origem e distribuicao no mundo; Introducao e primeiras experiencias no Brasil; Evolucao da producao; Destino da producao; Capacidade de processamento; Portos de embarque; Meios de transporte; Precos recebidos pelos produtores; Custos de producao.bitstream/item/23236/1/Doc21.pd

The Cop Number of the One-Cop-Moves Game on Planar Graphs

Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph's edges with perfect information about each other's positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aigner and Frommer established that in every connected planar graph, three cops are sufficient to capture a single robber. In this paper, we consider a recently studied variant of the cops-and-robbers game, alternately called the one-active-cop game, one-cop-moves game or the lazy-cops-and-robbers game, where at most one cop can move during any round. We show that Aigner and Frommer's result does not generalise to this game variant by constructing a connected planar graph on which a robber can indefinitely evade three cops in the one-cop-moves game. This answers a question recently raised by Sullivan, Townsend and Werzanski.Comment: 32 page

Hyperopic Cops and Robbers

We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds and other properties of this parameter. We characterize the cop-win graphs for this variant, along with graphs with the largest possible hyperopic cop number. We analyze the cases of graphs with diameter 2 or at least 3, focusing on when the hyperopic cop number is at most one greater than the cop number. We show that for planar graphs, as with the usual cop number, the hyperopic cop number is at most 3. The hyperopic cop number is considered for countable graphs, and it is shown that for connected chains of graphs, the hyperopic cop density can be any real number in $[0,1/2].

Extração de DNA genômico de cereais de inverno na Embrapa Trigo.

bitstream/CNPT-2010/40600/1/p-co235.pd

Aberration cancellation in quantum interferometry

We report the first experimental demonstration of even-order aberration cancellation in quantum interferometry. The effect is a spatial counterpart of the spectral group velocity dispersion cancellation, which is associated with spectral entanglement. It is manifested in temporal interferometry by virtue of the multi-parameter spatial-spectral entanglement. Spatially-entangled photons, generated by spontaneous parametric down conversion, were subjected to spatial aberrations introduced by a deformable mirror that modulates the wavefront. We show that only odd-order spatial aberrations affect the quality of quantum interference

Body mass index and risk of non-alcoholic fatty liver disease: two electronic health record prospective studies

Context: The relationship between rising body mass index (BMI) and prospective risk of non-alcoholic fatty liver disease (NAFLD) / non-alcoholic steatohepatitis (NASH) is virtually absent. Objective: Determine the extent of the association between BMI and risk of future NAFLD diagnosis, stratifying by sex and diabetes. Design: Two prospective studies using Humedica and THIN with 1.54 and 4.96 years of follow-up respectively. Setting: Electronic health record databases Participants: Patients with had a recorded BMI measurement between 15–60kg/m2, and smoking status, and one year of active status prior to baseline BMI. Patients with a diagnosis or history of chronic diseases were excluded. Interventions: None Main Outcome Measure: Recorded diagnosis of NAFLD/NASH during follow-up (Humedica ICD-9 code 571.8, and read codes for NAFLD and NASH in THIN). Results: Hazard ratios (HR) were calculated across BMI categories using BMI of 20–22.5kg/m2 as the reference category, adjusting for age, sex and smoking status. Risk of recorded NAFLD/NASH increased linearly with BMI and was approximately 5-fold higher in Humedica (HR=4.78, 95% CI 4.17–5.47) and 9-fold higher in THIN (HR=8.93, 7.11–11.23) at a BMI of 30–32.5 kg/m2 rising to around 10-fold higher in Humedica (HR=9.80, 8.49–11.32) and 14-fold higher in THIN (HR=14.32, 11.04–18.57) in the 37.5–40 kg/m2 BMI category. Risk of NAFLD/NASH was approximately 50% higher in men, and approximately double in those with diabetes. Conclusions: These data quantify the consistent and strong relationships between BMI and prospectively recorded diagnoses of NAFLD/NASH and emphasize the importance of weight reduction strategies for prevention and management of NAFLD