全文获取类型
收费全文 | 1793篇 |
免费 | 117篇 |
国内免费 | 46篇 |
专业分类
化学 | 162篇 |
晶体学 | 2篇 |
力学 | 121篇 |
综合类 | 23篇 |
数学 | 1276篇 |
物理学 | 372篇 |
出版年
2023年 | 37篇 |
2022年 | 32篇 |
2021年 | 44篇 |
2020年 | 32篇 |
2019年 | 29篇 |
2018年 | 28篇 |
2017年 | 62篇 |
2016年 | 82篇 |
2015年 | 61篇 |
2014年 | 89篇 |
2013年 | 134篇 |
2012年 | 109篇 |
2011年 | 74篇 |
2010年 | 63篇 |
2009年 | 132篇 |
2008年 | 95篇 |
2007年 | 112篇 |
2006年 | 106篇 |
2005年 | 75篇 |
2004年 | 69篇 |
2003年 | 46篇 |
2002年 | 61篇 |
2001年 | 49篇 |
2000年 | 35篇 |
1999年 | 26篇 |
1998年 | 30篇 |
1997年 | 43篇 |
1996年 | 37篇 |
1995年 | 24篇 |
1994年 | 14篇 |
1993年 | 19篇 |
1992年 | 10篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 5篇 |
1986年 | 7篇 |
1985年 | 12篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 6篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 3篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有1956条查询结果,搜索用时 15 毫秒
1.
间歇式高速同步相机新型全数字化微机控制系统 总被引:2,自引:2,他引:0
本文提出了一种间歇式高速同步相机的全新设计方法,介绍了系统的工作原理,硬件,软件设计以及核心控制算法,最后给出了实际应用结果。 相似文献
2.
3.
Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies. 相似文献
4.
Dalila B. M. M. Fontes Eleni Hadjiconstantinou Nicos Christofides 《Journal of Global Optimization》2006,34(1):97-125
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations
of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on
the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving
transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation
of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial
solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as
a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively
improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications.
Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to
improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can
be obtained for concave cost network flow problems, particularly for fixed-charge problems. 相似文献
5.
Arnon Arazi Eshel Ben-Jacob Uri Yechiali 《Mathematical Methods of Operations Research》2005,62(3):453-466
We consider a Jackson-type network comprised of two queues having state-dependent service rates, in which the queue lengths
evolve periodically, exhibiting noisy cycles. To reduce this noise a certain heuristic, utilizing regions in the phase space
in which the system behaves almost deterministically, is applied. Using this heuristic, we show that in order to decrease
the probability of a customers overflow in one of the queues in the network, the server in that same queue – contrary to intuition
– should be shut down for a short period of time. Further noise reduction is obtained if the server in the second queue is
briefly shut down as well, when certain conditions hold. 相似文献
6.
7.
本文利用我国上市公司1997至2002年的有关财务数据,建立了我国上市公司资本成本面板数据模型,运用该模型分析了我国上市公司资本成本与财务杠杆、企业规模的关系.结果表明,财务杠杆的提升、企业规模的扩大将使资本成本下降.该结论对我国上市公司优化资本结构、提高企业价值具有一定的参考价值. 相似文献
8.
工程施工中运输网络优化方案 总被引:5,自引:0,他引:5
施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 . 相似文献
9.
10.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献