Implicit Shape Reconstruction of Unorganized Points Using PDE-Based Deformable 3D Manifolds

<正>In this work we consider the problem of shape reconstruction from an unorganized data set which has many important applications in medical imaging,scientific computing,reverse engineering and geometric modelling.The reconstructed surface is obtained by continuously deforming an initial surface following the Partial Differential Equation(PDE)-based diffusion model derived by a minimal volume-like variational formulation.The evolution is driven both by the distance from the data set and by the curvature analytically computed by it.The distance function is computed by implicit local interpolants defined in terms of radial basis functions.Space discretization of the PDE model is obtained by finite co-volume schemes and semi-implicit approach is used in time/scale.The use of a level set method for the numerical computation of the surface reconstruction allows us to handle complex geometry and even changing topology, without the need of user-interaction.Numerical examples demonstrate the ability of the proposed method to produce high quality reconstructions.Moreover,we show the effectiveness of the new approach to solve hole filling problems and Boolean operations between different data sets.     

Multivariate quasi-tight framelets with high balancing orders derived from any compactly supported refinable vector functions

Generalizing wavelets by adding desired redundancy and flexibility,framelets(i.e.,wavelet frames)are of interest and importance in many applications such as image processing and numerical algorithms.Several key properties of framelets are high vanishing moments for sparse multiscale representation,fast framelet transforms for numerical efficiency,and redundancy for robustness.However,it is a challenging problem to study and construct multivariate nonseparable framelets,mainly due to their intrinsic connections to factorization and syzygy modules of multivariate polynomial matrices.Moreover,all the known multivariate tight framelets derived from spline refinable scalar functions have only one vanishing moment,and framelets derived from refinable vector functions are barely studied yet in the literature.In this paper,we circumvent the above difficulties through the approach of quasi-tight framelets,which behave almost identically to tight framelets.Employing the popular oblique extension principle(OEP),from an arbitrary compactly supported M-refinable vector functionφwith multiplicity greater than one,we prove that we can always derive fromφa compactly supported multivariate quasi-tight framelet such that:(i)all the framelet generators have the highest possible order of vanishing moments;(ii)its associated fast framelet transform has the highest balancing order and is compact.For a refinable scalar functionφ(i.e.,its multiplicity is one),the above item(ii)often cannot be achieved intrinsically but we show that we can always construct a compactly supported OEP-based multivariate quasi-tight framelet derived fromφsatisfying item(i).We point out that constructing OEP-based quasi-tight framelets is closely related to the generalized spectral factorization of Hermitian trigonometric polynomial matrices.Our proof is critically built on a newly developed result on the normal form of a matrix-valued filter,which is of interest and importance in itself for greatly facilitating the study of refinable vector functions and multiwavelets/multiframelets.This paper provides a comprehensive investigation on OEP-based multivariate quasi-tight multiframelets and their associated framelet transforms with high balancing orders.This deepens our theoretical understanding of multivariate quasi-tight multiframelets and their associated fast multiframelet transforms.     

Singular integral operators on product domains along twisted surfaces

We introduce a class of singular integral operators on product domains along twisted surfaces.We prove that the operators are bounded on L^p provided that the kernels satisfy weak conditions.     

Poisson Stable Solutions for Stochastic Differential Equations with Lévy Noise

In this paper,we use a unified framework to study Poisson stable(including stationary,periodic,quasi-periodic,almost periodic,almost automorphic,Birkhoff recurrent,almost recurrent in the sense of Bebutov,Levitan almost periodic,pseudo-periodic,pseudo-recurrent and Poisson stable)solutions for semilinear stochastic differential equations driven by infinite dimensional L′evy noise with large jumps.Under suitable conditions on drift,diffusion and jump coefficients,we prove that there exist solutions which inherit the Poisson stability of coefficients.Further we show that these solutions are globally asymptotically stable in square-mean sense.Finally,we illustrate our theoretical results by several examples.     

手机套餐问题的一个数学模型

随着信息时代的到来,手机在人们日常工作、社交、经营等社会活动中的作用越来越重要.近年来我国通信业务量飞速增长,手机的功劳更是功不可没.手机资费问题也越来越受到人们的关注,并且对原有的各种资费方案越来越质疑.2007年1月以来上海、北京、广东等地相继推出的手机"套餐"琳琅满目,让人眼花缭乱,人们不能理性分辨手机"套餐"究竟优惠在何处.……     

Kobayashi’s and Teichmuller’s Metrics and Bers Complex Manifold Structure on Circle Diffeomorphisms

Given a modulus of continuity ω,we consider the Teichmuller space TC1+ω as the space of all orientation-preserving circle diffeomorphisms whose derivatives are ω-continuous functions modulo the space of Mobius transformations preserving the unit disk.We study several distortion properties for diffeomorphisms and quasisymmetric homeomorphisms.Using these distortion properties,we give the Bers complex manifold structure on the Teichm(u| ")ller space TC^1+H as the union of over all0 <α≤1,which turns out to be the largest space in the Teichmuller space of C1 orientation-preserving circle diffeomorphisms on which we can assign such a structure.Furthermore,we prove that with the Bers complex manifold structure on TC^1+H ,Kobayashi’s metric and Teichmuller’s metric coincide.     

Difference of a Hauptmodul for Γ0(N ) and certain Gross-Zagier type CM value formulas

In this work, we show that the difference of a Hauptmodul for a genus zero group Γ₀(N) as a modular function on Y₀(N) × Y₀(N) is a Borcherds lift of type(2, 2). As applications, we derive the monster denominator formula like product expansions for these modular functions and certain Gross-Zagier type CM value formulas.     

Populations with individual variation in dispersal in heterogeneous environments: Dynamics and competition with simply diffusing populations

We consider a model for a population in a heterogeneous environment, with logistic-type local population dynamics, under the assumption that individuals can switch between two different nonzero rates of diffusion. Such switching behavior has been observed in some natural systems. We study how environmental heterogeneity and the rates of switching and diffusion affect the persistence of the population. The reactiondiffusion systems in the models can be cooperative at some population densities and competitive at others. The results extend our previous work on similar models in homogeneous environments. We also consider competition between two populations that are ecologically identical, but where one population diffuses at a fixed rate and the other switches between two different diffusion rates. The motivation for that is to gain insight into when switching might be advantageous versus diffusing at a fixed rate. This is a variation on the classical results for ecologically identical competitors with differing fixed diffusion rates, where it is well known that "the slower diffuser wins".     

A SPECTRAL METHOD FOR A WEAKLY SINGULAR VOLTERRA INTEGRO-DIFFERENTIAL EQUATION WITH PANTOGRAPH DELAY

In this paper,a Jacobi-collocation spectral method is developed for a Volterraintegro-differential equation with delay,which contains a weakly singular kernel.We use a function transformation and a variable transformation to change the equation into a new Volterra integral equation defined on the standard interval [-1,1],so that the Jacobi orthogonal polynomial theory can be applied conveniently.In order to obtain high order accuracy for the approximation,the integral term in the resulting equat...     

Solitary Wave Solutions of Some Nonlinear Physical Models Using Riccati Equation Approach

Riccati equation approach is used to look for exact travelling wave solutions of some nonlinear physical models.Solitary wave solutions are established for the modified KdV equation,the Boussinesq equation and the Zakharov-Kuznetsov equation.New generalized solitary wave solutions with some free parameters are derived.The obtained solutions,which includes some previously known solitary wave solutions and some new ones,are expressed by a composition of Riccati differential equation solutions followed by a polynomial.The employed approach,which is straightforward and concise,is expected to be further employed in obtaining new solitary wave solutions for nonlinear physical problems.     

Formulation of linear problems and solution by a universal machine

Using the predicate language for ordered fields a class of problems referred to aslinear problems is defined. This class contains, for example, all systems of linear equations and inequalities, all linear programming problems, all integer programming problems with bounded variables, all linear complementarity problems, the testing of whether sets that are defined by linear inequalities are semilattices, all satisfiability problems in sentenial logic, the rank-computation of matrices, the computation of row-reduced echelon forms of matrices, and all quadratic programming problems with bounded variables. A single, one, algorithm, to which we refer as theUniversal Linear Machine, is described. It solves any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates alinear algorithm for the problem. Then, given an instance of the linear problem, in the second phase the linear algorithm solves the particular instance of the linear problem. The linear algorithm is finite, deterministic, loopless and executes only the five ordered field operations — additions, multiplications, subtractions, divisions and comparisons. Conversely, we show that for each linear algorithm there is a linear problem which the linear algorithm solves uniquely. Finally, it is shown that with a linear algorithm for a linear problem, one can solve certain parametric instances of the linear problem.Research was supported in part by the National Science Foundation Grant DMS 92-07409, by the Department of Energy Grant DE-FG03-87-ER-25028, by the United States—Israel Binational Science Foundation Grant 90-00434 and by ONR Grant N00014-92-J1142.Corresponding author.     

泛系分析:数学·方法论·相对论·辩证思维

基于对广义系统、泛导、泛对称、泛箱原理、泛系相对性提出了新的分析模式与新的相对数学化的简化强化的定义,发展了泛系方法论与泛系相对论的框架与理法,具体内容涉及:相对普适的数学化的泛系,200类对偶,对偶转化,泛对称转化,泛系辩证,八畴方法,泛系数学方法,广义量化,逼近转化原则,泛等价定理,供求分析,思维实验,广义灰色系统,等等.     

Transverse compression of PPTA fibers

Results of single transverse compression testing of PPTA and PIPD fibers, using a novel test device, are presented and discussed. In the tests, short lengths of single fibers are compressed between two parallel, stiff platens. The fiber elastic deformation is analyzed as a Hertzian contact problem. The inelastic deformation is analyzed by elastic-plastic FE simulation and by laser-scanning confocal microscopy of the compressed fibers ex post facto. The results obtained are compared to those in the literature and to the theoretical predictions of PPTA fiber transverse elasticity based on PPTA crystal elasticity.Presented at the 11th International Conference on Mechanics of Composite Materials (Riga, June 11–15, 2000).3TEX, Inc. 109, MacKenan Drive, Cary, North Carolina 27511, USA. Published in Mekhanika Kompozitnykh Materialov, Vol. 36, No. 4, pp. 533–544, March–April, 2000.     

并行分批排序综述

并行分批排序起源于半导体芯片制造过程。在并行分批排序中,工件可成批加工,批加工机器最多可同时加工B个工件,批的加工时间为批中所有工件的最大工时。首先根据传统的机器环境和目标函数对并行分批排序已有成果进行分类介绍,主要为单机和平行机的机器环境,以及极小化最大完工时间、极小化总完工时间、极小化最大延迟、极小化误工工件数、极小化总延误和极小化最大延误的目标函数;然后梳理了由基本问题所衍生出来的具有新特点的16类新型并行分批排序,包括差异尺寸工件、多目标、工件加工时间或顺序存在限制、考虑费用和具有特殊机制等情况;最后展望未来的研究方向。     

A double-stage piecewise recursive filter for real-time applications

This paper examines the basic problem of estimating the state of a system described by a set of dynamical equations. The state estimation is performed by means of optimal filtering techniques in which the state observation is given by a set of nonlinear equations.The basic issue encountered in most engineering problems is the availability of more observable information than the processor can effectively process in real-time, while performing full optimal filtering on all available observable data. To alleviate this deficiency, an algorithm is developed in which the rate of information processing is kept at a high value, while the system statistics are evaluated at a much slower rate.The method utilizes a combination of fast and slow filtering loops, in which the observable data are processed at a high rate during the fast loop, while the system error covariance, gain computations, and all other system statistics are processed at a lower rate in the slow loop. Methods are provided to resolve any incompatibility in the system statistics resulting from this fast-loop/slow-loop processing combination.Applications describing problems pertaining to aircraft navigation are presented. Specifically, applications to aircraft navigation through a satellite network are studied. Appropriate simulation results from the above studies are shown.This work was performed under contract with the Department of the Air Force, Space and Missile Organization (SAMSO), Los Angeles, California, Contract No. F04-701-75-C-0180.The authors are indebted to Dr. C. Johnson, GPS System Engineer, Mr. G. Consolver, GPS Software Manager, and Mr. W. Riley, Communications/Navigation Department, Texas Instruments for their continuous encouragement in the course of this work. Also, they are indebted to Major M. Birnbaum, SAMSO, for his constructive criticism on the conceptual design of this work, and to Mr. A. Bierman, Aerospace Corporation, for kindly providing simulation data of aircraft trajectories. Finally, the authors would like to express their gratitude to Dr. N. Carlson, Intermetrics, for valuable consultation during the progress of this work.Portions of this paper were presented by the senior author at the GSP Conference, Plan 76, IEEE Position, Location, and Navigation Symposium, San Diego, California, 1976.     

基于模糊FNN-ELECTRE法的国有商业银行竞争力评价

随着金融业全方位开放,国有商业银行已成为国家经济命脉的核心,其竞争力强弱关系着国家经济的繁荣与衰退。本文基于模糊FNN-ELECTRE方法建立国有商业银行竞争力评价模型,以因素神经网络理论(FNN)与ELECTRE融合方法为基础,以现有商业银行竞争力评价指标为着眼,把国有商业银行竞争力的评价体系从现实竞争力和潜在竞争力两个因素抽取为一级指标,以规模、质量、业务结构、效率、成长性五个因素设为二级指标。从实证的角度对银行A、银行B、银行C、银行D、银行E五大国有银行进行分析验证,对其属性值进行和谐性与非和谐性检验得出,银行B竞争能力最强,银行E竞争能力最弱,五大国有银行均有改进空间。     

区组长为奇素数的自反MD设计

本文利用差方法对自反MD设计SCMD(4mp,p,1)的存在性给出了构造性证明,这里p为奇素数,m为正整数．     

Professor Sun Yongsheng

Sun Yongsheng, professor of mathematics, was born on January 22, 1929, in Wanghaisi Village, Cang County, Hebei Province, China. He died of lung cancer at 23 hour 15 minutes,March 22, 2006 in Beijing.     

Immersive Projection Technology for Visual Data Mining

The PlatoCAVE, the MiniCAVE, and the C2 are immersive stereoscopic projectionbased virtual reality environments oriented toward group interactions. As such they are particularly suited to collaborative efforts in data analysis and visual data mining. In this article, we provide an overview of virtual reality in general, including immersive projection technology, and the use of stereoscopic displays for data visualization. We discuss design considerations for the construction of these immersive environments including one-wall versus four-wall implementations, augmented reality, stereoscopic placement, head tracking, the use of LCD devices, polarized light stereo, voice control, and image synchronization.     

Components of the Fundamental Category II

In this article we carry on the study of the fundamental category (Goubault and Raussen, Dihomotopy as a tool in state space analysis. In: Rajsbaum, S. (ed.) LATIN 2002: Theoretical Informatics. Lecture Notes in Computer Science, vol. 2286, Cancun, Mexico, pp. 16–37, Springer, Berlin Heidelberg New York, 2002; Goubault, Homology, Homotopy Appl., 5(2): 95–136, 2003) of a partially ordered topological space (Nachbin, Topology and Order, Van Nostrand, Princeton, 1965; Johnstone, Stone Spaces, Cambridge University Press, Cambridge, MA, 1982), as arising in e.g. concurrency theory (Fajstrup et al., Theor. Comp. Sci. 357: 241–278, 2006), initiated in (Fajstrup et al., APCS, 12(1): 81–108, 2004). The “algebra” of dipaths modulo dihomotopy (the fundamental category) of such a po-space is essentially finite in a number of situations. We give new definitions of the component category that are more tractable than the one of Fajstrup et al. (APCS, 12(1): 81–108, 2004), as well as give definitions of future and past component categories, related to the past and future models of Grandis (Theory Appl. Categ., 15(4): 95–146, 2005). The component category is defined as a category of fractions, but it can be shown to be equivalent to a quotient category, much easier to portray. A van Kampen theorem is known to be available on fundamental categories (Grandis, Cahiers Topologie Géom. Différentielle Catég., 44: 281–316, 2003; Goubault, Homology, Homotopy Appl., 5(2): 95–136, 2003), we show in this paper a similar theorem for component categories (conjectured in Fajstrup et al. (APCS, 12(1): 81–108, 2004). This proves useful for inductively computing the component category in some circumstances, for instance, in the case of simple PV mutual exclusion models (Goubault and Haucourt, A practical application of geometric semantics to static analysis of concurrent programs. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005 – Concurrency Theory: 16th International Conference, San Francisco, USA, August 23–26. Lecture Notes in Computer Science, vol. 3653, pp. 503–517, Springer, Berlin Heidelberg New York, 2005), corresponding to partially ordered subspaces of R ⁿ minus isothetic hyperrectangles. In this last case again, we conjecture (and give some hints) that component categories enjoy some nice adjunction relations directly with the fundamental category.