In order to solve the problem that the stepping motor in the manipulator is frequently stopped and the conventional index algorithm can not make full use of the output torque under the high speed heavy load,the two-st...
详细信息
ISBN:
(纸本)9781510842915
In order to solve the problem that the stepping motor in the manipulator is frequently stopped and the conventional index algorithm can not make full use of the output torque under the high speed heavy load,the two-stage exponential acceleration algorithm for stepper motor is *** on the critical load curve, the two-stage exponential type and the conventional exponential acceleration scheme are analyzed and compared, which proves that the former has better *** critical load curve fitting is carried out by Matlab software, and the best point are selected by w-t equation. The two-stage exponential acceleration iterative algorithm is designed to reduce the dispersion of the speed-increasing process and improve the smoothness of the stepping motor acceleration ***, the experimental results show that the motor speed curve under the two-stage exponential control is in accordance with the theoretical curve, and the feasibility of the method is proved.
Recently proposed Multi-weight vector projection support vector machines(MVSVM) is an outstanding algorithm for binary classification. However, it measuring distance in the objective function by squared L2-norm, which...
详细信息
Recently proposed Multi-weight vector projection support vector machines(MVSVM) is an outstanding algorithm for binary classification. However, it measuring distance in the objective function by squared L2-norm, which is easy to find that the impact of outliers is exaggerated. To alleviate this, we propose an effective algorithm, termed as Robust MVSVM based on the L1-norm distance(L1-MVSVM). The distance in the objective of L1-MVSVM is measured by L1-norm. Besides, we design a powerful iterative algorithm to solve the optimal problem of L1-norm, whose convergence is theoretically ensured. Finally, the effectiveness of L1-MVSVM has been verified through extensive experiments.
Numerical optimization is a classical field in operation research and computer science, which has been widely used in the areas such as physics and economics. Although, optimization algorithms have achieved great succ...
详细信息
Numerical optimization is a classical field in operation research and computer science, which has been widely used in the areas such as physics and economics. Although, optimization algorithms have achieved great success for plenty of applications, handling the big data in the best fashion possible is a very inspiring and demanding challenge in the artificial intelligence era. Stochastic gradient descent(SGD) is pretty simple but surprisingly, highly effective in machine learning models, such as support vector machine(SVM) and deep neural network(DNN). Theoretically, the performance of SGD for convex optimization is well understood. But, for the non-convex setting, which is very common for the machine learning problems, to obtain the theoretical guarantee for SGD and its variants is still a standing problem. In the paper, we do a survey about the SGD and its variants such as Momentum, ADAM and SVRG, differentiate their algorithms and applications and present some recent breakthrough and open problems.
Multilevel models are popular models for analysing data inheriting a hierarchical structure. They are used in diverse fields including social, medical, economical and biological sciences. These models encounter some p...
详细信息
Multilevel models are popular models for analysing data inheriting a hierarchical structure. They are used in diverse fields including social, medical, economical and biological sciences. These models encounter some problems in estimating the parameters, if there are measurement errors in either explanatory or response variables. A common approach to tackle this obstacle is to consider the pseudo variables and follow some simulation methods to estimate the parameters. We propose a new algorithm constituting the iterative and simulation extrapolation steps in turn. To evaluate the proposed algorithm, various simulation studies are also conducted. Moreover, we investigate the implementation of our method on a real data set concerning the cost and expenditure of the households in Tehran city in the year 2007.
A new reconstruction algorithm for absolute shape calibration in two-flat test is proposed. The shift-rotation method is applied to absolute shape calibration in two-flat test. Relying on the decomposition of the reco...
详细信息
ISBN:
(纸本)9781628419191
A new reconstruction algorithm for absolute shape calibration in two-flat test is proposed. The shift-rotation method is applied to absolute shape calibration in two-flat test. Relying on the decomposition of the reconstructed shapes into rotationally asymmetric and symmetric components, an iteration algorithm is presented to reconstruct the rotationally asymmetric components, and Zernike polynomial fitting algorithm is used to calculate rotationally symmetric components. Compared to the traditional algorithms, the proposed algorithm has the characteristics of considerable accuracy and less computational effort. A simulation experiment proves the validity of the presented algorithm.
This paper proposes a numerical solution of the consistent estimates of Kalman gain and the covariance of the innovations process in the innovations model. The estimates are given as solutions of some BMI problem, so ...
详细信息
In the process of electromagnetic interference sources imaging using parabolic reflection, the existing equipment can only collect the electromagnetic intensity information but it is difficult to directly obtain the p...
详细信息
ISBN:
(纸本)9781467394949
In the process of electromagnetic interference sources imaging using parabolic reflection, the existing equipment can only collect the electromagnetic intensity information but it is difficult to directly obtain the phase information. In this paper, we have implemented the combination of the gerchberg-saxton algorithm and the transport-of-intensity equation algorithm for wideband phase retrieval on a NVIDIA's graphics processing unit(CPU) with MATLAB to achieve speedup in computation. The efficiency of CPU based implementation is measured and compared with the algorithm on CPU. The results with CPU show performance enhancement over a factor of 9.07 compared with CPU for an image of size 2048x2048 sampling points.
We consider the approximate consensus problem in a partially connected network of n nodes where at most f nodes may suffer from Byzantine faults. We study under which conditions this problem can be solved using an ite...
详细信息
ISBN:
(纸本)9781509021406
We consider the approximate consensus problem in a partially connected network of n nodes where at most f nodes may suffer from Byzantine faults. We study under which conditions this problem can be solved using an iterative algorithm. A Byzantine node can equivocate: it may provide different values to its neighbors. To restrict the possibilities of equivocation, the 3-partial multicast primitive is considered. When a (correct or faulty) node uses this communication primitive, it provides necessarily the same value to the two identified receivers. Based on this communication primitive, a novel condition called f-resilient is proposed and proved to be necessary and sufficient to solve the approximate Byzantine consensus problem in a synchronous network. This condition takes into account two different communication primitives: unicast and 3-partial multicast. It expresses a trade-off between the two known approaches that make the problem solvable (increasing the number of neighbors or/and increasing the power of the communication primitives). The condition f-resilient does not require to eliminate all the possibilities of equivocation. Furthermore, it can be satisfied when there is just a majority of correct nodes. The relationships between the condition f-resilient and the condition h-disjoint (proposed by Alexander Jaffe et al. in 2012 to solve another problem, namely exact Byzantine consensus) are investigated. Two preliminary conclusions are obtained. When a network does not satisfy h-disjoint, it also does not satisfy f-resilient. But when a network satisfies h-disjoint, f-resilient is not necessarily satisfied. Finally, the condition is extended to cope with asynchronous networks.
A laser absorption sensor for temperature, pressure and concentration is developed. Combined the simulation with experiment, an iterative algorithm is built to infer gas temperature, pressure and concentration based o...
详细信息
ISBN:
(纸本)9781467388290
A laser absorption sensor for temperature, pressure and concentration is developed. Combined the simulation with experiment, an iterative algorithm is built to infer gas temperature, pressure and concentration based on laser absorption spectroscopy. Selection principles of target species and spectral lines are analyzed and two H2O spectral lines are selected. With the selected spectral lines, the sensor is validated in the static cells. The measured results show that the measured gas pressure, temperature and H2O concentration are consistent with the predicted values and the most relative errors are 5%, 6% and 8%, respectively. It is proved that the sensor can achieve accurate measurement of multiple flow parameters along line of sight (LOS) in uniform environments.
In this paper, we show the extended general variational inequality problems are equivalent to solving the general Wiener-Hopf equations. By using the equivalence, we establish a general iterative algorithm for finding...
详细信息
ISBN:
(纸本)9783319191058;9783319191041
In this paper, we show the extended general variational inequality problems are equivalent to solving the general Wiener-Hopf equations. By using the equivalence, we establish a general iterative algorithm for finding the solution of extended general variational inequalities. We also discuss the convergence criteria for the algorithm. Our results extend and improve the corresponding results announced by many others.
暂无评论