Multiple Condensation filters for road detection and tracking

In this paper, we present a novel and robust road tracking system for vision-based personal navigation. Novelty of the work includes the use of multiple Condensation filters to track the road of arbitrary shape and automatic switching between trackers according to road conditions. The approach allows the road to be represented as a simple hyperbola. It also supports the representation of the road as a sequence of connected arcs/segments so that information from a digital map can be integrated into tracking. The parameters of the hyperbola road model are estimated using multiple vanishing points located in image strips. The road tracking method is robust in dealing with complex road shapes, background clutters, shadows, and road markings. Experiments using real videos demonstrate the robustness of our approach.     

Analysis of pressure-driven electrokinetic flows in hydrophobic microchannels with slip-dependent zeta potential

The present study is an analysis of pressure-driven electrokinetic flows in hydrophobic microchannels with emphasis on the slip effects under coupling of interfacial electric and fluid slippage phenomena. Commonly used linear model with slip-independent zeta potential and the nonlinear model at limiting (high-K) condition with slip-dependent zeta potential are solved analytically. Then, numerical solutions of the electrokinetic flow model with zeta potential varying with slip length are analyzed. Different from the general notion of “the more hydrophobic the channel wall, the higher the flowrate,” the results with slip-independent and slip-dependent zeta potentials both disclose that flowrate becomes insensitive to the wall hydrophobicity or fluid slippage at sufficiently large slip lengths. Boundary slip not only assists fluid motion but also enhances counter-ions transport in EDL and, thus, results in strong streaming potential as well as electrokinetic retardation. With slip-dependent zeta potential considered, flowrate varies non-monotonically with increasing slip length due to competition of the favorable and adverse effects with more complicated interactions. The influence of the slip on the electrokinetic flow is eventually nullified at large slip lengths for balance of the counter effects, and the flowrate becomes insensitive to further hydrophobicity of the microchannel. The occurrence of maximum, minimum, and insensitivity on the flowrate-slip curves can be premature at a higher zeta potential and/or larger electrokinetic separation distance.     

Using jump-diffusion modeling for valuing real options in infrastructure projects

In infrastructure financed projects, in order to attract private investors, host governments often provide some guarantees. This paper develops a value model of minimum revenue guarantee with multiple-exercise real options under the impact of the emergency incident. The model is applied to infrastructure financed projects using the minimum revenue guarantee under simulation. The simulation results indicate that, before quantifying the value of the minimum revenue guarantee, it is necessary to forecast the jump degree and intensity of the emergency incident, as well as prevent and control risks arising from such emergencies. Otherwise, underestimation of the guarantee value will occur and the government will have to bear huge debt in this condition. We also analyze the dependence of the guaranteed value on the minimum guaranteed revenue level, initial revenue and number of exercise rights. For various conditions, the diagrams of the guaranteed value are also presented.     

A novel color image watermarking scheme in nonsampled contourlet-domain

Geometric distortion is known as one of the most difficult attacks to resist, for it can desynchronize the location of the watermark and hence causes incorrect watermark detection. It is a challenging work to design a robust color image watermarking scheme against geometric distortions. Based on the support vector regression (SVR) and nonsubsampled contourlet transform (NSCT), we propose a new color image watermarking algorithm with good visual quality and reasonable resistance toward geometric distortions in this paper. Firstly, the geometrically invariant space is constructed by using color image normalization, and a significant region is obtained from the normalized color image by utilizing the invariant centroid theory. Then, the NSCT is performed on the green channel of the significant region. Finally, the digital watermark is embedded into host color image by modifying the low frequency NSCT coefficients, in which the HVS masking is used to control the watermark embedding strength. In watermark detection, according to the high correlation among different channels of the color image, the digital watermark can be recovered by using SVR technique. Experimental results show that the proposed color image watermarking is not only invisible and robust against common image processing operations such as filtering, noise adding, and JPEG compression etc., but also robust against the geometrical distortions.     

Tuning of multi-loop PI controllers based on gain and phase margin specifications

In this paper, a single-iteration strategy is proposed for the design of a multi-loop PI controller to achieve the desired gain and phase margins for two-input and two-output (TITO) processes. To handle loop interactions, a TITO system is converted into two equivalent single loops with uncertainties drawn from interactions. The maximum uncertainty is estimated for the initial controller design in one loop and single-input and single-output (SISO) controller design is applied. This controller is substituted to other equivalent loop for design, and finally, the first loop controller is refined on knowledge of other loop controller. For SISO controller tuning, a new method is presented to determine the achievable gain and phase margins as well as the relevant controller parameters. Examples are given for illustration and comparison.     

Comparative analysis of a randomized N-policy queue: An improved maximum entropy method

We analyze a single removable and unreliable server in an M/G/1 queueing system operating under the 〈p, N〉-policy. As soon as the system size is greater than N, turn the server on with probability p and leave the server off with probability (1 ? p). All arriving customers demand the first essential service, where only some of them demand the second optional service. He needs a startup time before providing first essential service until there are no customers in the system. The server is subject to break down according to a Poisson process and his repair time obeys a general distribution. In this queueing system, the steady-state probabilities cannot be derived explicitly. Thus, we employ an improved maximum entropy method with several well-known constraints to estimate the probability distributions of system size and the expected waiting time in the system. By a comparative analysis between the exact and approximate results, we may demonstrate that the improved maximum entropy method is accurate enough for practical purpose, and it is a useful method for solving complex queueing systems.     

Parameter sensitivity study of the Nelder-Mead Simplex Method

This paper presents a parameter sensitivity study of the Nelder-Mead Simplex Method for unconstrained optimization. Nelder-Mead Simplex Method is very easy to implement in practice, because it does not require gradient computation; however, it is very sensitive to the choice of initial points selected. Fan-Zahara conducted a sensitivity study using a select set of test cases and suggested the best values for the parameters based on the highest percentage rate of successful minimization. Begambre-Laier used a strategy to control the Particle Swarm Optimization parameters based on the Nelder Mead Simplex Method in identifying structural damage. The main purpose of the paper is to extend their parameter sensitivity study to better understand the parameter’s behavior. The comprehensive parameter sensitivity study was conducted on seven test functions: B2, Beale, Booth, Wood, Rastrigin, Rosenbrock and Sphere Functions to search for common patterns and relationships each parameter has in producing the optimum solution. The results show important relations of the Nelder-Mead Simplex parameters: reflection, expansion, contraction, and Simplex size and how they impact the optimum solutions. This study is crucial, because better understanding of the parameters behavior can motivate current and future research using Nelder-Mead Simplex in creating an intelligent algorithm, which can be more effective, efficient, and save computational time.     

基于PolyTrans的IGES文件简化

CAD软件与基于多边形的3D软件之间数据转换需求不断增加,但是CAD模型复杂度和精细度却越来越高,数据转换的难度变大.为了解决这一难题,结合PolyTrans,分析如何解决一般3D软件难以导入大型的IGES(Initial Graphics Exchange Specifi-cation)文件的问题.从PolyTrans模型简化模块的理论依据着手,研究如何控制多边形的数量、降低文件的复杂性和减少文件的数量,使大型CAD装配模型能顺利地以单个实体形式导入Lightwave、3DS MAX以及Maya类的3D软件.并结合具体科研项目,给出了模型优化前后各指标参数对比情况.     

Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems

Terminal assignment problem (TEAP) is to determine minimum cost links to form a network by connecting a given set of terminals to a given collection of concentrators. This paper presents a novel discrete particle swarm optimization (PSO) based on estimation of distribution (EDA), named DPSO-EDA, for TEAP. EDAs sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from personal best solutions of all particles into the PSO, and therefore each particle has comprehensive learning and search ability. In the DPSO-EDA, a modified constraint handling method based on Hopfield neural network (HNN) is also introduced to fit nicely into the framework of the PSO and thus utilize the merit of the PSO. The DPSO-EDA adopts the asynchronous updating scheme. Further, the DPSO-EDA is applied to a problem directly related to TEAP, the task assignment problem (TAAP), in order to show that the DPSO-EDA can be generalized to other related combinatorial optimization problems. Simulation results on several problem instances show that the DPSO-EDA is better than previous methods.