全文获取类型
收费全文 | 611篇 |
免费 | 13篇 |
国内免费 | 11篇 |
专业分类
化学 | 43篇 |
力学 | 22篇 |
综合类 | 7篇 |
数学 | 443篇 |
物理学 | 120篇 |
出版年
2023年 | 7篇 |
2022年 | 7篇 |
2021年 | 8篇 |
2020年 | 8篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 15篇 |
2016年 | 18篇 |
2015年 | 18篇 |
2014年 | 31篇 |
2013年 | 32篇 |
2012年 | 29篇 |
2011年 | 22篇 |
2010年 | 22篇 |
2009年 | 39篇 |
2008年 | 39篇 |
2007年 | 37篇 |
2006年 | 32篇 |
2005年 | 19篇 |
2004年 | 23篇 |
2003年 | 17篇 |
2002年 | 12篇 |
2001年 | 18篇 |
2000年 | 28篇 |
1999年 | 17篇 |
1998年 | 9篇 |
1997年 | 13篇 |
1996年 | 10篇 |
1995年 | 11篇 |
1994年 | 6篇 |
1993年 | 7篇 |
1992年 | 9篇 |
1991年 | 2篇 |
1989年 | 1篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 4篇 |
1985年 | 8篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1973年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有635条查询结果,搜索用时 31 毫秒
1.
We prove that the resultant of two “sufficiently generic” bivariate polynomials over a finite field can be computed in quasi-linear expected time, using a randomized algorithm of Las Vegas type. A similar complexity bound is proved for the computation of the lexicographical Gröbner basis for the ideal generated by the two polynomials. 相似文献
2.
3.
Rui Shen Zhiqing Meng Chuangyin Dang Min Jiang 《Numerical Functional Analysis & Optimization》2017,38(11):1473-1489
In this paper, an algorithm of barrier objective penalty function for inequality constrained optimization is studied and a conception–the stability of barrier objective penalty function is presented. It is proved that an approximate optimal solution may be obtained by solving a barrier objective penalty function for inequality constrained optimization problem when the barrier objective penalty function is stable. Under some conditions, the stability of barrier objective penalty function is proved for convex programming. Specially, the logarithmic barrier function of convex programming is stable. Based on the barrier objective penalty function, an algorithm is developed for finding an approximate optimal solution to an inequality constrained optimization problem and its convergence is also proved under some conditions. Finally, numerical experiments show that the barrier objective penalty function algorithm has better convergence than the classical barrier function algorithm. 相似文献
5.
6.
7.
Overlap coincidence in a self-affine tiling in Rd is equivalent to pure point dynamical spectrum of the tiling dynamical system. We interpret the overlap coincidence in the setting of substitution Delone set in Rd and find an efficient algorithm to check the pure point dynamical spectrum. This algorithm is easy to implement into a computer program. We give the program and apply it to several examples. In the course of the proof of the algorithm, we show a variant of the conjecture of Urbański (Solomyak (2006) [40]) on the Hausdorff dimension of the boundaries of fractal tiles. 相似文献
8.
The Markov-Bernstein inequalities for generalized Gegenbauer weight are studied. A special basis of the vector space Pn of real polynomials in one variable of degree at most equal to n is proposed. It is produced by quasi-orthogonal polynomials with respect to this generalized Gegenbauer measure. Thanks to this basis the problem to find the Markov-Bernstein constant is separated in two eigenvalue problems. The first has a classical form and we are able to give lower and upper bounds of the Markov-Bernstein constant by using the Newton method and the classical qd algorithm applied to a sequence of orthogonal polynomials. The second is a generalized eigenvalue problem with a five diagonal matrix and a tridiagonal matrix. A lower bound is obtained by using the Newton method applied to the six term recurrence relation produced by the expansion of the characteristic determinant. The asymptotic behavior of an upper bound is studied. Finally, the asymptotic behavior of the Markov-Bernstein constant is O(n2) in both cases. 相似文献
9.
10.
Multiobjective optimization scheme for industrial synthesis gas sweetening plant in GTL process 下载免费PDF全文
In industrial amine plants the optimized operating conditions are obtained from the conclusion of occurred events and challenges that are normal in the working units. For the sake of reducing the costs, time consuming, and preventing unsuitable accidents, the optimization could be performed by a computer program. In this paper, simulation and parameter analysis of amine plant is performed at first. The optimization of this unit is studied using Non-Dominated Sorting Genetic Algorithm-II in order to produce sweet gas with CO 2 mole percentage less than 2.0% and H 2 S concentration less than 10 ppm for application in Fischer-Tropsch synthesis. The simulation of the plant in HYSYS v.3.1 software has been linked with MATLAB code for real-parameter NSGA-II to simulate and optimize the amine process. Three scenarios are selected to cover the effect of (DEA/MDEA) mass composition percent ratio at amine solution on objective functions. Results show that sour gas temperature and pressure of 33.98 ? C and 14.96 bar, DEA/CO 2 molar flow ratio of 12.58, regeneration gas temperature and pressure of 94.92 ? C and 3.0 bar, regenerator pressure of 1.53 bar, and ratio of DEA/MDEA = 20%/10% are the best values for minimizing plant energy consumption, amine circulation rate, and carbon dioxide recovery. 相似文献