全文获取类型
收费全文 | 5418篇 |
免费 | 860篇 |
国内免费 | 752篇 |
专业分类
电工技术 | 212篇 |
技术理论 | 1篇 |
综合类 | 971篇 |
化学工业 | 197篇 |
金属工艺 | 120篇 |
机械仪表 | 278篇 |
建筑科学 | 623篇 |
矿业工程 | 129篇 |
能源动力 | 92篇 |
轻工业 | 86篇 |
水利工程 | 225篇 |
石油天然气 | 127篇 |
武器工业 | 72篇 |
无线电 | 388篇 |
一般工业技术 | 400篇 |
冶金工业 | 161篇 |
原子能技术 | 39篇 |
自动化技术 | 2909篇 |
出版年
2024年 | 11篇 |
2023年 | 67篇 |
2022年 | 160篇 |
2021年 | 183篇 |
2020年 | 188篇 |
2019年 | 169篇 |
2018年 | 164篇 |
2017年 | 215篇 |
2016年 | 242篇 |
2015年 | 263篇 |
2014年 | 324篇 |
2013年 | 362篇 |
2012年 | 364篇 |
2011年 | 404篇 |
2010年 | 346篇 |
2009年 | 431篇 |
2008年 | 406篇 |
2007年 | 400篇 |
2006年 | 402篇 |
2005年 | 323篇 |
2004年 | 268篇 |
2003年 | 221篇 |
2002年 | 174篇 |
2001年 | 161篇 |
2000年 | 117篇 |
1999年 | 112篇 |
1998年 | 74篇 |
1997年 | 84篇 |
1996年 | 70篇 |
1995年 | 68篇 |
1994年 | 58篇 |
1993年 | 50篇 |
1992年 | 36篇 |
1991年 | 28篇 |
1990年 | 19篇 |
1989年 | 17篇 |
1988年 | 10篇 |
1987年 | 2篇 |
1986年 | 5篇 |
1985年 | 5篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1980年 | 4篇 |
1976年 | 2篇 |
1965年 | 1篇 |
1963年 | 1篇 |
1959年 | 1篇 |
1956年 | 2篇 |
1954年 | 1篇 |
排序方式: 共有7030条查询结果,搜索用时 15 毫秒
1.
2.
Nicholas Vergeylen Kenneth Srensen Pieter Vansteenwegen 《International Transactions in Operational Research》2020,27(6):2695-2714
This paper introduces an efficient algorithm for the bike request scheduling problem (BRSP). The BRSP is built around the concept of request, defined as the pickup or dropoff of a number of identical items (bikes) at a specific station, within a certain time window, and with a certain priority. The aim of the BRSP is to sequence requests on (and hence determine the routes of) a set of vehicles, in such a way that the sum of the priorities of the executed requests is maximized, all time windows are respected, and the capacity of the vehicles is not exceeded. The generation of the set of requests is explicitly not a part of the problem definition of the BRSP. The primary application of the BRSP, from which it derives its name, is to determine the routes of a set of repositioning vehicles in a bike sharing system, although other applications exist. The algorithm introduced in this paper is based on a set of related greedy randomized adaptive search procedure followed by variable neighborhood descent (GRASP + VND) operators embedded in a large neighborhood search (LNS) framework. Since this paper presents the first heuristic for the BRSP, a computational comparison to existing approaches is not possible. We therefore compare the solutions found by our LNS heuristic to those found by an exact solver (Gurobi). These experiments confirm that the proposed algorithm scales to realistic dimensions and is able to find near‐optimal solutions in seconds. 相似文献
3.
基于分解的多目标进化算法(MOEA/D)在解决多目标问题时,具有简单有效的特点。但多数MOEA/D采用固定的控制参数,导致全局搜索能力差,难以平衡收敛性和多样性。针对以上问题提出一种基于变异算子和邻域值自适应的多目标优化算法。该算法根据种群中个体适应度值的分散或集中程度进行判断,并据此对变异算子进行自适应的调节,从而增强算法的全局搜索能力;根据进化所处的阶段以及个体适应度值的集中程度,自适应地调节邻域值大小,保证每个个体在不同的进化代数都有一个邻域值大小;在子问题邻域中,统计子问题对应个体的被支配数,通过判断被支配数是否超过设定的上限,来决定是否将Pareto支配关系也作为邻域内判断个体好坏的准则之一。将提出的算法与传统的MOEA/D在标准测试问题上进行对比。实验结果表明,提出的算法求得的解集具有更好的收敛性和多样性,在求解性能上具有一定的优势。 相似文献
4.
利用X射线衍射、X射线荧光光谱(XRF)、X射线能谱分析(EDX)和矿物解离分析(MLA)等检测手段对云南镇源难处理金精矿的化学组成、矿物组成、硫化物特征以及金的分布情况进行了详细的工艺矿物学研究。结果显示:该金矿以硫化矿、碳酸盐和硅酸盐类矿物为主,含有3.18%的有机碳和2.37%的无机碳。通过金的诊断浸出发现96.16%的金被硫化物包裹,少量金以单体形式存在。通过对主要载金矿物黄铁矿、辉锑矿和毒砂的粒度、包裹及裸露情况进行分析,得出大部分硫化矿以解离单体的形式存在,少部分与其他矿物共生。根据MLA测试及金的诊断浸出,认为大部分金被硫化矿完全包裹,处理该矿石时应先进行硫化物包裹层的氧化处理,再进行金矿的浸出。 相似文献
5.
It is a crucial need for a clustering technique to produce high-quality clusters from biomedical and gene expression datasets without requiring any user inputs. Therefore, in this paper we present a clustering technique called KUVClust that produces high-quality clusters when applied on biomedical and gene expression datasets without requiring any user inputs. The KUVClust algorithm uses three concepts namely multivariate kernel density estimation, unique closest neighborhood set and vein-based clustering. Although these concepts are known in the literature, KUVClust combines the concepts in a novel manner to achieve high-quality clustering results. The performance of KUVClust is compared with established clustering techniques on real-world biomedical and gene expression datasets. The comparisons were evaluated in terms of three criteria (purity, entropy, and sum of squared error (SSE)). Experimental results demonstrated the superiority of the proposed technique over the existing techniques for clustering both the low dimensional biomedical and high dimensional gene expressions datasets used in the experiments. 相似文献
6.
为了降低家具配送成本,提高物流效率,基于第三方物流配送模式,构建了以总行驶距离最短和车辆数最少为最优目标的开放式车辆路径问题(open vehicle routing problem,OVRP)数学模型,并设计了一个改进的两阶段禁忌搜索算法进行求解,第1阶段求解包含所有客户的TSP(traveling salesman problem)路径来作为第2阶段划分OVRP路径的基础.设计了一个随机动态禁忌表,并将"邻域算子编号"和"邻域交换点对"同时作为禁忌对象,避免了过度禁忌的情况.另外,对5个邻域算子进行了测试,表明采用由点交换、分序点插入、点逆序和前点前向插入这4个算子组成的多邻域结构体效果最佳.经算例测试和文献对比,验证了设计算法的有效性,采用第三方物流配送比自营物流配送更节省成本. 相似文献
7.
Jonatas B. C. Chagas Ulisses E. F. Silveira Andr G. Santos Marcone J. F. Souza 《International Transactions in Operational Research》2020,27(1):112-137
This paper addresses the double vehicle routing problem with multiple stacks (DVRPMS) in which a fleet of vehicles must collect items in a pickup region and then travel to a delivery region where all items are delivered. The load compartment of all vehicles is divided into rows (horizontal stacks) of fixed profundity (horizontal heights), and on each row, the unloading process must respect the last‐in‐first‐out policy. The objective of the DVRPMS is to find optimal routes visiting all pickup and delivery points while ensuring the feasibility of the vehicle loading plans. We propose a new integer linear programming formulation, which was useful to find inconsistencies in the results of exact algorithms proposed in the literature, and a variable neighborhood search based algorithm that was able to find solutions with same or higher quality in shorter computational time for most instances when compared to the methods already present in the literature. 相似文献
8.
While the orthogonal design of split-plot fractional factorial experiments has received much attention already, there are still major voids in the literature. First, designs with one or more factors acting at more than two levels have not yet been considered. Second, published work on nonregular fractional factorial split-plot designs was either based only on Plackett–Burman designs, or on small nonregular designs with limited numbers of factors. In this article, we present a novel approach to designing general orthogonal fractional factorial split-plot designs. One key feature of our approach is that it can be used to construct two-level designs as well as designs involving one or more factors with more than two levels. Moreover, the approach can be used to create two-level designs that match or outperform alternative designs in the literature, and to create two-level designs that cannot be constructed using existing methodology. Our new approach involves the use of integer linear programming and mixed integer linear programming, and, for large design problems, it combines integer linear programming with variable neighborhood search. We demonstrate the usefulness of our approach by constructing two-level split-plot designs of 16–96 runs, an 81-run three-level split-plot design, and a 48-run mixed-level split-plot design. Supplementary materials for this article are available online. 相似文献
9.
杨霁琳张贤勇唐孝 《数据采集与处理》2016,31(6):1156-1163
在模糊信息系统中,通过有序加权平均(Ordered weighted averaging,OWA)算子计算对象相似度,可以建立λ截集的相容关系。当λ的值确定后,OWA算子中量词参数(α,β)的选取直接关系到不可区分关系的建立以及信息粒的粗细。因此合理选取参数(α,β)是值得进一步研究的问题。本文采用粗糙集三支决策理论,研究模糊信息系统
OWA算子参数选择的相关内容。基于参数的激进、中庸和消极语义,确定OWA算子(α,β)的3种常用取值;进而研究相似度、相容类、双向近似和三支区域在3种参数选择下的性质关系。最后利用实例验证分析了模糊量词参数语义解释的合理性。本文采用三支决策创新视角,得到模糊信息系统OWA算子的深入性质,为相关模糊量词参数提供语义解释与选择依据。 相似文献
10.