全文获取类型
收费全文 | 4734篇 |
免费 | 538篇 |
国内免费 | 239篇 |
专业分类
化学 | 482篇 |
晶体学 | 16篇 |
力学 | 222篇 |
综合类 | 87篇 |
数学 | 1969篇 |
物理学 | 775篇 |
无线电 | 1960篇 |
出版年
2024年 | 9篇 |
2023年 | 49篇 |
2022年 | 112篇 |
2021年 | 122篇 |
2020年 | 105篇 |
2019年 | 103篇 |
2018年 | 94篇 |
2017年 | 151篇 |
2016年 | 174篇 |
2015年 | 169篇 |
2014年 | 280篇 |
2013年 | 325篇 |
2012年 | 310篇 |
2011年 | 310篇 |
2010年 | 249篇 |
2009年 | 282篇 |
2008年 | 381篇 |
2007年 | 310篇 |
2006年 | 235篇 |
2005年 | 241篇 |
2004年 | 189篇 |
2003年 | 168篇 |
2002年 | 146篇 |
2001年 | 147篇 |
2000年 | 145篇 |
1999年 | 111篇 |
1998年 | 90篇 |
1997年 | 68篇 |
1996年 | 70篇 |
1995年 | 57篇 |
1994年 | 45篇 |
1993年 | 47篇 |
1992年 | 37篇 |
1991年 | 28篇 |
1990年 | 22篇 |
1989年 | 21篇 |
1988年 | 27篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 10篇 |
1984年 | 10篇 |
1983年 | 7篇 |
1982年 | 3篇 |
1981年 | 6篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1973年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有5511条查询结果,搜索用时 46 毫秒
1.
2.
We investigate the effect of dopant random fluctuation on threshold voltage and drain current variation in a two-gate nanoscale transistor. We used a quantum-corrected technology computer aided design simulation to run the simulation (10000 randomizations). With this simulation, we could study the effects of varying the dimensions (length and width), and thicknesses of oxide and dopant factors of a transistor on the threshold voltage and drain current in subthreshold region (off) and overthreshold (on). It was found that in the subthreshold region the variability of the drain current and threshold voltage is relatively fixed while in the overthreshold region the variability of the threshold voltage and drain current decreases remarkably, despite the slight reduction of gate voltage diffusion (compared with that of the subthreshold). These results have been interpreted by using previously reported models for threshold current variability, load displacement, and simple analytical calculations. Scaling analysis shows that the variability of the characteristics of this semiconductor increases as the effects of the short channel increases. Therefore, with a slight increase of length and a reduction of width, oxide thickness, and dopant factor, we could correct the effect of the short channel. 相似文献
3.
4.
Efficient multicast search under delay and bandwidth constraints 总被引:1,自引:0,他引:1
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over
only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal
is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has
been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search
cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search
delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost
is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency
between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard.
We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed
strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior
to the implementation of an optimal single user search on a group of users.
Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both
from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California.
From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February
1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University,
Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor
with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York.
Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with
the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks,
mobility, search strategies, and multiple access protocols. 相似文献
5.
研究了红外频段非线性s偏振表面波在反铁磁晶体和电介质交界面上的频率特性,求出了非线性色散方程,揭示了非线性s偏振表面波存在一个临界频率,低于这个频率,非线性s偏振表面波的频率范围,发现功率不再是决定导波频率范围的唯一因素,两种材料的介电常数比在这里起了至关重要的作用。 相似文献
6.
杨晓光 《应用数学学报(英文版)》1997,13(4):337-341
1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv… 相似文献
7.
Eva Lesanska 《Applications of Mathematics》2002,47(5):411-426
The problem is to determine nonsensitiveness regions for threshold ellipsoids within a regular mixed linear model. 相似文献
8.
本文考虑了选址区域内存在地理阻断情况下的一种基于GIS的选址问题.对单配送中心选址模型,以GIS返回的任意两点间的最短可行路径的长度作为修正距离函数,分析了目标函数在凸形选址区域上非凸非连续的性质.进一步,采用给出了一种近似搜索算法并通过一个实例计算与重心法进行了比较. 相似文献
9.
We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters. 相似文献
10.