全文获取类型
收费全文 | 10608篇 |
免费 | 1825篇 |
国内免费 | 1502篇 |
专业分类
电工技术 | 859篇 |
综合类 | 1058篇 |
化学工业 | 176篇 |
金属工艺 | 102篇 |
机械仪表 | 450篇 |
建筑科学 | 136篇 |
矿业工程 | 90篇 |
能源动力 | 128篇 |
轻工业 | 74篇 |
水利工程 | 98篇 |
石油天然气 | 63篇 |
武器工业 | 127篇 |
无线电 | 1362篇 |
一般工业技术 | 792篇 |
冶金工业 | 322篇 |
原子能技术 | 20篇 |
自动化技术 | 8078篇 |
出版年
2024年 | 76篇 |
2023年 | 212篇 |
2022年 | 335篇 |
2021年 | 359篇 |
2020年 | 417篇 |
2019年 | 398篇 |
2018年 | 366篇 |
2017年 | 527篇 |
2016年 | 560篇 |
2015年 | 677篇 |
2014年 | 818篇 |
2013年 | 892篇 |
2012年 | 904篇 |
2011年 | 948篇 |
2010年 | 725篇 |
2009年 | 778篇 |
2008年 | 858篇 |
2007年 | 802篇 |
2006年 | 617篇 |
2005年 | 525篇 |
2004年 | 413篇 |
2003年 | 303篇 |
2002年 | 270篇 |
2001年 | 231篇 |
2000年 | 183篇 |
1999年 | 104篇 |
1998年 | 85篇 |
1997年 | 91篇 |
1996年 | 62篇 |
1995年 | 59篇 |
1994年 | 43篇 |
1993年 | 43篇 |
1992年 | 32篇 |
1991年 | 26篇 |
1990年 | 18篇 |
1989年 | 24篇 |
1988年 | 17篇 |
1987年 | 8篇 |
1986年 | 9篇 |
1985年 | 10篇 |
1984年 | 6篇 |
1983年 | 16篇 |
1982年 | 18篇 |
1981年 | 14篇 |
1980年 | 12篇 |
1979年 | 9篇 |
1978年 | 8篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
92.
搜索引擎页面排序算法研究综述* 总被引:3,自引:0,他引:3
系统地分析了现有的页面排序算法,指出了它们各自的优势和存在的不足,并指出不同算法在不同领域和场合所具有的优势。建立专业搜索引擎是提高搜索准确性和性能的有效途径。通过网格技术将各种专业搜索引擎集成在一起,形成一个基于网格的搜索引擎,从而更好地满足不同背景不同偏好的用户需求。 相似文献
93.
94.
采用合理的调度方法可有效提高水电站发电效益。模拟方法容易获取可行解,但不能提供最优解;优化方法能够求得最优解,但往往因搜索空间过大而求解不理想。本文考虑两者特点,提出基于等流量法缩减空间策略的水电站调度方法,即利用等流量法模拟调度过程,缩减搜索空间,在缩减空间内利用优化方法求解模型。实例研究表明:该方法适合群智能算法求解水电站调度模型;在相同群智能算法和水电站调度模型下,缩减搜索空间后,多年平均发电量、保证出力提升显著,多年平均弃水量明显减少。此外,群智能算法在缩减空间内的收敛速度更快,标准差更小。因此,该方法能够有效提高群智能算法求解的优化程度、收敛速度和稳定性,可为水电站调度提供重要参考。 相似文献
95.
96.
《Expert systems with applications》2014,41(2):331-341
Time plays important roles in Web search, because most Web pages contain temporal information and a lot of Web queries are time-related. How to integrate temporal information in Web search engines has been a research focus in recent years. However, traditional search engines have little support in processing temporal-textual Web queries. Aiming at solving this problem, in this paper, we concentrate on the extraction of the focused time for Web pages, which refers to the most appropriate time associated with Web pages, and then we used focused time to improve the search efficiency for time-sensitive queries. In particular, three critical issues are deeply studied in this paper. The first issue is to extract implicit temporal expressions from Web pages. The second one is to determine the focused time among all the extracted temporal information, and the last issue is to integrate focused time into a search engine. For the first issue, we propose a new dynamic approach to resolve the implicit temporal expressions in Web pages. For the second issue, we present a score model to determine the focused time for Web pages. Our score model takes into account both the frequency of temporal information in Web pages and the containment relationship among temporal information. For the third issue, we combine the textual similarity and the temporal similarity between queries and documents in the ranking process. To evaluate the effectiveness and efficiency of the proposed approaches, we build a prototype system called Time-Aware Search Engine (TASE). TASE is able to extract both the explicit and implicit temporal expressions for Web pages, and calculate the relevant score between Web pages and each temporal expression, and re-rank search results based on the temporal-textual relevance between Web pages and queries. Finally, we conduct experiments on real data sets. The results show that our approach has high accuracy in resolving implicit temporal expressions and extracting focused time, and has better ranking effectiveness for time-sensitive Web queries than its competitor algorithms. 相似文献
97.
《Expert systems with applications》2014,41(18):8225-8233
The current web IR system retrieves relevant information only based on the keywords which is inadequate for that vast amount of data. It provides limited capabilities to capture the concepts of the user needs and the relation between the keywords. These limitations lead to the idea of the user conceptual search which includes concepts and meanings. This study deals with the Semantic Based Information Retrieval System for a semantic web search and presented with an improved algorithm to retrieve the information in a more efficient way.This architecture takes as input a list of plain keywords provided by the user and the query is converted into semantic query. This conversion is carried out with the help of the domain concepts of the pre-existing domain ontologies and a third party thesaurus and discover semantic relationship between them in runtime. The relevant information for the semantic query is retrieved and ranked according to the relevancy with the help of an improved algorithm. The performance analysis shows that the proposed system can improve the accuracy and effectiveness for retrieving relevant web documents compared to the existing systems. 相似文献
98.
《Expert systems with applications》2014,41(10):4939-4949
Optimization techniques known as metaheuristics have been applied successfully to solve different problems, in which their development is characterized by the appropriate selection of parameters (values) for its execution. Where the adjustment of a parameter is required, this parameter will be tested until viable results are obtained. Normally, such adjustments are made by the developer deploying the metaheuristic. The quality of the results of a test instance [The term instance is used to refer to the assignment of values to the input variables of a problem.] will not be transferred to the instances that were not tested yet and its feedback may require a slow process of “trial and error” where the algorithm has to be adjusted for a specific application. Within this context of metaheuristics the Reactive Search emerged defending the integration of machine learning within heuristic searches for solving complex optimization problems. Based in the integration that the Reactive Search proposes between machine learning and metaheuristics, emerged the idea of putting Reinforcement Learning, more specifically the Q-learning algorithm with a reactive behavior, to select which local search is the most appropriate in a given time of a search, to succeed another local search that can not improve the current solution in the VNS metaheuristic. In this work we propose a reactive implementation using Reinforcement Learning for the self-tuning of the implemented algorithm, applied to the Symmetric Travelling Salesman Problem. 相似文献
99.
基于MTPM和DPM的多无人机协同广域目标搜索滚动时域决策 总被引:2,自引:0,他引:2
传统的协同搜索决策方法在目标引导和机间协同方面存在不足. 研究建立了基于分布概率预测的目标概率图(Target probability map,TPM)初始化方法和基于贝叶斯准则的目标概率图动态更新方法,形成了修正目标概率图(Modified TPM,MTPM)及其运算机理.考虑对任务子区域进行可控回访,定义了数字信息素图(Digital pheromone map,DPM),建立了数字信息素图使用方法及更新机理.设计了基于MTPM和DPM的寻优指标,建立了基于滚动时域控制的协同搜索决策方法(MTPM-DPM-RHC method,MDR).仿真表明: 1) MTPM能有效降低对目标的虚警率和漏检率;2) DPM能有效实现对任务区域可控回访;3) MDR方法的遍历能力、重访能力和目标搜索效率均优于已有方法. 相似文献
100.
对于基于关键词的图像检索,利用检索结果的视觉相似性学习二分类器有望成为改善检索结果的最有效途径之一. 为改善搜索引擎的搜索结果,本文提出一种算法框架并且基于此框架着重研究训练数据选择这一关键问题. 训练数据选择过程由两个阶段组成:1)训练数据初始化以开始分类器学习过程;2)分类器迭代学习过程中的动态数据选择. 对于初始训练数据的选择,我们探讨了基于聚类和基于排序两种方法,并且对比了自动训练数据选择与人工标注的结果. 对于动态数据选择,我们比较了支持向量机和基于最大最小后验伪概率的贝叶斯分类器的分类效果. 组合上述两个阶段的不同方法,我们得到了8种不同的算法,并将其用于谷歌搜索引擎进行基于关键词的图像检索. 实验结果证明,如何从含有噪声的搜索结果中选择训练数据是搜索结果改善的关键问题. 实验显示我们的方法能够有效的改善谷歌搜索的结果,尤其是排序在前的结果. 尽早为用户提供更相关的结果能够更大程度的减少用户逐个翻页查看结果的工作. 另外,如何使自动训练数据选择与人工标注媲美仍是需要继续研究的一个问题. 相似文献