全文获取类型
收费全文 | 31328篇 |
免费 | 3127篇 |
国内免费 | 2511篇 |
专业分类
电工技术 | 1670篇 |
技术理论 | 1篇 |
综合类 | 2574篇 |
化学工业 | 636篇 |
金属工艺 | 526篇 |
机械仪表 | 2199篇 |
建筑科学 | 1232篇 |
矿业工程 | 567篇 |
能源动力 | 566篇 |
轻工业 | 401篇 |
水利工程 | 466篇 |
石油天然气 | 394篇 |
武器工业 | 347篇 |
无线电 | 3528篇 |
一般工业技术 | 1534篇 |
冶金工业 | 559篇 |
原子能技术 | 297篇 |
自动化技术 | 19469篇 |
出版年
2024年 | 78篇 |
2023年 | 313篇 |
2022年 | 468篇 |
2021年 | 635篇 |
2020年 | 751篇 |
2019年 | 638篇 |
2018年 | 671篇 |
2017年 | 813篇 |
2016年 | 1005篇 |
2015年 | 1110篇 |
2014年 | 1820篇 |
2013年 | 1702篇 |
2012年 | 2038篇 |
2011年 | 2477篇 |
2010年 | 1826篇 |
2009年 | 1896篇 |
2008年 | 2203篇 |
2007年 | 2491篇 |
2006年 | 2250篇 |
2005年 | 2082篇 |
2004年 | 1766篇 |
2003年 | 1625篇 |
2002年 | 1191篇 |
2001年 | 907篇 |
2000年 | 756篇 |
1999年 | 615篇 |
1998年 | 449篇 |
1997年 | 364篇 |
1996年 | 353篇 |
1995年 | 318篇 |
1994年 | 222篇 |
1993年 | 168篇 |
1992年 | 129篇 |
1991年 | 112篇 |
1990年 | 100篇 |
1989年 | 89篇 |
1988年 | 78篇 |
1987年 | 51篇 |
1986年 | 42篇 |
1985年 | 47篇 |
1984年 | 45篇 |
1983年 | 38篇 |
1982年 | 27篇 |
1981年 | 33篇 |
1980年 | 21篇 |
1979年 | 16篇 |
1978年 | 19篇 |
1977年 | 18篇 |
1976年 | 35篇 |
1975年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
992.
Generalized additive models (GAMs) are a generalization of generalized linear models (GLMs) and constitute a powerful technique which has successfully proven its ability to capture nonlinear relationships between explanatory variables and a response variable in many domains. In this paper, GAMs are proposed as base classifiers for ensemble learning. Three alternative ensemble strategies for binary classification using GAMs as base classifiers are proposed: (i) GAMbag based on Bagging, (ii) GAMrsm based on the Random Subspace Method (RSM), and (iii) GAMens as a combination of both. In an experimental validation performed on 12 data sets from the UCI repository, the proposed algorithms are benchmarked to a single GAM and to decision tree based ensemble classifiers (i.e. RSM, Bagging, Random Forest, and the recently proposed Rotation Forest). From the results a number of conclusions can be drawn. Firstly, the use of an ensemble of GAMs instead of a single GAM always leads to improved prediction performance. Secondly, GAMrsm and GAMens perform comparably, while both versions outperform GAMbag. Finally, the value of using GAMs as base classifiers in an ensemble instead of standard decision trees is demonstrated. GAMbag demonstrates performance comparable to ordinary Bagging. Moreover, GAMrsm and GAMens outperform RSM and Bagging, while these two GAM ensemble variations perform comparably to Random Forest and Rotation Forest. Sensitivity analyses are included for the number of member classifiers in the ensemble, the number of variables included in a random feature subspace and the number of degrees of freedom for GAM spline estimation. 相似文献
993.
Constantinos Marios Angelopoulos Author Vitae Sotiris Nikoletseas Author Vitae 《Journal of Systems and Software》2010,83(12):2471-2477
We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Motivated by relevant applications, we focus on dynamic sensory mobility and heterogeneous sensor placement. Our approach basically suggests to exploit the sensor motion to adaptively propagate information based on local conditions (such as high placement concentrations), so that the sink gradually “learns” the network and accordingly optimizes its motion. Compared to relevant solutions in the state of the art (such as the blind random walk, biased walks, and even optimized deterministic sink mobility), our method significantly reduces latency (the improvement ranges from 40% for uniform placements, to 800% for heterogeneous ones), while also improving the success rate and keeping the energy dissipation at very satisfactory levels. 相似文献
994.
Lin-huang Chang Author Vitae Chun-hui Sung Author Vitae Author Vitae Yen-wen Lin Author Vitae 《Journal of Systems and Software》2010,83(12):2536-2555
In this paper we design and implement the pseudo session initiation protocol (p-SIP) server embedded in each mobile node to provide the ad-hoc voice over Internet protocol (VoIP) services. The implemented p-SIP server, being compatible with common VoIP user agents, integrates the standard SIP protocol with SIP presence to handle SIP signaling and discovery mechanism in the ad-hoc VoIP networks. The ad-hoc VoIP signaling and voice traffic performances are analyzed using E-model R rating value for up to six hops in the implemented test-bed. We also conduct the interference experiments to imitate the practical ad-hoc VoIP environment. The analyzed results demonstrate the realization of ad-hoc VoIP services by using p-SIP server. 相似文献
995.
Demons非刚性配准算法拓扑保持性的研究 总被引:5,自引:0,他引:5
在基于配准的图像分割应用中, 拓扑保持性是非刚性图像配准算法的一个重要约束. 本文从矢量场特性出发, 分析了Demons非刚性图像配准算法导致目标拓扑改变时变形场的特点. 根据变形场特点与其雅可比行列式之间的关系, 给出了校正该算法拓扑保持性的方法. 实验表明, 改进后的变形场具有了拓扑保持性. 相似文献
996.
图的可达性查询被广泛应用于生物网络、社会网络、本体网络、RDF网络等.由于对数据操作时引入的噪声和错误使这些图数据具有不确定性,而确定图的可达查询不能有效地处理不确定性,因此该文研究用概率语义描述的图可达性查询.具体的,该文使用可能世界概率模型定义不确定图(称为概率图),基于该模型,研究了基于阈值的概率可达查询(T-PR).首先为避免枚举所有可能世界,给出一个基本算法可精确求解T-PR查询.其次为进一步加速基本算法,给出3种改进方法,它们是不确定事件界、同构图的缩减、基于不相交路径和割集的界.通过合理的组合给出3种方法的合并算法.最后基于真实概率图数据的大量实验验证了该文的设计. 相似文献
997.
Active contours with selective local or global segmentation: A new formulation and level set method 总被引:4,自引:0,他引:4
A novel region-based active contour model (ACM) is proposed in this paper. It is implemented with a special processing named Selective Binary and Gaussian Filtering RegularizedLevel Set(SBGFRLS) method, which first selectively penalizes the level set function to be binary, and then uses a Gaussian smoothing kernel to regularize it. The advantages of our method are as follows. First, a new region-based signed pressure force (SPF) function is proposed, which can efficiently stop the contours at weak or blurred edges. Second, the exterior and interior boundaries can be automatically detected with the initial contour being anywhere in the image. Third, the proposed ACM with SBGFRLS has the property of selective local or global segmentation. It can segment not only the desired object but also the other objects. Fourth, the level set function can be easily initialized with a binary function, which is more efficient to construct than the widely used signed distance function (SDF). The computational cost for traditional re-initialization can also be reduced. Finally, the proposed algorithm can be efficiently implemented by the simple finite difference scheme. Experiments on synthetic and real images demonstrate the advantages of the proposed method over geodesic active contours (GAC) and Chan–Vese (C–V) active contours in terms of both efficiency and accuracy. 相似文献
998.
Tomi A. Pasanen 《Theoretical computer science》2010,411(43):3867-3872
We consider random binary search trees when the input consists of a multiset, i.e. a set with multiple occurrences of equal elements, and prove that the randomized insertion and deletion algorithms given by Martínez and Roura (1998) [4] produce random search trees regardless of multiplicities; even if all the elements are equal during the tree updates, a search tree will maintain its randomness. Thus, equal elements do not degenerate a random search tree and they need not to be handled in any special way. We consider also stability of a search tree with respect to its inorder traversal and prove that the algorithms used produce stable trees. This implies an implicit indexing of equal elements giving another proof that multiplicities do not pose problems when maintaining random binary search trees. 相似文献
999.
A theory of one-tape two-way one-head off-line linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) that halt in linear time, where the running time of a machine is defined as the length of any longest computation path. We explore structural properties of one-tape linear-time Turing machines and clarify how the machines’ resources affect their computational patterns and power. 相似文献
1000.
In this paper, we proposed an efficient algorithm, called PCP-Miner (Pointset Closed Pattern Miner), for mining frequent closed patterns from a pointset database, where a pointset contains a set of points. Our proposed algorithm consists of two phases. First, we find all frequent patterns of length two in the database. Second, for each pattern found in the first phase, we recursively generate frequent closed patterns by a frequent pattern tree in a depth-first search manner. Since the PCP-Miner does not generate unnecessary candidates, it is more efficient and scalable than the modified Apriori, SASMiner and MaxGeo. The experimental results show that the PCP-Miner algorithm outperforms the comparing algorithms by more than one order of magnitude. 相似文献