全文获取类型
收费全文 | 22315篇 |
免费 | 3000篇 |
国内免费 | 636篇 |
专业分类
化学 | 812篇 |
晶体学 | 15篇 |
力学 | 1060篇 |
综合类 | 392篇 |
数学 | 7567篇 |
物理学 | 2950篇 |
无线电 | 13155篇 |
出版年
2024年 | 77篇 |
2023年 | 277篇 |
2022年 | 523篇 |
2021年 | 615篇 |
2020年 | 594篇 |
2019年 | 516篇 |
2018年 | 538篇 |
2017年 | 753篇 |
2016年 | 977篇 |
2015年 | 979篇 |
2014年 | 1631篇 |
2013年 | 1504篇 |
2012年 | 1550篇 |
2011年 | 1654篇 |
2010年 | 1188篇 |
2009年 | 1363篇 |
2008年 | 1477篇 |
2007年 | 1568篇 |
2006年 | 1281篇 |
2005年 | 1087篇 |
2004年 | 914篇 |
2003年 | 800篇 |
2002年 | 693篇 |
2001年 | 562篇 |
2000年 | 475篇 |
1999年 | 378篇 |
1998年 | 341篇 |
1997年 | 276篇 |
1996年 | 259篇 |
1995年 | 183篇 |
1994年 | 139篇 |
1993年 | 126篇 |
1992年 | 115篇 |
1991年 | 60篇 |
1990年 | 64篇 |
1989年 | 44篇 |
1988年 | 61篇 |
1987年 | 31篇 |
1986年 | 36篇 |
1985年 | 57篇 |
1984年 | 52篇 |
1983年 | 18篇 |
1982年 | 28篇 |
1981年 | 11篇 |
1980年 | 17篇 |
1979年 | 11篇 |
1978年 | 9篇 |
1977年 | 14篇 |
1976年 | 5篇 |
1959年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
2.
Information‐Centric Networking (ICN) has been accepted to overcome some weaknesses of the current Internet architecture, showing that “what is being exchanged” is more important than “who are exchanging information.” Given the inadequate considerations on Quality of Service (QoS) and energy saving in ICN routing, we propose in this paper a routing algorithm to enhance the two aspects. At first, on one hand, Cauchy distribution is used as a fuzzy model to evaluate users' QoS requirements, such as bandwidth, delay, and error rate; on the other hand, we formulate energy saving problem to evaluate the green quality of routing algorithm. Then, we design a link selection approach by considering QoS and energy saving, which belongs to a multi‐objective decision problem resolved by intelligent drops algorithm. Finally, we implement the proposed algorithm and compare it with the famous adaptive forwarding mechanism in terms of some significant metrics, and the experimental results reveal that the proposed algorithm is more efficient. 相似文献
3.
4.
Namyong Kim 《ETRI Journal》2006,28(2):155-161
In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance. 相似文献
5.
Ben-Jye Chang 《Telecommunication Systems》2006,33(4):333-352
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for
achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each
accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic
rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long
handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost
of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher
Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose
herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce
the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed
approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments.
Meanwhile, the optimal number of rake combiners is also analyzed in this paper.
This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018. 相似文献
6.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
7.
论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。 相似文献
8.
基于ISO/IEC17799标准建立了一个综合的信息系统风险分析框架,并运用模糊多准则决策(FMCDM)方法计算信息安全风险,根据风险等级矩阵(RLM)对信息资产风险进行级别划分,最终建立评估信息资产相关风险的完整模型。 相似文献
9.
文[1]提出了两个DEA的逆问题,并用搜索法来解.而本文根据所证的定理,对每个问题一般只要解二、三个线性规划问题就能得到答案. 相似文献
10.
改进型遗传算法在加载天线设计中的运用 总被引:5,自引:2,他引:3
遗传算法是一种全新的优化搜索方法,可以用来解决各种复杂的实际问题。针对简单型遗传算法的一些不足之处,介绍了一种改进型的遗传算法,并阐述了其在短波宽带集总加载天线优化设计中的运用。 相似文献