首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3039篇
  免费   98篇
  国内免费   18篇
电工技术   55篇
综合类   16篇
化学工业   672篇
金属工艺   46篇
机械仪表   66篇
建筑科学   45篇
矿业工程   3篇
能源动力   141篇
轻工业   281篇
水利工程   19篇
石油天然气   14篇
无线电   317篇
一般工业技术   605篇
冶金工业   466篇
原子能技术   26篇
自动化技术   383篇
  2023年   30篇
  2022年   66篇
  2021年   114篇
  2020年   74篇
  2019年   77篇
  2018年   96篇
  2017年   81篇
  2016年   99篇
  2015年   54篇
  2014年   97篇
  2013年   169篇
  2012年   127篇
  2011年   154篇
  2010年   118篇
  2009年   101篇
  2008年   118篇
  2007年   114篇
  2006年   96篇
  2005年   89篇
  2004年   59篇
  2003年   56篇
  2002年   49篇
  2001年   28篇
  2000年   42篇
  1999年   39篇
  1998年   162篇
  1997年   104篇
  1996年   89篇
  1995年   57篇
  1994年   63篇
  1993年   54篇
  1992年   38篇
  1991年   33篇
  1990年   23篇
  1989年   25篇
  1988年   25篇
  1987年   16篇
  1986年   21篇
  1985年   26篇
  1984年   32篇
  1983年   14篇
  1982年   20篇
  1981年   20篇
  1980年   19篇
  1978年   18篇
  1977年   17篇
  1976年   31篇
  1975年   15篇
  1974年   20篇
  1972年   13篇
排序方式: 共有3155条查询结果,搜索用时 15 毫秒
51.
Randomized scheduling algorithms for high-aggregate bandwidth switches   总被引:1,自引:0,他引:1  
The aggregate bandwidth of a switch is its port count multiplied by its operating line rate. We consider switches with high-aggregate bandwidths; for example, a 30-port switch operating at 40 Gb/s or a 1000-port switch operating at 1 Gb/s. Designing high-performance schedulers for such switches with input queues is a challenging problem for the following reasons: (1) high performance requires finding good matchings; (2) good matchings take time to find; and (3) in high-aggregate bandwidth switches there is either too little time (due to high line rates) or there is too much work to do (due to a high port count). We exploit the following features of the switching problem to devise simple-to-implement, high-performance schedulers for high-aggregate bandwidth switches: (1) the state of the switch (carried in the lengths of its queues) changes slowly with time, implying that heavy matchings will likely stay heavy over a period of time and (2) observing arriving packets will convey useful information about the state of the switch. The above features are exploited using hardware parallelism and randomization to yield three scheduling algorithms - APSARA, LAURA, and SERENA. These algorithms are shown to achieve 100% throughput and simulations show that their delay performance is quite close to that of the maximum weight matching, even when the traffic is correlated. We also consider the stability property of these algorithms under generic admissible traffic using the fluid-model technique. The main contribution of this paper is a suite of simple to implement, high-performance scheduling algorithms for input-queued switches. We exploit a novel operation, called MERGE, which combines the edges of two matchings to produce a heavier match, and study of the properties of this operation via simulations and theory. The stability proof of the randomized algorithms we present involves a derandomization procedure and uses methods which may have wider applicability.  相似文献   
52.
Wireless Personal Communications - Grid based sensor networks are significant for applications such as monitoring goods in a warehouse, studying traffic level of city streets, monitoring energy...  相似文献   
53.
Traffic load balancing in data centers is an important requirement. Traffic dynamics and possibilities of changes in the topology (e.g., failures and asymmetries) make load balancing a challenging task. Existing end‐host–based schemes either employ the predominantly used ECN or combine it with RTT to get congestion information of paths. Both congestion signals, ECN and RTT, have limitations; ECN only tells whether the queue length is above or below a threshold value but does not inform about the extent of congestion; similarly, RTT in data center networks is on the scale of up to few hundreds of microseconds, and current data center operating systems lack fine‐grained microsecond‐level timers. Therefore, there is a need of a new congestion signal which should give accurate information of congestion along the path. Furthermore, in end‐host–based schemes, detecting asymmetries in the topology is challenging due to the inability to accurately measure RTT on the scale of microseconds. This paper presents QLLB, an end‐host–based, queue length–based load balancing scheme. QLLB employs a new queue length–based congestion signal that gives an exact measure of congestion along the paths. Furthermore, QLLB uses relative‐RTT to detect asymmetries in the topology. QLLB is implemented in ns‐3 and compared with ECMP, CONGA, and Hermes. The results show that QLLB significantly improves performance of short flows over the other schemes and performs within acceptable level, of CONGA and Hermes, for long flows. In addition, QLLB effectively detects asymmetric paths and performs better than Hermes under high loads.  相似文献   
54.
An extensive study of epitaxial lift-off (ELO) Al0.3Ga 0.7As/GaAs modulation doped heterostructure high electron mobility field-effect transistors (HEMT's) is presented. Effects of ELO on electron transport properties of two-dimensional electron gas at AlGaAs/GaAs interface are investigated. An ELO HEMT with 1.5 μm gate length had a maximum extrinsic transconductance gm-max=125 mS/mm, a unity current gain cut-off frequency ft=10.5 GHz, and a maximum frequency of oscillation fmax=12 GHz. Statistical distributions of maximum intrinsic transconductance of ELO HEMT's are presented and compared with their on-wafer counterparts. Stability of the ELO HEMT's has also been evaluated by continuous operation at room temperature under dc bias  相似文献   
55.
The paper discusses a sequence detector based on univariate marginal distribution algorithm (UMDA) that jointly estimates the symbols transmitted in a multiple input multiple output (MIMO) communication system. While an optimal maximum likelihood detection using an exhaustive search method is prohibitively complex, it has been shown that sphere decoder (SD) achieves the optimal bit error rate (BER) performance with polynomial time complexity for smaller array sizes. However, the worst‐case complexity of SD is exponential in the problem dimensions, this brings in question its practical implementation for larger number of spatial layers and for higher‐order signal constellation. The proposed detector shows promising results for this overly difficult and complicated operating environment, confirmed through simulation results. A performance comparison of the UMDA detector with SD is presented for higher‐order complex MIMO architectures with limited average transmit power. The proposed detector achieves substantial performance gain for higher‐order systems attaining a near optimal BER performance with reduced computational complexity as compared with SD. Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   
56.
A model for predicting fracture resistance of fiber reinforced concrete   总被引:3,自引:0,他引:3  
A theoretical model is presented to predict the crack propagation resistance of fiber reinforced cement based composites. A crack in the matrix is divided into a traction free zone, fiber bridging zone and the matrix process zone. The crack closing pressure due to fibers depends on the (Mode I) crack opening displacement (COD). A method is suggested to estimate this relationship from the pull-out tests. Although calculations of COD are based on linear elastic fracture mechanics concepts, the energy absorbed in the fiber bridging zone is included in the analysis. Theoretical results are compared with the experimental data of notched beam and double cantilever beam specimens.  相似文献   
57.
58.
59.
60.
The antioxidant-mediated neuroprotective effect of Allium cepa outer scale extract (ACE) in mice with cerebral ischemia-reperfusion (I-R) injury was demonstrated in our earlier work. The current investigation aimed at establishing the bioactive component(s) responsible for this activity. Thus ACE was fractionated into ethyl acetate (EF) and aqueous (AF) fractions. These fractions were evaluated against cerebral I-R injury in mice. I-R injury in mice was induced by bilateral common carotid artery occlusion followed by 24 hr reperfusion. Memory, sensorimotor functions, cerebral infarct size, and oxidative stress were measured to address the neuroprotective mechanism of test substances. EF showed marked improvement of memory and sensorimotor functions by reducing brain oxidative stress and infarct size in mice after I-R injury. The bioactive EF was subjected to chromatographic (HPLC-PDA, HPLC-MS, preparative HPLC) and spectroscopic studies to isolate and identify the neuroprotective compounds. This lead to separation of three components, namely quercetin, quercetin 4′-O-glucoside, and the remaining fraction, from EF. The separated components were biologically evaluated. These components showed improvement in mice with I-R injury. But, EF displayed more marked neuroprotective effects as compared to the isolated components. The distinct neuroprotective outcome of EF may be credited to the synergistic action of compounds present in EF. Further studies such as evaluation of neurotoxic effects and other possible neuroprotective mechanisms are required to develop EF as a neuroprotective drug.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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