首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   542篇
  免费   1篇
  国内免费   1篇
化学   102篇
晶体学   3篇
力学   23篇
数学   204篇
物理学   212篇
  2019年   5篇
  2018年   3篇
  2016年   6篇
  2014年   3篇
  2013年   38篇
  2012年   7篇
  2011年   13篇
  2010年   10篇
  2009年   18篇
  2008年   24篇
  2007年   24篇
  2006年   17篇
  2005年   12篇
  2004年   13篇
  2003年   14篇
  2002年   12篇
  2001年   9篇
  2000年   7篇
  1997年   11篇
  1996年   7篇
  1995年   9篇
  1994年   11篇
  1993年   4篇
  1992年   13篇
  1991年   12篇
  1990年   15篇
  1989年   14篇
  1988年   18篇
  1987年   11篇
  1986年   10篇
  1985年   16篇
  1984年   13篇
  1983年   12篇
  1982年   10篇
  1981年   18篇
  1980年   12篇
  1979年   6篇
  1978年   14篇
  1977年   12篇
  1976年   5篇
  1975年   5篇
  1974年   6篇
  1973年   8篇
  1972年   10篇
  1971年   4篇
  1970年   2篇
  1969年   4篇
  1968年   2篇
  1967年   3篇
  1966年   2篇
排序方式: 共有544条查询结果,搜索用时 15 毫秒
1.
The article discusses transverse vibrations of finite amplitude in an electron-ion ring. Far from the region of linear resonances, an equation is obtained for slowly varying amplitudes, and the conditions are found for the excitation of instability of the negative pressure type. Near the lower boundary of the region of linear instability, the conditions are found under which nonlinearity breaks down the stability of the vibrations with finite amplitudes.Translated from Zhurnal Prikladnoi Mekhaniki i Tekhnicheskoi Fiziki, No. 3, pp. 170–172, May–June, 1974.The author is indebted to B. V. Chirikov for his evaluation of the results of the work.  相似文献   
2.
3.
Friction factors and velocity profiles in turbulent drag reduction can be compared to Newtonian fluid turbulence when the shear viscosity at the wall shear rate is used for the Reynolds number and the local shear viscosity is used for the non-dimensional wall distance. On this basis, an apparent maximum drag reduction asymptote is found which is independent of Reynolds number and type of drag reducing additive. However, no shear viscosity is able to account for the difference between the measured Reynolds stress and the Reynolds stress calculated from the mean velocity profile (the Reynolds stress deficit). If the appropriate local viscosity to use with the velocity fluctuation correlations includes an elongational component, the problem can be resolved. Taking the maximum drag reduction asymptote as a non-Newtonian flow, with this effective viscosity, leads to agreement with the concept of an asymptote only when the solvent viscosity is used in the non-dimensional wall distance.  相似文献   
4.
5.
The acid mediated cyclization of a protected N-acylhydroxyguanidine into the corresponding 3-amino-1,2,4-oxadiazole and confirmation of its structure by single crystal X-ray crystallography is reported herein. The yield of the cyclization is comparable to literature reports utilizing alternative procedures. Importantly, these new conditions provide complementary chemoselectivity to current synthetic procedures which may be useful for the synthesis of 3-amino-1,2,4-oxadiazoles in general.  相似文献   
6.
The gradual covering location problem seeks to establish facilities on a network so as to maximize the total demand covered, allowing partial coverage. We focus on the gradual covering location problem when the demand weights associated with nodes of the network are random variables whose probability distributions are unknown. Using only information on the range of these random variables, this study is aimed at finding the “minmax regret” location that minimizes the worst-case coverage loss. We show that under some conditions, the problem is equivalent to known location problems (e.g. the minmax regret median problem). Polynomial time algorithms are developed for the problem on a general network with linear coverage decay functions.  相似文献   
7.
In this paper, we consider the problem of making simultaneous decisions on the location, service rate (capacity) and the price of providing service for facilities on a network. We assume that the demand for service from each node of the network follows a Poisson process. The demand is assumed to depend on both price and distance. All facilities are assumed to charge the same price and customers wishing to obtain service choose a facility according to a Multinomial Logit function. Upon arrival to a facility, customers may join the system after observing the number of people in the queue. Service time at each facility is assumed to be exponentially distributed. We first present several structural results. Then, we propose an algorithm to obtain the optimal service rate and an approximate optimal price at each facility. We also develop a heuristic algorithm to find the locations of the facilities based on the tabu search method. We demonstrate the efficiency of the algorithms numerically.  相似文献   
8.
9.
The theoretical and experimental status of the Bose–Einstein Condensation (BEC) of trapped quantum well (QW) polaritons in a microcavity is presented. The results of recent experiments that have shown the possibility to create an in-plane harmonic potential trap for a two-dimensional (2D) exciton polaritons in a cavity are discussed. We report the theory of BEC and of the trapped QW exciton polaritons in a microcavity. In addition, we study the BEC of trapped magnetoexciton polaritons in a graphene layer (GL) embedded in an optical microcavity in high magnetic field. In both cases the polaritons are considered to be in a harmonic potential trap. We compare the theoretical results with the existing experiments and discuss the experimental observation of predicted phenomena.  相似文献   
10.
Optimal location with equitable loads   总被引:1,自引:0,他引:1  
The problem considered in this paper is to find p locations for p facilities such that the weights attracted to each facility will be as close as possible to one another. We model this problem as minimizing the maximum among all the total weights attracted to the various facilities. We propose solution procedures for the problem on a network, and for the special cases of the problem on a tree or on a path. The complexity of the problem is analyzed, O(n) algorithms and an O(pn 3) dynamic programming algorithm are proposed for the problem on a path respectively for p=2 and p>2 facilities. Heuristic algorithms (two types of a steepest descent approach and tabu search) are proposed for its solution. Extensive computational results are presented.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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