首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   693篇
  免费   8篇
  国内免费   7篇
化学   382篇
晶体学   5篇
力学   20篇
数学   148篇
物理学   153篇
  2020年   5篇
  2019年   10篇
  2018年   7篇
  2017年   7篇
  2016年   9篇
  2015年   7篇
  2014年   11篇
  2013年   42篇
  2012年   35篇
  2011年   31篇
  2010年   13篇
  2009年   21篇
  2008年   23篇
  2007年   34篇
  2006年   29篇
  2005年   12篇
  2004年   22篇
  2003年   22篇
  2002年   14篇
  2001年   19篇
  2000年   22篇
  1999年   18篇
  1998年   11篇
  1997年   11篇
  1996年   6篇
  1995年   11篇
  1994年   13篇
  1993年   11篇
  1992年   9篇
  1991年   6篇
  1990年   9篇
  1989年   6篇
  1988年   10篇
  1987年   6篇
  1985年   13篇
  1984年   15篇
  1983年   14篇
  1982年   12篇
  1981年   11篇
  1980年   8篇
  1979年   11篇
  1978年   13篇
  1977年   13篇
  1975年   8篇
  1974年   5篇
  1973年   9篇
  1972年   5篇
  1971年   5篇
  1970年   7篇
  1969年   9篇
排序方式: 共有708条查询结果,搜索用时 0 毫秒
701.
Multiplicative programming problems are difficult global optimization problems known to be NP-hard. At the same time, these problems have some important applications in engineering, finance, economics, and other fields. This article has two purposes. The first is to present an analysis that shows several relationships between concave multiplicative programs and concave minimization problems, and between concave multiplicative programs and certain multiple-objective mathematical programs. The second purpose is to propose and report computational results for a heuristic efficient-point search algorithm that we have designed for use on linear multiplicative programming problems. To our knowledge, this is the first heuristic algorithm of its type. The theoretical and algorithmic results given in the article offer some potentially important new avenues for analyzing and solving multiplicative programming problems of various types.  相似文献   
702.
Motivated by the question of faithfulness of the four-dimensional Burau representation, we study a generalization of the Schottky Lemma which is useful for studying actions on affine buildings.  相似文献   
703.
Suppose that k is a field of characteristic p and that G is a finite group having p-rank at least three. Given a regular sequence of length 2 in H*(G, k), we show how to construct an infinitely generated module whose support variety is strictly smaller than the small support of its cohomology. Received: 25 January 2008  相似文献   
704.
705.
We prove a version of the Schur–Weyl duality over finite fields. We prove that for any field k, if k has at least r + 1 elements, the Schur–Weyl duality holds for the rth tensor power of a finite dimensional vector space V. Moreover, if the dimension of V is at least r + 1, the natural map ${{k\mathfrak{S}_r \to \mathsf{End}_{{\rm GL}(V)}(V^{\otimes r})}}We prove a version of the Schur–Weyl duality over finite fields. We prove that for any field k, if k has at least r + 1 elements, the Schur–Weyl duality holds for the rth tensor power of a finite dimensional vector space V. Moreover, if the dimension of V is at least r + 1, the natural map k\mathfrakSr ? EndGL(V)(V?r){{k\mathfrak{S}_r \to \mathsf{End}_{{\rm GL}(V)}(V^{\otimes r})}} is an isomorphism. This isomorphism may fail if dim k V is not strictly larger than r.  相似文献   
706.
If G is a finite group, then the usual version of the Greencorrespondence applies to finitely generated kG-modules whenk is a field of characteristic p > 0 or a p-adic ring. Thepaper presents a categorical version of the Green correspondenceand a version of the Burry–Carlson–Puig theoremthat remain valid for arbitrary modules and coefficient rings.In this generality, however, it is not clear whether the Greencorrespondent of a finitely generated module is always finitelygenerated.  相似文献   
707.
Hamiltonian Monte Carlo (HMC) has been progressively incorporated within the statistician’s toolbox as an alternative sampling method in settings when standard Metropolis–Hastings is inefficient. HMC generates a Markov chain on an augmented state space with transitions based on a deterministic differential flow derived from Hamiltonian mechanics. In practice, the evolution of Hamiltonian systems cannot be solved analytically, requiring numerical integration schemes. Under numerical integration, the resulting approximate solution no longer preserves the measure of the target distribution, therefore an accept–reject step is used to correct the bias. For doubly intractable distributions—such as posterior distributions based on Gibbs random fields—HMC suffers from some computational difficulties: computation of gradients in the differential flow and computation of the accept–reject proposals poses difficulty. In this article, we study the behavior of HMC when these quantities are replaced by Monte Carlo estimates. Supplemental codes for implementing methods used in the article are available online.  相似文献   
708.
Dave Benson  Leonard Evens 《代数通讯》2013,41(10):3447-3451

In this article, we call a ring R right generalized semiregular if for any a ∈ R there exist two left ideals P, L of R such that lr(a) = PL, where P ? Ra and Ra ∩ L is small in R. The class of generalized semiregular rings contains all semiregular rings and all AP-injective rings. Some properties of these rings are studied and some results about semiregular rings and AP-injective rings are extended. In addition, we call a ring R semi-π-regular if for any a ∈ R there exist a positive integer n and e 2 = e ∈ a n R such that (1 ? e)a n  ∈ J(R), the Jacobson radical of R. It is shown that a ring R is semi-π-regular if and only if R/J(R) is π-regular and idempotents can be lifted modulo J(R).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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