首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1208篇
  免费   29篇
  国内免费   10篇
化学   857篇
晶体学   16篇
力学   30篇
数学   211篇
物理学   133篇
  2022年   8篇
  2021年   9篇
  2020年   13篇
  2019年   19篇
  2018年   6篇
  2016年   20篇
  2015年   24篇
  2014年   33篇
  2013年   42篇
  2012年   51篇
  2011年   67篇
  2010年   51篇
  2009年   34篇
  2008年   64篇
  2007年   59篇
  2006年   72篇
  2005年   49篇
  2004年   43篇
  2003年   38篇
  2002年   37篇
  2001年   29篇
  2000年   21篇
  1999年   17篇
  1998年   24篇
  1997年   22篇
  1996年   18篇
  1995年   18篇
  1994年   19篇
  1993年   18篇
  1992年   14篇
  1991年   13篇
  1990年   16篇
  1989年   15篇
  1988年   10篇
  1987年   16篇
  1985年   14篇
  1984年   18篇
  1983年   14篇
  1982年   13篇
  1981年   17篇
  1980年   17篇
  1979年   6篇
  1978年   12篇
  1977年   17篇
  1976年   9篇
  1975年   10篇
  1972年   10篇
  1971年   9篇
  1970年   7篇
  1926年   7篇
排序方式: 共有1247条查询结果,搜索用时 15 毫秒
1.
2.
We prove that symplectic maps between Riemann surfaces L, M of constant, nonpositive and equal curvature converge to minimal symplectic maps, if the Lagrangian angle for the corresponding Lagrangian submanifold in the cross product space satisfies . If one considers a 4-dimensional K?hler-Einstein manifold of nonpositive scalar curvature that admits two complex structures J, K which commute and assumes that is a compact oriented Lagrangian submanifold w.r.t. J such that the K?hler form w.r.t.K restricted to L is positive and , then L converges under the mean curvature flow to a minimal Lagrangian submanifold which is calibrated w.r.t. . Received: 11 April 2001 / Published online: 29 April 2002  相似文献   
3.
We study a combinatorially defined double complex structure on the ordered chains of any simplicial complex. Its columns are related to the cell complex Kn whose face poset is isomorphic to the subword ordering on words without repetition from an alphabet of size n. This complex is shellable and as an application we give a representation theoretic interpretation for derangement numbers and a related symmetric function considered by Désarménien and Wachs [11].

We analyze the two spectral sequences arising from the double complex in the case of the bar resolution for a group. This spectral sequence converges to the cohomology of the group and provides a method for computing group cohomology in terms of the cohomology of subgroups. Its behavior is influenced by the complex of oriented chains of the simplicial complex of finite subsets of the group, and we examine the Ext class of this complex.  相似文献   

4.
Bionized nanoferrite (BNF) particles with high specific power absorption rates were synthesized in the size range of 20–100 nm by high-pressure homogenization for targeted cancer therapy with alternating magnetic fields. Several strategies were used to conjugate antibodies to the BNF particles. These strategies were compared using an immunoassay to find optimal conditions to reach a high immunoreactivity of the final antibody–particle conjugate.  相似文献   
5.
It is known that every conformai embedding of the disk into the extended complex plane possesses a r2-quasiconformal extension across eachr-level line (the r2-property of a domain). We show here that this is a characteristic property of the disk: any simply connected domain which is not a disk does not admit ther 2-property. Supported by the RiP-program of the Volkswagen-Stiftung in the Mathematisches Forschungsinstitut Oberwolfach.  相似文献   
6.
7.
8.
Lufthansa Technical Training GmbH (LTT) performs training courses for Lufthansa Technik AG as well as for several other international airlines. Courses of about 670 different types are offered of which several hundred take place each year. The course scheduling problem faced by LTT is to construct a yearly schedule which maximizes the profit margin incurred while meeting a variety of complex precedence, temporal, and resource-related constraints. A “good” operational schedule should also meet a number of additional subordinate objectives. We formalize the problem and develop a heuristic scheme along with several priority rules, as well as a local search algorithm to determine well-suited weights for weighted composite rules. The operational planning situation of 1996 served as our major test instance; additional test instances were constructed by modifying this data. Several computational experiments were carried out to evaluate the performance of the algorithms. It turned out that the best so-found schedule is substantially better in terms of the profit margin incurred than the solution manually constructed by LTT.  相似文献   
9.
Summary We prove that the error inn-point Gaussian quadrature, with respect to the standard weight functionw1, is of best possible orderO(n –2) for every bounded convex function. This result solves an open problem proposed by H. Braß and published in the problem section of the proceedings of the 2. Conference on Numerical Integration held in 1981 at the Mathematisches Forschungsinstitut Oberwolfach (Hämmerlin 1982; Problem 2). Furthermore, we investigate this problem for positive quadrature rules and for general product quadrature. In particular, for the special class of Jacobian weight functionsw , (x)=(1–x)(1+x), we show that the above result for Gaussian quadrature is not valid precisely ifw , is unbounded.Dedicated to Prof. H. Braß on the occasion of his 55th birthday  相似文献   
10.
Zusammenfassung Es wird eine neue Methode zur Herstellung von Hydroxyketonen und Diketonen beschrieben, die im ersten Schritt der Reaktionsfolge die Umsetzung von Hydroxycarbonsäureestern mit Phenylsulfonalkylmagnesiumbromid zu -Sulfonylketonen erfordert. Diese werden dann im zweiten Schritt mit Al-Amalgam zu den Hydroxyketonen oder den Halbketalen der Diketone entschwefelt. Mit Hilfe dieser Reaktionsfolge gelang auch, ausgehend von 3,5-Dihydroxy-phenylessigsäureester, die Synthese des bisher noch unbekannten Ringsystems des 2,4-Dioxa-adamantans.Herrn Prof. Dr. habil.Friedrich Asinger zum 60. Geburtstag in freundschaftlicher Verbundenheit zugeeignet36. Mitt.:H. Stetter, J. Gärtner undP. Tacke, Chem. Ber.99, 1435 (1966).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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