Setting local rank constraints by orthogonal projections for image resolution analysis: Application to the determination of a low dose pharmaceutical compound

Raman chemical imaging provides chemical and spatial information about pharmaceutical drug product. By using resolution methods on acquired spectra, the objective is to calculate pure spectra and distribution maps of image compounds. With multivariate curve resolution-alternating least squares, constraints are used to improve the performance of the resolution and to decrease the ambiguity linked to the final solution. Non negativity and spatial local rank constraints have been identified as the most powerful constraints to be used.     

Bilateral generating functions and operational methods

Bilateral generating functions are those involving products of different types of polynomials. We show that operational methods offer a powerful tool to derive these families of generating functions. We study cases relevant to products of Hermite polynomials with Laguerre, Legendre and other polynomials. We also propose further extensions of the method which we develop here.     

用于波分复用系统的多峰干涉滤光片

介绍了用于波分复用系统的多峰干涉滤光片的设计原理,提出了滤光片透射峰位置的确定方法,讨论了影响滤光片半宽度和截止度的因素,给出了滤光片的膜厚容差分析结果,表明透射率监控标准偏差在<0.5%范围内,可以得到波形良好的多峰滤光片,最后给出了实验结果.     

一种不等带宽光学梳状滤波器

提出了一种新型—Michelson—三面镜FabryPerot型50GHz不等带宽光学梳状滤波器设计方案,分析和模拟表明:该器件将一路信道间隔为50GHz的输入信号分离成信道间隔为100GHz的奇偶两路输出信号,其中在3dB处,奇数信道带宽大于30GHz用于10Gb/s传输,偶数信道带宽大于60GHz用于40Gb/s传输对于将来的40Gb/s系统,该器件具有优势.     

On the Zeros of Orthogonal Polynomials: The Elliptic Case

Constructive Approximation - Let E = [–1, α] \cup [β, 1], –1 &;lt; α &;lt; β &;lt; 1, and let (pn) be orthogonal on E with respect to the weight function...     

New inequalities from classical Sturm theorems

Inequalities satisfied by the zeros of the solutions of second-order hypergeometric equations are derived through a systematic use of Liouville transformations together with the application of classical Sturm theorems. This systematic study allows us to improve previously known inequalities and to extend their range of validity as well as to discover inequalities which appear to be new. Among other properties obtained, Szegő's bounds on the zeros of Jacobi polynomials for , are completed with results for the rest of parameter values, Grosjean's inequality (J. Approx. Theory 50 (1987) 84) on the zeros of Legendre polynomials is shown to be valid for Jacobi polynomials with |β|1, bounds on ratios of consecutive zeros of Gauss and confluent hypergeometric functions are derived as well as an inequality involving the geometric mean of zeros of Bessel functions.     

混合位级正交试验设计的极差分析方法

本文指出，在混合位级的正交试验设计中，以往的极差分析方法存在着不足。本文给出了极差的修正方法，并用大量实例做了数值验证，说明这个修正确实很有效     

Optical Diffractive Memories: Angular Selectivity and Diffraction Efficiency in Dichromated Gelatin

Two thousand images of resolution 512×512 pixels as a regular matrix pattern of 10×10 elements are stored, where each element is angularly multiplexed 20 times in a 25 μm thickness of dichromated gelatin emulsion without cross-talk effect. The surface area of the matrix is 1 cm². We show good concordance of the angular selectivity between the experimental result and theory. The diffraction efficiency of each 20 multiplexed images is measured and has nearly the same value. Examples of reconstructed images for multiple applications are given, for example, storage of 160,000 images on a 3′1/2 floppy disc format, which is about 100 min of black and white film. Application can be made to automobile cartography and storage of X-ray images as well as weather forecast images. Colored diffractive images are also possible and are illustrated.     

Pseudo-Strong Regularity Around a Set

A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ.