全文获取类型
收费全文 | 693篇 |
免费 | 35篇 |
国内免费 | 37篇 |
专业分类
化学 | 36篇 |
力学 | 3篇 |
综合类 | 9篇 |
数学 | 563篇 |
物理学 | 154篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 9篇 |
2021年 | 11篇 |
2020年 | 23篇 |
2019年 | 25篇 |
2018年 | 23篇 |
2017年 | 14篇 |
2016年 | 20篇 |
2015年 | 16篇 |
2014年 | 25篇 |
2013年 | 52篇 |
2012年 | 22篇 |
2011年 | 24篇 |
2010年 | 29篇 |
2009年 | 61篇 |
2008年 | 62篇 |
2007年 | 69篇 |
2006年 | 51篇 |
2005年 | 26篇 |
2004年 | 21篇 |
2003年 | 27篇 |
2002年 | 30篇 |
2001年 | 18篇 |
2000年 | 17篇 |
1999年 | 8篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 2篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 10篇 |
1991年 | 4篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有765条查询结果,搜索用时 31 毫秒
1.
给定2个图G 1 ![]()
![]()
和G 2 ![]()
![]()
,设G 1 ![]()
![]()
的边集E ( G 1 ) = { e 1 , e 2 , ? , e m 1 } ![]()
![]()
,则图G 1 ⊙ G 2 ![]()
![]()
可由一个G 1 ![]()
![]()
,m 1 ![]()
![]()
个G 2 ![]()
![]()
通过在G 1 ![]()
![]()
对应的每条边外加一个孤立点,新增加的点记为U = { u 1 , u 2 , ? , u m 1 } ![]()
![]()
,将u i ![]()
![]()
分别与第i ![]()
![]()
个G 2 ![]()
![]()
的所有点以及G 1 ![]()
![]()
中的边e i ![]()
![]()
的端点相连得到,其中i = ? 1,2 , ? , m 1 ![]()
![]()
。得到:(i)当G 1 ![]()
![]()
是正则图,G 2 ![]()
![]()
是正则图或完全二部图时,确定了G 1 ⊙ G 2 ![]()
![]()
的邻接谱(A -谱)。(ii)当G 1 ![]()
![]()
是正则图,G 2 ![]()
![]()
是任意图时,给出了G 1 ⊙ G 2 ![]()
![]()
的拉普拉斯谱(L -谱)。(iii)当G 1 ![]()
![]()
和G 2 ![]()
![]()
都是正则图时,给出了G 1 ⊙ G 2 ![]()
![]()
的无符号拉普拉斯谱(Q -谱)。作为以上结论的应用,构建了无限多对A -同谱图、L -同谱图和Q -同谱图;同时当G 1 ![]()
![]()
是正则图时,确定了G 1 ⊙ G 2 ![]()
![]()
支撑树的数量和Kirchhoff指数。 相似文献
2.
João Marcos G. Barbosa Milenna K. Fernandes Rodrigues Lurian C. David Taynara C. e Silva Danielly A. Fortuna Lima Naiara Z. Pereira Emmanuel B. D'Alessandro Anselmo E. de Oliveira Paulo H. Jorge da Cunha Maria Clorinda S. Fioravanti Nelson R. Antoniosi Filho 《Biomedical chromatography : BMC》2020,34(11):e4935
An innovative volatolomic approach employs the detection of biomarkers present in cerumen (earwax) to identify cattle intoxication by Stryphnodendron rotundifolium Mart., Fabaceae (popularly known as barbatimão). S. rotundifolium is a poisonous plant with the toxic compound undefined and widely distributed throughout the Brazilian territory. Cerumen samples from cattle of two local Brazilian breeds (‘Curraleiro Pé-Duro’ and ‘Pantaneiro’) were collected during an experimental intoxication protocol and analyzed using headspace (HS)/GC–MS followed by multivariate analysis (genetic algorithm for a partial least squares, cluster analysis, and classification and regression trees). A total of 106 volatile organic metabolites were identified in the cerumen samples of bovines. The intoxication by S. rotundifolium influenced the cerumen volatolomic profile of the bovines throughout the intoxication protocol. In this way, it was possible to detect biomarkers for cattle intoxication. Among the biomarkers, 2-octyldecanol and 9-tetradecen-1-ol were able to discriminate all samples between intoxicated and nonintoxicated bovines. The cattle intoxication diagnosis by S. rotundifolium was accomplished by applying the cerumen analysis using HS/GC–MS, in an easy, accurate, and noninvasive way. Thus, the proposed bioanalytical chromatography protocol is a useful tool in veterinary applications to determine this kind of intoxication. 相似文献
3.
4.
5.
6.
7.
To understand how proteins function on a cellular level, it is of paramount importance to understand their structures and dynamics, including the conformational changes they undergo to carry out their function. For the aforementioned reasons, the study of large conformational changes in proteins has been an interest to researchers for years. However, since some proteins experience rapid and transient conformational changes, it is hard to experimentally capture the intermediate structures. Additionally, computational brute force methods are computationally intractable, which makes it impossible to find these pathways which require a search in a high-dimensional, complex space. In our previous work, we implemented a hybrid algorithm that combines Monte-Carlo (MC) sampling and RRT*, a version of the Rapidly Exploring Random Trees (RRT) robotics-based method, to make the conformational exploration more accurate and efficient, and produce smooth conformational pathways. In this work, we integrated the rigidity analysis of proteins into our algorithm to guide the search to explore flexible regions. We demonstrate that rigidity analysis dramatically reduces the run time and accelerates convergence. 相似文献
8.
We propose a form of random forests that is especially suited for functional covariates. The method is based on partitioning the functions' domain in intervals and using the functions' mean values across those intervals as predictors in regression or classification trees. This approach appears to be more intuitive to applied researchers than usual methods for functional data, while also performing very well in terms of prediction accuracy. The intervals are obtained from randomly drawn, exponentially distributed waiting times. We apply our method to data from Raman spectra on boar meat as well as near‐infrared absorption spectra. The predictive performance of the proposed functional random forests is compared with commonly used parametric and nonparametric functional methods and with a nonfunctional random forest using the single measurements of the curve as covariates. Further, we present a functional variable importance measure, yielding information about the relevance of the different parts of the predictor curves. Our variable importance curve is much smoother and hence easier to interpret than the one obtained from nonfunctional random forests. 相似文献
9.
Gabriel Berzunza 《Random Structures and Algorithms》2017,51(3):404-427
We destroy a finite tree of size n by cutting its edges one after the other and in uniform random order. Informally, the associated cut‐tree describes the genealogy of the connected components created by this destruction process. We provide a general criterion for the convergence of the rescaled cut‐tree in the Gromov‐Prohorov topology to an interval endowed with the Euclidean distance and a certain probability measure, when the underlying tree has branching points close to the root and height of order . In particular, we consider uniform random recursive trees, binary search trees, scale‐free random trees and a mixture of regular trees. This yields extensions of a result in Bertoin (Probab Stat 5 (2015), 478–488) for the cut‐tree of uniform random recursive trees and also allows us to generalize some results of Kuba and Panholzer (Online J Anal Combin (2014), 26) on the multiple isolation of vertices. The approach relies in the close relationship between the destruction process and Bernoulli bond percolation, which may be useful for studying the cut‐tree of other classes of trees. © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 404–427, 2017 相似文献
10.
Henning Sulzbach 《Random Structures and Algorithms》2017,50(3):493-508
For a martingale (Xn) converging almost surely to a random variable X, the sequence (Xn– X) is called martingale tail sum. Recently, Neininger (Random Structures Algorithms 46 (2015), 346–361) proved a central limit theorem for the martingale tail sum of Régnier's martingale for the path length in random binary search trees. Grübel and Kabluchko (in press) gave an alternative proof also conjecturing a corresponding law of the iterated logarithm. We prove the central limit theorem with convergence of higher moments and the law of the iterated logarithm for a family of trees containing binary search trees, recursive trees and plane‐oriented recursive trees. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 493–508, 2017 相似文献