全文获取类型
收费全文 | 12961篇 |
免费 | 2088篇 |
国内免费 | 722篇 |
专业分类
化学 | 1938篇 |
晶体学 | 22篇 |
力学 | 2440篇 |
综合类 | 184篇 |
数学 | 2390篇 |
物理学 | 2348篇 |
无线电 | 6449篇 |
出版年
2024年 | 72篇 |
2023年 | 231篇 |
2022年 | 378篇 |
2021年 | 388篇 |
2020年 | 507篇 |
2019年 | 382篇 |
2018年 | 395篇 |
2017年 | 529篇 |
2016年 | 602篇 |
2015年 | 589篇 |
2014年 | 835篇 |
2013年 | 979篇 |
2012年 | 909篇 |
2011年 | 839篇 |
2010年 | 706篇 |
2009年 | 674篇 |
2008年 | 738篇 |
2007年 | 703篇 |
2006年 | 699篇 |
2005年 | 585篇 |
2004年 | 511篇 |
2003年 | 523篇 |
2002年 | 410篇 |
2001年 | 368篇 |
2000年 | 336篇 |
1999年 | 282篇 |
1998年 | 232篇 |
1997年 | 196篇 |
1996年 | 182篇 |
1995年 | 159篇 |
1994年 | 129篇 |
1993年 | 110篇 |
1992年 | 98篇 |
1991年 | 75篇 |
1990年 | 72篇 |
1989年 | 40篇 |
1988年 | 55篇 |
1987年 | 38篇 |
1986年 | 24篇 |
1985年 | 33篇 |
1984年 | 33篇 |
1983年 | 13篇 |
1982年 | 30篇 |
1981年 | 16篇 |
1980年 | 8篇 |
1978年 | 9篇 |
1977年 | 11篇 |
1976年 | 6篇 |
1971年 | 5篇 |
1957年 | 14篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
Josep Maria Izquierdo 《TOP》2006,14(2):375-398
The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic
allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential
players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets. 相似文献
22.
ON HYPERBOLIC TIME DISCOUNTING IN EXHAUSTIBLE RESOURCE MODELS: AN APPLICATION TO WORLD OIL RESOURCES
JOHN ROWSE 《Natural Resource Modeling》2006,19(2):243-277
ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed. 相似文献
23.
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. 相似文献
24.
CAS-BUS: A Test Access Mechanism and a Toolbox Environment for Core-Based System Chip Testing 总被引:2,自引:0,他引:2
As System on a Chip (SoC) testing faces new challenges, some new test architectures must be developed. This paper describes a Test Access Mechanism (TAM) named CAS-BUS that solves some of the new problems the test industry has to deal with. This TAM is scalable, flexible and dynamically reconfigurable. The CAS-BUS architecture is compatible with the IEEE P1500 standard proposal in its current state of development, and is controlled by Boundary Scan features.This basic CAS-BUS architecture has been extended with two independent variants. The first extension has been designed in order to manage SoC made up with both wrapped cores and non wrapped cores with Boundray Scan features. The second deals with a test pin expansion method in order to solve the I/O bandwidth problem. The proposed solution is based on a new compression/decompression mechanism which provides significant results in case of non correlated test patterns processing. This solution avoids TAM performance degradation.These test architectures are based on the CAS-BUS TAM and allow trade-offs to optimize both test time and area overhead. A tool-box environment is provided, in order to automatically generate the needed component to build the chosen SoC test architecture. 相似文献
25.
We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs. 相似文献
26.
随着无线网络所支持的业务种类的增加和具有弹性服务质量要求的业务的大量出现,与服务质量保证密切相关的呼叫接纳控制问题成了近年来无线网络研究的热点之一。本文研究了基于准马尔可夫决策过程方法的多业务最优呼叫接纳控制问题。根据业务的特点,首先引入了带宽分配满意度函数和收益率函数,在此基础上,提出了基于带宽分配满意度的最优带宽分配算法和基于准马尔可夫决策过程方法的最优呼叫接纳控制策略。计算结果表明,本文方案能够在对各类业务的呼叫阻塞率进行适当权衡的前提下,进一步提高网络的期望收益率和期望带宽利用率,同时满足了各类业务的最低服务质量要求。 相似文献
27.
28.
动态多目标决策问题的灰色分析方法 总被引:2,自引:0,他引:2
将用于固定时间截面下静态多目标决策的灰色关联理论推广到动态情形,引入局部理想最优效果和整体理想最优效果的概念,提出一种新型的动态多目标决策问题的灰色关联模型,并通过算例说明该方法的合理可行性。 相似文献
29.
30.
TCP/IP网络的动态模型描述 总被引:2,自引:0,他引:2
拥塞现象成为TCP/IP网络发展面临的一个重要问题。因此,拥塞控制对TCP/IP网络的鲁棒性和稳定性具有重要作用。目前,网络拥塞控制策略主要包括两类:端到端的控制机制,如TCP拥塞控制算法;网络内部的主动队列管理(AQM)策略。但由于缺乏对网络系统动态特性的了解,这些拥塞控制策略大都基于专家经验,并没有建立完整的理论分析框架。为此,本文从数据流的角度出发,通过建立网络基本单元状态方程模型来实现IP网络系统的数学解析模型,然后用混杂系统来描述TCP带有拥塞控制策略的数据传输过程,建立了TCP/IP网络的动态模型,为网络系统中动态性能的分析、拥塞控制策略的设计奠定了基础。实验结果表明,该数学模型与NS仿真实验的结果相一致。 相似文献