首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10768篇
  免费   1285篇
  国内免费   740篇
化学   641篇
晶体学   55篇
力学   4240篇
综合类   126篇
数学   5166篇
物理学   2565篇
  2024年   7篇
  2023年   108篇
  2022年   132篇
  2021年   187篇
  2020年   299篇
  2019年   246篇
  2018年   277篇
  2017年   332篇
  2016年   354篇
  2015年   264篇
  2014年   440篇
  2013年   823篇
  2012年   509篇
  2011年   606篇
  2010年   530篇
  2009年   599篇
  2008年   563篇
  2007年   633篇
  2006年   613篇
  2005年   595篇
  2004年   533篇
  2003年   525篇
  2002年   477篇
  2001年   426篇
  2000年   393篇
  1999年   395篇
  1998年   357篇
  1997年   293篇
  1996年   233篇
  1995年   186篇
  1994年   143篇
  1993年   104篇
  1992年   124篇
  1991年   100篇
  1990年   75篇
  1989年   54篇
  1988年   34篇
  1987年   35篇
  1986年   33篇
  1985年   39篇
  1984年   26篇
  1983年   26篇
  1982年   15篇
  1981年   12篇
  1980年   7篇
  1979年   5篇
  1977年   5篇
  1976年   5篇
  1959年   3篇
  1957年   3篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
951.
In this paper, we generalize Rees–Shishikura’s theorem to the class of geometrically finite rational maps.  相似文献   
952.
We study the existence and the number of k‐dominating independent sets in certain graph families. While the case namely the case of maximal independent sets—which is originated from Erd?s and Moser—is widely investigated, much less is known in general. In this paper we settle the question for trees and prove that the maximum number of k‐dominating independent sets in n‐vertex graphs is between and if , moreover the maximum number of 2‐dominating independent sets in n‐vertex graphs is between and . Graph constructions containing a large number of k‐dominating independent sets are coming from product graphs, complete bipartite graphs, and finite geometries. The product graph construction is associated with the number of certain Maximum Distance Separable (MDS) codes.  相似文献   
953.
In this paper we provide conditions under which automorphism-coinvariant modules over a right perfect ring are quasi-projective.  相似文献   
954.
955.
N. Karimi 《代数通讯》2017,45(11):4869-4880
We present two conjectures concerning the diameter of a direct power of a finite group. The first conjecture states that the diameter of Gn with respect to each generating set is at most n(|G|?rank(G)); and the second one states that there exists a generating set 𝒜, of minimum size, for Gn such that the diameter of Gn with respect to 𝒜 is at most n(|G|?rank(G)). We will establish evidence for each of the above mentioned conjectures.  相似文献   
956.
Dancheng Lu  Ke Zhang 《代数通讯》2017,45(11):4691-4695
In this note, we characterize when a finite lattice is distributive in terms of the existences of some particular classes of Koszul filtrations.  相似文献   
957.
958.
Juping Tang 《代数通讯》2017,45(7):3017-3021
A subgroup A of a finite group G is called {1≤G}-embedded in G if for each two subgroups KH of G, where K is a maximal subgroup of H, A either covers the pair (K,H) or avoids it. Moreover, a subgroup H of G is called nearly m-embedded in G if G has a subgroup T and a {1≤G}-embedded subgroup C such that G?=?HT and HTCH. In this paper, we mainly prove that G is solvable if and only if its Sylow 3-subgroups, Sylow 5-subgroups and Sylow 7-subgroups are nearly m-embedded in G.  相似文献   
959.
In this article, we derive error estimates for the semi-discrete and fully discrete Galerkin approximations of a general linear second-order hyperbolic partial differential equation with general damping (which includes boundary damping). The results can be applied to a variety of cases (e.g. vibrating systems of linked elastic bodies). The results generalize pioneering work of Dupont and complement a recent article by Basson and Van Rensburg.  相似文献   
960.
The aim of this paper is to propose mixed two‐grid finite difference methods to obtain the numerical solution of the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. The finite difference equations at all interior grid points form a large‐sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a family of finite difference methods for discretizing the spatial and time derivatives. The obtained system has been solved by two‐grid method, where the two‐grid method is used for solving the large‐sparse linear systems. Also, in the proposed method, the spectral radius with local Fourier analysis is calculated for different values of h and Δt. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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