全文获取类型
收费全文 | 864篇 |
免费 | 100篇 |
国内免费 | 51篇 |
专业分类
化学 | 336篇 |
晶体学 | 1篇 |
力学 | 20篇 |
综合类 | 17篇 |
数学 | 501篇 |
物理学 | 140篇 |
出版年
2023年 | 14篇 |
2022年 | 11篇 |
2021年 | 20篇 |
2020年 | 29篇 |
2019年 | 27篇 |
2018年 | 24篇 |
2017年 | 30篇 |
2016年 | 27篇 |
2015年 | 34篇 |
2014年 | 35篇 |
2013年 | 68篇 |
2012年 | 22篇 |
2011年 | 41篇 |
2010年 | 50篇 |
2009年 | 42篇 |
2008年 | 36篇 |
2007年 | 36篇 |
2006年 | 54篇 |
2005年 | 46篇 |
2004年 | 26篇 |
2003年 | 39篇 |
2002年 | 20篇 |
2001年 | 26篇 |
2000年 | 18篇 |
1999年 | 22篇 |
1998年 | 20篇 |
1997年 | 17篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 7篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 4篇 |
1982年 | 10篇 |
1981年 | 5篇 |
1980年 | 11篇 |
1979年 | 5篇 |
1978年 | 8篇 |
1977年 | 18篇 |
1976年 | 13篇 |
1975年 | 10篇 |
1974年 | 11篇 |
1973年 | 19篇 |
排序方式: 共有1015条查询结果,搜索用时 140 毫秒
121.
Mai Gehrke John Harding Yde Venema 《Transactions of the American Mathematical Society》2006,358(2):573-590
Let be a variety of monotone bounded lattice expansions, that is, bounded lattices endowed with additional operations, each of which is order preserving or reversing in each coordinate. We prove that if is closed under MacNeille completions, then it is also closed under canonical extensions. As a corollary we show that in the case of Boolean algebras with operators, any such variety is generated by an elementary class of relational structures.
Our main technical construction reveals that the canonical extension of a monotone bounded lattice expansion can be embedded in the MacNeille completion of any sufficiently saturated elementary extension of the original structure.
122.
We give a -approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture on the approximability of this scheduling problem (Skutella, 2016). 相似文献
123.
Sven Jäger 《Operations Research Letters》2018,46(5):505-509
We present a -approximation algorithm for the classical nonpreemptive scheduling problem to minimize the total weighted completion time of jobs on identical parallel machines subject to release dates and precedence constraints, improving upon the previously best known 4-approximation algorithm from 1998. The result carries over to the more general problem with precedence delays and generalizes a recent result by Li (2017) for the problem without release dates or delays. 相似文献
124.
本文提出Toeplitz矩阵填充的四种流形逼近算法。在左奇异向量空间中对已知部分运用最小二乘法逼近,形成新的可行矩阵;并将对角线上的元素分别用均值,l1范数,l∞范数和中间数四种方法逼近使得迭代后的矩阵仍保持Toeplitz结构,节约了奇异向量空间的分解时间。最终找到合理的低秩矩阵来逼近未知的高秩矩阵,进而精确地完成Toeplitz矩阵的填充。理论上,分析了在一定条件下算法的收敛性。实验上,通过取不同的采样密度进行数值实验展示了四种算法的优劣。实验结果说明均值算法和l∞范数算法大多用的时间较少,但是当采样密度和矩阵规模较大时,中间数算法的精度较高。 相似文献
125.
126.
《Journal of Graph Theory》2018,87(3):285-304
We initiate a general study of what we call orientation completion problems. For a fixed class of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in by orienting the (nonoriented) edges in P. Orientation completion problems commonly generalize several existing problems including recognition of certain classes of graphs and digraphs as well as extending representations of certain geometrically representable graphs. We study orientation completion problems for various classes of oriented graphs, including k‐arc‐strong oriented graphs, k‐strong oriented graphs, quasi‐transitive‐oriented graphs, local tournaments, acyclic local tournaments, locally transitive tournaments, locally transitive local tournaments, in‐tournaments, and oriented graphs that have directed cycle factors. We show that the orientation completion problem for each of these classes is either polynomial time solvable or NP‐complete. We also show that some of the NP‐complete problems become polynomial time solvable when the input‐oriented graphs satisfy certain extra conditions. Our results imply that the representation extension problems for proper interval graphs and for proper circular arc graphs are polynomial time solvable. The latter generalizes a previous result. 相似文献
127.
矩阵填充是指利用矩阵的低秩特性而由部分观测元素恢复出原矩阵,在推荐系统、信号处理、医学成像、机器学习等领域有着广泛的应用。采用精确线搜索的交替最速下降法由于每次迭代计算量小因而对大规模问题的求解非常有效。本文在其基础上采用分离地精确线搜索,可使得每次迭代下降更多但计算量相同,从而可望进一步提高计算效率。本文分析了新算法的收敛性。数值结果也表明所提出的算法更加有效。 相似文献
128.
129.
Guohua Wan Sudheer R. Vakati Joseph Y.-T. Leung Michael Pinedo 《European Journal of Operational Research》2010
We consider several two-agent scheduling problems with controllable job processing times, where agents A and B have to share either a single machine or two identical machines in parallel while processing their jobs. The processing times of the jobs of agent A are compressible at additional cost. The objective function for agent B is always the same, namely a regular function fmax. Several different objective functions are considered for agent A, including the total completion time plus compression cost, the maximum tardiness plus compression cost, the maximum lateness plus compression cost and the total compression cost subject to deadline constraints (the imprecise computation model). All problems are to minimize the objective function of agent A subject to a given upper bound on the objective function of agent B. These problems have various applications in computer systems as well as in operations management. We provide NP-hardness proofs for the more general problems and polynomial-time algorithms for several special cases of the problems. 相似文献
130.
In this paper, several recursive constructions for directed difference family and perfect directed difference family are presented by means of difference matrix and incomplete difference matrix. Finally the necessary and sufficient conditions for the existence of a (gv, g, 3, λ)-directed difference family in Zgv are established. As a consequence, the necessary and sufficient conditions for the existence of a cyclic directed group divisible design with block size three and type gv are obtained. 相似文献