全文获取类型
收费全文 | 979篇 |
免费 | 70篇 |
国内免费 | 58篇 |
专业分类
化学 | 138篇 |
力学 | 44篇 |
综合类 | 13篇 |
数学 | 671篇 |
物理学 | 241篇 |
出版年
2024年 | 4篇 |
2023年 | 2篇 |
2022年 | 18篇 |
2021年 | 14篇 |
2020年 | 27篇 |
2019年 | 27篇 |
2018年 | 28篇 |
2017年 | 16篇 |
2016年 | 35篇 |
2015年 | 26篇 |
2014年 | 42篇 |
2013年 | 75篇 |
2012年 | 36篇 |
2011年 | 38篇 |
2010年 | 41篇 |
2009年 | 79篇 |
2008年 | 72篇 |
2007年 | 85篇 |
2006年 | 68篇 |
2005年 | 37篇 |
2004年 | 35篇 |
2003年 | 43篇 |
2002年 | 47篇 |
2001年 | 28篇 |
2000年 | 32篇 |
1999年 | 27篇 |
1998年 | 18篇 |
1997年 | 19篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 9篇 |
1993年 | 8篇 |
1992年 | 10篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1985年 | 5篇 |
1984年 | 1篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有1107条查询结果,搜索用时 18 毫秒
1.
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. 相似文献
2.
混合判断矩阵排序方法研究 总被引:2,自引:0,他引:2
本文介绍了混合判断矩阵及完全一致性混合判断矩阵的概念,提出了混合判断矩阵排序的一种最小偏差法,并给出了其收敛性迭代算法,最后通过算例说明了方法的可行性。 相似文献
3.
Bernhard Heinemann 《Mathematical Logic Quarterly》1997,43(2):203-215
Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated. 相似文献
4.
By constructing close-one-cochain density Ω^12n in the gauge group space we get the Wess-Zumino-Witten (WZW) effective Lagrangian on high-dimensional noncommutative space.Especially consistent anomalies derived from this WZW effective action in noncommutative four-dimensional space coincide with those obtained by L.Bonora etc.(het-th/0002210). 相似文献
5.
George Lagogiannis Christos Makris Athanasios Tsakalidis 《Journal of Discrete Algorithms》2006,4(1):106-141
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way. 相似文献
6.
Inna Bumagina 《Geometriae Dedicata》2004,106(1):211-230
A group is said to be Hopfian if every surjective endomorphism of the group is injective. We show that finitely generated subgroups of torsion-free hyperbolic groups are Hopfian. Our proof generalizes a theorem of Sela (Topology
35 (2) 1999, 301–321). 相似文献
7.
标度系统一致性矩阵容量的计算方法 总被引:4,自引:0,他引:4
吕跃进 《数学的实践与认识》2003,33(9):102-107
本文研究正互反矩阵的变换性质 ,提出一种保持正互反矩阵一致性程度的等价分类 ,为计算各种标度系统下的一致矩阵容量提供了计算方法 相似文献
8.
林诒勋 《高校应用数学学报(英文版)》2003,18(3):361-369
§ 1 IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th… 相似文献
9.
Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size n ≥ j. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that n − j is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
10.
本文证明了d2k =δ2k =d2k ≥b2k,其中d2k ,δ2k , b2k分别表示A(BlMp)在lNq下的Kolmogorov,线性,Bernstein 2k-宽度,d2k 表示AT(BlN相似文献