全文获取类型
收费全文 | 14810篇 |
免费 | 1853篇 |
国内免费 | 733篇 |
专业分类
化学 | 6309篇 |
晶体学 | 52篇 |
力学 | 1253篇 |
综合类 | 54篇 |
数学 | 5569篇 |
物理学 | 4159篇 |
出版年
2024年 | 19篇 |
2023年 | 169篇 |
2022年 | 203篇 |
2021年 | 288篇 |
2020年 | 468篇 |
2019年 | 377篇 |
2018年 | 388篇 |
2017年 | 356篇 |
2016年 | 620篇 |
2015年 | 579篇 |
2014年 | 745篇 |
2013年 | 1373篇 |
2012年 | 839篇 |
2011年 | 860篇 |
2010年 | 638篇 |
2009年 | 907篇 |
2008年 | 875篇 |
2007年 | 947篇 |
2006年 | 805篇 |
2005年 | 626篇 |
2004年 | 605篇 |
2003年 | 573篇 |
2002年 | 483篇 |
2001年 | 474篇 |
2000年 | 429篇 |
1999年 | 346篇 |
1998年 | 354篇 |
1997年 | 272篇 |
1996年 | 270篇 |
1995年 | 203篇 |
1994年 | 166篇 |
1993年 | 154篇 |
1992年 | 99篇 |
1991年 | 100篇 |
1990年 | 82篇 |
1989年 | 68篇 |
1988年 | 72篇 |
1987年 | 49篇 |
1986年 | 86篇 |
1985年 | 45篇 |
1984年 | 57篇 |
1983年 | 19篇 |
1982年 | 36篇 |
1981年 | 32篇 |
1980年 | 20篇 |
1979年 | 26篇 |
1978年 | 43篇 |
1977年 | 43篇 |
1976年 | 43篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
61.
The many facets of linear programming 总被引:1,自引:0,他引:1
Michael J. Todd 《Mathematical Programming》2002,91(3):417-436
We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex,
ellipsoid, interior-point, and other methods.
Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001 相似文献
62.
Gisella Facchinetti 《Fuzzy Optimization and Decision Making》2002,1(3):313-327
In this paper we present two definitions of possibilistic weighted average of fuzzy numbers, and by them we introduce two different rankings on the set of real fuzzy numbers. The two methods are dependent on several parameters. In the first case, the parameter is constant and the results generalize what Carlsson and Fuller have obtained in (2001). In the second case, the parameter is a function, not fixed a priori by the decision maker, but it depends on the position of the interval on the real axe. In all the two cases we call the parameter degree of risk, which takes into account of a risk-tendency or aversion of the decision maker. 相似文献
63.
Bernard Bialecki 《Numerical Algorithms》1994,8(2):167-184
Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N
2log2
N) andO(N
2log2log2
N) arithmetic operations, respectively. 相似文献
64.
Boris Andreianov Franck Boyer Florence Hubert 《Numerical Methods for Partial Differential Equations》2007,23(1):145-195
Discrete duality finite volume schemes on general meshes, introduced by Hermeline and Domelevo and Omnès for the Laplace equation, are proposed for nonlinear diffusion problems in 2D with nonhomogeneous Dirichlet boundary condition. This approach allows the discretization of non linear fluxes in such a way that the discrete operator inherits the key properties of the continuous one. Furthermore, it is well adapted to very general meshes including the case of nonconformal locally refined meshes. We show that the approximate solution exists and is unique, which is not obvious since the scheme is nonlinear. We prove that, for general W?1,p′(Ω) source term and W1‐(1/p),p(?Ω) boundary data, the approximate solution and its discrete gradient converge strongly towards the exact solution and its gradient, respectively, in appropriate Lebesgue spaces. Finally, error estimates are given in the case where the solution is assumed to be in W2,p(Ω). Numerical examples are given, including those on locally refined meshes. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007 相似文献
65.
66.
CdZnTe核探测器的蒙特卡罗模拟的初步研究 总被引:6,自引:0,他引:6
以CdZnTe核探测器的工作原理为依据,探测器内反应的随机性和反应产生的电子空穴对数目的统计规律为物理模型,应用Visual C + + 自行编制了蒙特卡罗模拟软件.模拟了γ射线在CdZnTe探测器中的响应能谱,并将模拟结果与实际器件的测试结果进行了比较讨论.模拟能谱与实际测得的能谱的主峰符合较好.此外,通过分析57Co源辐照下探测效率与器件厚度的关系,可以推测探测效率达到最大时所对应CdZnTe探测器的理想厚度 相似文献
67.
In a previous paper we gave a new formulation and derived the Euler equations and other necessary conditions to solve strong, pathwise, stochastic variational problems with trajectories driven by Brownian motion. Thus, unlike current methods which minimize the control over deterministic functionals (the expected value), we find the control which gives the critical point solution of random functionals of a Brownian path and then, if we choose, find the expected value.This increase in information is balanced by the fact that our methods are anticipative while current methods are not. However, our methods are more directly connected to the theory and meaningful examples of deterministic variational theory and provide better means of solution for free and constrained problems. In addition, examples indicate that there are methods to obtain nonanticipative solutions from our equations although the anticipative optimal cost function has smaller expected value.In this paper we give new, efficient numerical methods to find the solution of these problems in the quadratic case. Of interest is that our numerical solution has a maximal, a priori, pointwise error of O(h3/2) where h is the node size. We believe our results are unique for any theory of stochastic control and that our methods of proof involve new and sophisticated ideas for strong solutions which extend previous deterministic results by the first author where the error was O(h2).We note that, although our solutions are given in terms of stochastic differential equations, we are not using the now standard numerical methods for stochastic differential equations. Instead we find an approximation to the critical point solution of the variational problem using relations derived from setting to zero the directional derivative of the cost functional in the direction of simple test functions.Our results are even more significant than they first appear because we can reformulate stochastic control problems or constrained calculus of variations problems in the unconstrained, stochastic calculus of variations formulation of this paper. This will allow us to find efficient and accurate numerical solutions for general constrained, stochastic optimization problems. This is not yet being done, even in the deterministic case, except by the first author. 相似文献
68.
The adsorption behavior (capacity, density distribution and packing density) and the isosteric heat versus loading in a slit pore whose walls contain defective graphene layers are investigated in this paper. The defective wall is characterized by the extent and size of the defect. Simulation results obtained with the Grand Canonical Monte Carlo method reveal complex patterns of isosteric heat, and this complex behavior is a result of the interplay between three factors: (i) the surface heterogeneity (solid-fluid interaction, sites with varying degree of affinity), (ii) fluid-fluid interaction and (iii) the overlapping of potentials exerted by the two defective walls. We illustrate this with argon adsorption in pores of various sizes, and results obtained from the simulation agree qualitatively with the experimental data at 77 K on Saran microporous S600H and micro-mesoporous S84 charcoals of Beebe et al. [R.A. Beebe, B. Millard, J. Cynarski, J. Am. Chem. Soc. 75 (1953) 839]. The S600H was found to contain pores predominantly in the neighborhood of 7 Å with 30% of defect and a defective size of 2.84 Å. This is consistent with the argument made by Beebe et al. that this sample is a microporous solid and most pores can accommodate only one layer. The other sample, S84, has larger pores than S600H, and it is found that it has a wider pore size distribution and the pore width is centered at about 12 Å. 相似文献
69.
Various tests have been carried out in order to compare the performances of several methods used to solve the non-symmetric linear systems of equations arising from implicit discretizations of CFD problems, namely the scalar advection-diffusion equation and the compressible Euler equations. The iterative schemes under consideration belong to three families of algorithms: relaxation (Jacobi and Gauss-Seidel), gradient and Newton methods. Two gradient methods have been selected: a Krylov subspace iteration method (GMRES) and a non-symmetric extension of the conjugate gradient method (CGS). Finally, a quasi-Newton method has also been considered (Broyden). The aim of this paper is to provide indications of which appears to be the most adequate method according to the particular circumstances as well as to discuss the implementation aspects of each scheme. 相似文献
70.
An efficient preconditioner is developed for solving the Helmholtz problem in both high and low frequency (wavenumber) regimes. The preconditioner is based on hierarchical unknowns on nested grids, known as incremental unknowns (IU). The motivation for the IU preconditioner is provided by an eigenvalue analysis of a simplified Helmholtz problem. The performance of our preconditioner is tested on the iterative solution of two‐dimensional electromagnetic scattering problems. When compared with other well‐known methods, our technique is shown to often provide a better numerical efficacy and, most importantly, to be more robust. Moreover, for the best performance, the number of IU levels used in the preconditioner should be designed for the coarsest grid to have roughly two points per linear wavelength. This result is consistent with the conventional sampling criteria for wave phenomena in contrast with existing IU applications for solving the Laplace/Poisson problem, where the coarsest grid comprises just one interior point. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007 相似文献