首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5334篇
  免费   565篇
  国内免费   368篇
电工技术   181篇
综合类   643篇
化学工业   278篇
金属工艺   249篇
机械仪表   547篇
建筑科学   284篇
矿业工程   113篇
能源动力   181篇
轻工业   128篇
水利工程   106篇
石油天然气   228篇
武器工业   52篇
无线电   397篇
一般工业技术   520篇
冶金工业   86篇
原子能技术   90篇
自动化技术   2184篇
  2024年   12篇
  2023年   55篇
  2022年   73篇
  2021年   77篇
  2020年   129篇
  2019年   144篇
  2018年   114篇
  2017年   141篇
  2016年   149篇
  2015年   185篇
  2014年   268篇
  2013年   359篇
  2012年   257篇
  2011年   392篇
  2010年   299篇
  2009年   345篇
  2008年   342篇
  2007年   376篇
  2006年   336篇
  2005年   307篇
  2004年   242篇
  2003年   190篇
  2002年   211篇
  2001年   165篇
  2000年   164篇
  1999年   113篇
  1998年   120篇
  1997年   97篇
  1996年   71篇
  1995年   72篇
  1994年   82篇
  1993年   64篇
  1992年   55篇
  1991年   49篇
  1990年   27篇
  1989年   36篇
  1988年   23篇
  1987年   19篇
  1986年   20篇
  1985年   22篇
  1984年   17篇
  1983年   20篇
  1982年   11篇
  1981年   5篇
  1980年   3篇
  1979年   3篇
  1978年   3篇
  1976年   1篇
  1966年   1篇
  1959年   1篇
排序方式: 共有6267条查询结果,搜索用时 15 毫秒
1.
In architectural design, surface shapes are commonly subject to geometric constraints imposed by material, fabrication or assembly. Rationalization algorithms can convert a freeform design into a form feasible for production, but often require design modifications that might not comply with the design intent. In addition, they only offer limited support for exploring alternative feasible shapes, due to the high complexity of the optimization algorithm.We address these shortcomings and present a computational framework for interactive shape exploration of discrete geometric structures in the context of freeform architectural design. Our method is formulated as a mesh optimization subject to shape constraints. Our formulation can enforce soft constraints and hard constraints at the same time, and handles equality constraints and inequality constraints in a unified way. We propose a novel numerical solver that splits the optimization into a sequence of simple subproblems that can be solved efficiently and accurately.Based on this algorithm, we develop a system that allows the user to explore designs satisfying geometric constraints. Our system offers full control over the exploration process, by providing direct access to the specification of the design space. At the same time, the complexity of the underlying optimization is hidden from the user, who communicates with the system through intuitive interfaces.  相似文献   
2.
根据三角旋转活塞发动机运动几何原理 ,详细分析了缸体型线。缸体的实际型线是双弧外摆线的等距曲线 ,并由此导出其数学表达式。本文进一步说明了两种几何运动实现方式 ,分析了参数的几何意义 ,并给出其表达式。  相似文献   
3.
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.  相似文献   
4.
A new stereological principle for test lines in three-dimensional space   总被引:2,自引:0,他引:2  
A new principle is presented to generate isotropic uniform random (IUR) test lines hitting a geometric structure in three-dimensional space (3D). The principle therefore concerns the estimation of surface area, volume, membrane thickness, etc., of arbitrary structures with piecewise smooth boundary. The principle states that a point-sampled test line on an isotropic plane through a fixed point in 3D is effectively an invariant test line in 3D. Particular attention is devoted to the stereology of particles, where an alternative to the surfactor method is obtained to estimate surface area. An interesting case arises when the particle is convex. The methods are illustrated with synthetic examples.  相似文献   
5.
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.  相似文献   
6.
小波变换用于影象分割的研究   总被引:3,自引:0,他引:3       下载免费PDF全文
将近年来兴起的小波理论应用于影象分割技术,提出了一种基于影象直方图小波变换的影象分割方法,并从理论上给出了使用该法所得分割门限的物理意义。实例表明,这种由粗到细引导的多分辨率分析方法,对于复杂影象的分割具有较强的鲁棒性和有效性,克服了传统分割方法中的参数需要人工确定的缺点。  相似文献   
7.
周培协三角剖分是否能得到最小权三角剖分,周培德在《周培德三角部分不是最小权三角剖分》一文撰写之前已有新的结论,本文还指出《周培德三角剖分不是最小权三角剖分》一文所举反例不成立。  相似文献   
8.
S Chattopadhyay  P P Das 《Sadhana》1993,18(2):349-364
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.  相似文献   
9.
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.  相似文献   
10.
网格曲面中孔洞的光滑填充算法研究   总被引:14,自引:0,他引:14  
三角网格模型是几何描述的一种重要形式,有着广泛的应用。但三角网络模型常常会存在孔洞缺陷。这些孔洞的存在一方面影响视觉效果,另一方面会影响许多后续的操作,如快速原型制造、有限元分析等,因此有必要对这些孔洞进行修补。目前绝大多数孔洞填充算法是将网格模型中的孔洞提取成空间多边形,并对孔洞多边形进行三角化。这种处理方法的主要缺陷是没有考虑网格曲面在孔洞附近的几何形态,因而填充部分不能与整个曲面光滑地融为一体。笔者提出了一种三角网格曲面中孔洞的光滑填充算法。该算法根据孔洞周围网格曲面的几何信息来增加孔洞内部的采样点,然后再对增加的采样点进行三角化,较好地解决了填充部分与整体曲面光滑连接的问题。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号