首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   841篇
  免费   96篇
  国内免费   126篇
化学   446篇
晶体学   3篇
力学   74篇
综合类   9篇
数学   235篇
物理学   296篇
  2024年   2篇
  2023年   50篇
  2022年   43篇
  2021年   49篇
  2020年   45篇
  2019年   32篇
  2018年   31篇
  2017年   37篇
  2016年   31篇
  2015年   46篇
  2014年   49篇
  2013年   69篇
  2012年   118篇
  2011年   63篇
  2010年   48篇
  2009年   45篇
  2008年   45篇
  2007年   42篇
  2006年   36篇
  2005年   31篇
  2004年   13篇
  2003年   11篇
  2002年   16篇
  2001年   18篇
  2000年   8篇
  1999年   12篇
  1998年   7篇
  1997年   6篇
  1996年   6篇
  1995年   1篇
  1994年   1篇
  1993年   5篇
  1992年   2篇
  1991年   2篇
  1990年   2篇
  1989年   3篇
  1988年   12篇
  1987年   26篇
排序方式: 共有1063条查询结果,搜索用时 402 毫秒
1.
2.
Wang  Xuebin  Xu  Can  Zheng  Zhigang 《Nonlinear dynamics》2021,103(3):2721-2732
Nonlinear Dynamics - The classical Kuramoto model serves as a useful tool for studying synchronization transitions in coupled oscillators that is limited to the sinusoidal and pairwise...  相似文献   
3.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2.  相似文献   
4.
In this paper, we investigate the Hausdorff measure for level sets of N-parameter Rd-valued stable processes, and develop a means of seeking the exact Hausdorff measure function for level sets of N-parameter Rd-valued stable processes. We show that the exact Hausdorff measure function of level sets of N-parameter Rd-valued symmetric stable processes of index α is Ф(r) = r^N-d/α (log log l/r)d/α when Nα 〉 d. In addition, we obtain a sharp lower bound for the Hausdorff measure of level sets of general (N, d, α) strictly stable processes.  相似文献   
5.
6.
利用集合在某点的相依切锥、法向锥和可行方向锥等研究向量优化问题的有效点、 弱有效点和真有效点的特征,对局部有效点、局部弱有效点和局部真有效点与集合的各 锥之间的关系作了刻画.  相似文献   
7.
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.  相似文献   
8.
Quinones including menadione are ubiquitous in nature. They play important roles in aerobic respira- tion and photosynthesis[1,2]. In addition, exogenous quinones are used as antibiotics and anticancer drugs. Their function is closely related to their red…  相似文献   
9.
Let G be a simple graph with adjacency matrix A(G) and (G,x) the permanental polynomial of G. Let G × H denotes the Cartesian product of graphs G and H. Inspired by Kleins idea to compute the permanent of some matrices (Mol. Phy. 31 (3) (1976) 811–823), in this paper in terms of some orientation of graphs we study the permanental polynomial of a type of graphs. Here are some of our main results.1.If G is a bipartite graph containing no subgraph which is an even subdivision of K 2,3, then G has an orientation G e such that (G,x) = det (xI-A(G e )), where A(G e ) denotes the skew adjacency matrix of G e.2.Let G be a 2-connected outerplanar bipartite graph with n vertices. Then there exists a 2-connected outerplanar bipartite graph with 2n+2 vertices such that (G,x) is a factor of .3.Let T be an arbitrary tree with n vertices. Then , where 1 , 2 , ..., n are the eigenvalues of T.  相似文献   
10.
We investigate a diffusive, stage-structured epidemic model with the maturation delay and freelymoving delay. Choosing delays and diffusive rates as bifurcation parameters, the only possible way to destabilize the endemic equilibrium is through Hopf bifurcation. The normal forms of Hopf bifurcations on the center manifold are calculated, and explicit formulae determining the criticality of bifurcations are derived. There are two different kinds of stable oscillations near the first bifurcation: ...  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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