全文获取类型
收费全文 | 11953篇 |
免费 | 131篇 |
国内免费 | 164篇 |
专业分类
电工技术 | 155篇 |
综合类 | 15篇 |
化学工业 | 623篇 |
金属工艺 | 464篇 |
机械仪表 | 122篇 |
建筑科学 | 128篇 |
矿业工程 | 4篇 |
能源动力 | 155篇 |
轻工业 | 184篇 |
水利工程 | 66篇 |
石油天然气 | 40篇 |
武器工业 | 2篇 |
无线电 | 523篇 |
一般工业技术 | 518篇 |
冶金工业 | 149篇 |
原子能技术 | 100篇 |
自动化技术 | 9000篇 |
出版年
2024年 | 5篇 |
2023年 | 45篇 |
2022年 | 85篇 |
2021年 | 135篇 |
2020年 | 95篇 |
2019年 | 133篇 |
2018年 | 141篇 |
2017年 | 99篇 |
2016年 | 115篇 |
2015年 | 64篇 |
2014年 | 300篇 |
2013年 | 333篇 |
2012年 | 854篇 |
2011年 | 3201篇 |
2010年 | 1218篇 |
2009年 | 1087篇 |
2008年 | 748篇 |
2007年 | 633篇 |
2006年 | 487篇 |
2005年 | 595篇 |
2004年 | 542篇 |
2003年 | 596篇 |
2002年 | 285篇 |
2001年 | 22篇 |
2000年 | 14篇 |
1999年 | 28篇 |
1998年 | 100篇 |
1997年 | 37篇 |
1996年 | 25篇 |
1995年 | 18篇 |
1994年 | 15篇 |
1993年 | 7篇 |
1992年 | 12篇 |
1991年 | 8篇 |
1990年 | 13篇 |
1989年 | 13篇 |
1988年 | 13篇 |
1987年 | 13篇 |
1986年 | 22篇 |
1985年 | 13篇 |
1984年 | 30篇 |
1983年 | 13篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
The vortex-induced vibration of a flexible circular cylinder is investigated at a constant Reynolds number of 1 000.The finite-volume method on moving meshes is applied for the fluid flow, and the Euler-Bernoulli beam theory is used to model the dynamic response of a flexible cylinder.The relationship between the reduced velocity and the amplitude response agrees well with the experimental results.Moreover, five different vibrating modes appear in the simulation.From the comparisons of their vortex structures, the strength of the wake flow is related to the exciting vibrating mode and different vortex patterns arise for different vibrating modes.Only 2P pattern appears in the first vibrating mode while 2S-2P patterns occur in the other vibrating modes if monitoring at different sections along the length of the cylinder.The vibration of the flexible cylinder can also greatly alter the three-dimensionality in the wake, which needs further studies in our future work, especially in the transition region for the Reynolds number from 170 to 300. 相似文献
102.
This paper deals with the problem of forbidden states in safe Petri nets to obtain a maximally permissive controller. To prevent the system from entering the forbidden states, assigning some constraints to them is possible. The constraints can be enforced on the system using control places. When the number of forbidden states is large, a large number of constraints should be assigned to them. This results in a large number of control places being added to the model of the system, which causes a complicated model. Some methods have been proposed to reduce the number of constraints. Nevertheless, they do not always give the best results. In this paper, two ideas are offered to reduce the number of constraints, giving a more simplified controller. 相似文献
103.
An effective dual watermark scheme for image tamper detection and recovery is proposed in this paper. In our algorithm, each block in the image contains watermark of other two blocks. That is to say, there are two copies of watermark for each non-overlapping block in the image. Therefore, we maintain two copies of watermark of the whole image and provide second chance for block recovery in case one copy is destroyed. A secret key, which is transmitted along with the watermarked image, and a public chaotic mixing algorithm are used to extract the watermark for tamper recovery. By using our algorithm, a 90% tampered image can be recovered to a dim yet still recognizable condition (PSNR ). Experimental results demonstrate that our algorithm is superior to the compared techniques, especially when the tampered area is large. 相似文献
104.
Hugo Zanghi Author Vitae Christophe Ambroise Author Vitae 《Pattern recognition》2008,41(12):3592-3599
In the context of graph clustering, we consider the problem of simultaneously estimating both the partition of the graph nodes and the parameters of an underlying mixture of affiliation networks. In numerous applications the rapid increase of data size over time makes classical clustering algorithms too slow because of the high computational cost. In such situations online clustering algorithms are an efficient alternative to classical batch algorithms. We present an original online algorithm for graph clustering based on a Erd?s-Rényi graph mixture. The relevance of the algorithm is illustrated, using both simulated and real data sets. The real data set is a network extracted from the French political blogosphere and presents an interesting community organization. 相似文献
105.
Aleix M. Martinez Author Vitae Onur C. Hamsici Author Vitae 《Pattern recognition》2008,41(11):3436-3441
Many problems in paleontology reduce to finding those features that best discriminate among a set of classes. A clear example is the classification of new specimens. However, these classifications are generally challenging because the number of discriminant features and the number of samples are limited. This has been the fate of LB1, a new specimen found in the Liang Bua Cave of Flores. Several authors have attributed LB1 to a new species of Homo, H. floresiensis. According to this hypothesis, LB1 is either a member of the early Homo group or a descendent of an ancestor of the Asian H. erectus. Detractors have put forward an alternate hypothesis, which stipulates that LB1 is in fact a microcephalic modern human. In this paper, we show how we can employ a new Bayes optimal discriminant feature extraction technique to help resolve this type of issues. In this process, we present three types of experiments. First, we use this Bayes optimal discriminant technique to develop a model of morphological (shape) evolution from Australopiths to H. sapiens. LB1 fits perfectly in this model as a member of the early Homo group. Second, we build a classifier based on the available cranial and mandibular data appropriately normalized for size and volume. Again, LB1 is most similar to early Homo. Third, we build a brain endocast classifier to show that LB1 is not within the normal range of variation in H. sapiens. These results combined support the hypothesis of a very early shared ancestor for LB1 and H. erectus, and illustrate how discriminant analysis approaches can be successfully used to help classify newly discovered specimens. 相似文献
106.
This paper presents a new extension of Gaussian mixture models (GMMs) based on type-2 fuzzy sets (T2 FSs) referred to as T2 FGMMs. The estimated parameters of the GMM may not accurately reflect the underlying distributions of the observations because of insufficient and noisy data in real-world problems. By three-dimensional membership functions of T2 FSs, T2 FGMMs use footprint of uncertainty (FOU) as well as interval secondary membership functions to handle GMMs uncertain mean vector or uncertain covariance matrix, and thus GMMs parameters vary anywhere in an interval with uniform possibilities. As a result, the likelihood of the T2 FGMM becomes an interval rather than a precise real number to account for GMMs uncertainty. These interval likelihoods are then processed by the generalized linear model (GLM) for classification decision-making. In this paper we focus on the role of the FOU in pattern classification. Multi-category classification on different data sets from UCI repository shows that T2 FGMMs are consistently as good as or better than GMMs in case of insufficient training data, and are also insensitive to different areas of the FOU. Based on T2 FGMMs, we extend hidden Markov models (HMMs) to type-2 fuzzy HMMs (T2 FHMMs). Phoneme classification in the babble noise shows that T2 FHMMs outperform classical HMMs in terms of the robustness and classification rate. We also find that the larger area of the FOU in T2 FHMMs with uncertain mean vectors performs better in classification when the signal-to-noise ratio is lower. 相似文献
107.
Brais Martinez Author Vitae Author Vitae 《Pattern recognition》2008,41(12):3682-3691
Since the multiple kernel representation opened in tracking the possibility of representing several features of the target in the same model, tracking multiple features using kernel-based methods has received a great attention. In spite of these efforts, the formulation has been reduced to tracking planar targets or targets rotating inside a plane parallel to the image plane. The aim of this paper is to extend the multi-kernel tracking to cope with situations different to those. To this end, we consider the triangular mesh described by the centers of the kernels and we develop the estimation of a set of affine transforms, one at each mesh triangle, subject to the constraints that each affine transform of a triangle must be compatible with the affine transforms coming from contiguous triangles. The method is applied to sequences including face and car tracking. Results show an outperformance respect to previous kernel tracking methods, which generally work with a too restricted set of movements. 相似文献
108.
109.
In this paper, we investigate the applicability of graph cuts to the SFS (shape-from-shading) problem. We propose a new semi-global method for SFS using graph cuts. The new algorithm combines the local method proposed by Lee and Rosenfeld [C.H. Lee, A. Rosenfeld, Improved methods of estimating shape from shading using the light source coordinate system, Artif. Intell. 26 (1985) 125-143] and a global method using an energy minimization technique. By employing a new global energy minimization formulation, the convex/concave ambiguity problem of Lee and Rosenfeld's method can be resolved efficiently. A new combinatorial optimization technique, the graph cuts method, is used for the minimization of the proposed energy functional. Experimental results on a variety of synthetic and real-world images show that the proposed algorithm reconstructs the 3-D shape of objects very efficiently. 相似文献
110.
Hamidreza Rashidy Kanan Author Vitae 《Pattern recognition》2008,41(12):3799-3812
Though numerous approaches have been proposed for face recognition, little attention is given to the moment-based face recognition techniques. In this paper we propose a novel face recognition approach based on adaptively weighted patch pseudo Zernike moment array (AWPPZMA) when only one exemplar image per person is available. In this approach, a face image is represented as an array of patch pseudo Zernike moments (PPZM) extracted from a partitioned face image containing moment information of local areas instead of global information of a face. An adaptively weighting scheme is used to assign proper weights to each PPZM to adjust the contribution of each local area of a face in terms of the quantity of identity information that a patch contains and the likelihood of a patch is occluded. An extensive experimental investigation is conducted using AR and Yale face databases covering face recognition under controlled/ideal conditions, different illumination conditions, different facial expressions and partial occlusion. The system performance is compared with the performance of four benchmark approaches. The encouraging experimental results demonstrate that moments can be used for face recognition and patch-based moment array provides a novel way for face representation and recognition in single model databases. 相似文献