143 resultados para Random-Walk Hypothesis
Resumo:
The IntCal04 and Marine04 radiocarbon calibration curves have been updated from 12 cal kBP (cal kBP is here defined as thousands of calibrated years before AD 1950), and extended to 50 cal kBP, utilizing newly available data sets that meet the IntCal Working Group criteria for pristine corals and other carbonates and for quantification of uncertainty in both the 14C and calendar timescales as established in 2002. No change was made to the curves from 0-12 cal kBP. The curves were constructed using a Markov chain Monte Carlo (MCMC) implementation of the random walk model used for IntCal04 and Marine04. The new curves were ratified at the 20th International Radiocarbon Conference in June 2009 and are available in the Supplemental Material at www.radiocarbon.org.
Resumo:
This article applies the panel stationarity test with a break proposed by Hadri and Rao (2008) to examine whether 14 macroeconomic variables of OECD countries can be best represented as random walk or stationary fluctuations around a deterministic trend. In contrast to previous studies, based essentially on visual inspection of the break type or just applying the most general break model, we use a model selection procedure based on BIC. We do this for each time series so that heterogeneous break models are allowed for in the panel. Our results suggest, overwhelmingly, that if we account for a structural break, cross-sectional dependence and choose the break models to be congruent with the data, then the null of stationarity cannot be rejected for all the 14 macroeconomic variables examined in this article. This is in sharp contrast with the results obtained by Hurlin (2004), using the same data but a different methodology.
Resumo:
Cellular response to radiation damage is made by a complex network of pathways and feedback loops whose spatiotemporal organization is still unclear despite its decisive role in determining the fate of the damaged cell. The single-cell approach and the high spatial resolution offered by microbeams provide the perfect tool to study and quantify the dynamic processes associated with the induction and repair of DNA damage. The soft X-ray microbeam has been used to follow the development of radiation induced foci in live cells by monitoring their size and intensity as a function of dose and time using yellow fluorescent protein (YFP) tagging techniques. Preliminary data indicate a delayed and linear rising of the intensity signal indicating a slow kinetic for the accumulation of DNA repair protein 53BP1. A slow and limited foci diffusion has also been observed. Further investigations are required to assess whatever such diffusion is consistent with a random walk pattern or if it is the result of a more structured lesion processing phenomenon. In conclusion, our data indicates that the use of microbeams coupled to live cell microscopy represent a sophisticated approach for visualizing and quantifying the dynamics changes of DNA proteins at the damaged sites.
Resumo:
We propose an exchange rate model that is a hybrid of the conventional specification with monetary fundamentals and the Evans–Lyons microstructure approach. We estimate a model augmented with order flow variables, using a unique data set: almost 100 monthly observations on interdealer order flow on dollar/euro and dollar/yen. The augmented macroeconomic, or “hybrid,” model exhibits greater in-sample stability and out of sample forecasting improvement vis-à-vis the basic macroeconomic and random walk specifications.
Resumo:
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.
Resumo:
The IntCal09 and Marine09 radiocarbon calibration curves have been revised utilizing newly available and updated data sets from C measurements on tree rings, plant macrofossils, speleothems, corals, and foraminifera. The calibration curves were derived from the data using the random walk model (RWM) used to generate IntCal09 and Marine09, which has been revised to account for additional uncertainties and error structures. The new curves were ratified at the 21st International Radiocarbon conference in July 2012 and are available as Supplemental Material at www.radiocarbon.org. The database can be accessed at http://intcal.qub.ac.uk/intcal13/.
Resumo:
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O(√ √nlog<sup>3/2</sup>n) messages to elect a unique leader (with high probability). When considering the "explicit" variant of leader election where eventually every node knows the identity of the leader, our algorithm yields the asymptotically optimal bounds of O(1) rounds and O(. n) messages. This algorithm is then extended to one solving leader election on any connected non-bipartite n-node graph G in O(τ(. G)) time and O(τ(G)n√log<sup>3/2</sup>n) messages, where τ(. G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficient deterministic leader election algorithms. Finally, we present an almost matching lower bound for randomized leader election, showing that Ω(n) messages are needed for any leader election algorithm that succeeds with probability at least 1/. e+. ε, for any small constant ε. >. 0. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.
Resumo:
The relationship between retention loss in single crystal PbTiO3 ferroelectric thin films and leakage currents is demonstrated by piezoresponse and conductive atomic force microscopy measurements. It was found that the polarization reversal in the absence of an electric field followed a stretched exponential behavior 1-exp[-(t/k)(d)] with exponent d>1, which is distinct from a dispersive random walk process with d <. The latter has been observed in polycrystalline films for which retention loss was associated with grain boundaries. The leakage current indicates power law scaling at short length scales, which strongly depends on the applied electric field. Additional information of the microstructure, which contributes to an explanation of the presence of leakage currents, is presented with high resolution transmission electron microscopy analysis.
Footprints in the sand: a persistent spatial impression of fishing in a mobile groundfish assemblage
Resumo:
Fishing is well known to curtail the size distribution of fish populations. This paper reports the discovery of small-scale spatial patterns in length appearing in several exploited species of Celtic Sea demersal 'groundfish'. These patterns match well with spatial distributions of fishing activity, estimated from vessel monitoring records taken over a period of 6 years, suggesting that this 'mobile' fish community retains a persistent impression of local-scale fishing pressure. An individual random-walk model of fish movement best matched these exploitation 'footprints' with individual movement rates set to <35 km per year. We propose that Celtic Sea groundfish may have surprisingly low movement rates for much of the year, such that fishing impact is spatially heterogeneous and related to local fishing intensity.
Resumo:
In this study, we introduce an original distance definition for graphs, called the Markov-inverse-F measure (MiF). This measure enables the integration of classical graph theory indices with new knowledge pertaining to structural feature extraction from semantic networks. MiF improves the conventional Jaccard and/or Simpson indices, and reconciles both the geodesic information (random walk) and co-occurrence adjustment (degree balance and distribution). We measure the effectiveness of graph-based coefficients through the application of linguistic graph information for a neural activity recorded during conceptual processing in the human brain. Specifically, the MiF distance is computed between each of the nouns used in a previous neural experiment and each of the in-between words in a subgraph derived from the Edinburgh Word Association Thesaurus of English. From the MiF-based information matrix, a machine learning model can accurately obtain a scalar parameter that specifies the degree to which each voxel in (the MRI image of) the brain is activated by each word or each principal component of the intermediate semantic features. Furthermore, correlating the voxel information with the MiF-based principal components, a new computational neurolinguistics model with a network connectivity paradigm is created. This allows two dimensions of context space to be incorporated with both semantic and neural distributional representations.
Resumo:
Integrating evidence from multiple domains is useful in prioritizing disease candidate genes for subsequent testing. We ranked all known human genes (n = 3819) under linkage peaks in the Irish Study of High-Density Schizophrenia Families using three different evidence domains: 1) a meta-analysis of microarray gene expression results using the Stanley Brain collection, 2) a schizophrenia protein-protein interaction network, and 3) a systematic literature search. Each gene was assigned a domain-specific p-value and ranked after evaluating the evidence within each domain. For comparison to this
ranking process, a large-scale candidate gene hypothesis was also tested by including genes with Gene Ontology terms related to neurodevelopment. Subsequently, genotypes of 3725 SNPs in 167 genes from a custom Illumina iSelect array were used to evaluate the top ranked vs. hypothesis selected genes. Seventy-three genes were both highly ranked and involved in neurodevelopment (category 1) while 42 and 52 genes were exclusive to neurodevelopment (category 2) or highly ranked (category 3), respectively. The most significant associations were observed in genes PRKG1, PRKCE, and CNTN4 but no individual SNPs were significant after correction for multiple testing. Comparison of the approaches showed an excess of significant tests using the hypothesis-driven neurodevelopment category. Random selection of similar sized genes from two independent genome-wide association studies (GWAS) of schizophrenia showed the excess was unlikely by chance. In a further meta-analysis of three GWAS datasets, four candidate SNPs reached nominal significance. Although gene ranking using integrated sources of prior information did not enrich for significant results in the current experiment, gene selection using an a priori hypothesis (neurodevelopment) was superior to random selection. As such, further development of gene ranking strategies using more carefully selected sources of information is warranted.
The Trading of Unlimited Liability Bank Shares in Nineteenth Century Ireland: The Bagehot Hypothesis
Resumo:
In the mid-1820s, banks became the first businesses in Great Britain and Ireland to be allowed to form freely on an unlimited liability joint-stock basis. Walter Bagehot warned that their shares would ultimately be owned by widows, orphans, and other impecunious individuals. Another hypothesis is that the governing bodies of these banks, constrained by special legal restrictions on share trading, acted effectively to prevent such shares being transferred to the less wealthy. We test both conjectures using the archives of an Irish joint-stock bank. The results do not support Bagehot's hypothesis.
Resumo:
Two studies used random sample surveys to test the contact hypothesis on intergroup attitudes of Catholics and Protestants in Northern Ireland. In Study 1, archival data from two different surveys in 1989 (N= 310 Catholics, 422 Protestants) and 1991 (N= 319 Catholics, 478 Protestants) showed that contact was positively related to attitudes towards denominational mixing. Study 2 (N= 391 Catholics, 647 Protestants) explored predictors of intergroup forgiveness, and also showed that intergroup contact was positively related to out-group attitudes, perspective taking and trust (even among those who had worse experience of sectarian conflict). These studies indicate that research in peace psychology can provide a deeper understanding of the conflict in Northern Ireland and, in due course, contribute to its resolution.