全文获取类型
收费全文 | 7927篇 |
免费 | 1010篇 |
国内免费 | 714篇 |
学科分类
工业技术 | 9651篇 |
出版年
2024年 | 30篇 |
2023年 | 94篇 |
2022年 | 138篇 |
2021年 | 153篇 |
2020年 | 248篇 |
2019年 | 242篇 |
2018年 | 215篇 |
2017年 | 266篇 |
2016年 | 288篇 |
2015年 | 322篇 |
2014年 | 464篇 |
2013年 | 529篇 |
2012年 | 503篇 |
2011年 | 643篇 |
2010年 | 444篇 |
2009年 | 507篇 |
2008年 | 489篇 |
2007年 | 544篇 |
2006年 | 485篇 |
2005年 | 425篇 |
2004年 | 359篇 |
2003年 | 289篇 |
2002年 | 290篇 |
2001年 | 225篇 |
2000年 | 208篇 |
1999年 | 175篇 |
1998年 | 156篇 |
1997年 | 125篇 |
1996年 | 105篇 |
1995年 | 99篇 |
1994年 | 94篇 |
1993年 | 86篇 |
1992年 | 71篇 |
1991年 | 72篇 |
1990年 | 41篇 |
1989年 | 42篇 |
1988年 | 26篇 |
1987年 | 24篇 |
1986年 | 22篇 |
1985年 | 26篇 |
1984年 | 19篇 |
1983年 | 22篇 |
1982年 | 13篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1959年 | 2篇 |
1956年 | 3篇 |
1955年 | 3篇 |
排序方式: 共有9651条查询结果,搜索用时 15 毫秒
1.
This is the first time an extensive investigation has been carried out regarding the effects of riser exit geometry on pressure drop and solid behaviour inside the Internal Circulating Fluidized Bed (ICFB) riser, using different riser exit geometries at several operating conditions.The Radioactive Particle-Tracking (RPT) technique was used for solid concentration measurements and solid residence time distribution at the exit zone. Experiments were conducted using Geldart B particles, in the gas superficial velocity range of 4 to 10 m/s. Axial solid hold-up, solid residence time distribution in the exit zone, and the reflux ratio factor km, (defined earlier by [E.H. Van der Meer, R.B. Thorpe, J.F. Davidson, Flow patterns in the square cross-section riser of a circulating fluidized bed and the effect of riser exit design, Chem. Eng. Sc. 55 (19) (2000) 4079-4099]), were the main criteria used to investigate the impact of gas-solid separator devices implemented at the ICFB riser exit.Solid residence time distribution results and axial solid hold-up profiles provided clear evidence that the separator device at the riser exit strongly influences the hydrodynamic structure of the ICFB riser. The V-shaped riser exit geometry was found to be the optimum of all the configurations studied. 相似文献
2.
Vladlen Koltun 《Information Processing Letters》2004,89(5):233-235
It is an outstanding open problem of computational geometry to prove a near-quadratic upper bound on the number of combinatorial changes in the Voronoi diagram of points moving at a common constant speed along linear trajectories in the plane. In this note we observe that this quantity is Θ(n2) if the points start their movement from a common line. 相似文献
3.
周培德 《计算机辅助设计与图形学学报》2002,14(3):287-288
周培协三角剖分是否能得到最小权三角剖分,周培德在《周培德三角部分不是最小权三角剖分》一文撰写之前已有新的结论,本文还指出《周培德三角剖分不是最小权三角剖分》一文所举反例不成立。 相似文献
4.
任意曲线透视投影的逆变换 总被引:1,自引:0,他引:1
透视曲线的逆变换是透视图象三维逆变换的重要基础。本文在给出透视投影逆变换基本方程的基础上,分别提出了圆、椭圆、二次曲线、任意平面曲线的透视投影逆变换的解析方法或计算机反求方法。同时给出灭点信息不足明图象的透视参数的准确反求方法。 相似文献
5.
Reconstruction of an original continuous curve and the estimation of its parameters from the digitized version of the curve
is a challenging problem, as quantization always causes some loss of information. In this paper, we have developed a scheme
for reconstruction which is applicable to a class of curves having at the most two parameters. The class of curves for which
the scheme works has also been characterized. We have shown that for one-parameter curves the exact domain of values of the
parameter can be obtained. But in the two-parameter case, only the smallest rectangle containing the domain can be realised.
The distinctive feature of our scheme is that it provides a unified approach to solve the reconstruction and the domain-finding
problem for a class of curves. 相似文献
6.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献
7.
金永杰 《核电子学与探测技术》1989,9(1):10-17
本文所提出的投影域重建——再投影迭代算法可以恢复不完整的扇形束投影数据,从而实现从有限的投影数据重建图象。这种算法把滤波——反投影图象重建过程和再投影的过程纳入一个公式,仅在投影域上估算未知的投影数据,因此避免了重建过程和反投影过程中的插值运算,改善了收敛性,提高了计算精度,缩短了运算时间。模拟实验表明:即使有70%的投影数据丢失,经过两次迭代就能以令人满意的精度恢复丢失的投影数据。 相似文献
8.
对《任意曲线透视投影的逆变换》中作出的以下3项研究结果进行了探讨并提出了不同见解:(1)透视投影的逆变换基本方程;(2)根据长方体上一个矩形的投影确定其长宽高之比;(3)由实体的透视图象准确重建其三维信息。 相似文献
9.
10.
In this paper we design a dynamic dictionary for
the priced information model initiated by Charikar et al. Assume that a set S consisting of n elements is given such that
each element has an associated price, a positive real number. The cost of performing an operation on elements of S is a function
of their prices. The cost of an algorithm is the sum of the costs of
all operations it performs. The objective is to design algorithms
which incur low cost. In this model we propose a dynamic dictionary, supporting
search, insert and delete, for keys drawn from a linearly ordered set.
As an application we show that the dictionary can be used in
computing the trapezoidal map of a set of line segments, a fundamental problem in
computational geometry. 相似文献