Testicular descent occurs in two consecutive stages:the transabdominal stage and the inguinoscrotal stage.Androgens play a crucial role in the second stage by influencing the development of the gubernaculum,a structur...Testicular descent occurs in two consecutive stages:the transabdominal stage and the inguinoscrotal stage.Androgens play a crucial role in the second stage by influencing the development of the gubernaculum,a structure that pulls the testis into the scrotum.However,the mechanisms of androgen actions underlying many of the processes associated with gubernaculum development have not been fully elucidated.To identify the androgen-regulated genes,we conducted large-scale gene expression analyses on the gubernaculum harvested from luteinizing hormone/choriogonadotropin receptor knockout(Lhcgr KO)mice,an animal model of inguinoscrotal testis maldescent resulting from androgen deficiency.We found that the expression of secreted protein acidic and rich in cysteine(SPARC)-related modular calcium binding 1(Smoc1)was the most severely suppressed at both the transcript and protein levels,while its expression was the most dramatically induced by testosterone administration in the gubernacula of Lhcgr KO mice.The upregulation of Smoc1 expression by testosterone was curtailed by the addition of an androgen receptor antagonist,flutamide.In addition,in vitro studies demonstrated that SMOC1 modestly but significantly promoted the proliferation of gubernacular cells.In the cultures of myogenic differentiation medium,both testosterone and SMOC1 enhanced the expression of myogenic regulatory factors such as paired box 7(Pax7)and myogenic factor 5(Myf5).After short-interfering RNA-mediated knocking down of Smoc1,the expression of Pax7 and Myf5 diminished,and testosterone alone did not recover,but additional SMOC1 did.These observations indicate that SMOC1 is pivotal in mediating androgen action to regulate gubernaculum development during inguinoscrotal testicular descent.展开更多
Sentiment analysis plays an important role in distilling and clarifying content from movie reviews,aiding the audience in understanding universal views towards the movie.However,the abundance of reviews and the risk o...Sentiment analysis plays an important role in distilling and clarifying content from movie reviews,aiding the audience in understanding universal views towards the movie.However,the abundance of reviews and the risk of encountering spoilers pose challenges for efcient sentiment analysis,particularly in Arabic content.Tis study proposed a Stochastic Gradient Descent(SGD)machine learning(ML)model tailored for sentiment analysis in Arabic and English movie reviews.SGD allows for fexible model complexity adjustments,which can adapt well to the Involvement of Arabic language data.Tis adaptability ensures that the model can capture the nuances and specifc local patterns of Arabic text,leading to better performance.Two distinct language datasets were utilized,and extensive pre-processing steps were employed to optimize the datasets for analysis.Te proposed SGD model,designed to accommodate the nuances of each language,aims to surpass existing models in terms of accuracy and efciency.Te SGD model achieves an accuracy of 84.89 on the Arabic dataset and 87.44 on the English dataset,making it the top-performing model in terms of accuracy on both datasets.Tis indicates that the SGD model consistently demonstrates high accuracy levels across Arabic and English datasets.Tis study helps deepen the understanding of sentiments across various linguistic datasets.Unlike many studies that focus solely on movie reviews,the Arabic dataset utilized here includes hotel reviews,ofering a broader perspective.展开更多
In [7], Cross showed that the spectrum of a linear relation T on a normed space satisfies the spectral mapping theorem. In this paper, we extend the notion of essential ascent and descent for an operator acting on a v...In [7], Cross showed that the spectrum of a linear relation T on a normed space satisfies the spectral mapping theorem. In this paper, we extend the notion of essential ascent and descent for an operator acting on a vector space to linear relations acting on Banach spaces. We focus to define and study the descent, essential descent, ascent and essential ascent spectrum of a linear relation everywhere defined on a Banach space X. In particular, we show that the corresponding spectrum satisfy the polynomial version of the spectral mapping theorem.展开更多
In order to obtain a high-quality weld during the laser welding process, extracting the characteristic parameters of weld pool is an important issue for automated welding. In this paper, the type 304 austenitic stainl...In order to obtain a high-quality weld during the laser welding process, extracting the characteristic parameters of weld pool is an important issue for automated welding. In this paper, the type 304 austenitic stainless steel is welded by a 5 kW high-power fiber laser and a high-speed camera is employed to capture the topside images of weld pools. Then we propose a robust visual-detection approach for the molten pool based on the supervised descent method. It provides an elegant framework for representing the outline of a weld pool and is especially efficient for weld pool detection in the presence of strong uncertainties and disturbances. Finally, welding experimental results verified that the proposed approach can extract the weld pool boundary accurately, which will lay a solid foundation for controlling the weld quality of fiber laser welding process.展开更多
This paper presents a coordinate gradient descent approach for minimizing the sum of a smooth function and a nonseparable convex function.We find a search direction by solving a subproblem obtained by a second-order a...This paper presents a coordinate gradient descent approach for minimizing the sum of a smooth function and a nonseparable convex function.We find a search direction by solving a subproblem obtained by a second-order approximation of the smooth function and adding a separable convex function.Under a local Lipschitzian error bound assumption,we show that the algorithm possesses global and local linear convergence properties.We also give some numerical tests(including image recovery examples) to illustrate the efficiency of the proposed method.展开更多
A recommender system(RS)relying on latent factor analysis usually adopts stochastic gradient descent(SGD)as its learning algorithm.However,owing to its serial mechanism,an SGD algorithm suffers from low efficiency and...A recommender system(RS)relying on latent factor analysis usually adopts stochastic gradient descent(SGD)as its learning algorithm.However,owing to its serial mechanism,an SGD algorithm suffers from low efficiency and scalability when handling large-scale industrial problems.Aiming at addressing this issue,this study proposes a momentum-incorporated parallel stochastic gradient descent(MPSGD)algorithm,whose main idea is two-fold:a)implementing parallelization via a novel datasplitting strategy,and b)accelerating convergence rate by integrating momentum effects into its training process.With it,an MPSGD-based latent factor(MLF)model is achieved,which is capable of performing efficient and high-quality recommendations.Experimental results on four high-dimensional and sparse matrices generated by industrial RS indicate that owing to an MPSGD algorithm,an MLF model outperforms the existing state-of-the-art ones in both computational efficiency and scalability.展开更多
The original free vortex wake model was used for numerical investigation.Calculation of the aerodynamic characteristics in hover and vertical descent modes in the range of vertical descent speed of 0–30 m/s including...The original free vortex wake model was used for numerical investigation.Calculation of the aerodynamic characteristics in hover and vertical descent modes in the range of vertical descent speed of 0–30 m/s including the Vortex Ring State(VRS)area was performed.The calculations were carried out under the condition of variable blade pitch angle values providing a fixed timeaverage thrust value.Visualization data of free vortex wake shapes,flow structures,and velocity fields were obtained and analyzed.The time-dependences of the rotor’s thrust and torque coefficients were obtained and analyzed.The obtained data allows determining the boundaries of the VRS area by various criteria such as rotor thrust and torque pulsations,growth of rotor power consumption relative to the hover,growth of rotor induced velocities relative to the hover,and growth of the required rotor blade pitch angles values.The results of the study are compared with experimental and calculated data of other authors and can significantly supplement the available results of experimental and computational studies in this area.展开更多
In this paper,we consider a distributed resource allocation problem of minimizing a global convex function formed by a sum of local convex functions with coupling constraints.Based on neighbor communication and stocha...In this paper,we consider a distributed resource allocation problem of minimizing a global convex function formed by a sum of local convex functions with coupling constraints.Based on neighbor communication and stochastic gradient,a distributed stochastic mirror descent algorithm is designed for the distributed resource allocation problem.Sublinear convergence to an optimal solution of the proposed algorithm is given when the second moments of the gradient noises are summable.A numerical example is also given to illustrate the effectiveness of the proposed algorithm.展开更多
Mathematical models for burden descending process have been applied to obtain whole burden structures in blast furnace,whereas the accuracy of those burden descent models has not been sufficiently investigated.Special...Mathematical models for burden descending process have been applied to obtain whole burden structures in blast furnace,whereas the accuracy of those burden descent models has not been sufficiently investigated.Special evaluation method based on timeline burden profiles was established to quantitatively evaluate the error between experimental and modeled burden structures.Four existing burden descent models were utilized to describe the burden structure of a 1/20 scaled warm blast furnace.Input modeling conditions including initial burden profile,descending volumes in each time interval,and normalized descending velocity distribution were determined via special image processing technology.Modeled burden structures were evaluated combined with the published experimental data.It is found that all the models caught the main profile of the burden structure.Furthermore,the improved nonuniform descent model（Model IV）shows the highest level of precision especially when burden descends with unstable velocity distribution tendency.Meanwhile,the traditional nonuniform descent model（Model III）may also be desirable to model the burden descending process when the burden descending velocity presents a linear tendency.Finally,the uniform descent model（Model I）might be the first option for roughly predicting burden structure.展开更多
A hybridization of the three–term conjugate gradient method proposed by Zhang et al. and the nonlinear conjugate gradient method proposed by Polak and Ribi`ere, and Polyak is suggested. Based on an eigenvalue analysi...A hybridization of the three–term conjugate gradient method proposed by Zhang et al. and the nonlinear conjugate gradient method proposed by Polak and Ribi`ere, and Polyak is suggested. Based on an eigenvalue analysis, it is shown that search directions of the proposed method satisfy the sufficient descent condition, independent of the line search and the objective function convexity. Global convergence of the method is established under an Armijo–type line search condition. Numerical experiments show practical efficiency of the proposed method.展开更多
In this paper, a new method named as the gradually descent method was proposed to solve the discrete global optimization problem. With the aid of an auxiliary function, this method enables to convert the problem of fi...In this paper, a new method named as the gradually descent method was proposed to solve the discrete global optimization problem. With the aid of an auxiliary function, this method enables to convert the problem of finding one discrete minimizer of the objective function f to that of finding another at each cycle. The auxiliary function can ensure that a point, except a prescribed point, is not its integer stationary point if the value of objective function at the point is greater than the scalar which is chosen properly. This property leads to a better minimizer of f found more easily by some classical local search methods. The computational results show that this algorithm is quite efficient and reliable for solving nonlinear integer programming problems.展开更多
The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated...The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm.The deregularization maximized the energy of the solution,which was opposite to the Tikhonov regularization where the energy was minimized.However,combined with box-constraints,the deregularization forced the solution to be close to the binary set.It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector.As a result,the worst-case and average complexity are reduced down as K2.8 and K2.5 floating point operation per second,respectively.The development improves the "efficient frontier" in multiuser detection,which is illustrated by simulation results.In addition,most operations in the detector are additions and bit-shifts.This makes the proposed technique attractive for fixed-point hardware implementation.展开更多
In this paper,a-Browder’s theorem and a-Weyl’s theorem for bounded linear operators are studied by means of the property of the topological uniform descent.The sufficient and necessary conditions for a bounded linea...In this paper,a-Browder’s theorem and a-Weyl’s theorem for bounded linear operators are studied by means of the property of the topological uniform descent.The sufficient and necessary conditions for a bounded linear operator defined on a Hilbert space holding aBrowder’s theorem and a-Weyl’s theorem are established.As a consequence of the main result,the new judgements of a-Browder’s theorem and a-Weyl’s theorem for operator function are discussed.展开更多
This study aimed to compare gait properties during level walking and during stair ascent and descent with varying loads. Fifteen healthy young men (mean age: 22.1 ± 1.6 years) walked while holding four different ...This study aimed to compare gait properties during level walking and during stair ascent and descent with varying loads. Fifteen healthy young men (mean age: 22.1 ± 1.6 years) walked while holding four different loads relative to each subject’s body mass (0, 20, 40 and 60% of body mass: BM) on their backs. Stance time, swing time, and double support times were selected as gait parameters. All parameters showed a maximal value during stair ascent and a minimum value during level walking. Stance and double support times increased significan- tly with each load during level walking and during stair ascent and descent. In conclusion, st- air ascent and descent creates more unstable movement than level walking regardless of the weight of the load. The effect of loads on gait increases with the weight of the load and becomes obvious once the load exceeds 60% of BM.展开更多
Some properties of a class of quasi-differentiable functions（the difference of two finite convex functions） are considered in this paper. And the convergence of the steepest descent algorithm for unconstrained and c...Some properties of a class of quasi-differentiable functions（the difference of two finite convex functions） are considered in this paper. And the convergence of the steepest descent algorithm for unconstrained and constrained quasi-differentiable programming is proved.展开更多
Temperature prediction plays an important role in ring die granulator control,which can influence the quantity and quality of production. Temperature prediction modeling is a complicated problem with its MIMO, nonline...Temperature prediction plays an important role in ring die granulator control,which can influence the quantity and quality of production. Temperature prediction modeling is a complicated problem with its MIMO, nonlinear, and large time-delay characteristics. Support vector machine( SVM) has been successfully based on small data. But its accuracy is not high,in contrast,if the number of data and dimension of feature increase,the training time of model will increase dramatically. In this paper,a linear SVM was applied combing with cyclic coordinate descent( CCD) to solving big data regression. It was mathematically strictly proved and validated by simulation. Meanwhile,real data were conducted to prove the linear SVM model's effect. Compared with other methods for big data in simulation, this algorithm has apparent advantage not only in fast modeling but also in high fitness.展开更多
In this paper, we extend a descent algorithm without line search for solving unconstrained optimization problems. Under mild conditions, its global convergence is established. Further, we generalize the search directi...In this paper, we extend a descent algorithm without line search for solving unconstrained optimization problems. Under mild conditions, its global convergence is established. Further, we generalize the search direction to more general form, and also obtain the global convergence of corresponding algorithm. The numerical results illustrate that the new algorithm is effective.展开更多
<div style="text-align:justify;"> In order to speed up the global optimization-based mesh smoothing, an enhanced steepest descent method is presented in the paper. Numerical experiment results show tha...<div style="text-align:justify;"> In order to speed up the global optimization-based mesh smoothing, an enhanced steepest descent method is presented in the paper. Numerical experiment results show that the method performs better than the steepest descent method in the global smoothing. We also presented a physically-based interpretation to explain why the method works better than the steepest descent method. </div>展开更多
Matrix completion is the extension of compressed sensing.In compressed sensing,we solve the underdetermined equations using sparsity prior of the unknown signals.However,in matrix completion,we solve the underdetermin...Matrix completion is the extension of compressed sensing.In compressed sensing,we solve the underdetermined equations using sparsity prior of the unknown signals.However,in matrix completion,we solve the underdetermined equations based on sparsity prior in singular values set of the unknown matrix,which also calls low-rank prior of the unknown matrix.This paper firstly introduces basic concept of matrix completion,analyses the matrix suitably used in matrix completion,and shows that such matrix should satisfy two conditions:low rank and incoherence property.Then the paper provides three reconstruction algorithms commonly used in matrix completion:singular value thresholding algorithm,singular value projection,and atomic decomposition for minimum rank approximation,puts forward their shortcoming to know the rank of original matrix.The Projected Gradient Descent based on Soft Thresholding(STPGD),proposed in this paper predicts the rank of unknown matrix using soft thresholding,and iteratives based on projected gradient descent,thus it could estimate the rank of unknown matrix exactly with low computational complexity,this is verified by numerical experiments.We also analyze the convergence and computational complexity of the STPGD algorithm,point out this algorithm is guaranteed to converge,and analyse the number of iterations needed to reach reconstruction error.Compared the computational complexity of the STPGD algorithm to other algorithms,we draw the conclusion that the STPGD algorithm not only reduces the computational complexity,but also improves the precision of the reconstruction solution.展开更多
基金supported in part by the Department of OB/GYN research funds(University of Louisville,Louisville,KY,USA)Jilin Province Health Technology Capability Enhancement funds(No.2022JC055).
文摘Testicular descent occurs in two consecutive stages:the transabdominal stage and the inguinoscrotal stage.Androgens play a crucial role in the second stage by influencing the development of the gubernaculum,a structure that pulls the testis into the scrotum.However,the mechanisms of androgen actions underlying many of the processes associated with gubernaculum development have not been fully elucidated.To identify the androgen-regulated genes,we conducted large-scale gene expression analyses on the gubernaculum harvested from luteinizing hormone/choriogonadotropin receptor knockout(Lhcgr KO)mice,an animal model of inguinoscrotal testis maldescent resulting from androgen deficiency.We found that the expression of secreted protein acidic and rich in cysteine(SPARC)-related modular calcium binding 1(Smoc1)was the most severely suppressed at both the transcript and protein levels,while its expression was the most dramatically induced by testosterone administration in the gubernacula of Lhcgr KO mice.The upregulation of Smoc1 expression by testosterone was curtailed by the addition of an androgen receptor antagonist,flutamide.In addition,in vitro studies demonstrated that SMOC1 modestly but significantly promoted the proliferation of gubernacular cells.In the cultures of myogenic differentiation medium,both testosterone and SMOC1 enhanced the expression of myogenic regulatory factors such as paired box 7(Pax7)and myogenic factor 5(Myf5).After short-interfering RNA-mediated knocking down of Smoc1,the expression of Pax7 and Myf5 diminished,and testosterone alone did not recover,but additional SMOC1 did.These observations indicate that SMOC1 is pivotal in mediating androgen action to regulate gubernaculum development during inguinoscrotal testicular descent.
文摘Sentiment analysis plays an important role in distilling and clarifying content from movie reviews,aiding the audience in understanding universal views towards the movie.However,the abundance of reviews and the risk of encountering spoilers pose challenges for efcient sentiment analysis,particularly in Arabic content.Tis study proposed a Stochastic Gradient Descent(SGD)machine learning(ML)model tailored for sentiment analysis in Arabic and English movie reviews.SGD allows for fexible model complexity adjustments,which can adapt well to the Involvement of Arabic language data.Tis adaptability ensures that the model can capture the nuances and specifc local patterns of Arabic text,leading to better performance.Two distinct language datasets were utilized,and extensive pre-processing steps were employed to optimize the datasets for analysis.Te proposed SGD model,designed to accommodate the nuances of each language,aims to surpass existing models in terms of accuracy and efciency.Te SGD model achieves an accuracy of 84.89 on the Arabic dataset and 87.44 on the English dataset,making it the top-performing model in terms of accuracy on both datasets.Tis indicates that the SGD model consistently demonstrates high accuracy levels across Arabic and English datasets.Tis study helps deepen the understanding of sentiments across various linguistic datasets.Unlike many studies that focus solely on movie reviews,the Arabic dataset utilized here includes hotel reviews,ofering a broader perspective.
文摘In [7], Cross showed that the spectrum of a linear relation T on a normed space satisfies the spectral mapping theorem. In this paper, we extend the notion of essential ascent and descent for an operator acting on a vector space to linear relations acting on Banach spaces. We focus to define and study the descent, essential descent, ascent and essential ascent spectrum of a linear relation everywhere defined on a Banach space X. In particular, we show that the corresponding spectrum satisfy the polynomial version of the spectral mapping theorem.
基金Project was supported by the National Key R&D Program of China(Grant No.2017YFB1104404)
文摘In order to obtain a high-quality weld during the laser welding process, extracting the characteristic parameters of weld pool is an important issue for automated welding. In this paper, the type 304 austenitic stainless steel is welded by a 5 kW high-power fiber laser and a high-speed camera is employed to capture the topside images of weld pools. Then we propose a robust visual-detection approach for the molten pool based on the supervised descent method. It provides an elegant framework for representing the outline of a weld pool and is especially efficient for weld pool detection in the presence of strong uncertainties and disturbances. Finally, welding experimental results verified that the proposed approach can extract the weld pool boundary accurately, which will lay a solid foundation for controlling the weld quality of fiber laser welding process.
基金supported by NSFC Grant 10601043,NCETXMUSRF for ROCS,SEM+2 种基金supported by RGC 201508HKBU FRGssupported by the Hong Kong Research Grant Council
文摘This paper presents a coordinate gradient descent approach for minimizing the sum of a smooth function and a nonseparable convex function.We find a search direction by solving a subproblem obtained by a second-order approximation of the smooth function and adding a separable convex function.Under a local Lipschitzian error bound assumption,we show that the algorithm possesses global and local linear convergence properties.We also give some numerical tests(including image recovery examples) to illustrate the efficiency of the proposed method.
基金supported in part by the National Natural Science Foundation of China(61772493)the Deanship of Scientific Research(DSR)at King Abdulaziz University(RG-48-135-40)+1 种基金Guangdong Province Universities and College Pearl River Scholar Funded Scheme(2019)the Natural Science Foundation of Chongqing(cstc2019jcyjjqX0013)。
文摘A recommender system(RS)relying on latent factor analysis usually adopts stochastic gradient descent(SGD)as its learning algorithm.However,owing to its serial mechanism,an SGD algorithm suffers from low efficiency and scalability when handling large-scale industrial problems.Aiming at addressing this issue,this study proposes a momentum-incorporated parallel stochastic gradient descent(MPSGD)algorithm,whose main idea is two-fold:a)implementing parallelization via a novel datasplitting strategy,and b)accelerating convergence rate by integrating momentum effects into its training process.With it,an MPSGD-based latent factor(MLF)model is achieved,which is capable of performing efficient and high-quality recommendations.Experimental results on four high-dimensional and sparse matrices generated by industrial RS indicate that owing to an MPSGD algorithm,an MLF model outperforms the existing state-of-the-art ones in both computational efficiency and scalability.
文摘The original free vortex wake model was used for numerical investigation.Calculation of the aerodynamic characteristics in hover and vertical descent modes in the range of vertical descent speed of 0–30 m/s including the Vortex Ring State(VRS)area was performed.The calculations were carried out under the condition of variable blade pitch angle values providing a fixed timeaverage thrust value.Visualization data of free vortex wake shapes,flow structures,and velocity fields were obtained and analyzed.The time-dependences of the rotor’s thrust and torque coefficients were obtained and analyzed.The obtained data allows determining the boundaries of the VRS area by various criteria such as rotor thrust and torque pulsations,growth of rotor power consumption relative to the hover,growth of rotor induced velocities relative to the hover,and growth of the required rotor blade pitch angles values.The results of the study are compared with experimental and calculated data of other authors and can significantly supplement the available results of experimental and computational studies in this area.
基金the National Key Research and Development Program of China(No.2016YFB0901900)the National Natural Science Foundation of China(No.61733018)the China Special Postdoctoral Science Foundation Funded Project(No.Y990075G21).
文摘In this paper,we consider a distributed resource allocation problem of minimizing a global convex function formed by a sum of local convex functions with coupling constraints.Based on neighbor communication and stochastic gradient,a distributed stochastic mirror descent algorithm is designed for the distributed resource allocation problem.Sublinear convergence to an optimal solution of the proposed algorithm is given when the second moments of the gradient noises are summable.A numerical example is also given to illustrate the effectiveness of the proposed algorithm.
基金Item Sponsored by National Natural Science Foundation of China(61290325)
文摘Mathematical models for burden descending process have been applied to obtain whole burden structures in blast furnace,whereas the accuracy of those burden descent models has not been sufficiently investigated.Special evaluation method based on timeline burden profiles was established to quantitatively evaluate the error between experimental and modeled burden structures.Four existing burden descent models were utilized to describe the burden structure of a 1/20 scaled warm blast furnace.Input modeling conditions including initial burden profile,descending volumes in each time interval,and normalized descending velocity distribution were determined via special image processing technology.Modeled burden structures were evaluated combined with the published experimental data.It is found that all the models caught the main profile of the burden structure.Furthermore,the improved nonuniform descent model（Model IV）shows the highest level of precision especially when burden descends with unstable velocity distribution tendency.Meanwhile,the traditional nonuniform descent model（Model III）may also be desirable to model the burden descending process when the burden descending velocity presents a linear tendency.Finally,the uniform descent model（Model I）might be the first option for roughly predicting burden structure.
基金Supported by Research Council of Semnan University
文摘A hybridization of the three–term conjugate gradient method proposed by Zhang et al. and the nonlinear conjugate gradient method proposed by Polak and Ribi`ere, and Polyak is suggested. Based on an eigenvalue analysis, it is shown that search directions of the proposed method satisfy the sufficient descent condition, independent of the line search and the objective function convexity. Global convergence of the method is established under an Armijo–type line search condition. Numerical experiments show practical efficiency of the proposed method.
基金Project supported by the National Natural Science Foundation of China(Grant No.10271073)
文摘In this paper, a new method named as the gradually descent method was proposed to solve the discrete global optimization problem. With the aid of an auxiliary function, this method enables to convert the problem of finding one discrete minimizer of the objective function f to that of finding another at each cycle. The auxiliary function can ensure that a point, except a prescribed point, is not its integer stationary point if the value of objective function at the point is greater than the scalar which is chosen properly. This property leads to a better minimizer of f found more easily by some classical local search methods. The computational results show that this algorithm is quite efficient and reliable for solving nonlinear integer programming problems.
文摘The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm.The deregularization maximized the energy of the solution,which was opposite to the Tikhonov regularization where the energy was minimized.However,combined with box-constraints,the deregularization forced the solution to be close to the binary set.It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector.As a result,the worst-case and average complexity are reduced down as K2.8 and K2.5 floating point operation per second,respectively.The development improves the "efficient frontier" in multiuser detection,which is illustrated by simulation results.In addition,most operations in the detector are additions and bit-shifts.This makes the proposed technique attractive for fixed-point hardware implementation.
基金Supported by the 2021 General Special Scientific Research Project of Education Department of Shaanxi Provincial Government(21JK0637)Science and Technology Planning Project of Weinan Science and Technology Bureau(2022ZDYFJH-11)2021 Talent Project of Weinan Normal University(2021RC16)。
文摘In this paper,a-Browder’s theorem and a-Weyl’s theorem for bounded linear operators are studied by means of the property of the topological uniform descent.The sufficient and necessary conditions for a bounded linear operator defined on a Hilbert space holding aBrowder’s theorem and a-Weyl’s theorem are established.As a consequence of the main result,the new judgements of a-Browder’s theorem and a-Weyl’s theorem for operator function are discussed.
文摘This study aimed to compare gait properties during level walking and during stair ascent and descent with varying loads. Fifteen healthy young men (mean age: 22.1 ± 1.6 years) walked while holding four different loads relative to each subject’s body mass (0, 20, 40 and 60% of body mass: BM) on their backs. Stance time, swing time, and double support times were selected as gait parameters. All parameters showed a maximal value during stair ascent and a minimum value during level walking. Stance and double support times increased significan- tly with each load during level walking and during stair ascent and descent. In conclusion, st- air ascent and descent creates more unstable movement than level walking regardless of the weight of the load. The effect of loads on gait increases with the weight of the load and becomes obvious once the load exceeds 60% of BM.
基金Supported by the State Foundations of Ph.D.Units(20020141013)Supported by the NSF of China(10001007)
文摘Some properties of a class of quasi-differentiable functions（the difference of two finite convex functions） are considered in this paper. And the convergence of the steepest descent algorithm for unconstrained and constrained quasi-differentiable programming is proved.
基金Nantong Research Program of Application Foundation,China(No.BK2012030)Key Project of Science and Technology Commission of Shanghai Municipality,China(No.10JC1405000)
文摘Temperature prediction plays an important role in ring die granulator control,which can influence the quantity and quality of production. Temperature prediction modeling is a complicated problem with its MIMO, nonlinear, and large time-delay characteristics. Support vector machine( SVM) has been successfully based on small data. But its accuracy is not high,in contrast,if the number of data and dimension of feature increase,the training time of model will increase dramatically. In this paper,a linear SVM was applied combing with cyclic coordinate descent( CCD) to solving big data regression. It was mathematically strictly proved and validated by simulation. Meanwhile,real data were conducted to prove the linear SVM model's effect. Compared with other methods for big data in simulation, this algorithm has apparent advantage not only in fast modeling but also in high fitness.
文摘In this paper, we extend a descent algorithm without line search for solving unconstrained optimization problems. Under mild conditions, its global convergence is established. Further, we generalize the search direction to more general form, and also obtain the global convergence of corresponding algorithm. The numerical results illustrate that the new algorithm is effective.
文摘<div style="text-align:justify;"> In order to speed up the global optimization-based mesh smoothing, an enhanced steepest descent method is presented in the paper. Numerical experiment results show that the method performs better than the steepest descent method in the global smoothing. We also presented a physically-based interpretation to explain why the method works better than the steepest descent method. </div>
基金Supported by the National Natural Science Foundation ofChina(No.61271240)Jiangsu Province Natural Science Fund Project(No.BK2010077)Subject of Twelfth Five Years Plans in Jiangsu Second Normal University(No.417103)
文摘Matrix completion is the extension of compressed sensing.In compressed sensing,we solve the underdetermined equations using sparsity prior of the unknown signals.However,in matrix completion,we solve the underdetermined equations based on sparsity prior in singular values set of the unknown matrix,which also calls low-rank prior of the unknown matrix.This paper firstly introduces basic concept of matrix completion,analyses the matrix suitably used in matrix completion,and shows that such matrix should satisfy two conditions:low rank and incoherence property.Then the paper provides three reconstruction algorithms commonly used in matrix completion:singular value thresholding algorithm,singular value projection,and atomic decomposition for minimum rank approximation,puts forward their shortcoming to know the rank of original matrix.The Projected Gradient Descent based on Soft Thresholding(STPGD),proposed in this paper predicts the rank of unknown matrix using soft thresholding,and iteratives based on projected gradient descent,thus it could estimate the rank of unknown matrix exactly with low computational complexity,this is verified by numerical experiments.We also analyze the convergence and computational complexity of the STPGD algorithm,point out this algorithm is guaranteed to converge,and analyse the number of iterations needed to reach reconstruction error.Compared the computational complexity of the STPGD algorithm to other algorithms,we draw the conclusion that the STPGD algorithm not only reduces the computational complexity,but also improves the precision of the reconstruction solution.
