首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1852篇
  免费   62篇
  国内免费   7篇
化学   1158篇
晶体学   7篇
力学   33篇
数学   262篇
物理学   339篇
无线电   122篇
  2023年   11篇
  2022年   33篇
  2021年   39篇
  2020年   33篇
  2019年   25篇
  2018年   38篇
  2017年   27篇
  2016年   59篇
  2015年   42篇
  2014年   49篇
  2013年   95篇
  2012年   76篇
  2011年   85篇
  2010年   54篇
  2009年   48篇
  2008年   94篇
  2007年   75篇
  2006年   63篇
  2005年   60篇
  2004年   60篇
  2003年   52篇
  2002年   52篇
  2001年   23篇
  2000年   33篇
  1999年   19篇
  1998年   21篇
  1997年   28篇
  1996年   31篇
  1995年   16篇
  1994年   19篇
  1993年   21篇
  1992年   23篇
  1991年   20篇
  1990年   13篇
  1989年   13篇
  1988年   9篇
  1987年   12篇
  1986年   12篇
  1985年   18篇
  1984年   17篇
  1983年   17篇
  1981年   15篇
  1980年   9篇
  1979年   12篇
  1978年   18篇
  1975年   11篇
  1974年   12篇
  1972年   9篇
  1901年   11篇
  1885年   9篇
排序方式: 共有1921条查询结果,搜索用时 15 毫秒
901.
The synthesis of new monodentate heterocyclic ligands 5-(4-pyridyl)-2-alkyltetrazole (L1a,b) and 4-[5-(2-alkyltetrazole)]aryl-4'-pyridinecarboxylate (L2a,b,c) containing two or three aromatic or heterocyclic rings (tetrazole, pyridine and benzene) and preparation of their corresponding silver(I) and palladium(II) complexes (Ia,b,c and IIa,b,c) are described. The thermal behaviour of the ligands and complexes was characterized by polarizing optical microscopy. The ligands and the complexes Ia,b,c and IIc showed no liquid crystalline phase. The complexes IIa,b showed mesomorphic behaviour, exhibiting smectic A enantiotropic mesomorphism X-ray diffraction measurements for complex Ia showed monodentate coordination of N-pyridine, and no coordination on the nitrogen atoms of the tetrazole ring.  相似文献   
902.
This paper examines numerically the complex classical trajectories of the kicked rotor and the double pendulum. Both of these systems exhibit a transition to chaos, and this feature is studied in complex phase space. Additionally, it is shown that the short-time and long-time behaviours of these two PT-symmetric dynamical models in complex phase space exhibit strong qualitative similarities.  相似文献   
903.
904.
For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Gröbner bases provide a systematic way of doing this. The algebraic method does not, in general, produce all estimable models but it can be shown that it yields models which have minimal average degree in a well-defined sense and in both a weighted and unweighted version. This provides an alternative measure to that based on “aberration” and moreover is applicable to any experimental design. A simple algorithm is given and bounds are derived for the criteria, which may be used to give asymptotic Nyquist-like estimability rates as model and sample sizes increase.  相似文献   
905.
906.
We use heralded single photons to perform an antibunching experiment in which the clicks at the detectors are space-like separated events. The idea of such experiment dates back to the 5th Solvay conference, when it was proposed by Einstein as an expression of his concerns about quantum theory.  相似文献   
907.
We give a new and efficient approximation algorithm for scheduling precedence-constrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes pj/si units of time for machine i with speed si to process job j with processing requirement pj. Precedence constraints between jobs are given in the form of a partial order. If j k, processing of job k cannot start until job j's execution is completed. The objective is to find a non-preemptive schedule to minimize the makespan of the schedule. Chudak and Shmoys (1997, “Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),” pp. 581–590) gave an algorithm with an approximation ratio of O(log m), significantly improving the earlier ratio of due to Jaffe (1980, Theoret. Comput. Sci.26, 1–17). Their algorithm is based on solving a linear programming relaxation. Building on some of their ideas, we present a combinatorial algorithm that achieves a similar approximation ratio but runs in O(n3) time. Our algorithm is based on a new and simple lower bound which we believe is of independent interest.  相似文献   
908.
909.
910.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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