全文获取类型
收费全文 | 97312篇 |
免费 | 17070篇 |
国内免费 | 11844篇 |
专业分类
电工技术 | 11139篇 |
技术理论 | 5篇 |
综合类 | 12182篇 |
化学工业 | 3451篇 |
金属工艺 | 1841篇 |
机械仪表 | 7678篇 |
建筑科学 | 2742篇 |
矿业工程 | 1860篇 |
能源动力 | 1979篇 |
轻工业 | 1313篇 |
水利工程 | 1681篇 |
石油天然气 | 1570篇 |
武器工业 | 1495篇 |
无线电 | 16124篇 |
一般工业技术 | 6531篇 |
冶金工业 | 2067篇 |
原子能技术 | 505篇 |
自动化技术 | 52063篇 |
出版年
2024年 | 691篇 |
2023年 | 1619篇 |
2022年 | 3068篇 |
2021年 | 3397篇 |
2020年 | 3752篇 |
2019年 | 3257篇 |
2018年 | 3195篇 |
2017年 | 3949篇 |
2016年 | 4505篇 |
2015年 | 5168篇 |
2014年 | 6812篇 |
2013年 | 6610篇 |
2012年 | 8029篇 |
2011年 | 8326篇 |
2010年 | 6669篇 |
2009年 | 6956篇 |
2008年 | 7245篇 |
2007年 | 7844篇 |
2006年 | 6335篇 |
2005年 | 5384篇 |
2004年 | 4423篇 |
2003年 | 3698篇 |
2002年 | 3017篇 |
2001年 | 2533篇 |
2000年 | 2042篇 |
1999年 | 1532篇 |
1998年 | 1166篇 |
1997年 | 986篇 |
1996年 | 768篇 |
1995年 | 573篇 |
1994年 | 488篇 |
1993年 | 388篇 |
1992年 | 364篇 |
1991年 | 193篇 |
1990年 | 201篇 |
1989年 | 160篇 |
1988年 | 129篇 |
1987年 | 62篇 |
1986年 | 63篇 |
1985年 | 57篇 |
1984年 | 47篇 |
1983年 | 45篇 |
1982年 | 49篇 |
1981年 | 31篇 |
1980年 | 37篇 |
1979年 | 26篇 |
1975年 | 21篇 |
1959年 | 33篇 |
1956年 | 21篇 |
1955年 | 28篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
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. 相似文献
2.
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. 相似文献
3.
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. 相似文献
4.
5.
6.
In this article we illustrate a methodology for building cross-language search engine. A synergistic approach between thesaurus-based approach and corpus-based approach is proposed. First, a bilingual ontology thesaurus is designed with respect to two languages: English and Spanish, where a simple bilingual listing of terms, phrases, concepts, and subconcepts is built. Second, term vector translation is used – a statistical multilingual text retrieval techniques that maps statistical information about term use between languages (Ontology co-learning). These techniques map sets of t f id f term weights from one language to another. We also applied a query translation method to retrieve multilingual documents with an expansion technique for phrasal translation. Finally, we present our findings. 相似文献
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.
为解决共享交通下的共乘用户群体发现效率低、准确率不高问题,依据R-树原理建立GeoOD-Tree索引,并在此基础上提出以最大化共乘率为目标的群体发现策略。首先,对原始时空轨迹数据进行特征提取与标定处理,挖掘有效出行起讫点(OD)轨迹;其次,针对用户起讫点轨迹的特征,建立GeoOD-Tree索引进行有效的存储管理;最后,给出以最大化共乘行程为目标的群体发现模型,并运用K最近邻(KNN)查询对搜索空间剪枝压缩,提高群体发现效率。采用西安市近12000辆出租车营运轨迹数据,选取动态时间规整(DTW)等典型算法与所提算法在查询效率与准确率上进行性能对比分析。与DTW算法相比,所提算法的准确率提高了10.12%,查询效率提高了约15倍。实验结果表明提出的群体发现策略能有效提高共乘用户群体发现的准确率和效率,可有效提升共乘出行方式的出行率。 相似文献