全文获取类型
收费全文 | 10118篇 |
免费 | 1498篇 |
国内免费 | 1242篇 |
专业分类
电工技术 | 791篇 |
综合类 | 906篇 |
化学工业 | 168篇 |
金属工艺 | 106篇 |
机械仪表 | 456篇 |
建筑科学 | 123篇 |
矿业工程 | 77篇 |
能源动力 | 118篇 |
轻工业 | 61篇 |
水利工程 | 80篇 |
石油天然气 | 57篇 |
武器工业 | 119篇 |
无线电 | 1215篇 |
一般工业技术 | 788篇 |
冶金工业 | 335篇 |
原子能技术 | 18篇 |
自动化技术 | 7440篇 |
出版年
2024年 | 98篇 |
2023年 | 191篇 |
2022年 | 312篇 |
2021年 | 317篇 |
2020年 | 366篇 |
2019年 | 348篇 |
2018年 | 324篇 |
2017年 | 468篇 |
2016年 | 494篇 |
2015年 | 598篇 |
2014年 | 722篇 |
2013年 | 855篇 |
2012年 | 807篇 |
2011年 | 868篇 |
2010年 | 650篇 |
2009年 | 734篇 |
2008年 | 786篇 |
2007年 | 735篇 |
2006年 | 601篇 |
2005年 | 491篇 |
2004年 | 390篇 |
2003年 | 303篇 |
2002年 | 256篇 |
2001年 | 219篇 |
2000年 | 178篇 |
1999年 | 108篇 |
1998年 | 95篇 |
1997年 | 92篇 |
1996年 | 63篇 |
1995年 | 58篇 |
1994年 | 43篇 |
1993年 | 43篇 |
1992年 | 35篇 |
1991年 | 29篇 |
1990年 | 18篇 |
1989年 | 24篇 |
1988年 | 17篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 9篇 |
1984年 | 6篇 |
1983年 | 11篇 |
1982年 | 14篇 |
1981年 | 11篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
42.
《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. 相似文献
43.
《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. 相似文献
44.
《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. 相似文献
45.
《Expert systems with applications》2014,41(6):2957-2963
In this paper, we consider interactive fuzzy programming for multi-level 0–1 programming problems involving random variable coefficients both in objective functions and constraints. Following the probability maximization model together with the concept of chance constraints, the formulated stochastic multi-level 0–1 programming problems are transformed into deterministic ones. Taking into account vagueness of judgments of the decision makers, we present interactive fuzzy programming. In the proposed interactive method, after determining the fuzzy goals of the decision makers at all levels, a satisfactory solution is derived efficiently by updating satisfactory levels of the decision makers with considerations of overall satisfactory balance among all levels. For solving the transformed deterministic problems efficiently, we also introduce novel tabu search for general 0–1 programming problems. A numerical example for a three-level 0–1 programming problem is provided to illustrate the proposed method. 相似文献
46.
Career visual searchers such as radiologists and airport security screeners strive to conduct accurate visual searches, but despite extensive training, errors still occur. A key difference between searches in radiology and airport security is the structure of the search task: Radiologists typically scan a certain number of medical images (fixed objective), and airport security screeners typically search X-rays for a specified time period (fixed duration). Might these structural differences affect accuracy? We compared performance on a search task administered either under constraints that approximated radiology or airport security. Some displays contained more than one target because the presence of multiple targets is an established source of errors for career searchers, and accuracy for additional targets tends to be especially sensitive to contextual conditions. Results indicate that participants searching within the fixed objective framework produced more multiple-target search errors; thus, adopting a fixed duration framework could improve accuracy for career searchers. 相似文献
47.
《Expert systems with applications》2014,41(14):6483-6493
Besides being a hard combinatorial problem, the VRP is also a spatial problem. Hence, effective decision making in this field strongly requires the integration of GIS and optimization systems (GIS-O). This article integrates GIS and optimization tools for solving the vehicle routing problem with loading and distance requirements (DCVRP). A general outline of the multi-step integration is pointed out showing the interaction of the GIS and the spatial optimization according to the loose coupling strategy. The computational performance of the TS-VRP algorithm for the DCVRP turned out to be quite efficient on both computation time and solution quality. The Tunisian case study well illustrates the incentive behind using such a spatial decision support system that allows the management of the problem from the data acquisition to the visualization of possible simulation scenarios in a more realistic way. 相似文献
48.
《Expert systems with applications》2014,41(13):5788-5803
In this paper, an improved global-best harmony search algorithm, named IGHS, is proposed. In the IGHS algorithm, initialization based on opposition-based learning for improving the solution quality of the initial harmony memory, a new improvisation scheme based on differential evolution for enhancing the local search ability, a modified random consideration based on artificial bee colony algorithm for reducing randomness of the global-best harmony search (GHS) algorithm, as well as two perturbation schemes for avoiding premature convergence, are integrated. In addition, two parameters of IGHS, harmony memory consideration rate and pitch adjusting rate, are dynamically updated based on a composite function composed of a linear time-varying function, a periodic function and a sign function in view of approximate periodicity of evolution in nature. Experimental results tested on twenty-eight benchmark functions indicate that IGHS is far better than basic harmony search (HS) algorithm and GHS. In further study, IGHS has also been compared with other eight well known metaheuristics. The results show that IGHS is better than or at least similar to those approaches on most of test functions. 相似文献
49.
基于先验知识的自适应多叉树防碰撞算法 总被引:1,自引:0,他引:1
为提高无线射频识别(RFID)系统快速识别大量标签的能力,提出一种基于先验知识的自适应多叉树防碰撞算法。利用标签访问的规律性和标签分布的随机性,在不同的搜索深度,根据已有的先验知识和碰撞比特信息估计待识别的标签数量,从而动态地自适应选择搜索叉树。通过有效减少碰撞和空闲时隙数,大幅提高读写器搜索和识别标签的能力。理论分析与仿真实验结果表明,该算法能克服传统自适应多叉树防碰撞算法的缺点,合理选择初始搜索叉树,尤其在待识别标签数量较多的场合,可有效提高RFID系统的吞吐率。 相似文献
50.
针对中文组合范畴语法(CCG)分析困难的特点,研究如何将两种彼此相互独立的技术共同应用在中文CCG句法分析上。首先使用预标注算法,使用对数线性模型通过去除那些概率较低的词汇范畴来对句子的潜在分析空间进行剪枝。然后应用启发式搜索算法进一步加速分析过程。最后从时间效率和分析精度两个维度对所使用的方法进行验证。实验表明,基于启发式搜索与预标注的句法分析算法可以显著地提高分析效率与分析精度。 相似文献