首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   270207篇
  免费   2237篇
  国内免费   989篇
化学   130912篇
晶体学   4021篇
力学   14346篇
综合类   4篇
数学   49525篇
物理学   74625篇
  2018年   11471篇
  2017年   11239篇
  2016年   8192篇
  2015年   2489篇
  2014年   2658篇
  2013年   8086篇
  2012年   8859篇
  2011年   16762篇
  2010年   9880篇
  2009年   10186篇
  2008年   12327篇
  2007年   14589篇
  2006年   6088篇
  2005年   6645篇
  2004年   6406篇
  2003年   6304篇
  2002年   5241篇
  2001年   5997篇
  2000年   4650篇
  1999年   3647篇
  1998年   2917篇
  1997年   2909篇
  1996年   2912篇
  1995年   2632篇
  1994年   2468篇
  1993年   2379篇
  1992年   2835篇
  1991年   2722篇
  1990年   2662篇
  1989年   2702篇
  1988年   2637篇
  1987年   2644篇
  1986年   2466篇
  1985年   3318篇
  1984年   3321篇
  1983年   2748篇
  1982年   2948篇
  1981年   2881篇
  1980年   2798篇
  1979年   2936篇
  1978年   3170篇
  1977年   2976篇
  1976年   2912篇
  1975年   2767篇
  1974年   2711篇
  1973年   2739篇
  1972年   1776篇
  1968年   1939篇
  1967年   2140篇
  1966年   1937篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
141.
We study closed Einstein 4-manifolds which admit S1 actions of a certain type, i.e., warped products. In particular, we classify them up to isometry when the fixed point of the S1 action satisfies certain natural geometric conditions. The proof uses the Bochner-Weitzenböck formula for 1-forms and the theory of minimal surfaces in 3-manifolds.in final form: 22 January 2003  相似文献   
142.
143.
Kinetic models for chemotaxis, nonlinearly coupled to a Poisson equation for the chemo-attractant density, are considered. Under suitable assumptions on the turning kernel (including models introduced by Othmer, Dunbar and Alt), convergence in the macroscopic limit to a drift-diffusion model is proven. The drift-diffusion models derived in this way include the classical Keller-Segel model. Furthermore, sufficient conditions for kinetic models are given such that finite-time-blow-up does not occur. Examples are given satisfying these conditions, whereas the macroscopic limit problem is known to exhibit finite-time-blow-up. The main analytical tools are entropy techniques for the macroscopic limit as well as results from potential theory for the control of the chemo-attractant density.Present address: Centro de Matemática e Aplicações Fundamentais, Universidade de Lisboa, Av. Prof. Gama Pinto 2, 1649-003, Lisboa, Portugal  相似文献   
144.
We prove under quite general assumptions the existence of a bounded positive solution to the semilinear Schrödinger equation in a two-dimensional exterior domain.  相似文献   
145.
146.
In this paper we study some pseudo-random properties related to the prime factors of integers. We prove some results concerning the well distribution of the greatest prime factor modulo 4, and give some computational insight on the correlations, which seem to be beyond reach of proof.  相似文献   
147.
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].  相似文献   
148.
149.
Given a ring $R$, let $S\subseteq R$ be a pure multiplicative band that is closed under the cubic join operation $x\nabla y = x+y+yx-xyx-yxy.$ We show that $\left( S,\cdot,\nabla\right) $ forms a pure skew lattice if and only if $S$ satisfies the polynomial identity $\left(xy-yx\right)^{2}z = z\left(xy-yx\right)^{2}$. We also examine properties of pure skew lattices in rings.  相似文献   
150.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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