全文获取类型
收费全文 | 452篇 |
免费 | 31篇 |
国内免费 | 67篇 |
专业分类
化学 | 74篇 |
力学 | 17篇 |
综合类 | 5篇 |
数学 | 384篇 |
物理学 | 70篇 |
出版年
2023年 | 4篇 |
2022年 | 11篇 |
2021年 | 7篇 |
2020年 | 20篇 |
2019年 | 14篇 |
2018年 | 16篇 |
2017年 | 12篇 |
2016年 | 10篇 |
2015年 | 13篇 |
2014年 | 10篇 |
2013年 | 42篇 |
2012年 | 19篇 |
2011年 | 23篇 |
2010年 | 15篇 |
2009年 | 20篇 |
2008年 | 44篇 |
2007年 | 27篇 |
2006年 | 36篇 |
2005年 | 20篇 |
2004年 | 19篇 |
2003年 | 22篇 |
2002年 | 29篇 |
2001年 | 17篇 |
2000年 | 22篇 |
1999年 | 13篇 |
1998年 | 20篇 |
1997年 | 11篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1982年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有550条查询结果,搜索用时 15 毫秒
1.
Rikard Bøgvad 《代数通讯》2018,46(6):2476-2487
2.
It is easy to see that in a connected graph any longest paths have a vertex in common. For , Skupień in 1966 obtained a connected graph in which some longest paths have no common vertex, but every longest paths have a common vertex. It is not known whether every longest paths in a connected graph have a common vertex and similarly for 4, 5, and longest path. Fujita et al. in 2015 give an upper bound on distance among longest paths in a connected graph. In this paper we give a similar upper bound on distance between longest paths and also for longest paths, in general. 相似文献
3.
Cheng and Tang [Biometrika, 88 (2001), pp. 1169–1174] derived an upper bound on the maximum number of columns that can be accommodated in a two‐symbol supersaturated design (SSD) for a given number of rows () and a maximum in absolute value correlation between any two columns (). In particular, they proved that for (mod ) and . However, the only known SSD satisfying this upper bound is when . By utilizing a computer search, we prove that for , and . These results are obtained by proving the nonexistence of certain resolvable incomplete blocks designs. The combinatorial properties of the RIBDs are used to reduce the search space. Our results improve the lower bound for SSDs with rows and columns, for , and . Finally, we show that a skew‐type Hadamard matrix of order can be used to construct an SSD with rows and columns that proves . Hence, we establish for and for all (mod ) such that . Our result also implies that when is a prime power and (mod ). We conjecture that for all and (mod ), where is the maximum number of equiangular lines in with pairwise angle . 相似文献
4.
The Cayley-Bacharach Property (CBP), which has been classically stated as a property of a finite set of points in an affine or projective space, is extended to arbitrary 0-dimensional affine algebras over arbitrary base fields. We present characterizations and explicit algorithms for checking the CBP directly, via the canonical module, and in combination with the property of being a locally Gorenstein ring. Moreover, we characterize strict Gorenstein rings by the CBP and the symmetry of their affine Hilbert function, as well as by the strict CBP and the last difference of their affine Hilbert function. 相似文献
5.
6.
7.
Chemical groups are known to tune the luminescent efficiencies of graphene-related nanomaterials, but some species, including the epoxide group (−COC−), are suspected to act as emission-quenching sites. Herein, by performing nonadiabatic excited-state dynamics simulations, we reveal a fast (within 300 fs) nonradiative excited-state decay of a graphene epoxide nanostructure from the lowest excited singlet (S1) state to the ground (S0) state via a conical intersection (CI), at which the energy difference between the S1 and S0 states is approximately zero. This CI is induced after breaking one C−O bond at the −COC− moiety during excited-state structural relaxation. This study ascertains the role of epoxide groups in inducing the nonradiative recombination of the excited electron-hole, providing important insights into the CI-promoted nonradiative de-excitations and the luminescence tuning of relevant materials. In addition, it shows the feasibility of utilizing nonadiabatic excited-state dynamics simulations to investigate the photophysical processes of the excited states of graphene nanomaterials. 相似文献
8.
We detail the enumeration of all two‐intersection sets of the five‐dimensional projective space over the field of order 3 that are invariant under an element of order 7, which include the examples of Hill (1973) and Gulliver (1996). Up to projective equivalence, there are 6,635 such two‐intersection sets. 相似文献
9.
《组合设计杂志》2018,26(7):344-355
We derive a previously unknown lower bound of 41 for the frequency of of an E(s2)‐optimal and minimax‐optimal supersaturated design (SSD) with 20 rows and 76 columns. This is accomplished by an exhaustive computer search that uses the combinatorial properties of resolvable 2 − (20, 10, 36) designs and the parallel class intersection pattern method. We also classify all nonisomorphic E(s2)‐optimal 4‐circulant SSDs with 20 rows and . 相似文献
10.
本文研究在下临界维数情形下Wiener sausage 的相交时间, 应用新近提出的高阶矩方法和经典的Feynman-Kac 半群方法, 得到该情况下Wiener sausage 相交时间的中偏差. 相似文献