全文获取类型
收费全文 | 31073篇 |
免费 | 4275篇 |
国内免费 | 1212篇 |
专业分类
化学 | 4436篇 |
晶体学 | 355篇 |
力学 | 700篇 |
综合类 | 289篇 |
数学 | 2428篇 |
物理学 | 5271篇 |
无线电 | 23081篇 |
出版年
2024年 | 141篇 |
2023年 | 544篇 |
2022年 | 1059篇 |
2021年 | 1270篇 |
2020年 | 1226篇 |
2019年 | 787篇 |
2018年 | 676篇 |
2017年 | 1076篇 |
2016年 | 1229篇 |
2015年 | 1335篇 |
2014年 | 2244篇 |
2013年 | 2052篇 |
2012年 | 2238篇 |
2011年 | 2186篇 |
2010年 | 1744篇 |
2009年 | 1647篇 |
2008年 | 1828篇 |
2007年 | 1849篇 |
2006年 | 1708篇 |
2005年 | 1437篇 |
2004年 | 1309篇 |
2003年 | 1295篇 |
2002年 | 947篇 |
2001年 | 869篇 |
2000年 | 753篇 |
1999年 | 568篇 |
1998年 | 466篇 |
1997年 | 422篇 |
1996年 | 419篇 |
1995年 | 297篇 |
1994年 | 234篇 |
1993年 | 186篇 |
1992年 | 127篇 |
1991年 | 91篇 |
1990年 | 67篇 |
1989年 | 43篇 |
1988年 | 39篇 |
1987年 | 23篇 |
1986年 | 24篇 |
1985年 | 23篇 |
1984年 | 17篇 |
1983年 | 7篇 |
1982年 | 10篇 |
1981年 | 13篇 |
1980年 | 4篇 |
1979年 | 7篇 |
1978年 | 3篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1959年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
In this paper, symbolic code matrix ,constant matrix and count matrix are defined .The first twomatrices are used to describe the elemental expression of augmented matrix and the nede admittance equa-tion is thus obtained. The third matrix is used to obtain the incoming degree matrix, and according to thematrix all the 1- factors of the Coates graph are given. By using the data code, the determinant is expandedand the same items in the expansion are merged. Thus the symbolic network function in which no term can-cellation occurs is generated. 相似文献
72.
A profit-maximizing supply chain network design model with demand choice flexibility 总被引:1,自引:0,他引:1
Zuo-Jun Max Shen 《Operations Research Letters》2006,34(6):673-682
We present a profit-maximizing supply chain design model in which a company has flexibility in determining which customers to serve. The company may lose a customer to competition if the price it charges is too high. We show the problem formulation and solution algorithm, and discuss computational results. 相似文献
73.
Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak
estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum,
minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity
networks is considered.
Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002 相似文献
74.
采用封闭网络模型,按照电路元件参数,采用开路、短路和着色运算,将电路图逐层分解,得到网络展开图.给出网络展开图的概念和运算规则,指出网络展开图中从根到末稍每个路径的值就是网络行列式展开式中的一个有效项,从而由网络展开图得到符号网络函数.该方法直接对电路图进行运算,不需要建立任何形式的电路方程和行列式,适用于一般的有源电路,而且能生成各种类型的网络函数. 相似文献
75.
76.
Bandwidth Adaptation Algorithms for Adaptive Multimedia Services in Mobile Cellular Networks 总被引:3,自引:0,他引:3
The fluctuation of available link bandwidth in mobilecellular networks motivates the study of adaptive multimediaservices, where the bandwidth of an ongoing multimedia call can bedynamically adjusted. We analyze the diverse objectives of theadaptive multimedia framework and propose two bandwidth adaptationalgorithms (BAAs) that can satisfy these objectives. The firstalgorithm, BAA-RA, takes into consideration revenue and``anti-adaptation' where anti-adaptation means that a user feelsuncomfortable whenever the bandwidth of the user's call ischanged. This algorithm achieves near-optimal total revenue withmuch less complexity compared to an optimal BAA. The secondalgorithm, BAA-RF, considers revenue and fairness, and aims at themaximum revenue generation while satisfying the fairnessconstraint defined herein. Comprehensive simulation experimentsshow that the difference of the total revenue of BAA-RA and thatof an optimal BAA is negligible. Also, numerical results revealthat there is a conflicting relationship between anti-adaptationand fairness. 相似文献
77.
78.
79.
2Mbit/s高速信令链路在移动通信七号信令网中的应用 总被引:1,自引:0,他引:1
通过对2Mbit/s高速信令链路原理、特点的介绍,阐明了该技术在现阶段使用的实际意义,并给出了2Mbit/s高速信令链路在移动通信七号信令网中的应用。 相似文献
80.
The large deviation principle (LDP) which has been effectively used in queueing analysis is the sample path LDP, the LDP in a function space endowed with the uniform topology. Chang [5] has shown that in the discrete-time G/D/1 queueing system under the FIFO discipline, the departure process satisfies the sample path LDP if so does the arrival process. In this paper, we consider arrival processes satisfying the LDP in a space of measures endowed with the weak* topology (Lynch and Sethuraman [12]) which holds under a weaker condition. It is shown that in the queueing system mentioned above, the departure processes still satisfies the sample path LDP. Our result thus covers arrival processes which can be ruled out in the work of Chang [5]. The result is then applied to obtain the exponential decay rate of the queue length probability in an intree network as was obtained by Chang [5], who considered the arrival process satisfying the sample path LDP. 相似文献