首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1040篇
  免费   42篇
  国内免费   12篇
化学   632篇
晶体学   8篇
力学   31篇
数学   98篇
物理学   183篇
无线电   142篇
  2024年   2篇
  2023年   17篇
  2022年   28篇
  2021年   31篇
  2020年   30篇
  2019年   27篇
  2018年   35篇
  2017年   34篇
  2016年   38篇
  2015年   36篇
  2014年   53篇
  2013年   75篇
  2012年   99篇
  2011年   55篇
  2010年   55篇
  2009年   53篇
  2008年   67篇
  2007年   64篇
  2006年   46篇
  2005年   50篇
  2004年   40篇
  2003年   28篇
  2002年   24篇
  2001年   9篇
  2000年   13篇
  1999年   11篇
  1998年   7篇
  1997年   5篇
  1996年   4篇
  1995年   5篇
  1994年   3篇
  1992年   7篇
  1991年   4篇
  1989年   4篇
  1988年   2篇
  1987年   1篇
  1986年   1篇
  1985年   3篇
  1984年   8篇
  1982年   2篇
  1981年   3篇
  1980年   1篇
  1979年   1篇
  1978年   2篇
  1977年   2篇
  1975年   2篇
  1965年   1篇
  1960年   1篇
  1957年   2篇
  1956年   1篇
排序方式: 共有1094条查询结果,搜索用时 16 毫秒
91.
The problem of recognizing cover-incomparability graphs (i.e. the graphs obtained from posets as the edge-union of their covering and incomparability graph) was shown to be NP-complete in general [J. Maxová, P. Pavlíkova, A. Turzík, On the complexity of cover-incomparability graphs of posets, Order 26 (2009) 229-236], while it is for instance clearly polynomial within trees. In this paper we concentrate on (classes of) chordal graphs, and show that any cover-incomparability graph that is a chordal graph is an interval graph. We characterize the posets whose cover-incomparability graph is a block graph, and a split graph, respectively, and also characterize the cover-incomparability graphs among block and split graphs, respectively. The latter characterizations yield linear time algorithms for the recognition of block and split graphs, respectively, that are cover-incomparability graphs.  相似文献   
92.
A numerical algorithm is developed for the approximation of the solution to certain boundary value problems involving the third-order ordinary differential equation associated with draining and coating flows. The authors show that the approximate solutions obtained by the numerical algorithm developed by using nonpolynomial quintic spline functions are better than those produced by other spline and domain decomposition methods. The algorithm is tested on two problems associated with draining and coating flows to demonstrate the practical usefulness of the approach.  相似文献   
93.
The system of generalized Chaplygin gas equations with a coulomblike friction term has been investigated by using the famous Lie symmetry method. A direct and systematic algorithm based on the adjoint transformation and invariants of the admitted Lie algebras is then used to construct one- and two-dimensional optimal system of the Chaplygin gas equations. Inequivalent classes of group invariant solutions are then obtained using the one-dimensional optimal system. Further, the evolutionary behaviour of the weak discontinuity wave within the state characterized by one of the group invariant solutions is investigated in detail, and certain observations are noted in respect to their contrasting behaviour.  相似文献   
94.
95.
Anil  Arun  Changat  Manoj 《Order》2022,39(1):29-43
Order - Cover-incomparability graphs (C-I graphs) are graphs whose edge-set is the union of edge-sets of the incomparability graph and the cover graph of some poset. C-I graphs captured attention...  相似文献   
96.
It is shown that the proof by Mehta and Parameswaran of Wahl’s conjecture for Grassmannians in positive odd characteristics also works for symplectic and orthogonal Grassmannians.   相似文献   
97.
Let M be an irreducible projective variety, over an algebraically closed field k of characteristic zero, equipped with an action of a connected algebraic group S over k. Let E G be a principal G-bundle over M equipped with a lift of the action of S on M, where G is a connected reductive linear algebraic group. Assume that E G admits a reduction of structure group to a maximal torus TG. We give a necessary and sufficient condition for the existence of a T-reduction of E G which is left invariant by the action of S on E G .  相似文献   
98.
99.
Let Y be a projective variety over a field k (of arbitrary characteristic). Assume that the normalization X of Y is such that is normal, being the algebraic closure of k. We define a notion of strong semistability for vector bundles on Y. We show that a vector bundle on Y is strongly semistable if and only if its pull back to X is strongly semistable and hence it is a tensor category. In case , we show that strongly semistable vector bundles on Y form a neutral Tannakian category. We define the holonomy group scheme of Y to be the Tannakian group scheme for this category. For a strongly semistable principal G‐bundle , we construct a holonomy group scheme. We show that if Y is an integral complex nodal curve, then the holonomy group of a strongly semistable vector bundle on Y is the Zariski closure of the (topological) fundamental group of Y.  相似文献   
100.
In this article, we obtain explicit solutions of a linear PDE subject to a class of radial square integrable functions with a monotonically increasing weight function |x|n−1eβ|x|2/2,|x|n1eβ|x|2/2,, β≥0, x ∈?nβ0,x?n. This linear PDE is obtained from a system of forced Burgers equation via the Cole-Hopf transformation. For any spatial dimension n > 1, the solution is expressed in terms of a family of weighted generalized Laguerre polynomials. We also discuss the large time behaviour of the solution of the system of forced Burgers equation.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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