全文获取类型
收费全文 | 1479篇 |
免费 | 183篇 |
国内免费 | 137篇 |
专业分类
电工技术 | 94篇 |
综合类 | 149篇 |
化学工业 | 30篇 |
金属工艺 | 69篇 |
机械仪表 | 143篇 |
建筑科学 | 55篇 |
矿业工程 | 14篇 |
能源动力 | 7篇 |
轻工业 | 14篇 |
水利工程 | 12篇 |
石油天然气 | 108篇 |
武器工业 | 3篇 |
无线电 | 122篇 |
一般工业技术 | 126篇 |
冶金工业 | 20篇 |
原子能技术 | 1篇 |
自动化技术 | 832篇 |
出版年
2023年 | 7篇 |
2022年 | 17篇 |
2021年 | 15篇 |
2020年 | 19篇 |
2019年 | 22篇 |
2018年 | 28篇 |
2017年 | 34篇 |
2016年 | 37篇 |
2015年 | 69篇 |
2014年 | 91篇 |
2013年 | 69篇 |
2012年 | 115篇 |
2011年 | 136篇 |
2010年 | 99篇 |
2009年 | 122篇 |
2008年 | 114篇 |
2007年 | 127篇 |
2006年 | 107篇 |
2005年 | 113篇 |
2004年 | 90篇 |
2003年 | 81篇 |
2002年 | 69篇 |
2001年 | 44篇 |
2000年 | 34篇 |
1999年 | 26篇 |
1998年 | 20篇 |
1997年 | 18篇 |
1996年 | 9篇 |
1995年 | 10篇 |
1994年 | 14篇 |
1993年 | 11篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 1篇 |
排序方式: 共有1799条查询结果,搜索用时 15 毫秒
1.
CRAFT is a tweakable block cipher introduced in 2019 that aims to provide strong protection against differential fault analysis. In this paper, we show that CRAFT is vulnerable to side-channel cube attacks. We apply side-channel cube attacks to CRAFT with the Hamming weight leakage assumption. We found that the first half of the secret key can be recovered from the Hamming weight leakage after the first round. Next, using the recovered key bits, we continue our attack to recover the second half of the secret key. We show that the set of equations that are solvable varies depending on the value of the key bits. Our result shows that 99.90% of the key space can be fully recovered within a practical time. 相似文献
2.
空间数据立方体的物化视图选择方法研究 总被引:1,自引:0,他引:1
针对决策支持系统(DSS)中集成空间分析能力的应用趋势,研究基于空间数据仓库的一种决策分析工具——空间在线分析处理(Spatial OLAP),拟解决影响空间OLAP在线响应的瓶颈难点——空间数据立方体的物化问题。首先系统地提出空间OLAP的模型,然后对现有空间度量物化视图选择方法进行改进,提出了双向空间Greedy算法。实验证明.该算法在降低选择时间和求解质量两方面具有更好的表现。 相似文献
3.
Computing surfaces invariant under subdivision 总被引:3,自引:0,他引:3
In this paper, we propose a general subdivision algorithm for generating surfaces. The algorithm has as motivation our earlier work on the design of free form curves where similar ideas were investigated. Here we describe some properties of uniform refinement algorithms for surface generation. A detail analysis of their properties will be given later by one of us. 相似文献
4.
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. 相似文献
5.
Seth Green George Turkiyyah 《International journal for numerical methods in engineering》2004,61(3):380-405
We present a new method for enforcing boundary conditions within subdivision finite element simulations of thin shells. The proposed framework is demonstrated to be second-order accurate with respect to increasing refinement in the displacement and energy norm for simply supported, clamped, free and symmetric boundary conditions. Second-order accuracy on the boundary is consistent with the accuracy of subdivision-based approaches for the interior of a body. Our proposed framework is applicable to both triangular and quadrilateral refinement schemes, and does not impose any topological requirements upon the underlying subdivision control mesh. Several examples from an obstacle course of benchmark problems are used to demonstrate the convergence of the scheme. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
6.
本文介绍了我国制冷空调用铜管的质量标准:GB/T17791-1999《空调与制冷用无缝铜管》、YS/T440-2001《内螺纹铜管》、GB/T1531-1994《铜及铜合金毛细管》以及《冰箱用高清洁度铜管》和《铜及铜合金无缝翅片管》的制订背景,分析了标准水平,提出了制冷空调用铜管在满足标准的同时,还要加强实物质量的提升。 相似文献
7.
改进的第三代相干算法及应用 总被引:1,自引:0,他引:1
在讨论相干技术发展及三代相干算法优缺点的基础上,介绍了改进的第三代相干算法。应用自行开发的相干软件对多个油气勘探和开发区块的三维地震资料进行处理、分析,对相干时窗长度、相关道数等参数对算法效果的影响及相干体对断层、异常地质体的识别,以及解释方法进行了探讨。应用实例证明,改进的第三代相干算法抗干扰能力强,横向分辨率高,不仅适用于倾斜地层,而且对断层尤其对小断层、异常地质体具有较高的检测能力,是油气勘探和开发的一项有效和实用的技术。 相似文献
8.
Michael H. Brill 《Color research and application》2002,27(6):421-424
A simple algorithm (amenable to spreadsheets) is described for plotting a luminance contour map of the color gamut of an additive‐primary display given the chromaticities of its primaries and screen white. Each contour of the plot represents (in either r,g or x,y coordinates) the polygon of intersection of the RGB cube with a plane of constant Y. Each vertex on a contour is an intersection of 1 of the 12 edges of the RGB cube with the constant‐Y plane. Feasibility of an edge as a vertex of the polygon is tested through comparison of the computed r,g coordinates with functions of the luminosity coefficients of the primaries. By ordering the RGB‐cube edges in a particular way prior to scanning them for feasibility, one is guaranteed to retrieve the vertices of any constant‐Y polygon in convex order. This fact facilitates plotting of the polygons. 相似文献
9.
Adaptive generation of surfaces in volume data 总被引:1,自引:1,他引:0
A widespread approach to generating polygonal approximations of iso-surfaces or contour surfaces in volume data is the socalled marching-cubes algorithm. This algorithm, however, has the disadvantage that the number of polygonal chains generated is considerable. The splitting-box algorithm presented here reduces the number of polygonal chains by adapting their size to the shape of the surface. The resulting polygonal chains offer a wide spectrum for representing the contour surface. An exact representation is achieved by a new type of generic patches calculated from the polygonal chains. Approximations of different quality may be obtained by combining the algorithm generating the patches with simple triangulations. 相似文献
10.
Ray tracing has been shown to be an excellent technique for rendering realistic images. However, it is important to reduce the lengthy computation time resulting from the brute-force nature of the original ray-tracing algorithms. In this paper, two ideas are proposed to speep up the well-known hierarchical subdivision method. First, a new hierarchy traversal scheme is described to reduce the number of raybounding volume intersection tests for secondary rays. Then, a plane-sweep method is proposed to make fewer intersection checks for eye rays. Experiments and discussions are presented to prove the feasibility of our methods. 相似文献