首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   45971篇
  免费   4344篇
  国内免费   2011篇
电工技术   2502篇
技术理论   2篇
综合类   2500篇
化学工业   8180篇
金属工艺   2690篇
机械仪表   3087篇
建筑科学   3053篇
矿业工程   1297篇
能源动力   1373篇
轻工业   3029篇
水利工程   652篇
石油天然气   2478篇
武器工业   337篇
无线电   5744篇
一般工业技术   6455篇
冶金工业   2606篇
原子能技术   528篇
自动化技术   5813篇
  2024年   247篇
  2023年   899篇
  2022年   1544篇
  2021年   2218篇
  2020年   1625篇
  2019年   1523篇
  2018年   1589篇
  2017年   1639篇
  2016年   1539篇
  2015年   1982篇
  2014年   2387篇
  2013年   2838篇
  2012年   2912篇
  2011年   3324篇
  2010年   2610篇
  2009年   2565篇
  2008年   2581篇
  2007年   2265篇
  2006年   2352篇
  2005年   1895篇
  2004年   1387篇
  2003年   1258篇
  2002年   1182篇
  2001年   1030篇
  2000年   983篇
  1999年   1030篇
  1998年   868篇
  1997年   736篇
  1996年   651篇
  1995年   548篇
  1994年   425篇
  1993年   288篇
  1992年   238篇
  1991年   218篇
  1990年   178篇
  1989年   168篇
  1988年   108篇
  1987年   101篇
  1986年   61篇
  1985年   54篇
  1984年   42篇
  1983年   39篇
  1982年   30篇
  1981年   23篇
  1980年   26篇
  1979年   17篇
  1978年   15篇
  1976年   22篇
  1975年   11篇
  1973年   14篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proximity and link cost. Coupled with the local next hop decision in geographic routing, NADV enables an adaptive and efficient cost-aware routing strategy. Depending on the objective or message priority, applications can use the NADV framework to minimize various types of link cost.We present efficient methods for link cost estimation and perform detailed experiments in simulated environments. Our results show that NADV outperforms current schemes in many aspects: for example, in high noise environments with frequent packet losses, the use of NADV leads to 81% higher delivery ratio. When compared to centralized routing under certain settings, geographic routing using NADV finds paths whose cost is close to the optimum. We also conducted experiments in Emulab testbed and the results demonstrate that our proposed approach performs well in practice.  相似文献   
992.
XMin: Minimizing Tree Pattern Queries with Minimality Guarantee   总被引:1,自引:0,他引:1  
Due to wide use of XPath, the problem of efficiently processing XPath queries has recently received a lot of attention. In particular, a considerable effort has been devoted to minimizing XPath queries since the efficiency of query processing greatly depends on the size of the query. Research work in this area can be classified into two categories: constraint-independent minimization and constraint-dependent minimization. The former minimizes queries in the absence of integrity constraints while the latter in the presence of them. For a linear path query, which is an XPath query without branching predicates, existing constraint-independent minimization methods are generally known to be unable to minimize the query without processing the query itself. Most recently, however, by using the DataGuide, a representative structural summary of XML data, a constraint-independent method that minimizes linear path queries in a top-down fashion has been proposed. Nevertheless, this method can fail to find a minimal query since it minimizes a query by merely erasing labels from the original query whereas a minimal query could include labels that are not present in the original query. In this paper, we propose a bottom-up approach called XMin that guarantees finding a minimal query for a given tree pattern query by using the DataGuide without processing the query itself. For the linear path query, we first show that the sequence of labels occurring in the minimal query is a subsequence of every schema label sequence that matches the original query. Here, the schema label sequence for a node is the sequence of labels from the root of XML data to the node. We then propose iterative subsequence generation that iteratively generates subsequences from the shortest schema label sequence matching the original query in a bottom-up fashion and tests query equivalence. Using iterative subsequence generation, we can always find a minimal query and we formally prove this guarantee. We also propose an extended algorithm that guarantees the minimality for the tree pattern query, which is a linear path query with branching predicates. These methods have been prototyped in a full-fledged object-relational DBMS. The experimental results using real and synthetic data sets show the practicality of our method.  相似文献   
993.
This study describes techniques for the cascade modeling and the optimization that are required to conduct the simulator-based process optimization of solar cell fabrication. Two modeling approaches, neural networks and genetic programming, are employed to model the crucial relation for the consecutively connected two processes in solar cell fabrication. One model (Model 1) is used to map the five inputs (time, amount of nitrogen and DI water in surface texturing and temperature and time in emitter diffusion) to the two outputs (reflectance and sheet resistance) of the first process. The other model (Model 2) is used to connect the two inputs (reflectance and sheet resistance) to the one output (efficiency) of the second process. After modeling of the two processes, genetic algorithms and particle swarm optimization were applied to search for the optimal recipe. In the first optimization stage, we searched for the optimal reflectance and sheet resistance that can provide the best efficiency in the fabrication process. The optimized reflectance and sheet resistance found by the particle swarm optimization were better than those found by the genetic algorithm. In the second optimization stage, the five input parameters were searched by using the reflectance and sheet resistance values obtained in the first stage. The found five variables such as the texturing time, amount of nitrogen, DI water, diffusion time, and temperature are used as a recipe for the solar cell fabrication. The amount of nitrogen, DI water, and diffusion time in the optimized recipes showed considerable differences according to the modeling approaches. More importantly, repeated applications of particle swarm optimization yielded process conditions with smaller variations, implying greater consistency in recipe generation.  相似文献   
994.
Electrowetting on dielectric (EWOD) is useful in manipulating droplets for digital (droplet-based) microfluidics, but its high driving voltage over several tens of volts has been a barrier to overcome. This article presents the characteristics of EWOD device with aluminum oxide (Al2O3, ε r  ≈ 10) deposited by atomic layer deposition (ALD), for the first time as the high-k dielectric for lowering the EWOD driving voltage substantially. The EWOD device of the single-plate configuration was fabricated by several steps for the control electrode array of 1 mm × 1 mm squares with 50 μm space, the dielectric layer of 1,270 Å thick ALD Al2O3, the reference electrode of 20 μm wide line electrode, and the hydrophobic surface treatment by Teflon-AF coating, respectively. We observed the movement of a 2 μl water droplet in an air environment, applying a voltage between one of the control electrodes and the reference electrode in contact with the droplet. The droplet velocity exponentially depending on the applied voltage below 15 V was obtained. The measured threshold voltage to move the droplet was as low as 3 V which is the lowest voltage reported so far in the EWOD researches. This result opens a possibility of manipulating droplets, without any surfactant or oil treatment, at only a few volts by EWOD using ALD Al2O3 as the dielectric.  相似文献   
995.
With today’s global digital environment, the Internet is readily accessible anytime from everywhere, so does the digital image manipulation software; thus, digital data is easy to be tampered without notice. Under this circumstance, integrity verification has become an important issue in the digital world. The aim of this paper is to present an in-depth review and analysis on the methods of detecting image tampering. We introduce the notion of content-based image authentication and the features required to design an effective authentication scheme. We review major algorithms and frequently used security mechanisms found in the open literature. We also analyze and discuss the performance trade-offs and related security issues among existing technologies.  相似文献   
996.
随着计算机技术和通信技术的进步,网络已经成为我们学习、生活与工作不可或缺的一部分。但是随着安全漏洞的不断被发现与黑客的技,亍及破坏力不断提高,网络安全频繁受到挑战。在基于OCTEON的硬件平台下,设计并实现了一种基于专用多核的千兆入侵防御系统,该系统包含了入侵防御中的数据包预处理、检测以及响应全部组件,实验表明,该系统在千兆环境下具有较好的实用性。  相似文献   
997.
998.
基于主从多机通信的机器人控制系统开发   总被引:1,自引:0,他引:1  
为了实现对机器人的实时控制,要求主控制器与各个感应机构和执行机构之间高效稳定的通信;对机器人控制系统的开发,需要设计一种满足实时性和高效性要求的多机通信系统;控制系统采用二级分布式结构,主控制器作为上位机,各传感器和电机内置的微处理器作为下位机;基于AVR单片机的主从多机通信方式,利用半双工的异步串行方式通信;这种数字化的通信方式具有高效,稳定的优点,可以大大简化控制程序的开发;实验证明,应用这种控制系统的小型机器人具有灵活性高、开发周期短且稳定性高的特点.  相似文献   
999.
一种航空直流固态功率控制器的设计   总被引:1,自引:1,他引:0  
提出了一种基于嵌入式实时操作系统μC/OS-Ⅱ和CPLD的SSPC设计方案.对整个系统的结构进行了分析,结合分析给出了系统硬件和软件设计方案.硬件设计部分给出了系统的硬件结构原理图,分析了系统性能和各部分功能,并绘出了子系统的设计;软件部分根据μC/OS-Ⅱ系统建立了任务结构框图和系统流程,给出了I2T反时限保护的一种算法,并通过对CPLD的编程实现SSPC的短路保护功能;实验证明这种设计方案具有硬件电路设计简单、实时性好、可靠性高和智能化水平高的优点,符合航空直流固态功率控制器的设计要求.  相似文献   
1000.
电子类专业计算机网络课程实践教学体系   总被引:1,自引:0,他引:1  
针对电子类专业人才对网络技术的新需求,以该专业的网络应用为背景,从培养具有创新精神的电子类应用型人才角度出发,提出一个电子类专业计算机网络课程的实践教学体系,以提高教学效果和学生的综合应用能力。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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