全文获取类型
收费全文 | 7968篇 |
免费 | 1021篇 |
国内免费 | 782篇 |
专业分类
电工技术 | 835篇 |
技术理论 | 1篇 |
综合类 | 893篇 |
化学工业 | 91篇 |
金属工艺 | 37篇 |
机械仪表 | 250篇 |
建筑科学 | 354篇 |
矿业工程 | 89篇 |
能源动力 | 197篇 |
轻工业 | 46篇 |
水利工程 | 666篇 |
石油天然气 | 115篇 |
武器工业 | 80篇 |
无线电 | 2028篇 |
一般工业技术 | 438篇 |
冶金工业 | 128篇 |
原子能技术 | 8篇 |
自动化技术 | 3515篇 |
出版年
2024年 | 84篇 |
2023年 | 181篇 |
2022年 | 240篇 |
2021年 | 303篇 |
2020年 | 317篇 |
2019年 | 301篇 |
2018年 | 262篇 |
2017年 | 347篇 |
2016年 | 382篇 |
2015年 | 430篇 |
2014年 | 618篇 |
2013年 | 610篇 |
2012年 | 683篇 |
2011年 | 663篇 |
2010年 | 497篇 |
2009年 | 515篇 |
2008年 | 537篇 |
2007年 | 547篇 |
2006年 | 400篇 |
2005年 | 350篇 |
2004年 | 289篇 |
2003年 | 259篇 |
2002年 | 200篇 |
2001年 | 141篇 |
2000年 | 116篇 |
1999年 | 84篇 |
1998年 | 82篇 |
1997年 | 58篇 |
1996年 | 40篇 |
1995年 | 36篇 |
1994年 | 35篇 |
1993年 | 33篇 |
1992年 | 18篇 |
1991年 | 10篇 |
1990年 | 11篇 |
1989年 | 13篇 |
1988年 | 8篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 11篇 |
1984年 | 5篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1973年 | 3篇 |
排序方式: 共有9771条查询结果,搜索用时 15 毫秒
1.
Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP. 相似文献
2.
Load testing of applications is an important and costly activity for software provider companies. Classical solutions are very difficult to set up statically, and their cost is prohibitive in terms of both human and hardware resources. Virtualized cloud computing platforms provide new opportunities for stressing an application's scalability, by providing a large range of flexible and less expensive (pay‐per‐use model) computation units. On the basis of these advantages, load testing solutions could be provided on demand in the cloud. This paper describes a Benchmark‐as‐a‐Service solution that automatically scales the load injection platform and facilitates its setup according to load profiles. Our approach is based on: (i) virtualization of the benchmarking platform to create self‐scaling injectors; (ii) online calibration to characterize the injector's capacity and impact on the benched application; and (iii) a provisioning solution to appropriately scale the load injection platform ahead of time. We also report experiments on a benchmark illustrating the benefits of this system in terms of cost and resource reductions. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
3.
讨论了在VMI管理思想下对具有随机需求特性的多客户库存分配问题 ,重点论述了有效近似算法的设计过程 ,最后基于一组模拟数据给出了一个算例。 相似文献
4.
Chih-Ming Chen Hahn-Ming Lee Chia-Chen Tan 《Engineering Applications of Artificial Intelligence》2006,19(8):967-978
The explosion of on-line information has given rise to many manually constructed topic hierarchies (such as Yahoo!!). But with the current growth rate in the amount of information, manual classification in topic hierarchies results in an immense information bottleneck. Therefore, developing an automatic classifier is an urgent need. However, classifiers suffer from enormous dimensionality, since the dimensionality is determined by the number of distinct keywords in a document corpus. More seriously, most classifiers are either working slowly or they are constructed subjectively without any learning ability. In this paper, we address these problems with a fair feature-subset selection (FFSS) algorithm and an adaptive fuzzy learning network (AFLN) for classification. The FFSS algorithm is used to reduce the enormous dimensionality. It not only gives fair treatment to each category but also has ability to identify useful features, including both positive and negative features. On the other hand, the AFLN provides extremely fast learning ability to model the uncertain behavior for classification so as to correct the fuzzy matrix automatically. Experimental results show that both FFSS algorithm and the AFLN lead to a significant improvement in document classification, compared to alternative approaches. 相似文献
5.
本文提出一种关于DMT系统传输纯数据流业务的最佳的功率分配算法,该算法使用了一种有效的表格查手工艺工和拉格朗日乘法器对分搜索办法,能够较快的收敛到最佳的功率点。同时,易于用硬件和软件实现。 相似文献
6.
Using Web resources to construct multilingual medical thesaurus for cross-language medical information retrieval 总被引:1,自引:0,他引:1
Due to the language barrier, non-English users are unable to retrieve the most updated medical information from the U.S. authoritative medical websites, such as PubMed and MedlinePlus. However, currently, there is no any cross-language medical information retrieval (CLMIR) system that can help Chinese-speaking consumers cross the language barrier in finding useful English medical information. A few CLMIR systems utilize MeSH (Medical Subject Headings) to help overcome the language barrier. Unfortunately, the traditional Chinese version of MeSH is currently unavailable.In this paper, we employ a semi-automatic term translation method to construct a Chinese–English MeSH by exploiting abundant multilingual Web resources, including Web anchor texts and search–result pages. Through this method, we have developed a Chinese–English Mesh Compilation System to assist knowledge engineers in compiling a Chinese–English medical thesaurus with more than 19,000 entries. Furthermore, this thesaurus has been used to develop a prototypical system for cross-language medical information retrieval, MMODE, which can help consumers retrieve top-quality English medical information using Chinese terms. 相似文献
7.
Jules Sadefo Kamdem 《Computing and Visualization in Science》2007,10(4):197-210
In this paper, we generalize the Linear VaR method from portfolios with normally distributed risk factors to portfolios with
mixture of elliptically distributed ones. We treat both the Expected Shortfall and the Value-at-Risk of such portfolios. Special
attention is given to the particular case of a mixture of multivariate t-distributions.
This is a part of J. SADEFO-KAMDEM PhD Thesis[12] of the Université de Reims, France . It has been presented at the workshop
on modelling and computation in Financial Engineering at Bad Herrenalb, Germany May 6-8, 2003. The author is an associate
professor at the Department of mathematics, université d’Evry Val d’Essonne. 相似文献
8.
This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
9.
Laura M. Haas Michael J. Carey Miron Livny Amit Shukla 《The VLDB Journal The International Journal on Very Large Data Bases》1997,6(3):241-256
In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas
for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom” about join algorithm
performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive op
timal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations
can lead to large performance improvements, e.g., as much as a 400% improvement in some cases. We also validate our cost model's
predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly
useful to implementors of relational query optimizers and query processing systems.
Edited by M. Adiba. Received May 1993 / Accepted April 1996 相似文献
10.