首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7842篇
  免费   214篇
  国内免费   356篇
化学   1735篇
晶体学   87篇
力学   61篇
综合类   24篇
数学   5562篇
物理学   943篇
  2023年   28篇
  2022年   70篇
  2021年   64篇
  2020年   68篇
  2019年   198篇
  2018年   205篇
  2017年   96篇
  2016年   107篇
  2015年   105篇
  2014年   200篇
  2013年   473篇
  2012年   244篇
  2011年   430篇
  2010年   387篇
  2009年   512篇
  2008年   638篇
  2007年   624篇
  2006年   554篇
  2005年   372篇
  2004年   345篇
  2003年   292篇
  2002年   257篇
  2001年   176篇
  2000年   197篇
  1999年   224篇
  1998年   200篇
  1997年   141篇
  1996年   183篇
  1995年   175篇
  1994年   169篇
  1993年   137篇
  1992年   99篇
  1991年   61篇
  1990年   42篇
  1989年   41篇
  1988年   38篇
  1987年   24篇
  1986年   18篇
  1985年   34篇
  1984年   26篇
  1983年   11篇
  1982年   17篇
  1981年   18篇
  1980年   16篇
  1979年   23篇
  1978年   13篇
  1977年   19篇
  1976年   9篇
  1975年   11篇
  1973年   11篇
排序方式: 共有8412条查询结果,搜索用时 15 毫秒
71.
We give several new constructions for moderate rank elliptic curves over Q(T). In particular we construct infinitely many rational elliptic surfaces (not in Weierstrass form) of rank 6 over Q using polynomials of degree two in T. While our method generates linearly independent points, we are able to show the rank is exactly 6 without having to verify the points are independent. The method generalizes; however, the higher rank surfaces are not rational, and we need to check that the constructed points are linearly independent.  相似文献   
72.
We investigate differential operators and their compatibility with subgroups of SL2n(R). In particular, we construct Rankin-Cohen brackets for Hilbert modular forms, and more generally, multilinear differential operators on the space of Hilbert modular forms. As an application, we explicitly determine the Rankin-Cohen bracket of a Hilbert-Eisenstein series and an arbitrary Hilbert modular form. We use this result to compute the Petersson inner product of such a bracket and a Hilbert modular cusp form.  相似文献   
73.
In this paper we study a phase-change problem arising from induction heating. The mathematical model consists of time-harmonic Maxwell’s system in a quasi-stationary field coupled with nonlinear heat conduction. The enthalpy form is used to characterize the phase-change in the material. It is shown that the problem has a global solution. Moreover, it is shown that the solution is unique and regular in one-space dimension even with an unbounded resistivity. This work is supported in part by a NSF grant: DMS-0102261  相似文献   
74.
We study compact, countably compact, pseudocompact, and functionally bounded sets in extensions of topological groups. A property P is said to be a three space property if, for every topological group G and a closed invariant subgroup N of G, the fact that both groups N and G/N have P implies that G also has P. It is shown that if all compact (countably compact) subsets of the groups N and G/N are metrizable, then G has the same property. However, the result cannot be extended to pseudocompact subsets, a counterexample exists under p=c. Another example shows that extensions of groups do not preserve the classes of realcompact, Dieudonné complete and μ-spaces: one can find a pseudocompact, non-compact Abelian topological group G and an infinite, closed, realcompact subgroup N of G such that G/N is compact and all functionally bounded subsets of N are finite. Several examples given in the article destroy a number of tempting conjectures about extensions of topological groups.  相似文献   
75.
We demonstrate that the 3-power torsion points of the Jacobians of the principal modular curves X(3n) are fixed by the kernel of the canonical outer Galois representation of the pro-3 fundamental group of the projective line minus three points. The proof proceeds by demonstrating the curves in question satisfy a two-part criterion given by Anderson and Ihara. Two proofs of the second part of the criterion are provided; the first relies on a theorem of Shimura, while the second uses the moduli interpretation. Received: 30 September 2005  相似文献   
76.
This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R0-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.  相似文献   
77.
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.  相似文献   
78.
We define the Sheffer group of all Sheffer-type polynomials and prove the isomorphism between the Sheffer group and the Riordan group. An equivalence of the Riordan array pair and generalized Stirling number pair is also presented. Finally, we discuss a higher dimensional extension of Riordan array pairs.  相似文献   
79.
Summary In this paper we shall consider the application of the finite element method to a class of second order elliptic boundary value problems of divergence form and with gradient nonlinearity in the principal coefficient, and the derivation of error estimates for the finite element approximations. Such problems arise in many practical situations — for example, in shock-free airfoil design, seepage through coarse grained porous media, and in some glaciological problems. By making use of certain properties of the nonlinear coefficients, we shall demonstrate that the variational formulations associated with these boundary value problems are well-posed. We shall also prove that the abstract operators accompanying such problems satisfy certain continuity and monotonicity inequalities. With the aid of these inequalities and some standard results from approximation theory, we show how one may derive error estimates for the finite element approximations in the energy norm.  相似文献   
80.
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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