首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   684篇
  免费   41篇
  国内免费   57篇
化学   28篇
晶体学   1篇
力学   25篇
综合类   18篇
数学   613篇
物理学   97篇
  2023年   7篇
  2022年   7篇
  2021年   11篇
  2020年   17篇
  2019年   19篇
  2018年   19篇
  2017年   28篇
  2016年   20篇
  2015年   15篇
  2014年   18篇
  2013年   88篇
  2012年   22篇
  2011年   36篇
  2010年   34篇
  2009年   35篇
  2008年   39篇
  2007年   49篇
  2006年   42篇
  2005年   36篇
  2004年   31篇
  2003年   27篇
  2002年   31篇
  2001年   21篇
  2000年   28篇
  1999年   19篇
  1998年   14篇
  1997年   6篇
  1996年   14篇
  1995年   12篇
  1994年   8篇
  1993年   5篇
  1992年   3篇
  1991年   4篇
  1989年   2篇
  1988年   2篇
  1987年   4篇
  1985年   2篇
  1984年   2篇
  1982年   1篇
  1981年   1篇
  1977年   1篇
  1976年   1篇
  1959年   1篇
排序方式: 共有782条查询结果,搜索用时 531 毫秒
1.
2.
3.
The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   
4.
We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products. These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers.  相似文献   
5.
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].  相似文献   
6.
Searching in trees   总被引:1,自引:0,他引:1  
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.  相似文献   
7.
We introduce the concept of quotient in PN spaces and give some examples. We prove some theorems with regard to the completeness of a quotient.  相似文献   
8.
In this paper we construct six-dimensional compact non-Kähler Hamiltonian circle manifolds which satisfy the strong Lefschetz property themselves but nevertheless have a non-Lefschetz symplectic quotient. This provides the first known counterexamples to the question whether the strong Lefschetz property descends to the symplectic quotient. We also give examples of Hamiltonian strong Lefschetz circle manifolds which have a non-Lefschetz fixed point submanifold. In addition, we establish a sufficient and necessary condition for a finitely presentable group to be the fundamental group of a strong Lefschetz manifold. We then use it to show the existence of Lefschetz four-manifolds with non-Lefschetz finite covering spaces.  相似文献   
9.
为改进Fuzzy HX环的结果,使之包含Fuzzy商环,提出了弱Fuzzy HX环的概念,研究了它的性质与结构,并重新讨论了拟Fuzzy商环,证明了在正则条件下拟Fuzzy商环与弱Fuzzy HX环的统一性:同时也得到了一致弱Fuzzy HX环与普通Fuzzy商环的关系。  相似文献   
10.
Given a normed cone (X, p) and a subconeY, we construct and study the quotient normed cone (X/Y,p) generated byY. In particular we characterize the bicompleteness of (X/Y, ‖·‖ p ,p) in terms of the bicompleteness of (X, p), and prove that the dual quotient cone ((X/Y)*, || · ‖·‖p,p) can be identified as a distinguished subcone of the dual cone (X *, || · ||p, u). Furthermore, some parts of the theory are presented in the general setting of the spaceCL(X, Y) of all continuous linear mappings from a normed cone (X, p) to a normed cone (Y, q), extending several well-known results related to open continuous linear mappings between normed linear spaces.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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