全文获取类型
收费全文 | 2999篇 |
免费 | 322篇 |
国内免费 | 195篇 |
专业分类
化学 | 289篇 |
晶体学 | 2篇 |
力学 | 992篇 |
综合类 | 77篇 |
数学 | 1211篇 |
物理学 | 945篇 |
出版年
2024年 | 4篇 |
2023年 | 40篇 |
2022年 | 70篇 |
2021年 | 60篇 |
2020年 | 83篇 |
2019年 | 89篇 |
2018年 | 66篇 |
2017年 | 112篇 |
2016年 | 113篇 |
2015年 | 75篇 |
2014年 | 161篇 |
2013年 | 192篇 |
2012年 | 154篇 |
2011年 | 166篇 |
2010年 | 153篇 |
2009年 | 174篇 |
2008年 | 192篇 |
2007年 | 186篇 |
2006年 | 187篇 |
2005年 | 156篇 |
2004年 | 138篇 |
2003年 | 132篇 |
2002年 | 108篇 |
2001年 | 86篇 |
2000年 | 86篇 |
1999年 | 66篇 |
1998年 | 46篇 |
1997年 | 68篇 |
1996年 | 44篇 |
1995年 | 53篇 |
1994年 | 32篇 |
1993年 | 31篇 |
1992年 | 34篇 |
1991年 | 24篇 |
1990年 | 20篇 |
1989年 | 25篇 |
1988年 | 13篇 |
1987年 | 9篇 |
1986年 | 12篇 |
1985年 | 15篇 |
1984年 | 8篇 |
1982年 | 9篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1957年 | 3篇 |
排序方式: 共有3516条查询结果,搜索用时 46 毫秒
1.
2.
3.
《Discrete Mathematics》2022,345(12):113083
Let G be a graph, the order of G, the connectivity of G and k a positive integer such that . Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets and is defined to be Hamiltonian-laceable if such that and for every pair of vertices and , there exists a Hamiltonian path in G with endpoints p and q, or and for every pair of vertices , there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition . Define to be a maximum integer such that and (1) for each non-empty subset S of X, if , then , and if , then ; and (2) for each non-empty subset S of Y, if , then , and if , then ; and (3) if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition such that and . In this paper, we show that if , then G is Hamiltonian-laceable; or if , then for every pair of vertices and , there is an -path P in G with . We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs. 相似文献
4.
基于零售商降价促销问题,引入策略型消费者,考虑到异质性消费者有可能对商品不满意,构建两期决策模型,旨在从退货和价格路径优化两方面提高零售商利润。研究给出(不)允许退货时,零售商面对策略型消费者的定价建议,指出零售商制定价格要在一定程度上参考商品类型。订货量相同时,给出策略型消费者降低零售商的期望利润的条件;面对短视型或者策略型消费者时,允许退货可在特定条件下提升零售商利润。消费者退货成本越高,对策略型消费者消极影响的抑制作用越明显,零售商的利润增长越显著。最后,通过数值算例分析了在两种退货决策以及不同退货成本下产品类型对零售商定价的影响,以及退货措施对策略型消费者消极影响的作用。 相似文献
5.
基于改进粒子群的薄壁变截面刚架临界载荷优化算法 总被引:1,自引:0,他引:1
针对大型变截面薄壁结构的稳定问题,以一类任意约束对称结构受非对称载荷的单跨刚架为研究对象,结构拆分为相关铁木辛柯(Timoshenko)梁,结合差分原理和最优化方法,以每段刚架的每个离散点挠度、临界载荷、轴力、剪力和梁端弯矩为设计变量,建立求解满足边界条件的非线性差分方程模型,提出基于优胜劣汰粒子更新的粒子群(IPSO)临界载荷优化算法。运用JAVA编程语言编制对应优化程序,分析典型算例并核实ABAQUS仿真结果。研究表明,本文提出的优化算法获得了有效的变形位型和高精度的临界载荷计算,能更好地描述刚架受力下位型和载荷的力学关系,进一步为工程设计与分析提供支持。 相似文献
6.
This work deals with a study of the dynamic and buckling analysis of polymer hybrid composite(PHC) beam. The beam has variable thickness and is reinforced by carbon nanotubes(CNTs) and nanoclay(NC) simultaneously. The governing equations are derived based on the first shear deformation theory(FSDT). A three-phase HalpinTsai approach is used to predict the mechanical properties of the PHC. We focus our attention on the effect of the simultaneous addition of NC and CNT on the vibration and buckling analysis of the PHC beam with variable thickness. Also a comparison study is done on the sensation of three impressive parameters including CNT, NC weight fractions, and the shape factor of fillers on the mechanical properties of PHC beams,as well as fundamental frequencies of free vibrations and critical buckling load. The results show that the increase of shape factor value, NC, and CNT weight fractions leads to considerable reinforcement in mechanical properties as well as increase of the dimensionless fundamental frequency and buckling load. The variation of CNT weight fraction on elastic modulus is more sensitive rather than shear modulus but the effect of NC weight fraction on elastic and shear moduli is fairly the same. The shape factor values more than the medium level do not affect the mechanical properties. 相似文献
7.
Murad B. Khorsheed Qasim M. Zainel Oday A. Hassen Saad M. Darwish 《Entropy (Basel, Switzerland)》2020,22(12)
This paper applies the entropy-based fractal indexing scheme that enables the grid environment for fast indexing and querying. It addresses the issue of fault tolerance and load balancing-based fractal management to make computational grids more effective and reliable. A fractal dimension of a cloud of points gives an estimate of the intrinsic dimensionality of the data in that space. The main drawback of this technique is the long computing time. The main contribution of the suggested work is to investigate the effect of fractal transform by adding R-tree index structure-based entropy to existing grid computing models to obtain a balanced infrastructure with minimal fault. In this regard, the presented work is going to extend the commonly scheduling algorithms that are built based on the physical grid structure to a reduced logical network. The objective of this logical network is to reduce the searching in the grid paths according to arrival time rate and path’s bandwidth with respect to load balance and fault tolerance, respectively. Furthermore, an optimization searching technique is utilized to enhance the grid performance by investigating the optimum number of nodes extracted from the logical grid. The experimental results indicated that the proposed model has better execution time, throughput, makespan, latency, load balancing, and success rate. 相似文献
8.
本文以车间搬运机器人为研究对象,在考虑时间窗的前提下,求解机器人进行物料配送和成品回收场景下的路径优化问题。提出一种强化学习遗传蚁群算法,首先利用扫描法求解初始搬运机器人的数量,并将子路径节点的几何中心设置为虚拟节点,利用嵌入遗传算子的蚁群算法求解连接虚拟节点的最优路径,再利用强化学习算法求解子路径的最优结果;最后将基本成本、运输成本和时间惩罚成本的加权和作为目标解,并最终求出满足约束条件的最优解。通过与基准问题求解结果对比,验证了强化学习遗传蚁群算法的优越性。 相似文献
9.
《Discrete Mathematics》2020,343(2):111679
A path in an edge-colored graph is called monochromatic if any two edges on the path have the same color. For , an edge-colored graph is said to be monochromatic -edge-connected if every two distinct vertices of are connected by at least edge-disjoint monochromatic paths, and is said to be uniformly monochromatic -edge-connected if every two distinct vertices are connected by at least edge-disjoint monochromatic paths such that all edges of these paths are colored with a same color. We use and to denote the maximum number of colors that ensures to be monochromatic -edge-connected and, respectively, to be uniformly monochromatic -edge-connected. In this paper, we first conjecture that for any -edge-connected graph , , where is a minimum -edge-connected spanning subgraph of . We verify the conjecture for . We also prove the conjecture for and with . When is a minimal -edge-connected graph, we give an upper bound of , i.e., . For the uniformly monochromatic -edge-connectivity, we prove that for all , , where is a minimum -edge-connected spanning subgraph of . 相似文献
10.
In the maritime environment slamming is a phenomenon known as short duration impact of water on a floating or sailing structure. Slamming loads are local and could induce very high local stresses. This paper reports a series of impact test results and investigate the slamming loads and pressures acting on a square based pyramid. In this study the slamming tests have been conducted at constant velocity impact with a hydraulic high speed shock machine. This specific experimental equipment avoids the deceleration of the structure observed usually during water entry with drop tests. Three velocities of the rigid pyramid have been used (10, 13 and 15 m s−1). Time-histories of local pressures, accelerations and slamming loads were successfully measured. The relationship between the pressure magnitude and the impact velocity is obtained and the spatial distribution of pressures on pyramid sides is characterized. The impact velocity was found to have a negligible influence in predicting the maximum pressure coefficient. 相似文献