首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   63607篇
  免费   12452篇
  国内免费   4733篇
化学   59306篇
晶体学   711篇
力学   2172篇
综合类   278篇
数学   5163篇
物理学   13162篇
  2024年   113篇
  2023年   623篇
  2022年   1034篇
  2021年   1214篇
  2020年   2373篇
  2019年   3550篇
  2018年   1900篇
  2017年   1545篇
  2016年   4592篇
  2015年   4689篇
  2014年   4883篇
  2013年   5961篇
  2012年   5317篇
  2011年   4540篇
  2010年   4461篇
  2009年   4348篇
  2008年   4023篇
  2007年   3277篇
  2006年   2921篇
  2005年   2775篇
  2004年   2379篇
  2003年   2095篇
  2002年   2739篇
  2001年   1976篇
  2000年   1851篇
  1999年   1038篇
  1998年   581篇
  1997年   517篇
  1996年   483篇
  1995年   424篇
  1994年   410篇
  1993年   358篇
  1992年   298篇
  1991年   268篇
  1990年   267篇
  1989年   187篇
  1988年   152篇
  1987年   100篇
  1986年   114篇
  1985年   87篇
  1984年   50篇
  1983年   51篇
  1982年   48篇
  1981年   33篇
  1980年   20篇
  1979年   15篇
  1978年   10篇
  1976年   13篇
  1975年   11篇
  1957年   7篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
Baker‘s yeast mediated reduction of optically active diketone is described. The two keto groups are efficiently differentiated and the ee value of the recovered material is considerably raised. It affords highly optically active key intermediates efficiently for the synthesis of natural polyhydroxylated agarofuran products.  相似文献   
102.
In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems.  相似文献   
103.
New heuristics for over-constrained flight to gate assignments   总被引:1,自引:0,他引:1  
We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.  相似文献   
104.
This paper is concerned with well‐posedness results for a mathematical model for the transversal vibrations of a two‐dimensional hybrid elastic structure consisting of a rectangular Reissner–Mindlin plate with a Timoshenko beam attached to its free edge. The model incorporates linear dynamic feedback controls along the interface between the plate and the beam. Classical semigroup methods are employed to show the unique solvability of the coupled initial‐boundary‐value problem. We also show that the energy associated with the system exhibits the property of strong stability. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
105.
106.
Let f be a smooth map between unit spheres of possibly different dimensions. We prove the global existence and convergence of the mean curvature flow of the graph of f under various conditions. A corollary is that any area‐decreasing map between unit spheres (of possibly different dimensions) is isotopic to a constant map. © 2004 Wiley Periodicals, Inc.  相似文献   
107.
We derive some useful and easily computable necessary conditionsfor the existence of a positive semi-definite solution to thealgebraic Ricatti equation (ARE). A motivating example is givento highlight the usefulness of the conditions for controllerand observer designs for nonlinear systems. Further, an upperbound on the trace of the solution to the ARE is also derived.  相似文献   
108.
Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K5‐minor has a nowhere zero 4‐flow. Walton and Welsh 19 proved that if a coloopless regular matroid M does not have a minor in {M(K3,3), M*(K5)}, then M admits a nowhere zero 4‐flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K5), M*(K5)}, then M admits a nowhere zero 4‐flow. Our result implies the Jensen and Toft conjecture. © 2005 Wiley Periodicals, Inc. J Graph Theory  相似文献   
109.
110.
in this paper, the classification and realization of complete Lie algebras withcommutative nilpotent radicals are given. From this, some results on the radicals of thesecomplete Lie algebras are obtained.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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