全文获取类型
收费全文 | 13777篇 |
免费 | 1903篇 |
国内免费 | 1411篇 |
专业分类
电工技术 | 977篇 |
技术理论 | 1篇 |
综合类 | 1550篇 |
化学工业 | 308篇 |
金属工艺 | 120篇 |
机械仪表 | 509篇 |
建筑科学 | 972篇 |
矿业工程 | 113篇 |
能源动力 | 233篇 |
轻工业 | 196篇 |
水利工程 | 152篇 |
石油天然气 | 90篇 |
武器工业 | 131篇 |
无线电 | 1423篇 |
一般工业技术 | 988篇 |
冶金工业 | 720篇 |
原子能技术 | 23篇 |
自动化技术 | 8585篇 |
出版年
2024年 | 42篇 |
2023年 | 246篇 |
2022年 | 393篇 |
2021年 | 438篇 |
2020年 | 475篇 |
2019年 | 449篇 |
2018年 | 403篇 |
2017年 | 575篇 |
2016年 | 603篇 |
2015年 | 785篇 |
2014年 | 1053篇 |
2013年 | 1140篇 |
2012年 | 1155篇 |
2011年 | 1265篇 |
2010年 | 1022篇 |
2009年 | 992篇 |
2008年 | 1009篇 |
2007年 | 921篇 |
2006年 | 781篇 |
2005年 | 633篇 |
2004年 | 538篇 |
2003年 | 405篇 |
2002年 | 366篇 |
2001年 | 303篇 |
2000年 | 207篇 |
1999年 | 128篇 |
1998年 | 103篇 |
1997年 | 91篇 |
1996年 | 66篇 |
1995年 | 73篇 |
1994年 | 61篇 |
1993年 | 47篇 |
1992年 | 48篇 |
1991年 | 34篇 |
1990年 | 29篇 |
1989年 | 27篇 |
1988年 | 20篇 |
1987年 | 15篇 |
1986年 | 11篇 |
1985年 | 20篇 |
1984年 | 12篇 |
1983年 | 15篇 |
1982年 | 16篇 |
1981年 | 14篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 5篇 |
1975年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures. 相似文献
2.
Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like -means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in -means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to -means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than -means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives. 相似文献
3.
文章首先总结了电力企业信息管理系统的现状,提出了多源信息管理系统融合集成的邦联、子集和完全融合3种方式,分析了3种方式的优缺点,以建设企业"互联网搜索"型数字引擎为目标,提出了融合基于本体的图数据库建模,多维关联与路径因果分析,和人机共生互动可视化决策于一体的企业信息管理系统技术发展趋势;在系统分析目前正在快速发展的图数据库技术与传统关系数据库之间的本质区别基础上,总结原创的电力图计算平台技术的特点;在此基础上讨论"电网一张图"在建设能源互联网时空信息管理平台数据关联索引图中的核心作用,提出了支持能源互联网建设的"电网一张图"时空信息管理系统的技术架构与特点,最后总结"电网一张图"时空信息管理系统在提高电网安全运行水平、提升客户服务水平、增强清洁能源消纳水平、改善经营绩效水平、以及为综合能源服务和建设能源生态等提供数据服务方面的广阔应用场景。 相似文献
4.
Lei Yuan Mads Frederik Hansen Henriette Lyng Røder Ni Wang 《Critical reviews in food science and nutrition》2020,60(13):2277-2293
AbstractAttachment of microorganisms to food contact surfaces and the subsequent formation of biofilms may cause equipment damage, food spoilage and even diseases. Mixed-species biofilms are ubiquitous in the food industry and they generally exhibit higher resistance to disinfectants and antimicrobials compared to single-species biofilms. The physiology and metabolic activity of microorganisms in mixed-species biofilms are however rather complicated to study, and despite targeted research efforts, the potential role of mixed-species biofilms in food industry is still rather unexplored. In this review, we summarize recent studies in the context of bacterial social interactions in mixed-species biofilms, resistance to disinfectants, detection methods, and potential novel strategies to control the formation of mixed-species biofilms for enhanced food safety and food quality. 相似文献
5.
ABSTRACTFeature selection is an important task to improve the classifier’s accuracy and to decrease the problem size. A number of methodologies have been presented for feature selection problems using metaheuristic algorithms. In this paper, an improved self-adaptive inertia weight particle swarm optimisation with local search and combined with C4.5 classifiers for feature selection algorithm is proposed. In this proposed algorithm, the gradient base local search with its capacity of helping to explore the feature space and an improved self-adaptive inertia weight particle swarm optimisation with its ability to converge a best global solution in the search space. Experimental results have verified that the SIW-APSO-LS performed well compared with other state of art feature selection techniques on a suit of 16 standard data sets. 相似文献
6.
7.
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. 相似文献
8.
Marion Markwick 《Urban Research & Practice》2018,11(2):87-110
The paper aims to unfold the narrative of development in a creative cluster project for the regeneration of Strait Street in Valletta, Malta. This is approached by first examining the distinctive, historically contentious background of the neighbourhood and, thereafter, unpacking the development narrative of policy documents and the discursive and material constructs about the creative city approach to regeneration strategies in the city. Using a ‘system-wide’ analytical framework, this material is then scrutinized to gain an understanding of the specificities involved and, finally, discuss the crucial features of the key dimensions elucidating the potential strengths and weaknesses of the case 相似文献
9.
This paper proposes a novel hybrid technique called enhanced grey wolf optimization-sine cosine algorithm-cuckoo search (EGWO-SCA-CS) algorithm to improve the electrical power system stability. The proposed method comprises of a popular grey wolf optimization (GWO) in an enhanced and hybrid form. It embraces the well-balanced exploration and exploitation using the cuckoo search (CS) algorithm and enhanced search capability through the sine cosine algorithm (SCA) to elude the stuck to the local optima. The proposed technique is validated with the 23 benchmark functions and compared with state-of-the-art methods. The benchmark functions consist of unimodal, multimodal function from which the best suitability of the proposed technique can be identified. The robustness analysis also presented with the proposed method through boxplot, and a detailed statistical analysis is performed for a set of 30 individual runs. From the inferences gathered from the benchmark functions, the proposed technique is applied to the stability problem of a power system, which is heavily stressed with the nonlinear variation of the load and thereby operating conditions. The dynamics of power system components have been considered for the mathematical model of a multimachine system, and multiobjective function has been framed in tuning the optimal controller parameters. The effectiveness of the proposed algorithm has been assessed by considering two case studies, namely, (i) the optimal controller parameter tuning, and (ii) the coordination of oscillation damping devices in the power system stability enhancement. In the first case study, the power system stabilizer (PSS) is considered as a controller, and a self-clearing three-phase fault is considered as the system uncertainty. In contrast, static synchronous compensator (STATCOM) and PSS are considered as controllers to be coordinated, and perturbation in the system states as uncertainty in the second case study. 相似文献
10.
基于分解的多目标进化算法(MOEA/D)在解决多目标问题时,具有简单有效的特点。但多数MOEA/D采用固定的控制参数,导致全局搜索能力差,难以平衡收敛性和多样性。针对以上问题提出一种基于变异算子和邻域值自适应的多目标优化算法。该算法根据种群中个体适应度值的分散或集中程度进行判断,并据此对变异算子进行自适应的调节,从而增强算法的全局搜索能力;根据进化所处的阶段以及个体适应度值的集中程度,自适应地调节邻域值大小,保证每个个体在不同的进化代数都有一个邻域值大小;在子问题邻域中,统计子问题对应个体的被支配数,通过判断被支配数是否超过设定的上限,来决定是否将Pareto支配关系也作为邻域内判断个体好坏的准则之一。将提出的算法与传统的MOEA/D在标准测试问题上进行对比。实验结果表明,提出的算法求得的解集具有更好的收敛性和多样性,在求解性能上具有一定的优势。 相似文献