97 resultados para Random Walks
Resumo:
Treball final de carrera basat en el reconeixement de punts clau en imatges mitjançant l'algorisme Random Ferns.
Resumo:
Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.
Resumo:
We report Monte Carlo results for a nonequilibrium Ising-like model in two and three dimensions. Nearest-neighbor interactions J change sign randomly with time due to competing kinetics. There follows a fast and random, i.e., spin-configuration-independent diffusion of Js, of the kind that takes place in dilute metallic alloys when magnetic ions diffuse. The system exhibits steady states of the ferromagnetic (antiferromagnetic) type when the probability p that J>0 is large (small) enough. No counterpart to the freezing phenomena found in quenched spin glasses occurs. We compare our results with existing mean-field and exact ones, and obtain information about critical behavior.
Resumo:
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the currently widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in place or move in a fixed direction, e.g., rightward or upward. While both formulations are essentially equivalent, the present approach leads us to consider discrete Fourier transforms, which eventually results in obtaining explicit expressions for the wave functions in terms of finite sums and allows the use of efficient algorithms based on the fast Fourier transform. The wave functions here obtained govern the probability of finding the particle at any given location but determine as well the exit-time probability of the walker from a fixed interval, which is also analyzed.
Resumo:
Sobriety checkpoints are not usually randomly located by traffic authorities. As such, information provided by non-random alcohol tests cannot be used to infer the characteristics of the general driving population. In this paper a case study is presented in which the prevalence of alcohol-impaired driving is estimated for the general population of drivers. A stratified probabilistic sample was designed to represent vehicles circulating in non-urban areas of Catalonia (Spain), a region characterized by its complex transportation network and dense traffic around the metropolis of Barcelona. Random breath alcohol concentration tests were performed during spring 2012 on 7,596 drivers. The estimated prevalence of alcohol-impaired drivers was 1.29 PER CENT, which is roughly a third of the rate obtained in non-random tests. Higher rates were found on weekends (1.90 PER CENT on Saturdays, 4.29 PER CENT on Sundays) and especially at night. The rate is higher for men (1.45 PER CENT) than for women (0.64 PER CENT) and the percentage of positive outcomes shows an increasing pattern with age. In vehicles with two occupants, the proportion of alcohol-impaired drivers is estimated at 2.62 PER CENT, but when the driver was alone the rate drops to 0.84 PER CENT, which might reflect the socialization of drinking habits. The results are compared with outcomes in previous surveys, showing a decreasing trend in the prevalence of alcohol-impaired drivers over time.
Resumo:
We present a model for transport in multiply scattering media based on a three-dimensional generalization of the persistent random walk. The model assumes that photons move along directions that are parallel to the axes. Although this hypothesis is not realistic, it allows us to solve exactly the problem of multiple scattering propagation in a thin slab. Among other quantities, the transmission probability and the mean transmission time can be calculated exactly. Besides being completely solvable, the model could be used as a benchmark for approximation schemes to multiple light scattering.
Resumo:
Peer-reviewed