Initial pre-stress finding procedure and structural performance research for Levy cable dome based on linear adjustment theory

The cable-strut structural system is statically and kinematically indeterminate. The initial pre-stress is a key factor for determining the shape and load carrying capacity. A new numerical algorithm is presented herein for the initial pre-stress finding procedure of complete cable-strut assembly. This method is based on the linear adjustment theory and does not take into account the material behavior. By using this method,the initial pre-stress of the multi self-stress modes can be found easily and the cal-culation process is simplified and efficient also. Finally,the initial pre-stress and structural performances of a particular Levy cable dome are analyzed comprehensively. The algorithm has proven to be efficient and correct,and the numerical results are valuable for practical design of Levy cable dome.     

Optimal Rapid Restart of Heuristic Methods of NP Hard Problems

Many heuristic search methods exhibit a remarkable variability in the time required to solve some particular problem instances. Their cost distributions are often heavy-tailed. It has been demonstrated that, in most cases, rapid restart (RR) method can prominently suppress the heavy-tailed nature of the instances and improve computation efficiency. However, it is usually time-consuming to check whether an algorithm on a specific instance is heavy-tailed or not. Moreover, if the heavy-tailed distribution is confirmed and the RR method is relevant, an optimal RR threshold should be chosen to facilitate the RR mechanism. In this paper, an approximate approach is proposed to quickly check whether an algorithm on a specific instance is heavy-tailed or not. The method is realized by means of calculating the maximal Lyapunov exponent of its generic running trace. Then a statistical formula to estimate the optimal RR threshold is educed. The method is based on common nonparametric estimation, e.g. , Kernel estimation. Two heuristic methods are selected to verify our method. The experimental results are consistent with the theoretical consideration perfectly.     

Machining distortion prediction of aerospace monolithic components

To predict the distortion of aerospace monolithic components, a model is established to simulate the numerical control （NC） milling process using 3D finite element method （FEM）. In this model, the cutting layer is simplified firstly. Then, the models of cutting force and cutting temperature are established to gain the cutting loads, which are applied to the mesh model of the part. Finally, a prototype of machining simulation environment is developed to simulate the milling process of a spar. Key factors influencing the distortion, such as initial residual stress, cutting loads, fixture layout, cutting sequence, and tool path are considered all together. The total distortion of the spar is predicted and an experiment is conducted to validate the numerical results. It is found that the maximum discrepancy between the simulation results and experiment values is 19.0%.     

Mesh size effect in numerical simulation of blast wave propagation and interaction with structures

Numerical method is popular in analysing the blast wave propagation and interaction with structures.However,because of the extremely short duration of blast wave and energy trans-mission between different grids,the numerical results are sensitive to the finite element mesh size.Previous numerical simulations show that a mesh size acceptable to one blast scenario might not be proper for another case,even though the difference between the two scenarios is very small,indicating a simple numerical mesh size convergence test might not be enough to guarantee accu-rate numerical results.Therefore,both coarse mesh and fine mesh were used in different blast scenarios to investigate the mesh size effect on numerical results of blast wave propagation and interaction with structures.Based on the numerical results and their comparison with field test re-sults and the design charts in TM5-1300,a numerical modification method was proposed to correct the influence of the mesh size on the simulated results.It can be easily used to improve the accu-racy of the numerical results of blast wave propagation and blast loads on structures.     

Optimal evacuation scheme based on dam-break flood numerical simulation

The optimal evacuation scheme is studied based on the dam-break flood numerical simulation. A threedimensional dam-break mathematical model combined with the volume of fluid (VOF) method is adopted. According to the hydraulic information obtained from numerical simulation and selecting principles of evacuation emergency scheme, evacuation route analysis model is proposed, which consists of the road right model and random degree model. The road right model is used to calculate the consumption time in roads, and the random degree model is used to judge whether the roads are blocked. Then the shortest evacuation route is obtained based on Dijstra algorithm. Gongming Reservoir located in Shenzhen is taken as a case to study. The results show that industrial area Ⅰ is flooded at 2 500 s, and after 5 500 s, most of industrial area Ⅱ is submerged. The Hushan, Loucun Forest and Chaishan are not flooded around industrial area Ⅰand Ⅱ. Based on the above analysis, the optimal evacuation scheme is determined.     

Customer-Classified Algorithm Based onFuzzy Clustering Analysis

A customer-classified evaluation system is described with the customization-supporting tree of evaluation indexes, in which users can determine any evaluation index independently. Based on this system, a customer-classified algorithm based on fuzzy clustering analysis is proposed to implement the customer-classified management. A numerical example is presented, which provides correct results,indicating that the algorithm can be used in the decision support system of CRM.     

A Multi-Objective Genetic Algorithm for Optimal Portfolio Problems

This paper concerns with modeling and design of an algorithm for the portfolio selection problems with fixed transaction costs and minimum transaction lots. A mean-variance model for the portfolio selection problem is proposed, and the model is formulated as a non-smooth and nonlinear integer programming problem with multiple objective functions. As it has been proven that finding a feasible solution to the problem only is already NP-hard, based on NSGA-II and genetic algorithm for numerical optimization of constrained problems (Genocop), a multi-objective genetic algorithm (MOGA) is designed to solve the model. Its features comprise integer encoding and corresponding operators, and special treatment of constraints conditions. It is illustrated via a numerical example that the genetic algorithm can efficiently solve portfolio selection models proposed in this paper.This approach offers promise for the portfolio problems in practice.     

Automatic segmentation of bladder in CT images

Segmentation of the bladder in computerized tomography （CT） images is an important step in radiation therapy planning of prostate cancer. We present a new segmentation scheme to automatically delineate the bladder contour in CT images with three major steps. First, we use the mean shift algorithm to obtain a clustered image containing the rough contour of the bladder, which is then extracted in the second step by applying a region-growing algorithm with the initial seed point selected from a line-by-line scanning process. The third step is to refine the bladder contour more accurately using the rolling-ball algorithm. These steps are then extended to segment the bladder volume in a slice-by-slice manner. The obtained results were compared to manual segmentation by radiation oncologists. The average values of sensitivity, specificity, positive predictive value, negative predictive value, and Hausdorffdistance are 86.5%, 96.3%, 90.5%, 96.5%, and 2.8 pixels, respectively. The results show that the bladder can be accurately segmented.     

A blind source separation algorithm based on negentropy and signal noise ratio

A novel blind source separation (BSS) algorithm based on the combination of negentropy and signal noise ratio (SNR) is presented to solve the deficiency of the traditional independent component analysis (ICA) algorithm after the introduction of the principle and algorithm of ICA. The main formulas in the novel algorithm are elaborated and the idiographic steps of the algorithm are given. Then the computer simulation is used to test the performance of this algorithm. Both the traditional FastICA algorithm and the novel ICA algorithm are applied to separate mixed signal data. Experiment results show the novel method has a better performance in separating signals than the traditional FastICA algorithm based on negentropy. The novel algorithm could estimate the source signals from the mixed signals more precisely.     

Time Collocation Method for Structural Dynamic Problems

In order to achieve highly accurate and efficient numerical calculations of structural dynamics, time collocation method is presented. For a given time interval, the numerical solution of the method is approximated by a polynomial. The polynomial coefficients are evaluated by solving alge-braic equation. Once the polynomial coefficients are evaluated, the numerical solutions at any time in the interval can be easily calculated. New formulae are derived for the polynomial coefficients, which are more practical and succinct than those previously given. Two structural dynamic equations are calculated by the proposed method. The numerical solutions are compared with the traditional fourth-order Runge-Kutta method. The results show that the method proposed is highly accurate and computationally efficient. In addition, an important advantage of the method is the simplicity in software programming.     

求解最近保体矩阵问题的若干研究

研究了求解给定矩阵的最近保体矩阵问题，首先导出该问题解所必须满足的一个矩阵方程，然后用奇异值分解方法求解该矩阵方程；并获得了该问题解的其他更进一步的刻画条件，利用这些结果建立了一个求解算法，并通过数值算例说明了该算法的有效性。     

Hamming预测-校正法迭代形式的改进

对Hamming预测-校正法的迭代形式进行改进,研究一阶常微分方程初值问题的数值解．并将Hamming预测-校正法的迭代形式与改进后的迭代形式在数值实验中进行了比较,证明了改进后的迭代形式与原来的相比,有更精确的数值解．     

模拟退火算法的改进及其应用

针对贷款组合优化决策模型的求解问题，以模拟退火算法为基础，利用设置记忆器和在算法后链接一个局部搜索过程的方法，对原有算法进行了改进，该算法可兼顾解的质量和运行时间，快速找到最优解，克服了原有算法的随机性。数值计算的结果表明，该算法具有很强的适用性。     

一种求解 NCP 问题的信赖域-SQP -filter 算法

先将非线性互补问题（NCP ）转化为与其等价且有可行解的辅助问题,再将引入了信赖域方法思想的SQP方法与Filter技术相结合,提出一种求解NCP问题的信赖域-SQP-filter算法,并讨论了解的存在性和算法的全局收敛性。数值结果表明我们的算法是有效并收敛的。     

二次插值对称点算法求解一维搜索问题

插值法是一类用插值多项式来逼近未知或复杂函数的方法。本文基于二次插值,将插值多项式的极小点和其对称点作为搜索区间的两个探索点,通过不断缩小搜索区间,求解一维搜索问题的最优解。本文给出了二次插值对称点的算法,并用0.618法进行了数值比较。结果表明,新算法比0.618法效果好。     

两类基于MATLAB的非线性微分方程数值解的算法研究

通过对工程动态控制及计算机仿真中有重要应用两类非线性微分方程数值解的数学算法分析,建立了四阶定步长Runge—Kutta及Lorenz模型数值解的MATLAB算法结构,讨论了变步长情形下的误差控制,绘制了基于MATLAB的Lorenz系统数值解在二维和三维空间下的图形,最后提出了在可接受误差限内的数值解检验的基本思路。     

The Embedding Method for Nonsmooth Equations

1IntroductionTherehavebeenmailystudiesonnonsllloothequatiollsl"'"]F(x)=0,FiD=R"-R",((l.l)butfewauthorsusedembedding1lletllodtosolve'theequations(1.l).In1990,S.M.RobinsonstudiedthenonsnlootllembeddingmethodforaclassofBdifferentiableequationsill[51.WhenFiss…     

广义似变分不等式系统的逼近问题及其算法

考虑广义似变分不等式系统(简写为SGVLIP)的数值解,首先提出和SGVLIP相关的逼近问题,并证明了逼近问题解的存在性。基于这些逼近问题,构造了求解SGVLIP的算法,证明了SGVLIP解的存在唯一性以及算法的收敛性。     

基于二分法求解一类函数方程的数值解

大多数函数方程的解析解是难以求解的,所以有必要研究函数方程高精度数值解的算法．针对一类函数方程,证明了它解的存在性与唯一性．基于二分法的思想提出了求解这类函数方程数值解的算法．经过理论分析与算例测试,对于任意给定的精度,都能求得满足精度要求的数值解．     

非线性矩阵方程双对称解的牛顿-MCG算法

研究一类含有三次逆幂非线性矩阵方程双对称解数值计算问题。先用牛顿算法迭代计算导出线性矩阵方程双对称解,再用修正共轭梯度算法(MCG算法)求由牛顿算法导出的线性矩阵方程双对称解或最小二乘双对称解。建立牛顿MCG算法求这类矩阵方程双对称解,数值算例表明牛顿-MCG算法是有效的。