Richardson Extrapolation for Linearly Degenerate Discontinuities

In this paper we investigate the use of Richardson extrapolation to estimate the convergence rates for numerical solutions to advection problems involving discontinuities. We use modified equation analysis to describe the expectation of the approach. In general, the results do not agree with a-priori estimates of the convergence rates. However, we identify one particular use case where Richardson extrapolation does yield the proper result. We then demonstrate this result using a number of numerical examples.Comment: 19 pages, 4 figur

Branching Ratio and CP-asymmetry for B-> 1^{1}P_{1}gamma decays

We calculate the branching ratios for B_{d}^{0}->(b_{1},h_{1})gamma at next-to-leading order (NLO) of alpha_{s} where b_{1} and h_{1} are the corresponding radially excited axial vector mesons of rho and omega respectively. Using the SU(3)symmetry for the form factor, the branching ratio for B_{d}^{0}->(b_{1},h_{1})gamma is expressed in terms of the branching ratio of the B_{d}^{0}-> K_{1}gamma and it is found to be B(B_{d}^{0}->b_{1}gamma)=0.71* 10^{-6} and B(B_{d}^{0}-> h_{1}gamma) =0.74*10^{-6}. We also calculate direct CP asymmetry for these decays and find, in confirmity with the observations made in the literature, that the hard spectator contributions significantely reduces the asymmetry arising from the vertex corrections alone. The value of CP-asymmetry is 10% and is negative like rho and omega in the Standard Model.Comment: 10 pages, 2 figure

Use of untreated wastewater in peri-urban agriculture in Pakistan: risks and opportunities

Water reuse / Waste waters / Water quality / Groundwater / Irrigation practices / Soil properties / Environmental effects / Conjunctive use / Pakistan / Haroonabad

A Radiation Hardened by Design CMOS ASIC for Thermopile Readouts

A radiation hardened by design (RHBD) mixed-signal application specific integrated circuit (ASIC) has been designed for a thermopile readout for operation in the harsh Jovian orbital environment. The multi-channel digitizer (MCD) ASIC includes 18 low noise amplifier channels which have tunable gain/filtering coefficients, a 16-bit sigma-delta analog-digital converter (SDADC) and an on-chip controller. The 18 channels, SDADC and controller were designed to operate with immunity to single event latchup (SEL) and to at least 10 Mrad total ionizing dose (TID). The ASIC also contains a radiation tolerant 16-bit 20 MHz Nyquist ADC for general purpose instrumentation digitizer needs. The ASIC is currently undergoing fabrication in a commercial 180 nm CMOS process. Although this ASIC was designed specifically for the harsh radiation environment of the NASA led JEO mission it is suitable for integration into instrumentation payloads 011 the ESA JUICE mission where the radiation hardness requirements are slightly less stringent

Online Forum Thread Retrieval using Pseudo Cluster Selection and Voting Techniques

Online forums facilitate knowledge seeking and sharing on the Web. However, the shared knowledge is not fully utilized due to information overload. Thread retrieval is one method to overcome information overload. In this paper, we propose a model that combines two existing approaches: the Pseudo Cluster Selection and the Voting Techniques. In both, a retrieval system first scores a list of messages and then ranks threads by aggregating their scored messages. They differ on what and how to aggregate. The pseudo cluster selection focuses on input, while voting techniques focus on the aggregation method. Our combined models focus on the input and the aggregation methods. The result shows that some combined models are statistically superior to baseline methods.Comment: The original publication is available at http://www.springerlink.com/. arXiv admin note: substantial text overlap with arXiv:1212.533

OSCA: a comprehensive open-access system of analysis of posterior capsular opacification

BACKGROUND: This paper presents and tests a comprehensive computerised system of analysis of digital images of posterior capsule opacification (PCO). It updates and expands significantly on a previous presentation to include facilities for selecting user defined central areas and for registering and subsequent merging of images for artefact removal. Also, the program is compiled and thus eliminates the need for specialised additional software. The system is referred to in this paper as the open-access systematic capsule assessment (OSCA). The system is designed to be evidence based, objective and openly available, improving on current systems of analysis. METHODS: Principal features of the OSCA system of analysis are discussed. Flash artefacts are automatically located in two PCO images and the images merged to produce a composite free from these artefacts. For this to be possible the second image has to be manipulated with a registration technique to bring it into alignment with the first. Further image processing and analysis steps use a location-sensitive entropy based texture analysis of PCO. Validity of measuring PCO progression of the whole new system is assessed along with visual significance of scores. Reliability of the system is assessed. RESULTS: Analysis of PCO by the system shows ability to detect early progression of PCO, as well as detection of more visually significant PCO. Images with no clinical PCO produce very low scores in the analysis. Reliability of the system of analysis is demonstrated. CONCLUSION: This system of PCO analysis is evidence-based, objective and clinically useful. It incorporates flash detection and removal as well as location sensitive texture analysis. It provides features and benefits not previously available to most researchers or clinicians. Substantial evidence is provided for this system's validity and reliability

Photo induced ionization dynamics of the nitrogen vacancy defect in diamond investigated by single shot charge state detection

The nitrogen-vacancy centre (NV) has drawn much attention for over a decade, yet detailed knowledge of the photophysics needs to be established. Under typical conditions, the NV can have two stable charge states, negative (NV-) or neutral (NV0), with photo induced interconversion of these two states. Here, we present detailed studies of the ionization dynamics of single NV centres in bulk diamond at room temperature during illumination in dependence of the excitation wavelength and power. We apply a recent method which allows us to directly measure the charge state of a single NV centre, and observe its temporal evolution. Results of this work are the steady state NV- population, which was found to be always < 75% for 450 to 610 nm excitation wavelength, the relative absorption cross-section of NV- for 540 to 610 nm, and the energy of the NV- ground state of 2.6 eV below the conduction band. These results will help to further understand the photo-physics of the NV centre.Comment: 9 pages, 7 figure

Deterministic and Probabilistic Binary Search in Graphs

We consider the following natural generalization of Binary Search: in a given undirected, positively weighted graph, one vertex is a target. The algorithm's task is to identify the target by adaptively querying vertices. In response to querying a node $q$, the algorithm learns either that $q$ is the target, or is given an edge out of $q$ that lies on a shortest path from $q$ to the target. We study this problem in a general noisy model in which each query independently receives a correct answer with probability $p > \frac{1}{2}$ (a known constant), and an (adversarial) incorrect one with probability $1-p$. Our main positive result is that when $p = 1$ (i.e., all answers are correct), $\log_2 n$ queries are always sufficient. For general $p$, we give an (almost information-theoretically optimal) algorithm that uses, in expectation, no more than $(1 - \delta)\frac{\log_2 n}{1 - H(p)} + o(\log n) + O(\log^2 (1/\delta))$ queries, and identifies the target correctly with probability at leas $1-\delta$. Here, $H(p) = -(p \log p + (1-p) \log(1-p))$ denotes the entropy. The first bound is achieved by the algorithm that iteratively queries a 1-median of the nodes not ruled out yet; the second bound by careful repeated invocations of a multiplicative weights algorithm. Even for $p = 1$, we show several hardness results for the problem of determining whether a target can be found using $K$ queries. Our upper bound of $\log_2 n$ implies a quasipolynomial-time algorithm for undirected connected graphs; we show that this is best-possible under the Strong Exponential Time Hypothesis (SETH). Furthermore, for directed graphs, or for undirected graphs with non-uniform node querying costs, the problem is PSPACE-complete. For a semi-adaptive version, in which one may query $r$ nodes each in $k$ rounds, we show membership in $\Sigma_{2k-1}$ in the polynomial hierarchy, and hardness for $\Sigma_{2k-5}$