首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   19271篇
  免费   1785篇
  国内免费   2162篇
化学   7664篇
晶体学   56篇
力学   1528篇
综合类   369篇
数学   10452篇
物理学   3149篇
  2024年   42篇
  2023年   225篇
  2022年   425篇
  2021年   459篇
  2020年   627篇
  2019年   526篇
  2018年   560篇
  2017年   636篇
  2016年   719篇
  2015年   582篇
  2014年   819篇
  2013年   1455篇
  2012年   891篇
  2011年   1050篇
  2010年   942篇
  2009年   1211篇
  2008年   1184篇
  2007年   1160篇
  2006年   1117篇
  2005年   1025篇
  2004年   939篇
  2003年   877篇
  2002年   721篇
  2001年   622篇
  2000年   625篇
  1999年   544篇
  1998年   526篇
  1997年   438篇
  1996年   354篇
  1995年   274篇
  1994年   264篇
  1993年   196篇
  1992年   189篇
  1991年   150篇
  1990年   123篇
  1989年   91篇
  1988年   80篇
  1987年   62篇
  1986年   55篇
  1985年   67篇
  1984年   72篇
  1983年   28篇
  1982年   69篇
  1981年   48篇
  1980年   47篇
  1979年   39篇
  1978年   26篇
  1977年   12篇
  1976年   12篇
  1974年   6篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
凸合成模糊对策的模糊稳定集   总被引:3,自引:1,他引:2  
本建立了凸合成模糊对策的模型,并得到了凸合成模糊对策的模糊稳定集,可由子对策的模糊稳定集表达出来。从而解决了凸合成模糊对策的解的结构问题。  相似文献   
62.
中国邮路问题的一个解法   总被引:6,自引:1,他引:5  
本给出中国邮路问题的一个解法。虽然它仍只是初始方案,但因考虑了问题的足够信息,因而这种方案至少拉近了与最优解的距离。  相似文献   
63.
障碍拟阵图     
Let G be a simple graph and T={S :S is extreme in G}. If M(V(G), T) is a matroid, then G is called an extreme matroid graph. In this paper, we study the properties of extreme matroid graph.  相似文献   
64.
This article deals with a boundary value problem for Laplace equation with a non‐linear and non‐local boundary condition. This problem comes from petroleum engineering and is used to obtain an estimation of well productivity. The non‐linear and non‐local boundary condition is written on the well boundary. On the outer reservoir boundaries, we have both Dirichlet and Neumann conditions. In this paper, we prove the existence and uniqueness of a solution to this problem. The existence is proved by Schauder theorem and the uniqueness is obtained under more restricted conditions, when the involved operator is a contraction. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   
65.
A stochastic approximation algorithm for estimating multichannel coefficients is proposed, and the estimate is proved to converge to the true parameters a.s. up-to a constant scaling factor. The estimate is updated after receiving each new observation, so the output data need not be collected in advance. The input signal is allowed to be dependent and the observation is allowed to be corrupted by noise, but no noise statistics are used in the estimation algorithm.  相似文献   
66.
 用非耦合求解方法计算Level Set函数方程与流体力学方程组,应用重新初始化的Level Set函数确保距离函数性质,流体力学方程组采用二阶精度多介质流波传播差分格式计算,重新初始化方程采用五阶WENO格式计算。并给出了二维可压缩多介质流界面运动的计算结果。  相似文献   
67.
We show that the optomechanical coupling between an optical cavity mode and two movable cavity mirrors is able to entangle two different macroscopic oscillation modes of the mirrors. This continuous variable entanglement is maintained by the light bouncing between the mirrors and is robust against thermal noise. In fact, it could be experimentally demonstrated using present technology. Received 2 September 2002 / Received in final form 10 October 2002 Published online 7 January 2003  相似文献   
68.
The electrophoresis of DNA chains in uncrosslinked polymer solutions with a Brownian dynamics simulation with an anisotropic friction tensor was analyzed. According to the degree of anisotropy, three types of migration behavior are obtained: fluctuation without or with periodicity between U‐shaped and compact conformations, or migration with linear conformation. We found good agreement between our simulation results and the direct observations of DNA by fluorescence microscopy. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 41: 1316–1322, 2003  相似文献   
69.
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.  相似文献   
70.
In the direct simulation Monte‐Carlo (DSMC) method for simulating rarefied gas flows, the velocities of simulator particles that cross a simulation boundary and enter the simulation space are typically generated using the acceptance–rejection procedure that samples the velocities from a truncated theoretical velocity distribution that excludes low and high velocities. This paper analyses an alternative technique, where the velocities of entering particles are obtained by extending the simulation procedures to a region adjacent to the simulation space, and considering the movement of particles generated within that region during the simulation time step. The alternative method may be considered as a form of acceptance–rejection procedure, and permits the generation of all possible velocities, although the population of high velocities is depleted with respect to the theoretical distribution. Nevertheless, this is an improvement over the standard acceptance–rejection method. Previous implementations of the alternative method gave a number flux lower than the theoretical number required. Two methods for obtaining the correct number flux are presented. For upstream boundaries in high‐speed flows, the alternative method is more computationally efficient than the acceptance–rejection method. However, for downstream boundaries, the alternative method is extremely inefficient. The alternative method, with the correct theoretical number flux, should therefore be used in DSMC computations in favour of the acceptance–rejection method for upstream boundaries in high‐speed flows. Copyright © 2003 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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