全文获取类型
收费全文 | 148494篇 |
免费 | 22032篇 |
国内免费 | 13199篇 |
专业分类
电工技术 | 11768篇 |
技术理论 | 5篇 |
综合类 | 13785篇 |
化学工业 | 17623篇 |
金属工艺 | 3933篇 |
机械仪表 | 8676篇 |
建筑科学 | 7334篇 |
矿业工程 | 2928篇 |
能源动力 | 3842篇 |
轻工业 | 7811篇 |
水利工程 | 2695篇 |
石油天然气 | 2640篇 |
武器工业 | 1653篇 |
无线电 | 20906篇 |
一般工业技术 | 13058篇 |
冶金工业 | 4334篇 |
原子能技术 | 933篇 |
自动化技术 | 59801篇 |
出版年
2024年 | 863篇 |
2023年 | 2616篇 |
2022年 | 6399篇 |
2021年 | 6931篇 |
2020年 | 5291篇 |
2019年 | 4762篇 |
2018年 | 4892篇 |
2017年 | 6197篇 |
2016年 | 7764篇 |
2015年 | 8918篇 |
2014年 | 11068篇 |
2013年 | 10838篇 |
2012年 | 10981篇 |
2011年 | 10752篇 |
2010年 | 8748篇 |
2009年 | 9202篇 |
2008年 | 9389篇 |
2007年 | 10854篇 |
2006年 | 9436篇 |
2005年 | 8001篇 |
2004年 | 5895篇 |
2003年 | 5066篇 |
2002年 | 3803篇 |
2001年 | 2918篇 |
2000年 | 2475篇 |
1999年 | 1764篇 |
1998年 | 1345篇 |
1997年 | 1084篇 |
1996年 | 897篇 |
1995年 | 690篇 |
1994年 | 620篇 |
1993年 | 464篇 |
1992年 | 415篇 |
1991年 | 297篇 |
1990年 | 330篇 |
1989年 | 269篇 |
1988年 | 183篇 |
1987年 | 119篇 |
1986年 | 116篇 |
1985年 | 111篇 |
1984年 | 105篇 |
1983年 | 81篇 |
1982年 | 83篇 |
1981年 | 70篇 |
1980年 | 86篇 |
1979年 | 37篇 |
1964年 | 42篇 |
1962年 | 68篇 |
1959年 | 37篇 |
1955年 | 29篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
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.
Although hybrid Petri net (HPN) is a popular formalism in modelling hybrid production systems, the HPN model of large scale systems gets substantially complicated for analysis and control due to large dimensionality of such systems. To overcome this problem, a typical approach is to decompose the net into subnets and then control the plant through hierarchical or decentralized structures. Although this concept has been widely discussed in the literature for discrete PNs, there is a lack of research for HPNs. In this paper, a new method of decomposition of first-order hybrid Petri nets (FOHPNs) is proposed first and then the hierarchical control of the subnets through a coordinator is introduced. The advantage of using the proposed approach is validated by an existing example. A sugar milling case study is analysed by using a decomposed FOHPN model and the optimization results are compared against the results of the approaches presented in other papers. Simulation results show not only an improvement in production rate, but also show the ability to control the plant online. In addition, by using the hierarchical control structure for an FOHPN model, it is possible to reduce the cost of communication links, improve the reliability of the system, maintain the plant locally, and partially redesign the system. 相似文献
7.
In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations. 相似文献
8.
Akira Yamamoto Kentaro Teramura Saburo Hosokawa Tsunehiro Tanaka 《Science and Technology of Advanced Materials》2015,16(2)
The effect of SO2 gas was investigated on the activity of the photo-assisted selective catalytic reduction of nitrogen monoxide (NO) with ammonia (NH3) over a TiO2 photocatalyst in the presence of excess oxygen (photo-SCR). The introduction of SO2 (300 ppm) greatly decreased the activity of the photo-SCR at 373 K. The increment of the reaction temperature enhanced the resistance to SO2 gas, and at 553 K the conversion of NO was stable for at least 300 min of the reaction. X-ray diffraction, FTIR spectroscopy, thermogravimetry and differential thermal analysis, x-ray photoelectron spectroscopy (XPS), elemental analysis and N2 adsorption measurement revealed that the ammonium sulfate species were generated after the reaction. There was a strong negative correlation between the deposition amount of the ammonium sulfate species and the specific surface area. Based on the above relationship, we concluded that the deposition of the ammonium sulfate species decreased the specific surface area by plugging the pore structure of the catalyst, and the decrease of the specific surface area resulted in the deactivation of the catalyst. 相似文献
9.
Protein databases used in research are huge and still grow at a fast pace. Many comparisons need to be done when searching similar (homologous) sequences for a given query sequence in these databases. Comparing a query sequence against all sequences of a huge database using the well-known Smith–Waterman algorithm is very time-consuming. Hidden Markov Models pose an opportunity for reducing the number of entries of a database and also enable to find distantly homologous sequences. Fewer entries are achieved by clustering similar sequences in a Hidden Markov Model. Such an approach is used by the bioinformatics tool HHblits. To further reduce the runtime, HHblits uses two-level prefiltering to reduce the number of time-consuming Viterbi comparisons. Still, prefiltering is very time-consuming. Highly parallel architectures and huge bandwidth are required for processing and transferring the massive amounts of data. In this article, we present an approach exploiting the reconfigurable, hybrid computer architecture Convey HC-1 for migrating the most time-consuming part. The Convey HC-1 with four FPGAs and high memory bandwidth of up to 76.8 GB/s serves as the platform of choice. Other bioinformatics applications have already been successfully supported by the HC-1. Limited by FPGA size only, we present a design that calculates four first-level prefiltering scores per FPGA concurrently, i.e. 16 calculations in total. This score calculation for the query profile against database sequences is done by a modified Smith–Waterman scheme that is internally parallelized 128 times in contrast to the original Streaming ‘Single Instruction Multiple Data (SIMD)’ Extensions (SSE)-supported implementation where only 16-fold parallelism can be exploited and where memory bandwidth poses the limiting factor. Preloading the query profile, we are able to transform the memory-bound implementation to a compute- and resource-bound FPGA design. We tightly integrated the FPGA-based coprocessor into the hybrid computing system by employing task-parallelism for the two-level prefiltering. Despite much lower clock rates, the FPGAs outperform SSE-based execution for the calculation of the prefiltering scores by a factor of 7.9. 相似文献
10.
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. 相似文献