全文获取类型
收费全文 | 1430篇 |
免费 | 60篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 35篇 |
综合类 | 4篇 |
化学工业 | 400篇 |
金属工艺 | 10篇 |
机械仪表 | 54篇 |
建筑科学 | 62篇 |
矿业工程 | 1篇 |
能源动力 | 78篇 |
轻工业 | 89篇 |
水利工程 | 5篇 |
无线电 | 140篇 |
一般工业技术 | 245篇 |
冶金工业 | 45篇 |
原子能技术 | 31篇 |
自动化技术 | 293篇 |
出版年
2023年 | 13篇 |
2022年 | 66篇 |
2021年 | 71篇 |
2020年 | 28篇 |
2019年 | 29篇 |
2018年 | 47篇 |
2017年 | 38篇 |
2016年 | 48篇 |
2015年 | 32篇 |
2014年 | 62篇 |
2013年 | 107篇 |
2012年 | 104篇 |
2011年 | 113篇 |
2010年 | 81篇 |
2009年 | 92篇 |
2008年 | 63篇 |
2007年 | 69篇 |
2006年 | 64篇 |
2005年 | 32篇 |
2004年 | 46篇 |
2003年 | 32篇 |
2002年 | 35篇 |
2001年 | 22篇 |
2000年 | 20篇 |
1999年 | 21篇 |
1998年 | 16篇 |
1997年 | 16篇 |
1996年 | 18篇 |
1995年 | 15篇 |
1994年 | 8篇 |
1993年 | 15篇 |
1992年 | 6篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 6篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1973年 | 2篇 |
1968年 | 2篇 |
1957年 | 1篇 |
排序方式: 共有1492条查询结果,搜索用时 15 毫秒
21.
Bertini E Tatu A Keim D 《IEEE transactions on visualization and computer graphics》2011,17(12):2203-2212
In this paper, we present a systematization of techniques that use quality metrics to help in the visual exploration of meaningful patterns in high-dimensional data. In a number of recent papers, different quality metrics are proposed to automate the demanding search through large spaces of alternative visualizations (e.g., alternative projections or ordering), allowing the user to concentrate on the most promising visualizations suggested by the quality metrics. Over the last decade, this approach has witnessed a remarkable development but few reflections exist on how these methods are related to each other and how the approach can be developed further. For this purpose, we provide an overview of approaches that use quality metrics in high-dimensional data visualization and propose a systematization based on a thorough literature review. We carefully analyze the papers and derive a set of factors for discriminating the quality metrics, visualization techniques, and the process itself. The process is described through a reworked version of the well-known information visualization pipeline. We demonstrate the usefulness of our model by applying it to several existing approaches that use quality metrics, and we provide reflections on implications of our model for future research. 相似文献
22.
23.
Giacomo Bucci Laura Carnevali Lorenzo Ridi Enrico Vicario 《International Journal on Software Tools for Technology Transfer (STTT)》2010,12(5):391-403
Oris is a tool for qualitative verification and quantitative evaluation of reactive timed systems, which supports modeling
and analysis of various classes of timed extensions of Petri Nets. As most characterizing features, Oris implements symbolic
state space analysis of preemptive Time Petri Nets, which enable schedulability analysis of real-time systems running under
priority preemptive scheduling; and stochastic Time Petri Nets, which enable an integrated approach to qualitative verification
and quantitative evaluation. In this paper, we present the current version of the tool and we illustrate its application to
two different case studies in the areas of qualitative verification and quantitative evaluation, respectively. 相似文献
24.
Given a set of products each with positive discrete demand, and a set of markets selling products at given prices, the traveling purchaser problem (TPP) looks for a tour visiting a subset of markets such that products demand is satisfied at minimum purchasing and traveling costs. In this paper we analyze a dynamic variant of the problem, where quantities may decrease as time goes on. Complete information is assumed on current state of the world, i.e. decision maker knows quantities available for each product in each market at present time and is informed about any consumption event when it occurs. Nevertheless, planner does not have any information on future events. Two groups of heuristics are described and compared. The first group consists of simplified approaches deciding which market to visit next on the basis of some greedy criteria considering only one of the two objective costs. The second one includes heuristics based on a look-ahead approach taking into account both traveling and purchasing costs and inserting some future prediction. Heuristics behavior has been tested on a large set of randomly generated instances under different levels of dynamism. 相似文献
25.
Alessandro Agnetis Enrico Grande Pitu B. Mirchandani Andrea Pacifici 《Computers & Operations Research》2009
The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the disc covering problem on a line. The cost of each sensor includes a fixed component f, and a variable component that is a convex function of the diameter of the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors, the problem becomes hard. A branch-and-bound algorithm as well as an efficient heuristic are developed for the special case in which the variable cost component of each sensor is proportional to the square of the measure of the field-of-view area. The heuristic very often obtains the optimal solution as shown in extensive computational testing. 相似文献
26.
J��r?me Schmid Jos�� A. Iglesias?Guiti��n Enrico Gobbetti Nadia Magnenat-Thalmann 《The Visual computer》2011,27(2):85-95
Despite the ability of current GPU processors to treat heavy parallel computation tasks, its use for solving medical image
segmentation problems is still not fully exploited and remains challenging. A lot of difficulties may arise related to, for
example, the different image modalities, noise and artifacts of source images, or the shape and appearance variability of
the structures to segment. Motivated by practical problems of image segmentation in the medical field, we present in this
paper a GPU framework based on explicit discrete deformable models, implemented over the NVidia CUDA architecture, aimed for
the segmentation of volumetric images. The framework supports the segmentation in parallel of different volumetric structures
as well as interaction during the segmentation process and real-time visualization of the intermediate results. Promising
results in terms of accuracy and speed on a real segmentation experiment have demonstrated the usability of the system. 相似文献
27.
We study the problem of guaranteeing correct execution semantics in parallel implementations of logic programming languages in presence of built-in constructs that are sensitive to order
of execution. The declarative semantics of logic programming languages permit execution of various goals in any arbitrary
order (including in parallel). However, goals corresponding to extra-logical built-in constructs should respect the sequential
order of execution to ensure correct semantics. Ensuring this correctness in presence of such built-in constructs, while efficiently
exploiting maximum parallelism, is a difficult problem. In this paper, we propose a formalization of this problem in terms
of operations on dynamic trees. This abstraction enables us to: (i) show that existing schemes to handle order-sensitive computations used in current parallel
systems are sub-optimal; (ii) develop a novel, optimal scheme to handle order-sensitive goals that requires only a constant time overhead per operation. While we present our results in the context of logic programming, they will apply equally well to
most parallel non-deterministic systems.
Received: 20 April 1998 / 3 April 2000 相似文献
28.
Berretti S. Del Bimbo A. Vicario E. 《IEEE transactions on pattern analysis and machine intelligence》2001,23(10):1089-1105
In retrieval from image databases, evaluation of similarity, based both on the appearance of spatial entities and on their mutual relationships, depends on content representation based on attributed relational graphs. This kind of modeling entails complex matching and indexing, which presently prevents its usage within comprehensive applications. In this paper, we provide a graph-theoretical formulation for the problem of retrieval based on the joint similarity of individual entities and of their mutual relationships and we expound its implications on indexing and matching. In particular, we propose the usage of metric indexing to organize large archives of graph models, and we propose an original look-ahead method which represents an efficient solution for the (sub)graph error correcting isomorphism problem needed to compute object distances. Analytic comparison and experimental results show that the proposed lookahead improves the state-of-the-art in state-space search methods and that the combined use of the proposed matching and indexing scheme permits for the management of the complexity of a typical application of retrieval by spatial arrangement 相似文献
29.
Algorithms for Moving Objects Databases 总被引:8,自引:0,他引:8
30.
Weighted walkthroughs between extended entities for retrieval by spatial arrangement 总被引:1,自引:0,他引:1
In the access to image databases, queries based on the appearing visual features of searched data reduce the gap between the user and the engineering representation. To support this access modality, image content can be modeled in terms of different types of features such as shape, texture, color, and spatial arrangement. An original framework is presented which supports quantitative nonsymbolic representation and comparison of the mutual positioning of extended nonrectangular spatial entities. Properties of the model are expounded to develop an efficient computation technique and to motivate and assess a metric of similarity for quantitative comparison of spatial relationships. Representation and comparison of binary relationships between entities is then embedded into a graph-theoretical framework supporting representation and comparison of the spatial arrangements of a picture. Two prototype applications are described. 相似文献