首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8598篇
  免费   1178篇
  国内免费   999篇
化学   2102篇
晶体学   25篇
力学   898篇
综合类   97篇
数学   4715篇
物理学   2938篇
  2024年   24篇
  2023年   137篇
  2022年   272篇
  2021年   253篇
  2020年   365篇
  2019年   324篇
  2018年   283篇
  2017年   310篇
  2016年   320篇
  2015年   283篇
  2014年   422篇
  2013年   664篇
  2012年   467篇
  2011年   546篇
  2010年   447篇
  2009年   599篇
  2008年   599篇
  2007年   559篇
  2006年   512篇
  2005年   421篇
  2004年   340篇
  2003年   333篇
  2002年   299篇
  2001年   277篇
  2000年   256篇
  1999年   232篇
  1998年   235篇
  1997年   185篇
  1996年   161篇
  1995年   85篇
  1994年   72篇
  1993年   60篇
  1992年   65篇
  1991年   49篇
  1990年   34篇
  1989年   40篇
  1988年   30篇
  1987年   28篇
  1986年   24篇
  1985年   27篇
  1984年   26篇
  1983年   13篇
  1982年   17篇
  1981年   16篇
  1980年   14篇
  1979年   13篇
  1978年   14篇
  1977年   4篇
  1975年   4篇
  1972年   3篇
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
1.
《Mendeleev Communications》2022,32(4):534-536
Correlation times and diffusion coefficients of water molecules were measured for the first time by 1H spin relaxation and pulsed field gradient NMR in Li+, Na+ and Cs+ ionic forms of Nafion 117 membrane. Hydration numbers of Li+, Na+ and Cs+ cations were calculated. It was shown that at high humidity macroscopic transfer is controlled by the local translational motion of water molecules.  相似文献   
2.
3.
4.
G. Peruginelli 《代数通讯》2018,46(11):4724-4738
We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring.  相似文献   
5.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.  相似文献   
6.
In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.  相似文献   
7.
Erosion and sediments transport processes have a great impact on industrial structures and on water quality. Despite its limitations, the Saint‐Venant‐Exner system is still (and for sure for some years) widely used in industrial codes to model the bedload sediment transport. In practice, its numerical resolution is mostly handled by a splitting technique that allows a weak coupling between hydraulic and morphodynamic distinct softwares but may suffer from important stability issues. In recent works, many authors proposed alternative methods based on a strong coupling that cure this problem but are not so trivial to implement in an industrial context. In this work, we then pursue 2 objectives. First, we propose a very simple scheme based on an approximate Riemann solver, respecting the strong coupling framework, and we demonstrate its stability and accuracy through a number of numerical test cases. However, second, we reinterpret our scheme as a splitting technique and we extend the purpose to propose what should be the minimal coupling that ensures the stability of the global numerical process in industrial codes, at least, when dealing with collocated finite volume method. The resulting splitting method is, up to our knowledge, the only one for which stability properties are fully demonstrated.  相似文献   
8.
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号