首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13069篇
  免费   237篇
  国内免费   10篇
化学   48篇
力学   119篇
综合类   1篇
数学   12656篇
物理学   458篇
无线电   34篇
  2022年   23篇
  2021年   14篇
  2020年   27篇
  2019年   257篇
  2018年   305篇
  2017年   137篇
  2016年   116篇
  2015年   122篇
  2014年   300篇
  2013年   799篇
  2012年   348篇
  2011年   807篇
  2010年   638篇
  2009年   820篇
  2008年   975篇
  2007年   986篇
  2006年   681篇
  2005年   496篇
  2004年   394篇
  2003年   307篇
  2002年   232篇
  2001年   211篇
  2000年   218篇
  1999年   327篇
  1998年   292篇
  1997年   236篇
  1996年   298篇
  1995年   301篇
  1994年   289篇
  1993年   254篇
  1992年   235篇
  1991年   169篇
  1990年   145篇
  1989年   159篇
  1988年   98篇
  1987年   115篇
  1986年   103篇
  1985年   165篇
  1984年   157篇
  1983年   86篇
  1982年   144篇
  1981年   138篇
  1980年   84篇
  1979年   60篇
  1978年   87篇
  1977年   63篇
  1976年   47篇
  1975年   15篇
  1974年   11篇
  1973年   10篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
Using the theory of noncommutative symmetric functions, we introduce the higher order peak algebras (Sym(N))N≥1, a sequence of graded Hopf algebras which contain the descent algebra and the usual peak algebra as initial cases (N=1 and N=2). We compute their Hilbert series, introduce and study several combinatorial bases, and establish various algebraic identities related to the multisection of formal power series with noncommutative coefficients. Received November 19, 2004  相似文献   
12.
The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004  相似文献   
13.
14.
   Abstract. We propose a general approach to deal with nonlinear, nonconvex variational problems based on a reformulation of the problem resulting in an optimization problem with linear cost functional and convex constraints. As a first step we explicitly explore these ideas to some one-dimensional variational problems and obtain specific conclusions of an analytical and numerical nature.  相似文献   
15.
We formulate indefinite integration with respect to an irregular function as an algebraic problem which has a unique solution under some analytic constraints. This allows us to define a good notion of integral with respect to irregular paths with Hölder exponent greater than 1/3 (e.g. samples of Brownian motion) and study the problem of the existence, uniqueness and continuity of solution of differential equations driven by such paths. We recover Young's theory of integration and the main results of Lyons’ theory of rough paths in Hölder topology.  相似文献   
16.
17.
Operators on manifolds with corners that have base configurations with geometric singularities can be analysed in the frame of a conormal symbolic structure which is in spirit similar to the one for conical singularities of Kondrat'ev's work. Solvability of elliptic equations and asymptotics of solutions are determined by meromorphic conormal symbols. We study the case when the base has edge singularities which is a natural assumption in a number of applications. There are new phenomena, caused by a specific kind of higher degeneracy of the underlying symbols. We introduce an algebra of meromorphic edge operators that depend on complex parameters and investigate meromorphic inverses in the parameter-dependent elliptic case. Among the examples are resolvents of elliptic differential operators on manifolds with edges.  相似文献   
18.
Motivated by recent results of Stanley, we generalize the rank of a partition λ to the rank of a shifted partition S(λ). We show that the number of bars required in a minimal bar tableau of S(λ) is max(o, e + (ℓ(λ) mod 2)), where o and e are the number of odd and even rows of λ. As a consequence we show that the irreducible projective characters of Sn vanish on certain conjugacy classes. Another corollary is a lower bound on the degree of the terms in the expansion of Schur’s Qλ symmetric functions in terms of the power sum symmetric functions. Received November 20, 2003  相似文献   
19.
Extending to r > 1 a formula of the authors, we compute the expected reflection distance of a product of t random reflections in the complex reflection group G(r, 1, n). The result relies on an explicit decomposition of the reflection distance function into irreducible G(r, 1, n)-characters and on the eigenvalues of certain adjacency matrices.Received December 8, 2003  相似文献   
20.
This paper studies the concept of controllability for infinite-dimensional linear control systems in Banach spaces. First, we prove that the set of admissible control operators for the semigroup generator is unchanged if we perturb the generator by the Desch–Schappacher perturbations. Second we show that exact controllability is not changed by such perturbations.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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