全文获取类型
收费全文 | 7391篇 |
免费 | 1006篇 |
国内免费 | 316篇 |
专业分类
化学 | 663篇 |
晶体学 | 15篇 |
力学 | 412篇 |
综合类 | 57篇 |
数学 | 720篇 |
物理学 | 1259篇 |
无线电 | 5587篇 |
出版年
2024年 | 42篇 |
2023年 | 120篇 |
2022年 | 195篇 |
2021年 | 219篇 |
2020年 | 223篇 |
2019年 | 156篇 |
2018年 | 187篇 |
2017年 | 245篇 |
2016年 | 262篇 |
2015年 | 321篇 |
2014年 | 468篇 |
2013年 | 577篇 |
2012年 | 505篇 |
2011年 | 559篇 |
2010年 | 423篇 |
2009年 | 413篇 |
2008年 | 488篇 |
2007年 | 512篇 |
2006年 | 486篇 |
2005年 | 401篇 |
2004年 | 331篇 |
2003年 | 332篇 |
2002年 | 269篇 |
2001年 | 202篇 |
2000年 | 149篇 |
1999年 | 96篇 |
1998年 | 99篇 |
1997年 | 71篇 |
1996年 | 63篇 |
1995年 | 59篇 |
1994年 | 42篇 |
1993年 | 35篇 |
1992年 | 33篇 |
1991年 | 17篇 |
1990年 | 22篇 |
1989年 | 13篇 |
1988年 | 14篇 |
1987年 | 5篇 |
1986年 | 7篇 |
1985年 | 13篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1974年 | 2篇 |
1957年 | 1篇 |
排序方式: 共有8713条查询结果,搜索用时 11 毫秒
1.
This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations. 相似文献
2.
The identification rate of UHF RFID system was restricted by multipath propagation effects.The system identification performance was studied considering the correlation coefficient between forward and reverse channels.Based on the generalized Rician fading channel model,the analytical expression of identification rate was derived under independent,full correlation and correlation cases.Compared with the existing analysis,the proposed uniform calculation formula of identification rate was for any correlation coefficient and kinds of channel conditions.The numerical computation and Monte-carlo simulations show that the influences of different correlation coefficients,channel conditions,sensitivity and distance on the identification rate. 相似文献
3.
介绍了一种基于高性能浮点DSP芯片TMS320C32、CPLD芯片XC95288和A/D采样芯片AD976组成的多路采集系统的工作原理以及设计方法。通过对第一路施加特殊的电压量,在CCS开发环境下读取采样缓冲区的值,并利用Matlab对采样数据进行了全波傅氏变换。此外,该系统已在继电保护中得到广泛应用,实践表明,该系统能较好地解决多路模拟量的采集,并确保了采样数据的安全可靠性。 相似文献
4.
Frequency Insertion Strategy for Channel Assignment Problem 总被引:1,自引:0,他引:1
This paper presents a new heuristic method for quickly finding a good feasible solution to the channel assignment problem
(CAP). Like many other greedy-type heuristics for CAP, the proposed method also assigns a frequency to a call, one at a time.
Hence, the method requires computational time that increases only linear to the number of calls. However, what distinguishes
the method from others is that it starts with a narrow enough frequency band so as to provoke violations of constraints that
we need to comply with in order to avoid radio interference. Each violation is then resolved by inserting frequencies at the
most appropriate positions so that the band of frequencies expands minimally. An extensive computational experiment using
a set of randomly generated problems as well as the Philadelphia benchmark instances shows that the proposed method perform
statistically better than existing methods of its kind and even yields optimum solutions to most of Philadelphia benchmark
instances among which two cases are reported for the first time ever, in this paper.
Won-Young Shin was born in Busan, Korea in 1978. He received B.S. in industrial engineering from Pohang University of Science and Technology
(POSTECH) in 2001 and M.S in operation research and applied statistics from POSTECH in 2003. Since 2003 he has been a researcher
of Agency for Defense Development (ADD) in Korea. He is interested in optimization of communication system and applied statistics.
Soo Y. Chang is an associate professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH),
Pohang, Korea. He teaches linear programming, discrete optimization, network flows and operations research courses. His research
interests include mathematical programming and scheduling. He has published in several journals including Discrete Applied
Mathematics, Computers and Mathematics with Application, IIE Transactions, International Journal of Production Research, and
so on. He is a member of Korean IIE, and ORMSS.
Jaewook Lee is an assistant professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH),
Pohang, Korea. He received the B.S. degree in mathematics with honors from Seoul National University, and the Ph.D. degree
from Cornell University in applied mathematics in 1993 and 1999, respectively. He is currently an assistant professor in the
department of industrial engineering at the Pohang University of Science and Technology (POSTECH). His research interests
include nonlinear systems, neural networks, nonlinear optimization, and their applications to data mining and financial engineering.
Chi-Hyuck Jun was born in Seoul, Korea in 1954. He received B.S. in mineral and petroleum engineering from Seoul National University in
1977, M.S. in industrial engineering from Korea Advanced Institute of Science and Technology in 1979 and Ph.D. in operations
research from University of California, Berkeley, in 1986. Since 1987 he has been with the department of industrial engineering,
Pohang University of Science and Technology (POSTECH) and he is now a professor and the department head. He is interested
in performance analysis of communication and production systems. He has published in several journals including IIE Transactions,
IEEE Transactions, Queueing Systems and Chemometrics and Intelligent Laboratory Systems. He is a member of IEEE, INFORMS and
ASQ. 相似文献
5.
6.
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. 相似文献
7.
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. 相似文献
8.
提出一种适用于DS-CDMA无线通信系统的低计算量而性能良好的信道估计算法。在DS-CDMA系统中,当接收信号经过解扩或多用户检测等时域预处理后,可以认为干扰大大减弱、期望信号在处理后的信号中占主要地位。这样,用预处理后信号相关阵的最大特征值对应的特征矢量可以很好地近似期望信号的信道矢量。但是,直接特征分解需要很大的计算量,特征跟踪计算量较低,但瞬态性能较差。本文提出一种基于相关矩阵列矢量平均的信道估计算法,该算法不需要特征分解或跟踪。仿真结果表明:新算法在降低计算量的情况下可以获得同直接特征分解方法几乎相同的性能。 相似文献
9.
首先介绍了给图像周围加上美丽艺术花纹的方式,其次介绍了给图像周围加上美丽的像框的方式,这两种方式都能对图像周边加以修饰,其中使用了通道法,渐变法和路径法等等。读者还可以上面介绍的方法为启迪,充分发挥个人的想象力,创作出各种各样的、多姿多彩的图像边框。 相似文献
10.
研究了基于EDGE系统接收机中信道估计的实现方案,并对算法的各项性能做出评估。首先论述了算法的采用及其理论依据。接着,说明了信道预估计的原理及方法。最后,针对MAT-LAB及 DSP上的仿真结果,比较了各项系数对于系统性能改善所具有的影响和作用,对系统特性作了较为详细的分析总结。 相似文献