Selection Method of Multi-Objective Problems Using Genetic Algorithm in Motion Plan of AUV

To research the effect of the selection method of multi-objects genetic algorithm problem on optimizing result, thismethod is analyzed theoretically and discussed by using an autonomous underwater vehicle(AUV) as an object. A changingweight vtlue method is put forward and a selection formula is modified. Some experiments were implemented on an AUV.TwinBurger. The results shows that this method is effective and feasible.

Simple Insulin Dose Adjustment Using 3-3-1 Algorithm in Japanese Patients with Type 2 Diabetes: Start Kanazawa Study (Self-Titration Aggressive Algorithm with Glargine Trial)

We implemented a 3-3-1 algorithm in order to provide safe and simple self-titration in patients who newly initiated BOT as well as who were already on BOT and evaluated its utility in clinical setting. A total of 46 patients, 21 patients in the newly-initiated group and 25 patients in the existing BOT group performed dose adjustment using 3-3-1 algorithm. HbA1c was significantly improved 4 weeks after the initiation from 8.5% ± 1.2% at baseline to 7.3% ± 0.7% at the final evaluation (p 0.01, vs. Baseline). The average daily insulin units increased throughout the study period from 10.1 ± 6.7 at baseline to 14.6 ± 8.9 units at the final evaluation. Weight didn’t significantly change throughout the study (p = 0.12). The incidents of hypoglycemia were 0.8/month during the insulin dose self-adjustment period and 0.4/month during the follow-up period. The 3-3-1 algorithm using insulin glargine provided a safe and simple dose adjustment and demonstrated its utility in patients who were newly introduced to insulin treatment as well as who were already on BOT.

A new integration algorithm for finite deformation of thermo-elasto-viscoplastic single crystals

An algorithm for integrating the constitutive equations in thermal framework is presented, in which the plastic deformation gradient is chosen as the integration variable. Compared with the classic algorithm, a key feature of this new approach is that it can describe the finite deformation of crystals under thermal conditions. The obtained plastic deformation gradient contains not only plastic defor- mation but also thermal effects. The governing equation for the plastic deformation gradient is obtained based on ther- mal multiplicative decomposition of the total deformation gradient. An implicit method is used to integrate this evo- lution equation to ensure stability. Single crystal 1 100 aluminum is investigated to demonstrate practical applications of the model. The effects of anisotropic properties, time step, strain rate and temperature are calculated using this integration model.

An Algorithm of 0-1 Knapsack Problem Based on Economic Model

In order to optimize the knapsack problem further, this paper proposes an innovative model based on dynamic expectation efficiency, and establishes a new optimization algorithm of 0-1 knapsack problem after analysis and research. Through analyzing the study of 30 groups of 0-1 knapsack problem from discrete coefficient of the data, we can find that dynamic expectation model can solve the following two types of knapsack problem. Compared to artificial glowworm swam algorithm, the convergence speed of this algorithm is ten times as fast as that of artificial glowworm swam algorithm, and the storage space of this algorithm is one quarter that of artificial glowworm swam algorithm. To sum up, it can be widely used in practical problems.

Relative efficiency appraisal of discrete choice modeling algorithms using small-scale maximum likelihood estimator through empirically tailored computing environment

Discrete choice models are widely used in multiple sectors such as transportation, health, energy, and marketing, etc., where the model estimation is usually carried out by using commercial software. Nonetheless, tailored computer codes offer modellers greater flexibility and control of unique modelling situation. Aligned with empirically tailored computing environment, this research discusses the relative performance of six different algorithms of a discrete choice model using three key performance measures： convergence time, number of iterations, and iteration time. The computer codes are developed by using Visual Basic Application （VBA）. Maximum likelihood function （MLF） is formulated and the mathematical relationships of gradient and Hessian matrix are analytically derived to carry out the estimation process. The estimated parameter values clearly suggest that convergence criterion and initial guessing of parameters are the two critical factors in determining the overall estimation performance of a custom-built discrete choice model.

An Improved Binary Wolf Pack Algorithm Based on Adaptive Step Length and Improved Update Strategy for 0-1 Knapsack Problems

Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.

Optimization of Process Parameters of Continuous Microwave Drying Raspberry Puree Based on RSM and ANN-GA

To improve drying uniformity and anthocyanin content of the raspberry puree dried in a continuous microwave dryer,the effects of process parameters(microwave intensity,air velocity,and drying time)on evaluation indexes(average temperature,average moisture content,average retention rate of the total anthocyanin content,temperature contrast value,and moisture dispersion value)were investigated via the response surface method(RSM)and the artificial neural network(ANN)with genetic algorithm(GA).The results showed that the microwave intensity and drying time dominated the changes of evaluation indexes.Overall,the ANN model was superior to the RSM model with better estimation ability,and higher drying uniformity and anthocyanin retention rate were achieved for the ANN-GA model compared with RSM.The optimal parameters were microwave intensity of 5.53 W•g^(-1),air velocity of 1.22 m·s^(-1),and drying time of 5.85 min.This study might provide guidance for process optimization of microwave drying berry fruits.

A system-wide approach to minimize the operational cost of bench production in open-cast mining operations

The production cycle of open-cast coal mines generally in eludes drilling, blasting, loading, hauling and coal preparation activities. Individual optimization of these activities does not mean that the whole system is optimized. This paper proposes a cost model considering all activities in mining cycle and system-wide approach to minimize the total mining cost of bench production. Since the fragmentation size and blast-hole diameter are linked to all activities of mining system, they are considered as decision variables in the problem form ul at io n. The operatio n costs are then minimized by using the evolutionary algorithm. Moreover, the impact of the change in the explosive price, and the hourly unit cost of equipment on total mining cost is quantified by sensitivity analysis. A case study is implemented to demonstrate the developed model.

f-heredity knowledge and f-heredity mining

Using S-rough sets, this paper gives the concepts off-heredity knowledge and its heredity coefficient, and f-variation coefficient of knowledge; presents the theorem of f-attribute dependence of variation coefficient and the relation theorem of heredity-variation. The attribute dependence of f-variation coefficient and the relation of heredity-variation are important characteristics of S-rough sets. From such discussion, this paper puts forward the heredity mining off-knowledge and the algorithm of heredity mining, also gives its relative application.

Real-time OHT Dispatching Mechanism for the Interbay Automated Material Handling System with Shortcuts and Bypasses

As a key to improve the performance of the interbay automated material handling system （AMHS） in 300 mm semiconductor wafer fabrication system, the real- time overhead hoist transport （OHT） dispatching problem has received much attention. This problem is first formu- lated as a special form of assignment problem and it is proved that more than one solution will be obtained by Hungarian algorithm simultaneously. Through proposing and strictly proving two propositions related to the char- acteristics of these solutions, a modified Hungarian algo- rithm is designed to distinguish these solutions. Finally, a new real-time OHT dispatching method is carefully designed by implementing the solution obtained by the modified Hungarian algorithm. The experimental results of discrete event simulations show that, compared with con- ventional Hungarian algorithm dispatching method, the proposed dispatching method that chooses the solution with the maximum variance respectively reduces on average 4 s of the average waiting time and average lead time of wafer lots, and its performance is rather stable in multiple dif- ferent scenarios of the interbay AMHS with different quantities of shortcuts. This research provides an efficient real-time OHT dispatching mechanism for the interbay AMHS with shortcuts and bypasses.

Weekly Fleet Assignment Model and Algorithm

A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real- wofld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was ￥ 1 591276 one week and the running time was no more than 4 rain, which shows that the model and algorithm are fairly good for domestic airline.

Parameter Self - Learning of Generalized Predictive Control Using BP Neural Network

This paper describes the self—adjustment of some tuning-knobs of the generalized predictive controller(GPC).A three feedforward neural network was utilized to on line learn two key tuning-knobs of GPC,and BP algorithm was used for the training of the linking-weights of the neural network.Hence it gets rid of the difficulty of choosing these tuning-knobs manually and provides easier condition for the wide applications of GPC on industrial plants.Simulation results illustrated the effectiveness of the method.

<i>H</i>(.,.)<i>- φ - η -</i>Accretive Operators and Generalized Variational-Like Inclusions

In this paper, we generalize H(.,.) accretive operator introduced by Zou and Huang [1] and we call it H(.,.)- φ - η - accretive operator. We define the resolvent operator associated with H(.,.)- φ - η - accretive operator and prove its Lipschitz continuity. By using these concepts an iterative algorithm is suggested to solve a generalized variational-like inclusion problem. Some examples are given to justify the definition of H(.,.)- φ - η - accretive operator.

融合全色度LZMA与色度子采样HEVC的屏幕图像编码

由于屏幕图像的各向异性特点，使用传统的图像／视频编码算法不能得到理想的编码效率。该文提出一种双编码器方案，在保留HEVC（HighEfficiencyVideoCoding）对连续色调区域的优秀性能的同时，加入了从LZMAfLempel．Ziv—MarkovchainAlgorithm）SDK中提取出来的对非连续色调区域编码性能更优的字典一熵编码模块。两种编码器以宏块级自适应的方式有机融合，可适应不同的视频源特性。为了减少YUV4：4：4格式转换到YUV4：2：0对图像造成的失真，该文还提出了混合色度采样率的设计，可在保留传统色度子采样编解码器和其低码率低成本优势特性的前提下，有效提高编码效率。实验结果表明，该文提出的方案，比单纯使用HEVC的性能提高约10～30dB，其主观性能改善也非常明显。

Dynamic Weapon Target Assignment Based on Intuitionistic Fuzzy Entropy of Discrete Particle Swarm

Aiming at the problems of convergence-slow and convergence-free of Discrete Particle Swarm Optimization Algorithm(DPSO) in solving large scale or complicated discrete problem, this article proposes Intuitionistic Fuzzy Entropy of Discrete Particle Swarm Optimization(IFDPSO) and makes it applied to Dynamic Weapon Target Assignment(WTA). First, the strategy of choosing intuitionistic fuzzy parameters of particle swarm is defined, making intuitionistic fuzzy entropy as a basic parameter for measure and velocity mutation. Second, through analyzing the defects of DPSO, an adjusting parameter for balancing two cognition, velocity mutation mechanism and position mutation strategy are designed, and then two sets of improved and derivative algorithms for IFDPSO are put forward, which ensures the IFDPSO possibly search as much as possible sub-optimal positions and its neighborhood and the algorithm ability of searching global optimal value in solving large scale 0-1 knapsack problem is intensified. Third, focusing on the problem of WTA, some parameters including dynamic parameter for shifting firepower and constraints are designed to solve the problems of weapon target assignment. In addition, WTA Optimization Model with time and resource constraints is finally set up, which also intensifies the algorithm ability of searching global and local best value in the solution of WTA problem. Finally, the superiority of IFDPSO is proved by several simulation experiments. Particularly, IFDPSO, IFDPSO1~IFDPSO3 are respectively effective in solving large scale, medium scale or strict constraint problems such as 0-1 knapsack problem and WTA problem.

The 20 April 2013 Lushan, Sichuan, mainshock, and its aftershock sequence: tectonic implications

Using the double-difference relocation algo- rithm, we relocated the 20 April 2013 Lushan, Sichuan, earthquake （Ms 7.0）, and its 4,567 aftershocks recorded during the period between 20 April and May 3, 2013. Our results showed that most aftershocks are relocated between 10 and 20 km depths, but some large aftershocks were relocated around 30 krn depth and small events extended upward near the surface. Vertical cross sections illustrate a shovel-shaped fault plane with a variable dip angle from the southwest to northeast along the fault. Furthermore, the dip angle of the fault plane is smaller around the mainshock than that in the surrounding areas along the fault. These results suggest that it may be easy to generate the strong earthquake in the place having a small dip angle of the fault, which is somewhat similar to the genesis of the 2008 Wenchuan earthquake. The Lushan mainshock is underlain by the seismically anomalous layers with low-Vp, low-Vs, and high-Poisson＇s ratio anomalies, possibly suggesting that the fluid-filled fractured rock matrices might signifi- cantly reduce the effective normal stress on the fault plane to bring the brittle failure. The seismic gap between Lushan and Wenchuan aftershocks is suspected to be vulnerable to future seismic risks at greater depths, if any.

4—拆分问题的紧界

对集拆分问题的MLPT—算法,做了进一步探讨。采用反证法,证明了4—拆分问题的MLPT—算法,在一定条件限制下,最差情况性能界不超过4/3。

Seismic fluid identification using a nonlinear elastic impedance inversion method based on a fast Markov chain Monte Carlo method

Elastic impedance inversion with high efficiency and high stability has become one of the main directions of seismic pre-stack inversion. The nonlinear elastic impedance inversion method based on a fast Markov chain Monte Carlo （MCMC） method is proposed in this paper, combining conventional MCMC method based on global optimization with a preconditioned conjugate gradient （PCG） algorithm based on local optimization, so this method does not depend strongly on the initial model. It converges to the global optimum quickly and efficiently on the condition that effi- ciency and stability of inversion are both taken into consid- eration at the same time. The test data verify the feasibility and robustness of the method, and based on this method, we extract the effective pore-fluid bulk modulus, which is applied to reservoir fluid identification and detection, and consequently, a better result has been achieved.

A linear complementarity model for multibody systems with frictional unilateral and bilateral constraints

The Lagrange-I equations and measure differential equations for multibody systems with unilateral and bilateral constraints are constructed. For bilateral constraints, frictional forces and their impulses contain the products of the filled-in relay function induced by Coulomb friction and the absolute values of normal constraint reactions. With the time-stepping impulse-velocity scheme, the measure differential equations are discretized. The equations of horizontal linear complementarity problems （HLCPs）, which are used to compute the impulses, are constructed by decomposing the absolute function and the filled-in relay function. These HLCP equations degenerate into equations of LCPs for frictional unilateral constraints, or HLCPs for frictional bilateral constraints. Finally, a numerical simulation for multibody systems with both unilateral and bilateral constraints is presented.