全文获取类型
收费全文 | 741篇 |
免费 | 49篇 |
国内免费 | 24篇 |
专业分类
化学 | 73篇 |
晶体学 | 5篇 |
力学 | 55篇 |
综合类 | 13篇 |
数学 | 278篇 |
物理学 | 390篇 |
出版年
2024年 | 1篇 |
2023年 | 12篇 |
2022年 | 17篇 |
2021年 | 15篇 |
2020年 | 25篇 |
2019年 | 32篇 |
2018年 | 12篇 |
2017年 | 21篇 |
2016年 | 17篇 |
2015年 | 28篇 |
2014年 | 52篇 |
2013年 | 53篇 |
2012年 | 27篇 |
2011年 | 41篇 |
2010年 | 47篇 |
2009年 | 66篇 |
2008年 | 53篇 |
2007年 | 58篇 |
2006年 | 44篇 |
2005年 | 43篇 |
2004年 | 26篇 |
2003年 | 22篇 |
2002年 | 14篇 |
2001年 | 11篇 |
2000年 | 12篇 |
1999年 | 9篇 |
1998年 | 17篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 2篇 |
1992年 | 6篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有814条查询结果,搜索用时 375 毫秒
1.
Xuechao Li 《Graphs and Combinatorics》2006,22(4):503-513
In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of
Luo [6] and Y. Zhao [12]. 相似文献
2.
A. V. Kel’manov L. V. Mikhailova 《Computational Mathematics and Mathematical Physics》2006,46(1):165-181
The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented. 相似文献
3.
Eckhard Steffen 《Discrete Mathematics》2004,280(1-3):191-214
Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let ck be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r3=|E|−c3 and
. We show that on one side r3 and r2 bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r3 and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr3. For k=2,3, let ζk denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other. 相似文献
4.
极紫外望远镜各通道夹角的测量 总被引:1,自引:1,他引:0
极紫外望远镜是由四个单通道的望远镜捆绑在一起,以便同时对太阳的相同部分观测,由于受地面装调以及发射过程中的影响,无法保证四个通道光轴严格平行,必然带来观测位置上的误差。只要测出各通道之间的光轴夹角,便可在像面上采取适当的处理方法,以便减小这种误差,但这一夹角的测量精度必须控制在0.1″内。为达到如此高的精度,采用了太阳局部边缘探测的方法,很好地解决了这一问题。 相似文献
5.
We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state
branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch
lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family
with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees
and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state
branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of
a Poisson sampling directed by the mass measure.
T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries,
EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779. 相似文献
6.
Summary Thermopiezoelastic materials have recently attracted considerable attention because of their potential use in intelligent
or smart structural systems. The governing equations of a thermopiezoelastic medium are more complex due to the intrinsic
coupling effects that take place among mechanical, electrical and thermal fields. In this analysis, we deal with the problem
of a crack in a semi-infinite, transversely isotropic, thermopiezoelastic material by means of potential functions and Fourier
transforms under steady heat-flux loading conditions. The problem is reduced to a singular integral equation that is solved.
The thermal stress intensity factor for a crack situated in a cadmium selenide material is calculated.
Received 20 March 2001; accepted for publication 18 October 2001 相似文献
7.
Hidefumi Ohsugi 《Journal of Combinatorial Theory, Series A》2006,113(4):718-725
Athanasiadis [Ehrhart polynomials, simplicial polytopes, magic squares and a conjecture of Stanley, J. Reine Angew. Math., to appear.] studies an effective technique to show that Gorenstein sequences coming from compressed polytopes are unimodal. In the present paper we will use such the technique to find a rich class of Gorenstein toric rings with unimodal h-vectors arising from finite graphs. 相似文献
8.
Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model. 相似文献
9.
André Kündgen 《Discrete Mathematics》2005,296(1):121-128
A cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers every edge of G at least once. The total size of a cycle cover (cut cover) is the sum of the number of edges of the cycles (cuts) in the cover.We discuss several results for cycle covers and the corresponding results for cut covers. Our main result is that every connected graph on n vertices and e edges has a cut cover of total size at most 2e-n+1 with equality precisely when every block of the graph is an odd cycle or a complete graph (other than K4 or K8). This corresponds to the result of Fan [J. Combin. Theory Ser. B 74 (1998) 353-367] that every graph without cut-edges has a cycle cover of total size at most e+n-1. 相似文献
10.
An exact method based on Green's equation is used to find the diffusion-controlled faradaic current for certain electrode geometries that incorporate edges and vertices. Thereby the magnitudes of the time-independent current density associated with angled electrode/electrode and electrode/insulator junctions are calculated. As well, the square-root-of-time-dependent currents associated with vertices, receive attention. These terms extend to longer times, the Cottrell formulation appropriate for short times. Though most of the problems solved here have been tackled previously, the novel Green function approach is shown to be straightforward and intuitive. 相似文献