全文获取类型
收费全文 | 29767篇 |
免费 | 4567篇 |
国内免费 | 2818篇 |
专业分类
电工技术 | 2981篇 |
综合类 | 5031篇 |
化学工业 | 2705篇 |
金属工艺 | 2886篇 |
机械仪表 | 1291篇 |
建筑科学 | 1873篇 |
矿业工程 | 2181篇 |
能源动力 | 491篇 |
轻工业 | 2593篇 |
水利工程 | 741篇 |
石油天然气 | 4257篇 |
武器工业 | 208篇 |
无线电 | 2838篇 |
一般工业技术 | 1855篇 |
冶金工业 | 1126篇 |
原子能技术 | 697篇 |
自动化技术 | 3398篇 |
出版年
2023年 | 334篇 |
2022年 | 814篇 |
2021年 | 1027篇 |
2020年 | 1010篇 |
2019年 | 457篇 |
2018年 | 430篇 |
2017年 | 289篇 |
2016年 | 395篇 |
2015年 | 148篇 |
2014年 | 877篇 |
2013年 | 642篇 |
2012年 | 982篇 |
2011年 | 4579篇 |
2010年 | 1984篇 |
2009年 | 1283篇 |
2008年 | 1127篇 |
2007年 | 695篇 |
2006年 | 865篇 |
2005年 | 1132篇 |
2004年 | 4403篇 |
2003年 | 2417篇 |
2002年 | 2017篇 |
2001年 | 1291篇 |
2000年 | 899篇 |
1999年 | 1443篇 |
1998年 | 536篇 |
1997年 | 545篇 |
1996年 | 325篇 |
1995年 | 300篇 |
1994年 | 396篇 |
1993年 | 744篇 |
1992年 | 661篇 |
1991年 | 484篇 |
1990年 | 618篇 |
1989年 | 541篇 |
1988年 | 230篇 |
1987年 | 21篇 |
1986年 | 26篇 |
1985年 | 18篇 |
1984年 | 25篇 |
1983年 | 12篇 |
1982年 | 11篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1977年 | 6篇 |
1972年 | 30篇 |
1971年 | 12篇 |
1969年 | 5篇 |
1966年 | 4篇 |
1963年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 37 毫秒
991.
Fan?XiaEmail authorView authors OrcID profile Chengcheng?Yu Linhao?Xu Weining?Qian Aoying?Zhou 《World Wide Web》2017,20(5):1049-1069
Social media services have already become main sources for monitoring emerging topics and sensing real-life events. A social media platform manages social stream consisting of a huge volume of timestamped user generated data, including original data and repost data. However, previous research on keyword search over social media data mainly emphasizes on the recency of information. In this paper, we first propose a problem of top-k most significant temporal keyword query to enable more complex query analysis. It returns top-k most popular social items that contain the keywords in the given query time window. Then, we design a temporal inverted index with two-tiers posting list to index social time series and a segment store to compute the exact social significance of social items. Next, we implement a basic query algorithm based on our proposed index structure and give a detailed performance analysis on the query algorithm. From the analysis result, we further refine our query algorithm with a piecewise maximum approximation (PMA) sketch. Finally, extensive empirical studies on a real-life microblog dataset demonstrate the combination of two-tiers posting list and PMA sketch achieves remarkable performance improvement under different query settings. 相似文献
992.
Chen?HajajEmail authorView authors OrcID profile Noam?Hazon David?Sarne 《Autonomous Agents and Multi-Agent Systems》2017,31(3):696-714
The plethora of comparison shopping agents (CSAs) in today’s markets enables buyers to query more than a single CSA when shopping, thus expanding the list of sellers whose prices they obtain. This potentially decreases the chance of a purchase within any single interaction between a buyer and a CSA, and consequently decreases each CSAs’ expected revenue per-query. Obviously, a CSA can improve its competence in such settings by acquiring more sellers’ prices, potentially resulting in a more attractive “best price”. In this paper we suggest a complementary approach that improves the attractiveness of the best result returned based on intelligently controlling the order according to which they are presented to the user, in a way that utilizes several known cognitive-biases of human buyers. The advantage of this approach is in its ability to affect the buyer’s tendency to terminate her search for a better price, hence avoid querying further CSAs, without spending valuable resources on finding additional prices to present. The effectiveness of our method is demonstrated using real data, collected from four CSAs for five products. Our experiments confirm that the suggested method effectively influence people in a way that is highly advantageous to the CSA compared to the common method for presenting the prices. Furthermore, we experimentally show that all of the components of our method are essential to its success. 相似文献
993.
Bram?KlievinkEmail authorView authors OrcID profile Bart-Jan?Romijn Scott?Cunningham Hans?de?Bruijn 《Information Systems Frontiers》2017,19(2):267-283
Big data is being implemented with success in the private sector and science. Yet the public sector seems to be falling behind, despite the potential value of big data for government. Government organizations do recognize the opportunities of big data but seem uncertain about whether they are ready for the introduction of big data, and if they are adequately equipped to use big data. This paper addresses those uncertainties. It presents an assessment framework for evaluating public organizations’ big data readiness. Doing so demystifies the concept of big data, as it is expressed in terms of specific and measureable organizational characteristics. The framework was tested by applying it to organizations in the Dutch public sector. The results suggest that organizations may be technically capable of using big data, but they will not significantly gain from these activities if the applications do not fit their organizations and main statutory tasks. The framework proved helpful in pointing out areas where public sector organizations could improve, providing guidance on how government can become more big data ready in the future. 相似文献
994.
Rinde?R.?S.?van?LonEmail authorView authors OrcID profile Tom?Holvoet 《Autonomous Agents and Multi-Agent Systems》2017,31(6):1578-1609
Multi-agent systems (MAS) literature often assumes decentralized MAS to be especially suited for dynamic and large scale problems. In operational research, however, the prevailing paradigm is the use of centralized algorithms. Present paper empirically evaluates whether a multi-agent system can outperform a centralized algorithm in dynamic and large scale logistics problems. This evaluation is novel in three aspects: (1) to ensure fairness both implementations are subject to the same constraints with respect to hardware resources and software limitations, (2) the implementations are systematically evaluated with varying problem properties, and (3) all code is open source, facilitating reproduction and extension of the experiments. Existing work lacks a systematic evaluation of centralized versus decentralized paradigms due to the absence of a real-time logistics simulator with support for both paradigms and a dataset of problem instances with varying properties. We extended an existing logistics simulator to be able to perform real-time experiments and we use a recent dataset of dynamic pickup-and-delivery problem with time windows instances with varying levels of dynamism, urgency, and scale. The OptaPlanner constraint satisfaction solver is used in a centralized way to compute a global schedule and used as part of a decentralized MAS based on the dynamic contract-net protocol (DynCNET) algorithm. The experiments show that the DynCNET MAS finds solutions with a relatively lower operating cost when a problem has all following three properties: medium to high dynamism, high urgency, and medium to large scale. In these circumstances, the centralized algorithm finds solutions with an average cost of 112.3% of the solutions found by the MAS. However, averaged over all scenario types, the average cost of the centralized algorithm is 94.2%. The results indicate that the MAS performs best on very urgent problems that are medium to large scale. 相似文献
995.
当计算机系统长时间运行之后,很多人或许会感觉到系统速度会越来越慢,硬盘剩余空间也越来越小了。特别是一些喜欢下载软件或欣赏视频的用户,常常会感觉到硬盘空间就像是被病毒侵蚀一样不知不觉就被消耗光了。 相似文献
996.
Steve Saltar 《微电脑世界》2013,(11):88-89
很多时候,IT预算只是用来管理并运行企业的基础设施,而不是推动业务创新。不能适应当今迅速变化步伐的老旧系统和应用更加剧了这一问题。这种方式往往会导致企业发展停滞不前,且难以满足不断变化的业务需求。将现代化应用组合进行整合并转换到全新架构将能促进企业发展,能显著提高其敏捷性及创新能力。 相似文献
997.
998.
具有D稳定性约束的T-S模糊系统H∞滤波器设计 总被引:1,自引:0,他引:1
研究一类离散T-S模糊系统的H_∞滤波问题.目的是设计一个滤波器使得滤波误差系统在给定的线性矩阵不等式(LMI)稳定范围内是二次稳定的,且满足指定的H_∞性能.经由模糊Lyapunov函数方法以及增加松弛变量,提出一个滤波器存在的充分条件,它体现为一组线性矩阵不等式(LMIs)可行解的形式.最后通过一个仿真例子验证了所提出的设计方法的有效性. 相似文献
999.
1000.