全文获取类型
收费全文 | 9906篇 |
免费 | 1022篇 |
国内免费 | 735篇 |
专业分类
化学 | 718篇 |
晶体学 | 15篇 |
力学 | 877篇 |
综合类 | 244篇 |
数学 | 7298篇 |
物理学 | 2511篇 |
出版年
2024年 | 13篇 |
2023年 | 84篇 |
2022年 | 82篇 |
2021年 | 178篇 |
2020年 | 256篇 |
2019年 | 245篇 |
2018年 | 232篇 |
2017年 | 287篇 |
2016年 | 319篇 |
2015年 | 243篇 |
2014年 | 432篇 |
2013年 | 740篇 |
2012年 | 435篇 |
2011年 | 449篇 |
2010年 | 402篇 |
2009年 | 529篇 |
2008年 | 620篇 |
2007年 | 651篇 |
2006年 | 611篇 |
2005年 | 495篇 |
2004年 | 422篇 |
2003年 | 470篇 |
2002年 | 455篇 |
2001年 | 421篇 |
2000年 | 393篇 |
1999年 | 317篇 |
1998年 | 277篇 |
1997年 | 220篇 |
1996年 | 197篇 |
1995年 | 115篇 |
1994年 | 130篇 |
1993年 | 93篇 |
1992年 | 94篇 |
1991年 | 90篇 |
1990年 | 77篇 |
1989年 | 63篇 |
1988年 | 65篇 |
1987年 | 52篇 |
1986年 | 37篇 |
1985年 | 59篇 |
1984年 | 65篇 |
1983年 | 35篇 |
1982年 | 35篇 |
1981年 | 38篇 |
1980年 | 21篇 |
1979年 | 20篇 |
1978年 | 20篇 |
1977年 | 15篇 |
1976年 | 20篇 |
1975年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
Immanuel Albrecht 《Discrete Mathematics》2021,344(1):112157
We show that every gammoid has special digraph representations, such that a representation of the dual of the gammoid may be easily obtained by reversing all arcs. In an informal sense, the duality notion of a poset applied to the digraph of a special representation of a gammoid commutes with the operation of forming the dual of that gammoid. We use these special representations in order to define a complexity measure for gammoids, such that the classes of gammoids with bounded complexity are closed under duality, minors, and direct sums. 相似文献
2.
3.
4.
5.
本文给出对数K-Carleson测度的一个新特征,并以此为工具研究QK空间的乘子代数M(QK),给出乘子代数M(QK)的某些特征描述.利用对数K-Carleson测度及QK空间的一个新特征,建立乘子代数M(QK)上的Corona定理和Wolff定理. 相似文献
6.
7.
Mossel and Ross raised the question of when a random coloring of a graph can be reconstructed from local information, namely, the colorings (with multiplicity) of balls of given radius. In this article, we are concerned with random 2-colorings of the vertices of the -dimensional hypercube, or equivalently random Boolean functions. In the worst case, balls of diameter are required to reconstruct. However, the situation for random colorings is dramatically different: we show that almost every 2-coloring can be reconstructed from the multiset of colorings of balls of radius 2. Furthermore, we show that for , almost every -coloring can be reconstructed from the multiset of colorings of 1-balls. 相似文献
8.
This paper presents a new sensitivity analysis method for coupled acoustic–structural systems subjected to non-stationary random excitations. The integral of the response power spectrum density (PSD) of the coupled system is taken as the objective function. The thickness of each structural element is used as a design variable. A time-domain algorithm integrating the pseudo excitation method (PEM), direct differentiation method (DDM) and high precision direct (HPD) integration method is proposed for the sensitivity analysis of the objective function with respect to design variables. Firstly, the PEM is adopted to transform the sensitivity analysis under non-stationary random excitations into the sensitivity analysis under pseudo transient excitations. Then, the sensitivity analysis equation of the coupled system under pseudo transient excitations is derived based on the DDM. Moreover, the HPD integration method is used to efficiently solve the sensitivity analysis equation under pseudo transient excitations in a reduced-order modal space. Numerical examples are presented to demonstrate the validity of the proposed method. 相似文献
9.
Mihyun Kang Michael Moßhammer Philipp Sprüssel 《Random Structures and Algorithms》2020,56(4):1117-1170
Let be the orientable surface of genus and denote by the class of all graphs on vertex set with edges embeddable on . We prove that the component structure of a graph chosen uniformly at random from features two phase transitions. The first phase transition mirrors the classical phase transition in the Erd?s‐Rényi random graph chosen uniformly at random from all graphs with vertex set and edges. It takes place at , when the giant component emerges. The second phase transition occurs at , when the giant component covers almost all vertices of the graph. This kind of phenomenon is strikingly different from and has only been observed for graphs on surfaces. 相似文献
10.
We study a model of random graph where vertices are n i.i.d. uniform random points on the unit sphere Sd in , and a pair of vertices is connected if the Euclidean distance between them is at least 2??. We are interested in the chromatic number of this graph as n tends to infinity. It is not too hard to see that if ?>0 is small and fixed, then the chromatic number is d+2 with high probability. We show that this holds even if ?→0 slowly enough. We quantify the rate at which ? can tend to zero and still have the same chromatic number. The proof depends on combining topological methods (namely the Lyusternik–Schnirelman–Borsuk theorem) with geometric probability arguments. The rate we obtain is best possible, up to a constant factor—if ?→0 faster than this, we show that the graph is (d+1)‐colorable with high probability.25 相似文献