全文获取类型
收费全文 | 1505篇 |
免费 | 72篇 |
国内免费 | 59篇 |
专业分类
化学 | 109篇 |
力学 | 35篇 |
综合类 | 18篇 |
数学 | 1199篇 |
物理学 | 275篇 |
出版年
2024年 | 5篇 |
2023年 | 24篇 |
2022年 | 39篇 |
2021年 | 30篇 |
2020年 | 43篇 |
2019年 | 52篇 |
2018年 | 42篇 |
2017年 | 34篇 |
2016年 | 36篇 |
2015年 | 33篇 |
2014年 | 65篇 |
2013年 | 107篇 |
2012年 | 60篇 |
2011年 | 66篇 |
2010年 | 71篇 |
2009年 | 121篇 |
2008年 | 113篇 |
2007年 | 122篇 |
2006年 | 93篇 |
2005年 | 46篇 |
2004年 | 43篇 |
2003年 | 36篇 |
2002年 | 54篇 |
2001年 | 41篇 |
2000年 | 33篇 |
1999年 | 31篇 |
1998年 | 35篇 |
1997年 | 24篇 |
1996年 | 18篇 |
1995年 | 14篇 |
1994年 | 19篇 |
1993年 | 14篇 |
1992年 | 16篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有1636条查询结果,搜索用时 15 毫秒
1.
《Operations Research Letters》2022,50(3):274-280
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets. 相似文献
2.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs. 相似文献
3.
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. 相似文献
4.
5.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
6.
We present an O(min(Kn,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. 相似文献
7.
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. 相似文献
8.
应用七级目测法对浙江中部地区27个夏熟作物田样点的杂草进行了优势等级调查,将所得数据转换成重要值,以杂草在27个样点中的重要值为运算指标,应用主成分分析法和图论聚类中的最小生成树法,对24种杂草的生态学相似性进行了比较,指出了长期使用单一的除草剂导致农田杂草种群迅速更迭的原因:杂草对除草剂的敏感性差异及不同杂草间的生态学特性的差异。 相似文献
9.
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. 相似文献
10.
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). 相似文献