全文获取类型
收费全文 | 836篇 |
免费 | 30篇 |
国内免费 | 9篇 |
专业分类
化学 | 479篇 |
晶体学 | 2篇 |
力学 | 26篇 |
数学 | 253篇 |
物理学 | 115篇 |
出版年
2023年 | 9篇 |
2022年 | 9篇 |
2021年 | 14篇 |
2020年 | 10篇 |
2019年 | 18篇 |
2018年 | 19篇 |
2017年 | 19篇 |
2016年 | 24篇 |
2015年 | 31篇 |
2014年 | 24篇 |
2013年 | 68篇 |
2012年 | 42篇 |
2011年 | 38篇 |
2010年 | 55篇 |
2009年 | 41篇 |
2008年 | 60篇 |
2007年 | 55篇 |
2006年 | 48篇 |
2005年 | 41篇 |
2004年 | 43篇 |
2003年 | 34篇 |
2002年 | 26篇 |
2001年 | 21篇 |
2000年 | 13篇 |
1999年 | 12篇 |
1998年 | 14篇 |
1997年 | 6篇 |
1996年 | 12篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1988年 | 5篇 |
1986年 | 4篇 |
1984年 | 2篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1970年 | 1篇 |
1968年 | 1篇 |
1966年 | 2篇 |
1937年 | 1篇 |
1936年 | 1篇 |
1910年 | 3篇 |
排序方式: 共有875条查询结果,搜索用时 15 毫秒
1.
Mike R. Jeffrey 《Nonlinear dynamics》2015,81(4):1699-1716
2.
3.
Mathematical Notes - 相似文献
4.
Given a tree
with leaf set X, there are certain ways of arranging the elements of X in a circular order so that
can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X. 相似文献
5.
We investigate the combinatorics of a topological space that is generated by the set of edge-weighted finite trees. This space arises by multiplying the weights of edges on paths in trees and is closely connected to tree reconstruction problems involving finite state Markov processes. We show that this space is a contractible finite CW-complex whose face poset can be described via a partial order on semilabelled forests. We then describe some combinatorial properties of this poset, showing that, for example, it is pure, thin and contractible. 相似文献
6.
Jean-Pierre Dedieu Gregorio Malajovich Mike Shub 《Foundations of Computational Mathematics》2005,5(2):145-171
We prove a linear bound on the average total curvature of the
central path of linear programming theory in terms of the number
of independent variables of the primal problem, and independent of
the number of constraints. 相似文献
7.
We study the tangent space at a monomial point M in the Hilbert scheme that parameterizes all ideals with the same Hilbert function as M over an exterior algebra. 相似文献
8.
Mike Develin 《Discrete Applied Mathematics》2007,155(17):2257-2268
We consider a deterministic discrete-time model of fire spread introduced by Hartnell [Firefighter! an application of domination, Presentation, in: 20th Conference on Numerical Mathematics and Computing, University of Manitoba in Winnipeg, Canada, September 1995] and the problem of minimizing the number of burnt vertices when a fixed number of vertices can be defended by firefighters per time step. While only two firefighters per time step are needed in the two-dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [Fire control on graphs, J. Combin. Math. Combin. Comput. 41 (2002) 19-34] that 2d-1 firefighters per time step are needed to contain a fire outbreak starting at a single vertex in the d-dimensional square lattice for d?3; we also prove that in the d-dimensional lattice, d?3, for each positive integer f there is some outbreak of fire such that f firefighters per time step are insufficient to contain the outbreak. We prove another conjecture of Wang and Moeller that the proportion of elements in the three-dimensional grid Pn×Pn×Pn which can be saved with one firefighter per time step when an outbreak starts at one vertex goes to 0 as n gets large. Finally, we use integer programming to prove results about the minimum number of time steps needed and minimum number of burnt vertices when containing a fire outbreak in the two-dimensional square lattice with two firefighters per time step. 相似文献
9.
Mike Wright 《The Journal of the Operational Research Society》1994,45(7):758-770
This paper concerns a computer system which has been devised to timetable the county cricket matches in England. The context of the work is discussed and the many constraints and objectives described. Details of the solution method are given; it involves tabu search with a form of diversification dependent on the solution subcosts as well as the overall cost. Experiments are described which suggest that this type of diversification may have wide applicability to large, complex, multi-objective combinatorial problems. 相似文献
10.
Evaluation of gas chromatography-tandem quadrupole mass spectrometry for the determination of organochlorine pesticides in fats and oils 总被引:1,自引:0,他引:1
Patel K Fussell RJ Hetmanski M Goodall DM Keely BJ 《Journal of chromatography. A》2005,1068(2):289-296
A gas chromatography-tandem quadrupole mass spectrometry multi-residue method for the analysis of 19 organochlorine pesticides in fats and oils has been developed. Gel permeation chromatography was employed to remove lipid material prior to GC-MS/MS analysis. Average recoveries of the pesticides spiked at 10 and 50 microg kg(-1) into fish oil, pork fat, olive oil and hydrogenated vegetable oil were typically in the range 70-110% with relative standard deviations generally less than 10%. Calculated limits of detection are between 0.1 and 2.0 microg kg(-1) and results obtained for the analysis of proficiency test materials are in good agreement with assigned values. The higher selectivity of the GC-MS/MS compared to electron capture detection and GC-MS in selective ion monitoring mode allowed unambiguous identification and confirmation of all the target pesticides at low microg kg(-1) levels in fats and oils in a single analysis. 相似文献