首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3195篇
  免费   54篇
  国内免费   42篇
化学   1806篇
晶体学   9篇
力学   114篇
数学   584篇
物理学   778篇
  2020年   26篇
  2019年   26篇
  2018年   20篇
  2016年   38篇
  2015年   20篇
  2014年   42篇
  2013年   154篇
  2012年   102篇
  2011年   129篇
  2010年   75篇
  2009年   60篇
  2008年   112篇
  2007年   118篇
  2006年   136篇
  2005年   116篇
  2004年   119篇
  2003年   118篇
  2002年   101篇
  2001年   85篇
  2000年   84篇
  1999年   45篇
  1998年   43篇
  1997年   55篇
  1996年   62篇
  1995年   66篇
  1994年   52篇
  1993年   79篇
  1992年   44篇
  1991年   52篇
  1990年   49篇
  1989年   49篇
  1988年   41篇
  1987年   50篇
  1986年   29篇
  1985年   59篇
  1984年   40篇
  1983年   49篇
  1982年   48篇
  1981年   50篇
  1980年   54篇
  1979年   47篇
  1978年   43篇
  1977年   53篇
  1976年   30篇
  1975年   43篇
  1974年   37篇
  1973年   34篇
  1972年   35篇
  1971年   20篇
  1966年   19篇
排序方式: 共有3291条查询结果,搜索用时 281 毫秒
991.
Improving Hit-and-Run is a random search algorithm for global optimization that at each iteration generates a candidate point for improvement that is uniformly distributed along a randomly chosen direction within the feasible region. The candidate point is accepted as the next iterate if it offers an improvement over the current iterate. We show that for positive definite quadratic programs, the expected number of function evaluations needed to arbitrarily well approximate the optimal solution is at most O(n5/2) wheren is the dimension of the problem. Improving Hit-and-Run when applied to global optimization problems can therefore be expected to converge polynomially fast as it approaches the global optimum.Paper presented at the II. IIASA-Workshop on Global Optimization, December 9–14, 1990, Sopron (Hungary).  相似文献   
992.
993.
2 O during two airborne polar stratospheric campaigns in January and March 1997. These species were detected using integration periods of 1 s with a precision of ±2%(3σ) and a calibration accuracy of ±2.8% during a total of 11 measurement flights up to a maximum altitude of 12.5 km. More recently all three channels have been operated simultaneously for CO, CH4, and N2O with comparable results. Received: 5 March 1998  相似文献   
994.
An aromatic polyimide oligomer, poly(1,4-phenyleneoxy-1,3-phenylene pyromellitimide) (PMDA-3,4'-ODA), was synthesized from pyromellitic dianhydride (PMDA) and 3,4'-oxydianiline (3,4'-ODA) via a melt-polymerization method. This method permits growth of PMDA-3,4'-ODA lamellar crystals and the crystal structure can be studied via electron diffraction (ED) and wide-angle x-ray diffraction (WAXD) experiments. Our structure analysis indicates that this polyimide possesses a two-chain orthorhombic crystal lattice with dimensions of a = 0.848, b = 0.562, and c = 3.365 nm. It has also been found that poly(amic acid) precursors with little imidization possess the same ab lateral lattice packing, but statistical departure from the ordered packing along the c-direction. Upon increasing the degree of imidization through annealing at elevated temperatures, the order along the c-axis was progressively enhanced. Increasing the annealing temperature caused the dimensions of the a- and the b-axes to expand while the crystal correlation lengths decreased laterally. Simultaneously the dimension of the c-axis shrinks with an increase of the crystal correlation length along the chain direction. Crystal morphological study via transmission electron microscopy (TEM) indicates a mainly lamellar crystal texture with different thicknesses depending upon the polymerization conditions. The end lamellar surface is usually smooth. After annealing at elevated temperatures, the lamellar end surfaces become rough, which may be due to chain motion along the c-axis. The annealed PMDA-3,4'-ODA lamellar crystals still show a large amount of defects. © 1994 John Wiley & Sons, Inc.  相似文献   
995.
996.
997.
This paper examines a partial match retrieval scheme which supports range queries for highly dynamic databases. The scheme relies on order preserving multi-attribute hashing. In general, designing optimal indexes is NP-hard. Greedy algorithms used to determine the optimal indexes for simple partial match queries are not directly applicable because there are a larger number of queries to consider in determining the optimal indexes. In this paper we present heuristic algorithms which provide near-optimal solutions. The optimisation scheme we propose can be used to design other dynamic file structures such as the grid file, BANG file and multilevel grid file to further enhance their retrieval performance taking into consideration the query distribution.  相似文献   
998.
999.
On the Fourier Spectra of Distributions in Clifford Analysis   总被引:1,自引:1,他引:0  
In recent papers by Brackx, Delanghe and Sommen, some fundamental higher dimensional distributions have been reconsidered in the framework of Clifford analysis, eventually leading to the introduction of four broad classes of new distributions in Euclidean space. In the current paper we continue the in-depth study of these distributions, more specifically the study of their behaviour in frequency space, thus extending classical results of harmonic analysis.  相似文献   
1000.
A weak form of the constructively important notion of locatedness is lifted from the context of a metric space to that of a uniform space. Certain fundamental results about almost located and totally bounded sets are then proved.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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