全文获取类型
收费全文 | 2381篇 |
免费 | 79篇 |
国内免费 | 33篇 |
专业分类
电工技术 | 28篇 |
综合类 | 100篇 |
化学工业 | 130篇 |
金属工艺 | 26篇 |
机械仪表 | 86篇 |
建筑科学 | 28篇 |
矿业工程 | 7篇 |
能源动力 | 63篇 |
轻工业 | 10篇 |
水利工程 | 10篇 |
石油天然气 | 2篇 |
武器工业 | 1篇 |
无线电 | 131篇 |
一般工业技术 | 128篇 |
冶金工业 | 28篇 |
原子能技术 | 9篇 |
自动化技术 | 1706篇 |
出版年
2022年 | 9篇 |
2021年 | 10篇 |
2020年 | 26篇 |
2019年 | 27篇 |
2018年 | 26篇 |
2017年 | 44篇 |
2016年 | 48篇 |
2015年 | 49篇 |
2014年 | 104篇 |
2013年 | 101篇 |
2012年 | 100篇 |
2011年 | 139篇 |
2010年 | 95篇 |
2009年 | 133篇 |
2008年 | 130篇 |
2007年 | 115篇 |
2006年 | 128篇 |
2005年 | 104篇 |
2004年 | 89篇 |
2003年 | 95篇 |
2002年 | 82篇 |
2001年 | 46篇 |
2000年 | 57篇 |
1999年 | 53篇 |
1998年 | 46篇 |
1997年 | 58篇 |
1996年 | 38篇 |
1995年 | 35篇 |
1994年 | 59篇 |
1993年 | 35篇 |
1992年 | 25篇 |
1991年 | 32篇 |
1990年 | 14篇 |
1989年 | 22篇 |
1988年 | 20篇 |
1987年 | 12篇 |
1986年 | 10篇 |
1985年 | 29篇 |
1984年 | 19篇 |
1983年 | 32篇 |
1982年 | 28篇 |
1981年 | 23篇 |
1980年 | 12篇 |
1979年 | 30篇 |
1978年 | 23篇 |
1977年 | 15篇 |
1976年 | 22篇 |
1975年 | 13篇 |
1974年 | 6篇 |
1973年 | 8篇 |
排序方式: 共有2493条查询结果,搜索用时 62 毫秒
91.
Inspired by recent work on robust and fast computation of 3D Local Reference Frames (LRFs), we propose a novel pipeline for coarse registration of 3D point clouds. Key to the method are: (i) the observation that any two corresponding points endowed with an LRF provide a hypothesis on the rigid motion between two views, (ii) the intuition that feature points can be matched based solely on cues directly derived from the computation of the LRF, (iii) a feature detection approach relying on a saliency criterion which captures the ability to establish an LRF repeatably. Unlike related work in literature, we also propose a comprehensive experimental evaluation based on diverse kinds of data (such as those acquired by laser scanners, Kinect and stereo cameras) as well as on quantitative comparison with respect to other methods. We also address the issue of setting the many parameters that characterize coarse registration pipelines fairly and realistically. The experimental evaluation vouches that our method can handle effectively data acquired by different sensors and is remarkably fast. 相似文献
92.
A tangent vector field on a surface is the generator of a smooth family of maps from the surface to itself, known as the flow. Given a scalar function on the surface, it can be transported, or advected, by composing it with a vector field's flow. Such transport is exhibited by many physical phenomena, e.g., in fluid dynamics. In this paper, we are interested in the inverse problem: given source and target functions, compute a vector field whose flow advects the source to the target. We propose a method for addressing this problem, by minimizing an energy given by the advection constraint together with a regularizing term for the vector field. Our approach is inspired by a similar method in computational anatomy, known as LDDMM, yet leverages the recent framework of functional vector fields for discretizing the advection and the flow as operators on scalar functions. The latter allows us to efficiently generalize LDDMM to curved surfaces, without explicitly computing the flow lines of the vector field we are optimizing for. We show two approaches for the solution: using linear advection with multiple vector fields, and using non‐linear advection with a single vector field. We additionally derive an approximated gradient of the corresponding energy, which is based on a novel vector field transport operator. Finally, we demonstrate applications of our machinery to intrinsic symmetry analysis, function interpolation and map improvement. 相似文献
93.
94.
This paper is concerned with semi-global stabilization of discrete-time linear periodic systems subject to actuator saturation. Provided that the open loop characteristic multipliers are within the closed unit circle, a low gain feedback design approach is proposed to solve the problem by state feedback. Our approach is based on the solution to a parametric discrete-time periodic Lyapunov equation. The proposed approaches not only generalize the corresponding results for time-invariant systems to periodic systems, but also reveal some important intrinsic properties of this class of periodic matrix equations. A numerical example is worked out to illustrate the effectiveness of the proposed approaches. 相似文献
95.
We present a new scheduling algorithm, called PL that is work-conserving and in terms of schedulability, optimal on multiprocessors for a synchronous periodic task set. The PL algorithm is a laxity based algorithm and ensures execution of a task with approximate proportional fairness at each task's period. Existing optimal algorithms on multiprocessors may cause excessive scheduling decisions and preemptions or may not be applied in a discrete environment. The proposed algorithm can be applied in a discrete environment and reduce the number of scheduling decisions and preemptions compared with a Pfair algorithm. 相似文献
96.
Justin Solomon Mirela Ben‐Chen Adrian Butscher Leonidas Guibas 《Computer Graphics Forum》2011,30(2):365-374
The discovery of meaningful parts of a shape is required for many geometry processing applications, such as parameterization, shape correspondence, and animation. It is natural to consider primitives such as spheres, cylinders and cones as the building blocks of shapes, and thus to discover parts by fitting such primitives to a given surface. This approach, however, will break down if primitive parts have undergone almost‐isometric deformations, as is the case, for example, for articulated human models. We suggest that parts can be discovered instead by finding intrinsic primitives, which we define as parts that posses an approximate intrinsic symmetry. We employ the recently‐developed method of computing discrete approximate Killing vector fields (AKVFs) to discover intrinsic primitives by investigating the relationship between the AKVFs of a composite object and the AKVFs of its parts. We show how to leverage this relationship with a standard clustering method to extract k intrinsic primitives and remaining asymmetric parts of a shape for a given k. We demonstrate the value of this approach for identifying the prominent symmetry generators of the parts of a given shape. Additionally, we show how our method can be modified slightly to segment an entire surface without marking asymmetric connecting regions and compare this approach to state‐of‐the‐art methods using the Princeton Segmentation Benchmark. 相似文献
97.
Özden Engin Çak?c? Harry Groenevelt Abraham SeidmannAuthor vitae 《Decision Support Systems》2011,51(4):842-852
Motivated by a case study at a radiology practice, we analyze the incremental benefits of RFID technology over barcodes for managing pharmaceutical inventories. Unlike barcode technology, RFID enables accurate real-time visibility, which in turn enables several process improvements. We analyze the impact of automatic counting and discuss the system redesign critical to optimizing the inventory policy and eliminating shrinkage. We show that continuous review is superior to periodic review whenever accurate real-time information is available at no additional cost. We explain how RFID-enabled strategies vary with inventory parameters and provide a cost-benefit analysis for the implementation of RFID for the radiology practice. 相似文献
98.
Quentin Mérigot 《Computer Graphics Forum》2011,30(5):1583-1592
In this paper, we propose an improvement of an algorithm of Aurenhammer, Hoffmann and Aronov to find a least square matching between a probability density and finite set of sites with mass constraints, in the Euclidean plane. Our algorithm exploits the multiscale nature of this optimal transport problem. We iteratively simplify the target using Lloyd's algorithm, and use the solution of the simplified problem as a rough initial solution to the more complex one. This approach allows for fast estimation of distances between measures related to optimal transport (known as Earth‐mover or Wasserstein distances). We also discuss the implementation of these algorithms, and compare the original one to its multiscale counterpart. 相似文献
99.
In this work, we address some issues related to products of graphs and products of modal logics. Our main contribution is the presentation of a necessary and sufficient condition for a countable and connected graph to be a product, using a property called intransitivity. We then proceed to describe this property in a logical language. First, we show that intransitivity is not modally definable and also that no necessary and sufficient condition for a graph to be a product can be modally definable. Then, we exhibit a formula in a hybrid language that describes intransitivity. With this, we get a logical characterization of products of graphs of arbitrary dimensions. We then use this characterization to obtain two other interesting results. First, we determine that it is possible to test in polynomial time, using a model-checking algorithm, whether a finite connected graph is a product. This test has cubic complexity in the size of the graph and quadratic complexity in its number of dimensions. Finally, we use this characterization of countable connected products to provide sound and complete axiomatic systems for a large class of products of modal logics. This class contains the logics defined by product frames obtained from Kripke frames that satisfy connectivity, transitivity and symmetry plus any additional property that can be defined by a pure hybrid formula. Most sound and complete axiomatic systems presented in the literature are for products of a pair of modal logics, while we are able, using hybrid logics, to provide sound and complete axiomatizations for many products of arbitrary dimensions. 相似文献
100.
Lorna Hardwick 《Computers and the Humanities》2000,34(3):279-295
The article offers a case study of the relationshipbetween current developments in Classical Studies andthe impact of computing and IT. The first sectionsummarises the main features of the Classical Studiesenvironment, especially the deep seated changes whichhave been taking place. These changes are then relatedto specific initiatives in Research, Teaching andLearning. The discussion is framed by a statement ofmicro-criteria for the evaluation of new developmentsand by reference to the macro-climate of debate aboutthe nature of cyberspace, especially the dichotomybetween conceptions of post-modern diversity and ofEnlightenment images of rational structures. It issuggested that these debates mirror those with whichthe discipline itself engages. 相似文献