首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1809篇
  免费   75篇
  国内免费   86篇
化学   212篇
力学   34篇
综合类   14篇
数学   1378篇
物理学   332篇
  2024年   1篇
  2023年   19篇
  2022年   29篇
  2021年   33篇
  2020年   32篇
  2019年   32篇
  2018年   36篇
  2017年   32篇
  2016年   34篇
  2015年   34篇
  2014年   87篇
  2013年   166篇
  2012年   75篇
  2011年   89篇
  2010年   78篇
  2009年   116篇
  2008年   141篇
  2007年   116篇
  2006年   88篇
  2005年   87篇
  2004年   72篇
  2003年   63篇
  2002年   66篇
  2001年   44篇
  2000年   56篇
  1999年   39篇
  1998年   43篇
  1997年   30篇
  1996年   28篇
  1995年   31篇
  1994年   20篇
  1993年   16篇
  1992年   15篇
  1991年   8篇
  1990年   14篇
  1989年   4篇
  1988年   4篇
  1987年   5篇
  1986年   12篇
  1985年   9篇
  1984年   8篇
  1983年   4篇
  1982年   15篇
  1981年   5篇
  1980年   9篇
  1979年   10篇
  1978年   9篇
  1977年   4篇
  1976年   1篇
  1969年   1篇
排序方式: 共有1970条查询结果,搜索用时 15 毫秒
1.
2.
3.
用连分数给出了实二次域理想类的zeta-函数-1处值的一个具体的计算公式.  相似文献   
4.
In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.  相似文献   
5.
The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.  相似文献   
6.
In this paper we consider an initial boundary value problem for a reaction-diffusion equation under nonlinear and nonlocal Robin type boundary condition. Assuming the existence of an ordered pair of upper and lower solutions we establish a generalized quasilinearization method for the problem under consideration whose characteristic feature consists in the construction of monotone sequences converging to the unique solution within the interval of upper and lower solutions, and whose convergence rate is quadratic. Thus this method provides an efficient iteration technique that produces not only improved approximations due to the monotonicity of its iterates, but yields also a measure of the convergence rate.  相似文献   
7.
In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K50. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049  相似文献   
8.
We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.  相似文献   
9.
工程施工中运输网络优化方案   总被引:5,自引:0,他引:5  
施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .  相似文献   
10.
The purpose of this paper is to give the Reid ``Roundabout Theorem' for quadratic functionals with general boundary conditions. In particular, we describe the so-called coupled point and regularity condition introduced in [16] in terms of Riccati equation solutions. Accepted 27 February 1996  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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