全文获取类型
收费全文 | 294603篇 |
免费 | 33480篇 |
国内免费 | 19546篇 |
专业分类
电工技术 | 22576篇 |
技术理论 | 32篇 |
综合类 | 31142篇 |
化学工业 | 29678篇 |
金属工艺 | 11055篇 |
机械仪表 | 18041篇 |
建筑科学 | 32043篇 |
矿业工程 | 13763篇 |
能源动力 | 9725篇 |
轻工业 | 17554篇 |
水利工程 | 11680篇 |
石油天然气 | 13320篇 |
武器工业 | 4441篇 |
无线电 | 29592篇 |
一般工业技术 | 22367篇 |
冶金工业 | 12062篇 |
原子能技术 | 2670篇 |
自动化技术 | 65888篇 |
出版年
2024年 | 1605篇 |
2023年 | 4453篇 |
2022年 | 8283篇 |
2021年 | 10274篇 |
2020年 | 10374篇 |
2019年 | 8090篇 |
2018年 | 7803篇 |
2017年 | 9573篇 |
2016年 | 11350篇 |
2015年 | 12568篇 |
2014年 | 20439篇 |
2013年 | 18360篇 |
2012年 | 22114篇 |
2011年 | 24165篇 |
2010年 | 18212篇 |
2009年 | 18526篇 |
2008年 | 17686篇 |
2007年 | 20708篇 |
2006年 | 18075篇 |
2005年 | 15519篇 |
2004年 | 12876篇 |
2003年 | 10917篇 |
2002年 | 8771篇 |
2001年 | 7115篇 |
2000年 | 6124篇 |
1999年 | 4829篇 |
1998年 | 3535篇 |
1997年 | 3057篇 |
1996年 | 2496篇 |
1995年 | 1966篇 |
1994年 | 1702篇 |
1993年 | 1246篇 |
1992年 | 1032篇 |
1991年 | 685篇 |
1990年 | 642篇 |
1989年 | 557篇 |
1988年 | 326篇 |
1987年 | 224篇 |
1986年 | 208篇 |
1985年 | 230篇 |
1984年 | 170篇 |
1983年 | 145篇 |
1982年 | 85篇 |
1981年 | 92篇 |
1980年 | 103篇 |
1979年 | 47篇 |
1978年 | 31篇 |
1977年 | 31篇 |
1975年 | 25篇 |
1959年 | 37篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
2.
Competition forces manufacturing systems to be flexible and to increase product variety and process complexity. These tasks depend on the flexible design of a bill of materials (BOM), one of the most important inputs in manufacturing planning and control systems. Product variety forces systems to generate BOMs with regard to product properties through a BOM pattern. A variant bill of materials provides a structure to manage product variability. In this study, an algorithm is designed to build a BOM pattern using computer-aided design and computer-aided manufacturing (CAD/CAM) data, and another algorithm is designed to generate variants with regard to product specifications. Genetic algorithm is used to generate new products to provide high product variability for testing algorithms. After the test, both algorithms are applied to a real industry problem. The BOM pattern is built automatically using CAD/CAM data, and variants are generated with regard to the pattern, and the results are discussed. 相似文献
3.
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. 相似文献
4.
This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances. 相似文献
5.
《Food Control》2015
The aim of the study was to investigate annual and regional differences in the level of aflatoxin B1 (AFB1) in grains and dairy cattle feed. Maize (n = 972), wheat (n = 201), barley (n = 147), oat (n = 136), grain mixtures (n = 168), and dairy cattle feed (n = 325) were sampled from 2009 to 2013 on different farms and in different farm factories situated in four Croatian regions. The samples were analysed for AFB1 using the validated ELISA immunoassay. AFB1 was determined in 16.4% of all investigated samples, among which maize was proven to be the most contaminated, with 21.7% of the samples recovered during 2013 harbouring AFB1 in concentrations over the permissible ones. Levels higher than permitted were observed in 17.9% and 12.3% of grain mixtures and dairy cattle feed, respectively, whereas concentrations of AFB1 determined in other crops throughout the investigated period met the stipulated requirements. The results revealed the AFB1 occurrence to be significantly (p < 0.05) dependent on the cultivation region, with the highest levels generally found in maize harvested in 2013 and consequently in grain mixtures and cattle feed that can most likely be associated with climatic conditions as the most critical factor for mould formation, and thus also AFB1 production. 相似文献
6.
为检查工程质量,查找输水系统可能存在的问题并消除隐患,保障电站安全运行,福建仙游抽水蓄能电站在投产发电前,要对输水发电系统进行充水试验与放空排水试验,在试验过程中监测输水系统的应力、应变与渗漏水情况。本文以尾水系统为例,介绍了试验所应具备的工程条件、工作程序及技术要求、试验成果分析和存在问题处理等。试验表明,仙游抽水蓄能电站尾水系统设计合理,施工质量优良,结构可靠,可供同类工程参考与借鉴。 相似文献
7.
Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm. 相似文献
8.
This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation. 相似文献
9.
We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately. 相似文献
10.