全文获取类型
收费全文 | 5374篇 |
免费 | 369篇 |
国内免费 | 274篇 |
专业分类
电工技术 | 229篇 |
综合类 | 795篇 |
化学工业 | 244篇 |
金属工艺 | 43篇 |
机械仪表 | 173篇 |
建筑科学 | 243篇 |
矿业工程 | 29篇 |
能源动力 | 102篇 |
轻工业 | 263篇 |
水利工程 | 85篇 |
石油天然气 | 35篇 |
武器工业 | 13篇 |
无线电 | 553篇 |
一般工业技术 | 760篇 |
冶金工业 | 181篇 |
原子能技术 | 50篇 |
自动化技术 | 2219篇 |
出版年
2024年 | 9篇 |
2023年 | 50篇 |
2022年 | 57篇 |
2021年 | 74篇 |
2020年 | 110篇 |
2019年 | 113篇 |
2018年 | 115篇 |
2017年 | 128篇 |
2016年 | 150篇 |
2015年 | 151篇 |
2014年 | 248篇 |
2013年 | 408篇 |
2012年 | 324篇 |
2011年 | 385篇 |
2010年 | 267篇 |
2009年 | 324篇 |
2008年 | 324篇 |
2007年 | 320篇 |
2006年 | 292篇 |
2005年 | 243篇 |
2004年 | 233篇 |
2003年 | 203篇 |
2002年 | 203篇 |
2001年 | 146篇 |
2000年 | 148篇 |
1999年 | 124篇 |
1998年 | 127篇 |
1997年 | 106篇 |
1996年 | 95篇 |
1995年 | 87篇 |
1994年 | 68篇 |
1993年 | 61篇 |
1992年 | 44篇 |
1991年 | 37篇 |
1990年 | 35篇 |
1989年 | 34篇 |
1988年 | 23篇 |
1987年 | 18篇 |
1986年 | 11篇 |
1985年 | 8篇 |
1984年 | 21篇 |
1983年 | 17篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1976年 | 9篇 |
1965年 | 5篇 |
1963年 | 4篇 |
排序方式: 共有6017条查询结果,搜索用时 9 毫秒
71.
Janusz Sokó? 《Computers & Mathematics with Applications》2011,62(2):611-619
This paper presents a new class of functions analytic in the open unit disc, and closely related to the class of starlike functions. Besides being an introduction to this field, it provides an interesting connections defined class with well known classes. The paper deals with several ideas and techniques used in geometric function theory. The order of starlikeness in the class of convex functions of negative order is also considered here. 相似文献
72.
73.
MELM-GRBF: A modified version of the extreme learning machine for generalized radial basis function neural networks 总被引:3,自引:0,他引:3
Francisco Fernández-NavarroAuthor Vitae César Hervás-MartínezAuthor VitaeJavier Sanchez-MonederoAuthor Vitae Pedro Antonio GutiérrezAuthor Vitae 《Neurocomputing》2011,74(16):2502-2510
In this paper, we propose a methodology for training a new model of artificial neural network called the generalized radial basis function (GRBF) neural network. This model is based on generalized Gaussian distribution, which parametrizes the Gaussian distribution by adding a new parameter τ. The generalized radial basis function allows different radial basis functions to be represented by updating the new parameter τ. For example, when GRBF takes a value of τ=2, it represents the standard Gaussian radial basis function. The model parameters are optimized through a modified version of the extreme learning machine (ELM) algorithm. In the methodology proposed (MELM-GRBF), the centers of each GRBF were taken randomly from the patterns of the training set and the radius and τ values were determined analytically, taking into account that the model must fulfil two constraints: locality and coverage. An thorough experimental study is presented to test its overall performance. Fifteen datasets were considered, including binary and multi-class problems, all of them taken from the UCI repository. The MELM-GRBF was compared to ELM with sigmoidal, hard-limit, triangular basis and radial basis functions in the hidden layer and to the ELM-RBF methodology proposed by Huang et al. (2004) [1]. The MELM-GRBF obtained better results in accuracy than the corresponding sigmoidal, hard-limit, triangular basis and radial basis functions for almost all datasets, producing the highest mean accuracy rank when compared with these other basis functions for all datasets. 相似文献
74.
75.
The traditional sphere-structured support vector machines algorithm is one of the learning methods. It can partition the training
samples space by means of constructing the spheres with the minimum volume covering all training samples of each pattern class
in high-dimensional feature space. However, the decision rule of the traditional sphere-structured support vector machines
cannot assign ambiguous sample points such as some encircled by more than two spheres to valid class labels. Therefore, the
traditional sphere-structured support vector machines is insufficient for obtaining the better classification performance.
In this article, we propose a novel decision rule applied to the traditional sphere-structured support vector machines. This
new decision rule significantly improves the performance of labeling ambiguous points. Experimental results of seven real
datasets show the traditional sphere-structured support vector machines based on this new decision rule can not only acquire
the better classification accuracies than the traditional sphere-structured support vector machines but also achieve the comparable
performance to the classical support vector machines.
An erratum to this article can be found at 相似文献
76.
Yangsheng Hu Yuan Fan Yiheng Wei Yong Wang 《International journal of systems science》2016,47(1):122-134
This work focuses on the identification of fractional commensurate order systems from non-uniformly sampled data. A novel scheme is proposed to solve such problem. In this scheme, the non-uniformly sampled data are first complemented by using fractional Laguerre generating functions. Then, the multivariable output error state space method is employed to identify the relevant system parameters. Moreover, an in-depth property analysis of the proposed scheme is provided. A numerical example is investigated to illustrate the effectiveness of the proposed method. 相似文献
77.
Automatic scene understanding from multimodal data is a key task in the design of fully autonomous vehicles. The theory of belief functions has proved effective for fusing information from several sensors at the superpixel level. Here, we propose a novel framework, called evidential grammars, which extends stochastic grammars by replacing probabilities by belief functions. This framework allows us to fuse local information with prior and contextual information, also modeled as belief functions. The use of belief functions in a compositional model is shown to allow for better representation of the uncertainty on the priors and for greater flexibility of the model. The relevance of our approach is demonstrated on multi-modal traffic scene data from the KITTI benchmark suite. 相似文献
78.
A simple Mathematica (version 7) code for computing S-state energies and wave functions of two-electron (helium-like) ions is presented. The elegant technique derived from the classical papers of Pekeris (1958, 1959, 1962, 1965, 1971) [1], [2] and [3] is applied. The basis functions are composed of the Laguerre functions. The method is based on the perimetric coordinates and specific properties of the Laguerre polynomials. Direct solution of the generalized eigenvalues and eigenvectors problem is used, distinct from the Pekeris works. No special subroutines were used, only built-in objects supported by Mathematica. The accuracy of the results and computation times depend on the basis size. The ground state and the lowest triplet state energies can be computed with a precision of 12 and 14 significant figures, respectively. The accuracy of the higher excited states calculations is slightly worse. The resultant wave functions have a simple analytical form, that enables calculation of expectation values for arbitrary physical operators without any difficulties. Only three natural parameters are required in the input.The above Mathematica code is simpler than the earlier version (Liverts and Barnea, 2010 [4]). At the same time, it is faster and more accurate.
Program summary
Program title: TwoElAtomSL(SH)Catalogue identifier: AEHY_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHY_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 11 434No. of bytes in distributed program, including test data, etc.: 540 063Distribution format: tar.gzProgramming language: Mathematica 7.0Computer: Any PCOperating system: Any which supports Mathematica; tested under Microsoft Windows XP and Linux SUSE 11.0RAM:?109 bytesClassification: 2.1, 2.2, 2.7, 2.9Nature of problem: The Schrödinger equation for atoms (ions) with more than one electron has not been solved analytically. Approximate methods must be applied in order to obtain the wave functions or another physical attributes from quantum mechanical calculations.Solution method: The S-wave function is expanded into a triple set of basis functions which are composed of the exponentials combined with the Laguerre polynomials in the perimetric coordinates. Using specific properties of the Laguerre polynomials, solution of the two-electron Schrödinger equation reduces to solving the generalized eigenvalues and eigenvector problem for the proper Hamiltonian. The unknown exponential parameter is determined by means of minimization of the corresponding eigenvalue (energy).Restrictions: First, the too large length of expansion (basis size) takes the too large computation time and operative memory giving no perceptible improvement in accuracy. Second, the number of shells Ω in the wave function expansion enables one to calculate the excited nS-states up to n=Ω+1 inclusive.Running time: 2–60 minutes (depends on basis size and computer speed). 相似文献79.
The problem tackled in this article consists in associating perceived objects detected at a certain time with known objects previously detected, knowing uncertain and imprecise information regarding the association of each perceived objects with each known objects. For instance, this problem can occur during the association step of an obstacle tracking process, especially in the context of vehicle driving aid. A contribution in the modeling of this association problem in the belief function framework is introduced. By interpreting belief functions as weighted opinions according to the Transferable Belief Model semantics, pieces of information regarding the association of known objects and perceived objects can be expressed in a common global space of association to be combined by the conjunctive rule of combination, and a decision making process using the pignistic transformation can be made. This approach is validated on real data. 相似文献
80.
When conjunctively merging two belief functions concerning a single variable but coming from different sources, Dempster rule of combination is justified only when information sources can be considered as independent. When dependencies between sources are ill-known, it is usual to require the property of idempotence for the merging of belief functions, as this property captures the possible redundancy of dependent sources. To study idempotent merging, different strategies can be followed. One strategy is to rely on idempotent rules used in either more general or more specific frameworks and to study, respectively, their particularization or extension to belief functions. In this paper, we study the feasibility of extending the idempotent fusion rule of possibility theory (the minimum) to belief functions. We first investigate how comparisons of information content, in the form of inclusion and least-commitment, can be exploited to relate idempotent merging in possibility theory to evidence theory. We reach the conclusion that unless we accept the idea that the result of the fusion process can be a family of belief functions, such an extension is not always possible. As handling such families seems impractical, we then turn our attention to a more quantitative criterion and consider those combinations that maximize the expected cardinality of the joint belief functions, among the least committed ones, taking advantage of the fact that the expected cardinality of a belief function only depends on its contour function. 相似文献