全文获取类型
收费全文 | 628篇 |
免费 | 79篇 |
国内免费 | 57篇 |
专业分类
化学 | 392篇 |
晶体学 | 17篇 |
力学 | 27篇 |
综合类 | 13篇 |
数学 | 131篇 |
物理学 | 184篇 |
出版年
2024年 | 2篇 |
2023年 | 6篇 |
2022年 | 20篇 |
2021年 | 13篇 |
2020年 | 28篇 |
2019年 | 21篇 |
2018年 | 14篇 |
2017年 | 22篇 |
2016年 | 29篇 |
2015年 | 24篇 |
2014年 | 30篇 |
2013年 | 59篇 |
2012年 | 27篇 |
2011年 | 61篇 |
2010年 | 21篇 |
2009年 | 44篇 |
2008年 | 49篇 |
2007年 | 32篇 |
2006年 | 39篇 |
2005年 | 29篇 |
2004年 | 23篇 |
2003年 | 11篇 |
2002年 | 21篇 |
2001年 | 18篇 |
2000年 | 25篇 |
1999年 | 18篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 17篇 |
1995年 | 5篇 |
1994年 | 9篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有764条查询结果,搜索用时 0 毫秒
71.
In this article, we focus on discussing the degree distribution of the DMS model from the perspective of probability. On the basis of the concept and technique of first-passage probability in Markov theory, we provide a rigorous proof for existence of the steady-state degree distribution, mathematically re-deriving the exact formula of the distribution. The approach based on Markov chain theory is universal and performs well in a large class of growing networks. 相似文献
72.
《Discrete Mathematics》2022,345(5):112802
We study logical limit laws for uniform attachment random graphs. In this random graph model, vertices and edges are introduced recursively: at time , the vertex is introduced together with m edges joining the new vertex with m different vertices chosen uniformly at random from . We prove that this random graph obeys convergence law for first-order sentences with at most variables. 相似文献
73.
A. I. Semisynov A. V. Fedorov V. E. Novikov N. V. Semionov A. D. Kosinov 《Journal of Applied Mechanics and Technical Physics》2003,44(2):212-220
Results of experimental investigations of the evolution of natural disturbances and laminar–turbulent transition in a supersonic boundary layer on the attachment line of a circular cylinder with a sweep angle of 68° and a freestream Mach number M = 2 are presented. The experimental studies are supplemented by calculations of the mean flow and stability characteristics. Flow regimes in the boundary layer on the attachment line are determined by a hotwire technique as functions of the Reynolds number and height of twodimensional roughness elements. The results are compared with NASA (Ames) experiments. 相似文献
74.
使用HF-SCF、Becke3-LYP和MP2理论方法和Dunnning基组aug-cc-PVTZ对卤代乙腈负离子CH2XCN-(X=F,Cl)进行一系列计算. 计算说明电子垂直贴附到中性分子是吸热反应. 构型优化的负离子CH2FCN-主要是价层束缚类型,CH2FCN-→CH2CN+F-是非绝热解离过程. 在描述负离子的电子结构以及解离贴附动力学时, 理论计算与实验结果比较得出Becke3-LYP方法是合理的,然而在CH2ClCN-→CH2CN+Cl-的解离势能曲线的计算中,MP2和Becke3-LYP方法有显著的不同. 相似文献
75.
P. Cicman M. Francis J.D. Skalny S. Matejcik T.D. Märk 《Czechoslovak Journal of Physics》2003,53(3):181-190
The rate constant for dissociative electron attachment to ozone has been derived over the energy range from about 0 to 10 eV using recently measured and also corrected cross section data. The new rate constant data sets for two partial dissociative channels, as well as for the total dissociative electron attachment, are compared with previously reported values, and existing discrepancies are discussed. 相似文献
76.
Tim Granath Karl Mandel Peer Löbmann 《Particle & Particle Systems Characterization》2021,38(8):2100098
This study demonstrates how the method of thermally assisted oxidative precipitation in water can be opened for—the so far neglected—metal organic iron(II) complexes (herein: citrate) in order to obtain, in one step, ferromagnetic magnetite nanoparticles, possessing essential ligand properties. Based on a dedicated analysis of the specific precursor in combination with the consideration of known properties of the ligand, it is possible to identify existing inhibition-attributes of the iron organyl such that these can be overcome. Moreover, they can be exploited in a targeted manner; thus, simply by changing concentrations, a variety of magnetite nanoparticle morphologies with distinct properties can be obtained. In the case of the herein investigated ferrous citrate, three major inhibition effects are identified. While two of them efficiently prevent the formation of magnetite and need to be addressed to be overcome, the third can be exploited to selectively synthesize, for example, relatively stable carboxyl group-bearing nuclei clusters, exhibiting the properties of magnetically responsive photonic crystals, or relatively large mesocrystals, whose intraparticular magnetic interactions are apparently disturbed. 相似文献
77.
Two thousand images of resolution 512×512 pixels as a regular matrix pattern of 10×10 elements are stored, where each element is angularly multiplexed 20 times in a 25 μm thickness of dichromated gelatin emulsion without cross-talk effect. The surface area of the matrix is 1 cm2. We show good concordance of the angular selectivity between the experimental result and theory. The diffraction efficiency of each 20 multiplexed images is measured and has nearly the same value. Examples of reconstructed images for multiple applications are given, for example, storage of 160,000 images on a 3′1/2 floppy disc format, which is about 100 min of black and white film. Application can be made to automobile cartography and storage of X-ray images as well as weather forecast images. Colored diffractive images are also possible and are illustrated. 相似文献
78.
79.
Christos A. Athanasiadis 《Journal of Algebraic Combinatorics》1996,5(1):5-11
The Laplacian of a directed graph G is the matrix L(G) = O(G) –, A(G) where A(G) is the adjaceney matrix of G and O(G) the diagonal matrix of vertex outdegrees. The eigenvalues of G are the eigenvalues of A(G). Given a directed graph G we construct a derived directed graph D(G) whose vertices are the oriented spanning trees of G. Using a counting argument, we describe the eigenvalues of D(G) and their multiplicities in terms of the eigenvalues of the induced subgraphs and the Laplacian matrix of G. Finally we compute the eigenvalues of D(G) for some specific directed graphs G. A recent conjecture of Propp for D(H
n
) follows, where H
n
stands for the complete directed graph on n vertices without loops. 相似文献
80.