Cone Adaptation Strategies for a Finite and Exact Cutting Plane Algorithm for Concave Minimization

In this paper we are concerned with pure cutting plane algorithms for concave minimization. One of the most common types of cutting planes for performing the cutting operation in such algorithm is the concavity cut. However, it is still unknown whether the finite convergence of a cutting plane algorithm can be enforced by the concavity cut itself or not. Furthermore, computational experiments have shown that concavity cuts tend to become shallower with increasing iteration. To overcome these problems we recently proposed a procedure, called cone adaptation, which deepens concavity cuts in such a way that the resulting cuts have at least a certain depth with 0, where is independent of the respective iteration, which enforces the finite convergence of the cutting plane algorithm. However, a crucial element of our proof that these cuts have a depth of at least was that we had to confine ourselves to -global optimal solutions, where is a prescribed strictly positive constant. In this paper we examine possible ways to ensure the finite convergence of a pure cutting plane algorithm for the case where = 0.     

驾驶员暗适应测试仪的研究

驾驶员暗适应测试仪由单片计算机系统、暗箱、强光产生部分及视标显示等部分组成。被测者在强光刺激之后,进入黑暗状态。同时测试仪开始计时,至被测者看清视标时停止计时。所计得的时间为其暗适应时间。测试仪测试的结果可显示在显示器上也可由打印机打印。实测结果表明驾驶员的暗适应时间有较显著的差异     

LED光源光谱对隧道出口段明适应的影响

随着我国经济的不断发展,高速公路隧道建设的发展也非常迅猛。前期在隧道的实际工程设计中,为完全保证隧道车辆通行安全,隧道内部全线灯具的输出功率和安装布置全部取决于一年四季中最大的洞外亮度值和车辆速度值。这样的设计尽管充分考虑了安全性,但盲目的增加隧道照明亮度,不能够缓解视觉适应的问题。随着LED在隧道照明中的应用, LED光源光谱的影响逐渐引起人们的关注。调查研究发现高速公路隧道在出口段交通事故发生率比较高,主要原因是隧道出口段内外亮度差较大,驾驶员在驶离时明适应时间较长。LED光源的光谱呈现双峰结构,在长波长范围内,光谱含量差异明显。明适应的能力主要与两个因素有关,一是瞳孔面积的变化;二是感光色素的光化学反应。不同色温的LED具有不同的光谱特性,进而通过影响感光色素的合成,来影响明适应的时间长短。现在市场上可用的隧道照明LED光源的色温可选范围比较广,所以实验选取了市场上可用的不同色温的大功率的LED光源作为研究对象,其色温分别是3 000, 3 500, 4 000, 4 500, 5 000, 5 700和6 500 K等7种。邀请了30名视觉功能正常,矫正视力1.0以上,且无色盲、色弱等其他眼疾的观察者参加了本次实验。地点选择在长9 m,高2.8 m,宽5 m的模拟隧道内。实验参数选取3组亮度值,分别为4, 8和12 cd·m^-2;2个灯具安装高度分别是2.0和2.4 m;3个安装角度分别是15°, 20°和25°。共评估了126种照明条件。实验结果表明:隧道出口段亮度越大,明适应时间越小;当亮度相同时,随着色温的增大,明适应时间减小;灯具安装角度和安装高度对光谱的影响很小,改变安装高度和安装角度并不能有效的减小明适应时间。从明适应的角度出发,通过分析不同色温LED灯的光谱,为隧道照明设计与应用中出口段LED光源的选择提供数据和理论支撑。     

Dynamically adapted grids for interacting discontinuous solutions

Further development of the dynamic adaptation method for gas dynamics problems that describe multiple interactions of shock waves, rarefaction waves, and contact discontinuities is considered. Using the Woodward-Colella problem and a nonuniformly accelerating piston as examples, the efficiency of the proposed method is demonstrated for the gas dynamics problems with shock wave and contact discontinuity tracking. The grid points are distributed under the control of the diffusion approximation. The choice of the diffusion coefficient for obtaining both quasi-uniform and strongly nonuniform grids for each subdomain of the solution is validated. The interaction between discontinuities is resolved using the Riemann problem for an arbitrary discontinuity. Application of the dynamic adaptation method to the Woodward-Colella problem made it possible to obtain a solution on a grid consisting of 420 cells that is almost identical to the solution obtained using the WENO5m method on a grid consisting of 12 800 cells. In the problem for a nonuniformly accelerating piston, a proper choice of the diffusion coefficient in the transformation functions makes it possible to generate strongly nonuniform grids, which are used to simulate the interaction of a series of shock waves using shock wave and contact discontinuity tracking.     

Third‐order Cartesian overset mesh adaptation method for solving steady compressible flows

A third‐order mesh generation and adaptation method is presented for solving the steady compressible Euler equations. For interior points, a third‐order scheme is used on Cartesian and curvilinear meshes. Concerning the mesh adaptation, the method of Meakin is also extended to third order. The accuracy of the new overset mesh adaptation method is demonstrated by a grid convergence study for 2‐D inviscid model problems and results are compared with a second‐order method. Finally, the method is applied to the computation of an inviscid 3‐D flow around a hovering blade of the ONERA 7A helicopter rotor exhibiting an improvement in the wake capture. With a 7 million point mesh, the tip vortex can be followed for more than three rotor revolutions with the third‐order method. The CPU time needed for this calculation is only 3% higher than with a conventional second‐order method. Copyright © 2007 John Wiley & Sons, Ltd.     

An Integrated Circuit for Two-Dimensional Edge-Detection with Local Adaptation Based on Retinal Networks

We designed an integrated circuit for edge detection of a two-dimensional image based on the vertebrate outer retina, which has wide dynamic range in image processing. The unit circuit is simple, and operates as a current-mode analog metal-oxide-semiconductor (MOS) circuit. In order to extract edges from an image composed of bright and dark domains, the circuit realizes a function called local adaptation in which the sensitivity adapts to local brightness of the image. Simulation results, using the simulation program with integrated circuit emphasis (SPICE), of two-dimensional Gaussian-distributed images in which the intensity ranged over four orders of magnitude, showed the local adaptation. As a result, the intensity of output images was in the range of one order of magnitude. Furthermore, as the simulation result of real images, it was shown that edges in the dark domain, which was five times darker than the bright domain, were successfully detected as the bright domain in which input photocurrents ranged over two orders of magnitude.     

Color Appearance Explained,Predicted and Confirmed by the Concept of Recognized Visual Space of Illumination

Ten years have passed since we proposed a new concept called recognized visual space of illumination (RVSI). The central idea of the concept assumes that our brain first recognizes how a space is illuminated and then judges colors of anything seen in the space in relation to the RVSI constructed for the space. In another expression we say that the space is recognized first and the color perception next. In this paper some of our experiments that proved the appropriateness of the concept will be introduced. When a white paper was seen through a colored filter we could perceive the paper as white at the same instant we recognized a space through and beyond the filter. When an achromatic patch independent from the room illumination was observed under colored illumination its appearance immediately changed to that roughly opponent to the illumination color. When two gray patches of the same lightness were drawn in a picture of a white grating on a black background on a way that one appeared to locate on this side of the grating and the other in the other side, the former appeared brighter. These all confirmed the predictions based on the RVSI concept.     

A Network of Analog Metal Oxide Semiconductor Circuits for Motion Detection with Local Adaptation to a Background Image

Inspired by a mechanism of biological vision systems, a model and a network of analog metal oxide semiconductor (MOS) circuits are proposed which display an optical flow with local adaptation to the relative velocity of a background image. A function of displaying an optical flow successfully worked as a result of simulations using the simulation program with integrated circuit emphasis (SPICE). A function of varying an optical flow at a certain instant by local adaptation was also demonstrated. The proposed network is suitable for the realization of a large-scale integrated circuit (LSI), which displays an optical flow with local adaptation to the local velocity of a background.     

Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique

This paper presents some adaptive restart randomized greedy heuristics for MAXIMUM CLIQUE. The algorithms are based on improvements and variations of previously-studied algorithms by the authors. Three kinds of adaptation are studied: adaptation of the initial state (AI) given to the greedy heuristic, adaptation of vertex weights (AW) on the graph, and no adaptation (NA). Two kinds of initialization of the vertex-weights are investigated: unweighted initialization (w _i := 1) and degree-based initialization (w _i := d _i where d _i is the degree of vertex i in the graph). Experiments are conducted on several kinds of graphs (random, structured) with six combinations: {NA, AI, and AW} × {unweighted initialization, degree-based initialization. A seventh state of the art semi-greedy algorithm, DMclique, is evaluated as a benchmark algorithm. We concentrate on the problem of finding large cliques in large, dense graphs in a relatively short amount of time. We find that the different strategies produce different effects, and that different algorithms work best on different kinds of graphs.     

基于Voronoi cells的二维不规则自适应网格的生成及其应用

基于Voronoi cells的数据结构和算法，给出了一种二维不规则自适应网格的生成方法，用VisualC＋＋语言在微机上开发了Windows环境下网格自动生成的可视化软件。既可以得到Voronoi cells网格，也可得到相应的Delaunay triangles网格，网格生成的实例表明，本文方法所得到的网格非常适合于多尺度系统的流动问题的计算，具有较好的应用前景。