首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10362篇
  免费   248篇
  国内免费   28篇
化学   208篇
晶体学   2篇
力学   163篇
综合类   5篇
数学   9439篇
物理学   426篇
无线电   395篇
  2023年   8篇
  2022年   19篇
  2021年   18篇
  2020年   31篇
  2019年   319篇
  2018年   393篇
  2017年   182篇
  2016年   117篇
  2015年   134篇
  2014年   378篇
  2013年   604篇
  2012年   371篇
  2011年   646篇
  2010年   589篇
  2009年   828篇
  2008年   846篇
  2007年   825篇
  2006年   644篇
  2005年   388篇
  2004年   351篇
  2003年   315篇
  2002年   209篇
  2001年   204篇
  2000年   178篇
  1999年   211篇
  1998年   185篇
  1997年   150篇
  1996年   209篇
  1995年   226篇
  1994年   209篇
  1993年   145篇
  1992年   100篇
  1991年   64篇
  1990年   49篇
  1989年   61篇
  1988年   34篇
  1987年   30篇
  1986年   35篇
  1985年   50篇
  1984年   43篇
  1983年   34篇
  1982年   57篇
  1981年   39篇
  1980年   25篇
  1979年   12篇
  1978年   18篇
  1977年   19篇
  1976年   22篇
  1974年   5篇
  1973年   4篇
排序方式: 共有10000条查询结果,搜索用时 500 毫秒
81.
We consider a deterministic discrete-time model of fire spread introduced by Hartnell [Firefighter! an application of domination, Presentation, in: 20th Conference on Numerical Mathematics and Computing, University of Manitoba in Winnipeg, Canada, September 1995] and the problem of minimizing the number of burnt vertices when a fixed number of vertices can be defended by firefighters per time step. While only two firefighters per time step are needed in the two-dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [Fire control on graphs, J. Combin. Math. Combin. Comput. 41 (2002) 19-34] that 2d-1 firefighters per time step are needed to contain a fire outbreak starting at a single vertex in the d-dimensional square lattice for d?3; we also prove that in the d-dimensional lattice, d?3, for each positive integer f there is some outbreak of fire such that f firefighters per time step are insufficient to contain the outbreak. We prove another conjecture of Wang and Moeller that the proportion of elements in the three-dimensional grid Pn×Pn×Pn which can be saved with one firefighter per time step when an outbreak starts at one vertex goes to 0 as n gets large. Finally, we use integer programming to prove results about the minimum number of time steps needed and minimum number of burnt vertices when containing a fire outbreak in the two-dimensional square lattice with two firefighters per time step.  相似文献   
82.
We study an abstract second order nonlinear evolution equation in a real Hilbert space. We consider time-dependent convex functions and their subdifferentials operating on the first derivative of the unknown function. Introducing appropriate assumptions on the convex functions and other data, we prove the existence and uniqueness of a strong solution, and give some applications of the abstract theorem to hyperbolic variational inequalities with time-dependent constraints.   相似文献   
83.
In this paper, we study the global existence and the asymptotic behavior of classical solution of the Cauchy problem for quasilinear hyperbolic system with constant multiple and linearly degenerate characteristic fields. We prove that the global C1 solution exists uniquely if the BV norm of the initial data is sufficiently small. Based on the existence result on the global classical solution, we show that, when the time t tends to the infinity, the solution approaches a combination of C1 traveling wave solutions. Finally, we give an application to the equation for time-like extremal surfaces in the Minkowski space-time R1+n.  相似文献   
84.
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.  相似文献   
85.
In 1988 A. Gutek proved that there exist one-point connectifications of hereditarily disconnected spaces that do not have the fixed point property. We improve on this result by constructing a one-point connectification of a totally disconnected space without the fixed point property.  相似文献   
86.
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  相似文献   
87.
We give general conditions on a generator of a C0-semigroup (resp. of a C0-resolvent) on Lp(E,μ), p ≥ 1, where E is an arbitrary (Lusin) topological space and μ a σ-finite measure on its Borel σ-algebra, so that it generates a sufficiently regular Markov process on E. We present a general method how these conditions can be checked in many situations. Applications to solve stochastic differential equations on Hilbert space in the sense of a martingale problem are given. Dedicated to Giuseppe Da Prato on the occasion of his 70th birthday  相似文献   
88.
In this paper, we establish some new nonlinear integral inequalities of the Gronwall–Bellman–Ou-Iang-type in two variables. These on the one hand generalizes and on the other hand furnish a handy tool for the study of qualitative as well as quantitative properties of solutions of differential equations. We illustrate this by applying our new results to certain boundary value problem.  相似文献   
89.
Weak vector equilibrium problems with bi-variable mappings from product space of two bounded complete locally convex Hausdorff topological vector spaces to another topological vector space are studied. The existence theorems of solutions are proved by the FKKM fixed point theorem. Viscosity principle of vector equilibrium problems is dealt with. The relations between solutions of the vector equilibrium problem and those of its perturbation problem are presented.  相似文献   
90.
 We study a full hydrodynamic semiconductor model in multi-space dimension. The global existence of smooth solutions is established and the exponential stability of the solutions as is investigated. Received November 14, 2000; in revised form March 25, 2002 Published online August 5, 2002  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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