全文获取类型
收费全文 | 3513篇 |
免费 | 1016篇 |
国内免费 | 74篇 |
专业分类
化学 | 28篇 |
力学 | 90篇 |
综合类 | 30篇 |
数学 | 564篇 |
物理学 | 1293篇 |
无线电 | 2598篇 |
出版年
2024年 | 11篇 |
2023年 | 44篇 |
2022年 | 61篇 |
2021年 | 76篇 |
2020年 | 83篇 |
2019年 | 45篇 |
2018年 | 67篇 |
2017年 | 112篇 |
2016年 | 138篇 |
2015年 | 152篇 |
2014年 | 284篇 |
2013年 | 271篇 |
2012年 | 347篇 |
2011年 | 357篇 |
2010年 | 305篇 |
2009年 | 266篇 |
2008年 | 340篇 |
2007年 | 334篇 |
2006年 | 250篇 |
2005年 | 209篇 |
2004年 | 172篇 |
2003年 | 177篇 |
2002年 | 119篇 |
2001年 | 95篇 |
2000年 | 59篇 |
1999年 | 50篇 |
1998年 | 37篇 |
1997年 | 36篇 |
1996年 | 24篇 |
1995年 | 25篇 |
1994年 | 12篇 |
1993年 | 8篇 |
1992年 | 3篇 |
1991年 | 6篇 |
1990年 | 5篇 |
1989年 | 1篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1983年 | 6篇 |
1982年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有4603条查询结果,搜索用时 0 毫秒
941.
A. Wilde 《Wireless Personal Communications》1998,8(2):113-130
The delay-locked loop (DLL) is a synchronization device that is widely used for PN-code tracking in spread spectrum systems. The error detector characteristic (S-curve) of the DLL has a major impact on the performance. Using more than two correlators will extend the tracking range of the S-curve. The Generalized DLL (GenDLL) theory provides a concept to analyze a large class of DLL configurations including the classical DLL. The focus of the performance criteria is on tracking jitter and the mean time to lose lock (MTLL). It is shown that the MTLL can be considerably improved by using extended S-curves. However, the tracking jitter is increased by additional correlators. The tradeoff between the two criteria is explained. With the GenDLL theory loop configurations can be designed having both low tracking jitter and high loop robustness against loss of lock. 相似文献
942.
一种新的混沌调制技术在保密通信中的应用 总被引:1,自引:1,他引:0
提出一种混沌脉冲宽度调制(CPWM)新技术,它将数字信息隐藏在脉冲的宽度之中,给出了基于一维、高维混沌动力学系统的实现模型。讨论了系统的同步措施及保密性;并用Matlab仿真,给出了相关的仿真结果。 相似文献
943.
F. Baccelli F. I. Karpelevich M. Ya. Kelbert A. A. Puhalskii A. N. Rybko Yu. M. Suhov 《Journal of statistical physics》1992,66(3-4):803-825
A model of centralized symmetric message-switched networks is considered, where the messages having a common address must be served in the central node in the order which corresponds to their epochs of arrival to the network. The limitN is discussed, whereN is the branching number of the network graph. This procedure is inspired by an analogy with statistical mechanics (the mean-field approximation). The corresponding limit theorems are established and the limiting probability distribution for the network response time is obtained. Properties of this distribution are discussed in terms of an associated boundary problem. 相似文献
944.
如今的移动通信网络是由多种制式及多个频段融合而成的多模网络,对于商用终端而言,多种难题交织在一起,其中待机时长是必须要解决的一个关键问题.为此,不同于传统增大电池容量的方法,采用降低待机功耗的策略:时域的时隙控制、频域的电流控制、睡眠和唤醒的电源门控制、低频时钟高频化,其中高频时钟校准低频时钟是降低睡眠态功耗的关键措施.这一系列方案的实施,使得终端在多模实际网络环境下的待机电流小于5 mA,终端的待机低功耗达到了有竞争力的商用水平. 相似文献
945.
In this paper, a new method for secure communication based on chaos synchronization is proposed. It is consisted of a state feedback controller and a robust control term using the Fourier series expansion for compensation of uncertainties. In comparison with other uncertainty estimators such as neural networks and fuzzy systems, Fourier series are more efficient, since they have fewer tuning. Thus, their tuning process is simpler. Similar to the parameters of fuzzy systems, Fourier series coefficients are estimated online using the adaptation rule obtained from stability analysis. The case study is the Duffing–Holmes oscillator. Also, observer-based secure communication using the Fourier series expansion has been proposed. Simulation results and comparisons, reveal the superiority of the proposed approach. 相似文献
946.
F. Bonomi 《Queueing Systems》1987,1(3):289-309
Assembly-like queues model assembly operations where separate input processes deliver different types of component (customer) and the service station assembles (serves) these input requests only when the correct mix of components (customers) is present at the input. In this work, we develop an effective approximate analytical solution for an assembly-like queueing system withN(N 2) classes of customers formingN independent Poisson arrival streams with rates {i=1,...,N} The arrival of a class of customers is turned off whenever the number of customers of that class in the system exceeds the number for any of the other classes by a certain amount. The approximation is based on the decomposition of the originalN input stream stage into a cascade ofN-1 two-input stream stages. This allows one to refer to the theory of paired customer systems as a foundation of the analysis, and makes the problem computationally tractable. Performance measures such as server utilization, throughput, average delays, etc., can then be easily computed. For illustrative purposes, the theory and techniques presented are applied to the approximate analysis of a system withN = 3. Numerical examples show that the approximation is very accurate over a wide range of parameters of interest. 相似文献
947.
948.
基于光子学技术,设计了一种针对远程分布式微波信号接收的码元速率估计方案。首先,远程终端将接收的微波信号经电光调制器对连续激光源进行载波抑制双边带调制,生成携带微波信号的两个光边带信号;此光信号经光纤链路传输至中心站在光域滤除其中一个边带;其次,进行光电探测,通过分析电频谱的谐波实现微波信号码元速率估计。针对此方案,搭建仿真及实验系统装置:仿真成功地从60 GHz微波信号中提取出0.8 GBaud和6 GBaud的二进制伪随机码(PRBS)信号码元速率、从25 GHz微波信号中提取出3 GBaud的PRBS码元速率;实验成功地从25 GHz的微波信号中提取出3 GBaud和5 GBaud的PRBS码元速率。 相似文献
949.
Kurtosis is known to be effective at estimating signal timing and carrier phase offset when the processing is performed in a “burst mode,” that is, operating on a block of received signal in an offline fashion. In this paper, kurtosis-based estimation is extended to provide tracking of timing and carrier phase, and frequency offsets. The algorithm is compared with conventional PLL-type timing/phase estimation and shown to be superior in terms of speed of convergence, with comparable variance in the matched filter output symbols. 相似文献
950.
The existing time synchronization schemes in sensor networks were not designed with security in mind, thus leaving them vulnerable to security attacks. In this paper, we first identify various attacks that are effective to several representative time synchronization schemes, and then focus on a specific type of attack called delay attack, which cannot be addressed by cryptographic techniques. Next we propose two approaches to detect and accommodate the delay attack. Our first approach uses the generalized extreme studentized deviate (GESD) algorithm to detect multiple outliers introduced by the compromised nodes; our second approach uses a threshold derived using a time transformation technique to filter out the outliers. Finally we show the effectiveness of these two schemes through extensive simulations. 相似文献