全文获取类型
收费全文 | 13780篇 |
免费 | 1592篇 |
国内免费 | 193篇 |
专业分类
化学 | 1713篇 |
晶体学 | 15篇 |
力学 | 175篇 |
综合类 | 88篇 |
数学 | 1799篇 |
物理学 | 1860篇 |
无线电 | 9915篇 |
出版年
2024年 | 28篇 |
2023年 | 202篇 |
2022年 | 264篇 |
2021年 | 354篇 |
2020年 | 364篇 |
2019年 | 265篇 |
2018年 | 276篇 |
2017年 | 377篇 |
2016年 | 474篇 |
2015年 | 504篇 |
2014年 | 840篇 |
2013年 | 1014篇 |
2012年 | 868篇 |
2011年 | 839篇 |
2010年 | 779篇 |
2009年 | 820篇 |
2008年 | 865篇 |
2007年 | 967篇 |
2006年 | 774篇 |
2005年 | 699篇 |
2004年 | 589篇 |
2003年 | 592篇 |
2002年 | 483篇 |
2001年 | 449篇 |
2000年 | 326篇 |
1999年 | 262篇 |
1998年 | 194篇 |
1997年 | 188篇 |
1996年 | 195篇 |
1995年 | 163篇 |
1994年 | 132篇 |
1993年 | 80篇 |
1992年 | 76篇 |
1991年 | 48篇 |
1990年 | 30篇 |
1989年 | 34篇 |
1988年 | 29篇 |
1987年 | 17篇 |
1986年 | 17篇 |
1985年 | 20篇 |
1984年 | 15篇 |
1983年 | 3篇 |
1982年 | 14篇 |
1981年 | 15篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 2篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 765 毫秒
51.
52.
In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network
with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities
and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the
network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability.
The problem is to route the multicast session from each source to the members of every multicast session, and to assign an
appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session
provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per
multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the
current network topology as well as its residual network resource information. We formulate the per session multicast routing
and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success
probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed
online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation
results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes
are SaD nodes. 相似文献
53.
在组合系统运用Kalman滤波器技术时,准确的系统模型和可靠的观测数据是保证其性能的重要因素,否则将大大降低Kalman滤波器的估计精度,甚至导致滤波器发散.为解决上述Kalman应用中的实际问题,提出了一种新颖的基于进化人工神经网络技术的自适应Kalman滤波器.仿真试验表明该算法可以在系统模型不准确时、甚至外部观测数据短暂中断时,仍能保证Kalman滤波器的性能. 相似文献
54.
55.
TCP/IP网络的动态模型描述 总被引:2,自引:0,他引:2
拥塞现象成为TCP/IP网络发展面临的一个重要问题。因此,拥塞控制对TCP/IP网络的鲁棒性和稳定性具有重要作用。目前,网络拥塞控制策略主要包括两类:端到端的控制机制,如TCP拥塞控制算法;网络内部的主动队列管理(AQM)策略。但由于缺乏对网络系统动态特性的了解,这些拥塞控制策略大都基于专家经验,并没有建立完整的理论分析框架。为此,本文从数据流的角度出发,通过建立网络基本单元状态方程模型来实现IP网络系统的数学解析模型,然后用混杂系统来描述TCP带有拥塞控制策略的数据传输过程,建立了TCP/IP网络的动态模型,为网络系统中动态性能的分析、拥塞控制策略的设计奠定了基础。实验结果表明,该数学模型与NS仿真实验的结果相一致。 相似文献
56.
探讨了中国3G牌照何时发放、发放数量、牌照与标准是否捆绑、3G产业链如何搭建、频率如何分配、市场容量和终端等问题,并对此提出了建设性的意见。 相似文献
57.
This article compares the performance of WDM lightpath protection and IP LSP protection schemes for IP-over-WDM networks. A mathematical formulation of the maximum throughput problem is presented and analytical expressions for recovery time are derived for both schemes. The throughputs and recovery times are analyzed and compared. Results show that the IP LSP protection scheme presents higher throughputs then WDM lightpath protection. The IP LSP protection scheme, providing individual IP LSP protection has, however, scalability problems. This scheme presents high recovery times when a failure affects many lightpaths and many hops are allowed for the primary routes of IP LSPs. 相似文献
58.
For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions. 相似文献
59.
Consider a network where two routes are available for users wishing to travel from a source to a destination. On one route (which could be viewed as private transport) service slows as traffic increases. On the other (which could be viewed as public transport) the service frequency increases with demand. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. Using the model proposed by Calvert [10], with a ⋅|M|1 queue corresponding to the private transport route, and a bulk-service infinite server queue modelling the public transport route, we give a complete analysis of this system in the setting of probabilistic routing. We obtain the user equilibria (which are not always unique), and determine their stability.AMS subject classification: 60K30, 90B15, 90B20, 91A10, 91A13This revised version was published online in June 2005 with corrected coverdate 相似文献
60.
We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1. 相似文献