全文获取类型
收费全文 | 20996篇 |
免费 | 2328篇 |
国内免费 | 1015篇 |
专业分类
化学 | 4694篇 |
晶体学 | 77篇 |
力学 | 2382篇 |
综合类 | 493篇 |
数学 | 11834篇 |
物理学 | 4859篇 |
出版年
2024年 | 48篇 |
2023年 | 228篇 |
2022年 | 654篇 |
2021年 | 717篇 |
2020年 | 547篇 |
2019年 | 558篇 |
2018年 | 556篇 |
2017年 | 778篇 |
2016年 | 908篇 |
2015年 | 646篇 |
2014年 | 1136篇 |
2013年 | 1377篇 |
2012年 | 1262篇 |
2011年 | 1181篇 |
2010年 | 1025篇 |
2009年 | 1250篇 |
2008年 | 1265篇 |
2007年 | 1333篇 |
2006年 | 1097篇 |
2005年 | 960篇 |
2004年 | 810篇 |
2003年 | 776篇 |
2002年 | 657篇 |
2001年 | 577篇 |
2000年 | 539篇 |
1999年 | 436篇 |
1998年 | 417篇 |
1997年 | 393篇 |
1996年 | 292篇 |
1995年 | 290篇 |
1994年 | 227篇 |
1993年 | 204篇 |
1992年 | 177篇 |
1991年 | 135篇 |
1990年 | 130篇 |
1989年 | 95篇 |
1988年 | 88篇 |
1987年 | 68篇 |
1986年 | 74篇 |
1985年 | 82篇 |
1984年 | 80篇 |
1983年 | 27篇 |
1982年 | 41篇 |
1981年 | 26篇 |
1980年 | 23篇 |
1979年 | 39篇 |
1978年 | 22篇 |
1977年 | 35篇 |
1976年 | 20篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
62.
Random copolymers of poly{(methacrylamide)-co-(vinyl trimethoxysilane)} and poly{(methacrylic acid)-co-(vinyl trimethoxysilane)} were synthesized via a free radical polymerization reaction. Acid catalyzed sol-gel process of tetraethylorthosilicate (TEOS) with aforementioned polymers in the presence of methyl xanthine class of alkaloid like caffeine resulted in the formation of highly transparent monoliths. Solvent extraction of the template leaves behind the recognition sites intact with high selectivity towards the print molecule. The ionic and non-specific adsorptions, which are considered to be the main disadvantages of the molecularly imprinted polymers (MIP), are prevented to a considerable extent by the end capping of surface silanol groups. The template binding efficiencies of MIP were determined by HPLC analysis. 相似文献
63.
64.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
65.
We present a practical polynomial-time algorithm for computing the
zeta function of a Kummer curve over a finite field of small
characteristic. Such algorithms have recently been obtained using a
method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of
interest in cryptography. We take a different approach.
The problem is reduced to that of computing the L-function
of a multiplicative character sum. This latter task is achieved via a
cohomological formula based upon the work of Dwork and Reich. We show,
however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota 相似文献
66.
近年来,决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用.本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法.由误差平方和最小原则,这个反问题可化为一个变分问题,并进一步离散化为一个最优化问题,其目标函数依赖于要决定的方程系数.本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现,并与拟牛顿法作为对比.为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵.同时还考察了线搜索方法的不同对优化算法的影响.数值实验的结果表明,非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效. 相似文献
67.
A preconditioning approach based on the artificial compressibility formulation is extended to solve the governing equations for unsteady turbulent reactive flows with heat release, at low Mach numbers, on an unstructured hybrid grid context. Premixed reactants are considered and a flamelet approach for combustion modelling is adopted using a continuous quenched mean reaction rate. An overlapped cell‐vertex finite volume method is adopted as a discretisation scheme. Artificial dissipation terms for hybrid grids are explicitly added to ensure a stable, discretised set of equations. A second‐order, explicit, hybrid Runge–Kutta scheme is applied for the time marching in pseudo‐time. A time derivative of the dependent variable is added to recover the time accuracy of the preconditioned set of equations. This derivative is discretised by an implicit, second‐order scheme. The resulting scheme is applied to the calculation of an infinite planar (one‐dimensional) turbulent premixed flame propagating freely in reactants whose turbulence is supposed to be frozen, homogeneous and isotropic. The accuracy of the results obtained with the proposed method proves to be excellent when compared to the data available in the literature. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
68.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
69.
70.
Grigor'ev S. A. Kalinnikov A. A. Porembskii V. I. Baranov I. E. Borisova E. V. Fateev V. N. 《Russian Journal of Electrochemistry》2004,40(11):1188-1192
A two-dimensional mathematical model for the transport of reactants in a fuel cell with a solid polymer electrolyte is developed. The model is used for analyzing spatial distributions of the concentration of reactants and current density over the cell. The effect of the catalytic-layer activity, reactant speed, bipolar-plate geometry, thickness and porosity of current collector and/or gas-diffusion sublayer, and the reaction mixture composition on the fuel cell efficiency is estimated theoretically and experimentally. 相似文献