全文获取类型
收费全文 | 2538篇 |
免费 | 299篇 |
国内免费 | 127篇 |
专业分类
化学 | 370篇 |
晶体学 | 18篇 |
力学 | 164篇 |
综合类 | 58篇 |
数学 | 1402篇 |
物理学 | 952篇 |
出版年
2024年 | 1篇 |
2023年 | 36篇 |
2022年 | 59篇 |
2021年 | 54篇 |
2020年 | 55篇 |
2019年 | 62篇 |
2018年 | 67篇 |
2017年 | 100篇 |
2016年 | 111篇 |
2015年 | 79篇 |
2014年 | 178篇 |
2013年 | 185篇 |
2012年 | 103篇 |
2011年 | 177篇 |
2010年 | 137篇 |
2009年 | 186篇 |
2008年 | 177篇 |
2007年 | 187篇 |
2006年 | 146篇 |
2005年 | 143篇 |
2004年 | 102篇 |
2003年 | 89篇 |
2002年 | 68篇 |
2001年 | 68篇 |
2000年 | 55篇 |
1999年 | 58篇 |
1998年 | 46篇 |
1997年 | 35篇 |
1996年 | 45篇 |
1995年 | 30篇 |
1994年 | 21篇 |
1993年 | 18篇 |
1992年 | 13篇 |
1991年 | 13篇 |
1990年 | 7篇 |
1989年 | 5篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 14篇 |
1983年 | 1篇 |
1982年 | 5篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有2964条查询结果,搜索用时 15 毫秒
51.
《Discrete Mathematics》2023,346(4):113304
In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size ? In this note, we improve upon a recent result of Frankl and resolve this problem for and . 相似文献
52.
鉴于当前学生化学意志素质缺乏的问题,探讨以认知、情绪唤醒、情感、意志为主控目标,在预习、尝试学习、交错搭配合作学习中,开展CAFP教学研究,以促成情意因素对认知的调动、动力、强化等功能。 相似文献
53.
The influences of steady aerodynamic loads on hunting stability of high-speed railway vehicles were investigated in this study.A mechanism is suggested to explain the change of hunting behavior due to actions of aerodynamic loads:the aerodynamic loads can change the position of vehicle system(consequently the contact relations),the wheel/rail normal contact forces,the gravitational restoring forces/moments and the creep forces/moments.A mathematical model for hunting stability incorporating such influences was developed.A computer program capable of incorporating the effects of aerodynamic loads based on the model was written,and the critical speeds were calculated using this program.The dependences of linear and nonlinear critical speeds on suspension parameters considering aerodynamic loads were analyzed by using the orthogonal test method,the results were also compared with the situations without aerodynamic loads.It is shown that the most dominant factors a ff ecting linear and nonlinear critical speeds are different whether the aerodynamic loads considered or not.The damping of yaw damper is the most dominant influencing factor for linear critical speeds,while the damping of lateral damper is most dominant for nonlinear ones.When the influences of aerodynamic loads are considered,the linear critical speeds decrease with the rise of cross wind velocity,whereas it is not the case for the nonlinear critical speeds.The variation trends of critical speeds with suspension parameters can be significantly changed by aerodynamic loads.Combined actions of aerodynamic loads and suspension parameters also a ff ect the critical speeds.The effects of such joint action are more obvious for nonlinear critical speeds. 相似文献
54.
55.
Sehie Park 《Numerical Functional Analysis & Optimization》2013,34(1-2):101-110
In this paper we use fixed point and coincidence theorems due to Park [8] to give matching theorems concerning closed coverings of nonempty convex sets in a real topological vector space. Our new results extend previously given ones due to Ky Fan [2], [3], Shih [10], Shih and Tan [11], and Park [7]. 相似文献
56.
Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way. 相似文献
57.
Ajit A. Diwan 《Discrete Mathematics》2019,342(4):1060-1062
Let be a perfect matching in a graph. A subset of is said to be a forcing set of , if is the only perfect matching in the graph that contains . The minimum size of a forcing set of is called the forcing number of . Pachter and Kim (1998) conjectured that the forcing number of every perfect matching in the -dimensional hypercube is , for all . This was revised by Riddle (2002), who conjectured that it is at least , and proved it for all even . We show that the revised conjecture holds for all . The proof is based on simple linear algebra. 相似文献
58.
Kreweras conjectured that every perfect matching of a hypercube for can be extended to a hamiltonian cycle of . Fink confirmed the conjecture to be true. It is more general to ask whether every perfect matching of for can be extended to two or more hamiltonian cycles of . In this paper, we prove that every perfect matching of for can be extended to at least different hamiltonian cycles of . 相似文献
59.
A graph with at least vertices is said to be distance -extendable if, for any matching of with edges in which the edges lie at distance at least pairwise, there exists a perfect matching of containing . In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 -extendable for any . 相似文献
60.