全文获取类型
收费全文 | 11257篇 |
免费 | 1475篇 |
国内免费 | 645篇 |
专业分类
化学 | 1068篇 |
晶体学 | 27篇 |
力学 | 1145篇 |
综合类 | 406篇 |
数学 | 7538篇 |
物理学 | 3193篇 |
出版年
2024年 | 23篇 |
2023年 | 123篇 |
2022年 | 263篇 |
2021年 | 312篇 |
2020年 | 263篇 |
2019年 | 259篇 |
2018年 | 318篇 |
2017年 | 435篇 |
2016年 | 538篇 |
2015年 | 360篇 |
2014年 | 645篇 |
2013年 | 771篇 |
2012年 | 611篇 |
2011年 | 657篇 |
2010年 | 529篇 |
2009年 | 684篇 |
2008年 | 733篇 |
2007年 | 746篇 |
2006年 | 614篇 |
2005年 | 566篇 |
2004年 | 490篇 |
2003年 | 439篇 |
2002年 | 418篇 |
2001年 | 378篇 |
2000年 | 331篇 |
1999年 | 280篇 |
1998年 | 242篇 |
1997年 | 211篇 |
1996年 | 206篇 |
1995年 | 138篇 |
1994年 | 100篇 |
1993年 | 98篇 |
1992年 | 88篇 |
1991年 | 60篇 |
1990年 | 60篇 |
1989年 | 36篇 |
1988年 | 47篇 |
1987年 | 39篇 |
1986年 | 40篇 |
1985年 | 44篇 |
1984年 | 38篇 |
1983年 | 20篇 |
1982年 | 27篇 |
1981年 | 10篇 |
1980年 | 14篇 |
1979年 | 13篇 |
1978年 | 14篇 |
1977年 | 11篇 |
1976年 | 11篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
971.
本文针对广义线性多乘积极小化问题,通过一系列的线性规划问题的解提出一种求其全局最优解的完全多项式时间近似算法,并给出该算法的计算复杂性,且数值算例验证该算法是可行的. 相似文献
972.
Paweł SZAFRANIEC 《数学物理学报(B辑英文版)》2017,37(4):1048-1060
In this paper we prove the existence and uniqueness of a weak solution for a dynamic electo-viscoelastic problem that describes a contact between a body and a foundation. We assume the body is made from thermoviscoelastic material and consider nonmonotone boundary conditions for the contact. We use recent results from the theory of hemivariational inequalities and the fixed point theory. 相似文献
973.
本文研究了弱Hopf-Galois扩张的扩张模.利用忠实平坦的弱Hopf-Galois扩张理论,研究了弱Hopf代数上的Militaru-Stefan提升定理,推广了文献[10]中的相应结果.进一步地,通过诱导模的自同态环的cleft扩张刻画了弱稳定模. 相似文献
974.
Jørgen Bang‐Jensen Tilde My Christiansen Alessandro Maddaloni 《Journal of Graph Theory》2017,85(2):545-567
The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1]. 相似文献
975.
Local and parallel finite element algorithm for stationary incompressible magnetohydrodynamics 下载免费PDF全文
Yuhong Zhang Yanren Hou Li Shan Xiaojing Dong 《Numerical Methods for Partial Differential Equations》2017,33(5):1513-1539
This article presents a local and parallel finite element method for the stationary incompressible magnetohydrodynamics problem. The key idea of this algorithm comes from the two‐grid discretization technique. Specifically, we solve the nonlinear system on a global coarse mesh, and then solve a series of linear problems on several subdomains in parallel. Furthermore, local a priori estimates are obtained on a general shape regular grid. The efficiency of the algorithm is also illustrated by some numerical experiments.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1513–1539, 2017 相似文献
976.
The inverse problems of textile materials design on heat and moisture transfer properties are important and indispensable in applications in the body-clothing-environment system. We present an inverse problem of textile porosity determination (IPTPD) based on a nonlinear heat and moisture transfer model. Adopting the idea of the least-squares, the mathematical formulation of IPTPD is deduced to a regularized optimization problem with collocation method applied. The continuity of the regularized minimization problem is proved. By means of genetic algorithm (GA), the approximate solution of the IPTPD is numerically obtained. To reduce the computational cost, an improved algorithm based on BP neural network with GA is proposed in the numerical simulation. Compared with the direct GA searching, the computational cost is greatly reduced, which presents a similar result. 相似文献
977.
《Discrete Mathematics》2017,340(12):2889-2899
978.
Chillumuntala Jayaram 《代数通讯》2017,45(6):2394-2400
In this paper we establish some characterizations for weak π-rings. 相似文献
979.
In this article, a multiobjective problem with a feasible set defined by inequality, equality and set constraints is considered, where the objective and constraint functions are locally Lipschitz. Several constraint qualifications are given and the relations between them are analyzed. We establish Kuhn-Tucker and strong Kuhn-Tucker necessary optimality conditions for (weak) quasi e?ciency in terms of the Clarke subdifferential. By using two new classes of generalized convex functions, su?cient conditions for local (weak) quasi e?cient are also provided. Furthermore, we study the Mond-Weir type dual problem and establish weak, strong and converse duality results. 相似文献
980.
Jueyou Li Guo Chen Zhiyou Wu Xing He 《Mathematical Methods in the Applied Sciences》2017,40(4):1201-1213
This paper focuses on a distributed optimization problem associated with a time‐varying multi‐agent network with quantized communication, where each agent has local access to its convex objective function, and cooperatively minimizes a sum of convex objective functions of the agents over the network. Based on subgradient methods, we propose a distributed algorithm to solve this problem under the additional constraint that agents can only communicate quantized information through the network. We consider two kinds of quantizers and analyze the quantization effects on the convergence of the algorithm. Furthermore, we provide explicit error bounds on the convergence rates that highlight the dependence on the quantization levels. Finally, some simulation results on a l1‐regression problem are presented to demonstrate the performance of the algorithm. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献