Schizophrenia patients and their healthy siblings share disruption of white matter integrity in the left prefrontal cortex and the hippocampus but not the anterior cingulate cortex

Healthy siblings of schizophrenia patients have an almost 9-fold higher risk for developing the illness than the general population. Disruption of white matter (WM) integrity as indicated by reduced fractional anisotropy (FA) derived from diffusion tensor

The incentives for supply chain collaboration to improve material efficiency in the use of steel: An analysis using input output techniques

In the face of increasing demand and limited emission reduction opportunities, the steel industry will have to look beyond its process emissions to bear its share of emission reduction targets. One option is to improve material efficiency - reducing the amount of metal required to meet services. In this context, the purpose of this paper is to explore why opportunities to improve material efficiency through upstream measures such as yield improvement and lightweighting might remain underexploited by industry. Established input-output techniques are applied to the GTAP 7 multi-regional input-output model to quantify the incentives for companies in key steel-using sectors (such as property developers and automotive companies) to seek opportunities to improve material efficiency in their upstream supply chains under different short-run carbon price scenarios. Because of the underlying assumptions, the incentives are interpreted as overestimates. The principal result of the paper is that these generous estimates of the incentives for material efficiency caused by a carbon price are offset by the disincentives to material efficiency caused by labour taxes. Reliance on a carbon price alone to deliver material efficiency would therefore be misguided and additional policy interventions to support material efficiency should be considered. © 2013 Elsevier B.V.

The price of pain and the value of suffering.

Estimating the financial value of pain informs issues as diverse as the market price of analgesics, the cost-effectiveness of clinical treatments, compensation for injury, and the response to public hazards. Such valuations are assumed to reflect a stable trade-off between relief of discomfort and money. Here, using an auction-based health-market experiment, we show that the price people pay for relief of pain is strongly determined by the local context of the market, that is, by recent intensities of pain or immediately disposable income (but not overall wealth). The absence of a stable valuation metric suggests that the dynamic behavior of health markets is not predictable from the static behavior of individuals. We conclude that the results follow the dynamics of habit-formation models of economic theory, and thus, this study provides the first scientific basis for this type of preference modeling.

Statistical analysis of microscale gas flows and stock price changes

First, recent studies on the information preservation (IP) method, a particle approach for low-speed micro-scale gas flows, are reviewed. The IP method was validated for benchmark issues such as Couette, Poiseuille and Rayleigh flows, compared well with measured data for typical internal flows through micro-channels and external flows past micro flat plates, and combined with the Navier-Stokes equations to be a hybrid scheme for subsonic, rarefied gas flows. Second, the focus is moved to the microscopic characteristic of China stock market, particularly the price correlation between stock deals. A very interesting phenomenon was found that showed a reverse transition behaviour between two neighbouring price changes. This behaviour significantly differs from the transition rules for atomic and molecular energy levels, and it is very helpful to understand the essential difference between stock markets and nature.

Minimizing Statistical Bias with Queries

I describe an exploration criterion that attempts to minimize the error of a learner by minimizing its estimated squared bias. I describe experiments with locally-weighted regression on two simple kinematics problems, and observe that this "bias-only" approach outperforms the more common "variance-only" exploration approach, even in the presence of noise.

How smokers may react to cigarette taxes and price increases in Brazil: data from a national survey

Background: Despite being the third largest tobacco producer in the world, Brazil has developed a comprehensive tobacco control policy that includes a broad restriction on both advertising and smoking in indoor public places, compulsory pictorial warning labels, and a menthol cigarette ban. However, tax and pricing policies have been developed slowly and only very recently were stronger measures implemented. This study investigated the expected responses of smokers to hypothetical price increases in Brazil.Methods: We analyzed smokers' responses to hypothetical future price increases according to sociodemographic characteristics and smoking conditions in a multistage sample of Brazilian current cigarette smokers aged >= 14 years (n = 500). Logistic regression analysis was used to examine the relationship between possible responses and different predictors.Results: in most subgroups investigated, smokers most frequently said they would react to a hypothetical price increase by taking up alternatives that might have a positive impact on health, i.e., they would try to stop smoking (52.3%) or smoke fewer cigarettes (46.8%). However, a considerable percentage responded that they would use alternatives that would reduce the effect of price increases, such as the same brand with lower cost (48.1%). After controlling for sex age group (14-19, 20-39, 40-59, and >= 60 years), schooling level (>= 9 versus <= 9 years), number of cigarettes per day (>20 versus <= 20), and stage of change for smoking cessation (precontemplation, contemplation, and preparation), lower levels of dependence were positively associated with the response I would try to stop smoking (odds ratio [OR], 2.19). Young age was associated with I would decrease the number of cigarettes (OR, 3.44). A low schooling level was strongly associated with all responses.Conclusions: Taxes and prices increases have great potential to stimulate cessation or reduction of cigarette consumption further among two important vulnerable populations of smokers in Brazil: young smokers and those of low educational level. the results from the present study also suggest that seeking illegal products may reduce the impact of increased taxes, but does not eliminate it.

'Adipaging': Aging and obesity share biological hallmarks related to a dysfunctional adipose tissue

The increasing aging of our societies is accompanied by a pandemic of obesity and related cardiometabolic disorders. Progressive dysfunction of the white adipose tissue is increasingly recognized as an important hallmark of the aging process which in turn contributes to metabolic alterations, multi-organ damage, and a systemic pro-inflammatory state ('inflammaging'). On the other hand, obesity, the paradigm of adipose tissue dysfunction, shares numerous biological similarities with the normal aging process such as chronic inflammation and multi-system alterations. Accordingly, understanding the interplay between accelerated aging related to obesity and adipose tissue dysfunction is critical to gain insight into the aging process in general as well as into the pathophysiology of obesity and other related conditions. Here we postulate the concept of 'adipaging' to illustrate the common links between aging and obesity and the fact that, to a great extent, obese adults are prematurely aged individuals.

On Learning Counting Functions With Queries

We investigate the problem of learning disjunctions of counting functions, which are general cases of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class of disjunctions of integer-weighted counting functions with modulus p over the domain Znq (or Zn) for any given integer q ≥ 2 is polynomial time learnable using at most n + 1 equivalence queries, where the hypotheses issued by the learner are disjunctions of at most n counting functions with weights from Zp. The result is obtained through learning linear systems over an arbitrary field. In general a counting function may have a composite modulus. We prove that, for any given integer q ≥ 2, over the domain Zn2, the class of read-once disjunctions of Boolean-weighted counting functions with modulus q is polynomial time learnable with only one equivalence query, and the class of disjunctions of log log n Boolean-weighted counting functions with modulus q is polynomial time learnable. Finally, we present an algorithm for learning graph-based counting functions.

Learning Unions of Rectangles with Queries

We investigate the efficient learnability of unions of k rectangles in the discrete plane (1,...,n)[2] with equivalence and membership queries. We exhibit a learning algorithm that learns any union of k rectangles with O(k^3log n) queries, while the time complexity of this algorithm is bounded by O(k^5log n). We design our learning algorithm by finding "corners" and "edges" for rectangles contained in the target concept and then constructing the target concept from those "corners" and "edges". Our result provides a first approach to on-line learning of nontrivial subclasses of unions of intersections of halfspaces with equivalence and membership queries.

On trip planning queries in spatial databases

In this paper we discuss a new type of query in Spatial Databases, called Trip Planning Query (TPQ). Given a set of points P in space, where each point belongs to a category, and given two points s and e, TPQ asks for the best trip that starts at s, passes through exactly one point from each category, and ends at e. An example of a TPQ is when a user wants to visit a set of different places and at the same time minimize the total travelling cost, e.g. what is the shortest travelling plan for me to visit an automobile shop, a CVS pharmacy outlet, and a Best Buy shop along my trip from A to B? The trip planning query is an extension of the well-known TSP problem and therefore is NP-hard. The difficulty of this query lies in the existence of multiple choices for each category. In this paper, we first study fast approximation algorithms for the trip planning query in a metric space, assuming that the data set fits in main memory, and give the theory analysis of their approximation bounds. Then, the trip planning query is examined for data sets that do not fit in main memory and must be stored on disk. For the disk-resident data, we consider two cases. In one case, we assume that the points are located in Euclidean space and indexed with an Rtree. In the other case, we consider the problem of points that lie on the edges of a spatial network (e.g. road network) and the distance between two points is defined using the shortest distance over the network. Finally, we give an experimental evaluation of the proposed algorithms using synthetic data sets generated on real road networks.

Nearest-neighbor Queries in Probabilistic Graphs

Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest-neighbor query, which involves finding and reporting the k closest nodes to a specific node. This query assumes the existence of a measure of the "proximity" or the "distance" between any two nodes in the graph. To that end, we propose various novel distance functions that extend well known notions of classical graph theory, such as shortest paths and random walks. We argue that many meaningful distance functions are computationally intractable to compute exactly. Thus, in order to process nearest-neighbor queries, we resort to Monte Carlo sampling and exploit novel graph-transformation ideas and pruning opportunities. In our extensive experimental analysis, we explore the trade-offs of our approximation algorithms and demonstrate that they scale well on real-world probabilistic graphs with tens of millions of edges.