全文获取类型
收费全文 | 1298篇 |
免费 | 105篇 |
国内免费 | 108篇 |
专业分类
化学 | 477篇 |
晶体学 | 1篇 |
力学 | 72篇 |
综合类 | 24篇 |
数学 | 640篇 |
物理学 | 297篇 |
出版年
2023年 | 15篇 |
2022年 | 37篇 |
2021年 | 21篇 |
2020年 | 33篇 |
2019年 | 41篇 |
2018年 | 41篇 |
2017年 | 44篇 |
2016年 | 33篇 |
2015年 | 47篇 |
2014年 | 34篇 |
2013年 | 82篇 |
2012年 | 68篇 |
2011年 | 70篇 |
2010年 | 67篇 |
2009年 | 71篇 |
2008年 | 78篇 |
2007年 | 86篇 |
2006年 | 62篇 |
2005年 | 64篇 |
2004年 | 55篇 |
2003年 | 54篇 |
2002年 | 55篇 |
2001年 | 40篇 |
2000年 | 38篇 |
1999年 | 40篇 |
1998年 | 34篇 |
1997年 | 35篇 |
1996年 | 21篇 |
1995年 | 17篇 |
1994年 | 10篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 10篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 6篇 |
1987年 | 7篇 |
1986年 | 9篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1976年 | 2篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 3篇 |
1970年 | 1篇 |
排序方式: 共有1511条查询结果,搜索用时 15 毫秒
61.
A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7. 相似文献
62.
针对城市物流配送优化研究在客户服务时间窗和货物装载方式合理结合方面存在的不足,考虑物流配送车厢货物装载方式与客户访问序列相关的特征对车厢空间进行合理的区域划分。首先,构建了包含配送中心的固定成本、配送车辆的运输成本、维修成本、租赁成本和违反时间窗惩罚成本的物流运营成本最小化和配送车辆空间利用率最大化的双目标优化模型;然后,提出一种结合遗传算法(GA)全局搜索能力和禁忌搜索算法(TS)局部搜索能力的GA-TS混合算法求解模型;最后,结合重庆市某配送中心的三维装载物流配送实例数据进行了优化计算,实验结果给出了带时间窗的三维装载物流配送路径优化方案,并进行了不同车厢空间分区模式下平均装载率、物流运营成本和车辆使用数的比较分析。研究表明,当客户需求货物种类数与车辆的空间区域划分数相等且按货物类型进行区域划分时,物流运营成本最小,配送车辆使用数最少和车辆平均装载率最高。 相似文献
63.
Curtis Bennett Kathy J. Dempsey Bruce E. Sagan 《Journal of Algebraic Combinatorics》1994,3(3):261-283
We construct a family of partially ordered sets (posets) that are q-analogs of the set partition lattice. They are different from the q-analogs proposed by Dowling [5]. One of the important features of these posets is that their Whitney numbers of the first and second kind are just the q-Stirling numbers of the first and second kind, respectively. One member of this family [4] can be constructed using an interpretation of Milne [9] for S[n, k] as sequences of lines in a vector space over the Galois field F
q. Another member is constructed so as to mirror the partial order in the subspace lattice. 相似文献
64.
We calculate the dimensions of the second homology groups with trivial coefficients of nilpotent subalgebras of the Lie superalgebra
, which is the natural superanalog of the Witt algebra. The proof is based on direct calculations of the rank of the differential. As an application, we find deformations of the maximal nilpotent subalgebra in
. 相似文献
65.
The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed. 相似文献
66.
图的划分问题曾引起图论界的广泛关注,在文献[4]中讨论了k-单圈划分,本文进一步研究基于k-单圈划分的优化问题,即在一个赋权图中求一个最小权可k-单圈划分的支撑子图,以及对一个不存在k-单圈划分支撑子图的图,如何添最少的边使得它有k-单圈划分的支撑子图。 相似文献
67.
随机次自相似集的表示 总被引:2,自引:0,他引:2
本文引进了随机次自相似集与随机推移集的概念,讨论了随机次自相似集的结构,并证明了任一随机集是随机次自相似集的充分必要条件是:该随机集可以表为某一个随机推移集的某个像集。 相似文献
68.
Starting from a linear collineation of PG(2n–1,q) suitably constructed from a Singer cycle of GL(n,q), we prove the existence of a partition of PG(2n–1,q) consisting of two (n–1)-subspaces and caps, all having size (qn–1)/(q–1) or (qn–1)/(q+1) according as n is odd or even respectively. Similar partitions of quadrics or hermitian varieties into two maximal totally isotropic subspaces and caps of equal size are also obtained. We finally consider the possibility of partitioning the Segre variety
of PG(8,q) into caps of size q2+q+1 which are Veronese surfaces. 相似文献
69.
70.
Youcef Bouizem Salah Boulaaras Bachir Djebbar 《Mathematical Methods in the Applied Sciences》2019,42(7):2465-2474
The paper deals with some existence results for an elliptic equation of Kirchhoff‐type with changing sign data and a logarithmic nonlinearity by direct variational method, Galerkin approach, and sub‐super solutions method. Our results are natural extension of Boulaaras' work in (Math Methods Appl Sci; 41(13):5203‐5210). 相似文献