首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1838篇
  免费   119篇
  国内免费   51篇
化学   76篇
晶体学   1篇
力学   87篇
综合类   1篇
数学   1466篇
物理学   377篇
  2024年   12篇
  2023年   17篇
  2022年   31篇
  2021年   27篇
  2020年   62篇
  2019年   97篇
  2018年   101篇
  2017年   70篇
  2016年   47篇
  2015年   61篇
  2014年   138篇
  2013年   211篇
  2012年   110篇
  2011年   116篇
  2010年   115篇
  2009年   149篇
  2008年   142篇
  2007年   106篇
  2006年   74篇
  2005年   46篇
  2004年   38篇
  2003年   38篇
  2002年   40篇
  2001年   26篇
  2000年   19篇
  1999年   21篇
  1998年   15篇
  1997年   10篇
  1996年   11篇
  1995年   4篇
  1994年   12篇
  1993年   5篇
  1992年   6篇
  1991年   6篇
  1990年   3篇
  1989年   3篇
  1988年   1篇
  1987年   2篇
  1986年   2篇
  1985年   2篇
  1984年   3篇
  1983年   1篇
  1982年   2篇
  1981年   2篇
  1979年   1篇
  1977年   2篇
  1973年   1篇
排序方式: 共有2008条查询结果,搜索用时 15 毫秒
121.
The fractional generalization of Nambu mechanics is constructed by using the differential forms and exterior derivatives of fractional orders. The generalized Pfaffian equations are obtained and one example is investigated in details. On leave of absence from Institute of Space Sciences, P.O. Box, MG-23, 76900, Magurele-Bucharest, Romania.  相似文献   
122.
In this paper, the initial value problem for a class of fractional differential equations is discussed, which generalizes the existent result to a wide class of fractional differential equations. Also the theoretical result established in the paper ensures the validity of chaos control of fractional differential equations. In particular, feed-back control of chaotic fractional differential equation is theoretically investigated and the fractional Lorenz system as a numerical example is further provided to verify the analytical result.  相似文献   
123.
This article presents an algorithm for globally solving a sum of ratios fractional programming problem. To solve this problem, the algorithm globally solves an equivalent concave minimization problem via a branch-and-bound search. The main work of the algorithm involves solving a sequence of convex programming problems that differ only in their objective function coefficients. Therefore, to solve efficiently these convex programming problems, an optimal solution to one problem can potentially be used to good advantage as a starting solution to the next problem.  相似文献   
124.
We develop a long-step surface-following version of the method of analytic centers for the fractional-linear problem min{t 0 |t 0 B(x) −A(x) εH, B(x) εK, x εG}, whereH is a closed convex domain,K is a convex cone contained in the recessive cone ofH, G is a convex domain andB(·),A(·) are affine mappings. Tracing a two-dimensional surface of analytic centers rather than the usual path of centers allows to skip the initial “centering” phase of the path-following scheme. The proposed long-step policy of tracing the surface fits the best known overall polynomial-time complexity bounds for the method and, at the same time, seems to be more attractive computationally than the short-step policy, which was previously the only one giving good complexity bounds. The research was partly supported by the Israeli-American Binational Science Foundation (BSF).  相似文献   
125.
In the present work, we introduce and study essentially a class of multi-dimensional modified fractional calculus operators involving a general class of polynomials in the kernel. These operators are considered in the space of functionsM γ (R + n ). Some mapping properties and fractional differential formulas are obtained. Also images of some elementary and special functions are established.  相似文献   
126.
In generalized fractional programming, one seeks to minimize the maximum of a finite number of ratios. Such programs are, in general, nonconvex and consequently are difficult to solve. Here, we consider a particular case in which the ratio is the quotient of a quadratic form and a positive concave function. The dual of such a problem is constructed and a numerical example is given.  相似文献   
127.
We present a modification of an algorithm recently suggested by the same authors in this journal (Ref. 1). The speed of convergence is improved for the same complexity of computation.The research of S. Schaible was supported by Grants A4534 and A5408 from NSERC.  相似文献   
128.
The Adomian decomposition method is used to obtain analytic and approximate solutions of the space-and time-fractional telegraph equations. The space- and time-fractional derivatives are considered in the Caputo sense. The analytic solutions are calculated in the form of series with easily computable terms. Some examples are given. The results reveal that the Adomian method is very effective and convenient.  相似文献   
129.
Fractional Brownian Motion and Sheet as White Noise Functionals   总被引:1,自引:0,他引:1  
In this short note, we show that it is more natural to look the fractional Brownian motion as functionals of the standard white noises, and the fractional white noise calculus developed by Hu and Фksendal follows directly from the classical white noise functional calculus. As examples we prove that the fractional Girsanov formula, the Ito type integrals and the fractional Black-Scholes formula are easy consequences of their classical counterparts. An extension to the fractional Brownian sheet is also briefly discussed.  相似文献   
130.
We study a new nonlocal approach to the mathematical modelling of the chemotaxis problem, which describes the random motion of a certain population due to a substance concentration. Considering the initial–boundary value problem for the fractional hyperbolic Keller–Segel model, we prove the solvability of the problem. The solvability result relies mostly on fractional calculus and kinetic formulation of scalar conservation laws.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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