全文获取类型
收费全文 | 2838篇 |
免费 | 514篇 |
国内免费 | 539篇 |
专业分类
电工技术 | 58篇 |
综合类 | 279篇 |
化学工业 | 12篇 |
金属工艺 | 10篇 |
机械仪表 | 67篇 |
建筑科学 | 30篇 |
矿业工程 | 29篇 |
能源动力 | 6篇 |
轻工业 | 30篇 |
水利工程 | 14篇 |
石油天然气 | 13篇 |
武器工业 | 8篇 |
无线电 | 296篇 |
一般工业技术 | 47篇 |
冶金工业 | 27篇 |
原子能技术 | 4篇 |
自动化技术 | 2961篇 |
出版年
2024年 | 15篇 |
2023年 | 43篇 |
2022年 | 71篇 |
2021年 | 60篇 |
2020年 | 82篇 |
2019年 | 60篇 |
2018年 | 71篇 |
2017年 | 105篇 |
2016年 | 99篇 |
2015年 | 162篇 |
2014年 | 212篇 |
2013年 | 154篇 |
2012年 | 235篇 |
2011年 | 270篇 |
2010年 | 234篇 |
2009年 | 234篇 |
2008年 | 271篇 |
2007年 | 250篇 |
2006年 | 187篇 |
2005年 | 172篇 |
2004年 | 185篇 |
2003年 | 117篇 |
2002年 | 108篇 |
2001年 | 97篇 |
2000年 | 76篇 |
1999年 | 47篇 |
1998年 | 53篇 |
1997年 | 46篇 |
1996年 | 24篇 |
1995年 | 26篇 |
1994年 | 30篇 |
1993年 | 25篇 |
1992年 | 11篇 |
1991年 | 11篇 |
1990年 | 5篇 |
1989年 | 7篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 2篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有3891条查询结果,搜索用时 0 毫秒
91.
潘国荣 《数字社区&智能家居》2011,(12)
Ajax是一种新兴的Web表示层技术,它能够成功实现无刷新页面和数据的异步交互。该文介绍了Ajax技术的工作原理,在JSP页面中使用Ajax技术实现模糊查询的方法。 相似文献
92.
There are many advanced techniques that can efficiently mine frequent itemsets using a minimum-support. However, the question that remains unanswered is whether the minimum-support can really help decision makers to make decisions. In this paper, we study four summary queries for frequent itemsets mining, namely, (1) finding a support-average of itemsets, (2) finding a support-quantile of itemsets, (3) finding the number of itemsets that greater/less than the support-average, i.e., an approximated distribution of itemsets, and (4) finding the relative frequency of an itemset (compared its frequency with that of other itemsets in the same dataset). With these queries, a decision maker will know whether an itemset in question is greater/less than the support-quantile; the distribution of itemsets; and the frequentness of an itemset. Processing these summary queries is challenging, because the minimum-support constraint cannot be used to prune infrequent itemsets. In this paper, we propose several simple yet effective approximation solutions. We conduct extensive experiments for evaluating our strategy, and illustrate that the proposed approaches can well model and capture the statistical parameters (summary queries) of itemsets in a database. 相似文献
93.
传感器网络中多近似连续范围查询的处理技术 总被引:1,自引:0,他引:1
无线传感器网络为数据库研究开辟了新的研究领域,高效利用节点的有限能量是当前研究的主要目标.如果发布到网络中多个近似连续范围查询不经优化处理而独立执行,会造成节点为不同查询重复发送相同感知数据,从而降低网络寿命.针对近似连续范围查询研究了多查询优化技术,设计了一种索引多维范围查询的多叉树结构rq-kd-tree,通过获取多查询的公共查询部分(查询相交区域)以及基于查询相似度合并相交区域上的多个查询、重写查询.最后,实验证明了所提的算法可以实现能量有效的多查询处理过程. 相似文献
94.
95.
96.
97.
基于加权的本体相似度计算方法 总被引:1,自引:0,他引:1
为优化基于本体的语义推理效果,提出了对本体中概念结点赋予权重的相似度计算方法.通过定义本体树中深度因子和密度因子,以解决本体中概念深度与密度对相似度计算的影响.利用Jena API、Lucene等开源工具包,提出了查询扩展方法.实验结果表明,提出的基于加权语义相似度计算模型与传统的计算法方法以及主观判断的方法相比,提高了相似度计算的准确性,效率有明显提高. 相似文献
98.
In this paper, we introduce a concept of Annotation Based Query Answer, and a method for its computation, which can answer queries on relational databases that may violate a set of functional dependencies. In this approach, inconsistency is viewed as a property of data and described with annotations. To be more precise, every piece of data in a relation can have zero or more annotations with it and annotations are propagated along with queries from the source to the output. With annotations, inconsistent da... 相似文献
99.
Searching XML data with a structured XML query can improve the precision of results compared with a keyword search. However, the structural heterogeneity of the large number of XML data sources makes it difficult to answer the structured query exactly. As such, query relaxation is necessary. Previous work on XML query relaxation poses the problem of unnecessary computation of a big number of unqualified relaxed queries. To address this issue, we propose an adaptive relaxation approach which relaxes a query against different data sources differently based on their conformed schemas. In this paper, we present a set of techniques that supports this approach, which includes schema-aware relaxation rules for relaxing a query adaptively, a weighted model for ranking relaxed queries, and algorithms for adaptive relaxation of a query and top-k query processing. We discuss results from a comprehensive set of experiments that show the effectiveness and the efficiency of our approach. 相似文献
100.
Beomseok Nam Minho Shin Henrique Andrade Alan Sussman 《Journal of Parallel and Distributed Computing》2010
In distributed query processing systems, load balancing plays an important role in maximizing system throughput. When queries can leverage cached intermediate results, improving the cache hit ratio becomes as important as load balancing in query scheduling, especially when dealing with computationally expensive queries. The scheduling policies must be designed to take into consideration the dynamic contents of the distributed caching infrastructure. In this paper, we propose and discuss several distributed query scheduling policies that directly consider the available cache contents by employing distributed multidimensional indexing structures and an exponential moving average approach to predicting cache contents. These approaches are shown to produce better query plans and faster query response times than traditional scheduling policies that do not predict dynamic contents in distributed caches. We experimentally demonstrate the utility of the scheduling policies using MQO, which is a distributed, Grid-enabled, multiple query processing middleware system we developed to optimize query processing for data analysis and visualization applications. 相似文献