首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   41777篇
  免费   6513篇
  国内免费   5348篇
化学   24130篇
晶体学   428篇
力学   1560篇
综合类   277篇
数学   3348篇
物理学   11874篇
无线电   12021篇
  2024年   166篇
  2023年   937篇
  2022年   1322篇
  2021年   1583篇
  2020年   1509篇
  2019年   1525篇
  2018年   1408篇
  2017年   1347篇
  2016年   1858篇
  2015年   1946篇
  2014年   2466篇
  2013年   3137篇
  2012年   3582篇
  2011年   3756篇
  2010年   2856篇
  2009年   2656篇
  2008年   2965篇
  2007年   2676篇
  2006年   2400篇
  2005年   2054篇
  2004年   1561篇
  2003年   1249篇
  2002年   1179篇
  2001年   998篇
  2000年   830篇
  1999年   870篇
  1998年   662篇
  1997年   542篇
  1996年   556篇
  1995年   469篇
  1994年   409篇
  1993年   356篇
  1992年   260篇
  1991年   267篇
  1990年   216篇
  1989年   153篇
  1988年   155篇
  1987年   98篇
  1986年   104篇
  1985年   87篇
  1984年   84篇
  1983年   47篇
  1982年   42篇
  1981年   31篇
  1980年   33篇
  1979年   17篇
  1976年   21篇
  1975年   18篇
  1974年   17篇
  1973年   19篇
排序方式: 共有10000条查询结果,搜索用时 18 毫秒
81.
In this paper, we present an efficient cascading procedure for analyzing frequency selective surface (FSS) systems consisting of multiple FSS screens of unequal periodicity embedded in multiple dielectric layers. In this procedure, we first find a global period for the FSS system by studying the composite in its entirety. Next, we compute the scattering matrix [S] of each of the FSS subsystems for the global Floquet harmonics by applying a relationship we establish that maps the [S] matrix of the subsystem for the individual Floquet harmonics to that for the global harmonics. This mapping-cum-filling process substantially reduces the effort needed to compute the [S] matrix of a subsystem. Finally, we compute the [S] of the entire system by applying a modified cascading formulation, in which one matrix inversion step is eliminated, resulting in a reduction in the total computing resource requirement as well as time. Two numerical examples are given to illustrate the efficiency and effectiveness of the technique.  相似文献   
82.
A Promising MoO_x-based Catalyst for n-Heptane Isomerization   总被引:1,自引:0,他引:1  
The increasing demand for higher-octane gasoline and the regulations limiting the amount of aromatics in the fuel motivate the interest in catalytic isomerization of n-alkanes. In the last ten years, transition metal oxides or oxycarbides based on molybdenum or tungstate have attracted much attention due to their high activity and isomerization selectivity compared to the conventional bifunctional supported platinum catalyst and high resistance to sulphur and nitrogen catalyst poisons1-5. Ma…  相似文献   
83.
This paper investigates the properties of the on-wafer interconnects built in a 0.18-/spl mu/m CMOS technology for RF applications. A scalable equivalent circuit model is developed. The model parameters are extracted directly from the on-wafer measurements and formulated into empirical expressions. The expressions are in functions of the length and the width of the interconnects. The proposed model can be easily implemented into commercial RF circuit simulators. It provides a novel solution to include the frequency-variant characteristics into a circuit simulation. The silicon-verified accuracy is proved to be up to 25 GHz with an average error less than 2%. Additionally, equivalent circuit model for longer wires can be obtained by cascading smaller subsections together. The scalability of the propose model is demonstrated.  相似文献   
84.
In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   
85.
After the new round of restructuring of Chinese telecom sector,it's pressing to formulate and implement asymmetric regulation policies so as to shape an effectively competitive market structure in a relatively short term.This paper reviewed the asymmetric regulation policies and practices carried out in foreign telecom market,and then according to the specific situations of Chinese telecom market,proposed the principles and corresponding policies for establishing an asymmetric regulation system fit for Chin...  相似文献   
86.
Recent technological advances have made it possible to support long lifetime and large volume streaming data transmissions in sensor networks. A major challenge is to maximize the lifetime of battery-powered sensors to support such transmissions. Battery, as the power provider of the sensors, therefore emerges as the key factor for achieving high performance in such applications. Recent study in battery technology reveals that the behavior of battery discharging is more complex than we used to think. Battery powered sensors might waste a huge amount of energy if we do not carefully schedule and budget their discharging. In this paper we study the effect of battery behavior on routing for streaming data transmissions in wireless sensor networks. We first give an on-line computable energy model to mathematically model battery discharge behavior. We show that the model can capture and describe battery behavior accurately at low computational complexity and thus is suitable for on-line battery capacity computation. Based on this battery model we then present a battery-aware routing (BAR) protocol to schedule the routing in wireless sensor networks. The routing protocol is sensitive to the battery status of routing nodes and avoids energy loss. We use the battery data from actual sensors to evaluate the performance of our protocol. The results show that the battery-aware protocol proposed in this paper performs well and can save a significant amount of energy compared to existing routing protocols for streaming data transmissions. Network lifetime is also prolonged with maximum data throughput. As far as we know, this is the first work considering battery-awareness with an accurate analytical on-line computable battery model in sensor network routing. We believe the battery model can be used to explore other energy efficient schemes for wireless networks as well.  相似文献   
87.
88.
89.
We report a nanosecond Nd:YVO_4-pumped optical parametric oscillator (OPO) based on periodically poled LiNbO_3 (PPLN). Tuning is achieved in this experiment by varying the temperature and period of the PPLN. The design of double-pass singly resonant oscillator (DSRO) and confocal cavity enables the OPO threshold to be lowered considerably, resulting in a simple, compact, all-solid-state configuration with the mid-infrared idler powers of up to 466mW at 3.41μm.  相似文献   
90.
标签粘贴机是一种可自动进行标签打印和粘贴的设备装置,在工业自动化生产中有着广泛的应用.介绍了一种采用单台微机进行控制的全自动标签粘贴机的工作原理及各部分组成,以及使用过程中对其进行设置和调整的方法.该标签粘贴机已实际应用于华飞彩色显示系统有限公司29英寸彩色显像管生产线的屏网组装工序,取得了良好的效果.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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