全文获取类型
收费全文 | 1112篇 |
免费 | 61篇 |
国内免费 | 95篇 |
专业分类
化学 | 386篇 |
力学 | 91篇 |
综合类 | 18篇 |
数学 | 566篇 |
物理学 | 207篇 |
出版年
2023年 | 13篇 |
2022年 | 19篇 |
2021年 | 11篇 |
2020年 | 35篇 |
2019年 | 35篇 |
2018年 | 29篇 |
2017年 | 34篇 |
2016年 | 25篇 |
2015年 | 17篇 |
2014年 | 23篇 |
2013年 | 68篇 |
2012年 | 62篇 |
2011年 | 55篇 |
2010年 | 54篇 |
2009年 | 60篇 |
2008年 | 76篇 |
2007年 | 90篇 |
2006年 | 56篇 |
2005年 | 56篇 |
2004年 | 54篇 |
2003年 | 55篇 |
2002年 | 42篇 |
2001年 | 34篇 |
2000年 | 26篇 |
1999年 | 31篇 |
1998年 | 24篇 |
1997年 | 30篇 |
1996年 | 18篇 |
1995年 | 15篇 |
1994年 | 10篇 |
1993年 | 11篇 |
1992年 | 11篇 |
1991年 | 10篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 6篇 |
1987年 | 7篇 |
1986年 | 9篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1976年 | 2篇 |
1974年 | 1篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 3篇 |
1970年 | 1篇 |
排序方式: 共有1268条查询结果,搜索用时 15 毫秒
1.
当煤层上方为坚硬顶板时,在工作面回采期间容易出现大面积悬顶,导致巷旁充填体出现大变形破坏,极大威胁采煤安全.为解决这一问题,以某矿1205工作面沿空留巷为工程背景,分析了爆炸围岩裂隙范围和坚硬顶板破断特征,建立了切顶卸压围岩结构力学模型,研究表明,相邻炮孔爆炸后,炮孔间裂隙互相贯穿,降低了顶板强度,同时当切顶角为15°时,巷道稳定性较好.工程实践结果表明:采用爆破切顶技术后,顶板下沉量减小了62.3%,较好地保证了围岩稳定性. 相似文献
2.
针对城市物流配送优化研究在客户服务时间窗和货物装载方式合理结合方面存在的不足,考虑物流配送车厢货物装载方式与客户访问序列相关的特征对车厢空间进行合理的区域划分。首先,构建了包含配送中心的固定成本、配送车辆的运输成本、维修成本、租赁成本和违反时间窗惩罚成本的物流运营成本最小化和配送车辆空间利用率最大化的双目标优化模型;然后,提出一种结合遗传算法(GA)全局搜索能力和禁忌搜索算法(TS)局部搜索能力的GA-TS混合算法求解模型;最后,结合重庆市某配送中心的三维装载物流配送实例数据进行了优化计算,实验结果给出了带时间窗的三维装载物流配送路径优化方案,并进行了不同车厢空间分区模式下平均装载率、物流运营成本和车辆使用数的比较分析。研究表明,当客户需求货物种类数与车辆的空间区域划分数相等且按货物类型进行区域划分时,物流运营成本最小,配送车辆使用数最少和车辆平均装载率最高。 相似文献
3.
《Discrete Mathematics》2022,345(9):112949
In this paper, we describe a result on self-conjugate -core partitions with the fixed number of corners. We also define shifted corners of a distinct partition and find formulas for the number of -core partitions and the number of -core shifted Young diagrams with the fixed number of shifted corners. 相似文献
4.
5.
Bhalchandra D. Thatte 《Journal of Graph Theory》2020,93(2):181-202
Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question. 相似文献
6.
7.
8.
Given an undirected graph, a star partition is a partition of the nodes into subsets with at least two nodes so that the subgraph induced by each subset has a spanning star. Star partitions are related to well-known problems concerning domination in graphs and edge covering. We focus on the Constrained Star Partition Problem (CSP) that asks for finding a star partition of given cardinality. The problem is new and presents interesting peculiarities. We explore the relation between the cardinalities of star partitions and domatic bipartitions, showing that there are star partitions of any cardinality between minimum and maximum values, and that a similar but weaker result holds for domatic bipartitions. We study the computational complexity of different versions of star partition and domatic bipartition problems, proving that most of them, in particular CSP, constrained domatic bipartition and balanced domatic bipartition, are NP-complete. We also show that star partition problems are polynomial on trees and, more generally, on bounded treewidth graphs. We introduce an integer linear programming formulation that defines a polytope containing all the star partitions of a graph, showing that its vertices have only integral components for trees, which implies that linear programming can be used to solve weighted star partition problems on trees. 相似文献
9.
10.
We consider the cost of general orthogonal range queries in random quadtrees. The cost of a given query is encoded into a (random) function of four variables which characterize the coordinates of two opposite corners of the query rectangle. We prove that, when suitably shifted and rescaled, the random cost function converges uniformly in probability towards a random field that is characterized as the unique solution to a distributional fixed-point equation. We also state similar results for 2-d trees. Our results imply for instance that the worst case query satisfies the same asymptotic estimates as a typical query, and thereby resolve an open question of Chanzy et al. (2001). 相似文献