Fully polarimetric radar systems are capable of simultaneously transmitting and receiving in two orthogonal polarizations. Instantaneous radar polarimetry exploits both polarization modes of a dually-polarized radar t...
详细信息
Fully polarimetric radar systems are capable of simultaneously transmitting and receiving in two orthogonal polarizations. Instantaneous radar polarimetry exploits both polarization modes of a dually-polarized radar transmitter and receiver on a pulse by pulse basis, and can improve the radar detection performance and suppress range sidelobes . In this paper, we extend the use of instantaneous radar polarimetry for radar systems with multiple dually-polarized transmit and receive antennas. Alamouti signal processing is used to coordinate transmission of Golay pairs of phase codes waveforms across polarizations and multiple antennas. The integration of multi- antenna signal processing with instantaneous radar polarimetry can further improve the detection performance, at a computational cost comparable to single channel matched filtering.
In this paper, we describe how an active radar/sonar imaging problem may be formulated as a virtual passive sensor array processing problem. We consider an active sensing problem where it is desired to form a range-Do...
详细信息
In this paper, we describe how an active radar/sonar imaging problem may be formulated as a virtual passive sensor array processing problem. We consider an active sensing problem where it is desired to form a range-Doppler image at a slow- time rate, even though the radar/sonar can transmit pulses at a fast time rate. By transmitting pulses at the fast time rate we can estimate the second-order statistics of an ambiguity vector, calculated at a coarse resolution. As we show this ambiguity vector plays the role of an array snapshot vector in passive sensor array processing. The noise free version of this ambiguity vector acts as a signature vector or steering vector, which can be steered around in delay and Doppler at a fine resolution to produce an image. We employ a MVDR-like principle to generate high resolution delay-Doppler images.
Chemical reaction networks by which individual cells gather and process information about their chemical environments have been dubbed "signal transduction" networks. Despite this suggestive terminology, the...
Chemical reaction networks by which individual cells gather and process information about their chemical environments have been dubbed "signal transduction" networks. Despite this suggestive terminology, there have been few attempts to analyze chemical signaling systems with the quantitative tools of information theory. Gradient sensing in the social amoeba Dictyostelium discoideum is a well characterized signal transduction system in which a cell estimates the direction of a source of diffusing chemoattractant molecules based on the spatiotemporal sequence of ligand-receptor binding events at the cell membrane. Using Monte Carlo techniques (MCell) we construct a simulation in which a collection of individual ligand particles undergoing Brownian diffusion in a three-dimensional volume interact with receptors on the surface of a static amoeboid cell. Adapting a method for estimation of spike train entropies described by Victor (originally due to Kozachenko and Leonenko), we estimate lower bounds on the mutual information between the transmitted signal (direction of ligand source) and the received signal (spatiotemporal pattern of receptor binding/unbinding events). Hence we provide a quantitative framework for addressing the question: how much could the cell know, and when could it know it? We show that the time course of the mutual information between the cell's surface receptors and the (unknown) gradient direction is consistent with experimentally measured cellular response times. We find that the acquisition of directional information depends strongly on the time constant at which the intracellular response is filtered.
Legged robots can, in principle, traverse a large variety of obstacles and terrains. In this paper, we describe a successful application of reinforcement learning to the problem of negotiating obstacles with a quadrup...
详细信息
Legged robots can, in principle, traverse a large variety of obstacles and terrains. In this paper, we describe a successful application of reinforcement learning to the problem of negotiating obstacles with a quadruped robot. Our algorithm is based on a two-level hierarchical decomposition of the task, in which the high-level controller selects the sequence of foot-placement positions, and the low-level controller generates the continuous motions to move each foot to the specified positions. The high-level controller uses an estimate of the value function to guide its search; this estimate is learned partially from supervised data. The low-level controller is obtained via policy search. We demonstrate that our robot can successfully climb over a variety of obstacles which were not seen at training time
We investigate the problem of automatically constructing efficient representations or basis functions for approximating value functions based on analyzing the structure and topology of the state space. In particular, ...
详细信息
ISBN:
(纸本)9780262232531
We investigate the problem of automatically constructing efficient representations or basis functions for approximating value functions based on analyzing the structure and topology of the state space. In particular, two novel approaches to value function approximation are explored based on automatically constructing basis functions on state spaces that can be represented as graphs or manifolds: one approach uses the eigenfunctions of the Laplacian, in effect performing a global Fourier analysis on the graph;the second approach is based on diffusion wavelets, which generalize classical wavelets to graphs using multiscale dilations induced by powers of a diffusion operator or random walk on the graph. Together, these approaches form the foundation of a new generation of methods for solving large Markov decision processes, in which the underlying representation and policies are simultaneously learned.
An alternating direction finite element scheme for a class of moving boundary problems is studied. Using coordinate transformations of the spatial variants, a new domain independent of the time is obtained and an ADFE...
详细信息
Large linear systems of saddle point type arise in a wide variety of applications throughout computationalscience and engineering. Due to their indefiniteness and often poor spectral properties, such linear systems r...
We investigate the problem of automatically constructing efficient representations or basis functions for approximating value functions based on analyzing the structure and topology of the state space. In particular, ...
We investigate the problem of automatically constructing efficient representations or basis functions for approximating value functions based on analyzing the structure and topology of the state space. In particular, two novel approaches to value function approximation are explored based on automatically constructing basis functions on state spaces that can be represented as graphs or manifolds: one approach uses the eigenfunctions of the Laplacian, in effect performing a global Fourier analysis on the graph; the second approach is based on diffusion wavelets, which generalize classical wavelets to graphs using multiscale dilations induced by powers of a diffusion operator or random walk on the graph. Together, these approaches form the foundation of a new generation of methods for solving large Markov decision processes, in which the underlying representation and policies are simultaneously learned.
The purpose of this paper is to demonstrate the design and implementation of GISolve - a Grid-based problem solving environment for computationally intensive geographic information analysis based on geo-middleware. Th...
详细信息
暂无评论