首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   17874篇
  免费   788篇
  国内免费   16篇
电工技术   243篇
综合类   15篇
化学工业   2352篇
金属工艺   629篇
机械仪表   474篇
建筑科学   158篇
矿业工程   3篇
能源动力   372篇
轻工业   917篇
水利工程   35篇
石油天然气   7篇
武器工业   1篇
无线电   1803篇
一般工业技术   2179篇
冶金工业   630篇
原子能技术   165篇
自动化技术   8695篇
  2024年   11篇
  2023年   134篇
  2022年   196篇
  2021年   330篇
  2020年   231篇
  2019年   232篇
  2018年   315篇
  2017年   337篇
  2016年   406篇
  2015年   355篇
  2014年   666篇
  2013年   802篇
  2012年   1404篇
  2011年   3099篇
  2010年   1677篇
  2009年   1486篇
  2008年   1107篇
  2007年   963篇
  2006年   761篇
  2005年   823篇
  2004年   775篇
  2003年   791篇
  2002年   434篇
  2001年   153篇
  2000年   157篇
  1999年   137篇
  1998年   230篇
  1997年   127篇
  1996年   105篇
  1995年   57篇
  1994年   64篇
  1993年   46篇
  1992年   36篇
  1991年   23篇
  1990年   23篇
  1989年   24篇
  1988年   16篇
  1987年   10篇
  1986年   15篇
  1985年   7篇
  1984年   10篇
  1983年   11篇
  1981年   6篇
  1980年   7篇
  1979年   6篇
  1977年   7篇
  1976年   9篇
  1974年   7篇
  1971年   7篇
  1970年   6篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
This paper presents an iterative spectral framework for pairwise clustering and perceptual grouping. Our model is expressed in terms of two sets of parameters. Firstly, there are cluster memberships which represent the affinity of objects to clusters. Secondly, there is a matrix of link weights for pairs of tokens. We adopt a model in which these two sets of variables are governed by a Bernoulli model. We show how the likelihood function resulting from this model may be maximised with respect to both the elements of link-weight matrix and the cluster membership variables. We establish the link between the maximisation of the log-likelihood function and the eigenvectors of the link-weight matrix. This leads us to an algorithm in which we iteratively update the link-weight matrix by repeatedly refining its modal structure. Each iteration of the algorithm is a three-step process. First, we compute a link-weight matrix for each cluster by taking the outer-product of the vectors of current cluster-membership indicators for that cluster. Second, we extract the leading eigenvector from each modal link-weight matrix. Third, we compute a revised link weight matrix by taking the sum of the outer products of the leading eigenvectors of the modal link-weight matrices.  相似文献   
992.
Motion estimation is one of the kernel issues in MPEG series. In this correspondence, a novel two-phase Hilbert-scan-based search algorithm for block motion estimation is presented. First in the intra-phase, a segmentation of the Hilbert curve is applied to the current block, then a novel coarse-to-fine data structure is developed to eliminate the impossible reference blocks in the search window of the reference frame. In the inter-phase, a new prediction scheme for estimating the initial motion vector of the current block is presented. Experimental results reveal that when compared to the GAPD algorithm, our proposed algorithm has better execution time and estimation accuracy performance. Under the same estimation accuracy, our proposed algorithm has better execution time performance when compared to the FS algorithm. In addition, when comparing with the TSS algorithm, our proposed algorithm has better estimation accuracy performance, but has worse execution time performance.  相似文献   
993.
Tool wear monitoring can be achieved by analyzing the texture of machined surfaces. In this paper, we present the new connectivity oriented fast Hough transform, which easily detects all line segments in binary edge images of textures of machined surfaces. The features extracted from line segments are found to be highly correlated to the level of tool wear. A multilayer perceptron neural network is applied to estimate the flank wear in various machining processes. Our experiments show that this Hough transform based approach is effective in analyzing the quality of machined surfaces and could be used to monitor tool wear. A performance analysis of our Hough transform is also provided.  相似文献   
994.
995.
Many recent tracking algorithms rely on model learning methods. A promising approach consists of modeling the object motion with switching autoregressive models. This article is involved with parametric switching dynamical models governed by an hidden Markov Chain. The maximum likelihood estimation of the parameters of those models is described. The formulas of the EM algorithm are detailed. Moreover, the problem of choosing a good and parsimonious model with BIC criterion is considered. Emphasis is put on choosing a reasonable number of hidden states. Numerical experiments on both simulated and real data sets highlight the ability of this approach to describe properly object motions with sudden changes. The two applications on real data concern object and heart tracking.  相似文献   
996.
997.
An adaptive fuzzy inference neural network (AFINN) is proposed in this paper. It has self-construction ability, parameter estimation ability and rule extraction ability. The structure of AFINN is formed by the following four phases: (1) initial rule creation, (2) selection of important input elements, (3) identification of the network structure and (4) parameter estimation using LMS (least-mean square) algorithm. When the number of input dimension is large, the conventional fuzzy systems often cannot handle the task correctly because the degree of each rule becomes too small. AFINN solves such a problem by modification of the learning and inference algorithm.  相似文献   
998.
Past work on object detection has emphasized the issues of feature extraction and classification, however, relatively less attention has been given to the critical issue of feature selection. The main trend in feature extraction has been representing the data in a lower dimensional space, for example, using principal component analysis (PCA). Without using an effective scheme to select an appropriate set of features in this space, however, these methods rely mostly on powerful classification algorithms to deal with redundant and irrelevant features. In this paper, we argue that feature selection is an important problem in object detection and demonstrate that genetic algorithms (GAs) provide a simple, general, and powerful framework for selecting good subsets of features, leading to improved detection rates. As a case study, we have considered PCA for feature extraction and support vector machines (SVMs) for classification. The goal is searching the PCA space using GAs to select a subset of eigenvectors encoding important information about the target concept of interest. This is in contrast to traditional methods selecting some percentage of the top eigenvectors to represent the target concept, independently of the classification task. We have tested the proposed framework on two challenging applications: vehicle detection and face detection. Our experimental results illustrate significant performance improvements in both cases.  相似文献   
999.
With the fast development of information technology and the global market, collaboration between different functional units in a supply chain becomes one of the most critical factors for global companies to respond to rapid changes in customer needs and increase the efficiency of the whole supply chain. This supply chain environment requires a production-distribution planning system to enable the collaboration between production and distribution units more quickly and orderly. Generally, collaboration in a supply chain needs to resolve conflicts between two decentralised functional units, because each unit tries to locally minimise its own costs, not the overall supply chain costs. Also, there exists incomplete information sharing according to the information privacy of each functional unit. This paper proposes a decentralised production-distribution planning system using collaborative agents that can efficiently mediate the planning gaps between two decentralised planning functions: production and distribution. The validity of collaborative-agent model has been shown using some lemmas and numerical examples.  相似文献   
1000.
Numerical prediction of welding-induced residual stresses using the finite element method has been a common practice in the development or refinement of welded product designs. Various researchers have studied several thermal models associated with the welding process. Among these thermal models, ramp heat input and double-ellipsoid moving source have been investigated. These heat-source models predict the temperature fields and history with or without accuracy. However, these models can predict the thermal characteristics of the welding process that influence the formation of the inherent plastic strains, which ultimately determines the final state of residual stresses in the weldment. The magnitude and distribution of residual stresses are compared. Although the two models predict similar magnitude of the longitudinal stress, the double-ellipsoid moving source model predicts wider tensile stress zones than the other one. And, both the ramp heating and moving source models predict the stress results in reasonable agreement with the experimental data.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号