首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   976篇
  免费   18篇
  国内免费   6篇
化学   506篇
晶体学   2篇
力学   69篇
数学   220篇
物理学   203篇
  2023年   8篇
  2022年   18篇
  2021年   17篇
  2020年   19篇
  2019年   23篇
  2018年   19篇
  2017年   20篇
  2016年   52篇
  2015年   25篇
  2014年   33篇
  2013年   51篇
  2012年   68篇
  2011年   86篇
  2010年   49篇
  2009年   43篇
  2008年   59篇
  2007年   69篇
  2006年   41篇
  2005年   41篇
  2004年   40篇
  2003年   42篇
  2002年   24篇
  2001年   11篇
  2000年   10篇
  1999年   8篇
  1998年   4篇
  1997年   8篇
  1996年   10篇
  1995年   12篇
  1994年   11篇
  1993年   8篇
  1992年   6篇
  1991年   6篇
  1990年   4篇
  1989年   5篇
  1988年   3篇
  1987年   1篇
  1986年   9篇
  1985年   6篇
  1984年   5篇
  1983年   3篇
  1982年   2篇
  1981年   4篇
  1980年   2篇
  1979年   2篇
  1978年   3篇
  1977年   5篇
  1976年   1篇
  1974年   3篇
  1973年   1篇
排序方式: 共有1000条查询结果,搜索用时 0 毫秒
71.
We present the basic notions and results of the geometric theory of second order PDEs in the framework of contact and symplectic manifolds including characteristics, formal integrability, existence and uniqueness of formal solutions of non-characteristic Cauchy problems. Then, we focus our attention to Monge-Ampère equations (MAEs) and discuss a natural class of MAEs arising in K?hler and para-K?hler geometry whose solutions are special Lagrangian submanifolds.  相似文献   
72.
73.
We show that every n‐vertex planar graph admits a simultaneous embedding without mapping and with fixed edges with any ‐vertex planar graph. In order to achieve this result, we prove that every n‐vertex plane graph has an induced outerplane subgraph containing at least vertices. Also, we show that every n‐vertex planar graph and every n‐vertex planar partial 3‐tree admit a simultaneous embedding without mapping and with fixed edges.  相似文献   
74.
We consider a semilinear integrodifferential system in non-normal form. Such a system is a generalization of the one that arises in the phase-field theory with memory. We prove an abstract existence and uniqueness theorem and a continuous dependence result for the direct problem. Reformulating the direct problem in a suitable way we prove that the identification problem admits a unique solution.  相似文献   
75.
76.
77.
We show that every c-planar clustered graph has a straight-line c-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi (Algorithmica 44(1):1–32, 2006).  相似文献   
78.
In this paper, by an extension of the Ginzburg–Landau theory, we propose a mathematical model describing hard magnets within which we are able to explore the para–ferromagnetic transition and by using the Landau–Lifshitz–Gilbert equation, to study the 3D evolution of magnetic field. Finally, the hysteresis loops are obtained and represented by numerical implementations.  相似文献   
79.
In this paper we prove a new Representation Formula for slice regular functions, which shows that the value of a slice regular function f at a point q=x+yI can be recovered by the values of f at the points q+yJ and q+yK for any choice of imaginary units I,J,K. This result allows us to extend the known properties of slice regular functions defined on balls centered on the real axis to a much larger class of domains, called axially symmetric domains. We show, in particular, that axially symmetric domains play, for slice regular functions, the role played by domains of holomorphy for holomorphic functions.  相似文献   
80.
Telecommunications systems have recently undergone significant innovations. These call for suitable statistical models that can properly describe the behaviour of the input traffic in a network. Here we use fractional Brownian motion (FBM) to model cumulative traffic network, thus taking into account the possible presence of long‐range dependence in the data. A Bayesian approach is devised in such a way that we are able to: (a) estimate the Hurst parameter H of the FBM; (b) estimate the overflow probability which is a parameter measuring the quality of service of a network: (c) develop a test for comparing the null hypothesis of long‐range dependence in the data versus the alternative of short‐range dependence. In order to achieve these inferential results, we elaborate an MCMC sampling scheme whose output enables us to obtain an approximation of the quantities of interest. An application to three real datasets, corresponding to three different levels of traffic, is finally considered. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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