全文获取类型
收费全文 | 307806篇 |
免费 | 41172篇 |
国内免费 | 25312篇 |
专业分类
电工技术 | 32837篇 |
技术理论 | 12篇 |
综合类 | 28272篇 |
化学工业 | 29527篇 |
金属工艺 | 8421篇 |
机械仪表 | 21173篇 |
建筑科学 | 14742篇 |
矿业工程 | 8043篇 |
能源动力 | 12541篇 |
轻工业 | 13429篇 |
水利工程 | 5933篇 |
石油天然气 | 7258篇 |
武器工业 | 3343篇 |
无线电 | 47029篇 |
一般工业技术 | 22345篇 |
冶金工业 | 7641篇 |
原子能技术 | 1859篇 |
自动化技术 | 109885篇 |
出版年
2024年 | 2058篇 |
2023年 | 6101篇 |
2022年 | 12569篇 |
2021年 | 13872篇 |
2020年 | 12190篇 |
2019年 | 10033篇 |
2018年 | 9485篇 |
2017年 | 11789篇 |
2016年 | 13850篇 |
2015年 | 15765篇 |
2014年 | 22145篇 |
2013年 | 20855篇 |
2012年 | 23109篇 |
2011年 | 24759篇 |
2010年 | 18447篇 |
2009年 | 19231篇 |
2008年 | 18919篇 |
2007年 | 21673篇 |
2006年 | 18486篇 |
2005年 | 15418篇 |
2004年 | 12079篇 |
2003年 | 10567篇 |
2002年 | 8090篇 |
2001年 | 6458篇 |
2000年 | 5405篇 |
1999年 | 4143篇 |
1998年 | 3183篇 |
1997年 | 2780篇 |
1996年 | 2199篇 |
1995年 | 1728篇 |
1994年 | 1445篇 |
1993年 | 990篇 |
1992年 | 800篇 |
1991年 | 613篇 |
1990年 | 566篇 |
1989年 | 434篇 |
1988年 | 297篇 |
1987年 | 174篇 |
1986年 | 171篇 |
1985年 | 206篇 |
1984年 | 196篇 |
1983年 | 148篇 |
1982年 | 162篇 |
1981年 | 87篇 |
1980年 | 106篇 |
1979年 | 55篇 |
1978年 | 35篇 |
1964年 | 35篇 |
1962年 | 64篇 |
1959年 | 38篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
The proliferating need for sustainability intervention in food grain transportation planning is anchoring the attention of researchers in the interests of stakeholders and environment at large. Uncertainty associated with food grain supply further intensifies the problem steering the need for designing robust, cost-efficient and sustainable models. In line with this, this paper aims to develop a robust and sustainable intermodal transportation model to facilitate single type of food grain commodity shipments while considering procurement uncertainty, greenhouse gas emissions, and intentional hub disruption. The problem is designed as a mixed integer non-linear robust optimisation model on a hub and spoke network for evaluating near optimal shipment quantity, route selection and hub location decisions. The robust optimisation approach considers minimisation of total relative regret associated with total cost subject to several real-time constraints. A version of Particle Swarm Optimisation with Differential Evolution is proposed to tackle the resulting NP-hard problem. The model is tested with two other state-of the art meta-heuristics for small, medium, and large datasets subject to different procurement scenarios inspired from real time food grain operations in Indian context. Finally, the solution is evaluated with respect to total cost, model and solution robustness for all instances. 相似文献
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.
陈彦名 《电信工程技术与标准化》2015,(5)
介绍了目前最炙手可热的REST架构风格,该风格顺应Web2.0的兴起,完美的匹配了云计算时代来临的可扩展要求,在各种应用场景中都得到了充分的表现。根据其技术特点,分析了该风格的API在移动通信网络管理中的应用,从网管系统内部、网管系统之间以及网管系统与上层APP应用之间等多方面对是否适用于REST风格以及如何在合适的位置使用REST API进行了分析。 相似文献
4.
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. 相似文献
5.
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. 相似文献
6.
7.
The aim of the research is evaluating the classification performances of eight different machine-learning methods on the antepartum cardiotocography (CTG) data. The classification is necessary to predict newborn health, especially for the critical cases. Cardiotocography is used for assisting the obstetricians’ to obtain detailed information during the pregnancy as a technique of measuring fetal well-being, essentially in pregnant women having potential complications. The obstetricians describe CTG shortly as a continuous electronic record of the baby's heart rate took from the mother's abdomen. The acquired information is necessary to visualize unhealthiness of the embryo and gives an opportunity for early intervention prior to happening a permanent impairment to the embryo. The aim of the machine learning methods is by using attributes of data obtained from the uterine contraction (UC) and fetal heart rate (FHR) signals to classify as pathological or normal. The dataset contains 1831 instances with 21 attributes, examined by applying the methods. In the paper, the highest accuracy displayed as 99.2%. 相似文献
8.
9.
In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models. 相似文献
10.
Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms. 相似文献