Analytic bootstrap at large spin

We use analytic conformal bootstrap methods to determine the anomalous dimensions and OPE coefficients for large spin operators in general conformal field theories in four dimensions containing a scalar operator of conformal dimension Delta(phi). It is known that such theories will contain an in finite sequence of large spin operators with twists approaching 2 Delta(phi) + 2n for each integer n. By considering the case where such operators are separated by a twist gap from other operators at large spin, we analytically determine the n, Delta(phi) dependence of the anomalous dimensions. We find that for all n, the anomalous dimensions are negative for Delta(phi) satisfying the unitarity bound. We further compute the first subleading correction at large spin and show that it becomes universal for large twist. In the limit when n is large, we find exact agreement with the AdS/CFT prediction corresponding to the Eikonal limit of a 2-2 scattering with dominant graviton exchange.

Impact Time Guidance for Large Heading Errors Using Sliding Mode Control

In this paper, sliding mode control-based impact time guidance laws are proposed. Even for large heading angle errors and negative initial closing speeds, the desired impact time is achieved by enforcing a sliding mode on a switching surface designed by using the concepts of collision course and estimated time-to-go. Unlike existing guidance laws, the proposed guidance strategy achieves impact time successfully even when the estimated interception time is greater than the desired impact time. Simulation results are also presented.

Prototype Selection on Large and Streaming Data

Since streaming data keeps coming continuously as an ordered sequence, massive amounts of data is created. A big challenge in handling data streams is the limitation of time and space. Prototype selection on streaming data requires the prototypes to be updated in an incremental manner as new data comes in. We propose an incremental algorithm for prototype selection. This algorithm can also be used to handle very large datasets. Results have been presented on a number of large datasets and our method is compared to an existing algorithm for streaming data. Our algorithm saves time and the prototypes selected gives good classification accuracy.