全文获取类型
收费全文 | 13587篇 |
免费 | 2165篇 |
国内免费 | 1576篇 |
专业分类
电工技术 | 984篇 |
技术理论 | 4篇 |
综合类 | 1568篇 |
化学工业 | 452篇 |
金属工艺 | 221篇 |
机械仪表 | 762篇 |
建筑科学 | 657篇 |
矿业工程 | 428篇 |
能源动力 | 336篇 |
轻工业 | 357篇 |
水利工程 | 319篇 |
石油天然气 | 375篇 |
武器工业 | 198篇 |
无线电 | 1353篇 |
一般工业技术 | 903篇 |
冶金工业 | 160篇 |
原子能技术 | 140篇 |
自动化技术 | 8111篇 |
出版年
2024年 | 62篇 |
2023年 | 256篇 |
2022年 | 369篇 |
2021年 | 422篇 |
2020年 | 559篇 |
2019年 | 446篇 |
2018年 | 418篇 |
2017年 | 459篇 |
2016年 | 539篇 |
2015年 | 587篇 |
2014年 | 918篇 |
2013年 | 838篇 |
2012年 | 1093篇 |
2011年 | 1113篇 |
2010年 | 897篇 |
2009年 | 954篇 |
2008年 | 1033篇 |
2007年 | 1146篇 |
2006年 | 840篇 |
2005年 | 841篇 |
2004年 | 663篇 |
2003年 | 588篇 |
2002年 | 421篇 |
2001年 | 341篇 |
2000年 | 285篇 |
1999年 | 221篇 |
1998年 | 165篇 |
1997年 | 150篇 |
1996年 | 128篇 |
1995年 | 93篇 |
1994年 | 77篇 |
1993年 | 80篇 |
1992年 | 67篇 |
1991年 | 33篇 |
1990年 | 35篇 |
1989年 | 30篇 |
1988年 | 18篇 |
1987年 | 20篇 |
1986年 | 6篇 |
1985年 | 13篇 |
1984年 | 17篇 |
1983年 | 14篇 |
1982年 | 11篇 |
1981年 | 8篇 |
1980年 | 11篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
针对现有海量点云可视化方法存在索引构建时间长、内存占用大等问题,研究一种八叉树索引结合OSG分页结点的快速可视化方法,可在占用较小内存的基础上快速建立点云索引并实时调度。采用八叉树索引结构对海量点云进行数据组织,建立各层级的八叉树结点并以文件映射的方式分块保存,对结点文件重组织转换为支持OSG渲染引擎的多分辨率点云数据。采用基于OSG分页结点的实时调度技术,对海量点云进行高质量可视化。与目前两款主流的点云数据处理商业软件进行实验对比分析,结果表明所提方法具有索引建立速度快、内存占用小等优点,同时可视化交互更加流畅,适用于各种配置计算机下海量点云数据的调度管理与实时可视化。 相似文献
2.
3.
4.
A lubrication-flow model for a free film in a corner is presented. The model, written in the hyperbolic coordinate system
ξ = x
2 −y
2, η = 2xy, applies to films that are thin in the η-direction. The lubrication approximation yields two coupled evolution equations
for the film thickness and the velocity field which, to lowest order, describes plug flow in the hyperbolic coordinates. A
free film in a corner evolving under surface tension and gravity is investigated. The rate of thinning of a free film is compared
to that of a film evolving over a solid substrate. Viscous shear and normal stresses are both captured in the model and are
computed for the entire flow domain. It is shown that normal stress dominates over shear stress in the far field, while shear
stress dominates close to the corner.
This revised version was published online in October 2005 with corrected page numbers. 相似文献
5.
Education-driven research in CAD 总被引:1,自引:0,他引:1
We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals. 相似文献
6.
Local Exact Particle Tracing on Unstructured Grids 总被引:1,自引:0,他引:1
For analyzing and interpreting results of flow simulations, particle tracing is a well established visualization method. In addition, it is a preliminary step for more advanced techniques such as line integral convolution. For interactive exploration of large data sets, a very efficient and reliable particle tracing method is needed. For wind channel experiments or flight simulations, large unstructured computational grids have become common practice. Traditional approachs, based on numerical integration methods of ordinary differential equations however fail to deliver sufficiently accurate path calculation at the speed required for interactive use. In this paper we extend the local exact approach of Nielson and Jung in such a way that it can be used for interactive particle tracing in large data sets of steady flow simulation experiments. This will be achieved by sophisticated preprocessing using additional memory. For further visual enhancement of the streamline we construct an implicitly defined smooth Bézier curve that is used for ray tracing. This allows us to visualize additional scalar values of the simulation as attributes to the trajectory and enables the display of high‐quality smooth curves without creating any visualization geometry and providing a good impression of the spatial situation at the same time. ACM CSS: I.3.3 Computer Graphics—Line and curve generation; I .3.7 Computer Graphics—Raytracing; G.1.2 Numerical Analysis—Spline and piecewise polynomial approximation 相似文献
7.
张鸿宾 《计算机应用与软件》1994,11(5):15-19,53
使用BP算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法,先构造决策树,然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长,它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果,本文的算法比用BP算法训练多层网络要快,而其分类精度不低于用BP算法训练的多层神经网。 相似文献
8.
Wang Jia-lu Department of Engineering Mechanics Tsinghua University Beijing P.R.ChinaSun Mao Lian Qi-xiang Institute of Fluid Mechanics Beijing University of Aeronautics Astronautics Beijing P.R.China 《水动力学研究与进展(B辑)》1993,(4)
The starting flow around a uniformly accelerated circular cylinder is investigatedby flow visualization techncque and solving N-S equations numerically in detail.The results ofthe starting flow are similar with those of the impulsively started one.At lower Re_α,numbers the“phenomenon a”is revealed;the“phenomenon β”appears at higher Re_α numbers,but withonly one secondary vortex.At the early stage of the starting vortex formation,the flow islaminar;at the later stage,the flow transforms into turbulent flow.The velocity distribution inthe flow field is measured with the multiwires installment.The calculational results are comparedwith the results of experiment,and both are in agreement with each other. 相似文献
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.