首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   743篇
  免费   20篇
  国内免费   8篇
化学   568篇
力学   12篇
数学   122篇
物理学   69篇
  2022年   5篇
  2021年   3篇
  2020年   8篇
  2019年   7篇
  2018年   5篇
  2017年   6篇
  2016年   9篇
  2015年   16篇
  2014年   13篇
  2013年   29篇
  2012年   44篇
  2011年   28篇
  2010年   25篇
  2009年   22篇
  2008年   43篇
  2007年   52篇
  2006年   43篇
  2005年   50篇
  2004年   51篇
  2003年   33篇
  2002年   27篇
  2001年   11篇
  2000年   8篇
  1999年   13篇
  1998年   14篇
  1997年   9篇
  1996年   14篇
  1995年   19篇
  1994年   12篇
  1993年   15篇
  1992年   10篇
  1991年   6篇
  1990年   11篇
  1989年   5篇
  1988年   6篇
  1987年   6篇
  1986年   7篇
  1985年   8篇
  1984年   11篇
  1983年   6篇
  1982年   4篇
  1981年   14篇
  1980年   13篇
  1979年   8篇
  1978年   8篇
  1977年   2篇
  1975年   4篇
  1970年   1篇
  1962年   1篇
  1960年   1篇
排序方式: 共有771条查询结果,搜索用时 15 毫秒
61.
62.
Several examples are preseted to show that estimated third-order Møller-Plesset (MP3) relative energies obtained from schemes which assume additivity of correlation and polarization function effects are likely to provide the most reliable energy comparisons in cases where full MP3 calculations with polarization basis sets are not feasible.  相似文献   
63.
An approach is needed to localize in an optimal way a seaport facing different indicators, criteria or objectives sometimes from different groups or individuals. The internal mechanical solution of a Ratio System, producing dimensionless numbers, is preferred to Cost-Benefit or to Weights which most of the time are used to equalize the different units. The ratio system creates the opportunity to use a second approach: a non-subjective Reference Point Theory based on the found ratios. The two approaches form a control on each other. This theory is called MOORA (Multi-Objective Optimization by Ratio Analysis). As an application a ranking is made for the best location of a new seaport or for the expansion of an existing one given a set of objectives to be fulfilled.  相似文献   
64.
65.
66.
This paper considers a simple discrete-time queueing model with two types (classes) of customers (types 1 and 2) each having their own dedicated server (servers A and B resp.). New customers enter the system according to a general independent arrival process, i.e., the total numbers of arrivals during consecutive time slots are i.i.d. random variables with arbitrary distribution. Service times are deterministically equal to 1 slot each. The system uses a “global FCFS” service discipline, i.e., all arriving customers are accommodated in one single FCFS queue, regardless of their types. As a consequence of the “global FCFS” rule, customers of one type may be blocked by customers of the other type, in that they may be unable to reach their dedicated server even at times when this server is idle, i.e., the system is basically non-workconserving. One major aim of the paper is to estimate the negative impact of this phenomenon on the queueing performance of the system, in terms of the achievable throughput, the system occupancy, the idle probability of each server and the delay. As it is clear that customers of different types hinder each other more as they tend to arrive in the system more clustered according to class, the degree of “class clustering” in the arrival process is explicitly modeled in the paper and its very direct impact on the performance measures is revealed. The motivation of our work are systems where this kind of blocking is encountered, such as input-queueing network switches or road splits.  相似文献   
67.
68.
69.
When can one see from the spectrum of a graph whether it is distance-regular or not? We give some new results for when this is the case. As a consequence we find (among others) that the following distance-regular graphs are uniquely determined by their spectrum: The collinearity graphs of the generalized octagons of order (2,1), (3,1) and (4,1), the Biggs-Smith graph, the M 22 graph, and the coset graphs of the doubly truncated binary Golay code and the extended ternary Golay code.  相似文献   
70.
We show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is distance-regular, and in particular that it is a generalized odd graph.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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