Classically, a computation operates on a string of bits, applying a sequence of physically realizable operations (such as logical NOT, AND, and OR), and outputs an answer based on the value of the last obtained bit string. Similarly, a quantum computation operates on a register consisting of a number of quantum bits (qubits), applying a sequence of (hypothetically) physically realizable quantum...

The test-field model is shown to be potentially nonrealizable in the presence of linear waves such as those frequently encountered in models of plasma and geophysical turbulence. A new statistical closure, the realizable test-field model (RTFM), is proposed as a remedy. Both the damping rate and frequency are renormalized to account for nonlinear damping and frequency shifts. Like the realizabl...

We study pool-based active learning of halfspaces. We revisit the aggressive approach for active learning in the realizable case, and show that it can be made efficient and practical, while also having theoretical guarantees under reasonable assumptions. We further show, both theoretically and experimentally, that it can be preferable to mellow approaches. Our efficient aggressive active learne...

Choreography analysis is a crucial problem in concurrent and distributed system development. A choreography specifies the desired ordering of message exchanges among the components of a system. The realizability of a choreography amounts to determining the existence of components whose communication behavior conforms to the given choreography. Recently, the choreography realizability problem ha...

Filtered value of the combustion source term in large eddy simulation (LES) can be accurately estimated using the joint probability density function (PDF) of species mass fraction and enthalpy. Computing the PDF using traditional stochastic methods in shock-containing flows however leads to numerical instabilities. Recently an accurate quadrature based method called semi-discrete quadrature met...

We present a unified view for online classification, regression, and uniclass problems. This view leads to a single algorithmic framework for the three problems. We prove worst case loss bounds for various algorithms for both the realizable case and the non-realizable case. A conversion of our main online algorithm to the setting of batch learning is also discussed. The end result is new algori...

It is well known that, when endowed with the Gromov-Hausdorff distance dGH, collection M of all isometry classes compact metric spaces a complete and separable space. also that (M,dGH) geodesic space, but there no structural characterization geodesics in M. In this paper we provide two characterizations We call γ:[0,1]→M Hausdorff-realizable if exists space Z containing isometric copies γ(t) fo...

in the present work a two dimensional numerical investigation of steam flows in a turbine blade passage is performed. a finite volume approach has been used and the pressure–velocity coupling is resolved using the simple algorithm. the purpose of this paper is to find that one of the used turbulent models is better for this kind of studies. a structured mesh arrangement with boundary layer mesh...