全文获取类型
收费全文 | 13240篇 |
免费 | 2043篇 |
国内免费 | 1371篇 |
专业分类
电工技术 | 1264篇 |
综合类 | 1799篇 |
化学工业 | 407篇 |
金属工艺 | 188篇 |
机械仪表 | 811篇 |
建筑科学 | 756篇 |
矿业工程 | 317篇 |
能源动力 | 355篇 |
轻工业 | 308篇 |
水利工程 | 405篇 |
石油天然气 | 218篇 |
武器工业 | 142篇 |
无线电 | 1130篇 |
一般工业技术 | 782篇 |
冶金工业 | 286篇 |
原子能技术 | 40篇 |
自动化技术 | 7446篇 |
出版年
2024年 | 42篇 |
2023年 | 130篇 |
2022年 | 218篇 |
2021年 | 296篇 |
2020年 | 391篇 |
2019年 | 365篇 |
2018年 | 354篇 |
2017年 | 433篇 |
2016年 | 514篇 |
2015年 | 604篇 |
2014年 | 854篇 |
2013年 | 859篇 |
2012年 | 1011篇 |
2011年 | 1146篇 |
2010年 | 957篇 |
2009年 | 975篇 |
2008年 | 1087篇 |
2007年 | 1114篇 |
2006年 | 969篇 |
2005年 | 825篇 |
2004年 | 636篇 |
2003年 | 558篇 |
2002年 | 412篇 |
2001年 | 337篇 |
2000年 | 282篇 |
1999年 | 213篇 |
1998年 | 150篇 |
1997年 | 145篇 |
1996年 | 131篇 |
1995年 | 125篇 |
1994年 | 92篇 |
1993年 | 61篇 |
1992年 | 64篇 |
1991年 | 56篇 |
1990年 | 48篇 |
1989年 | 43篇 |
1988年 | 36篇 |
1987年 | 20篇 |
1986年 | 9篇 |
1985年 | 10篇 |
1984年 | 7篇 |
1983年 | 12篇 |
1982年 | 5篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1976年 | 4篇 |
1963年 | 7篇 |
1961年 | 8篇 |
1960年 | 4篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
提出了一种重叠细胞检测的新方法,该方法针对细胞图像处理中因细胞重叠而引起的过分割与欠分割现象这一难点,引入基于Mumford-Shah模型的水平集方法得到细胞的初始轮廓,采用EP(erosion-propagation)和PL主曲线相结合的图像分析方法得到目标的精确轮廓线。使用基于目标形状的图像配准方法和基于目标轮廓的分段特征分类器完成重叠细胞的检测。应用该方法对600张随机抽取的细胞图像中9374个细胞进行检测,实验正确率为91.83%,结果表明该方法能够有效地判断细胞是否重叠和重叠类型,为后续分割工作提供依据。 相似文献
92.
在粗糙集理论中,精度是量化由粗糙集边界引起的不精确性的一种重要数字特征,但传统精度没有考虑到由关系覆盖导出的颗粒大小。本文通过引入独立邻域集的概念,给出一种新的广义粗糙集精度的度量。 相似文献
93.
连通支配集在无线传感器网络中有着重要的作用,通过对连通支配集的深入分析得到了关于连通支配集的一个新特性,即最小连通支配集是图的一棵包含最多叶子节点的生成树中的非叶子节点的集合。根据这个结论设计了一种全新的连通支配集求解算法,即通过建立一棵含叶子节点较多的生成树来寻找一个较小的连通支配集。仿真实验表明,新算法较前人的算法有明显的改进。 相似文献
94.
95.
By introducing the rough set theory into the support vector machine (SVM), a rough margin based SVM (RMSVM) is proposed to deal with the overfitting problem due to outliers. Similar to the classical SVM, the RMSVM searches for the separating hyper-plane that maximizes the rough margin, defined by the lower and upper margin. In this way, more data points are adaptively considered rather than the few extreme value points used in the classical SVM. In addition, different support vectors may have different effects on the learning of the separating hyper-plane depending on their positions in the rough margin. Points in the lower margin have more effects than those in the boundary of the rough margin. From experimental results on six benchmark datasets, the classification accuracy of this algorithm is improved without additional computational expense compared with the classical ν-SVM. 相似文献
96.
Mathieu Liedloff 《Information Processing Letters》2008,107(5):154-157
Finding a dominating set of minimum cardinality is an NP-hard graph problem, even when the graph is bipartite. In this paper we are interested in solving the problem on graphs having a large independent set. Given a graph G with an independent set of size z, we show that the problem can be solved in time O∗(2n−z), where n is the number of vertices of G. As a consequence, our algorithm is able to solve the dominating set problem on bipartite graphs in time O∗(2n/2). Another implication is an algorithm for general graphs whose running time is O(n1.7088). 相似文献
97.
Xiang Zhou 《Information Processing Letters》2008,108(1):3-9
In this article, with Ehrenfeucht-Fraïssé games we prove that Δ1≠Δ0 on BFR, which implies Δ≠Δ0 on BFR, and thus solve an open problem raised by Albert Atserias in his dissertation (Δ0,Δ1,Δ are fragments of first order logic and BFR is a class of finite sets which in essence is equivalent to a class of finite pure arithmetic structures with built-in BIT predicate). 相似文献
98.
An instance of the path hitting problem consists of two families of paths,
and ℋ, in a common undirected graph, where each path in ℋ is associated with a non-negative cost. We refer to
and ℋ as the sets of demand and hitting paths, respectively. When p∈ℋ and
share at least one mutual edge, we say that p
hits q. The objective is to find a minimum cost subset of ℋ whose members collectively hit those of
. In this paper we provide constant factor approximation algorithms for path hitting, confined to instances in which the underlying
graph is a tree, a spider, or a star. Although such restricted settings may appear to be very simple, we demonstrate that
they still capture some of the most basic covering problems in graphs. Our approach combines several novel ideas: We extend
the algorithm of Garg, Vazirani and Yannakakis (Algorithmica, 18:3–20, 1997) for approximate multicuts and multicommodity flows in trees to prove new integrality properties; we present a reduction
that involves multiple calls to this extended algorithm; and we introduce a polynomial-time solvable variant of the edge cover
problem, which may be of independent interest.
An extended abstract of this paper appeared in Proceedings of the 14th Annual European Symposium on Algorithms, 2006.
This work is part of D. Segev’s Ph.D. thesis prepared at Tel-Aviv University under the supervision of Prof. Refael Hassin. 相似文献
99.
In this paper, a class of non-autonomous reaction-diffusion neural networks with time-varying delays is considered. Novel methods to study the global dynamical behavior of these systems are proposed. Employing the properties of diffusion operator and the method of delayed inequalities analysis, we investigate global exponential stability, positive invariant sets and global attracting sets of the neural networks under consideration. Furthermore, conditions sufficient for the existence and uniqueness of periodic attractors for periodic neural networks are derived and the existence range of the attractors is estimated. Finally two examples are given to demonstrate the effectiveness of these results. 相似文献
100.
Classification of Fuzzy Mathematical Morphologies Based on Concepts of Inclusion Measure and Duality
Mathematical morphology was originally conceived as a set theoretic approach for the processing of binary images. Extensions
of classical binary morphology to gray-scale morphology include approaches based on fuzzy set theory. This paper discusses
and compares several well-known and new approaches towards gray-scale and fuzzy mathematical morphology. We show in particular
that a certain approach to fuzzy mathematical morphology ultimately depends on the choice of a fuzzy inclusion measure and
on a notion of duality. This fact gives rise to a clearly defined scheme for classifying fuzzy mathematical morphologies.
The umbra and the level set approach, an extension of the threshold approach to gray-scale mathematical morphology, can also
be embedded in this scheme since they can be identified with certain fuzzy approaches.
相似文献
Marcos Eduardo ValleEmail: |