Quantum tunneling time

A simple model of a quantum clock is applied to the old and controversial problem of how long a particle takes to tunnel through a quantum barrier. The model I employ has the advantage of yielding sensible results for energy eigenstates, and does not require the use of time-dependant wave packets. Although the treatment does not forbid superluminal tunneling velocities, there is no implication of faster-than-light signaling because only the transit duration is measurable, not the absolute time of transit. A comparison is given with the weak-measurement post-selection calculations of Steinberg.Comment: 10 pages, no figures, research pape

Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity

AbstractWe propose an approximate proximal algorithm for solving generalized variational inequalities in Hilbert space. Extension to Bregman-function-based approximate proximal algorithm is also discussed. Weak convergence of these two algorithms are established under the paramonotonicity and pseudomonotonicity assumptions of the operators

Stable adaptive fuzzy control with TSK fuzzy friction estimation for linear drive systems

This paper considers the control of a linear drive system with friction and disturbance compensation. A stable adaptive controller integrated with fuzzy model-based friction estimation and switching-based disturbance compensation is proposed via Lyapunov stability theory. A TSK fuzzy model with local linear friction models is suggested for real-time estimation of its consequent local parameters. The parameters update law is derived based on linear parameterization. In order to compensate for the effects resulting from estimation error and disturbance, a robust switching law is incorporated in the overall stable adaptive control system. Extensive computer simulation results show that the proposed stable adaptive fuzzy control system has very good performances, and is potential for precision positioning and trajectory tracking control of linear drive systems

High Surface Area and Z′ in a Thermally Stable 8-fold Polycatenated Hydrogen-bonded Framework

1,3,5-Tris(4-carboxyphenyl)benzene assembles into an intricate 8-fold polycatenated assembly of (6,3) hexagonal nets formed through hydrogen bonds and π-stacking. One polymorph features 56 independent molecules in the asymmetric unit, the largest Z′ reported to date. The framework is permanently porous, with a BET surface area of 1095 m2 g−1 and readily adsorbs N2, H2 and CO2

The maximum clique enumeration problem: algorithms, applications, and implementations

Background The maximum clique enumeration (MCE) problem asks that we identify all maximum cliques in a finite, simple graph. MCE is closely related to two other well-known and widely-studied problems: the maximum clique optimization problem, which asks us to determine the size of a largest clique, and the maximal clique enumeration problem, which asks that we compile a listing of all maximal cliques. Naturally, these three problems are View MathML /\u3e-hard, given that they subsume the classic version of the View MathML /\u3e-complete clique decision problem. MCE can be solved in principle with standard enumeration methods due to Bron, Kerbosch, Kose and others. Unfortunately, these techniques are ill-suited to graphs encountered in our applications. We must solve MCE on instances deeply seeded in data mining and computational biology, where high-throughput data capture often creates graphs of extreme size and density. MCE can also be solved in principle using more modern algorithms based in part on vertex cover and the theory of fixed-parameter tractability (FPT). While FPT is an improvement, these algorithms too can fail to scale sufficiently well as the sizes and densities of our datasets grow. Results An extensive testbed of benchmark graphs are created using publicly available transcriptomic datasets from the Gene Expression Omnibus (GEO). Empirical testing reveals crucial but latent features of such high-throughput biological data. In turn, it is shown that these features distinguish real data from random data intended to reproduce salient topological features. In particular, with real data there tends to be an unusually high degree of maximum clique overlap. Armed with this knowledge, novel decomposition strategies are tuned to the data and coupled with the best FPT MCE implementations. Conclusions Several algorithmic improvements to MCE are made which progressively decrease the run time on graphs in the testbed. Frequently the final runtime improvement is several orders of magnitude. As a result, instances which were once prohibitively time-consuming to solve are brought into the domain of realistic feasibility

Transformation elastodynamics and active exterior acoustic cloaking

This chapter consists of three parts. In the first part we recall the elastodynamic equations under coordinate transformations. The idea is to use coordinate transformations to manipulate waves propagating in an elastic material. Then we study the effect of transformations on a mass-spring network model. The transformed networks can be realized with "torque springs", which are introduced here and are springs with a force proportional to the displacement in a direction other than the direction of the spring terminals. Possible homogenizations of the transformed networks are presented, with potential applications to cloaking. In the second and third parts we present cloaking methods that are based on cancelling an incident field using active devices which are exterior to the cloaked region and that do not generate significant fields far away from the devices. In the second part, the exterior cloaking problem for the Laplace equation is reformulated as the problem of polynomial approximation of analytic functions. An explicit solution is given that allows to cloak larger objects at a fixed distance from the cloaking device, compared to previous explicit solutions. In the third part we consider the active exterior cloaking problem for the Helmholtz equation in 3D. Our method uses the Green's formula and an addition theorem for spherical outgoing waves to design devices that mimic the effect of the single and double layer potentials in Green's formula.Comment: Submitted as a chapter for the volume "Acoustic metamaterials: Negative refraction, imaging, lensing and cloaking", Craster and Guenneau ed., Springe

7th Drug hypersensitivity meeting: part two

No abstract availabl

The performance of the jet trigger for the ATLAS detector during 2011 data taking

The performance of the jet trigger for the ATLAS detector at the LHC during the 2011 data taking period is described. During 2011 the LHC provided proton–proton collisions with a centre-of-mass energy of 7 TeV and heavy ion collisions with a 2.76 TeV per nucleon–nucleon collision energy. The ATLAS trigger is a three level system designed to reduce the rate of events from the 40 MHz nominal maximum bunch crossing rate to the approximate 400 Hz which can be written to offline storage. The ATLAS jet trigger is the primary means for the online selection of events containing jets. Events are accepted by the trigger if they contain one or more jets above some transverse energy threshold. During 2011 data taking the jet trigger was fully efficient for jets with transverse energy above 25 GeV for triggers seeded randomly at Level 1. For triggers which require a jet to be identified at each of the three trigger levels, full efficiency is reached for offline jets with transverse energy above 60 GeV. Jets reconstructed in the final trigger level and corresponding to offline jets with transverse energy greater than 60 GeV, are reconstructed with a resolution in transverse energy with respect to offline jets, of better than 4 % in the central region and better than 2.5 % in the forward direction