全文获取类型

收费全文 |
3593篇 |

国内免费 |
1篇 |

完全免费 |
63篇 |

专业分类

自动化技术 |
3657篇 |

出版年

2019年 |
1篇 |

2018年 |
49篇 |

2017年 |
26篇 |

2016年 |
29篇 |

2015年 |
80篇 |

2014年 |
154篇 |

2013年 |
129篇 |

2012年 |
153篇 |

2011年 |
254篇 |

2010年 |
165篇 |

2009年 |
199篇 |

2008年 |
174篇 |

2007年 |
172篇 |

2006年 |
150篇 |

2005年 |
153篇 |

2004年 |
136篇 |

2003年 |
124篇 |

2002年 |
102篇 |

2001年 |
98篇 |

2000年 |
91篇 |

1999年 |
96篇 |

1998年 |
96篇 |

1997年 |
107篇 |

1996年 |
103篇 |

1995年 |
94篇 |

1994年 |
77篇 |

1993年 |
72篇 |

1992年 |
73篇 |

1991年 |
75篇 |

1990年 |
72篇 |

1989年 |
75篇 |

1988年 |
58篇 |

1987年 |
30篇 |

1986年 |
20篇 |

1985年 |
29篇 |

1984年 |
20篇 |

1983年 |
22篇 |

1982年 |
10篇 |

1981年 |
14篇 |

1980年 |
7篇 |

1979年 |
10篇 |

1978年 |
5篇 |

1977年 |
7篇 |

1976年 |
8篇 |

1975年 |
5篇 |

1974年 |
4篇 |

1973年 |
4篇 |

1972年 |
2篇 |

1971年 |
4篇 |

1970年 |
6篇 |

1969年 |
3篇 |

1968年 |
3篇 |

1967年 |
3篇 |

1966年 |
3篇 |

1965年 |
1篇 |

**排序方式：**共有3657条查询结果，搜索用时 31 毫秒

1.

Multichannel texture analysis using localized spatial filters

**总被引：36，自引：0，他引：36** Bovik A.C. Clark M. Geisler W.S. 《Pattern Analysis and Machine Intelligence, IEEE Transactions on》1990,12(1):55-73

A computational approach for analyzing visible textures is described. Textures are modeled as irradiance patterns containing a limited range of spatial frequencies, where mutually distinct textures differ significantly in their dominant characterizing frequencies. By encoding images into multiple narrow spatial frequency and orientation channels, the slowly varying channel envelopes (amplitude and phase) are used to segregate textural regions of different spatial frequency, orientation, or phase characteristics. Thus, an interpretation of image texture as a region code, or carrier of region information, is emphasized. The channel filters used, known as the two-dimensional Gabor functions, are useful for these purposes in several senses: they have tunable orientation and radial frequency bandwidths and tunable center frequencies, and they optimally achieve joint resolution in space and in spatial frequency. By comparing the channel amplitude responses, one can detect boundaries between textures. Locating large variations in the channel phase responses allows discontinuities in the texture phase to be detected. Examples are given of both types of texture processing using a variety of real and synthetic textures 相似文献

2.

Consumer trust in an Internet store

**总被引：28，自引：0，他引：28** Sirkka L. Jarvenpaa Noam Tractinsky Michael Vitale 《Information Technology and Management》2000,1(1-2):45-71

The study reported here raises some questions about the conventional wisdom that the Internet creates a “level playing field”
for large and small retailers and for retailers with and without an established reputation. In our study, consumers recognized
differences in size and reputation among Internet stores, and those differences influenced their assessments of store trustworthiness
and their perception of risk, as well as their willingness to patronize the store. After describing our research methods and
results, we draw some implications for Internet merchants.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献

3.

Multiobjective evolutionary algorithms: analyzing the state-of-the-art

**总被引：27，自引：0，他引：27**Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied during the mid-eighties in an attempt to stochastically solve problems of this generic class. During the past decade, a variety, of multiobjective EA (MOEA) techniques have been proposed and applied to many scientific and engineering applications. Our discussion's intent is to rigorously define multiobjective optimization problems and certain related concepts, present an MOEA classification scheme, and evaluate the variety of contemporary MOEAs. Current MOEA theoretical developments are evaluated; specific topics addressed include fitness functions, Pareto ranking, niching, fitness sharing, mating restriction, and secondary populations. Since the development and application of MOEAs is a dynamic and rapidly growing activity, we focus on key analytical insights based upon critical MOEA evaluation of current research and applications. Recommended MOEA designs are presented, along with conclusions and recommendations for future work. 相似文献

4.

Neural net robot controller with guaranteed tracking performance

**总被引：24，自引：0，他引：24**A neural net (NN) controller for a general serial-link robot arm is developed. The NN has two layers so that linearity in the parameters holds, but the "net functional reconstruction error" and robot disturbance input are taken as nonzero. The structure of the NN controller is derived using a filtered error/passivity approach, leading to new NN passivity properties. Online weight tuning algorithms including a correction term to backpropagation, plus an added robustifying signal, guarantee tracking as well as bounded NN weights. The NN controller structure has an outer tracking loop so that the NN weights are conveniently initialized at zero, with learning occurring online in real-time. It is shown that standard backpropagation, when used for real-time closed-loop control, can yield unbounded NN weights if (1) the net cannot exactly reconstruct a certain required control function or (2) there are bounded unknown disturbances in the robot dynamics. The role of persistency of excitation is explored. 相似文献

5.

Complex systems modeling via fuzzy logic

**总被引：20，自引：0，他引：20** Liang Wang Langari R. 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society》1996,26(1):100-106

This paper presents a fuzzy logic approach to complex systems modeling that is based on fuzzy discretization technique. As compared with other modeling methods (both statistical and fuzzy), the proposed approach has the advantages of simplicity, flexibility, and high accuracy. Further, it is easy to use and may be handled by an automatic procedure. Numerical examples are provided to illustrate the performance of the proposed approach. 相似文献

6.

Invariant image recognition by Zernike moments

**总被引：20，自引：0，他引：20** Khotanzad A. Hong Y.H. 《Pattern Analysis and Machine Intelligence, IEEE Transactions on》1990,12(5):489-497

The problem of rotation-, scale-, and translation-invariant recognition of images is discussed. A set of rotation-invariant features are introduced. They are the magnitudes of a set of orthogonal complex moments of the image known as Zernike moments. Scale and translation invariance are obtained by first normalizing the image with respect to these parameters using its regular geometrical moments. A systematic reconstruction-based method for deciding the highest-order Zernike moments required in a classification problem is developed. The quality of the reconstructed image is examined through its comparison to the original one. The orthogonality property of the Zernike moments, which simplifies the process of image reconstruction, make the suggest feature selection approach practical. Features of each order can also be weighted according to their contribution to the reconstruction process. The superiority of Zernike moment features over regular moments and moment invariants was experimentally verified 相似文献

7.

Concept Decompositions for Large Sparse Text Data Using Clustering

**总被引：20，自引：0，他引：20**Unlabeled document collections are becoming increasingly common and available; mining such data sets represents a major contemporary challenge. Using words as features, text documents are often represented as high-dimensional and sparse vectors–a few thousand dimensions and a sparsity of 95 to 99% is typical. In this paper, we study a certain

*spherical k-means*algorithm for clustering such document vectors. The algorithm outputs*k*disjoint clusters each with a*concept vector*that is the centroid of the cluster normalized to have unit Euclidean norm. As our first contribution, we empirically demonstrate that, owing to the high-dimensionality and sparsity of the text data, the clusters produced by the algorithm have a certain fractal-like and self-similar behavior. As our second contribution, we introduce*concept decompositions*to approximate the matrix of document vectors; these decompositions are obtained by taking the least-squares approximation onto the linear subspace spanned by all the concept vectors. We empirically establish that the approximation errors of the concept decompositions are close to the best possible, namely, to truncated singular value decompositions. As our third contribution, we show that the concept vectors are localized in the word space, are sparse, and tend towards orthonormality. In contrast, the singular vectors are global in the word space and are dense. Nonetheless, we observe the surprising fact that the linear subspaces spanned by the concept vectors and the leading singular vectors are quite close in the sense of small principal angles between them. In conclusion, the concept vectors produced by the spherical*k*-means algorithm constitute a powerful sparse and localized basis for text data sets. 相似文献8.

Proportionate progress: A notion of fairness in resource allocation

**总被引：19，自引：0，他引：19**Given a set of

*n*tasks and*m*resources, where each task*x*has a rational weight*x.w=x.e/x.p,0*<1, a *periodic schedule*is one that allocates a resource to a task

*x*for exactly

*x.e*time units in each interval [

*x.p·k, x.p*·(

*k*+1)) for all

*k*N. We define a notion of proportionate progress, called P-fairness, and use it to design an efficient algorithm which solves the periodic scheduling problem.This research was supported by NSF Research Initiation Award CCR-9111591, and the Texas Advanced Research Program under Grant No. 91-003658-480. 相似文献

*
*

9.

Maulik U. Bandyopadhyay S. 《Pattern Analysis and Machine Intelligence, IEEE Transactions on》2002,24(12):1650-1654

In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four cluster validity indices, namely Davies-Bouldin index, Dunn's index, Calinski-Harabasz index, and a recently developed index I. Based on a relation between the index I and the Dunn's index, a lower bound of the value of the former is theoretically estimated in order to get unique hard K-partition when the data set has distinct substructures. The effectiveness of the different validity indices and clustering methods in automatically evolving the appropriate number of clusters is demonstrated experimentally for both artificial and real-life data sets with the number of clusters varying from two to ten. Once the appropriate number of clusters is determined, the SA-based clustering technique is used for proper partitioning of the data into the said number of clusters. 相似文献

10.

Principal component analysis (PCA) has been widely used for monitoring complex industrial processes with multiple variables and diagnosing process and sensor faults. The objective of this paper is to develop a new subspace identification algorithm that gives consistent model estimates under the errors-in-variables (EIV) situation. In this paper, we propose a new subspace identification approach using principal component analysis. PCA naturally falls into the category of EIV formulation, which resembles total least squares and allows for errors in both process input and output. We propose to use PCA to determine the system observability subspace, the

**A**,**B**,**C**, and**D**matrices and the system order for an EIV formulation. Standard PCA is modified with instrumental variables in order to achieve consistent estimates of the system matrices. The proposed subspace identification method is demonstrated using a simulated process and a real industrial process for model identification and order determination. For comparison the MOESP algorithm and N4SID algorithm are used as benchmarks to demonstrate the advantages of the proposed PCA based subspace model identification (SMI) algorithm. 相似文献