全文获取类型
收费全文 | 7319篇 |
免费 | 423篇 |
国内免费 | 596篇 |
专业分类
化学 | 2005篇 |
晶体学 | 76篇 |
力学 | 99篇 |
综合类 | 107篇 |
数学 | 4939篇 |
物理学 | 1112篇 |
出版年
2023年 | 61篇 |
2022年 | 127篇 |
2021年 | 163篇 |
2020年 | 145篇 |
2019年 | 241篇 |
2018年 | 258篇 |
2017年 | 183篇 |
2016年 | 206篇 |
2015年 | 144篇 |
2014年 | 296篇 |
2013年 | 590篇 |
2012年 | 287篇 |
2011年 | 386篇 |
2010年 | 325篇 |
2009年 | 425篇 |
2008年 | 478篇 |
2007年 | 496篇 |
2006年 | 445篇 |
2005年 | 366篇 |
2004年 | 327篇 |
2003年 | 293篇 |
2002年 | 268篇 |
2001年 | 179篇 |
2000年 | 183篇 |
1999年 | 185篇 |
1998年 | 187篇 |
1997年 | 115篇 |
1996年 | 162篇 |
1995年 | 130篇 |
1994年 | 107篇 |
1993年 | 95篇 |
1992年 | 77篇 |
1991年 | 58篇 |
1990年 | 24篇 |
1989年 | 42篇 |
1988年 | 31篇 |
1987年 | 23篇 |
1986年 | 13篇 |
1985年 | 43篇 |
1984年 | 25篇 |
1983年 | 12篇 |
1982年 | 16篇 |
1981年 | 15篇 |
1980年 | 20篇 |
1979年 | 15篇 |
1978年 | 14篇 |
1977年 | 13篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1973年 | 12篇 |
排序方式: 共有8338条查询结果,搜索用时 62 毫秒
61.
We study the possibility of defining the (braided) comultiplication for the GL
q
(N)-covariant differential complexes on some quantum spaces. We discover suchdifferential bialgebras (and Hopf algebras) on the bosonic and fermionic quantum hyperplanes (with additive coproduct) and on the braided matrix algebra BM
q
(N) with both multiplicative and additive coproducts. The latter case is related (forN = 2) to theq-Minkowski space andq-Poincaré algebra. 相似文献
62.
Bai-suo JIN~ 《中国科学A辑(英文版)》2007,50(9):1303-1315
In the factor analysis model with large cross-section and time-series dimensions,we pro- pose a new method to estimate the number of factors.Specially if the idiosyncratic terms satisfy a linear time series model,the estimators of the parameters can be obtained in the time series model. The theoretical properties of the estimators are also explored.A simulation study and an empirical analysis are conducted. 相似文献
63.
Zhongxue Lü 《Journal of Mathematical Analysis and Applications》2007,326(2):1452-1457
Some new generalizations of the Hilbert integral inequality by introducing real functions ?(x) and ψ(x). The results of this paper reduce to those of the corresponding inequalities proved by Gao [Mingzhe Gao, On Hilbert's integral inequality, Math. Appl. 11 (3) (1998) 32-35]. Some applications are considered. 相似文献
64.
技术的动态发展和企业间的竞争对企业新产品策略有很大影响,直接决定新产品的引进周期。本文在产业技术动态变化的随机环境下构建随机动态规划模型,关注产业技术进步、投资成本和产品市场竞争等影响因素,探讨企业进行新产品引进的周期选择,对新产品引进的周期和质量决策进行方法设计和应用举例。利用随机动态规划模型得出新产品引进的最优时间周期,用算例分析技术进步和产品研发成本对企业引进周期策略的影响,采取策略迭代的方法进行求解,发现技术进步较快时企业的新产品引进步伐也较快,研发成本的提高使企业的新产品引入步伐降低。 相似文献
65.
Hong-Ming Yin 《NoDEA : Nonlinear Differential Equations and Applications》2007,13(5-6):735-757
In this paper we study a phase-change problem arising from induction heating. The mathematical model consists of time-harmonic
Maxwell’s system in a quasi-stationary field coupled with nonlinear heat conduction. The enthalpy form is used to characterize
the phase-change in the material. It is shown that the problem has a global solution. Moreover, it is shown that the solution
is unique and regular in one-space dimension even with an unbounded resistivity.
This work is supported in part by a NSF grant: DMS-0102261 相似文献
66.
The paper addresses bivariate surface fitting problems, where data points lie on the vertices of a rectangular grid. Efficient
and stable algorithms can be found in the literature to solve such problems. If data values are missing at some grid points,
there exists a computational method for finding a least squares spline by fixing appropriate values for the missing data.
We extended this technique to arbitrary least squares problems as well as to linear least squares problems with linear equality
constraints. Numerical examples are given to show the effectiveness of the technique presented.
AMS subject classification (2000) 65D05, 65D07, 65D10, 65F05, 65F20 相似文献
67.
在研究排队网络的文献中,G-网络(即推广的排队网络)最近受到了国际学者广泛的关注,它的研究在一定程度上丰富了排队网络的内容.正因为有很多学者投入到此项研究中,新的结果是层出不穷的.本文简短地介绍G-网络近年来的发展. 相似文献
68.
This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R0-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically. 相似文献
69.
70.
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2. 相似文献