全文获取类型
收费全文 | 1360篇 |
免费 | 67篇 |
国内免费 | 78篇 |
专业分类
化学 | 204篇 |
晶体学 | 3篇 |
力学 | 51篇 |
综合类 | 29篇 |
数学 | 937篇 |
物理学 | 281篇 |
出版年
2023年 | 9篇 |
2022年 | 20篇 |
2021年 | 28篇 |
2020年 | 22篇 |
2019年 | 33篇 |
2018年 | 39篇 |
2017年 | 25篇 |
2016年 | 33篇 |
2015年 | 29篇 |
2014年 | 42篇 |
2013年 | 123篇 |
2012年 | 37篇 |
2011年 | 62篇 |
2010年 | 71篇 |
2009年 | 90篇 |
2008年 | 96篇 |
2007年 | 88篇 |
2006年 | 81篇 |
2005年 | 65篇 |
2004年 | 30篇 |
2003年 | 35篇 |
2002年 | 44篇 |
2001年 | 34篇 |
2000年 | 32篇 |
1999年 | 44篇 |
1998年 | 31篇 |
1997年 | 34篇 |
1996年 | 19篇 |
1995年 | 19篇 |
1994年 | 25篇 |
1993年 | 15篇 |
1992年 | 14篇 |
1991年 | 11篇 |
1990年 | 11篇 |
1989年 | 15篇 |
1988年 | 11篇 |
1987年 | 10篇 |
1986年 | 8篇 |
1985年 | 9篇 |
1984年 | 11篇 |
1983年 | 2篇 |
1982年 | 18篇 |
1981年 | 7篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1976年 | 2篇 |
1973年 | 2篇 |
1959年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1505条查询结果,搜索用时 31 毫秒
41.
The present work is intended as a first step towards applying semidefinite programming models and tools to discrete lot-sizing problems including sequence-dependent changeover costs and times. Such problems can be formulated as quadratically constrained quadratic binary programs. We investigate several semidefinite relaxations by combining known reformulation techniques recently proposed for generic quadratic binary problems with problem-specific strengthening procedures developed for lot-sizing problems. Our computational results show that the semidefinite relaxations consistently provide lower bounds of significantly improved quality as compared with those provided by the best previously published linear relaxations. In particular, the gap between the semidefinite relaxation and the optimal integer solution value can be closed for a significant proportion of the small-size instances, thus avoiding to resort to a tree search procedure. The reported computation times are significant. However improvements in SDP technology can still be expected in the future, making SDP based approaches to discrete lot-sizing more competitive. 相似文献
42.
43.
44.
从一般线性群GL(n,F)和对称群Sn上的困难问题出发,构造了几个密钥交换算法,新算法具有更高的效率.同时,指出基于一般线性群的密钥交换算法的安全性直接依赖于广义矩阵覆盖问题,基于对称群的密钥交换协议的安全性直接依赖于置换群上的共轭问题. 相似文献
45.
46.
m次幂等矩阵的等价条件 总被引:1,自引:0,他引:1
陈益智 《数学的实践与认识》2011,41(23)
利用矩阵的秩和齐次线性方程组解空间的维数,给出了m(m≥2)次幂等矩阵的一些等价条件,推广了2,3次幂等矩阵的相应结果.此外,所获结果还给推广到了m次幂等线性变换中. 相似文献
47.
本文研究了可加稳定过程的自相交局部时的问题.利用Borel–Canteil引理等方法,得到可加稳定过程的自相交局部时的Hlder上界,推广了文献[5]中的结果. 相似文献
48.
Additive hazards model with random effects is proposed for modelling the correlated failure time data when focus is on comparing the failure times within clusters and on estimating the correlation between failure times from the same cluster, as well as the marginal regression parameters. Our model features that, when marginalized over the random effect variable, it still enjoys the structure of the additive hazards model. We develop the estimating equations for inferring the regression parameters. The proposed estimators are shown to be consistent and asymptotically normal under appropriate regularity conditions. Furthermore, the estimator of the baseline hazards function is proposed and its asymptotic properties are also established. We propose a class of diagnostic methods to assess the overall fitting adequacy of the additive hazards model with random effects. We conduct simulation studies to evaluate the finite sample behaviors of the proposed estimators in various scenarios. Analysis of the Diabetic Retinopathy Study is provided as an illustration for the proposed method. 相似文献
49.
以同向啮合双螺杆挤出机为反应器,采用苯乙烯和异戊二烯为聚合单体,以正丁基锂为引发剂,采用三次加料法合成苯乙烯/异戊二烯/苯乙烯(SIS)三嵌段热塑性弹性体.氢核磁共振(1H NMR)谱分析结果表明,共聚物中聚异戊二烯嵌段以1,4-结构为主.采用四氧化锇催化双氧水氧化降解聚合物分子链,利用凝胶渗透色谱对氧化降解后的聚苯乙烯碎片进行分析,证明共聚物分子为(聚苯乙烯-聚异戊二烯-聚苯乙烯)(PS-PI-PS)三嵌段结构.动态力学分析(DMA)及透射电子显微镜(TEM)分析结果表明,SIS具有两相分离结构.拉伸试验结果表明,共聚物拉伸强度与苯乙烯含量有关. 相似文献
50.
Eckhard Steffen 《Journal of Graph Theory》2015,78(3):195-206
Let G be a bridgeless cubic graph. Consider a list of k 1‐factors of G. Let be the set of edges contained in precisely i members of the k 1‐factors. Let be the smallest over all lists of k 1‐factors of G. Any list of three 1‐factors induces a core of a cubic graph. We use results on the structure of cores to prove sufficient conditions for Berge‐covers and for the existence of three 1‐factors with empty intersection. Furthermore, if , then is an upper bound for the girth of G. We also prove some new upper bounds for the length of shortest cycle covers of bridgeless cubic graphs. Cubic graphs with have a 4‐cycle cover of length and a 5‐cycle double cover. These graphs also satisfy two conjectures of Zhang 18 . We also give a negative answer to a problem stated in 18 . 相似文献