全文获取类型
收费全文 | 10371篇 |
免费 | 1661篇 |
国内免费 | 1407篇 |
专业分类
电工技术 | 645篇 |
综合类 | 1307篇 |
化学工业 | 443篇 |
金属工艺 | 223篇 |
机械仪表 | 318篇 |
建筑科学 | 1237篇 |
矿业工程 | 330篇 |
能源动力 | 259篇 |
轻工业 | 295篇 |
水利工程 | 802篇 |
石油天然气 | 555篇 |
武器工业 | 62篇 |
无线电 | 1086篇 |
一般工业技术 | 571篇 |
冶金工业 | 196篇 |
原子能技术 | 86篇 |
自动化技术 | 5024篇 |
出版年
2024年 | 45篇 |
2023年 | 139篇 |
2022年 | 273篇 |
2021年 | 291篇 |
2020年 | 353篇 |
2019年 | 298篇 |
2018年 | 323篇 |
2017年 | 411篇 |
2016年 | 409篇 |
2015年 | 553篇 |
2014年 | 767篇 |
2013年 | 679篇 |
2012年 | 876篇 |
2011年 | 939篇 |
2010年 | 693篇 |
2009年 | 754篇 |
2008年 | 822篇 |
2007年 | 788篇 |
2006年 | 650篇 |
2005年 | 581篇 |
2004年 | 491篇 |
2003年 | 392篇 |
2002年 | 311篇 |
2001年 | 290篇 |
2000年 | 240篇 |
1999年 | 168篇 |
1998年 | 157篇 |
1997年 | 121篇 |
1996年 | 100篇 |
1995年 | 101篇 |
1994年 | 91篇 |
1993年 | 58篇 |
1992年 | 56篇 |
1991年 | 47篇 |
1990年 | 35篇 |
1989年 | 34篇 |
1988年 | 21篇 |
1987年 | 11篇 |
1986年 | 18篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1975年 | 3篇 |
1961年 | 1篇 |
1959年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 7 毫秒
101.
Jef Wijsen 《Information Processing Letters》2010,110(21):950-85
A natural way for capturing uncertainty in the relational data model is by allowing relations that violate their primary key. A repair of such relation is obtained by selecting a maximal number of tuples without ever selecting two tuples that agree on their primary key. Given a Boolean query q, CERTAINTY(q) is the problem that takes as input a relational database and asks whether q evaluates to true on every repair of that database. In recent years, CERTAINTY(q) has been studied primarily for conjunctive queries. Conditions have been determined under which CERTAINTY(q) is coNP-complete, first-order expressible, or not first-order expressible. A remaining open question was whether there exist conjunctive queries q without self-join such that CERTAINTY(q) is in PTIME but not first-order expressible. We answer this question affirmatively. 相似文献
102.
Given a set D of trajectories, a query object q, and a query time extent Γ, a mutual (i.e., symmetric) nearest neighbor (MNN) query over trajectories finds from D, the set of trajectories that are among the k1 nearest neighbors (NNs) of q within Γ, and meanwhile, have q as one of their k2 NNs. This type of queries is useful in many applications such as decision making, data mining, and pattern recognition, as it considers both the proximity of the trajectories to q and the proximity of q to the trajectories. In this paper, we first formalize MNN search and identify its characteristics, and then develop several algorithms for processing MNN queries efficiently. In particular, we investigate two classes of MNN queries, i.e., MNNP and MNNT queries, which are defined with respect to stationary query points and moving query trajectories, respectively. Our methods utilize the batch processing and reusing technology to reduce the I/O cost (i.e., number of node/page accesses) and CPU time significantly. In addition, we extend our techniques to tackle historical continuous MNN (HCMNN) search for moving object trajectories, which returns the mutual nearest neighbors of q (for a specified k1 and k2) at any time instance of Γ. Extensive experiments with real and synthetic datasets demonstrate the performance of our proposed algorithms in terms of efficiency and scalability. 相似文献
103.
视频交通事件检测与处理技术在智能交通领域中的应用研究已在学术界和工业界引起了广泛关注。作为视频交通事件检测技术的基础,车辆检测也已成为研究热点。该文主要研究在车辆检测过程中出现的车辆检测不完整,特征信息提取不完全等情况,研究利用LBP算子进行区域生长方法,使得不完整的车辆区域按照LBP纹理方向扩展,从而获得较完整的车辆目标。实验结果表明该算法能够有效进行区域生长,检测车辆的完整度有较大提高。 相似文献
104.
在防灾项目中,给决策者提供精确的地质地理背景信息,使其随时查询各个地理信息要素是格外必要的,所以项目中的空间数据查询系统发挥着至关重要的作用;该项目中利用AECENGINE9.2的强大嵌入功能和良好的可操作性,基于visual studio 2005.NET使其功能在防灾项目中发挥出来,在地震地质和基础地理两大类中可详尽的查询出地壳等厚线、深断裂构造、遥感地质构造解译图等信息。 相似文献
105.
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. 相似文献
106.
传感器网络中多近似连续范围查询的处理技术 总被引:1,自引:0,他引:1
无线传感器网络为数据库研究开辟了新的研究领域,高效利用节点的有限能量是当前研究的主要目标.如果发布到网络中多个近似连续范围查询不经优化处理而独立执行,会造成节点为不同查询重复发送相同感知数据,从而降低网络寿命.针对近似连续范围查询研究了多查询优化技术,设计了一种索引多维范围查询的多叉树结构rq-kd-tree,通过获取多查询的公共查询部分(查询相交区域)以及基于查询相似度合并相交区域上的多个查询、重写查询.最后,实验证明了所提的算法可以实现能量有效的多查询处理过程. 相似文献
107.
108.
109.
二维直方图θ-划分最大平均离差阈值分割算法 总被引:2,自引:0,他引:2
鉴于常用二维直方图区域直分法存在错分, 最近提出的斜分法不具普遍性, 而基于L1范数的最小一乘准则比最小二乘准则更为合理且简捷, 提出了适用面更广的基于二维直方图θ-划分和最大类间平均离差的图像阈值分割算法. 首先给出了二维直方图θ-划分方法, 采用4条平行斜线及1条其法线与灰度级轴成 θ 角的直线划分二维直方图区域, 按灰度级和邻域平均灰度级的加权和进行阈值分割, 斜分法可视为该方法中θ=45° 的特例; 然后导出了二维直方图θ-划分最大类间平均离差阈值选取公式及其快速递推算法; 最后给出了θ 取不同值时的分割结果及运行时间. θ 取较小值时, 边界形状准确性较高, θ 取较大值时, 抗噪性较强, 应用时可根据实际图像特点及需求合理选取 θ 的值. 与常规二维直方图直分最大类间方差法及最大类间平均离差法相比, 所需运行时间相近, 但本文提出的方法所得分割结果更为准确, 抵抗噪声更为稳健, 且存储空间也大为减少. 相似文献
110.
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. 相似文献