首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4694篇
  免费   553篇
  国内免费   364篇
化学   187篇
晶体学   8篇
力学   407篇
综合类   111篇
数学   3639篇
物理学   1259篇
  2023年   46篇
  2022年   55篇
  2021年   97篇
  2020年   108篇
  2019年   117篇
  2018年   113篇
  2017年   156篇
  2016年   186篇
  2015年   106篇
  2014年   263篇
  2013年   336篇
  2012年   214篇
  2011年   284篇
  2010年   271篇
  2009年   266篇
  2008年   324篇
  2007年   349篇
  2006年   285篇
  2005年   240篇
  2004年   237篇
  2003年   215篇
  2002年   189篇
  2001年   150篇
  2000年   133篇
  1999年   133篇
  1998年   86篇
  1997年   99篇
  1996年   69篇
  1995年   72篇
  1994年   56篇
  1993年   34篇
  1992年   42篇
  1991年   37篇
  1990年   24篇
  1989年   29篇
  1988年   22篇
  1987年   30篇
  1986年   10篇
  1985年   25篇
  1984年   14篇
  1983年   13篇
  1982年   7篇
  1981年   11篇
  1980年   11篇
  1979年   10篇
  1978年   6篇
  1977年   8篇
  1976年   5篇
  1975年   4篇
  1973年   3篇
排序方式: 共有5611条查询结果,搜索用时 15 毫秒
1.
2.
NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy  3, a major upgrade to the original NIFTy  framework. NIFTy  3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy  3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy  3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 .  相似文献   
3.
For a general dyadic grid, we give a Calderón–Zygmund type decomposition, which is the principle fact about the multilinear maximal function on the upper half‐spaces. Using the decomposition, we study the boundedness of . We obtain a natural extension to the multilinear setting of Muckenhoupt's weak‐type characterization. We also partially obtain characterizations of Muckenhoupt's strong‐type inequalities with one weight. Assuming the reverse Hölder's condition, we get a multilinear analogue of Sawyer's two weight theorem. Moreover, we also get Hytönen–Pérez type weighted estimates.  相似文献   
4.
Multistrain diseases, which are infected through individual contacts, pose severe public health threat nowadays. In this paper, we build competitive and mutative two‐strain edge‐based compartmental models using probability generation function (PGF) and pair approximation (PA). Both of them are ordinary differential equations. Their basic reproduction numbers and final size formulas are explicitly derived. We show that the formula gives a unique positive final epidemic size when the reproduction number is larger than unity. We further consider competitive and mutative multistrain diseases spreading models and compute their basic reproduction numbers. We perform numerical simulations that show some dynamical properties of the competitive and mutative two‐strain models.  相似文献   
5.
运用截断方法研究了一类椭圆方程在加权Sobolev空间中解的存在性.主要采用Marcinkiewicz估计,在得到逼近解序列的截断函数先验估计的基础上,通过选取适当的检验函数,对逼近解序列做合适的估计,以此证明重整化解的存在性.  相似文献   
6.
We discuss the motion of substance in a channel containing nodes of a network. Each node of the channel can exchange substance with: (i) neighboring nodes of the channel, (ii) network nodes which do not belong to the channel, and (iii) environment of the network. The new point in this study is that we assume possibility for exchange of substance among flows of substance between nodes of the channel and: (i) nodes that belong to the network but do not belong to the channel and (ii) environment of the network. This leads to an extension of the model of motion of substance and the extended model contains previous models as particular cases. We use a discrete-time model of motion of substance and consider a stationary regime of motion of substance in a channel containing a finite number of nodes. As results of the study, we obtain a class of probability distributions connected to the amount of substance in nodes of the channel. We prove that the obtained class of distributions contains all truncated discrete probability distributions of discrete random variable ω which can take values 0,1,,N. Theory for the case of a channel containing infinite number of nodes is presented in Appendix A. The continuous version of the discussed discrete probability distributions is described in Appendix B. The discussed extended model and obtained results can be used for the study of phenomena that can be modeled by flows in networks: motion of resources, traffic flows, motion of migrants, etc.  相似文献   
7.
8.
This study proposes an improved physical model to predict sand deposition at high temperature in gas turbine components. This model differs from its predecessor (Sreedharan and Tafti, 2011) by improving the sticking probability by accounting for the energy losses during particle-wall collision based on our previous work (Singh and Tafti, 2013). This model predicts the probability of sticking based on the critical viscosity approach and collision losses during a particle–wall collision. The current model is novel in the sense that it predicts the sticking probability based on the impact velocity along with the particle temperature. To test the model, deposition from a sand particle laden jet impacting on a flat coupon geometry is computed and the results obtained from the numerical model are compared with experiments (Delimont et al., 2014) conducted at Virginia Tech, on a similar geometry and flow conditions, for jet temperatures of 950 °C, 1000 °C and 1050 °C. Large Eddy Simulations (LES) are used to model the flow field and heat transfer, and sand particles are modeled using a discrete Lagrangian framework. Results quantify the impingement and deposition for 20–40 μm sand particles. The stagnation region of the target coupon is found to experience most of the impingement and deposition. For 950 °C jet temperature, around 5% of the particle impacting the coupon deposit while the deposition for 1000 °C and 1050 °C is 17% and 28%, respectively. In general, the sticking efficiencies calculated from the model show good agreement with the experiments for the temperature range considered.  相似文献   
9.
在混凝土层析成像中,为了提高反演的准确性和计算效率,针对共轭梯度算法提出一种加权算法——概率加权共轭梯度算法.新算法不同于常规的加权算法,权重是加在成像单元上而不是方程上.为取得较好的权重因子和较好的迭代初始值,采用IART算法的权重和迭代初始值的选取方法.模拟算例和混凝土试验均表明这种加权算法的可行性.  相似文献   
10.
《Physics letters. A》2020,384(28):126725
Everettian Quantum Mechanics, or the Many Worlds Interpretation, lacks an explanation for quantum probabilities. We show that the values given by the Born rule equal projection factors, describing the contraction of Lebesgue measures in orthogonal projections from the complex line of a quantum state to eigenspaces of an observable. Unit total probability corresponds to a complex Pythagorean theorem: the measure of a subset of the complex line is the sum of the measures of its projections on all eigenspaces.Postulating the existence of a continuum infinity of identical quantum universes, all with the same quasi-classical worlds, we show that projection factors give relative amounts of worlds. These appear as relative frequencies of results in quantum experiments, and play the role of probabilities in decisions and inference. This solves the probability problem of Everett's theory, allowing its preferred basis problem to be solved as well, and may help settle questions about the nature of probability.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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