全文获取类型
收费全文 | 119228篇 |
免费 | 20020篇 |
国内免费 | 13089篇 |
专业分类
电工技术 | 14460篇 |
技术理论 | 3篇 |
综合类 | 14071篇 |
化学工业 | 6681篇 |
金属工艺 | 3195篇 |
机械仪表 | 10367篇 |
建筑科学 | 3774篇 |
矿业工程 | 2861篇 |
能源动力 | 4115篇 |
轻工业 | 4271篇 |
水利工程 | 2474篇 |
石油天然气 | 3214篇 |
武器工业 | 1851篇 |
无线电 | 16173篇 |
一般工业技术 | 8941篇 |
冶金工业 | 2030篇 |
原子能技术 | 522篇 |
自动化技术 | 53334篇 |
出版年
2024年 | 858篇 |
2023年 | 2336篇 |
2022年 | 4595篇 |
2021年 | 4968篇 |
2020年 | 5147篇 |
2019年 | 4362篇 |
2018年 | 4104篇 |
2017年 | 4907篇 |
2016年 | 5572篇 |
2015年 | 6506篇 |
2014年 | 8847篇 |
2013年 | 8473篇 |
2012年 | 10304篇 |
2011年 | 10631篇 |
2010年 | 8011篇 |
2009年 | 8389篇 |
2008年 | 8224篇 |
2007年 | 9068篇 |
2006年 | 7278篇 |
2005年 | 5997篇 |
2004年 | 4819篇 |
2003年 | 3849篇 |
2002年 | 2992篇 |
2001年 | 2396篇 |
2000年 | 2014篇 |
1999年 | 1486篇 |
1998年 | 1260篇 |
1997年 | 1032篇 |
1996年 | 816篇 |
1995年 | 633篇 |
1994年 | 528篇 |
1993年 | 386篇 |
1992年 | 352篇 |
1991年 | 230篇 |
1990年 | 239篇 |
1989年 | 181篇 |
1988年 | 120篇 |
1987年 | 43篇 |
1986年 | 55篇 |
1985年 | 45篇 |
1984年 | 39篇 |
1983年 | 40篇 |
1982年 | 41篇 |
1981年 | 19篇 |
1980年 | 36篇 |
1979年 | 22篇 |
1978年 | 15篇 |
1977年 | 13篇 |
1975年 | 13篇 |
1951年 | 14篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
181.
182.
基于双因子认证技术的网络身份识别 总被引:5,自引:0,他引:5
本文提出了一种基于动态双因子认证技术的网络身份识别方法,用户每次登录的口令是利用系统时间和用户ID通过MD5加密算法计算得到,其通过MD5加密后生成的登录口令是随机的,这将进一步提高开放网络环境下身份识别的可靠性和安全性。同时,本文还提出网络身份识别技术可以应用到各类网站的服务器上,用来完成对用户身份的识别,以提高网络系统的安全性。 相似文献
183.
The convexity and continuity of fuzzy mappings are defined through a linear ordering and a metric on the set of fuzzy numbers. The local-global minimum property of real-valued convex functions is extended to convex fuzzy mappings. It is proved that a strict local minimizer of a quasiconvex fuzzy mapping is also a strict global minimizer. Characterizations for convex fuzzy mappings and quasiconvex fuzzy mappings are given. In addition, the Weirstrass theorem is extended from real-valued functions to fuzzy mappings. 相似文献
184.
目前采用的视频流调度算法,没有充分利用补丁流满足服务率高而占用系统资源少的优势,系统效率较低.为了提高效率,提出了一种基于MFQ的补丁优先算法,并给出了该算法的系统流程。通过对实验结果的比较,该算法在用户请求撤销率、节目调度不公平性和用户等待时间方面有明显的优越性. 相似文献
185.
A. Kaveh H. A. Rahimi Bondarabady 《International journal for numerical methods in engineering》2004,60(11):1803-1815
This paper presents an algorithm for nodal numbering in order to obtain a small wavefront. Element clique graphs are employed as the mathematical models of finite element meshes. A priority function containing five vectors is used, which can be viewed as a generalization of Sloan's function. These vectors represent different connectivity properties of the graph models. Unlike Sloan's algorithm, which uses two fixed coefficients, here, five coefficients are employed, based on an evaluation by artificial neural networks. The networks weights are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present hybrid method. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
186.
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. 相似文献
187.
188.
通过优化工艺条件,严控进料质量、改造循环氢压缩机油系统、调整二甲苯塔操作等措施,使催化剂在运行末期,也能发挥出良好的催化性能,并延长催化剂使用寿命;提高了催化剂处理C10芳烃的能力,降低重芳烃产率,提高经济效益。为催化剂运行末期操作和正常操作提供有益的探索。 相似文献
189.
A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations.
The performance of sub algorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed
by conducting numerical experiments.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 133–146, July–August 2007. 相似文献
190.