全文获取类型
收费全文 | 8264篇 |
免费 | 865篇 |
国内免费 | 522篇 |
专业分类
化学 | 506篇 |
晶体学 | 20篇 |
力学 | 309篇 |
综合类 | 227篇 |
数学 | 7205篇 |
物理学 | 1384篇 |
出版年
2024年 | 17篇 |
2023年 | 126篇 |
2022年 | 204篇 |
2021年 | 227篇 |
2020年 | 272篇 |
2019年 | 296篇 |
2018年 | 295篇 |
2017年 | 327篇 |
2016年 | 248篇 |
2015年 | 192篇 |
2014年 | 358篇 |
2013年 | 639篇 |
2012年 | 317篇 |
2011年 | 460篇 |
2010年 | 450篇 |
2009年 | 613篇 |
2008年 | 580篇 |
2007年 | 459篇 |
2006年 | 470篇 |
2005年 | 397篇 |
2004年 | 326篇 |
2003年 | 299篇 |
2002年 | 274篇 |
2001年 | 263篇 |
2000年 | 234篇 |
1999年 | 212篇 |
1998年 | 184篇 |
1997年 | 150篇 |
1996年 | 103篇 |
1995年 | 100篇 |
1994年 | 84篇 |
1993年 | 59篇 |
1992年 | 46篇 |
1991年 | 44篇 |
1990年 | 32篇 |
1989年 | 32篇 |
1988年 | 35篇 |
1987年 | 24篇 |
1986年 | 17篇 |
1985年 | 31篇 |
1984年 | 37篇 |
1983年 | 9篇 |
1982年 | 20篇 |
1981年 | 14篇 |
1980年 | 14篇 |
1979年 | 16篇 |
1978年 | 12篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 8篇 |
排序方式: 共有9651条查询结果,搜索用时 15 毫秒
51.
本文通过研究匹配问题的实例空间,匈牙利算法和解空间三者之间的关系,指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。 相似文献
52.
For a graph G and a positive integer m, G(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m2 edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G(2) does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G(2) does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003 相似文献
53.
工程施工中运输网络优化方案 总被引:5,自引:0,他引:5
施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 . 相似文献
54.
汪更生 《数学物理学报(B辑英文版)》2005,25(1):7-22
This paper deals with maximum principle for some optimal control problem governed by some elliptic variational inequalities. Some state constraints are discussed. The basic techniques used here are based on those in [1] and a new penalty functional defined in this paper. 相似文献
55.
Yao Ping HOU 《数学学报(英文版)》2005,21(4):955-960
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated. 相似文献
56.
For given a graph H, a graphic sequence π = (d
1, d
2,..., d
n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K
5 − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to
be potentially K
5-graphic, where K
r is a complete graph on r vertices and K
r-e is a graph obtained from K
r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence
π to be potentially K
6-graphic.
Project supported by National Natural Science Foundation of China (No. 10401010). 相似文献
57.
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon. 相似文献
58.
全固态多波长飞秒脉冲激光系统 总被引:1,自引:1,他引:0
利用棱镜对引进频谱空间啁啾来补偿飞秒脉冲激光二次谐波产生中的相位失配,提高了倍频效率建立了一套全固态、多波长(1065nm, 532nm,823.1nm, 402nm)飞秒脉冲激光系统自制的Nd:YVO4激光器输出532nm绿光激光,最高平均功率可达5.6W当用2.5W绿光激光泵浦时,从自制的钛宝石激光器及经BBO倍频可分别输出中心波长为823.1nm和402nm,平均功率300mW和73mW,谱宽32.3nm和5.1nm,脉宽22fs和33.3fs、重复率108MHz的近红外和蓝光激光整个系统具有结构紧凑、倍频效率高、运行稳定的特点. 相似文献
59.
How to choose an optimal threshold is a key problemin the generalized Pareto distribution (GPD) model.This paper attains the exactthreshold by testing for GPD,and shows that GPD model allows the actuary to easily estimate high quantiles and the probable maximum loss from the medical insurance claims data. 相似文献
60.
We consider a Bolza optimal control problem with state constraints. It is well known that under some technical assumptions every strong local minimizer of this problem satisfies first order necessary optimality conditions in the form of a constrained maximum principle. In general, the maximum principle may be abnormal or even degenerate and so does not provide a sufficient information about optimal controls. In the recent literature some sufficient conditions were proposed to guarantee that at least one maximum principle is nondegenerate, cf. [A.V. Arutyanov, S.M. Aseev, Investigation of the degeneracy phenomenon of the maximum principle for optimal control problems with state constraints, SIAM J. Control Optim. 35 (1997) 930–952; F. Rampazzo, R.B. Vinter, A theorem on existence of neighbouring trajectories satisfying a state constraint, with applications to optimal control, IMA 16 (4) (1999) 335–351; F. Rampazzo, R.B. Vinter, Degenerate optimal control problems with state constraints, SIAM J. Control Optim. 39 (4) (2000) 989–1007]. Our aim is to show that actually conditions of a similar nature guarantee normality of every nondegenerate maximum principle. In particular we allow the initial condition to be fixed and the state constraints to be nonsmooth. To prove normality we use J. Yorke type linearization of control systems and show the existence of a solution to a linearized control system satisfying new state constraints defined, in turn, by linearization of the original set of constraints along an extremal trajectory. 相似文献