全文获取类型
收费全文 | 149726篇 |
免费 | 6676篇 |
国内免费 | 3320篇 |
专业分类
电工技术 | 4633篇 |
技术理论 | 10篇 |
综合类 | 6733篇 |
化学工业 | 22541篇 |
金属工艺 | 8247篇 |
机械仪表 | 6835篇 |
建筑科学 | 7423篇 |
矿业工程 | 2344篇 |
能源动力 | 2982篇 |
轻工业 | 8708篇 |
水利工程 | 2529篇 |
石油天然气 | 3916篇 |
武器工业 | 526篇 |
无线电 | 17217篇 |
一般工业技术 | 24364篇 |
冶金工业 | 5849篇 |
原子能技术 | 965篇 |
自动化技术 | 33900篇 |
出版年
2024年 | 247篇 |
2023年 | 1112篇 |
2022年 | 1953篇 |
2021年 | 2826篇 |
2020年 | 2192篇 |
2019年 | 1740篇 |
2018年 | 16115篇 |
2017年 | 15181篇 |
2016年 | 11779篇 |
2015年 | 3201篇 |
2014年 | 3519篇 |
2013年 | 4046篇 |
2012年 | 7372篇 |
2011年 | 13920篇 |
2010年 | 12010篇 |
2009年 | 9131篇 |
2008年 | 10327篇 |
2007年 | 11092篇 |
2006年 | 3382篇 |
2005年 | 4043篇 |
2004年 | 3241篇 |
2003年 | 3035篇 |
2002年 | 2251篇 |
2001年 | 1638篇 |
2000年 | 1861篇 |
1999年 | 2044篇 |
1998年 | 1748篇 |
1997年 | 1411篇 |
1996年 | 1413篇 |
1995年 | 1147篇 |
1994年 | 1002篇 |
1993年 | 700篇 |
1992年 | 549篇 |
1991年 | 410篇 |
1990年 | 335篇 |
1989年 | 300篇 |
1988年 | 224篇 |
1987年 | 144篇 |
1986年 | 104篇 |
1985年 | 76篇 |
1984年 | 55篇 |
1983年 | 41篇 |
1982年 | 49篇 |
1968年 | 45篇 |
1966年 | 44篇 |
1965年 | 48篇 |
1958年 | 38篇 |
1957年 | 36篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 109 毫秒
991.
992.
SimRank has become an important similarity measure to rank web documents based on a graph model on hyperlinks. The existing
approaches for conducting SimRank computation adopt an iteration paradigm. The most efficient deterministic technique yields
O(n3)O\left(n^3\right) worst-case time per iteration with the space requirement O(n2)O\left(n^2\right), where n is the number of nodes (web documents). In this paper, we propose novel optimization techniques such that each iteration
takes O (min{ n ·m , nr })O \left(\min \left\{ n \cdot m , n^r \right\}\right) time and O ( n + m )O \left( n + m \right) space, where m is the number of edges in a web-graph model and r ≤ log2 7. In addition, we extend the similarity transition matrix to prevent random surfers getting stuck, and devise a pruning
technique to eliminate impractical similarities for each iteration. Moreover, we also develop a reordering technique combined
with an over-relaxation method, not only speeding up the convergence rate of the existing techniques, but achieving I/O efficiency
as well. We conduct extensive experiments on both synthetic and real data sets to demonstrate the efficiency and effectiveness
of our iteration techniques. 相似文献
993.
Wei-Lan Suo Bo Feng Zhi-Ping Fan 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(3):471-483
The decision making trial and evaluation laboratory (DEMATEL) method is a useful tool for analyzing correlations among factors
using crisp values. However, the crisp values are inadequate to model real-life situations due to the fuzziness and uncertainty
that are frequently involved in judgments of experts. The aim of this paper is to extend the DEMATEL method to an uncertain
linguistic environment. In this paper, the correlation information among factors provided by experts is in the form of uncertain
linguistic terms. A formula is first presented to transform correlation information from uncertain linguistic terms to trapezoidal
fuzzy numbers. Then, we aggregate the transformed correlation information of each expert into group information using the
operations of trapezoidal fuzzy numbers. The importance and classification of factors are determined via fuzzy matrix operations.
Furthermore, a causal diagram is constructed to vividly show the different roles of factors. Finally, an example is used to
illustrate the procedure of the proposed method. 相似文献
994.
In this paper, we propose a multi-agent learning system for the control of an intelligent robot, based on a model of the human
consciousnesses, including the ego. We pay attention to the intelligent learning processes of human beings. We try to give
a robot a high learning ability by modeling the roles of the human consciousnesses, including the ego. In most ordinary methods,
the instructions for learning are given from outside the system only. In the proposed method, the instructions are given not
only from outside, but also from inside (from other agents in the system). Therefore, the robot can learn efficiently because
it has more instructions than usual. The learning is also more flexible, since an agent learns by instructions from other
agents while the learning agent and one of the instructing agents exchange roles according to changes in the environment.
We experimentally verified that the proposed method is efficient by using an actual robot. 相似文献
995.
Most face recognition systems employ 2-D color or gray-scale images. However, face recognition based on 2-D images is adversely
affected by 3-D movement, variable lighting, and the use of cosmetics. 3-D image measurement technology has the potential
to overcome these limitations of face recognition based on 2-D images since it can perform geometric analysis. We propose
a method that is capable of recognizing a person from a 3-D facial image obtained using a 3-D shape measurement system by
employing a technique that optimizes the intensity-modulation pattern projection. This face recognition method is based on
the iterative closest point algorithm. It is robust to changes in reflectivity and color. Since the 3-D facial information
can be registered, this method can estimate rotations and translations to compensate for different positions or directions.
In order to prove the validity of the proposed technique, a verification experiment was conducted which used 105 sample 3-D
images obtained from 15 subjects. It achieved a detection rate of 96% when heads were turned at an angle of 20° or less relative
to the camera. 相似文献
996.
997.
Tae Hyon Kim Kiyohiro Goto Hiroki Igarashi Kazuyuki Kon Noritaka Sato Fumitoshi Matsuno 《Artificial Life and Robotics》2012,16(4):514-518
Recently, many research projects and competitions have attempted to find an autonomous mobile robot that can drive in the
real world. In this article, we consider a path-planning method for an autonomous mobile robot that would be safe in a real
environment. In such a case, it is very important for the robot to be able to identify its own position and orientation in
real time. Therefore, we applied a localization method based on a particle filter. Moreover, in order to improve the safety
of such autonomous locomotion, we improved the path-planning algorithm and the generation of the trajectory so that it can
consider a region with a limited maximum velocity. In order to demonstrate the validity of the proposed method, we participated
in the Real World Robot Challenge 2010. The experimental results are given. 相似文献
998.
A simple and elegant tracking algorithm called Centroid Iteration algorithm is proposed. It employs a new Background-Weighted
similarity measure which can greatly reduce the influence from the pixels shared by the target template and background on
localization. Experiments demonstrated the Background-Weighted measure performs much better than the other similarity measures
like Kullback–Leibler divergence, Bhattacharyya coefficient and so on. It has been proved that this measure can compute the
similarity value contribution of each pixel in the target candidate, based on which, a new target search method called Centroid
Iteration is constructed. The convergence of the method has been demonstrated. Theory analysis and visual experiments both
validated the new algorithm. 相似文献
999.
Ekrem Savaş 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(4):591-595
Quite recently, Sava? (Appl Math Lett 21:134–141, 2008), defined the lacunary statistical analogue for double sequence \(X=\{X_{k,l}\}\) of fuzzy numbers as follows: a double sequence \(X=\{X_{k,l}\}\) is said to be lacunary P-statistically convergent to \(X_{0}\) provided that for each \(\epsilon >0\) In this paper we introduce and study double lacunary \(\sigma\)-statistical convergence for sequence of fuzzy numbers and also we get some inclusion theorems.
相似文献
$ P-\lim_{r,s}\frac{1}{h_{r,s}}\left | \{(k,l)\in I_{r,s}: d(X_{k,l },X_0)\geq \epsilon\}\right|= 0. $
1000.
A K-nearest neighbours method based on imprecise probabilities 总被引:1,自引:1,他引:0
Sebastien Destercke 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(5):833-844
K-nearest neighbours algorithms are among the most popular existing classification methods, due to their simplicity and good
performances. Over the years, several extensions of the initial method have been proposed. In this paper, we propose a K-nearest
neighbours approach that uses the theory of imprecise probabilities, and more specifically lower previsions. We show that
the proposed approach has several assets: it can handle uncertain data in a very generic way, and decision rules developed
within this theory allow us to deal with conflicting information between neighbours or with the absence of close neighbour
to the instance to classify. We show that results of the basic k-NN and weighted k-NN methods can be retrieved by the proposed approach. We end with some experiments on the classical data sets. 相似文献