基于一维标定物和改进进化策略的相机标定

为了解决运动参数光电探测过程中的相机标定问题,制作一种两端及中间各安装一个红外反光标记球的一维标定物.不需要其它复杂标定装置,只要将这种特制的一维标定物在测量空间内多次随意移动并摄取其图像,即可实现标定.算法首先假定主点位于像面中心附近的某个位置,再求出焦距、旋转矩阵、平移向量和比例因子,最后通过评价函数将相机标定转换成寻找两相机最佳主点对的非线性最小化问题.在传统进化策略中引进个体的自我改进系数、个体间距离等概念,提出了求取子代个体间的欧式距离并排序的方法,设计了搜索最佳主点对的改进型进化策略算法.与传统标定方法相比,基于一维标定物的方法克服了多相机场合的遮挡问题,改进进化策略的引入打破了一维标定物需做某种特殊运动的限制,使一维标定物自由运动时相机内、外参数的同时求解成为可能,改进的模拟退火进化策略改善了算法的全局收敛性能并加快了收敛速度.     

在分光计实验中的几何关系探究

从空间几何的角度来对分光计的构造、结构以及调节方法等方面来加以说明，以便从根本上掌握分光计设计的原理、调节的思路以及拓展的方法。     

Tracking problem under a time-varying topology

This paper studies the multi-agent tracking problem of a third-order maneuvering target under uncertain communication environments. Each tracking agent is assumed to be a third-order system and can only use its own and neighbors＇ position, velocity, and acceleration information to design its control input. In this work, the uncertain communication environments are modelled by a finite number of constant Laplacian matrices together with their corresponding scheduling functions. Sufficient conditions for the existence of a tracking strategy have been expressed in terms of the solvability of linear matrix inequalities. Finally, a numerical example is employed to demonstrate the effectiveness of the proposed tracking strategy.     

Inflow conditions for spatial direct numerical simulation of turbulent boundary layers

The inflow conditions for spatial direct numerical simulation (SDNS) of turbulent boundary layers should reflect the characteristics of upstream turbulence, which is a puzzle. In this paper a new method is suggested, in which the flow field obtained by using temporal direct numerical simulation (TDNS) for fully developed turbulent flow (only flow field for a single moment is sufficient) can be used as the inflow of SDNS with a proper transformation. The calculation results confirm that this method is feasible and effective. It is also found that, under a proper time-space transformation, all statistics of the fully developed turbulence obtained by both temporal mode and spatial mode DNS are in excellent agreement with each other, not only qualitatively, but also quantitatively. The normal-wise distributions of mean flow profile, turbulent Mach number and the root mean square (RMS) of the fluctuations of various variables, as well as the Reynolds stresses of the fully developed turbulence obtained by using SDNS, bear similarity in nature. Supported by the National Natural Science Foundation of China (Grant No. 90205021), the China Postdoctoral Science Foundation (Grant No. 20060400707), and the Foundation for the Author of National Excellent Doctoral Dissertation of China (Grant No. 200328), and partially supported by Liu-Hui Center of Applied Mathematics, Nankai University and Tianjin University     

Monte-Carlo simulation of a compact gamma-ray detector using wavelength-shifting fibers coupled to a YAP scintillation crystal

The production and transportation of fluorescent light produced in wavelength-shifting fibers (WSFs) coupled to YAP scintillation crystal is simulated using the GEANT4 codes.An advantage of the wavelength-shifting fiber readout technique over a direct readout with a position-sensitive photo-sensor is the reduced requirement for position sensitive photomultiplier tube photocathode area.With this gamma-ray detector,the gamma camera is small and flexible and has larger effective field of view and low cost.Simulation results show that a) a mean 12 of photons per 59.5 keV gamma ray interaction is produced in the WSF located nearest to the incident gamma ray,and a spatial resolution of 3.6 mm FWHM is obtained,b)a mean 27 of photons per 140 keV gamma ray interaction is produced and a spatial resolution of 3.1 mm FWHM is obtained.Results demonstrate the feasibility of this concept of a compact gamma-ray detector based on wavelength-shifting fibers readout.However,since the very low photoelectron levels,it is very important to use a photon counting device with good single photo-electron response to readout the WSFs.     

Sequential Discrete p-Facility Models for Competitive Location Planning

Two new models for duopolistic competitive discrete location planning with sequential acting and variable delivered prices are introduced. If locations and prices are assumed to be set once and for all by the players, the resulting bilevel program is nonlinear. Under the assumption that further price adjustments are possible, i.e., that a Nash equilibrium in prices is reached, the model can be simplified to a linear discrete bilevel formulation. It is shown that in either situation players should not share any locations or markets if they strive for profit-maximization.For the situation with price adjustments, a heuristic solution procedure is suggested. In addition, the bilevel models are shown to serve as a basis from which different well-known location models – as, for example, the p-median problem, the preemptive location problem and the maximum covering problem – can be derived as special cases.     

Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows

This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The underlying objective function combines the minimization of the number of vehicles in the first search phase of the metaheuristic with the minimization of the total travel distance in the second search phase. The parallelization of the metaheuristic follows a type 3 parallelization strategy (cf. Crainic and Toulouse (2001). In F. Glover and G. Kochenberger (eds.). State-of-the-Art Handbook in Metaheuristics. Norwell, MA: Kluwer Academic Publishers), i.e. several concurrent searches of the solution space are carried out with a differently configured metaheuristic. The concurrently executed processes cooperate through the exchange of solutions. The parallelized two-phase metaheuristic was subjected to a comparative test on the basis of 358 problems from the literature with sizes varying from 100 to 1000 customers. The derived results seem to justify the proposed parallelization concept.     

Solitons and Fractal Kerr Response

Optical solitary waves that propagate in a Kerr medium exhibiting a power-law nonlocal response are studied analytically. The first-principles stability analysis based on quantum field theory shows that within the whole range of the exponent (the fractal dimension) the solitary wave can be stabilized.     

Phase-matched high-order harmonics by interaction of Ar atoms with high-repetition-rate low-energy femtosecond laser pulses

High-order harmonics are generated by coherent interaction of an intense laser and atoms or molecules[1]. With the development of the intense ultrashort pulse laser, the research of high-order harmonic generation has reached the water-window in spectral region[2] and subfemtosecond in time domain[3]. Especially, the generation and application of subfemtosecond pulse led the study of high-order harmonic generation into a completely new world[4, 5]. It has made the study of ultrafast science fro…     

How to make a triangulation of polytopal

We introduce a numerical isomorphism invariant for any triangulation of . Although its definition is purely topological (inspired by the bridge number of knots), reflects the geometric properties of . Specifically, if is polytopal or shellable, then is ``small' in the sense that we obtain a linear upper bound for in the number of tetrahedra of . Conversely, if is ``small', then is ``almost' polytopal, since we show how to transform into a polytopal triangulation by local subdivisions. The minimal number of local subdivisions needed to transform into a polytopal triangulation is at least . Using our previous results [The size of triangulations supporting a given link, Geometry & Topology 5 (2001), 369-398], we obtain a general upper bound for exponential in . We prove here by explicit constructions that there is no general subexponential upper bound for in . Thus, we obtain triangulations that are ``very far' from being polytopal. Our results yield a recognition algorithm for that is conceptually simpler, although somewhat slower, than the famous Rubinstein-Thompson algorithm.