Exact Phase Retrieval in Principal Shift-Invariant Spaces

We address the problem of phase retrieval from Fourier transform magnitude spectrum for continuous-time signals that lie in a shift-invariant space spanned by integer shifts of a generator kernel. The phase retrieval problem for such signals is formulated as one of reconstructing the combining coefficients in the shift-invariant basis expansion. We develop sufficient conditions on the coefficients and the bases to guarantee exact phase retrieval, by which we mean reconstruction up to a global phase factor. We present a new class of discrete-domain signals that are not necessarily minimum-phase, but allow for exact phase retrieval from their Fourier magnitude spectra. We also establish Hilbert transform relations between log-magnitude and phase spectra for this class of discrete signals. It turns out that the corresponding continuous-domain counterparts need not satisfy a Hilbert transform relation; notwithstanding, the continuous-domain signals can be reconstructed from their Fourier magnitude spectra. We validate the reconstruction guarantees through simulations for some important classes of signals such as bandlimited signals and piecewise-smooth signals. We also present an application of the proposed phase retrieval technique for artifact-free signal reconstruction in frequency-domain optical-coherence tomography (FDOCT).

Kernelization complexity of possible winner and coalitional manipulation problems in voting

In the POSSIBLE WINNER problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences to linear preferences. Previous work has provided, for many common voting rules, fixed parameter tractable algorithms for the POSSIBLE WINNER problem, with number of candidates as the parameter. However, the corresponding kernelization question is still open and in fact, has been mentioned as a key research challenge 10]. In this paper, we settle this open question for many common voting rules. We show that the POSSIBLE WINNER problem for maximin, Copeland, Bucklin, ranked pairs, and a class of scoring rules that includes the Borda voting rule does not admit a polynomial kernel with the number of candidates as the parameter. We show however that the COALITIONAL MANIPULATION problem which is an important special case of the POSSIBLE WINNER problem does admit a polynomial kernel for maximin, Copeland, ranked pairs, and a class of scoring rules that includes the Borda voting rule, when the number of manipulators is polynomial in the number of candidates. A significant conclusion of our work is that the POSSIBLE WINNER problem is harder than the COALITIONAL MANIPULATION problem since the COALITIONAL MANIPULATION problem admits a polynomial kernel whereas the POSSIBLE WINNER problem does not admit a polynomial kernel. (C) 2015 Elsevier B.V. All rights reserved.

On Fast Bilateral Filtering Using Fourier Kernels

It was demonstrated in earlier work that, by approximating its range kernel using shiftable functions, the nonlinear bilateral filter can be computed using a series of fast convolutions. Previous approaches based on shiftable approximation have, however, been restricted to Gaussian range kernels. In this work, we propose a novel approximation that can be applied to any range kernel, provided it has a pointwise-convergent Fourier series. More specifically, we propose to approximate the Gaussian range kernel of the bilateral filter using a Fourier basis, where the coefficients of the basis are obtained by solving a series of least-squares problems. The coefficients can be efficiently computed using a recursive form of the QR decomposition. By controlling the cardinality of the Fourier basis, we can obtain a good tradeoff between the run-time and the filtering accuracy. In particular, we are able to guarantee subpixel accuracy for the overall filtering, which is not provided by the most existing methods for fast bilateral filtering. We present simulation results to demonstrate the speed and accuracy of the proposed algorithm.

FAST AND ACCURATE BILATERAL FILTERING USING GAUSS-POLYNOMIAL DECOMPOSITION

The bilateral filter is a versatile non-linear filter that has found diverse applications in image processing, computer vision, computer graphics, and computational photography. A common form of the filter is the Gaussian bilateral filter in which both the spatial and range kernels are Gaussian. A direct implementation of this filter requires O(sigma(2)) operations per pixel, where sigma is the standard deviation of the spatial Gaussian. In this paper, we propose an accurate approximation algorithm that can cut down the computational complexity to O(1) per pixel for any arbitrary sigma (constant-time implementation). This is based on the observation that the range kernel operates via the translations of a fixed Gaussian over the range space, and that these translated Gaussians can be accurately approximated using the so-called Gauss-polynomials. The overall algorithm emerging from this approximation involves a series of spatial Gaussian filtering, which can be efficiently implemented (in parallel) using separability and recursion. We present some preliminary results to demonstrate that the proposed algorithm compares favorably with some of the existing fast algorithms in terms of speed and accuracy.

Dynamic behavior of a cylindrical crack in a functionally graded interlayer under torsional loading

In this paper the problem of a cylindrical crack located in a functionally graded material (FGM) interlayer between two coaxial elastic dissimilar homogeneous cylinders and subjected to a torsional impact loading is considered. The shear modulus and the mass density of the FGM interlayer are assumed to vary continuously between those of the two coaxial cylinders. This mixed boundary value problem is first reduced to a singular integral equation with a Cauchy type kernel in the Laplace domain by applying Laplace and Fourier integral transforms. The singular integral equation is then solved numerically and the dynamic stress intensity factor (DSIF) is also obtained by a numerical Laplace inversion technique. The DSIF is found to rise rapidly to a peak and then reduce and tend to the static value almost without oscillation. The influences of the crack location, the FGM interlayer thickness and the relative magnitudes of the adjoining material properties are examined. It is found among others that, by increasing the FGM gradient, the DSIF can be greatly reduced.

A New Version of Smoothed Point Method to Simulate Linear Elastic Wave Propagation

By using the kernel function of the smoothed particle hydrodynamics (SPH) and modification of statistical volumes of the boundary points and their kernel functions, a new version of smoothed point method is established for simulating elastic waves in solid. With the simplicity of SPH kept, the method is easy to handle stress boundary conditions, especially for the transmitting boundary condition. A result improving by de-convolution is also proposed to achieve high accuracy under a relatively large smooth length. A numerical example is given and compared favorably with the analytical solution.

Torsional impact response of a penny-shaped interface crack in bonded materials with a graded material interlayer

In this paper, the dynamic response of a penny-shaped interface crack in bonded dissimilar homogeneous half-spaces is studied. It is assumed that the two materials are bonded together with such a inhomogeneous interlayer that makes the elastic modulus in the direction perpendicular to the crack surface is continuous throughout the space. The crack surfaces art assumed to be subjected to torsional impact loading. Laplace and Hankel integral transforms are applied combining with a dislocation density,function to reduce the mixed boundary value problem into a singular integral equation with a generalized Cauchy kernel in Laplace domain. By solving the singular integral equation numerically, and using a numerical Laplace inversion technique, the dynamic stress intensity factors art obtained. The influences of material properties and interlayer thickness on the dynamic stress intensity factor are investigated.

Implementing with veto players: a simple non cooperative game

The paper adapts a non cooperative game presented by Dagan, Serrano and Volij (1997) for bankruptcy problems to the context of TU veto balanced games. We investigate the relationship between the Nash outcomes of a noncooperative game and solution concepts of cooperative games such as the nucleolus, kernel and the egalitarian core.

Aquaculture Asia, Vol. 8, No. 1, pp.1-58, January-March 2003

*Table of Contents* Sustainable Aquaculture Fertilization, soil and water quality management in small-scale ponds part II:Soil and water quality management S. Adhikari Fisheries and aquaculture activities in Nepal Tek Gurung Peter Edwards writes on rural aquaculture: A knowledge-base for rural aquaculture Farmers as Scientists: Commercialization of giant freshwater prawn culture in India M.C. Nandeesha Aquaculture in reservoir fed canal based irrigation systems of India – a boon for fish production K.M. Rajesh, Mridula R. Mendon, K. N. Prabhudeva and P. Arun Padiyar Research and Farming Techniques Production and grow-out of the Black-lip pearl oyster Pinctada margaritifera Idris Lane Breeding of carps using a low-cost, small-scale hatchery in Assam, India: A farmer proven technology S.K. Das Genes and Fish: Hybridisation – more trouble than its worth? Graham Mair Breeding and culture of the sea cucumber Holothuria scabra in Vietnam R. Pitt and N. D. Q. Duy The potential use of palm kernel meal in aquaculture feeds Wing-Keong Ng Using a Simple GIS model to assess development patterns of small-scale rural aquaculture in the wider environment Simon R. Bush Aquaculture fundamentals: Getting the most out of your feed Simon Wilkinson Marine finfish section Status of marine finfish aquaculture in Myanmar U Khin Kolay Regional training course on grouper hatchery production Aquatic Animal Health Advice on aquatic animal health care: Problems in Penaeus monodon culture in low salinity areas Pornlerd Chanratchakool

Study of an object recognition algorithm

This project introduces an improvement of the vision capacity of the robot Robotino operating under ROS platform. A method for recognizing object class using binary features has been developed. The proposed method performs a binary classification of the descriptors of each training image to characterize the appearance of the object class. It presents the use of the binary descriptor based on the difference of gray intensity of the pixels in the image. It shows that binary features are suitable to represent object class in spite of the low resolution and the weak information concerning details of the object in the image. It also introduces the use of a boosting method (Adaboost) of feature selection al- lowing to eliminate redundancies and noise in order to improve the performance of the classifier. Finally, a kernel classifier SVM (Support Vector Machine) is trained with the available database and applied for predictions on new images. One possible future work is to establish a visual servo-control that is to say the reac- tion of the robot to the detection of the object.

Biology, Oceanography, and Fisheries of the North Pacific Transition Zone and Subarctic Frontal Zone: Papers from the North Pacific Transition Zone Workshop, Honolulu, Hawaii, 9-11 May 1988

In the past few years, large-scale, high-seas driftnet fishing has sparked intense debate and political conflict in many oceanic regions. In the Pacific Ocean the driftnet controversy first emerged in the North Pacific transition zone and subarctic frontal zone, where driftnet vessels from Japan, the Republic of Korea, and Taiwan pursue their target species of neon flying squid. Other North Pacific driftnet fleets from Japan and Taiwan target stocks of tunas and billfishes. Both types of driftnet fishing incidentally kill valued non-target species of marine life, including fish, mammals, birds, and turtles. In response to public concerns about driftnet fishing, government scientists began early on to assemble available information and consider what new data were required to assess impacts on North Pacific marine resources and the broader pelagic ecosystem. Accordingly, a workshop was convened at the NMFS Honolulu Laboratory in May 1988 to review current information on the biology, oceanography, and fisheries of the North Pacific transition zone and subarctic frontal zone. The workshop participants, from the United States and Canada, also developed a strategic plan to guide NMFS in developing a program of driftnet fishery research and impact assessment. This volume contains a selection of scientific review papers presented at the 1988 Honolulu workshop. The papers represent part of the small kernel of information available then, prior to the expansion of cooperative international scientific programs. Subsequent driftnet fishery monitoring and research by the United States, Canada, Japan, Korea, and Taiwan have added much new data. Nevertheless, this collection of papers provides a historical perspective and contains useful information not readily available elsewhere. (PDF file contains 118 pages.)

Turbulent collision of inertial particles: point-particle based, hybrid simulations and beyond

Point-particle based direct numerical simulation (PPDNS) has been a productive research tool for studying both single-particle and particle-pair statistics of inertial particles suspended in a turbulent carrier flow. Here we focus on its use in addressing particle-pair statistics relevant to the quantification of turbulent collision rate of inertial particles. PPDNS is particularly useful as the interaction of particles with small-scale (dissipative) turbulent motion of the carrier flow is mostly relevant. Furthermore, since the particle size may be much smaller than the Kolmogorov length of the background fluid turbulence, a large number of particles are needed to accumulate meaningful pair statistics. Starting from the relative simple Lagrangian tracking of so-called ghost particles, PPDNS has significantly advanced our theoretical understanding of the kinematic formulation of the turbulent geometric collision kernel by providing essential data on dynamic collision kernel, radial relative velocity, and radial distribution function. A recent extension of PPDNS is a hybrid direct numerical simulation (HDNS) approach in which the effect of local hydrodynamic interactions of particles is considered, allowing quantitative assessment of the enhancement of collision efficiency by fluid turbulence. Limitations and open issues in PPDNS and HDNS are discussed. Finally, on-going studies of turbulent collision of inertial particles using large-eddy simulations and particle- resolved simulations are briefly discussed.

On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver

It has long been recognized that many direct parallel tridiagonal solvers are only efficient for solving a single tridiagonal equation of large sizes, and they become inefficient when naively used in a three-dimensional ADI solver. In order to improve the parallel efficiency of an ADI solver using a direct parallel solver, we implement the single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication costs. The measured performances show that the longest allowable message vector length (MVL) is not necessarily the best choice. To understand this observation and optimize the performance, we propose an improved model that takes the cache effect into consideration. The optimal MVL for achieving the best performance is shown to depend on number of processors and grid sizes. Similar dependence of the optimal MVL is also found for the popular block pipelined method.

Smoothed Particle Hydrodynamics (SPH): an Overview and Recent Developments

Smoothed particle hydrodynamics (SPH) is a meshfree particle method based on Lagrangian formulation, and has been widely applied to different areas in engineering and science. This paper presents an overview on the SPH method and its recent developments, including (1) the need for meshfree particle methods, and advantages of SPH, (2) approximation schemes of the conventional SPH method and numerical techniques for deriving SPH formulations for partial differential equations such as the Navier-Stokes (N-S) equations, (3) the role of the smoothing kernel functions and a general approach to construct smoothing kernel functions, (4) kernel and particle consistency for the SPH method, and approaches for restoring particle consistency, (5) several important numerical aspects, and (6) some recent applications of SPH. The paper ends with some concluding remarks.