全文获取类型
收费全文 | 62725篇 |
免费 | 5245篇 |
国内免费 | 2946篇 |
专业分类
电工技术 | 3973篇 |
技术理论 | 3篇 |
综合类 | 4429篇 |
化学工业 | 10286篇 |
金属工艺 | 3665篇 |
机械仪表 | 4124篇 |
建筑科学 | 4959篇 |
矿业工程 | 2031篇 |
能源动力 | 1848篇 |
轻工业 | 4097篇 |
水利工程 | 1151篇 |
石油天然气 | 4170篇 |
武器工业 | 562篇 |
无线电 | 6731篇 |
一般工业技术 | 7445篇 |
冶金工业 | 2848篇 |
原子能技术 | 655篇 |
自动化技术 | 7939篇 |
出版年
2024年 | 286篇 |
2023年 | 1125篇 |
2022年 | 1955篇 |
2021年 | 2677篇 |
2020年 | 2114篇 |
2019年 | 1695篇 |
2018年 | 1886篇 |
2017年 | 2083篇 |
2016年 | 1818篇 |
2015年 | 2484篇 |
2014年 | 3197篇 |
2013年 | 3601篇 |
2012年 | 3977篇 |
2011年 | 4409篇 |
2010年 | 3832篇 |
2009年 | 3615篇 |
2008年 | 3586篇 |
2007年 | 3324篇 |
2006年 | 3365篇 |
2005年 | 2784篇 |
2004年 | 2007篇 |
2003年 | 1768篇 |
2002年 | 1747篇 |
2001年 | 1509篇 |
2000年 | 1371篇 |
1999年 | 1591篇 |
1998年 | 1327篇 |
1997年 | 1147篇 |
1996年 | 1033篇 |
1995年 | 849篇 |
1994年 | 679篇 |
1993年 | 495篇 |
1992年 | 434篇 |
1991年 | 274篇 |
1990年 | 215篇 |
1989年 | 168篇 |
1988年 | 128篇 |
1987年 | 85篇 |
1986年 | 68篇 |
1985年 | 46篇 |
1984年 | 35篇 |
1983年 | 32篇 |
1982年 | 31篇 |
1981年 | 19篇 |
1980年 | 18篇 |
1979年 | 8篇 |
1959年 | 5篇 |
1940年 | 3篇 |
1929年 | 1篇 |
1928年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
971.
Missing data imputation is an important research topic in data mining. The impact of noise is seldom considered in previous
works while real-world data often contain much noise. In this paper, we systematically investigate the impact of noise on
imputation methods and propose a new imputation approach by introducing the mechanism of Group Method of Data Handling (GMDH)
to deal with incomplete data with noise. The performance of four commonly used imputation methods is compared with ours, called
RIBG (robust imputation based on GMDH), on nine benchmark datasets. The experimental result demonstrates that noise has a
great impact on the effectiveness of imputation techniques and our method RIBG is more robust to noise than the other four
imputation methods used as benchmark. 相似文献
972.
Non-negativity matrix factorization (NMF) and its variants have been explored in the last decade and are still attractive due to its ability of extracting non-negative basis images. However, most existing NMF based methods are not ready for encoding higher-order data information. One reason is that they do not directly/explicitly model structured data information during learning, and therefore the extracted basis images may not completely describe the “parts” in an image [1] very well. In order to solve this problem, the structured sparse NMF has been recently proposed in order to learn structured basis images. It however depends on some special prior knowledge, i.e. one needs to exhaustively define a set of structured patterns in advance. In this paper, we wish to perform structured sparsity learning as automatically as possible. To that end, we propose a pixel dispersion penalty (PDP), which effectively describes the spatial dispersion of pixels in an image without using any manually predefined structured patterns as constraints. In PDP, we consider each part-based feature pattern of an image as a cluster of non-zero pixels; that is the non-zero pixels of a local pattern should be spatially close to each other. Furthermore, by incorporating the proposed PDP, we develop a spatial non-negative matrix factorization (Spatial NMF) and a spatial non-negative component analysis (Spatial NCA). In Spatial NCA, the non-negativity constraint is only imposed on basis images and such constraint on coefficients is released, so both subtractive and additive combinations of non-negative basis images are allowed for reconstructing any images. Extensive experiments are conducted to validate the effectiveness of the proposed pixel dispersion penalty. We also experimentally show that Spatial NCA is more flexible for extracting non-negative basis images and obtains better and more stable performance. 相似文献
973.
Rolling-horizon scheduling for energy constrained distributed real-time embedded systems 总被引:1,自引:0,他引:1
Chuan He Xiaomin Zhu Hui Guo Dishan Qiu Jianqing Jiang 《Journal of Systems and Software》2012,85(4):780-794
Energy-efficient scheduling approaches are critical to battery driven real-time embedded systems. Traditional energy-aware scheduling schemes are mainly based on the individual task scheduling. Consequently, the scheduling space for each task is small, and the schedulability and energy saving are very limited, especially when the system is heavily loaded. To remedy this problem, we propose a novel rolling-horizon (RH) strategy that can be applied to any scheduling algorithm to improve schedulability. In addition, we develop a new energy-efficient adaptive scheduling algorithm (EASA) that can adaptively adjust supply voltages according to the system workload for energy efficiency. Both the RH strategy and EASA algorithm are combined to form our scheduling approach, RH-EASA. Experimental results show that in comparison with some typical traditional scheduling schemes, RH-EASA can achieve significant energy savings while meeting most task deadlines (namely, high schedulability) for distributed real-time embedded systems with dynamic workloads. 相似文献
974.
We provide a method for improving the parameterization of patching schemes that approximate Catmull‐Clark subdivision surfaces, such that the new parameterization conforms better to that of the original subdivision surface. We create this reparameterization in real‐time using a method that only depends on the topology of the surface and is independent of the surface's geometry. Our method can handle patches with more than one extraordinary vertex and avoids the combinatorial increase in both complexity and storage associated with multiple extraordinary vertices. Moreover, the reparameterization function is easy to implement and fast. 相似文献
975.
Support vector machine (SVM) was initially designed for binary classification. To extend SVM to the multi-class scenario, a number of classification models were proposed such as the one by Crammer and Singer (2001). However, the number of variables in Crammer and Singer’s dual problem is the product of the number of samples (l) by the number of classes (k), which produces a large computational complexity. This paper presents a simplified multi-class SVM (SimMSVM) that reduces the size of the resulting dual problem from l × k to l by introducing a relaxed classification error bound. The experimental results demonstrate that the proposed SimMSVM approach can greatly speed-up the training process, while maintaining a competitive classification accuracy. 相似文献
976.
This paper presents an overview of the image analysis techniques in the domain of histopathology, specifically, for the objective of automated carcinoma detection and classification. As in other biomedical imaging areas such as radiology, many computer assisted diagnosis (CAD) systems have been implemented to aid histopathologists and clinicians in cancer diagnosis and research, which have been attempted to significantly reduce the labor and subjectivity of traditional manual intervention with histology images. The task of automated histology image analysis is usually not simple due to the unique characteristics of histology imaging, including the variability in image preparation techniques, clinical interpretation protocols, and the complex structures and very large size of the images themselves. In this paper we discuss those characteristics, provide relevant background information about slide preparation and interpretation, and review the application of digital image processing techniques to the field of histology image analysis. In particular, emphasis is given to state-of-the-art image segmentation methods for feature extraction and disease classification. Four major carcinomas of cervix, prostate, breast, and lung are selected to illustrate the functions and capabilities of existing CAD systems. 相似文献
977.
In many applications, the properties of an object being modeled are stored as labels on vertices or edges of a graph. In this paper, we consider succinct representation of labeled graphs. Our main results are the succinct representations of labeled and multi-labeled graphs (we consider planar triangulations, planar graphs and k-page graphs) to support various label queries efficiently. The additional space cost to store the labels is essentially the information-theoretic minimum. As far as we know, our representations are the first succinct representations of labeled graphs. We also have two preliminary results to achieve the main contribution. First, we design a succinct representation of unlabeled planar triangulations to support the rank/select of edges in ccw (counter clockwise) order in addition to the other operations supported in previous work. Second, we design a succinct representation for a k-page graph when k is large to support various navigational operations more efficiently. In particular, we can test the adjacency of two vertices in O(lg?k) time, while previous work uses O(k) time. 相似文献
978.
Pinning a stochastic neural network to the synchronous state 总被引:1,自引:1,他引:0
In this paper, the asymptotic stability of the pinning synchronous solution of stochastic neural networks with and without
time-delays is analyzed. The delays are time-varying, and the uncertainties are norm-bounded that enter into all the parameters
of network and control. The aim of this paper is not only to establish easily verifiable conditions under which the pinning
synchronous solution of stochastic neural network is globally asymptotically stable but also to give a feasible way to offset
the limitation of network itself in order to reach synchronization. In addition, a specific neurobiological network is also
introduced, and some numerical examples are provided to illustrate the applicability of the proposed criteria. 相似文献
979.
The parameter values of kernel function affect classification results to a certain extent. In the paper, a multiclass classification model based on improved least squares support vector machine (LSSVM) is presented. In the model, the non-sensitive loss function is replaced by quadratic loss function, and the inequality constraints are replaced by equality constraints. Consequently, quadratic programming problem is simplified as the problem of solving linear equation groups, and the SVM algorithm is realized by least squares method. When the LSSVM is used in multiclass classification, it is presented to choose parameter of kernel function on dynamic, which enhances preciseness rate of classification. The Fibonacci symmetry searching algorithm is simplified and improved. The changing rule of kernel function searching region and best shortening step is studied. The best multiclass classification results are obtained by means of synthesizing kernel function searching region and best shortening step. The simulation results show the validity of the model. 相似文献
980.
一种基于对应分析的WorldView-2遥感图像融合算法 总被引:1,自引:0,他引:1
文章针对新型WorldView-2遥感图像提出了一种基于对应分析的全色光与多光谱图像融合新算法。该算法利用对应分析将八波段多光谱图像变换至成分空间,然后通过成分图像将全色光图像的空间细节信息注入成分空间,经反变换后得到融合结果。实验结果表明,该算法在融合World-View-2遥感图像时能够在提高空间分辨率和保持光谱信息方面达到较好的平衡,优于现有的几种融合算法。 相似文献