End point estimates for Radon transform of radial functions on non-Euclidean spaces

We prove end point estimate for Radon transform of radial functions on affine Grasamannian and real hyperbolic space. We also discuss analogs of these results on the sphere.

Equilibrium and equivariant triangulations of some small covers with minimum number of vertices

Small covers were introduced by Davis and Januszkiewicz in 1991. We introduce the notion of equilibrium triangulations for small covers. We study equilibrium and vertex minimal 4-equivariant triangulations of 2-dimensional small covers. We discuss vertex minimal equilibrium triangulations of RP3#RP3, S-1 x RP2 and a nontrivial S-1 bundle over RP2. We construct some nice equilibrium triangulations of the real projective space RPn with 2(n) + n 1 vertices. The main tool is the theory of small covers.

Single real-symbol decodable, high-rate, distributed space-time block codes

A scheme to apply the rate-1 real orthogonal designs (RODs) in relay networks with single real-symbol decodability of the symbols at the destination for any arbitrary number of relays is proposed. In the case where the relays do not have any information about the channel gains from the source to themselves, the best known distributed space time block codes (DSTBCs) for k relays with single real-symbol decodability offer an overall rate of complex symbols per channel use. The scheme proposed in this paper offers an overall rate of 2/2+k complex symbol per channel use, which is independent of the number of relays. Furthermore, in the scenario where the relays have partial channel information in the form of channel phase knowledge, the best known DSTBCs with single real-symbol decodability offer an overall rate of 1/3 complex symbols per channel use. In this paper, making use of RODs, a scheme which achieves the same overall rate of 1/3 complex symbols per channel use but with a decoding delay that is 50 percent of that of the best known DSTBCs, is presented. Simulation results of the symbol error rate performance for 10 relays, which show the superiority of the proposed scheme over the best known DSTBC for 10 relays with single real-symbol decodability, are provided.

Real-Space Manifestations of Bottlenecks in Turbulence Spectra

An energy-spectrum bottleneck, a bump in the turbulence spectrum between the inertial and dissipation ranges, is shown to occur in the nonturbulent, one-dimensional, hyperviscous Burgers equation and found to be the Fourier-space signature of oscillations in the real-space velocity, which are explained by boundary-layer-expansion techniques. Pseudospectral simulations are used to show that such oscillations occur in velocity correlation functions in one- and three-dimensional hyperviscous hydrodynamical equations that display genuine turbulence. DOI: 10.1103/PhysRevLett.110.064501

Continuation of limit cycles near saddle homoclinic points using splines in phase space

We present a new algorithm for continuation of limit cycles of autonomous systems as a system parameter is varied. The algorithm works in phase space with an ordered set of points on the limit cycle, along with spline interpolation. Currently popular algorithms in bifurcation analysis packages compute time-domain approximations of limit cycles using either shooting or collocation. The present approach seems useful for continuation near saddle homoclinic points, where it encounters a corner while time-domain methods essentially encounter a discontinuity (a relatively short period of rapid variation). Other phase space-based algorithms use rescaled arclength in place of time, but subsequently resemble the time-domain methods. Compared to these, we introduce additional freedom through a variable stretching of arclength based on local curvature, through the use of an auxiliary index-based variable. Several numerical examples are presented. Comparisons with results from the popular package, MATCONT, are favorable close to saddle homoclinic points.

Four group decodable differential scaled unitary linear space-time codes

Differential Unitary Space-Time Block codes (STBCs) offer a means to communicate on the Multiple Input Multiple Output (MIMO) channel without the need for channel knowledge at both the transmitter and the receiver. Recently Yuen-Guan-Tjhung have proposed Single-Symbol-Decodable Differential Space-Time Modulation based on Quasi-Orthogonal Designs (QODs) by replacing the original unitary criterion by a scaled unitary criterion. These codes were also shown to perform better than differential unitary STBCs from Orthogonal Designs (ODs). However the rate (as measured in complex symbols per channel use) of the codes of Yuen-Guan-Tjhung decay as the number of transmit antennas increase. In this paper, a new class of differential scaled unitary STBCs for all even number of transmit antennas is proposed. These codes have a rate of 1 complex symbols per channel use, achieve full diversity and moreover they are four-group decodable, i.e., the set of real symbols can be partitioned into four groups and decoding can be done for the symbols in each group separately. Explicit construction of multidimensional signal sets that yield full diversity for this new class of codes is also given.

A real transformation for modal analysis of flexible damped spacecraft

Modal approach is widely used for the analysis of dynamics of flexible structures. However, space analysts yet lack an intimate modal analysis of current spacecraft which are rich with flexibility and possess both structural and discrete damping. Mathematical modeling of such spacecraft incapacitates the existing real transformation procedure, for it cannot include discrete damping, demands uncomputable inversion of a modal matrix inaccessible due to its overwhelming size and does not permit truncation. On the other hand, complex transformation techniques entail more computational time and cannot handle structural damping. This paper presents a real transformation strategy which averts inversion of the associated real transformation matrix, allows truncation and accommodates both forms of damping simultaneously. This is accomplished by establishing a key relation between the real transformation matrix and its adjoint. The relation permits truncation of the matrices and leads to uncoupled pairs of coupled first order equations which contain a number of adjoint eigenvectors. Finally these pairs are solved to obtain a literal modal response of forced gyroscopic damped flexibile systems at arbitrary initial conditions.

Maximum rate of 3- and 4-real-symbol ML decodable unitary weight STBCs

It has been shown recently that the maximum rate of a 2-real-symbol (single-complex-symbol) maximum likelihood (ML) decodable, square space-time block codes (STBCs) with unitary weight matrices is 2a/2a complex symbols per channel use (cspcu) for 2a number of transmit antennas [1]. These STBCs are obtained from Unitary Weight Designs (UWDs). In this paper, we show that the maximum rates for 3- and 4-real-symbol (2-complex-symbol) ML decodable square STBCs from UWDs, for 2a transmit antennas, are 3(a-1)/2a and 4(a-1)/2a cspcu, respectively. STBCs achieving this maximum rate are constructed. A set of sufficient conditions on the signal set, required for these codes to achieve full-diversity are derived along with expressions for their coding gain.

Fragment-based real-time object tracking: a sparse representation approach

Real-time object tracking is a critical task in many computer vision applications. Achieving rapid and robust tracking while handling changes in object pose and size, varying illumination and partial occlusion, is a challenging task given the limited amount of computational resources. In this paper we propose a real-time object tracker in l(1) framework addressing these issues. In the proposed approach, dictionaries containing templates of overlapping object fragments are created. The candidate fragments are sparsely represented in the dictionary fragment space by solving the l(1) regularized least squares problem. The non zero coefficients indicate the relative motion between the target and candidate fragments along with a fidelity measure. The final object motion is obtained by fusing the reliable motion information. The dictionary is updated based on the object likelihood map. The proposed tracking algorithm is tested on various challenging videos and found to outperform earlier approach.

Fiber Bragg Grating Sensor Instrumentation for Parking Space Occupancy Management

This work aims at providing an effective parking management system by reducing the drivers' searching time for vacant car-parking space, in turn improving the traffic flow in the car park areas. This is achieved by the use of Fiber Bragg Grating Sensor (FBG) sensor instrumentation in vehicle parking management system. Present work involves embedding an array of FBG sensors underground in the parking space, then determining the strain changes on the FBG sensor due to load applied by the vehicle parked in the parking space, occupancy of the parking space is determined. To validate the FBG sensor parking management system, three most common cases have been considered. This closed loop FBG parking management system can give real-time feed-back to space-guidance display board helping the driver in maneuvering the vehicle to the appropriate parking space. The proposed technique offers optimized usage of parking space for the various segments of cars and also facilitates in a conjoined automated billing system, as compared to conventional method of parking systems.

Optimal trajectory planning for path convergence in three-dimensional space

This article addresses the problem of determining the shortest path that connects a given initial configuration (position, heading angle, and flight path angle) to a given rectilinear or a circular path in three-dimensional space for a constant speed and turn-rate constrained aerial vehicle. The final path is assumed to be located relatively far from the starting point. Due to its simplicity and low computational requirements the algorithm can be implemented on a fixed-wing type unmanned air vehicle in real time in missions where the final path may change dynamically. As wind has a very significant effect on the flight of small aerial vehicles, the method of optimal path planning is extended to meet the same objective in the presence of wind comparable to the speed of the aerial vehicles. But, if the path to be followed is closer to the initial point, an off-line method based on multiple shooting, in combination with a direct transcription technique, is used to obtain the optimal solution. Optimal paths are generated for a variety of cases to show the efficiency of the algorithm. Simulations are presented to demonstrate tracking results using a 6-degrees-of-freedom model of an unmanned air vehicle.

Toward Real-Time Availability of 3D Temperature Maps Created with Temporally Constrained Reconstruction

PurposeTo extend the previously developed temporally constrained reconstruction (TCR) algorithm to allow for real-time availability of three-dimensional (3D) temperature maps capable of monitoring MR-guided high intensity focused ultrasound applications. MethodsA real-time TCR (RT-TCR) algorithm is developed that only uses current and previously acquired undersampled k-space data from a 3D segmented EPI pulse sequence, with the image reconstruction done in a graphics processing unit implementation to overcome computation burden. Simulated and experimental data sets of HIFU heating are used to evaluate the performance of the RT-TCR algorithm. ResultsThe simulation studies demonstrate that the RT-TCR algorithm has subsecond reconstruction time and can accurately measure HIFU-induced temperature rises of 20 degrees C in 15 s for 3D volumes of 16 slices (RMSE = 0.1 degrees C), 24 slices (RMSE = 0.2 degrees C), and 32 slices (RMSE = 0.3 degrees C). Experimental results in ex vivo porcine muscle demonstrate that the RT-TCR approach can reconstruct temperature maps with 192 x 162 x 66 mm 3D volume coverage, 1.5 x 1.5 x 3.0 mm resolution, and 1.2-s scan time with an accuracy of 0.5 degrees C. ConclusionThe RT-TCR algorithm offers an approach to obtaining large coverage 3D temperature maps in real-time for monitoring MR-guided high intensity focused ultrasound treatments. Magn Reson Med 71:1394-1404, 2014. (c) 2013 Wiley Periodicals, Inc.

Some remarks on the symplectic pairing on the moduli space of representations of the fundamental group of surfaces

This work grew out of an attempt to understand a conjectural remark made by Professor Kyoji Saito to the author about a possible link between the Fox-calculus description of the symplectic structure on the moduli space of representations of the fundamental group of surfaces into a Lie group and pairs of mutually dual sets of generators of the fundamental group. In fact in his paper [3] , Prof. Kyoji Saito gives an explicit description of the system of dual generators of the fundamental group.

Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

For point to point multiple input multiple output systems, Dayal-Brehler-Varanasi have proved that training codes achieve the same diversity order as that of the underlying coherent space time block code (STBC) if a simple minimum mean squared error estimate of the channel formed using the training part is employed for coherent detection of the underlying STBC. In this letter, a similar strategy involving a combination of training, channel estimation and detection in conjunction with existing coherent distributed STBCs is proposed for noncoherent communication in Amplify-and-Forward (AF) relay networks. Simulation results show that the proposed simple strategy outperforms distributed differential space-time coding for AF relay networks. Finally, the proposed strategy is extended to asynchronous relay networks using orthogonal frequency division multiplexing.

Real-World Extensions To Scheduling Algorithms Based On Lagrangian Relaxation

Recently, efficient scheduling algorithms based on Lagrangian relaxation have been proposed for scheduling parallel machine systems and job shops. In this article, we develop real-world extensions to these scheduling methods. In the first part of the paper, we consider the problem of scheduling single operation jobs on parallel identical machines and extend the methodology to handle multiple classes of jobs, taking into account setup times and setup costs, The proposed methodology uses Lagrangian relaxation and simulated annealing in a hybrid framework, In the second part of the paper, we consider a Lagrangian relaxation based method for scheduling job shops and extend it to obtain a scheduling methodology for a real-world flexible manufacturing system with centralized material handling.