Tunneling Times with Covariant Measurements

We consider the time delay of massive, non-relativistic, one-dimensional particles due to a tunneling potential. In this setting the well-known Hartman effect asserts that often the sub-ensemble of particles going through the tunnel seems to cross the tunnel region instantaneously. An obstacle to the utilization of this effect for getting faster signals is the exponential damping by the tunnel, so there seems to be a trade-off between speedup and intensity. In this paper we prove that this trade-off is never in favor of faster signals: the probability for a signal to reach its destination before some deadline is always reduced by the tunnel, for arbitrary incoming states, arbitrary positive and compactly supported tunnel potentials, and arbitrary detectors. More specifically, we show this for several different ways to define “the same incoming state” and “the same detector” when comparing the settings with and without tunnel potential. The arrival time measurements are expressed in the time-covariant approach, but we also allow the detection to be a localization measurement at a later time. Dedicated to Pekka Lahti on the occasion of his 60th birthday.     

Local time and Tanaka formula for a multitype Dawson–Watanabe superprocess

In [3] Dynkin defined the local time of a continuous superprocess as a stochastic integral and gave a criterion for existence of local time. Here we prove that the conditions in Dynkin's existence criterion are satisfied by the multitype Dawson–Watanabe superprocess, and give a Tanaka formula‐like representation of the local time which is used to show that the occupation measure of the multitype superprocess is absolutely continuous with respect to an appropriate reference measure, and that the corresponding density coincides a.s. with the local time. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Optimal broadcast domination in polynomial time

Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination powers. Broadcast domination assigns an integer power f(v)?0 to each vertex v of a given graph, such that every vertex of the graph is within distance f(v) from some vertex v having f(v)?1. The optimal broadcast domination problem seeks to minimize the sum of the powers assigned to the vertices of the graph. Since the presentation of this problem its computational complexity has been open, and the general belief has been that it might be NP-hard. In this paper, we show that optimal broadcast domination is actually in P, and we give a polynomial time algorithm for solving the problem on arbitrary graphs, using a non-standard approach.     

Asymptotic analysis and estimates of blow‐up time for the radial symmetric semilinear heat equation in the open‐spectrum case

We estimate the blow‐up time for the reaction diffusion equation u_t=Δu+ λf(u), for the radial symmetric case, where f is a positive, increasing and convex function growing fast enough at infinity. Here λ>λ^*, where λ^* is the ‘extremal’ (critical) value for λ, such that there exists an ‘extremal’ weak but not a classical steady‐state solution at λ=λ^* with ∥w(?, λ)∥_∞→∞ as 0<λ→λ^*?. Estimates of the blow‐up time are obtained by using comparison methods. Also an asymptotic analysis is applied when f(s)=e^s, for λ?λ^*?1, regarding the form of the solution during blow‐up and an asymptotic estimate of blow‐up time is obtained. Finally, some numerical results are also presented. Copyright © 2007 John Wiley & Sons, Ltd.     

On the global existence and finite time blow-up of shadow systems

Shadow systems are often used to approximate reaction-diffusion systems when one of the diffusion rates is large. In this paper, we study the global existence and blow-up phenomena for shadow systems. Our results show that even for these fundamental aspects, there are serious discrepancies between the dynamics of the reaction-diffusion systems and that of their corresponding shadow systems.     

Uniqueness results for nonlocal Hamilton-Jacobi equations

We are interested in nonlocal eikonal equations describing the evolution of interfaces moving with a nonlocal, non-monotone velocity. For these equations, only the existence of global-in-time weak solutions is available in some particular cases. In this paper, we propose a new approach for proving uniqueness of the solution when the front is expanding. This approach simplifies and extends existing results for dislocation dynamics. It also provides the first uniqueness result for a Fitzhugh-Nagumo system. The key ingredients are some new perimeter estimates for the evolving fronts as well as some uniform interior cone property for these fronts.     

Bayesian estimation of finite time ruin probabilities

In this paper, we consider Bayesian inference and estimation of finite time ruin probabilities for the Sparre Andersen risk model. The dense family of Coxian distributions is considered for the approximation of both the inter‐claim time and claim size distributions. We illustrate that the Coxian model can be well fitted to real, long‐tailed claims data and that this compares well with the generalized Pareto model. The main advantage of using the Coxian model for inter‐claim times and claim sizes is that it is possible to compute finite time ruin probabilities making use of recent results from queueing theory. In practice, finite time ruin probabilities are much more useful than infinite time ruin probabilities as insurance companies are usually interested in predictions for short periods of future time and not just in the limit. We show how to obtain predictive distributions of these finite time ruin probabilities, which are more informative than simple point estimations and take account of model and parameter uncertainty. We illustrate the procedure with simulated data and the well‐known Danish fire loss data set. Copyright © 2009 John Wiley & Sons, Ltd.     

A Design-Based Structural Test Method for a Switched-Resistor DAC

In this paper, a design-based structural testing method is presented to enable a fast, low cost test for a switched-resistor digital-to-analogue converter (DAC). A 24-bit stereo DAC is used to demonstrate this. After schematic-level simulations and experimental verification, it is found that the dynamic parameter THD can be predicted by the static test. Practical production wafer test and final test results evaluate this structural test method by comparing it with the traditional THD test method. In this paper the simulation results, the relevant measurement results, and the testing results are discussed. Finally, the application recommendations are given.

通用快速RS编译码的设计

提出一种针对通用伽罗华域的快速RS编译码技术。该编译码技术利用了时域编码、频域译码,适用于通用的RS码本原生成表达式。分析表明,该技术与传统的时域编译码相比,复杂度明显降低,但仍具有相同的编译码能力,同时b=1本原生成表达式的RS编译码整系统的复杂度最低,仿真结果与理论分析一致。