全文获取类型
收费全文 | 1133篇 |
免费 | 207篇 |
国内免费 | 200篇 |
专业分类
电工技术 | 38篇 |
技术理论 | 1篇 |
综合类 | 69篇 |
化学工业 | 13篇 |
金属工艺 | 7篇 |
机械仪表 | 20篇 |
建筑科学 | 8篇 |
矿业工程 | 1篇 |
能源动力 | 5篇 |
轻工业 | 2篇 |
水利工程 | 12篇 |
石油天然气 | 12篇 |
武器工业 | 5篇 |
无线电 | 172篇 |
一般工业技术 | 46篇 |
冶金工业 | 1篇 |
原子能技术 | 22篇 |
自动化技术 | 1106篇 |
出版年
2024年 | 2篇 |
2023年 | 17篇 |
2022年 | 35篇 |
2021年 | 36篇 |
2020年 | 49篇 |
2019年 | 37篇 |
2018年 | 48篇 |
2017年 | 49篇 |
2016年 | 101篇 |
2015年 | 115篇 |
2014年 | 175篇 |
2013年 | 199篇 |
2012年 | 148篇 |
2011年 | 179篇 |
2010年 | 115篇 |
2009年 | 81篇 |
2008年 | 66篇 |
2007年 | 38篇 |
2006年 | 30篇 |
2005年 | 14篇 |
2004年 | 5篇 |
1990年 | 1篇 |
排序方式: 共有1540条查询结果,搜索用时 15 毫秒
61.
The primary goal of cloth simulation is to express object behavior in a realistic manner and achieve real-time performance by following the fundamental concept of physic. In general, the mass–spring system is applied to real-time cloth simulation with three types of springs. However, hard spring cloth simulation using the mass–spring system requires a small integration time-step in order to use a large stiffness coefficient. Furthermore, to obtain stable behavior, constraint enforcement is used instead of maintenance of the force of each spring. Constraint force computation involves a large sparse linear solving operation. Due to the large computation, we implement a cloth simulation using adaptive constraint activation and deactivation techniques that involve the mass–spring system and constraint enforcement method to prevent excessive elongation of cloth. At the same time, when the length of the spring is stretched or compressed over a defined threshold, adaptive constraint activation and deactivation method deactivates the spring and generate the implicit constraint. Traditional method that uses a serial process of the Central Processing Unit (CPU) to solve the system in every frame cannot handle the complex structure of clothmodel in real-time. Our simulation utilizes the Graphic Processing Unit (GPU) parallel processing with compute shader in OpenGL Shading Language (GLSL) to solve the system effectively. In this paper, we design and implement parallel method for cloth simulation, and experiment on the performance and behavior comparison of the mass–spring system, constraint enforcement, and adaptive constraint activation and deactivation techniques the using GPU-based parallel method. 相似文献
62.
A Modern Graphics Processing unit (GPU) is able to perform massively parallel scientific computations at low cost. We extend our implementation of the checkerboard algorithm for the two-dimensional Ising model [T. Preis et al., Journal of Chemical Physics 228 (2009) 4468-4477] in order to overcome the memory limitations of a single GPU which enables us to simulate significantly larger systems. Using multi-spin coding techniques, we are able to accelerate simulations on a single GPU by factors up to 35 compared to an optimized single Central Processor Unit (CPU) core implementation which employs multi-spin coding. By combining the Compute Unified Device Architecture (CUDA) with the Message Parsing Interface (MPI) on the CPU level, a single Ising lattice can be updated by a cluster of GPUs in parallel. For large systems, the computation time scales nearly linearly with the number of GPUs used. As proof of concept we reproduce the critical temperature of the 2D Ising model using finite size scaling techniques. 相似文献
63.
64.
为了充分利用图形处理器(GPU)的闲置资源,同时达到提高密码算法加密速度的目的,提出了一种在图形处理器上实现AES加密算法的方法,分别阐述了基于传统OpenGL的AES实现以及基于最新技术CUDA的AES实现,并对这两种方法的实现性能进行了分析,同时与传统CPU方法的实现性能进行了比较,基于CUDA的AES的实现速度达到了传统CPU上AES实现速度的19.6倍. 相似文献
65.
基于GPU粒子系统的大规模场景高效雨雪实时模拟 总被引:3,自引:0,他引:3
粒子系统实现的雨雪效果能有效增强三维场景的真实感,传统基于中央处理器(CPU)运算模拟的粒子系统占用了大量CPU运算时间,难以达到实时模拟的要求。为此提出了一种基于图形处理器的(GPU)运算的粒子系统来模拟的雨雪场景。该方法通过在GPU中重复使用消亡粒子在视点坐标系内生成新粒子,并在几何着色器中将粒子的点坐标转换为矩形坐标,将CPU从复杂庞大的几何运算中解放出来,从而大幅增加了场景绘制的微粒数,使雨雪场景模拟的实时性和逼真度得到增强。 相似文献
66.
67.
68.
69.
70.
Ramtin ShamsAuthor Vitae Parastoo SadeghiAuthor Vitae 《Journal of Parallel and Distributed Computing》2011,71(4):584-593
A model for the computational cost of the finite-difference time-domain (FDTD) method irrespective of implementation details or the application domain is given. The model is used to formalize the problem of optimal distribution of computational load to an arbitrary set of resources across a heterogeneous cluster. We show that the problem can be formulated as a minimax optimization problem and derive analytic lower bounds for the computational cost. The work provides insight into optimal design of FDTD parallel software. Our formulation of the load distribution problem takes simultaneously into account the computational and communication costs. We demonstrate that significant performance gains, as much as 75%, can be achieved by proper load distribution. 相似文献