全文获取类型
收费全文 | 69474篇 |
免费 | 6055篇 |
国内免费 | 3326篇 |
专业分类
电工技术 | 3922篇 |
技术理论 | 9篇 |
综合类 | 4788篇 |
化学工业 | 11884篇 |
金属工艺 | 3712篇 |
机械仪表 | 4392篇 |
建筑科学 | 5555篇 |
矿业工程 | 1989篇 |
能源动力 | 2055篇 |
轻工业 | 4332篇 |
水利工程 | 1236篇 |
石油天然气 | 4538篇 |
武器工业 | 496篇 |
无线电 | 7992篇 |
一般工业技术 | 8543篇 |
冶金工业 | 3301篇 |
原子能技术 | 817篇 |
自动化技术 | 9294篇 |
出版年
2024年 | 307篇 |
2023年 | 1105篇 |
2022年 | 1907篇 |
2021年 | 2655篇 |
2020年 | 2079篇 |
2019年 | 1812篇 |
2018年 | 1970篇 |
2017年 | 2267篇 |
2016年 | 2046篇 |
2015年 | 2604篇 |
2014年 | 3371篇 |
2013年 | 4000篇 |
2012年 | 4276篇 |
2011年 | 4743篇 |
2010年 | 3877篇 |
2009年 | 3709篇 |
2008年 | 3803篇 |
2007年 | 3641篇 |
2006年 | 3730篇 |
2005年 | 3104篇 |
2004年 | 2211篇 |
2003年 | 2346篇 |
2002年 | 2662篇 |
2001年 | 2256篇 |
2000年 | 1891篇 |
1999年 | 1999篇 |
1998年 | 1507篇 |
1997年 | 1256篇 |
1996年 | 1251篇 |
1995年 | 988篇 |
1994年 | 888篇 |
1993年 | 645篇 |
1992年 | 458篇 |
1991年 | 346篇 |
1990年 | 266篇 |
1989年 | 224篇 |
1988年 | 206篇 |
1987年 | 129篇 |
1986年 | 84篇 |
1985年 | 50篇 |
1984年 | 43篇 |
1983年 | 30篇 |
1982年 | 39篇 |
1981年 | 22篇 |
1980年 | 19篇 |
1979年 | 12篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1976年 | 5篇 |
1971年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
941.
在空间数据仓库中,由于物化视图中空间度量的聚集结果需要占用较大的存储空间,因此只能选择部分空间度量进行物化.而现有的物化视图选择算法大部分只是针对视图选择设计的,没有考虑视图中度量的选择.为此,针对空间度量的区域合并操作,提出基于聚类方法的空间度量物化选择算法.把可合并的空间对象组进行聚类,在每个聚类中计算合并组的收益... 相似文献
942.
为了满足半潜船作业人员学习和培训的需要,有必要在航海模拟器大环境下研发半潜船操作模拟器仿真系统。以船舶静力学为基础,实现了半潜船装载重大件货物的过程的动态稳性计算,以Visual C++6.0和OpenGVS场景管理软件为开发平台,研制开发了半潜船操作模拟器应具备的视景系统。该仿真系统实现了视点的转移和跟踪,通过设置在半潜船的驾驶台、甲板及外部三个虚拟相机,实时动态显示半潜船各种运动的状态,同时实现了半潜船操作模拟器几个模块间的相互通信,取得了很好的效果。 相似文献
943.
需求演化频繁发生于软件项目中,并且在很大程度上影响着软件项目的成败。对需求演化的影响进行准确的估算,将有效地帮助项目管理者降低软件项目失败的风险。其中,如何量化新增需求对软件项目的影响,是一个尤其难以解决的问题。提出一种基于数据挖掘的需求演化影响的量化分析方法,将新增需求与软件项目已有需求进行聚类,对于聚类结果进行分析,能够相对准确地量化新增需求将要产生的代码量。 相似文献
944.
Qing Tan Qing He Weizhong Zhao Zhongzhi Shi E.S. Lee 《Computers & Mathematics with Applications》2011,61(4):1129-1144
In current PC computing environment, the fuzzy clustering method based on perturbation (FCMBP) is failed when dealing with similar matrices whose orders are higher than tens. The reason is that the traversal process adopted in FCMBP is exponential complexity. This paper treated the process of finding fuzzy equivalent matrices with smallest error from an optimization point of view and proposed an improved FCMBP fuzzy clustering method based on evolutionary programming. The method seeks the optimal fuzzy equivalent matrix which is nearest to the given fuzzy similar matrix by evolving a population of candidate solutions over a number of generations. A new population is formed from an existing population through the use of a mutation operator. Better solutions survive into next generation and finally the globally optimal fuzzy equivalent matrix could be obtained or approximately obtained. Compared with FCMBP, the improved method has the following advantages: (1) Traversal searching is avoided by introducing an evolutionary programming based optimization technique. (2) For low-order matrices, the method has much better efficiency in finding the globally optimal fuzzy equivalent matrix. (3) Matrices with hundreds of orders could be managed. The method could quickly get a more accurate solution than that obtained by the transitive closure method and higher precision requirement could be achieved by further iterations. And the method is adaptable for matrices of higher order. (4) The method is robust and not sensitive to parameters. 相似文献
945.
Soft set theory, introduced by Molodtsov, has been considered as an effective mathematical tool for modeling uncertainties. In this paper, we initiate the study of algebraic hyperstructures of soft sets. The concepts of soft polygroups, normal soft polygroups, soft subpolygroups and normal soft subpolygroups are introduced, and some related properties are investigated. Furthermore, we propose the homomorphism and isomorphism of soft polygroups, and establish three isomorphism theorems for soft polygroups. 相似文献
946.
The Gaussian kernel function implicitly defines the feature space of an algorithm and plays an essential role in the application of kernel methods. The parameter of Gaussian kernel function is a scalar that has significant influences on final results. However, until now, it is still unclear how to choose an optimal kernel parameter. In this paper, we propose a novel data-driven method to optimize the Gaussian kernel parameter, which only depends on the original dataset distribution and yields a simple solution to this complex problem. The proposed method is task irrelevant and can be used in any Gaussian kernel-based approach, including supervised and unsupervised machine learning. Simulation experiments demonstrate the efficacy of the obtained results. A user-friendly online calculator is implemented at: www.csbio.sjtu.edu.cn/bioinf/kernel/ for public use. 相似文献
947.
Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0–1 function. It is a well known NP-hard problem and is considered as a unified model for a variety of combinatorial optimization problems. This paper combines a tabu Hopfield neural network (HNN) (THNN) with estimation of distribution algorithm (EDA), and thus a THNN–EDA is proposed for the UBQP. In the THNN, the tabu rule, instead of the original updating rule of the HNN, is used to govern the state transition or updating of neurons to search for the global minimum of the energy function. A probability vector in EDA model is built to characterize the distribution of promising solutions in the search space, and then the THNN is guided by the global search information in EDA model to search better solution in the promising region. Thus, the short term memory of the tabu mechanism in the THNN cooperates with the long term memory mechanism in the EDA to help the network escape from local minima. The THNN–EDA is tested on 21 UBQP benchmark problems with the size ranging from 3000 to 7000, and 48 maximum cut benchmark problems, a special case of the UBQP, with the size ranging from 512 to 3375. Simulation results show that the THNN–EDA is better than the other HNN based algorithms, and is better than or competitive with metaheuristic algorithms and state-of-the-art algorithms. 相似文献
948.
In this paper, we proposed an effective genetic algorithm for solving the flexible job-shop scheduling problem (FJSP) to minimize makespan time. In the proposed algorithm, Global Selection (GS) and Local Selection (LS) are designed to generate high-quality initial population in the initialization stage. An improved chromosome representation is used to conveniently represent a solution of the FJSP, and different strategies for crossover and mutation operator are adopted. Various benchmark data taken from literature are tested. Computational results prove the proposed genetic algorithm effective and efficient for solving flexible job-shop scheduling problem. 相似文献
949.
AFMC:一种新的异步电路设计自动化流程 总被引:1,自引:1,他引:0
随着VLSI面临的功耗及时钟问题越来越突出,异步电路及其设计方法得到了广泛关注.基于宏单元的异步电路设计流程能够采用现有的同步EDA工具和设计流程将同步电路转变成相应的异步电路.在基于宏单元的异步电路设计流程的基础上提出了一种新的异步电路设计自动化流程,并与解同步异步电路设计自动化流程进行了比较.在UMC 0.18μm工艺下采用提出的自动化流程设计实现了一款DLX异步微处理器,实验结果表明该流程能够快速地进行异步电路设计,并且在异步电路的数据通路性能优化方面具有一定的优势.相对于解同步DLX微处理器,采用基于宏单元的异步设计自动化流程实现的异步DLX微处理器能够获得6%左右的性能提高. 相似文献
950.
针对某战术导弹训练系统中实现导弹作战过程可视化的要求,在分析MapX功能特性的基础上,应用MapX组件技术在VC++环境上实现了导弹作战过程飞机及导弹飞行轨迹态势图的绘制.结合态势图中真实地理信息下航迹显示功能的实现,重点阐述了MapX中图层绘制技术的应用. 相似文献