首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14624篇
  免费   1044篇
  国内免费   311篇
化学   3327篇
晶体学   259篇
力学   174篇
综合类   20篇
数学   9919篇
物理学   1533篇
综合类   747篇
  2023年   16篇
  2022年   45篇
  2021年   36篇
  2020年   59篇
  2019年   404篇
  2018年   507篇
  2017年   312篇
  2016年   243篇
  2015年   444篇
  2014年   687篇
  2013年   985篇
  2012年   728篇
  2011年   1012篇
  2010年   965篇
  2009年   1202篇
  2008年   1181篇
  2007年   1098篇
  2006年   888篇
  2005年   568篇
  2004年   525篇
  2003年   505篇
  2002年   372篇
  2001年   360篇
  2000年   324篇
  1999年   338篇
  1998年   294篇
  1997年   221篇
  1996年   259篇
  1995年   251篇
  1994年   236篇
  1993年   171篇
  1992年   108篇
  1991年   71篇
  1990年   53篇
  1989年   65篇
  1988年   36篇
  1987年   30篇
  1986年   39篇
  1985年   53篇
  1984年   43篇
  1983年   34篇
  1982年   58篇
  1981年   40篇
  1980年   26篇
  1979年   12篇
  1978年   19篇
  1977年   18篇
  1976年   21篇
  1974年   5篇
  1973年   6篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
In this paper, we study the growth of solutions of a first order linear differential equation. From this we verify that a conjecture given by Brück is true under the restriction of the hyper order less than 1/2, and obtain some uniqueness theorems of a nonconstant entire function and its first derivative sharing a nonzero constant CM. The results in this paper also improve some known results. Some examples show that the results in this paper are best possible. Project supported by the NSFC (NO. A0324617) and the RFDP (NO. 20060422049). Received: 20 April 2006 Revised: 4 February 2007  相似文献   
92.
Malyngamide X ( 1 ), the first (7R)‐lyngbic acid connected to a new tripeptide backbone, was isolated from the Thai sea hare Bursatella leachii. The gross structure of 1 was established on the basis of 1D and 2D NMR and mass spectroscopic data. Combination of the NMR spectroscopic experiments with α‐methoxy‐α‐(trifluoromethyl)phenylacetic acid esters, 2,2,2‐trifluoro‐1‐(9‐anthryl)ethanol chiral solvating agent, and molecular mechanics of 1 and the synthetic molecular fragments allowed us to determine the absolute stereochemistry of all six stereogenic centers without hydrolytic degradation of the compound. Compound 1 displayed moderate cytotoxic, antitubercular, and antimalarial properties.  相似文献   
93.
The category of small covariant functors from simplicial sets to simplicial sets supports the projective model structure [B. Chorny, W.G. Dwyer, Homotopy theory of small diagrams over large categories, preprint, 2005]. In this paper we construct various localizations of the projective model structure and also give a variant for functors from simplicial sets to spectra. We apply these model categories in the study of calculus of functors, namely for a classification of polynomial and homogeneous functors. In the n-homogeneous model structure, the nth derivative is a Quillen functor to the category of spectra with Σn-action. After taking into account only finitary functors—which may be done in two different ways—the above Quillen map becomes a Quillen equivalence. This improves the classification of finitary homogeneous functors by T.G. Goodwillie [T.G. Goodwillie, Calculus. III. Taylor series, Geom. Topol. 7 (2003) 645-711 (electronic)].  相似文献   
94.
In this paper we present several results about local MV-algebras, extending existing results given for MV-chains. The role of local MV-algebras in sheaf representation and weak boolean product is stressed and the relationship of local MV-algebras with varieties of MV-algebras is analyzed. Presented by S. Pulmannova. Received November 11, 2005; accepted in final form December 20, 2005.  相似文献   
95.
In this paper one specifies the ergodic behavior of the 2D-stochastic Navier–Stokes equation by giving a Large Deviation Principle for the occupation measure for large time. It describes the exact rate of exponential convergence. The considered random force is non-degenerate and compatible with the strong Feller property.  相似文献   
96.
In this paper we study a Ginzburg–Landau model which describes the behaviour of a superconducting material including thermal effects. We extend the traditional formulation of the problem, by introducing the temperature as an additional state variable. Accordingly, together with the Gor’kov–Eliashberg system, we introduce an evolution equation for the absolute temperature. We examine in detail the case which allows only variations of the concentration of superconducting electrons and of the temperature, neglecting the electromagnetic field. For this problem existence and uniqueness of the solution are shown. Finally we analyze the asymptotic behaviour of the solutions, proving that the system possesses a global attractor.  相似文献   
97.
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.  相似文献   
98.
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.   相似文献   
99.
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.  相似文献   
100.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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