A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

How to Build Robust Shared Control Systems

Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.     

Analysis method of the effect of fabrication errors on a planar waveguide demultiplexer

The impact of fabrication errors on a planar waveguide demultiplexer is analyzed based on an analytical method. The explicit expression of the transfer function taking into account phase and amplitude errors is presented in order to analyze the loss and crosstalk of the demultiplexer caused by fabrication errors. A basic requirement for the demultiplexer with a certain crosstalk criterion can be easily obtained. Using an etched diffraction grating demultiplexer as an example, it is shown that the analytical results have a good agreement with results from a numerical method.     

Harmonic Calculus on Fractals - A Measure Geometric Approach I

Differentiation of functions w.r.t. finite atomless measures with compact support on the real line is introduced. The related harmonic calculus is similar to that of the classical Lebesgue case. As an application we obtain the Weyl exponent for the spectral asymptotics of the Laplacians w.r.t. linear Cantor-type measures with arbitrary weights.     

An Implicit Iteration Process with Errors for a Finite Family of r-strictly Asymptotically Pseudocontractive Mappings

In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

阵列幅相误差条件下的目标方位估计

本文研究了一种改进的MUSIC法，可在一定阵列幅相误差条件下对多目标实现高分辨方位估计，有效地改善了原算法的参数估计性能，具有稳健性高、适用范围广以及工程实现简单等特点，通过大量的计算机仿真和水池实验表明，该方法具有较好的多目标分辨能力和方位估计精度，工程应用前景良好。     

Estimating Sampling Errors in REA Survey: A Model Approach for the Synthetic Presentation of Results for Main Variables Involved in Economic Analysis

A new sample business survey for agriculture, the REA survey, and a project of integration with the FADN network (RICA in Italy) have significantly changed the production of statistical information nowadays available with reference to the agricultural sector. On the basis of this relevant information, new economic analyses are being developed on farms’ performance, agricultural households’ income and the Common Agricultural Policy (CAP). In this paper the authors estimate the relationship between the levels of variables of interest and their sampling errors using models in order to improve the accessibility of the information on estimates accuracy to the final users (agricultural analysts, policy makers). The paper is the result of a joint research of the three authors. Sections 1–3 and 6 by Pizzoli, Sects. 4 and 5 by Rondinelli, Sect. 7 by Filiberti, conclusions joint to the three authors.     

证券价格按几何布朗运动变化的微观解释

金融市场研究中经常不加解释地假设证券价格按几何布朗运动变化 .本文通过假定投资者要求来自证券的期望收益率与证券价格无关 ,在理想市场的前提条件下 ,对证券价格运动将遵循有漂移率的几何布朗运动给予严格的证明 .