首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   249篇
  免费   8篇
  国内免费   21篇
化学   30篇
晶体学   1篇
力学   6篇
数学   103篇
物理学   138篇
  2023年   2篇
  2022年   3篇
  2021年   2篇
  2020年   9篇
  2019年   3篇
  2018年   3篇
  2017年   6篇
  2016年   8篇
  2015年   6篇
  2014年   12篇
  2013年   23篇
  2012年   10篇
  2011年   14篇
  2010年   13篇
  2009年   16篇
  2008年   18篇
  2007年   16篇
  2006年   16篇
  2005年   13篇
  2004年   7篇
  2003年   3篇
  2002年   5篇
  2001年   2篇
  2000年   10篇
  1999年   11篇
  1998年   3篇
  1997年   7篇
  1996年   3篇
  1995年   1篇
  1994年   10篇
  1993年   3篇
  1992年   2篇
  1991年   2篇
  1988年   1篇
  1987年   1篇
  1985年   1篇
  1984年   1篇
  1981年   2篇
  1980年   2篇
  1979年   1篇
  1978年   3篇
  1976年   1篇
  1971年   1篇
  1969年   1篇
  1952年   1篇
排序方式: 共有278条查询结果,搜索用时 0 毫秒
61.
《Physics letters. A》2014,378(30-31):2124-2127
The hallmark of deterministic chaos is that it creates information—the rate being given by the Kolmogorov–Sinai metric entropy. Since its introduction half a century ago, the metric entropy has been used as a unitary quantity to measure a system's intrinsic unpredictability. Here, we show that it naturally decomposes into two structurally meaningful components: A portion of the created information—the ephemeral information—is forgotten and a portion—the bound information—is remembered. The bound information is a new kind of intrinsic computation that differs fundamentally from information creation: it measures the rate of active information storage. We show that it can be directly and accurately calculated via symbolic dynamics, revealing a hitherto unknown richness in how dynamical systems compute.  相似文献   
62.
图的预解Estrada指标的界的估计(英文)   总被引:1,自引:0,他引:1  
陈小丹  钱建国 《数学研究》2012,45(2):159-166
n阶图G的子图中心度,即后来著名的Estrada指标定义为EE(G)=∑_(i=1)~N e~(λ2).其中λ_1,λ_2……λ_n为图G的特征值.作为复杂网络的一种中心性测度和一种分子结构描述符,Estrada指标在许多研究领域有着广泛的应用.最近,Estrada和High-ama引进了一种新的复杂网络中心度,即∑_(i=1)~n n-1n-1λ_i:他们称之为预解中心度,后来又被称为预解Estrada指标.本文主要利用图G的顶点数和边数给出了图G的预解Estrada指标的若干界.  相似文献   
63.
In this paper, we establish the existence and concentration of solutions of a class of nonlinear Schr?dinger equation $$- \varepsilon ^2 \Delta u_\varepsilon + V\left( x \right)u_\varepsilon = K\left( x \right)\left| {u_\varepsilon } \right|^{p - 2} u_\varepsilon e^{\alpha _0 \left| {u_\varepsilon } \right|^\gamma } , u_\varepsilon > 0, u_\varepsilon \in H^1 \left( {\mathbb{R}^2 } \right),$$ where 2 < p < ∞, α 0 > 0, 0 < γ < 2. When the potential function V (x) decays at infinity like (1 + |x|)?α with 0 < α ≤ 2 and K(x) > 0 are permitted to be unbounded under some necessary restrictions, we will show that a positive H 1(?2)-solution u ? exists if it is assumed that the corresponding ground energy function G(ξ) of nonlinear Schr?dinger equation $- \Delta u + V\left( \xi \right)u = K\left( \xi \right)\left| u \right|^{p - 2} ue^{\alpha _0 \left| u \right|^\gamma }$ has local minimum points. Furthermore, the concentration property of u ? is also established as ? tends to zero.  相似文献   
64.
65.
66.
设P(G,λ)表示图G的色多项式.给定正整数n,e和λ,记f(v,e,λ)=max{P(G,λ):G是个v点e边的图}.本文得到f(v,e,λ)的新上界和f(v,e,3)的新下界.  相似文献   
67.
Photoionization process is a subject of special importance in many areas of physics. Numerical methods must be used in order to obtain photoionization cross-sections for non-hydrogenic levels. The atomic data required to calculate them is huge so self-consistent calculations increase computing time considerably. Analytical potentials are a useful alternative because they avoid the iterative procedures typical in self-consistent models. In this work, we present a relativistic quantum calculation of photoionization cross-sections for isolated ions based on an analytical potential to obtain the required atomic data, which is valid both for hydrogenic and non-hydrogenic ions. Comparisons between our results and others obtained using either widely used analytical expressions for the cross-sections or more sophisticated calculations are done.  相似文献   
68.
李宝麟  马学敏 《数学研究》2007,40(2):159-163
利用Henstock积分,讨论了一类不连续系统有界变差解对参数的连续依赖性及其它相关性质.  相似文献   
69.
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for global optimizers and other contexts, it is of interest to construct bounds around such approximate feasible points, then to verify (computationally but rigorously) that an actual feasible point exists within these bounds. Hansen and others have proposed techniques for proving the existence of feasible points within given bounds, but practical implementations have not, to our knowledge, previously been described. Various alternatives are possible in such an implementation, and details must be carefully considered. Also, in addition to Hansen’s technique for handling the underdetermined case, it is important to handle the overdetermined case, when the approximate feasible point corresponds to a point with many active bound constraints. The basic ideas, along with experimental results from an actual implementation, are summarized here. This work was supported in part by National Science Foundation grant CCR-9203730.  相似文献   
70.
Oscillatons are spherically symmetric solutions to the Einstein–Klein–Gordon equations. These solutions are non-singular, asymptotically flat, and with periodic time dependency. In this paper, we investigate the geodesic motion of particles moving around of an oscillatonic field. Bound orbits are found for particular values of the particles' angular momentum L and their initial radial position r 0. It is found that the radial coordinate of such particles oscillates in time and we are able to predict the corresponding oscillating period as well as its amplitude. We carry out this study for the quadratic V(φ) = m Φ Φ2/2 scalar field potential. We discuss possible ways to follow in order to connect this kind of studies with astrophysical observations.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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