首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   303篇
  免费   55篇
  国内免费   16篇
化学   11篇
力学   25篇
综合类   4篇
数学   288篇
物理学   46篇
  2024年   2篇
  2023年   1篇
  2022年   6篇
  2021年   7篇
  2020年   3篇
  2019年   10篇
  2018年   11篇
  2017年   9篇
  2016年   18篇
  2015年   15篇
  2014年   21篇
  2013年   24篇
  2012年   16篇
  2011年   15篇
  2010年   13篇
  2009年   17篇
  2008年   22篇
  2007年   15篇
  2006年   10篇
  2005年   18篇
  2004年   14篇
  2003年   8篇
  2002年   15篇
  2001年   16篇
  2000年   11篇
  1999年   13篇
  1998年   9篇
  1997年   7篇
  1996年   4篇
  1995年   1篇
  1994年   1篇
  1993年   2篇
  1992年   2篇
  1991年   2篇
  1989年   1篇
  1988年   2篇
  1987年   3篇
  1986年   3篇
  1985年   3篇
  1984年   2篇
  1980年   1篇
  1974年   1篇
排序方式: 共有374条查询结果,搜索用时 218 毫秒
1.
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.  相似文献   
2.
关于惠斯登电桥测电阻倍率与检流计灵敏度关系的研究   总被引:1,自引:0,他引:1  
在相同的设备条件下,电桥临近平衡时灵敏度最高的最佳倍率是:组成倍率的两个电阻的数量级与待测电阻数量级相等,且比值为1的倍率。  相似文献   
3.
Several new families of c‐Bhaskar Rao designs with block size 4 are constructed. The necessary conditions for the existence of a c‐BRD (υ,4,λ) are that: (1)λmin=?λ/3 ≤ c ≤ λ and (2a) c≡λ (mod 2), if υ > 4 or (2b) c≡ λ (mod 4), if υ = 4 or (2c) c≠ λ ? 2, if υ = 5. It is proved that these conditions are necessary, and are sufficient for most pairs of c and λ; in particular, they are sufficient whenever λ?c ≠ 2 for c > 0 and whenever c ? λmin≠ 2 for c < 0. For c < 0, the necessary conditions are sufficient for υ> 101; for the classic Bhaskar Rao designs, i.e., c = 0, we show the necessary conditions are sufficient with the possible exception of 0‐BRD (υ,4,2)'s for υ≡ 4 (mod 6). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 361–386, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10009  相似文献   
4.
In this article, a kind of auxiliary design BSA* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007  相似文献   
5.
本在无向网络中,建立了带有边集限制的最均匀支撑树问题的网络模型.中首先解决最均匀支撑树问题,并给出求无向网络中最均匀支撑树的多项式时间算法;然后,给出了求无向网络中带有边集限制的最小树多项式时间算法;最后,在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题.  相似文献   
6.
Balanced sampling plans excluding contiguous units (or BSEC) were first introduced by Hedayat, Rao, and Stufken in 1988. In this paper, we generalize the concept of a cyclic BSEC to a cyclic balanced sampling plan to avoid the selection of adjacent units (or CBSA for short) and use Langford and extended Langford sequences to construct a cyclic BSA(ν, 3, λ; α) with α = 2, 3. We finally establish the necessary and sufficient conditions for the existence of a cyclic BSA(ν, 3, λ; α) where α = 2, 3. © 2005 Wiley Periodicals, Inc. J Combin Designs.  相似文献   
7.
从提高灵敏度角度出发,理论上分析了无电极电光电场传感器电极长度与灵敏度和带宽的关系.通过比较不同结构的传输函数,验证平衡检测方式的可行性,最后选取使用平衡检测的三端口结构作为实验器件结构,从而为器件制作的可行性方案从理论上作了验证.  相似文献   
8.
Perrin  P.  Monfreux  N.  Dufour  A. L.  Lafuma  F. 《Colloid and polymer science》1998,276(10):945-948
Highly hydrophobically modified (with n-dodecylamide chain) linear poly(acrylic acid)s (HHMPAAH) and poly(sodium acrylate)s (HHMPAANa) with various degrees of grafting (τ) were synthesized and used as emulsifiers of the n-dodecane/water system. The type of emulsion, oil in water (O/W) or water in oil (W/O), was investigated as a function of the polymer chemical structure (τ, salt or acid form of the copolymer) and aqueous phase electrolyte concentration (NaNO3). Increasing τ and/or salt concentration was found to favor the formation of inverse emulsions. Direct liquid–liquid dispersions are more likely to form with poly(sodium acrylate)s than with poly(acrylic acid)s. Hence, field variables such as τ, pH and ionic strength are relevant parameters to control emulsion type. Moreover, a balanced polyelectrolyte neither soluble in oil nor in water was synthesized for the first time. With this original emulsifier, the dispersion type was found to change from O/W to W/O with polymer salting out. The work provides convenient model system for fundamental studies of polymer conformation at liquid–liquid interfaces. Received: 31 March 1998 Accepted: 30 April 1998  相似文献   
9.
In this paper we define wheel matrices and characterize some properties of matrices that are perfect but not balanced. A consequence of our results is that if a matrixA is perfect then we can construct a polynomial number of submatricesA I,,A n ofA such thatA is balanced if and only if all the submatricesA 1,,A n ofA are perfect. This implies that if the problem of testing perfection is polynomially solvable, then so is the problem of testing balancedness.Partial support under NSF Grants DMS-8606188, ECS-8800281 and DDM-8800281.  相似文献   
10.
In this article, we mainly consider the existence problem of a group divisible design GDD ( 3 , 4 , n + s ) of type 1 n s 1 . We present two recursive constructions for this configuration using candelabra systems and construct explicitly a few small examples admitting given automorphism groups. As an application, several new infinite classes of GDD ( 3 , 4 , n + s ) s of type 1 n s 1 are produced. Meanwhile a few new infinite families on candelabra quadruple systems with group sizes being odd and stem size greater than one are also obtained.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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