99 resultados para RANDOM REGULAR GRAPHS
Resumo:
Motor task variation has been shown to be a key ingredient in skill transfer, retention, and structural learning. However, many studies only compare training of randomly varying tasks to either blocked or null training, and it is not clear how experiencing different nonrandom temporal orderings of tasks might affect the learning process. Here we study learning in human subjects who experience the same set of visuomotor rotations, evenly spaced between -60° and +60°, either in a random order or in an order in which the rotation angle changed gradually. We compared subsequent learning of three test blocks of +30°→-30°→+30° rotations. The groups that underwent either random or gradual training showed significant (P < 0.01) facilitation of learning in the test blocks compared with a control group who had not experienced any visuomotor rotations before. We also found that movement initiation times in the random group during the test blocks were significantly (P < 0.05) lower than for the gradual or the control group. When we fit a state-space model with fast and slow learning processes to our data, we found that the differences in performance in the test block were consistent with the gradual or random task variation changing the learning and retention rates of only the fast learning process. Such adaptation of learning rates may be a key feature of ongoing meta-learning processes. Our results therefore suggest that both gradual and random task variation can induce meta-learning and that random learning has an advantage in terms of shorter initiation times, suggesting less reliance on cognitive processes.
Resumo:
A new approximate solution for the first passage probability of a stationary Gaussian random process is presented which is based on the estimation of the mean clump size. A simple expression for the mean clump size is derived in terms of the cumulative normal distribution function, which avoids the lengthy numerical integrations which are required by similar existing techniques. The method is applied to a linear oscillator and an ideal bandpass process and good agreement with published results is obtained. By making a slight modification to an existing analysis it is shown that a widely used empirical result for the asymptotic form of the first passage probability can be deduced theoretically.
Resumo:
Using a chiral nematic liquid crystal with a negative dielectric anisotropy, it is possible to switch between band-edge laser emission and random laser emission with an electric field. At low frequencies (1 kHz), random laser emission is observed as a result of scattering due to electro-hydrodynamic instabilities. However, band-edge laser emission is found to occur at higher frequencies (5 kHz), where the helix is stabilized due to dielectric coupling. These results demonstrate a method by which the linewidth of the laser source can be readily controlled externally (from 4 nm to 0.5 nm) using electric fields. © 2012 American Institute of Physics.
Resumo:
Smectic A liquid crystals, based upon molecular structures that consist of combined siloxane and mesogenic moieties, exhibit strong multiple scattering of light with and without the presence of an electric field. This paper demonstrates that when one adds a laser dye to these compounds it is possible to observe random laser emission under optical excitation, and that the output can be varied depending upon the scattering state that is induced by the electric field. Results are presented to show that the excitation threshold of a dynamic scattering state, consisting of chaotic motion due to electro-hydrodynamic instabilities, exhibits lower lasing excitation thresholds than the scattering states that exist in the absence of an applied electric field. However, the lowest threshold is observed for a dynamic scattering state that does not have the largest scattering strength but which occurs when there is optimization of the combined light absorption and scattering properties. © 2012 American Institute of Physics.
Resumo:
We consider the general problem of constructing nonparametric Bayesian models on infinite-dimensional random objects, such as functions, infinite graphs or infinite permutations. The problem has generated much interest in machine learning, where it is treated heuristically, but has not been studied in full generality in non-parametric Bayesian statistics, which tends to focus on models over probability distributions. Our approach applies a standard tool of stochastic process theory, the construction of stochastic processes from their finite-dimensional marginal distributions. The main contribution of the paper is a generalization of the classic Kolmogorov extension theorem to conditional probabilities. This extension allows a rigorous construction of nonparametric Bayesian models from systems of finite-dimensional, parametric Bayes equations. Using this approach, we show (i) how existence of a conjugate posterior for the nonparametric model can be guaranteed by choosing conjugate finite-dimensional models in the construction, (ii) how the mapping to the posterior parameters of the nonparametric model can be explicitly determined, and (iii) that the construction of conjugate models in essence requires the finite-dimensional models to be in the exponential family. As an application of our constructive framework, we derive a model on infinite permutations, the nonparametric Bayesian analogue of a model recently proposed for the analysis of rank data.
Resumo:
An infinite series of twofold, two-way weavings of the cube, corresponding to 'wrappings', or double covers of the cube, is described with the aid of the two-parameter Goldberg- Coxeter construction. The strands of all such wrappings correspond to the central circuits (CCs) of octahedrites (four-regular polyhedral graphs with square and triangular faces), which for the cube necessarily have octahedral symmetry. Removing the symmetry constraint leads to wrappings of other eight-vertex convex polyhedra. Moreover, wrappings of convex polyhedra with fewer vertices can be generated by generalizing from octahedrites to i-hedrites, which additionally include digonal faces. When the strands of a wrapping correspond to the CCs of a four-regular graph that includes faces of size greater than 4, non-convex 'crinkled' wrappings are generated. The various generalizations have implications for activities as diverse as the construction of woven-closed baskets and the manufacture of advanced composite components of complex geometry. © 2012 The Royal Society.
Resumo:
We study the role of connectivity on the linear and nonlinear elastic behavior of amorphous systems using a two-dimensional random network of harmonic springs as a model system. A natural characterization of these systems arises in terms of the network coordination relative to that of an isostatic network $\delta z$; a floppy network has $\delta z<0$, while a stiff network has $\delta z>0$. Under the influence of an externally applied load we observe that the response of both floppy and rigid network are controlled by the same critical point, corresponding to the onset of rigidity. We use numerical simulations to compute the exponents which characterize the shear modulus, the amplitude of non-affine displacements, and the network stiffening as a function of $\delta z$, derive these theoretically and make predictions for the mechanical response of glasses and fibrous networks.
Resumo:
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of the graph of relative measurements is known to affect the steady-state value of the position error covariance matrix. Classes of sensor graphs are identified, for which tight bounds for the trace of the covariance matrix can be obtained based on the algebraic properties of the underlying relative measurement graph. The string and the star graph topologies are considered, and the explicit form of the eigenvalues of error covariance matrix is given. More general sensor graph topologies are considered as combinations of the string and star topologies, when additional edges are added. It is demonstrated how the addition of edges increases the trace of the steady-state value of the position error covariance matrix, and the theoretical predictions are verified through simulation analysis.
Resumo:
This paper considers the estimation of statistics of displacement of a vibrating rectangular plate with random wave scatterers. The influence of uncertainty is investigated using point impedance theory. Coherent boundary effects are seen, which decrease when the number of scatterers increases. The boundary effect is investigated using images and the first side and corner reflections are found to be a minimum requirement to estimate the spatial correlation. Statistics for point driven response are investigated under the assumption that the statistics of the natural frequencies follow those of the Gaussian Orthogonal Ensemble (GOE). The estimates are compared with Monte Carlo simulation results, and they show good agreement. © 2012 Elsevier Ltd. All rights reserved.
Resumo:
Band alignment of resistive random access memory (RRAM) switching material Ta2O5 and different metal electrode materials was examined using high-resolution X-ray photoelectron spectroscopy. Schottky and hole barrier heights at the interface between electrode and Ta2O 5 were obtained, where the electrodes consist of materials with low to high work function (Φ m, v a c from 4.06 to 5.93 eV). Effective metal work functions were extracted to study the Fermi level pinning effect and to discuss the dominant conduction mechanism. An accurate band alignment between electrodes and Ta2O5 is obtained and can be used for RRAM electrode engineering and conduction mechanism study. © 2013 American Institute of Physics.
Resumo:
We offer a solution to the problem of efficiently translating algorithms between different types of discrete statistical model. We investigate the expressive power of three classes of model-those with binary variables, with pairwise factors, and with planar topology-as well as their four intersections. We formalize a notion of "simple reduction" for the problem of inferring marginal probabilities and consider whether it is possible to "simply reduce" marginal inference from general discrete factor graphs to factor graphs in each of these seven subclasses. We characterize the reducibility of each class, showing in particular that the class of binary pairwise factor graphs is able to simply reduce only positive models. We also exhibit a continuous "spectral reduction" based on polynomial interpolation, which overcomes this limitation. Experiments assess the performance of standard approximate inference algorithms on the outputs of our reductions.