全文获取类型
收费全文 | 1278篇 |
免费 | 20篇 |
国内免费 | 4篇 |
专业分类
化学 | 453篇 |
晶体学 | 2篇 |
力学 | 59篇 |
数学 | 69篇 |
物理学 | 256篇 |
无线电 | 463篇 |
出版年
2023年 | 8篇 |
2022年 | 27篇 |
2021年 | 25篇 |
2020年 | 30篇 |
2019年 | 15篇 |
2018年 | 29篇 |
2017年 | 26篇 |
2016年 | 32篇 |
2015年 | 26篇 |
2014年 | 40篇 |
2013年 | 82篇 |
2012年 | 57篇 |
2011年 | 43篇 |
2010年 | 54篇 |
2009年 | 41篇 |
2008年 | 48篇 |
2007年 | 41篇 |
2006年 | 48篇 |
2005年 | 45篇 |
2004年 | 40篇 |
2003年 | 27篇 |
2002年 | 28篇 |
2001年 | 17篇 |
2000年 | 27篇 |
1999年 | 16篇 |
1998年 | 26篇 |
1997年 | 25篇 |
1996年 | 17篇 |
1995年 | 25篇 |
1994年 | 15篇 |
1993年 | 24篇 |
1992年 | 19篇 |
1991年 | 14篇 |
1990年 | 16篇 |
1989年 | 17篇 |
1988年 | 10篇 |
1987年 | 10篇 |
1986年 | 13篇 |
1985年 | 7篇 |
1984年 | 19篇 |
1983年 | 9篇 |
1982年 | 13篇 |
1981年 | 13篇 |
1980年 | 17篇 |
1979年 | 21篇 |
1978年 | 16篇 |
1977年 | 15篇 |
1976年 | 11篇 |
1974年 | 11篇 |
1973年 | 6篇 |
排序方式: 共有1302条查询结果,搜索用时 0 毫秒
1.
Why does it pay to be selfish in a MANET? 总被引:2,自引:0,他引:2
Younghwan Yoo Dharma P. Agrawal 《Wireless Communications, IEEE》2006,13(6):87-97
Routing protocols for a mobile ad hoc network have assumed that all mobile nodes voluntarily participate in forwarding others' packets. This was a reasonable assumption because all MNs in a MANET belonged to a single authority. In the near future, however, a MANET may consist of MNs that belong to many different organizations since numerous civilian applications are expected to crop up. In this situation, some MNs may run independently and purposely decide not to forward packets so as to save their own energy. This could potentially lead to network partitioning and corresponding performance degradation. To minimize such situations in MANETs, many studies have explored the use of both the carrot and the stick approaches by having reputation-based, credit-payment, and game theory schemes. This article summarizes existing schemes, identifies their relative advantages, and projects future directions 相似文献
2.
The quantitative rainbow schlieren deflectometry (RSD) technique was applied to measure temperature and oxygen concentration in an axisymmetric hydrogen gas-jet diffusion flame burning in quiescent air at fuel jet exit Reynolds number of 70. Schlieren measurements were compared with conventional measurements using a thermocouple and a gas-sampling probe. Good agreement between the two measurement techniques was achieved on the fuel-lean side of the flame. 相似文献
3.
4.
We consider a system comprising of a single bottleneck switch/node that is fed by N independent Markov-modulated fluid sources. There is a fixed propagation delay incurred by the traffic between these sources and the switch. We assume that the switch sends periodic feedback in the form of a single congestion indicator bit. This feedback also incurs a fixed propagation delay in reaching the sources. Upon reaching the sources (or the access controllers associated with the sources), this congestion indicator bit is used to choose between two rates for the excess traffic, high or low, possibly depending on the state of that source. The switch employs a threshold mechanism based on its buffer level to discard excess traffic. We show that the stationary distribution of this system satisfies a set of first-order linear differential equations along with a set of split boundary conditions. We obtain an explicit solution to these using spectral decomposition. To this end we investigate the related eigenvalue problem. Based on these results we investigate the role of delayed feedback vis-a-vis various time-constants and traffic parameters associated with the system. In particular, we identify conditions under which the feedback scheme offers significant improvement over the open-loop scheme 相似文献
5.
6.
7.
Energy minimization and design for testability 总被引:6,自引:0,他引:6
Srimat T. Chakradhar Vishwani D. Agrawal Michael L. Bushnell 《Journal of Electronic Testing》1994,5(1):57-66
The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables. 相似文献
8.
Rong-Rong Chen Koetter R. Madhow U. Agrawal D. 《Communications, IEEE Transactions on》2003,51(10):1676-1689
The paper contains a systematic investigation of practical coding strategies for noncoherent communication over fading channels, guided by explicit comparisons with information-theoretic benchmarks. Noncoherent reception is interpreted as joint data and channel estimation, assuming that the channel is time varying and a priori unknown. We consider iterative decoding for a serial concatenation of a standard binary outer channel code with an inner modulation code amenable to noncoherent detection. For an information rate of about 1/2 bit per channel use, the proposed scheme, using a quaternary phase-shift keying (QPSK) alphabet, provides performance within 1.6-1.7 dB of Shannon capacity for the block fading channel, and is about 2.5-3 dB superior to standard differential demodulation in conjunction with an outer channel code. We also provide capacity computations for noncoherent communication using standard phase-shift keying (PSK) and quadrature amplitude modulation (QAM) alphabets; comparing these with the capacity with unconstrained input provides guidance as to the choice of constellation as a function of the signal-to-noise ratio. These results imply that QPSK suffices to approach the unconstrained capacity for the relatively low information and fading rates considered in our performance evaluations, but that QAM is superior to PSK for higher information or fading rates, motivating further research into efficient noncoherent coded modulation with QAM alphabets. 相似文献
9.
We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k1..., km) subject to a fixed total buffer capacityK=k
1 +... + km. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818. 相似文献
10.