全文获取类型
收费全文 | 6567篇 |
免费 | 553篇 |
国内免费 | 416篇 |
专业分类
化学 | 309篇 |
晶体学 | 4篇 |
力学 | 189篇 |
综合类 | 168篇 |
数学 | 6401篇 |
物理学 | 465篇 |
出版年
2024年 | 16篇 |
2023年 | 108篇 |
2022年 | 175篇 |
2021年 | 171篇 |
2020年 | 236篇 |
2019年 | 255篇 |
2018年 | 242篇 |
2017年 | 255篇 |
2016年 | 188篇 |
2015年 | 117篇 |
2014年 | 262篇 |
2013年 | 537篇 |
2012年 | 268篇 |
2011年 | 373篇 |
2010年 | 381篇 |
2009年 | 538篇 |
2008年 | 467篇 |
2007年 | 363篇 |
2006年 | 405篇 |
2005年 | 288篇 |
2004年 | 249篇 |
2003年 | 229篇 |
2002年 | 211篇 |
2001年 | 194篇 |
2000年 | 171篇 |
1999年 | 160篇 |
1998年 | 140篇 |
1997年 | 99篇 |
1996年 | 66篇 |
1995年 | 71篇 |
1994年 | 55篇 |
1993年 | 41篇 |
1992年 | 31篇 |
1991年 | 24篇 |
1990年 | 19篇 |
1989年 | 19篇 |
1988年 | 22篇 |
1987年 | 11篇 |
1986年 | 4篇 |
1985年 | 17篇 |
1984年 | 14篇 |
1983年 | 6篇 |
1982年 | 12篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1978年 | 2篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有7536条查询结果,搜索用时 15 毫秒
141.
The authors introduce a notion of a weak graph map homotopy (they call it
M-homotopy), discuss its properties and applications. They prove that the weak graph
map homotopy equivalence between graphs coincides with the graph homotopy equivalence
defined by Yau et al in 2001. The difference between them is that the weak graph map
homotopy transformation is defined in terms of maps, while the graph homotopy transformation is defined by means of combinatorial operations. They discuss its advantages over
the graph homotopy transformation. As its applications, they investigate the mapping
class group of a graph and the 1-order MP-homotopy group of a pointed simple graph.
Moreover, they show that the 1-order MP-homotopy group of a pointed simple graph is
invariant up to the weak graph map homotopy equivalence. 相似文献
142.
设$ G $ 是一个$ n $ 阶$ k $ 圈图, $ k $ 圈图为边数等于顶点数加$ k-1 $ 的简单连通图。$ \mu_{1}(G) $ 、$ \mu_{2}(G) $ 分别记为图$ G $ 的Laplace矩阵的最大特征值和次大特征值, 图$ G $ 的Laplace分离度定义为$ S_{L}(G)=\mu_{1}(G)-\mu_{2}(G) $ 。本文研究了给定阶数的$ k $ 圈图的最大Laplace分离度, 并刻画了相应的极图, 其结果推广了已有当$ k=1, 2, 3 $ 时的结论。 相似文献
143.
在不确定性环境下,当决策单元(DMU)的投入产出数据为区间数形式时,为解决决策单元之间既不是合作也不是竞争关系时的交叉评价问题,本文提出一种中立型区间交叉效率模型。从所有被评价者的角度出发解决评价权重的选取问题,以决策单元投入得分的平均偏差与产出得分的平均偏差之和最小化为目标,建立决策单元在最佳和最差两种生产状态下的中立型区间交叉效率模型。在本文提出的中立型模型视角下,DMU的投入得分平均偏差和产出得分平均偏差之和达到最小。算例结果表明该中立型区间交叉效率模型的有效性,解决了不确定性环境下的交叉评价问题,保证评价的客观公正,更加符合现实。 相似文献
144.
We introduce an impartial combinatorial game on Steiner triple systems called Next One to Fill Is the Loser (Nofil ). Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. By computing nim-values, we determine optimal strategies for Nofil on all Steiner triple systems up to order 15 and a sampling for orders 19, 21 and 25. The game Nofil can be thought of in terms of play on a corresponding hypergraph which will become a graph during play. At that point Nofil is equivalent to playing the game Node Kayles on the graph. We prove necessary conditions and sufficient conditions for a graph to reached playing Nofil. We conclude that the complexity of determining the outcome of the game Nofil on Steiner triple systems is PSPACE-complete for randomized reductions. 相似文献
145.
On bandwidth sums of graphs 总被引:1,自引:0,他引:1
ONBANDWIDTHSUMSOFGRAPHSYAOBING(姚兵);WANGJIANFANG(王建方)(DepartmentofMathematics,NorihwesteternNormalUniversity,Lanzhou730070,Chi... 相似文献
146.
Jacek R. Jachymski 《Proceedings of the American Mathematical Society》1996,124(10):3229-3233
Let be a continuous self-map of the unit interval . Equivalent conditions are given to ensure that has a common fixed point with every continuous map that commutes with on a suitable subset of . This extends a recent result of Gerald Jungck.
147.
Robert W. Baddeley 《Journal of Algebraic Combinatorics》1993,2(3):215-237
The paper addresses a part of the problem of classifying all 2-arc transitive graphs: namely, that of finding all groups acting 2-arc transitively on finite connected graphs such that there exists a minimal normal subgroup that is nonabelian and regular on vertices. A construction is given for such groups, together with the associated graphs, in terms of the following ingredients: a nonabelian simple group T, a permutation group P acting 2-transitively on a set , and a map F : Tsuch that x = x
–1 for all x
F() and such that Tis generated by F(). Conversely we show that all such groups and graphs arise in this way. Necessary and sufficient conditions are found for the construction to yield groups that are permutation equivalent in their action on the vertices of the associated graphs (which are consequently isomorphic). The different types of groups arising are discussed and various examples given. 相似文献
148.
A fundamental difficulty in theoretical physics is the dual and apparently incompatible interpretations of radiation as showing both continuous and extensive wave properties but also those of discrete atomic or smaller individual particles. Some of these contradictions are outlined. The explanation offered is of a quantized nature of time; units to=h/moc2 for a particle at rest, and of similar interval unit so when in relative motion, with conventional relativistic corrections.
For many purposes this form of quantization replaces the need for a wave concept which then appears as a mathematical approach, chosen to avoid the physical concept of an intrinsicc time for any particle, just as we have for its intrinsic mass, spin and electrical charge. to and so are directly related to its frequency, energy and mass. The uncertainty principle and interference relations follow directly from this model, without any physical wave concept. 相似文献
149.
Peter Kunstadt P. Eng Colyn Steeves Daniel Beaulieu P. Eng 《Radiation Physics and Chemistry》1993,42(1-3)
The number of products being radiation processed worldwide is constantly increasing and today includes such diverse items as medical disposables, fruits and vegetables, spices, meats, seafoods and waste products. This range of products to be processed has resulted in a wide range of irradiator designs and capital and operating cost requirements.This paper discusses the economics of low dose food irradiation applications and the effects of various parameters on unit processing costs. It provides a model for calculating specific unit processing costs by correlating known capital costs with annual operating costs and annual throughputs. It is intended to provide the reader with a general knowledge of how unit processing costs are derived. 相似文献
150.
L. I. Makarov 《Journal of Structural Chemistry》2005,46(4):738-743
Some questions emerged from electronic data processing of molecular structures (graphs) and its fragments have been considered in this work. Quantitative estimations of subgraph positions in molecular graphs are presented and some properties of their maximal common subgraphs are described. 相似文献