全文获取类型
收费全文 | 2569篇 |
免费 | 100篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 51篇 |
综合类 | 4篇 |
化学工业 | 637篇 |
金属工艺 | 39篇 |
机械仪表 | 54篇 |
建筑科学 | 81篇 |
能源动力 | 95篇 |
轻工业 | 191篇 |
水利工程 | 14篇 |
石油天然气 | 8篇 |
无线电 | 232篇 |
一般工业技术 | 481篇 |
冶金工业 | 249篇 |
原子能技术 | 17篇 |
自动化技术 | 519篇 |
出版年
2024年 | 4篇 |
2023年 | 23篇 |
2022年 | 39篇 |
2021年 | 71篇 |
2020年 | 33篇 |
2019年 | 55篇 |
2018年 | 67篇 |
2017年 | 63篇 |
2016年 | 74篇 |
2015年 | 79篇 |
2014年 | 94篇 |
2013年 | 135篇 |
2012年 | 146篇 |
2011年 | 202篇 |
2010年 | 140篇 |
2009年 | 141篇 |
2008年 | 142篇 |
2007年 | 119篇 |
2006年 | 125篇 |
2005年 | 105篇 |
2004年 | 100篇 |
2003年 | 58篇 |
2002年 | 73篇 |
2001年 | 57篇 |
2000年 | 36篇 |
1999年 | 47篇 |
1998年 | 90篇 |
1997年 | 67篇 |
1996年 | 48篇 |
1995年 | 46篇 |
1994年 | 32篇 |
1993年 | 25篇 |
1992年 | 18篇 |
1991年 | 13篇 |
1990年 | 13篇 |
1989年 | 11篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1977年 | 3篇 |
1976年 | 11篇 |
1975年 | 3篇 |
1970年 | 3篇 |
1968年 | 3篇 |
1948年 | 2篇 |
排序方式: 共有2672条查询结果,搜索用时 15 毫秒
31.
Fethallah Benmansour Laurent D. Cohen 《Journal of Mathematical Imaging and Vision》2009,33(2):209-221
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the minimal
path approach. First, an initial point on the desired contour is chosen by the user. Next, new keypoints are detected automatically
using a front propagation approach. We assume that the desired object has a closed boundary. This a-priori knowledge on the
topology is used to devise a relevant criterion for stopping the keypoint detection and front propagation. The final domain
visited by the front will yield a band surrounding the object of interest. Linking pairs of neighboring keypoints with minimal
paths allows us to extract a closed contour from a 2D image. This approach can also be used for finding an open curve giving
extra information as stopping criteria. Detection of a variety of objects on real images is demonstrated. Using a similar
idea, we can extract networks of minimal paths from a 3D image called Geodesic Meshing. The proposed method is applied to
3D data with promising results.
相似文献
Laurent D. CohenEmail: |
32.
Andrew Brampton Andrew MacQuire Michael Fry Idris A. Rai Nicholas J. P. Race Laurent Mathy 《Multimedia Systems》2009,15(1):3-17
This paper presents a detailed characterisation of user behaviour for a series of interactive video experiments over a 12
month period, in which we served popular sporting and musical content. In addition to generic VCR-like features, our custom-built
video-on-demand application provides advanced interactivity features such as bookmarking. The dramatic impact of such functionality
on how users consume content is studied and analysed. We discuss in detail how this user behaviour can be exploited by content
distributors to improve user experience. Specifically, we study how simple dynamic bookmark placement and interactivity-aware
content pre-fetching and replication can reduce the impact of highly interactive media on CDN performance. 相似文献
33.
Tegawendé F. Bissyandé Laurent Réveillère Julia L. Lawall Gilles Muller 《Automated Software Engineering》2016,23(1):3-41
The Linux kernel does not export a stable, well-defined kernel interface, complicating the development of kernel-level services, such as device drivers and file systems. While there does exist a set of functions that are exported to external modules, this set of functions frequently changes, and the functions have implicit, ill-documented preconditions. No specific debugging support is provided. We present Diagnosys, an approach to automatically constructing a debugging interface for the Linux kernel. First, a designated kernel maintainer uses Diagnosys to identify constraints on the use of the exported functions. Based on this information, developers of kernel services can then use Diagnosys to generate a debugging interface specialized to their code. When a service including this interface is tested, it records information about potential problems. This information is preserved following a kernel crash or hang. Our experiments show that the generated debugging interface provides useful log information and incurs a low performance penalty. 相似文献
34.
35.
Simultaneous automated design of structured QFT controller and prefilter using nonlinear programming 下载免费PDF全文
Harsh Purohit Alexandre Goldsztejn Christophe Jermann Laurent Granvilliers Frédéric Goualard P. S. V. Nataraj Bhagyesh Patil 《国际强度与非线性控制杂志
》2017,27(15):2529-2548
》2017,27(15):2529-2548
This paper describes a nonlinear programming‐based robust design methodology for controllers and prefilters of a predefined structure for the linear time‐invariant systems involved in the quantitative feedback theory. This controller and prefilter synthesis problem is formulated as a single optimization problem with a given performance optimization objective and constraints enforcing stability and various specifications usually enforced in the quantitative feedback theory. The focus is set on providing constraints expression that can be used in standard nonlinear programming solvers. The nonlinear solver then computes in a single‐step controller and prefilter design parameters that satisfy the prescribed constraints and maximizes the performance optimization objective. The effectiveness of the proposed approach is demonstrated through a variety of difficult design cases like resonant plants, open‐loop unstable plants, and plants with variation in the time delay. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
36.
We address the problem of state observation for a system whose dynamics may involve poorly known, perhaps even nonlocally Lipschitz functions and whose output measurement may be corrupted by noise. It is known that one way to cope with all these uncertainties and noise is to use a high-gain observer with a gain adapted on-line. The proposed method, while presented for a particular case, relies on a “generic” analysis tool based on the study of differential inequalities involving quadratic functions of the error system in two coordinate frames plus the gain adaptation law. We establish that, for bounded system solutions, the estimated state and the gain are bounded. Moreover, we provide an upper bound for the mean value of the error signals as a function of the observer parameters. Since due to perturbations the gain adaptation law may drive the observer/plant interconnection to nearby boundary of its stability region, oscillatory behavior may emerge. To overcome this issue, we suggest an adaptive procedure based on a space averaging technique involving several copies of the observer. 相似文献
37.
Justine LebrunPhilippe-Henri Gosselin Sylvie Philipp-Foliguet 《Image and vision computing》2011,29(11):716-729
In the framework of online object retrieval with learning, we address the problem of graph matching using kernel functions. An image is represented by a graph of regions where the edges represent the spatial relationships. Kernels on graphs are built from kernel on walks in the graph. This paper firstly proposes new kernels on graphs and on walks, which are very efficient for graphs of regions. Secondly we propose fast solutions for exact or approximate computation of these kernels. Thirdly we show results for the retrieval of images containing a specific object with the help of very few examples and counter-examples in the framework of an active retrieval scheme. 相似文献
38.
Since wavelets were introduced in the radiosity algorithm 5 , surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previous study 13 has shown that wavelet radiosity, and especially higher order wavelet radiosity was not bringing significant improvements over hierarchical radiosity and was having a very important extra memory cost, thus prohibiting any effective computation. In this paper, we present a new implementation of wavelets in the radiosity algorithm, that is substantially different from previous implementations in several key areas (refinement oracle, link storage, resolution algorithm). We show that, with this implementation, higher order wavelets are actually bringing an improvement over standard hierarchical radiosity and lower order wavelets. 相似文献
39.
The design of robotic mechanisms is a complex process involving geometric, kinematic, dynamic, tolerance, and stress analyses. In the design of a real system, the construction of a physical prototype is often considered. Indeed, a physical prototype helps the designer to identify the fundamental characteristics and the potential pitfalls of the proposed architecture. However, the design and fabrication of a prototype using traditional techniques is rather long, tedious, and costly. In this context, the availability of rapid prototyping machines can be exploited in order to allow designers of robotic mechanisms to build prototypes rapidly and at a low cost. In the article, the rapid prototyping of mechanisms using a commercially available computer-aided design (CAD) package and a fused deposition modeling (FDM) rapid prototyping machine is presented. A database of lower kinematic pairs (joints) is developed using the CAD package, and parameters of fabrication are determined experimentally for each of the joints. These joints are then used in the design of the prototypes where the links are developed and adapted to the particular geometries of the mechanisms to be built. Also, a procedure is developed to build gears and Geneva mechanisms. Examples of mechanisms are then studied and their design is presented. For each mechanism, the joints are described and the design of the links is discussed. Some of the physical prototypes built using the FDM rapid prototyping machine are shown 相似文献
40.
D. Laurent J. Lechtenbörger N. Spyratos G. Vossen 《The VLDB Journal The International Journal on Very Large Data Bases》2001,10(4):295-315
Views over databases have regained attention in the context of data warehouses, which are seen as materialized views. In this setting, efficient view maintenance is an important issue, for which the notion of self-maintainability has been identified as desirable. In this paper, we extend the concept of self-maintainability to (query and update) independence within a formal framework, where independence with respect to arbitrary given sets of queries and updates over the sources
can be guaranteed. To this end we establish an intuitively appealing connection between warehouse independence and view complements. Moreover, we study special kinds of complements, namely monotonic complements, and show how to compute minimal ones in the presence of keys and foreign keys in the underlying databases. Taking advantage
of these complements, an algorithmic approach is proposed for the specification of independent warehouses with respect to
given sets of queries and updates.
Received: 21 November 2000 / Accepted: 1 May 2001 Published online: 6 September 2001 相似文献