全文获取类型
收费全文 | 393篇 |
免费 | 35篇 |
国内免费 | 28篇 |
专业分类
化学 | 9篇 |
力学 | 6篇 |
综合类 | 4篇 |
数学 | 379篇 |
物理学 | 58篇 |
出版年
2023年 | 7篇 |
2022年 | 9篇 |
2021年 | 14篇 |
2020年 | 6篇 |
2019年 | 14篇 |
2018年 | 13篇 |
2017年 | 13篇 |
2016年 | 10篇 |
2015年 | 6篇 |
2014年 | 17篇 |
2013年 | 31篇 |
2012年 | 20篇 |
2011年 | 21篇 |
2010年 | 23篇 |
2009年 | 20篇 |
2008年 | 23篇 |
2007年 | 17篇 |
2006年 | 22篇 |
2005年 | 13篇 |
2004年 | 12篇 |
2003年 | 19篇 |
2002年 | 24篇 |
2001年 | 11篇 |
2000年 | 13篇 |
1999年 | 10篇 |
1998年 | 7篇 |
1997年 | 12篇 |
1996年 | 8篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 5篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1974年 | 1篇 |
排序方式: 共有456条查询结果,搜索用时 78 毫秒
1.
《Indagationes Mathematicae》2021,32(6):1229-1239
2.
3.
4.
矩阵填充是指利用矩阵的低秩特性而由部分观测元素恢复出原矩阵,在推荐系统、信号处理、医学成像、机器学习等领域有着广泛的应用。采用精确线搜索的交替最速下降法由于每次迭代计算量小因而对大规模问题的求解非常有效。本文在其基础上采用分离地精确线搜索,可使得每次迭代下降更多但计算量相同,从而可望进一步提高计算效率。本文分析了新算法的收敛性。数值结果也表明所提出的算法更加有效。 相似文献
5.
Liya Liu Xiaolong Qin Jen‐Chih Yao 《Mathematical Methods in the Applied Sciences》2019,42(18):7367-7380
The purpose of this paper is to introduce a hybrid descent algorithm for finding a common point in fixed‐point sets of quasi‐nonexpansive mappings and solution sets of variational inequality problems. In the framework of Hilbert spaces, the strong convergence of the hybrid descent algorithm is established. Numerical experiments for the bandwidth allocation, which demonstrate the effectiveness, performance, and convergence of the proposed algorithm, are provided. 相似文献
6.
最近,孙华定义了一类新的精细化Eulerian多项式,即$$A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)},\ \ n\ge 1,$$ 其中$S_n$表示$\{1,2,\ldots,n\}$上全体$n$阶排列的集合, odes$(\pi)$与edes$(\pi)$分别表示$S_n$中排列$\pi$的奇数位与偶数位上降位数的个数.本文利用经典的Eulerian多项式$A_n(q)$ 与Catalan 序列的生成函数$C(q)$,得到精细化Eulerian 多项式$A_n(p,q)$的指数型生成函数及$A_n(p,q)$的显示表达式.在一些特殊情形,本文建立了$A_n(p,q)$与$A_n(0,q)$或$A_n(p,0)$之间的联系,并利用Eulerian数表示多项式$A_n(0,q)$的系数.特别地,这些联系揭示了Euler数$E_n$与Eulerian数$A_{n,k}$之间的一种新的关系. 相似文献
7.
《Stochastic Processes and their Applications》2019,129(12):5278-5311
In this paper, we study the problem of sampling from a given probability density function that is known to be smooth and strongly log-concave. We analyze several methods of approximate sampling based on discretizations of the (highly overdamped) Langevin diffusion and establish guarantees on its error measured in the Wasserstein-2 distance. Our guarantees improve or extend the state-of-the-art results in three directions. First, we provide an upper bound on the error of the first-order Langevin Monte Carlo (LMC) algorithm with optimized varying step-size. This result has the advantage of being horizon free (we do not need to know in advance the target precision) and to improve by a logarithmic factor the corresponding result for the constant step-size. Second, we study the case where accurate evaluations of the gradient of the log-density are unavailable, but one can have access to approximations of the aforementioned gradient. In such a situation, we consider both deterministic and stochastic approximations of the gradient and provide an upper bound on the sampling error of the first-order LMC that quantifies the impact of the gradient evaluation inaccuracies. Third, we establish upper bounds for two versions of the second-order LMC, which leverage the Hessian of the log-density. We provide non asymptotic guarantees on the sampling error of these second-order LMCs. These guarantees reveal that the second-order LMC algorithms improve on the first-order LMC in ill-conditioned settings. 相似文献
8.
Extrapolated Smoothing Descent Algorithm for Constrained Nonconvex and Nonsmooth Composite Problems*
In this paper, the authors propose a novel smoothing descent type algorithm with extrapolation for solving a class of constrained nonsmooth and nonconvex problems,where the nonconvex term is possibly nonsmooth. Their algorithm adopts the proximal gradient algorithm with extrapolation and a safe-guarding policy to minimize the smoothed objective function for better practical and theoretical performance. Moreover, the algorithm uses a easily checking rule to update the smoothing parameter to ensure that any accumulation point of the generated sequence is an (affine-scaled) Clarke stationary point of the original nonsmooth and nonconvex problem. Their experimental results indicate the effectiveness of the proposed algorithm. 相似文献
9.
Yi‐Fei Pu Patrick Siarry Ji‐Liu Zhou Ni Zhang 《Mathematical Methods in the Applied Sciences》2014,37(12):1784-1806
Traditional integer‐order partial differential equation based image denoising approach can easily lead edge and complex texture detail blur, thus its denoising effect for texture image is always not well. To solve the problem, we propose to implement a fractional partial differential equation (FPDE) based denoising model for texture image by applying a novel mathematical method—fractional calculus to image processing from the view of system evolution. Previous studies show that fractional calculus has some unique properties that it can nonlinearly enhance complex texture detail in digital image processing, which is obvious different with integer‐order differential calculus. The goal of the modeling is to overcome the problems of the existed denoising approaches by utilizing the aforementioned properties of fractional differential calculus. Using classic definition and property of fractional differential calculus, we extend integer‐order steepest descent approach to fractional field to implement fractional steepest descent approach. Then, based on the earlier fractional formulas, a FPDE based multiscale denoising model for texture image is proposed and further analyze optimal parameters value for FPDE based denoising model. The experimental results prove that the ability for preserving high‐frequency edge and complex texture information of the proposed fractional denoising model are obviously superior to traditional integral based algorithms, as for texture detail rich images. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
10.
Hédy Attouch Guillaume Garrigos Xavier Goudou 《Journal of Mathematical Analysis and Applications》2015
In a general Hilbert framework, we consider continuous gradient-like dynamical systems for constrained multiobjective optimization involving nonsmooth convex objective functions. Based on the Yosida regularization of the subdifferential operators involved in the system, we obtain the existence of strong global trajectories. We prove a descent property for each objective function, and the convergence of trajectories to weak Pareto minima. This approach provides a dynamical endogenous weighting of the objective functions, a key property for applications in cooperative games, inverse problems, and numerical multiobjective optimization. 相似文献