全文获取类型
收费全文 | 6013篇 |
免费 | 568篇 |
国内免费 | 420篇 |
专业分类
电工技术 | 439篇 |
技术理论 | 2篇 |
综合类 | 850篇 |
化学工业 | 300篇 |
金属工艺 | 158篇 |
机械仪表 | 307篇 |
建筑科学 | 980篇 |
矿业工程 | 114篇 |
能源动力 | 168篇 |
轻工业 | 216篇 |
水利工程 | 248篇 |
石油天然气 | 121篇 |
武器工业 | 63篇 |
无线电 | 487篇 |
一般工业技术 | 299篇 |
冶金工业 | 290篇 |
原子能技术 | 56篇 |
自动化技术 | 1903篇 |
出版年
2024年 | 8篇 |
2023年 | 47篇 |
2022年 | 98篇 |
2021年 | 110篇 |
2020年 | 150篇 |
2019年 | 111篇 |
2018年 | 128篇 |
2017年 | 140篇 |
2016年 | 232篇 |
2015年 | 227篇 |
2014年 | 462篇 |
2013年 | 488篇 |
2012年 | 464篇 |
2011年 | 569篇 |
2010年 | 434篇 |
2009年 | 393篇 |
2008年 | 395篇 |
2007年 | 415篇 |
2006年 | 374篇 |
2005年 | 293篇 |
2004年 | 257篇 |
2003年 | 211篇 |
2002年 | 173篇 |
2001年 | 169篇 |
2000年 | 122篇 |
1999年 | 90篇 |
1998年 | 71篇 |
1997年 | 68篇 |
1996年 | 57篇 |
1995年 | 36篇 |
1994年 | 37篇 |
1993年 | 33篇 |
1992年 | 19篇 |
1991年 | 21篇 |
1990年 | 17篇 |
1989年 | 17篇 |
1988年 | 13篇 |
1987年 | 4篇 |
1986年 | 4篇 |
1985年 | 3篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1978年 | 2篇 |
1976年 | 4篇 |
1971年 | 4篇 |
1966年 | 2篇 |
1964年 | 2篇 |
1957年 | 3篇 |
1955年 | 4篇 |
排序方式: 共有7001条查询结果,搜索用时 15 毫秒
61.
In this paper we focus on two complementary approaches to significantly decrease pre-training time of a deep belief network (DBN). First, we propose an adaptive step size technique to enhance the convergence of the contrastive divergence (CD) algorithm, thereby reducing the number of epochs to train the restricted Boltzmann machine (RBM) that supports the DBN infrastructure. Second, we present a highly scalable graphics processing unit (GPU) parallel implementation of the CD-k algorithm, which boosts notably the training speed. Additionally, extensive experiments are conducted on the MNIST and the HHreco databases. The results suggest that the maximum useful depth of a DBN is related to the number and quality of the training samples. Moreover, it was found that the lower-level layer plays a fundamental role for building successful DBN models. Furthermore, the results contradict the pre-conceived idea that all the layers should be pre-trained. Finally, it is shown that by incorporating multiple back-propagation (MBP) layers, the DBNs generalization capability is remarkably improved. 相似文献
62.
《Microprocessors and Microsystems》2014,38(7):717-729
High single instruction multiple data (SIMD) efficiency and low power consumption have made graphic processing units (GPUs) an ideal platform for many complex computational applications. Thousands of threads can be created by programmers and grouped into fixed-size SIMD batches, known as warps. High throughput is then achieved by concurrently executing such warps with minimal control overhead. However, if a branch instruction occurs, which assigns different paths to different threads, one warp will be broken into multiple warps that have to be executed serially, consequently reducing the efficiency advantage of SIMD. In this paper, the contemporary fixed-size warp design is abandoned for a hybrid warp size (HWS) mechanism. Mixed-size warps are generated according to HWS and are scheduled and issued flexibly. The simulation results show that this mechanism yields an average speedup of 1.20 over the baseline architecture for a wide variety of general purpose GPU applications. The paper also integrates HWS with dynamic warp formation (DWF), which is a well-known branch handling mechanism used to improve SIMD utilization by forming new warps out of split warps in real time. The simulation results show that the combination of DWF and HWS generates an average speedup of 1.27 over the DWF-only platform with an estimated area increase of about 1% of DWF. 相似文献
63.
《Parallel Computing》2014,40(5-6):70-85
QR factorization is a computational kernel of scientific computing. How can the latest computer be used to accelerate this task? We investigate this topic by proposing a dense QR factorization algorithm with adaptive block sizes on a hybrid system that contains a central processing unit (CPU) and a graphic processing unit (GPU). To maximize the use of CPU and GPU, we develop an adaptive scheme that chooses block size at each iteration. The decision is based on statistical surrogate models of performance and an online monitor, which avoids unexpected occasional performance drops. We modify the highly optimized CPU–GPU based QR factorization in MAGMA to implement the proposed schemes. Numerical results suggest that our approaches are efficient and can lead to near-optimal block sizes. The proposed algorithm can be extended to other one-sided factorizations, such as LU and Cholesky factorizations. 相似文献
64.
The present study examines the tele‐cocooning hypothesis in the context of general trust using a nationally representative survey of Japanese youth. We find that although frequency of texting is positively correlated with general trust, this correlation is spuriously caused by how heavy mobile texters interpret the words “most people” in the general trust measurement. Heavy users assume that “most people” only refers to friends, family, and others going to the same school. When the effect of the “most people” assumption is controlled, the positive association between texting and general trust disappears. Further exploration of the data shows that heavy texting nevertheless has negative implications for social tolerance and social caution, both of which are theoretically proximate to general trust. 相似文献
65.
Pattern synthesis of time‐modulated conformal arrays by an improved differential evolution algorithm
In this article, an improved differential evolution algorithm (IDE) based on two different colonies is proposed and applied to time‐modulated conformal arrays syntheses. The whole population of IDE is divided into two parts. The one part searches the solution globally while the other searches the neighborhood of the solution provided by the previous one. Benchmark functions are provided to testify IDE. Furthermore, IDE is applied to synthetize sum‐difference patterns with a 1 × 16 elements time‐modulated circular array and low sidelobe level (SLL) patterns with an 8 × 12 elements time‐modulated cone array. After optimization, the sideband level (SBL) of the circular array at the first sideband frequency is ?1.00 dB. The SLL and SBL at the first sideband frequency of the cone array are lower than ?30.00 and ?20.00 dB, respectively. Experiment results verify the superior performance of IDE. Moreover, to accelerate the computation speed, graphics processing unit parallel computing technique is introduced into pattern synthesis and the acceleration ratios of more than 23 times can be achieved. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 24:697–705, 2014. 相似文献
66.
Lauro Cassio Martins de Paula Anderson da Silva Soares 《通讯和计算机》2014,(4):339-346
This paper presents a parallel implementation of the hybrid BiCGStab(2) (bi-conjugate gradient stabilized) iterative method in a GPU (graphics processing unit) for solution of large and sparse linear systems. This implementation uses the CUDA-Matlab integration, in which the method operations are performed in a GPU core using Matlab built-in functions. The goal is to show that the exploitation of parallelism by using this new technology can provide a significant computational performance. For the validation of the work, we compared the proposed implementation with a BiCGStab(2) sequential and parallelized implementation in the C and CUDA-C languages. The results showed that the proposed implementation is more efficient and can be viable for simulations being carried out with quality and in a timely manner. The gains in computational efficiency were 76x and 6x compared to the implementation in C and CUDA-C, respectively. 相似文献
67.
偏微分方程数值解法(包括有限差分法、有限元法)以及大量的数学物理方程数值解法最终都会演变成求解大型线性方程组。因此,探讨快速、稳定、精确的大型线性方程组解法一直是数值计算领域不断深入研究的课题且具有特别重要的意义。在迭代法中,共轭斜量法(又称共轭梯度法)被公认为最好的方法之一。但是,该方法最大缺点是仅适用于线性方程组系数矩阵为对称正定矩阵的情况,而且常规的CPU算法实现非常耗时。为此,通过将线性方程组系数矩阵作转换成对称矩阵后实施基于GPU-CUDA的快速共轭斜量法来解决一般性大型线性方程组的求解问题。试验结果表明:在求解效率方面,基于GPU-CUDA的共轭斜量法运行效率高,当线性方程组阶数超过3000时,其加速比将超过14;在解的精确性与求解过程的稳定性方面,与高斯列主元消去法相当。基于GPU-CUDA的快速共轭斜量法是求解一般性大型线性方程组快速而非常有效的方法。 相似文献
68.
69.
介绍了几种胶辊用混炼硅橡胶的配制,包括低硬度胶辊用混炼硅橡胶、低环硅氧烷含量的胶辊用混炼硅橡胶、送纸胶辊用混炼硅橡胶及工业胶辊用混炼硅橡胶的配制。 相似文献
70.