首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   406548篇
  免费   8886篇
  国内免费   4952篇
化学   190835篇
晶体学   4795篇
力学   14389篇
综合类   241篇
数学   39692篇
物理学   103580篇
无线电   66854篇
  2021年   3177篇
  2020年   3335篇
  2019年   3289篇
  2018年   3192篇
  2017年   3099篇
  2016年   5603篇
  2015年   4975篇
  2014年   6655篇
  2013年   17198篇
  2012年   14067篇
  2011年   16994篇
  2010年   11315篇
  2009年   11936篇
  2008年   16724篇
  2007年   17324篇
  2006年   16601篇
  2005年   15424篇
  2004年   13751篇
  2003年   12167篇
  2002年   12000篇
  2001年   13237篇
  2000年   10607篇
  1999年   8769篇
  1998年   7477篇
  1997年   7210篇
  1996年   7179篇
  1995年   6674篇
  1994年   6339篇
  1993年   6094篇
  1992年   6518篇
  1991年   6334篇
  1990年   5826篇
  1989年   5392篇
  1988年   5567篇
  1987年   4548篇
  1986年   4432篇
  1985年   6111篇
  1984年   6115篇
  1983年   5022篇
  1982年   5367篇
  1981年   5330篇
  1980年   5073篇
  1979年   5127篇
  1978年   5109篇
  1977年   5064篇
  1976年   4998篇
  1975年   4881篇
  1974年   4753篇
  1973年   4883篇
  1972年   2838篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
61.
Nash equilibria of packet forwarding strategies in wireless ad hoc networks   总被引:8,自引:0,他引:8  
In self-organizing ad hoc networks, all the networking functions rely on the contribution of the participants. As a basic example, nodes have to forward packets for each other in order to enable multihop communication. In recent years, incentive mechanisms have been proposed to give nodes incentive to cooperate, especially in packet forwarding. However, the need for these mechanisms was not formally justified. In this paper, we address the problem of whether cooperation can exist without incentive mechanisms. We propose a model,based on game theory and graph theory to investigate equilibrium conditions of packet forwarding strategies. We prove theorems about the equilibrium conditions for both cooperative and noncooperative strategies. We perform simulations to estimate the probability that the conditions for a cooperative equilibrium hold in randomly generated network scenarios.. As the problem is involved, we deliberately restrict ourselves to a static configuration. We conclude that in static ad hoc networks where the relationships between the nodes are likely to be stab le-cooperation needs to be encouraged.  相似文献   
62.
This brief presents and compares several recursive and nonrecursive techniques for the efficient computation of the running average of discrete signals. First of all, the standard recursive algorithm is considered and its long-term accuracy is assessed when the floating-point arithmetic is employed. A cheap refreshing strategy is proposed as a means of keeping the computed value close enough to the exact one. Then, two alternative nonrecursive algorithms, requiring only log2N additions, are developed, which are as reliable and accurate as the direct implementation  相似文献   
63.
The variation of current density with bias or temperature is examined for DNA molecules of different configuration. To this end, the DNA molecule is represented as an equivalent electrical network whose behavior is then simulated with PSPICE. The results are found to be in close agreement with ones obtained within a physical model. It is established that the electrical response of a DNA molecule to an applied electric field depends on the boundary conditions and the potential profile along the molecule. This finding should contribute to the creation of a complete library of DNA-molecule configurations with prescribed electrical properties.  相似文献   
64.
This paper provides an overview of the main aspects of modern fluorescence microscopy. It covers the principles of fluorescence and highlights the key discoveries in the history of fluorescence microscopy. The paper also discusses the optics of fluorescence microscopes and examines the various types of detectors. It also discusses the signal and image processing challenges in fluorescence microscopy and highlights some of the present developments and future trends in the field.  相似文献   
65.
Spectrum asked three IEEE members from the telecommunications sector to comment on the industry's current woes and prospects. Roch Guerin discusses bandwidth as a commodity and how to deal with it. The impact of technological change on telecommunications is enormous and calls for a shift in business models. Technology is making bandwidth a commodity and it should not matter who supplies it. Competition is vital and commodity providers must be decoupled from value providers. Frank Ferrante points out that the Year 2000 crisis resulted in manufacturers being deluged with orders for new upgraded systems. Vast sums were spent to meet the demand in time. However, when Y2K was over, production stayed high and inventories continued to build, while demand effectively stopped overnight. Dazzling new innovations are needed to compel the masses to spend and manufacturers must apply their resources to deliver quickly and efficiently. Jules A. Bellisio discusses the role of engineers in bringing new ideas to the market place. Many engineers have put together ventures for the sole purpose of attracting capital. The underlying technology and business propositions were there solely to lure the unsuspecting. By allowing engineers to use technology simply to cover for a scam, then the profession is also to blame for the current problems.  相似文献   
66.
A binary extended 1-perfect code of length n + 1 = 2/sup t/ is additive if it is a subgroup of /spl Zopf//sub 2//sup /spl alpha// /spl times/ /spl Zopf//sub 4//sup /spl beta//. The punctured code by deleting a /spl Zopf//sub 2/ coordinate (if there is one) gives a perfect additive code. 1-perfect additive codes were completely characterized and by using that characterization we compute the possible parameters /spl alpha/, /spl beta/, rank, and dimension of the kernel for extended 1-perfect additive codes. A very special case is that of extended 1-perfect /spl Zopf//sub 4/-linear codes.  相似文献   
67.
Parameterisation of slant-Haar transforms   总被引:1,自引:0,他引:1  
A parameterisation of the slant-Haar transform is presented, which includes an existing version of the slant-Haar transform. An efficient algorithm for the slant-Haar transform is developed and its computational complexity is estimated. The parametric slant-Haar transforms are compared to the Karhunen-Loeve transform. The parametric slant-Haar is shown to perform better than the commonly used slant-Haar and slant-Hadamard transforms for the first-order Markov model and also performs better than the discrete cosine transform for images approximated by the generalised image correlation model  相似文献   
68.
Performance enhancing proxies (PEPs) are widely used to improve the performance of TCP over high delay‐bandwidth product links and links with high error probability. In this paper we analyse the performance of using TCP connection splitting in combination with web caching via traces obtained from a commercial satellite system. We examine the resulting performance gain under different scenarios, including the effect of caching, congestion, random loss and file sizes. We show, via analysing our measurements, that the performance gain from using splitting is highly sensitive to random losses and the number of simultaneous connections, and that such sensitivity is alleviated by caching. On the other hand, the use of a splitting proxy enhances the value of web caching in that cache hits result in much more significant performance improvement over cache misses when TCP splitting is used. We also compare the performance of using different versions of HTTP in such a system. Copyright © 2003 John Wiley & Sons, Ltd.  相似文献   
69.
70.
A new dual-quantisation sigma-delta modulator is proposed, which introduces an additional feedback path in the input of the second integrator. In this way, unlike other dual-quantisation architectures, larger signal-to-noise ratios can be obtained by means of aggressive noise-shaping, like in a conventional multibit modulator. The proposed modulator is also shown to be more robust against non-idealities than other dual-quantisation architectures.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号