1000 resultados para Bayesian probing


Relevância:

20.00% 20.00%

Publicador:

Resumo:

R. Daly and Q. Shen. Methods to accelerate the learning of bayesian network structures. Proceedings of the Proceedings of the 2007 UK Workshop on Computational Intelligence.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

R. Daly, Q. Shen and S. Aitken. Speeding up the learning of equivalence classes of Bayesian network structures. Proceedings of the 10th International Conference on Artificial Intelligence and Soft Computing, pages 34-39.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

R. Daly, Q. Shen and S. Aitken. Using ant colony optimisation in learning Bayesian network equivalence classes. Proceedings of the 2006 UK Workshop on Computational Intelligence, pages 111-118.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

R. Daly and Q. Shen. A Framework for the Scoring of Operators on the Search Space of Equivalence Classes of Bayesian Network Structures. Proceedings of the 2005 UK Workshop on Computational Intelligence, pages 67-74.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

J. Keppens, Q. Shen and M. Lee. Compositional Bayesian modelling and its application to decision support in crime investigation. Proceedings of the 19th International Workshop on Qualitative Reasoning, pages 138-148.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

J. Keppens and Q. Shen. Causality enabled compositional modelling of Bayesian networks. Proceedings of the 18th International Workshop on Qualitative Reasoning, pages 33-40, 2004.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Objectives. This paper explores the use of regression models for estimating health status of schizophrenic patients, from a Bayesian perspective. Our aims are: 1- To obtain a set of values of health states of the EQ-5D based on self-assessed health from a sample of schizophrenic patients. 2- To analyse the differences in the health status and in patients’ perceptions of their health status between four mental-health districts in Spain. Methods. We develop two linear models with dummy variables. The first model seeks to obtain an index of the health status of the patients using a VAS as a dependent variable and the different dimensions of EQ-5D as regressors. The second model allows to analyse the differences between the self-assessed health status in the different geographic areas and also the differences between the patients’ self-assessed health states, irrespective of their actual health state, in the different geographic areas. The analysis is done using Bayesian approach with Gibbs sampling (computer program WinBUGS 1.4). Data concerning self-assessed EQ-5D with VAS from four geographic areas of schizophrenic patients were obtained for the purposes of this analysis. Results. We obtained the health status index for this sample and analysed the differences for this index between the four geographic areas. Our study reveals variables that explain the differences in patients’ health status and differences in their health states assessment. We consider four possible scenarios.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

(This Technical Report revises TR-BUCS-2003-011) The Transmission Control Protocol (TCP) has been the protocol of choice for many Internet applications requiring reliable connections. The design of TCP has been challenged by the extension of connections over wireless links. In this paper, we investigate a Bayesian approach to infer at the source host the reason of a packet loss, whether congestion or wireless transmission error. Our approach is "mostly" end-to-end since it requires only one long-term average quantity (namely, long-term average packet loss probability over the wireless segment) that may be best obtained with help from the network (e.g. wireless access agent).Specifically, we use Maximum Likelihood Ratio tests to evaluate TCP as a classifier of the type of packet loss. We study the effectiveness of short-term classification of packet errors (congestion vs. wireless), given stationary prior error probabilities and distributions of packet delays conditioned on the type of packet loss (measured over a larger time scale). Using our Bayesian-based approach and extensive simulations, we demonstrate that congestion-induced losses and losses due to wireless transmission errors produce sufficiently different statistics upon which an efficient online error classifier can be built. We introduce a simple queueing model to underline the conditional delay distributions arising from different kinds of packet losses over a heterogeneous wired/wireless path. We show how Hidden Markov Models (HMMs) can be used by a TCP connection to infer efficiently conditional delay distributions. We demonstrate how estimation accuracy is influenced by different proportions of congestion versus wireless losses and penalties on incorrect classification.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

One of TCP's critical tasks is to determine which packets are lost in the network, as a basis for control actions (flow control and packet retransmission). Modern TCP implementations use two mechanisms: timeout, and fast retransmit. Detection via timeout is necessarily a time-consuming operation; fast retransmit, while much quicker, is only effective for a small fraction of packet losses. In this paper we consider the problem of packet loss detection in TCP more generally. We concentrate on the fact that TCP's control actions are necessarily triggered by inference of packet loss, rather than conclusive knowledge. This suggests that one might analyze TCP's packet loss detection in a standard inferencing framework based on probability of detection and probability of false alarm. This paper makes two contributions to that end: First, we study an example of more general packet loss inference, namely optimal Bayesian packet loss detection based on round trip time. We show that for long-lived flows, it is frequently possible to achieve high detection probability and low false alarm probability based on measured round trip time. Second, we construct an analytic performance model that incorporates general packet loss inference into TCP. We show that for realistic detection and false alarm probabilities (as are achievable via our Bayesian detector) and for moderate packet loss rates, the use of more general packet loss inference in TCP can improve throughput by as much as 25%.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server. Prior work has generally assumed that assignment to be static. In contrast, we propose dynamic server selection, and show that it enables application-level congestion avoidance. To make dynamic server selection practical, we demonstrate the use of three tools. In addition to direct measurements of round-trip latency, we introduce and validate two new tools: bprobe, which estimates the maximum possible bandwidth along a given path; and cprobe, which estimates the current congestion along a path. Using these tools we demonstrate dynamic server selection and compare it to previous static approaches. We show that dynamic server selection consistently outperforms static policies by as much as 50%. Furthermore, we demonstrate the importance of each of our tools in performing dynamic server selection.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Growing interest in inference and prediction of network characteristics is justified by its importance for a variety of network-aware applications. One widely adopted strategy to characterize network conditions relies on active, end-to-end probing of the network. Active end-to-end probing techniques differ in (1) the structural composition of the probes they use (e.g., number and size of packets, the destination of various packets, the protocols used, etc.), (2) the entity making the measurements (e.g. sender vs. receiver), and (3) the techniques used to combine measurements in order to infer specific metrics of interest. In this paper, we present Periscope: a Linux API that enables the definition of new probing structures and inference techniques from user space through a flexible interface. PeriScope requires no support from clients beyond the ability to respond to ICMP ECHO REQUESTs and is designed to minimize user/kernel crossings and to ensure various constraints (e.g., back-to-back packet transmissions, fine-grained timing measurements) We show how to use Periscope for two different probing purposes, namely the measurement of shared packet losses between pairs of endpoints and for the measurement of subpath bandwidth. Results from Internet experiments for both of these goals are also presented.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

info:eu-repo/semantics/published

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The idealized system of an atomically flat metallic surface [highly oriented pyrolytic graphite (HOPG)] and an organic monolayer (porphyrin) was used to determine whether the dielectric function and associated properties of thin films can be accessed with scanning-near-field scanning optical microscopy (s-NSOM). Here, we demonstrate the use of harmonics up to fourth order and the polarization dependence of incident light to probe dielectric properties on idealized samples of monolayers of organic molecules on atomically smooth substrates. An analytical treatment of light/sample interaction using the s-NSOM tip was developed in order to quantify the dielectric properties. The theoretical analysis and numerical modeling, as well as experimental data, demonstrate that higher order harmonic scattering can be used to extract the dielectric properties of materials with tens of nanometer spatial resolution. To date, the third harmonic provides the best lateral resolution (∼50 nm) and dielectric constant contrast for a porphyrin film on HOPG. © 2009 American Institute of Physics.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ultraviolet-visible spectroscopy readily discerns the two types of melanin pigments (eumelanin and pheomelanin), although fundamental details regarding the optical properties and pigment heterogeneity are more difficult to disentangle via analysis of the broad featureless absorption spectrum alone. We employed nonlinear transient absorption spectroscopy to study different melanin pigments at near-infrared wavelengths. Excited-state absorption, ground-state depletion, and stimulated emission signal contributions were distinguished for natural and synthetic eumelanins and pheomelanins. A starker contrast among the pigments is observed in the nonlinear excitation regime because they all exhibit distinct transient absorptive amplitudes, phase shifts, and nonexponential population dynamics spanning the femtosecond-nanosecond range. In this manner, different pigments within the pheomelanin subclass were distinguished in synthetic and human hair samples. These results highlight the potential of nonlinear spectroscopies to deliver an in situ analysis of natural melanins in tissue that are otherwise difficult to extract and purify.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the problem of variable selection in regression modeling in high-dimensional spaces where there is known structure among the covariates. This is an unconventional variable selection problem for two reasons: (1) The dimension of the covariate space is comparable, and often much larger, than the number of subjects in the study, and (2) the covariate space is highly structured, and in some cases it is desirable to incorporate this structural information in to the model building process. We approach this problem through the Bayesian variable selection framework, where we assume that the covariates lie on an undirected graph and formulate an Ising prior on the model space for incorporating structural information. Certain computational and statistical problems arise that are unique to such high-dimensional, structured settings, the most interesting being the phenomenon of phase transitions. We propose theoretical and computational schemes to mitigate these problems. We illustrate our methods on two different graph structures: the linear chain and the regular graph of degree k. Finally, we use our methods to study a specific application in genomics: the modeling of transcription factor binding sites in DNA sequences. © 2010 American Statistical Association.