全文获取类型
收费全文 | 935篇 |
免费 | 50篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 33篇 |
综合类 | 2篇 |
化学工业 | 325篇 |
金属工艺 | 23篇 |
机械仪表 | 29篇 |
建筑科学 | 18篇 |
矿业工程 | 1篇 |
能源动力 | 39篇 |
轻工业 | 53篇 |
石油天然气 | 2篇 |
无线电 | 46篇 |
一般工业技术 | 251篇 |
冶金工业 | 15篇 |
原子能技术 | 23篇 |
自动化技术 | 127篇 |
出版年
2024年 | 3篇 |
2023年 | 23篇 |
2022年 | 31篇 |
2021年 | 58篇 |
2020年 | 26篇 |
2019年 | 34篇 |
2018年 | 29篇 |
2017年 | 44篇 |
2016年 | 42篇 |
2015年 | 32篇 |
2014年 | 50篇 |
2013年 | 82篇 |
2012年 | 64篇 |
2011年 | 76篇 |
2010年 | 78篇 |
2009年 | 70篇 |
2008年 | 50篇 |
2007年 | 36篇 |
2006年 | 40篇 |
2005年 | 25篇 |
2004年 | 10篇 |
2003年 | 12篇 |
2002年 | 9篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 7篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有987条查询结果,搜索用时 15 毫秒
11.
Compute unified device architecture (CUDA) is a software development platform that allows us to run C-like programs on the nVIDIA graphics processing unit (GPU). This paper presents an acceleration method for cone beam reconstruction using CUDA compatible GPUs. The proposed method accelerates the Feldkamp, Davis, and Kress (FDK) algorithm using three techniques: (1) off-chip memory access reduction for saving the memory bandwidth; (2) loop unrolling for hiding the memory latency; and (3) multithreading for exploiting multiple GPUs. We describe how these techniques can be incorporated into the reconstruction code. We also show an analytical model to understand the reconstruction performance on multi-GPU environments. Experimental results show that the proposed method runs at 83% of the theoretical memory bandwidth, achieving a throughput of 64.3 projections per second (pps) for reconstruction of 5123-voxel volume from 360 5122-pixel projections. This performance is 41% higher than the previous CUDA-based method and is 24 times faster than a CPU-based method optimized by vector intrinsics. Some detailed analyses are also presented to understand how effectively the acceleration techniques increase the reconstruction performance of a naive method. We also demonstrate out-of-core reconstruction for large-scale datasets, up to 10243-voxel volume. 相似文献
12.
Yusuke Tsuda Yonghao Yue Yoshinori Dobashi Tomoyuki Nishita 《The Visual computer》2010,26(6-8):883-891
In the field of computer graphics, simulation of fluids, including avalanches, is an important research topic. In this paper, we propose a method to simulate a kind of avalanche, mixed-motion avalanche, which is usually large and travels down the slope fast, often resulting in impressive visual effects. The mixed-motion avalanche consists of snow smokes and liquefied snow which form an upper suspension layer and a lower dense-flow layer, respectively. The mixed-motion avalanche travels down the surface of the snow-covered mountain, which is called accumulated snow layer. We simulate a mixed-motion avalanche taking into account these three snow layers. We simulate the suspension layer using a grid-based approach, the dense-flow and accumulated snow layer using a particle-based approach. An important contribution of our method is an interaction model between these snow layers that enables us to obtain the characteristic motions of avalanches, such as the generation of the snow smoke from the head of the avalanche. 相似文献
13.
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientation problem is a special case of the submodular flow problem. Frank (1982) devised a combinatorial
algorithm that solves the problem in O(k
2
n
3
m) time, where n and m are the numbers of vertices and edges, respectively. Gabow (1995) improved Frank’s algorithm to run in O(kn
2
m) time by introducing a new sophisticated data structure. We describe an algorithm that runs in O(k
3
n
3+kn
2
m) time without using sophisticated data structures. In addition, we present an application of the algorithm to find a shortest
dijoin in O(n
2
m) time, which matches the current best bound. 相似文献
14.
Yusuke Fukui Yosuke Honda Yasuhiro Yamauchi Michiko Okafuji Masahiro Sakai Mikihiko Nishitani Yusuke Takata 《Journal of the Society for Information Display》2010,18(12):1090-1094
Abstract— MgO thin film is currently used as a surface protective layer for dielectric materials because MgO has a high resistance during ion sputtering and exhibits effective secondary electron emission. The secondary‐electron‐emission coefficient γ of MgO is high for Ne ions; however, it is low for Xe ions. The Xe content of the discharge gas of PDPs needs to be raised in order to increase the luminous efficiency. Thus, the development of high‐γ materials replacing MgO is required. The discharge properties and chemical surface stability of SrO containing Zr (SrZrO) as the candidate high‐γ protective layer for noble PDPs have been characterized. SrZrO films have superior chemical stability, especially the resistance to carbonation because of the existence of a few adsorption sites due to their amorphous structure. The firing voltage is 60 V lower than that of MgO films for a discharge gas of Ne/Xe = 85/15 at 60 kPa. 相似文献
15.
In maintenance of concrete structures, crack detection is important for the inspection and diagnosis of concrete structures.
However, it is difficult to detect cracks automatically. In this paper, we propose a robust automatic crack-detection method
from noisy concrete surface images. The proposed method includes two preprocessing steps and two detection steps. The first
preprocessing step is a subtraction process using the median filter to remove slight variations like shadings from concrete
surface images; only an original image is used in the preprocessing. In the second preprocessing step, a multi-scale line
filter with the Hessian matrix is used both to emphasize cracks against blebs or stains and to adapt the width variation of
cracks. After the preprocessing, probabilistic relaxation is used to detect cracks coarsely and to prevent noises. It is unnecessary
to optimize any parameters in probabilistic relaxation. Finally, using the results from the relaxation process, a locally
adaptive thresholding is performed to detect cracks more finely. We evaluate robustness and accuracy of the proposed method
quantitatively using 60 actual noisy concrete surface images. 相似文献
16.
New pixel driving circuit using self‐discharging compensation method for high‐resolution OLED micro displays on a silicon backplane 下载免费PDF全文
Kei Kimura Yusuke Onoyama Taizo Tanaka Naobumi Toyomura Hideyuki Kitagawa 《Journal of the Society for Information Display》2017,25(3):167-176
A new 4T2C pixel circuit formed on a silicon substrate is proposed to realize a high‐resolution 7.8‐μm pixel pitch AMOLED microdisplay. In order to achieve high luminance uniformity, the pixel circuit compensates its Vth variation of the MOSFET for the driving transistor internally by using self‐discharging method. Also presented are 0.5‐in Quad‐VGA and 1.25‐in wide Quad‐XGA microdisplays with the proposed pixel circuit. 相似文献
17.
How the human central nervous system adjusts sensorimotor coordination to haptic stimuli is a major topic in several fields including robotics. There are studies focusing on contact positioning tasks such as catching a ball or a volley in tennis, where position control of a human hand is required only at the moment of contact for successful completion of the tasks. A previous study dealt with a task of catching a ball in a virtual environment, and reported an interesting observation of the learning process in the relationship between operational performance and energy consumption of an operator; however, the operational condition given to the operators in the previous study seemed to be relatively simple. The interest in this paper is similar to that of the previous study; however, this paper considers application of a slightly more complex operational condition to a task of catching a ball. For corresponding to increase of difficulty in operation in the task, two movements of a paddle for catching a ball are given to operators, and difference between the movements is observed. Although the final goal of the study in this paper is similar to that in the previous study, this paper considers how learning effect can be observed in operational performance by comparing the performance of novice operators with that of experienced operators. The comparison shows differences in the performances between the operators from three analytic aspects. This paper also considers how many operations are required for novice operators to exhibit the learning effect in operational performance. 相似文献
18.
We consider the minimum maximal matching problem, which is NP-hard (Yannakakis and Gavril (1980) [18]). Given an unweighted simple graph G=(V,E), the problem seeks to find a maximal matching of minimum cardinality. It was unknown whether there exists a non-trivial approximation algorithm whose approximation ratio is less than 2 for any simple graph. Recently, Z. Gotthilf et al. (2008) [5] presented a -approximation algorithm, where c is an arbitrary constant.In this paper, we present a -approximation algorithm based on an LP relaxation, where χ′(G) is the edge-coloring number of G. Our algorithm is the first non-trivial approximation algorithm whose approximation ratio is independent of |V|. Moreover, it is known that the minimum maximal matching problem is equivalent to the edge dominating set problem. Therefore, the edge dominating set problem is also -approximable. From edge-coloring theory, the approximation ratio of our algorithm is , where Δ(G) represents the maximum degree of G. In our algorithm, an LP formulation for the edge dominating set problem is used. Fujito and Nagamochi (2002) [4] showed the integrality gap of the LP formulation for bipartite graphs is at least . Moreover, χ′(G) is Δ(G) for bipartite graphs. Thus, as far as an approximation algorithm for the minimum maximal matching problem uses the LP formulation, we believe our result is the best possible. 相似文献
19.
There are two major ways of calculating ray and parametric surface intersections in rendering. The first is through the use of tessellated triangles, and the second is to use parametric surfaces together with numerical methods such as Newton's method. Both methods are computationally expensive and complicated to implement. In this paper, we focus on Phong Tessellation and introduce a simple direct ray tracing method for Phong Tessellation. Our method enables rendering smooth surfaces in a computationally inexpensive yet robust way. 相似文献
20.
Nobuhiko Hayashi Yusuke Kato Manfred Sigrist 《Journal of Low Temperature Physics》2005,139(1-2):79-96
The low-temperature shrinking of the vortex core (Kramer-Pesch effect) is studied for an isolated single vortex for chiral
p-wave and s-wave superconducting phases. The effect of nonmagnetic impurities on the vortex core radius is numerically investigated
in the Born limit by means of a quasiclassical approach. It is shown that in the chiral p-wave phase the Kramer-Pesch effect
displays a certain robustness against impurities owing to a specific quantum effect, while the s-wave phase reacts more sensitively
to impurity scattering. This suggests chiral p-wave superconductors as promising candidates for the experimental observation
of the Kramer-Pesch effect. 相似文献