全文获取类型
收费全文 | 919篇 |
免费 | 46篇 |
国内免费 | 52篇 |
专业分类
电工技术 | 21篇 |
综合类 | 18篇 |
化学工业 | 6篇 |
金属工艺 | 10篇 |
机械仪表 | 28篇 |
建筑科学 | 2篇 |
矿业工程 | 3篇 |
能源动力 | 2篇 |
轻工业 | 2篇 |
水利工程 | 1篇 |
石油天然气 | 4篇 |
无线电 | 299篇 |
一般工业技术 | 35篇 |
原子能技术 | 1篇 |
自动化技术 | 585篇 |
出版年
2024年 | 1篇 |
2023年 | 12篇 |
2022年 | 20篇 |
2021年 | 36篇 |
2020年 | 27篇 |
2019年 | 38篇 |
2018年 | 39篇 |
2017年 | 66篇 |
2016年 | 93篇 |
2015年 | 74篇 |
2014年 | 138篇 |
2013年 | 81篇 |
2012年 | 74篇 |
2011年 | 75篇 |
2010年 | 32篇 |
2009年 | 25篇 |
2008年 | 34篇 |
2007年 | 24篇 |
2006年 | 21篇 |
2005年 | 15篇 |
2004年 | 19篇 |
2003年 | 9篇 |
2002年 | 5篇 |
2001年 | 8篇 |
2000年 | 2篇 |
1999年 | 8篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有1017条查询结果,搜索用时 15 毫秒
1.
In this letter, we address the problem of Direction of Arrival (DOA) estimation with nonuniform linear array in the context of sparse Bayesian learning (SBL) framework. The nonuniform array output is deemed as an incomplete-data observation, and a hypothetical uniform linear array output is treated as an unavailable complete-data observation. Then the Expectation-Maximization (EM) criterion is directly utilized to iteratively maximize the expected value of the complete-data log likelihood under the posterior distribution of the latent variable. The novelties of the proposed method lie in its capability of interpolating the actual received data to a virtual uniform linear array, therefore extending the achievable array aperture. Simulation results manifests the superiority of the proposed method over off-the-shelf algorithms, specially on circumstances such as low SNR, insufficient snapshots, and spatially adjacent sources. 相似文献
2.
In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network
with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities
and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the
network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability.
The problem is to route the multicast session from each source to the members of every multicast session, and to assign an
appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session
provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per
multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the
current network topology as well as its residual network resource information. We formulate the per session multicast routing
and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success
probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed
online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation
results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes
are SaD nodes. 相似文献
3.
Accurate and efficient vectorization of line drawings is essential for any higher level processing in document analysis and
recognition systems. In spite of the prevalence of vectorization and line detection methods, no standard for their performance
evaluation protocol exists. We propose a protocol for evaluating both straight and circular line extraction to help compare,
select, improve, and even design line detection algorithms to be incorporated into line drawing recognition and understanding
systems. The protocol involves both positive and negative sets of indices, at pixel and vector levels. Time efficiency is
also included in the protocol. The protocol may be extended to handle lines of any shape as well as other classes of graphic
objects. 相似文献
4.
Based on a polynomial operator approach, a new sparse controller structure is derived, which is actually an improved version of the recently proposed structure [Li, G. (2004). A polynomial-operator-based DFIIt structure for IIR filters. IEEE Transactions on Circuits and Systems II, 51, 147-151]. The performance of the proposed structure is analyzed by deriving the corresponding expression of roundoff noise gain and the problem of finding optimized sparse structures is solved efficiently with a genetic algorithm (GA). A numerical example is given, which shows that the newly developed structure can achieve much better performance than some well-known structures and particularly outperforms the traditional optimal fully parametrized realization greatly in terms of reducing roundoff noise and implementation complexity. 相似文献
5.
6.
Cong Zheng Shuo Gu Tong-Xiang Gu Bing Yang Xing-Ping Liu 《Journal of Parallel and Distributed Computing》2014
Sparse matrix–vector multiplication (SpMV) is one of the most important high level operations for basic linear algebra. Nowadays, the GPU has evolved into a highly parallel coprocessor which is suited to compute-intensive, highly parallel computation. Achieving high performance of SpMV on GPUs is relatively challenging, especially when the matrix has no specific structure. For these general sparse matrices, a new data structure based on the bisection ELLPACK format, BiELL, is designed to realize the load balance better, and thus improve the performance of the SpMV. Besides, based on the same idea of JAD format, the BiJAD format can be obtained. Experimental results on various matrices show that the BiELL and BiJAD formats perform better than other similar formats, especially when the number of non-zero elements per row varies a lot. 相似文献
7.
8.
非平稳噪声和低信噪比条件下提高增强语音质量一直以来都是语音增强研究的难题。近年来,卷积非负矩阵分解在语音增强算法中成功应用,本文进一步考虑语音信号在时频域的稀疏性,提出了稀疏卷积非负矩阵分解(Sparse Convolutive Nonnegative Matrix Factorization, SCNMF)的语音增强算法。该算法包括训练和增强两个阶段。训练阶段通过SCNMF算法分别对纯净语音和噪声的频谱进行训练,得到纯净语音和噪声字典,并将其作为增强阶段的先验信息。增强阶段首先通过SCNMF算法对带噪语音的频谱进行分解,然后利用纯净语音和噪声联合字典对语音编码矩阵进行估计,重构增强语音。本文通过实验仿真分析了稀疏因子对增强语音质量的影响。实验结果表明,在非平稳噪声和低信噪比条件下,本文算法增强效果均优于多带谱减、非负矩阵分解、卷积非负矩阵分解等传统的算法。 相似文献
9.
The paper presents a supervised discriminative dictionary learning algorithm specially designed for classifying HEp-2 cell patterns. The proposed algorithm is an extension of the popular K-SVD algorithm: at the training phase, it takes into account the discriminative power of the dictionary atoms and reduces their intra-class reconstruction error during each update. Meanwhile, their inter-class reconstruction effect is also considered. Compared to the existing extension of K-SVD, the proposed algorithm is more robust to parameters and has better discriminative power for classifying HEp-2 cell patterns. Quantitative evaluation shows that the proposed algorithm outperforms general object classification algorithms significantly on standard HEp-2 cell patterns classifying benchmark1 and also achieves competitive performance on standard natural image classification benchmark. 相似文献
10.
Zhonglong Zheng Mudan Yu Jiong Jia Huawen Liu Daohong Xiang Xiaoqiao Huang Jie Yang 《Pattern recognition》2014
In this paper, we consider the issue of computing low rank (LR) recovery of matrices with sparse errors. Based on the success of low rank matrix recovery in statistical learning, computer vision and signal processing, a novel low rank matrix recovery algorithm with Fisher discrimination regularization (FDLR) is proposed. Standard low rank matrix recovery algorithm decomposes the original matrix into a set of representative basis with a corresponding sparse error for modeling the raw data. Motivated by the Fisher criterion, the proposed FDLR executes low rank matrix recovery in a supervised manner, i.e., taking the with-class scatter and between-class scatter into account when the whole label information are available. The paper shows that the formulated model can be solved by the augmented Lagrange multipliers and provides additional discriminating power over the standard low rank recovery models. The representative bases learned by the proposed method are encouraged to be closer within the same class, and as far as possible between different classes. Meanwhile, the sparse error recovered by FDLR is not discarded as usual, but treated as a feedback in the following classification tasks. Numerical simulations demonstrate that the proposed algorithm achieves the state of the art results. 相似文献