全文获取类型
收费全文 | 4417篇 |
免费 | 188篇 |
国内免费 | 39篇 |
专业分类
化学 | 222篇 |
晶体学 | 8篇 |
力学 | 35篇 |
综合类 | 13篇 |
数学 | 644篇 |
物理学 | 329篇 |
无线电 | 3393篇 |
出版年
2024年 | 2篇 |
2023年 | 51篇 |
2022年 | 74篇 |
2021年 | 82篇 |
2020年 | 84篇 |
2019年 | 44篇 |
2018年 | 61篇 |
2017年 | 82篇 |
2016年 | 108篇 |
2015年 | 136篇 |
2014年 | 287篇 |
2013年 | 348篇 |
2012年 | 281篇 |
2011年 | 243篇 |
2010年 | 246篇 |
2009年 | 257篇 |
2008年 | 254篇 |
2007年 | 241篇 |
2006年 | 236篇 |
2005年 | 186篇 |
2004年 | 217篇 |
2003年 | 167篇 |
2002年 | 176篇 |
2001年 | 99篇 |
2000年 | 130篇 |
1999年 | 104篇 |
1998年 | 83篇 |
1997年 | 79篇 |
1996年 | 60篇 |
1995年 | 32篇 |
1994年 | 46篇 |
1993年 | 18篇 |
1992年 | 22篇 |
1991年 | 22篇 |
1990年 | 16篇 |
1989年 | 18篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 6篇 |
1983年 | 7篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1980年 | 2篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1974年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有4644条查询结果,搜索用时 800 毫秒
61.
62.
The article analyzes the influence of the Internet Protocol (IP) access interface on the packet loss probability and delay
times in the optical packet switched network. The network and node model have been proposed, and the structure of the IP access
interface, including assembler and holder, have been included in the analysis. It has been shown that the increase of the
maximum optical packet sizes, as well as use of the holding feature as contention resolution mechanism, decrease the packet
loss probability, but introduce delays at the optical network access points. Modeling and analysis were based on the discrete
event simulation assuming self-similar traffic sources. IP packet lengths were modeled using empirical data.
This work has been conducted while the author was affiliated with the Telecommunication Laboratory, Swiss Federal Institute
of Technology (EPFL-STI-ITOP-TCOM), Lausanne, Switzerland 相似文献
63.
电信管理及运营支撑是爱立信公司为公用电信网提供的有关管理及运营支撑功能的综合方案,本文介绍了其中的公网管理系统和蜂窝移动网络管理系统。 相似文献
64.
65.
本文从地域通信网的特点出发,分析了以前所使用的路由选择方法的优缺点,提出了网控支持的基于业务量的动态中币管理方法,并描述了该路由管理方法的分层结构和在地域网网络管理系统中的具体实现。 相似文献
66.
本文结合江苏C4本地网的实际情况,说明C4本地网纳入C3本地电话网的必要性,例举了4种C3本地网的组网方式。 相似文献
67.
Matthew D. Bailey Steven M. Shechter Andrew J. Schaefer 《Operations Research Letters》2006,34(3):307-315
We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We introduce SPAR, which utilizes mixed-integer programming for the design decision and a Markov decision process (MDP) for the modeling of our adversarial phase. 相似文献
68.
Variable Rate (VR) speech coders are classified into: source-controlled VR coders where the rate is selected depending on the local character of the speech, and network-controlled VR coders where an external control signal selects the coding rate. The first category benefits from the variable rate channels used by Code Division Multiple Access (CDMA) mobile communications. The second category is indispensable for the right behaviour of the CDMA systems under conditions as high traffic levels. The VR speech coder presented in this communication exhibits both types of control. The source control is achieved by means of a Voice Activity Detector (VAD) and a phonetic classifier. The network control acts on the selection procedure of the multipulse excitation sequence to the synthesis filter. This is the main advantage of our VR MultiPulse speech coder because by means of an external signal the bit rate can be changed only every 4 msec, without transitions or distortions. Considering one-way communication, six different operating rates can be externally selected ranging from 4.8 to 9.1 kbps for the active frames; an average bit rate of 380 bps is required for the noise frames.This work has been partly funded by the Spanish Research National Plan under grant no. TIC92-0800-C05-02 and by Northern Telecom. 相似文献
69.
We consider the problem of finding maximal flows with respect to capacities which are linear functions of a parametert [0,T]. Since this problem is a special case of a parametric linear program the classichorizontal approach can be applied in which optimal solutions are computed for successive subintervals of [0,T]. We discuss an alternative algorithm which approximates in each iteration the optimal solution for allt [0,T]. Thisvertical algorithm is a labeling type algorithm where the flow variables are piecewise linear functions. Flow augmentations are done alongconditional flow augmenting paths which can be found by modified path algorithms. The vertical algorithm can be used to solve the parametric flow problem optimally as well as to compute a good approximation for allt if the computation of the optimal solution turns out to be too time consuming.Partially supported by NSF Grants ECS-8412926 and INT-8521433, and NATO Grant RG 85/0240. 相似文献
70.