全文获取类型
收费全文 | 5845篇 |
免费 | 409篇 |
国内免费 | 582篇 |
专业分类
化学 | 486篇 |
晶体学 | 11篇 |
力学 | 326篇 |
综合类 | 124篇 |
数学 | 5405篇 |
物理学 | 484篇 |
出版年
2024年 | 6篇 |
2023年 | 72篇 |
2022年 | 80篇 |
2021年 | 117篇 |
2020年 | 125篇 |
2019年 | 127篇 |
2018年 | 148篇 |
2017年 | 138篇 |
2016年 | 144篇 |
2015年 | 119篇 |
2014年 | 229篇 |
2013年 | 424篇 |
2012年 | 261篇 |
2011年 | 339篇 |
2010年 | 308篇 |
2009年 | 412篇 |
2008年 | 402篇 |
2007年 | 362篇 |
2006年 | 377篇 |
2005年 | 297篇 |
2004年 | 252篇 |
2003年 | 296篇 |
2002年 | 253篇 |
2001年 | 227篇 |
2000年 | 194篇 |
1999年 | 187篇 |
1998年 | 194篇 |
1997年 | 167篇 |
1996年 | 103篇 |
1995年 | 76篇 |
1994年 | 65篇 |
1993年 | 52篇 |
1992年 | 38篇 |
1991年 | 27篇 |
1990年 | 24篇 |
1989年 | 13篇 |
1988年 | 13篇 |
1987年 | 12篇 |
1986年 | 10篇 |
1985年 | 26篇 |
1984年 | 22篇 |
1983年 | 14篇 |
1982年 | 21篇 |
1981年 | 17篇 |
1980年 | 18篇 |
1979年 | 5篇 |
1978年 | 9篇 |
1977年 | 3篇 |
1976年 | 5篇 |
1974年 | 3篇 |
排序方式: 共有6836条查询结果,搜索用时 31 毫秒
1.
2.
Tomasz Przebinda 《Journal of Functional Analysis》2018,274(5):1284-1305
We relate the distribution characters and the wave front sets of unitary representation for real reductive dual pairs of type I in the stable range. 相似文献
3.
Given an ‐vertex pseudorandom graph and an ‐vertex graph with maximum degree at most two, we wish to find a copy of in , that is, an embedding so that for all . Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in . Here, we provide a deterministic polynomial time algorithm that finds a given in any suitably pseudorandom graph . The pseudorandom graphs we consider are ‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, . A ‐bijumbled graph is characterised through the discrepancy property: for any two sets of vertices and . Our condition on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications. 相似文献
4.
《Discrete Mathematics》2021,344(12):112589
Let be the set of positive integers. For a nonempty set A of integers and every integer u, denote by the number of with such that . For a sequence S of positive integers, let be the counting function of S. The set is called a perfect difference set if for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let be an increasing function satisfying for any positive integer n, then for every Sidon set B and every function , there exists a set such that for every positive integer u and for all . 相似文献
5.
AbstractRealistic stochastic modeling is increasingly requiring the use of bounded noises. In this work, properties and relationships of commonly employed bounded stochastic processes are investigated within a solid mathematical ground. Four families are object of investigation: the Sine-Wiener (SW), the Doering–Cai–Lin (DCL), the Tsallis–Stariolo–Borland (TSB), and the Kessler–Sørensen (KS) families. We address mathematical questions on existence and uniqueness of the processes defined through Stochastic Differential Equations, which often conceal non-obvious behavior, and we explore the behavior of the solutions near the boundaries of the state space. The expression of the time-dependent probability density of the Sine-Wiener noise is provided in closed form, and a close connection with the Doering–Cai–Lin noise is shown. Further relationships among the different families are explored, pathwise and in distribution. Finally, we illustrate an analogy between the Kessler–Sørensen family and Bessel processes, which allows to relate the respective local times at the boundaries. 相似文献
6.
数据包络分析(DEA)是评价供应链系统(Supply chain system)间相对有效性的一种重要的工具,但是传统的DEA不考虑供应链的内部结构,对系统效率评价偏高;而本文所研究两阶段串联供应链系统,考虑把部分中间产品作为最终产品输出,增加额外中间投入的情形.基于所提出的供应链系统结构,本文建立相应的串联结构下的网络DEA模型,并针对所建立模型进行相关理论的研究,给出了串联结构下的生产可能集和规模收益情况判定方法.最后,进行数值实验,以验证我们提出的结论. 相似文献
7.
Multivariate curve resolution methods, frequently used in analyzing bilinear data sets, result in ambiguous decomposition in general. Implementing the adequate constraints may lead to reduce the so-called rotational ambiguity drastically, and in the most favorable cases to the unique solution. However, in some special cases, non-negativity constraint as minimal information of the system is a sufficient condition to resolve profiles uniquely. Although, several studies on exploring the uniqueness of the bilinear non-negatively constrained multivariate curve resolution methods have been made in the literature, it has still remained a mysterious question. In 1995, Manne published his profile-based theorems giving the necessary and sufficient conditions of the unique resolution. In this study, a new term, i.e., data-based uniqueness is defined and investigated in details, and a general procedure is suggested for detection of uniquely recovered profile(s) on the basis of data set structure in the abstract space. Close inspection of Borgen plots of these data sets leads to realize the comprehensive information of local rank, and these argumentations furnish a basis for data-based uniqueness theorem. The reported phenomenon and its exploration is a new stage (it can be said fundament) in understanding and describing the bilinear (matrix-type) chemical data in general. 相似文献
8.
9.
Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained. 相似文献
10.
设 $\varphi$ 是单位园盘 $D$ 到自身的解析映射, $X$ 是 $D$ 上解析函数的 Banach 空间, 对 $f\in X$, 定义复合算子$C_\varphi $ : $C_\varphi (f)=f\circ \varphi$. 我们利用从 ${\cal B}^0$到 $E(p,q)$ 和 $E_0(p,q)$ 空间的复合算子研究了空间 $E(p,q)$ 和 $E_0(p,q)$, 给出了一个新的特征. 相似文献