全文获取类型
收费全文 | 4199篇 |
免费 | 518篇 |
国内免费 | 339篇 |
专业分类
电工技术 | 280篇 |
综合类 | 482篇 |
化学工业 | 80篇 |
金属工艺 | 62篇 |
机械仪表 | 209篇 |
建筑科学 | 151篇 |
矿业工程 | 67篇 |
能源动力 | 94篇 |
轻工业 | 32篇 |
水利工程 | 79篇 |
石油天然气 | 35篇 |
武器工业 | 49篇 |
无线电 | 253篇 |
一般工业技术 | 240篇 |
冶金工业 | 178篇 |
原子能技术 | 9篇 |
自动化技术 | 2756篇 |
出版年
2024年 | 5篇 |
2023年 | 15篇 |
2022年 | 41篇 |
2021年 | 43篇 |
2020年 | 88篇 |
2019年 | 114篇 |
2018年 | 100篇 |
2017年 | 82篇 |
2016年 | 139篇 |
2015年 | 137篇 |
2014年 | 195篇 |
2013年 | 310篇 |
2012年 | 256篇 |
2011年 | 335篇 |
2010年 | 316篇 |
2009年 | 322篇 |
2008年 | 349篇 |
2007年 | 382篇 |
2006年 | 329篇 |
2005年 | 264篇 |
2004年 | 221篇 |
2003年 | 205篇 |
2002年 | 140篇 |
2001年 | 101篇 |
2000年 | 80篇 |
1999年 | 73篇 |
1998年 | 75篇 |
1997年 | 40篇 |
1996年 | 37篇 |
1995年 | 42篇 |
1994年 | 31篇 |
1993年 | 29篇 |
1992年 | 19篇 |
1991年 | 13篇 |
1990年 | 14篇 |
1989年 | 21篇 |
1988年 | 5篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 8篇 |
1984年 | 7篇 |
1983年 | 10篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1958年 | 2篇 |
1957年 | 2篇 |
排序方式: 共有5056条查询结果,搜索用时 15 毫秒
1.
2.
The generalized assignment problem with special ordered sets (GAPS2), is the problem of allocating n tasks to m time-periods, where each task must be assigned to a time-period, or shared between two consecutive time-periods. For reasonably large values of m and n the NP-hard combinatorial problem GAPS2 becomes intractable for standard mathematical programming software, hence there is a need for heuristic algorithms to solve such problems. It will be shown how an LP-based heuristic developed previously for the well-established generalized assignment problem can be modified and extended to solve GAPS2. Encouraging results, in terms of speed and accuracy, in particular when compared to an existing heuristic for GAPS2, are described. 相似文献
3.
4.
关于Vague集的模糊熵及其构造 总被引:17,自引:3,他引:14
本文分析了Vague集的性质,给出了将Vague集变换为Fuzzy集的转换函数,并讨论了其性质。分析了关于Vague集的模糊熵的直观特性,在此基础上我们给出了Vague集的模糊熵的定义。最后给出了一个关于Vague集的模糊熵的构造方法。 相似文献
5.
通过对洛东水电厂的来水量、地质和经济指标等技术资料的分析,认为采用灯泡贯流式机组扩大其装机的容量是可行的。并介绍了洛东水电厂增机扩容的可行性设计情况。 相似文献
6.
Li Chuanzhi Wei Fuyi 《中北大学学报(自然科学版)》1991,(4)
在多目标优化中,对非支配解集的估计是一项非常重要的工作.本文给出一种序列逼近非支配解集的方法. 相似文献
7.
In this article, we analyze a co-operative multi-thread search-based optimization strategy, where each solver thread represents a different optimization algorithm (or the same one with different settings), and they are all controlled by a centralized co-ordinator. We also propose the use of memory to keep track of both the state of the individual threads and the obtained solutions. Based on this memory, a very simple fuzzy rule base is used to control the system behavior.We also present the results of three computational experiments. The first of these checks the strategy by comparing it with an independent search strategy and a sequential algorithm, and the superiority of the co-operative scheme is confirmed. The second analyzes how definition of the threads affects the quality of the results, and the importance of there being a balanced set between intensification and diversification is corroborated. The third explores the use of memory with two different fuzzy rules, and the results indicate that the best combination is to use memory together with two rules (solver dependent and solver independent ones) (although this combination should not be activated at the beginning of the search in order to avoid premature convergence). 相似文献
8.
The aluminium species in different tea infusions were investigated, by determining their stability constants and concentration. This was done for some particular samples using a simple experimental method based on the sorption of aluminium on the strongly sorbing resin Chelex 100, by a batch procedure. From the thermodynamic information obtained it is possible to calculate the concentration of the different species, and in particular that of the free metal ion, which is very important for evaluating the adsorption of aluminium on biological membranes. It was found that aluminium in the tea infusions here considered is present at high total concentration, approximately 0.1 mM, but mainly linked to strong complexes, for instance with side reaction coefficient higher than 10(5.11) at pH 3.95 in one case (tea 1). This could be the reason for the low toxicity of aluminium in tea. These strong complexes were not dissociated even in the presence of Chelex 100. In this case only a limiting value of the reaction coefficient could be evaluated. The presence of the very strong complexes was found in all the tea sample here considered. In two of the considered samples (one black and one green tea) a part of Al(III) was linked to less strong complexes, for example with a reaction coefficient 10(4.14) (tea 2, pH 4.20). The presence in the considered tea infusions of other substances able to complex aluminium was also detected, by the well known ligand titration procedure, at concentration ranging from 0.65 to 3.37 mM in three tea infusions, and at somewhat higher concentration in the case of the ready drink, which was also considered for comparison. 相似文献
9.
Marco Dalai Author Vitae 《Automatica》2007,43(8):1418-1425
In this paper we consider the problem of constructing confidence regions for the parameters of nonlinear dynamical systems. The proposed method uses higher order statistics and extends the LSCR (leave-out sign-dominant correlation regions) algorithm for linear systems introduced in Campi and Weyer [2005, Guaranteed non-asymptotic confidence regions in system identification. Automatica 41(10), 1751-1764. Extended version available at 〈http://www.ing.unibs.it/∼campi〉]. The confidence regions contain the true parameter value with a guaranteed probability for any finite number of data points. Moreover, the confidence regions shrink around the true parameter value as the number of data points increases. The usefulness of the proposed approach is illustrated on some simple examples. 相似文献
10.
This paper describes a database model based on the original rough sets theory. Its rough relations permit the representation of a rough set of tuples not definable in terms of the elementary classes, except through use of lower and upper approximations. The rough relational database model also incorporates indiscernibility in the representation and in all the operators of the rough relational algebra. This indiscernibility is based strictly on equivalence classes which must be defined for every attribute domain. There are several obvious applications for which the rough relational database model can more accurately model an enterprise than does the standard relational model. These include systems involving ambiguous, imprecise, or uncertain data. Retrieval over mismatched domains caused by the merging of one or more applications can be facilitated by the use of indiscernibility, and naive system users can achieve greater recall with the rough relational database. In addition, applications inherently “rough” could be more easily implemented and maintained in the rough relational database. 相似文献