首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   292篇
  免费   5篇
  国内免费   3篇
化学   134篇
晶体学   4篇
力学   9篇
数学   54篇
物理学   99篇
  2021年   4篇
  2020年   3篇
  2019年   2篇
  2018年   2篇
  2017年   6篇
  2016年   14篇
  2015年   4篇
  2014年   10篇
  2013年   15篇
  2012年   18篇
  2011年   11篇
  2010年   9篇
  2009年   8篇
  2008年   7篇
  2007年   14篇
  2006年   12篇
  2005年   5篇
  2004年   13篇
  2003年   8篇
  2002年   8篇
  2001年   4篇
  2000年   4篇
  1999年   10篇
  1998年   3篇
  1997年   4篇
  1996年   7篇
  1995年   2篇
  1994年   3篇
  1993年   6篇
  1992年   7篇
  1991年   5篇
  1990年   8篇
  1989年   3篇
  1988年   5篇
  1987年   3篇
  1986年   2篇
  1985年   6篇
  1984年   5篇
  1983年   4篇
  1982年   4篇
  1981年   4篇
  1980年   3篇
  1979年   2篇
  1978年   5篇
  1975年   6篇
  1973年   2篇
  1971年   2篇
  1969年   1篇
  1968年   1篇
  1964年   1篇
排序方式: 共有300条查询结果,搜索用时 46 毫秒
41.
The use of CO(2) for the preparation of value-added compounds has dramatically increased due to increased global warming concerns. We herein report an electrochemical cell containing a copper cathode and a magnesium anode that effectively converts epoxides and carbon dioxide to cyclic carbonates under mild electrochemical conditions at atmospheric pressure.  相似文献   
42.
We establish the best possible condition for point singularities to be removable for nonlinear elliptic equations in divergent form with lower order terms from the non-linear Kato classes.   相似文献   
43.
Stochastic programming for nurse assignment   总被引:1,自引:0,他引:1  
We present a brief overview of four phases of nurse planning. For the last phase, which assigns nurses to patients, a stochastic integer programming model is developed. A Benders’ decomposition approach is proposed to solve this problem, and a greedy algorithm is employed to solve the recourse subproblem. To improve the efficiency of the algorithm, we introduce sets of valid inequalities to strengthen a relaxed master problem. Computational results are provided based upon data from Baylor Regional Medical Center in Grapevine, Texas. Finally, areas of future research are discussed.  相似文献   
44.
45.
The multiple judge,multiple criteria ranking problem: A fuzzy set approach   总被引:1,自引:0,他引:1  
This paper investigates the problem of selecting, from a set of issues, those which best satisfy a collection of criteria. A group of judges have fuzzy sets defined over the issues, for each criterion, whose values lie in a finite linearly ordered set L. These judges also have fuzzy sets defined over the set of criteria. The paper discusses methods of aggregating all the fuzzy sets into one fuzzy set μ, defined on the issues, so that μA?L gives the final ranking for issue A.  相似文献   
46.
Mixtures of AgI and PbI2 form a phase stable at temperatures above 125°C with a substantial solid solubility about the composition 67% AgI, this phase exhibits a high electrical conductivity (~0.1S m-1). A proposal is made for the basic form of the AgI-PbI2 equilibrium diagram below 200°C, and comparison made to the systems AgI-ZnI2 and AgI-CdI2.  相似文献   
47.
All knownvon Neumann-Morgenstern solutions to the majority rule game, (n, k), wheren/2, are discussed. The partitioning and discrimination to the limit solutions are expanded. The problem of interpreting experimental outcomes to games is discussed. We introduce the notion of a historical context of a conflict situation to aid in the prediction and explanation of solutions. Experimental results for the (4, 3) and (5, 3) games are used in our discussion.  相似文献   
48.
49.
50.
We examine the problem of embedding a graph H as the center of a supergraph G, and we consider what properties one can restrict G to have. Letting A(H) denote the smallest difference ∣V(G)∣ - ∣V(H)∣ over graphs G having center isomorphic to H it is demonstrated that A(H) ≤ 4 for all H, and for 0 ≤ i ≤ 4 we characterize the class of trees T with A(T) = i. for n ≥ 2 and any graph H, we demonstrate a graph G with point and edge connectivity equal to n, with chromatic number X(G) = n + X(H), and whose center is isomorphic to H. Finally, if ∣V(H)∣ ≥ 9 and k ≥ ∣V(H)∣ + 1, then for n sufficiently large (with n even when k is odd) we can construct a k-regular graph on n vertices whose center is isomorphic to H.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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