首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3879篇
  免费   200篇
  国内免费   21篇
工业技术   4100篇
  2024年   16篇
  2023年   128篇
  2022年   245篇
  2021年   297篇
  2020年   200篇
  2019年   204篇
  2018年   243篇
  2017年   185篇
  2016年   198篇
  2015年   124篇
  2014年   160篇
  2013年   309篇
  2012年   202篇
  2011年   232篇
  2010年   165篇
  2009年   181篇
  2008年   126篇
  2007年   91篇
  2006年   100篇
  2005年   91篇
  2004年   61篇
  2003年   45篇
  2002年   46篇
  2001年   40篇
  2000年   33篇
  1999年   33篇
  1998年   47篇
  1997年   25篇
  1996年   27篇
  1995年   21篇
  1994年   23篇
  1993年   26篇
  1992年   19篇
  1991年   8篇
  1990年   11篇
  1989年   18篇
  1988年   16篇
  1987年   8篇
  1986年   11篇
  1985年   11篇
  1984年   7篇
  1983年   8篇
  1982年   6篇
  1981年   9篇
  1980年   6篇
  1979年   5篇
  1978年   9篇
  1977年   5篇
  1976年   8篇
  1974年   4篇
排序方式: 共有4100条查询结果,搜索用时 0 毫秒
61.
Clustering algorithms generally accept a parameter k from the user, which determines the number of clusters sought. However, in many application domains, like document categorization, social network clustering, and frequent pattern summarization, the proper value of k is difficult to guess. An alternative clustering formulation that does not require k is to impose a lower bound on the similarity between an object and its corresponding cluster representative. Such a formulation chooses exactly one representative for every cluster and minimizes the representative count. It has many additional benefits. For instance, it supports overlapping clusters in a natural way. Moreover, for every cluster, it selects a representative object, which can be effectively used in summarization or semi-supervised classification task. In this work, we propose an algorithm, SimClus, for clustering with lower bound on similarity. It achieves a O(log n) approximation bound on the number of clusters, whereas for the best previous algorithm the bound can be as poor as O(n). Experiments on real and synthetic data sets show that our algorithm produces more than 40% fewer representative objects, yet offers the same or better clustering quality. We also propose a dynamic variant of the algorithm, which can be effectively used in an on-line setting.  相似文献   
62.
This paper proposes a generalized least absolute deviation (GLAD) method for parameter estimation of autoregressive (AR) signals under non-Gaussian noise environments. The proposed GLAD method can improve the accuracy of the estimation of the conventional least absolute deviation (LAD) method by minimizing a new cost function with parameter variables and noise error variables. Compared with second- and high-order statistical methods, the proposed GLAD method can obtain robustly an optimal AR parameter estimation without requiring the measurement noise to be Gaussian. Moreover, the proposed GLAD method can be implemented by a cooperative neural network (NN) which is shown to converge globally to the optimal AR parameter estimation within a finite time. Simulation results show that the proposed GLAD method can obtain more accurate estimates than several well-known estimation methods in the presence of different noise distributions.  相似文献   
63.
In this paper, we present the computational tools and a hardware prototype for 3D face recognition. Full automation is provided through the use of advanced multistage alignment algorithms, resilience to facial expressions by employing a deformable model framework, and invariance to 3D capture devices through suitable preprocessing steps. In addition, scalability in both time and space is achieved by converting 3D facial scans into compact metadata. We present our results on the largest known, and now publicly available, face recognition grand challenge 3D facial database consisting of several thousand scans. To the best of our knowledge, this is the highest performance reported on the FRGC v2 database for the 3D modality  相似文献   
64.
This article proposes several two-timescale simulation-based actor-critic algorithms for solution of infinite horizon Markov Decision Processes with finite state-space under the average cost criterion. Two of the algorithms are for the compact (non-discrete) action setting while the rest are for finite-action spaces. On the slower timescale, all the algorithms perform a gradient search over corresponding policy spaces using two different Simultaneous Perturbation Stochastic Approximation (SPSA) gradient estimates. On the faster timescale, the differential cost function corresponding to a given stationary policy is updated and an additional averaging is performed for enhanced performance. A proof of convergence to a locally optimal policy is presented. Next, we discuss a memory efficient implementation that uses a feature-based representation of the state-space and performs TD(0) learning along the faster timescale. The TD(0) algorithm does not follow an on-line sampling of states but is observed to do well on our setting. Numerical experiments on a problem of rate based flow control are presented using the proposed algorithms. We consider here the model of a single bottleneck node in the continuous time queueing framework. We show performance comparisons of our algorithms with the two-timescale actor-critic algorithms of Konda and Borkar (1999) and Bhatnagar and Kumar (2004). Our algorithms exhibit more than an order of magnitude better performance over those of Konda and Borkar (1999).
Shalabh Bhatnagar (Corresponding author)Email:
  相似文献   
65.
Relaxation labeling processes are a class of iterative algorithms for using contextual information to reduce local ambiguities. This paper introduces a new perspective toward relaxation-that of considering it as a process for reordering labels attached to nodes in a graph. This new perspective is used to establish the formal equivalence between relaxation and another widely used algorithm, local maxima selection. The equivalence specifies conditions under which a family of cooperative relaxation algorithms, which generalize the well-known ones, decompose into purely local ones. Since these conditions are also sufficient for guaranteeing the convergence of relaxation processes, they serve as stopping criteria. We feel that equivalences such as these are necessary for the proper application of relaxation and maxima selection in complex speech and vision understanding systems.  相似文献   
66.
The generation of scientific information for improved understating of the physical dynamics of a lake is fundamental for guiding lake stakeholders and managers at the local level to implement best management practices and help design effective management strategies and policies at higher levels. Multitemporal bathymetric information on lakes is very important in hydrology and sediment studies to more clearly indicate environmental changes and to understand the effects of land processes on the hydrology of lakes. Accordingly, the purpose of this study was to map bathymetric charts of Lake Hayq 1 in Ethiopia and to derive morphometric parameters, including depth, volume, area, width and length, and to plot curves illustrating the relationships between these parameters. The bathymetric survey was carried out using a combination of a SonarLite Portable Echo Sounder and Global Positioning System (GPS) to generate three‐dimensional (XYZ) hydrographic data. Surfer 8.01 and ArcGIS 9.3 software program were used for surface, gridding and morphometric analyses. Comparison of the results of this study with a previous study conducted in 1941 indicated the lake has experienced changes in depth and surface area. To reduce the negative impacts of human‐induced activities on the ecohydrology of the lake, and to maintain its ecological integrity, appropriate and integrated lake management practices must be adopted. This will necessitate policy formulation, active lake basin stakeholder involvement and implementation of basin‐wide lake management to ensure sustainable use of the lake and its basin resources.  相似文献   
67.
This paper presents an analytical approach which combines the modified shear-lag model and Monte Carlo simulation technique to simulate the tensile failure process of unidirectional T700 carbon reinforced composite. Two kinds of matrix were investigated in the present paper, one is neat epoxy and the other one is SiC nano-particle filled epoxy. In the model, the strength of the fiber elements is randomly allocated by the Monte Carlo method, the elastic properties of the matrix elements and the friction after the interfaces breakage are definitely allocated. Using this model, the deformation, damage and failure process of the composite are simulated on the microscopic level, the tensile stress–strain relationship is well predicted. The relationship between mechanical properties of the fiber, matrix and composites was discussed. The analysis also shows that, compared with the neat system, nano-phased composite exhibits 10% improvement in tensile strength, which agrees with the experimental data.  相似文献   
68.
Slag samples, hot‐metal samples and hot‐metal temperatures were obtained during tapping of two blast furnaces. Sampling was carried out at different time points during tapping of three separate heats. The size distribution and composition of metal droplets found in the slag were determined using scanning electron microscopy. Only metal droplets above 0.75 μm could be counted and analysed. All droplets were below 8 μm in diameter and the great majority of these droplets were found to be between 0.75 and 2 μm. The size distribution did not differ significantly for different slag samples. Iron was the main droplet component. Electron probe microanalysis showed that the droplets contained small amounts of carbon. The percentage of the area in a studied cross‐section that was covered with metal droplets varied between 0.01 and 0.07%. Calculations based on Stoke's law showed that the distance droplets travel in the slag is in the micron range. Slag samples taken in the beginning of slag tapping contained more droplets than those taken in the middle of slag tapping, an indication that most droplets can be found in the area near the furnace wall. Some droplets were determined to have magnesium enrichment at the external surface.  相似文献   
69.
A numerical simulation of the aircraft impact into the exterior columns of the World Trade Center (WTC) was done using LS-DYNA. For simplification, the fuselage was modeled as a thin-walled cylinder, the wings were modeled as box beams with a fuel pocket, and the engines were represented as rigid cylinders. The exterior columns of the WTC were represented as box beams. Actual masses, material properties and dimensions of the Boeing 767 aircraft and the exterior columns of the WTC were used in this analysis. It was found that about 46% of the initial kinetic energy of the aircraft was used to damage columns. The minimum impact velocity of the aircraft to just penetrate the exterior columns would be 130?m/s. It was also found that a Boeing 767 traveling at top speed would not penetrate exterior columns of the WTC if the columns were thicker than 20?mm.  相似文献   
70.
In this paper, a new method is proposed for coupling digital bandpass filtering with independent component regression (ICR) to improve the quality of the raw absorbance spectra in quantitative NIR spectroscopy. The proposed model, referred to as SDICR, is based on a subband decomposition independent component analysis (SDICA) model coupled with ICR regression. The SDICA is used to select the optimal parameters of the digital bandpass filter and to determine the most independent subcomponents of the original sources, so the standard ICA methods can be used. The efficiency of the proposed model is validated using mixtures composed of glucose, urea and triacetin in a phosphate buffer solution in a non-controlled environment. The proposed model decreases the standard error of prediction (SEP) from 29.1 mg/dL for ICR to only 18.6547 mg/dL using 10 subbands.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号