全文获取类型
收费全文 | 31732篇 |
免费 | 2292篇 |
国内免费 | 1761篇 |
专业分类
化学 | 15909篇 |
晶体学 | 121篇 |
力学 | 411篇 |
综合类 | 191篇 |
数学 | 11511篇 |
物理学 | 7642篇 |
出版年
2023年 | 297篇 |
2022年 | 475篇 |
2021年 | 1064篇 |
2020年 | 851篇 |
2019年 | 927篇 |
2018年 | 666篇 |
2017年 | 671篇 |
2016年 | 743篇 |
2015年 | 807篇 |
2014年 | 1104篇 |
2013年 | 2210篇 |
2012年 | 1346篇 |
2011年 | 1595篇 |
2010年 | 1503篇 |
2009年 | 2066篇 |
2008年 | 2063篇 |
2007年 | 2159篇 |
2006年 | 1692篇 |
2005年 | 960篇 |
2004年 | 847篇 |
2003年 | 996篇 |
2002年 | 992篇 |
2001年 | 968篇 |
2000年 | 644篇 |
1999年 | 523篇 |
1998年 | 516篇 |
1997年 | 372篇 |
1996年 | 435篇 |
1995年 | 400篇 |
1994年 | 402篇 |
1993年 | 421篇 |
1992年 | 364篇 |
1991年 | 215篇 |
1990年 | 167篇 |
1989年 | 140篇 |
1988年 | 160篇 |
1987年 | 189篇 |
1986年 | 198篇 |
1985年 | 317篇 |
1984年 | 233篇 |
1983年 | 140篇 |
1982年 | 288篇 |
1981年 | 465篇 |
1980年 | 424篇 |
1979年 | 463篇 |
1978年 | 368篇 |
1977年 | 279篇 |
1976年 | 237篇 |
1974年 | 76篇 |
1973年 | 149篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
2.
《Discrete Mathematics》2022,345(12):113083
Let G be a graph, the order of G, the connectivity of G and k a positive integer such that . Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets and is defined to be Hamiltonian-laceable if such that and for every pair of vertices and , there exists a Hamiltonian path in G with endpoints p and q, or and for every pair of vertices , there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition . Define to be a maximum integer such that and (1) for each non-empty subset S of X, if , then , and if , then ; and (2) for each non-empty subset S of Y, if , then , and if , then ; and (3) if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition such that and . In this paper, we show that if , then G is Hamiltonian-laceable; or if , then for every pair of vertices and , there is an -path P in G with . We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs. 相似文献
3.
4.
5.
6.
Given a graph sequence denote by T3(Gn) the number of monochromatic triangles in a uniformly random coloring of the vertices of Gn with colors. In this paper we prove a central limit theorem (CLT) for T3(Gn) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T3(Gn), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7]. 相似文献
7.
8.
9.
Dariusz Marek Adam Domaski Joanna Domaska Jakub Szygua Tadeusz Czachrski Jerzy Klamka 《Entropy (Basel, Switzerland)》2021,23(5)
In this article, a way to employ the diffusion approximation to model interplay between TCP and UDP flows is presented. In order to control traffic congestion, an environment of IP routers applying AQM (Active Queue Management) algorithms has been introduced. Furthermore, the impact of the fractional controller and its parameters on the transport protocols is investigated. The controller has been elaborated in accordance with the control theory. The TCP and UDP flows are transmitted simultaneously and are mutually independent. Only the TCP is controlled by the AQM algorithm. Our diffusion model allows a single TCP or UDP flow to start or end at any time, which distinguishes it from those previously described in the literature. 相似文献
10.