全文获取类型
收费全文 | 542篇 |
免费 | 2篇 |
国内免费 | 14篇 |
专业分类
化学 | 25篇 |
力学 | 1篇 |
综合类 | 1篇 |
数学 | 300篇 |
物理学 | 38篇 |
综合类 | 193篇 |
出版年
2023年 | 9篇 |
2022年 | 12篇 |
2021年 | 8篇 |
2020年 | 16篇 |
2019年 | 12篇 |
2018年 | 11篇 |
2017年 | 5篇 |
2016年 | 8篇 |
2015年 | 9篇 |
2014年 | 17篇 |
2013年 | 44篇 |
2012年 | 25篇 |
2011年 | 37篇 |
2010年 | 28篇 |
2009年 | 36篇 |
2008年 | 36篇 |
2007年 | 28篇 |
2006年 | 31篇 |
2005年 | 17篇 |
2004年 | 25篇 |
2003年 | 14篇 |
2002年 | 11篇 |
2001年 | 12篇 |
2000年 | 14篇 |
1999年 | 10篇 |
1998年 | 6篇 |
1997年 | 10篇 |
1996年 | 9篇 |
1995年 | 10篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 4篇 |
1988年 | 6篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有558条查询结果,搜索用时 125 毫秒
1.
The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data. 相似文献
2.
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. 相似文献
3.
4.
We study the behavior of dynamic programming methods for the tree edit distance problem, such as [P. Klein, Computing the edit-distance between unrooted ordered trees, in: Proceedings of 6th European Symposium on Algorithms, 1998, p. 91–102; K. Zhang, D. Shasha, SIAM J. Comput. 18 (6) (1989) 1245–1262]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies. 相似文献
5.
在急性冷驯化阶段(1h,4h,8h),中缅树膈肌线粒体状态IV呼吸与对照比较8小时组有显著的增强,心肌线粒体状态IV呼吸与对照比较在4小时和8小时有显著增强;在持续冷驯化阶段(1d,7d,14d,28d),中缅树膈肌和心肌线粒体状态IV呼吸与对照比较均有所增强,其中28天组增强十分显著。这一系列变化对于探讨中缅树膈肌与心肌在冷驯化中质子漏产热特征具有一定的意义。 相似文献
6.
J. Becnel C. Falgeust T. Cavalier K. Gauthreaux F. Landry M. Blanchard M.J. Beck J.N. Beck 《Microchemical Journal》2004,78(2):205-210
To determine if a correlation exists between mercury concentrations in lichens and wood from tree cores, tree core and lichen samples were taken from sites under mercury advisories and analyzed for mercury using a Bacharach 50B Mercury Analyzer System employing the Manual Cold Vapor Atomic Absorption EPA method 7471A. Wood from tree cores was dated using tree ring data. Wood samples from the cores were analyzed for various depths in the tree core (periods of time) to determine if variations occur throughout the cores. Preliminary data indicate that a strong correlation exists between mercury concentrations in tree core and lichen samples. Samples were analyzed for the 6-month period of summer 2003–winter 2004. A correlation coefficient of 0.882 was found between the tree core and lichen data sets. The derived correlations were used to estimate concentrations of mercury in tree rings for sites in lichen samples which were previously analyzed. These predicted values compared favorably to recently determined concentrations of Hg in tree cores. The strong correlation between lichen and tree core Hg concentrations suggests similar uptake mechanism for the two types of biota. 相似文献
7.
余前媛 《西昌学院学报(自然科学版)》2004,(4):131-134
本文综述了植物化控对果树的生长发育、开花结实、果实品质、休眠等方面的影响及应用现状,并简要介绍了植物生长调节剂在果树栽培中的残毒问题。 相似文献
8.
9.
A star edge coloring of a graph is a proper edge coloring such that every connected 2-colored subgraph is a path with at most 3 edges. Deng et al. and Bezegová et al. independently show that the star chromatic index of a tree with maximum degree is at most , which is tight. In this paper, we study the list star edge coloring of -degenerate graphs. Let be the list star chromatic index of : the minimum such that for every -list assignment for the edges, has a star edge coloring from . By introducing a stronger coloring, we show with a very concise proof that the upper bound on the star chromatic index of trees also holds for list star chromatic index of trees, i.e. for any tree with maximum degree . And then by applying some orientation technique we present two upper bounds for list star chromatic index of -degenerate graphs. 相似文献
10.
Let be a connected graph with edges. An antimagic labeling of is a one-to-one mapping from to such that the vertex sum (i.e., sum of the labels assigned to edges incident to a vertex) for distinct vertices are different. A graph is called antimagic if has an antimagic labeling. It was conjectured by Hartsfield and Ringel that every tree other than is antimagic. The conjecture remains open though it was verified for trees with some constrains. Caterpillars are an important subclass of trees. This paper shows caterpillars with maximum degree 3 are antimagic, which gives an affirmative answer to an open problem of Lozano et al. (2019). 相似文献