Wind-sand flow simulation and radius optimization of highway embankment under different vertical curve radius

It is of great practical value to explore the correlation between the vertical curve radius of desert highway and the increase of sand accumulation in local lines,and to select the appropriate vertical curve radius for reducing the risk of sand accumulation.In this study,three-dimensional models of desert highway embankments with different vertical curve radii were constructed,and Fluent software was used to simulate the wind-sand flow field and sand accumulation distribution of vertical curve embankments.The results show that:(1)Along the direction of the road,the concave and the convex vertical curve embankments have the effect of collecting and diverging the wind-sand flow,respectively.When the radius of the concave vertical curve is 3000 m,5000 m,8000 m,10000 m and 20000 m,the wind velocity in the middle of the vertical curve is 31.76%,22.58%,10.78%,10.53%and 10.44%,higher than that at both ends.When the radius of the convex vertical curve is 6500 m,8000 m,10000 m,20000 m and 30000 m,the wind velocity at both ends of the vertical curve is 14.06%,9.99%,6.14%,3.22%and 2.41%,higher than that in the middle.The diversion effect also decreases with the increase of the radius.(2)The conductivity of the concave and convex vertical curve embankments with different radii is greater than 1,which is the sediment transport roadbed.The conductivity increases with the increase of radius and gradually tends to be stable.When the radius of the concave and convex vertical curves reaches 8000 m and 20000 m respectively,the phenomenon of sand accumulation is no longer serious.Under the same radius condition,the concave vertical curve embankment is more prone to sand accumulation than the convex one.(3)Considering the strength of the collection and diversion of the vertical curve embankment with different radii,and the sand accumulation of the vertical curve embankment in the desert section of Wuma Expressway,the radius of the concave vertical curve is not less than 8000 m,and the radius of the convex vertical curve is not less than 20000 m,which can effectively reduce the sand accumulation of the vertical curve embankment.In the desert highway area,the research results of this paper can provide reference for the design of vertical curve to ensure the safe operation of desert highway.

A new slope optimization design based on limit curve method

A new method is proposed for slope optimization design based on the limit curve method, where the slope is in the limit equilibrium state when the limit slope curve determined by the slip-line field theory and the slope intersect at the toe of the slope. Compared with the strength reduction (SR) method, finite element limit analysis method, and the SR method based on Davis algorithm, the new method is suitable for determining the slope stability and limit slope angle (LSA). The optimal slope shape is determined based on a series of slope heights and LSA values, which increases the LSA by 2.45°-11.14° and reduces an invalid overburden amount of rocks by 9.15%, compared with the space mechanics theory. The proposed method gives the objective quantification index of instability criterion, and results in a significant engineering economy.

Establishment Method of Shape Standard Curve Based on Stepwise Optimization and Its Compensation Models

There are very few researches on the shape standard curve currently,and they merely remain on the level of description of the general concept and production experiences,lacking of the in-depth theoretical analysis,and the concrete principle,method and steps for determining the shape standard curve are not put forward,therefore,they are not applicable in industrial production.This is the weakest spot in the research on the basic shape theory.In this paper,the basic shape standard curve and the transverse distribution curve of the exit thickness are attained with stepwise optimization,which is based on the theoretical calculation method of the shape standard curve of strip mills proposed by authors.By calculating the shape discrimination model and the shape forecast model separately,the simultaneous iterative calculation by the previous method is avoided,and the speed and stability of calculation are improved.The compensation models of the transverse temperature difference of the strip,the shape detection roller deflection and the shape of the strip coil are established,respectively,meantime,the basic shape standard curves are compensated,and the relatively perfect theoretical establishment method of the shape standard curve is formed.The simulation and calculation are done on a 1 220 mm five-stand cold strip tandem mill.The simulation and calculation result shows that the principle,method and steps for determining the shape standard curve are correct and feasible,and the correctness of theoretical analysis and calculation is verified.This paper proposes an idea and a method for the establishment of the shape standard curve in the rolling processes of cold strip mills,which develop the theory and model of the shape standard curve and improve the quality and efficiency of the shape control in the rolling processes of cold strip mills.

DIRECTIVITY OPTIMIZATION OF CURVED SURFACE DIPOLE ANTENNAS

Based on the calculation of the characteristic parameters by moment method, the curved surface dipoles are optimized by an optimization method, the maximum directivities of some V-curved and Gauss-curved surface dipoles are given.

Shape modification of Bézier curves by constrained optimization

The Bézier curve is one of the most commonly used parametric curves in CAGD and Computer Graphics and has many good properties for shape design. Developing more convenient techniques for designing and modifying Bézier curve is an im- portant problem, and is also an important research issue in CAD/CAM and NC technology fields. This work investigates the optimal shape modification of Bézier curves by geometric constraints. This paper presents a new method by constrained optimi- zation based on changing the control points of the curves. By this method, the authors modify control points of the original Bézier curves to satisfy the given constraints and modify the shape of the curves optimally. Practical examples are also given.

Global Convergence of Curve Search Methods for Unconstrained Optimization

In this paper we propose a new family of curve search methods for unconstrained optimization problems, which are based on searching a new iterate along a curve through the current iterate at each iteration, while line search methods are based on finding a new iterate on a line starting from the current iterate at each iteration. The global convergence and linear convergence rate of these curve search methods are investigated under some mild conditions. Numerical results show that some curve search methods are stable and effective in solving some large scale minimization problems.

An optimization method for rational Bézier curve design

Adjusting weights as a shape control tool in rational B6zier curve design is not easy because the weights have a global in- fluence. The curve could not approximate control polygon satisfactorily by an interactive manner. In order to produce a curve close enough to control polygon at every control vertex, an optimization model is established to minimize the distance between rational B6zier curve and its control points. This optimization problem is converted to a quadratic programming problem by separating and recombining the objective function. The new combined multi-objective optimization problem is reasonable and easy to solve. With an optimal parameter, the computing process is discussed. Comparative examples show that the designed curve is closer to control polygon and preserves the shape of the control polygon well.

Optimal Polygonal Approximation of Digital Planar Curves Using Genetic Algorithm and Tabu Search

Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.

Research on Optimizing the Hidden Layer Structure of ANN-Based Model and Its Application in Predicting End-Quench Curves of Steels

In this paper, a method of optimizing the number of hidden layer neurons has been put forward. This optimizing method is suitable for three layers B-p network. The purpose of this optimizing method is to reduce the predicting errors when the model is used as predicting model. As an example of application, a predicting model of steel end-quench curves has been designed by using this optimizing method. The result shows that the optimization of ANN hidden layer architecture has an effect on reducing predicting errors.

Horizontal-to-vertical spectral ratio inversion method based on multimodal forest optimization algorithm

The exploration of urban underground spaces is of great significance to urban planning,geological disaster prevention,resource exploration and environmental monitoring.However,due to the existing of severe interferences,conventional seismic methods cannot adapt to the complex urban environment well.Since adopting the single-node data acquisition method and taking the seismic ambient noise as the signal,the microtremor horizontal-to-vertical spectral ratio(HVSR)method can effectively avoid the strong interference problems caused by the complex urban environment,which could obtain information such as S-wave velocity and thickness of underground formations by fitting the microtremor HVSR curve.Nevertheless,HVSR curve inversion is a multi-parameter curve fitting process.And conventional inversion methods can easily converge to the local minimum,which will directly affect the reliability of the inversion results.Thus,the authors propose a HVSR inversion method based on the multimodal forest optimization algorithm,which uses the efficient clustering technique and locates the global optimum quickly.Tests on synthetic data show that the inversion results of the proposed method are consistent with the forward model.Both the adaption and stability to the abnormal layer velocity model are demonstrated.The results of the real field data are also verified by the drilling information.

Optimal parameterization of conic curves

Optimal parameterization of specified segment on the algebraic curves is a hot issue in CAGD and CG. Take the optimal approximation of arc-length parameterization as the criterion of optimal parameterization, and the optimal or close to optimal rational parameterization formula of any specified segment on the conic curves is obtained. The new method proposed in this paper has ad- vantage in quantity of calculation and has strong self-adaptability. Finally, a experimental comparison of the results obtained by this method and by the traditional parametric algorithm is conducted.

Optimal Weights in Nonparametric Analysis of Clustered ROC Curve Data

In diagnostic trials, clustered data are obtained when several subunits of the same patient are observed. Within-cluster correlations need to be taken into account when analyzing such clustered data. A nonparametric method has been proposed by Obuchowski (1997) to estimate the Receiver Operating Characteristic curve area (AUC) for such clustered data. However, Obuchowski’s estimator gives equal weight to all pairwise rankings within and between cluster. In this paper, we modify Obuchowski’s estimate by allowing weights for the pairwise rankings vary across clusters. We consider the optimal weights for estimating one AUC as well as two AUCs’ difference. Our results in this paper show that the optimal weights depends on not only the within-patient correlation but also the proportion of patients that have both unaffected and affected units. More importantly, we show that the loss of efficiency using equal weight instead of our optimal weights can be severe when there is a large within-cluster correlation and the proportion of patients that have both unaffected and affected units is small.

A quadratic programming method for optimal degree reduction of Bézier curves with G^1-continuity

This paper presents a quadratic programming method for optimal multi-degree reduction of B6zier curves with G^1-continuity. The L2 and I2 measures of distances between the two curves are used as the objective functions. The two additional parameters, available from the coincidence of the oriented tangents, are constrained to be positive so as to satisfy the solvability condition. Finally, degree reduction is changed to solve a quadratic problem of two parameters with linear constraints. Applications of degree reduction of Bezier curves with their parameterizations close to arc-length parameterizations are also discussed.

An optimal on-site calibration method in measurement system of dynamic envelope curve of high-speed vehicle

High-speed vehicle dynamic envelope curve is defined as the maximum limit outline affected by a variety of adverse factors while the train is running. Considering the difficulties in the current measurement system such as complicated calibration process,cumbersome aided-instruments,strict limitation of working distance, this paper carries out an optical method in which two high-speed cameras with variable-zoom lenses are adopted as binocular stereo sensors of measurement system and a high-ac-curacy 3D target with fast reconstruction is designed. The intrinsic parameters of the sensors and the relative positions between coordinate systems are solved by the method of colinearity constrained optimization algorithm. The calibration process is easy to operate and the device is also of portability. Most importantly, the severe working distance limitation between sensors and measured body is solved, enhancing the adaptability of measurement system to environment. Experimental results show that when the sensors are in the range of 8 -16 m away from the measured body, system accuracy can reach up to ±0. 5 mm, which meets the requirements to measure the dynamic envelope curve of high-speed vehicle.

Ideal Drift Response Curve for Robust Optimal Damper Design for Elastic-Plastic MDOF Structures under Multi-Level Earthquakes Dedicated to Professor Karl S.Pister for his 95th birthday

A new method of robust damper design is presented for elastic-plastic multi-degree-of-freedom(MDOF)building structures under multi-level ground motions(GMs).This method realizes a design that is effective for various levels of GMs.The robustness of a design is measured by an incremental dynamic analysis(IDA)curve and an ideal drift response curve(IDRC).The IDRC is a plot of the optimized maximum deformation under a constraint on the total damper quantity vs.the design level of the GMs.The total damper quantity corresponds to the total cost of the added dampers.First,a problem of generation of IDRCs is stated.Then,its solution algorithm,which consists of the sensitivity-based algorithm(SBA)and a local search method,is proposed.In the application of the SBA,the passive added dampers are removed sequentially under the specified-level GMs.On the other hand,the proposed local search method can search the optimal solutions for a constant total damper quantity under GMs’increased levels.In this way,combining these two algorithms enables the comprehensive search of the optimal solutions for various conditions of the status of the GMs and the total damper quantity.The influence of selecting the type of added dampers(oil,hysteretic,and so on)and the selection of the input GMs on the IDRCs are investigated.Finally,a robust optimal design problem is formulated,and a simple local search-based algorithm is proposed.A simple index using the IDRC and the IDA curve of the model is used as the objective function.It is demonstrated that the proposed algorithm works well in spite of its simplicity.

Development of Cubic Bezier Curve and Curve-Plane Intersection Method for Parametric Submarine Hull Form Design to Optimize Hull Resistance Using CFD

Optimization analysis and computational fluid dynamics （CFDs） have been applied simultaneously, in which a parametric model plays an important role in finding the optimal solution. However, it is difficult to create a parametric model for a complex shape with irregular curves, such as a submarine hull form. In this study, the cubic Bezier curve and curve-plane intersection method are used to generate a solid model of a parametric submarine hull form taking three input parameters into account： nose radius, tail radius, and length-height hull ratio （L/H）. Application program interface （API） scripting is also used to write code in the ANSYS DesignModeler. The results show that the submarine shape can be generated with some variation of the input parameters. An example is given that shows how the proposed method can be applied successfully to a hull resistance optimization case. The parametric design of the middle submarine type was chosen to be modified. First, the original submarine model was analyzed, in advance, using CFD. Then, using the response surface graph, some candidate optimal designs with a minimum hull resistance coefficient were obtained. Further, the optimization method in goal-driven optimization （GDO） was implemented to find the submarine hull form with the minimum hull resistance coefficient （Ct）. The minimum C, was obtained. The calculated difference in （7, values between the initial submarine and the optimum submarine is around 0.26%, with the C, of the initial submarine and the optimum submarine being 0.001 508 26 and 0.001 504 29, respectively. The results show that the optimum submarine hull form shows a higher nose radius （rn） and higher L/H than those of the initial submarine shape, while the radius of the tail （r1） is smaller than that of the initial shape.

Optimal Rational Parameterization of Quadratic Curves Based on the Geographic Information of Both Ends

In this paper, we rewrote the equation of algebraic curve segmentswith the geometric informationonboth ends. The optimal or nearly optimal rationalparametric equation is determinedbythe principle that parametricspeedsat both endsareequal. Comparing withotherliteratures, the methodofthis paper has advantage in efficiency andiseasy to realize. The equation of optimal rational parameterization can be obtained directly by the information of both ends. Large numbers ofexperimental data show that our method hasbeen given withmore self-adaptability and accuracy than that ofotherliteratures, and if the parametricspeedat any end reaches its maximum or minimum value, the parameterization is optimal; otherwise itis close tooptimal rational parameterization.

Multi-objective optimization of a bistable curved shell with controllablethickness based on machine learning

Bistable curved shells have become a promising low-cost application in energy absorption fields owing to recentadvances in material and technology.Significant research has been conducted to improve their energy absorptioneffect through forward prediction and single-objective optimization.However,these approaches may not fully ex-plore their functional potential.In this study,we propose a multi-objective optimization framework based on theprinciple of main objective optimization that combines neural networks and genetic algorithms.The energy ab-sorption effect and backward snapping force of the bistable curved shell are improved synchronously.Meanwhile,a reverse design algorithm is developed to generate the preset load-displacement curve,which further expandsthe application of machine learning methods in the field of multi-objective optimization.The combination ofmachine learning and multi-objective optimization is highly effective for building meta-structures with specificperformance requirements and has potential applications in solving complex optimization tasks in various fields.

Addition Sequence Method of Scalar Multiplication of Elliptic Curve over OEF

A new elliptic curve scalar multiplication algorithm is proposed. Thealgorithm uses the Frobenius map on optimal extension field (OEF) and addition sequence We introducea new algorithm on generating addition sequence efficiently and also give some analysis about it.Based on this algorithm, a new method of computing scalar multiplication of elliptic curve over anOEF is presented. The new method is more efficient than the traditional scalar multiplicationalgorithms of elliptic curve over OEF. Thecomparisons of traditional method and the new method arealso given.