全文获取类型
收费全文 | 273469篇 |
免费 | 2336篇 |
国内免费 | 735篇 |
专业分类
化学 | 127420篇 |
晶体学 | 3995篇 |
力学 | 14545篇 |
综合类 | 7篇 |
数学 | 42194篇 |
物理学 | 88379篇 |
出版年
2021年 | 996篇 |
2020年 | 1117篇 |
2019年 | 1129篇 |
2018年 | 10440篇 |
2017年 | 11408篇 |
2016年 | 6546篇 |
2015年 | 2846篇 |
2014年 | 2613篇 |
2013年 | 7836篇 |
2012年 | 10769篇 |
2011年 | 20855篇 |
2010年 | 12446篇 |
2009年 | 12591篇 |
2008年 | 18265篇 |
2007年 | 21906篇 |
2006年 | 7215篇 |
2005年 | 13891篇 |
2004年 | 9567篇 |
2003年 | 8572篇 |
2002年 | 6410篇 |
2001年 | 6193篇 |
2000年 | 4869篇 |
1999年 | 3517篇 |
1998年 | 2674篇 |
1997年 | 2633篇 |
1996年 | 2748篇 |
1995年 | 2377篇 |
1994年 | 2250篇 |
1993年 | 2106篇 |
1992年 | 2410篇 |
1991年 | 2384篇 |
1990年 | 2095篇 |
1989年 | 2083篇 |
1988年 | 2111篇 |
1987年 | 2045篇 |
1986年 | 1949篇 |
1985年 | 2869篇 |
1984年 | 2856篇 |
1983年 | 2300篇 |
1982年 | 2478篇 |
1981年 | 2360篇 |
1980年 | 2315篇 |
1979年 | 2279篇 |
1978年 | 2359篇 |
1977年 | 2234篇 |
1976年 | 2196篇 |
1975年 | 2169篇 |
1974年 | 2072篇 |
1973年 | 2196篇 |
1972年 | 1232篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
992.
This paper deals with a computational analysis of the influence of the pressing method and part geometry on the final density
distribution in the cold compaction process of ceramic alumina powders. The analysis is based on the explicit finite-element
model proposed and validated in a previous study. The mechanical behavior of the processing material is described using a
multisurface elastoplastic model, the modified Drucker-Prager/Cap model
Published in Prikladnaya Mekhanika, Vol. 43, No. 10, pp. 129–134, October 2007. 相似文献
993.
Parameters of Gaussian multivariate models are often estimated using the maximum likelihood approach. In spite of its merits, this methodology is not practical when the sample size is very large, as, for example, in the case of massive georeferenced data sets. In this paper, we study the asymptotic properties of the estimators that minimize three alternatives to the likelihood function, designed to increase the computational efficiency. This is achieved by applying the information sandwich technique to expansions of the pseudo-likelihood functions as quadratic forms of independent normal random variables. Theoretical calculations are given for a first-order autoregressive time series and then extended to a two-dimensional autoregressive process on a lattice. We compare the efficiency of the three estimators to that of the maximum likelihood estimator as well as among themselves, using numerical calculations of the theoretical results and simulations. 相似文献
994.
S K Samanta U C Gupta R K Sharma 《The Journal of the Operational Research Society》2007,58(3):368-377
This paper investigates a discrete-time single-server finite-buffer queueing system with multiple vacations in which arrivals occur according to a discrete-time renewal process. Service and vacation times are mutually independent and geometrically distributed. We obtain steady-state system length distributions at prearrival, arbitrary and outside observer's observation epochs under the late arrival system with delayed access and early arrival system. The analysis of actual waiting-time for both the systems has also been carried out. The model has potential application in high-speed computer network, digital communication systems and other related areas. 相似文献
995.
V. Goryunov 《Proceedings of the Steklov Institute of Mathematics》2007,258(1):44-52
We establish a natural correspondence between the finite order automorphisms of the function singularities X
9 and the complex crystallographic groups. A complete list of the related objects is obtained.
To Vladimir Igorevich on the occasion of his 70th birthday 相似文献
996.
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or
integer linear program. Traditional approaches to branching variable selection rely on estimating the effect of the candidate
variables on the objective function. We present a new approach that relies on estimating the impact of the candidate variables
on the active constraints in the current LP relaxation. We apply this method to the problem of finding the first feasible
solution as quickly as possible. Empirical experiments demonstrate a significant improvement compared to a state-of-the art
commercial MIP solver. 相似文献
997.
Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP)
problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new
algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination
with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria
are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate
the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of
randomly generated problems.
Work of the authors was partially supported by FCAR, MITACS and NSERC grants. 相似文献
998.
This is a write-up on the foundation of the Sobolev Institute of Mathematics in 1957. 相似文献
999.
S. Al-Homidan 《Journal of Optimization Theory and Applications》2007,135(3):583-598
Given a data matrix, we find its nearest symmetric positive-semidefinite Toeplitz matrix. In this paper, we formulate the
problem as an optimization problem with a quadratic objective function and semidefinite constraints. In particular, instead
of solving the so-called normal equations, our algorithm eliminates the linear feasibility equations from the start to maintain
exact primal and dual feasibility during the course of the algorithm. Subsequently, the search direction is found using an
inexact Gauss-Newton method rather than a Newton method on a symmetrized system and is computed using a diagonal preconditioned
conjugate-gradient-type method. Computational results illustrate the robustness of the algorithm. 相似文献
1000.