全文获取类型
收费全文 | 38902篇 |
免费 | 3598篇 |
国内免费 | 2443篇 |
专业分类
电工技术 | 3427篇 |
技术理论 | 1篇 |
综合类 | 3545篇 |
化学工业 | 1908篇 |
金属工艺 | 3659篇 |
机械仪表 | 7108篇 |
建筑科学 | 1192篇 |
矿业工程 | 2004篇 |
能源动力 | 586篇 |
轻工业 | 3021篇 |
水利工程 | 389篇 |
石油天然气 | 641篇 |
武器工业 | 296篇 |
无线电 | 2587篇 |
一般工业技术 | 2547篇 |
冶金工业 | 1585篇 |
原子能技术 | 89篇 |
自动化技术 | 10358篇 |
出版年
2024年 | 229篇 |
2023年 | 757篇 |
2022年 | 1324篇 |
2021年 | 1429篇 |
2020年 | 1421篇 |
2019年 | 1050篇 |
2018年 | 923篇 |
2017年 | 1151篇 |
2016年 | 1336篇 |
2015年 | 1478篇 |
2014年 | 2477篇 |
2013年 | 1993篇 |
2012年 | 2911篇 |
2011年 | 3022篇 |
2010年 | 2191篇 |
2009年 | 2203篇 |
2008年 | 2035篇 |
2007年 | 2630篇 |
2006年 | 2508篇 |
2005年 | 2137篇 |
2004年 | 1689篇 |
2003年 | 1476篇 |
2002年 | 1242篇 |
2001年 | 1072篇 |
2000年 | 872篇 |
1999年 | 672篇 |
1998年 | 519篇 |
1997年 | 429篇 |
1996年 | 333篇 |
1995年 | 312篇 |
1994年 | 260篇 |
1993年 | 183篇 |
1992年 | 123篇 |
1991年 | 98篇 |
1990年 | 87篇 |
1989年 | 94篇 |
1988年 | 80篇 |
1987年 | 33篇 |
1986年 | 28篇 |
1985年 | 18篇 |
1984年 | 14篇 |
1983年 | 23篇 |
1982年 | 17篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1963年 | 4篇 |
1959年 | 4篇 |
1957年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
911.
912.
913.
914.
915.
传统的调试器调试程序时,仅仅能够让程序正向运行并获取其当前的状态.提出了一种可以让程序逆向运行,回到过去任意时刻的调试方法,来增强调试器的功能.该方法是通过为Xen虚拟机添加完整的日志记录和回放功能以及对GDB调试器作相应修改来实现的;调试对象可以恢复到其运行过程的任意时刻.该可逆调试器,可以解决大型软件和操作系统内核... 相似文献
916.
基于虚拟机的运行时入侵检测技术研究 总被引:1,自引:0,他引:1
入侵检测技术通常分为误用检测和异常检测两类,误用检测根据攻击模式库检测已知的攻击行为,但却难以防范未知的攻击行为;异常检测技术虽然可以预测偏离正常值阈区间的潜在攻击行为,但却存在较高的误报现象。在虚拟机监视器中对虚拟机操作系统的运行行为进行带外监控,避免了操作系统内监控模块被病毒感染的难题;通过监视虚拟机的运行时行为,对之作组合序列的合法性分析,扩展了误用检测防范长时间段攻击行为的能力,识别通过合法系统调用进行的恶意攻击。测试数据表明,该技术能够较好地检测出复杂组合攻击行为。 相似文献
917.
This paper introduces a cylindricity evaluation algorithm based on support vector machine learning with a specific kernel function, referred to as SVR, as a viable alternative to traditional least square method (LSQ) and non-linear programming algorithm (NLP). Using the theory of support vector machine regression, the proposed algorithm in this paper provides more robust evaluation in terms of CPU time and accuracy than NLP and this is supported by computational experiments. Interestingly, it has been shown that the SVR significantly outperforms LSQ in terms of the accuracy while it can evaluate the cylindricity in a more robust fashion than NLP when the variance of the data points increases. The robust nature of the proposed algorithm is expected because it converts the original nonlinear problem with nonlinear constraints into other nonlinear problem with linear constraints. In addition, the proposed algorithm is programmed using Java Runtime Environment to provide users with a Web based open source environment. In a real-world setting, this would provide manufacturers with an algorithm that can be trusted to give the correct answer rather than making a good part rejected because of inaccurate computational results. 相似文献
918.
The quality of plane layout design of the disc cutters for the full-face rock tunnel boring machine (TBM) directly affects the balance of force distribution on the cutter head during the excavating. Various layout patterns have been adopted in practice during the layout design of the disc cutters. Considering the engineering technical requirements and the corresponding structure design requirements of the cutter head, this study formulates a nonlinear multi-objective mathematical model with multiple constraints for the disc cutters plane layout design, and analyses the characteristics of a multi-spiral layout pattern, a dynamic star layout pattern and a stochastic layout pattern. And then a genetic algorithm is employed to solve a disc cutters’ multi-spiral layout problem, and a cooperative co-evolutionary genetic algorithm (CCGA) is utilized to solve a disc cutters’ star or stochastic layout problems. The emphasis was put on the study of superiority of three different layout patterns. Finally, an instance of the disc cutters’ plane layout design was solved by the proposed methods using three different kinds of layout patterns. Experimental results showed the effectiveness of the method of combining the mathematical model with the algorithms, and the pros and cons of the three layout patterns. 相似文献
919.
This paper proposes a two-stage stochastic programming model for the parallel machine scheduling problem where the objective is to determine the machines' capacities that maximize the expected net profit of on-time jobs when the due dates are uncertain. The stochastic model decomposes the problem into two stages: The first (FS) determines the optimal capacities of the machines whereas the second (SS) computes an estimate of the expected profit of the on-time jobs for given machines' capacities. For a given sample of due dates, SS reduces to the deterministic parallel weighted number of on-time jobs problem which can be solved using the efficient branch and bound of M’Hallah and Bulfin [16]. FS is tackled using a sample average approximation (SAA) sampling approach which iteratively solves the problem for a number of random samples of due dates. SAA converges to the optimum in the expected sense as the sample size increases. In this implementation, SAA applies a ranking and selection procedure to obtain a good estimate of the expected profit with a reduced number of random samples. Extensive computational experiments show the efficacy of the stochastic model. 相似文献
920.
We consider a single machine scheduling problem with resource dependent release times that can be controlled by a non-increasing convex resource consumption function. The objective is to minimize the weighted total resource consumption and sum of job completion times with an initial release time greater than the total processing times. It is known that the problem is polynomially solvable in O(n4) with n the number of jobs. 相似文献