全文获取类型
收费全文 | 4069篇 |
免费 | 218篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 42篇 |
综合类 | 5篇 |
化学工业 | 1160篇 |
金属工艺 | 66篇 |
机械仪表 | 110篇 |
建筑科学 | 193篇 |
矿业工程 | 8篇 |
能源动力 | 148篇 |
轻工业 | 505篇 |
水利工程 | 24篇 |
石油天然气 | 13篇 |
无线电 | 267篇 |
一般工业技术 | 689篇 |
冶金工业 | 124篇 |
原子能技术 | 45篇 |
自动化技术 | 892篇 |
出版年
2024年 | 8篇 |
2023年 | 38篇 |
2022年 | 181篇 |
2021年 | 213篇 |
2020年 | 98篇 |
2019年 | 113篇 |
2018年 | 150篇 |
2017年 | 136篇 |
2016年 | 189篇 |
2015年 | 110篇 |
2014年 | 167篇 |
2013年 | 298篇 |
2012年 | 273篇 |
2011年 | 326篇 |
2010年 | 216篇 |
2009年 | 241篇 |
2008年 | 226篇 |
2007年 | 181篇 |
2006年 | 189篇 |
2005年 | 149篇 |
2004年 | 106篇 |
2003年 | 97篇 |
2002年 | 77篇 |
2001年 | 58篇 |
2000年 | 56篇 |
1999年 | 53篇 |
1998年 | 41篇 |
1997年 | 32篇 |
1996年 | 34篇 |
1995年 | 39篇 |
1994年 | 19篇 |
1993年 | 22篇 |
1992年 | 9篇 |
1991年 | 15篇 |
1990年 | 10篇 |
1989年 | 11篇 |
1988年 | 7篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 9篇 |
1984年 | 10篇 |
1983年 | 6篇 |
1982年 | 16篇 |
1981年 | 11篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1973年 | 3篇 |
排序方式: 共有4291条查询结果,搜索用时 15 毫秒
71.
Francesco Banterle Massimiliano Corsini Paolo Cignoni Roberto Scopigno 《Computer Graphics Forum》2012,31(1):19-32
In this work we present a new algorithm for accelerating the colour bilateral filter based on a subsampling strategy working in the spatial domain. The base idea is to use a suitable subset of samples of the entire kernel in order to obtain a good estimation of the exact filter values. The main advantages of the proposed approach are that it has an excellent trade‐off between visual quality and speed‐up, a very low memory overhead is required and it is straightforward to implement on the GPU allowing real‐time filtering. We show different applications of the proposed filter, in particular efficient cross‐bilateral filtering, real‐time edge‐aware image editing and fast video denoising. We compare our method against the state of the art in terms of image quality, time performance and memory usage. 相似文献
72.
73.
Roberto da Costa Quinino Linda Lee Ho Anderson Laécio Galindo Trindade 《The International Journal of Advanced Manufacturing Technology》2014,72(1-4):101-106
This paper presents an approach for improving the control limits of $ \overline{X} $ control charts when the parameters of the process are estimated and the control chart is in operation. In these conditions, the observed average run length (ARL) may be very different from the planned ARL since the parameter estimates may have a larger error. To minimize this problem, the data collected in effective control (phase 2) will be used to re-estimate the parameters with a precision greater than that obtained in phase 1. Thus, we defined a minimum sample size of observations of phase 2, which is constituted of a mixture of two normal distributions that should be used to re-estimate the process parameters. The proposal is illustrated with numerical example. 相似文献
74.
This study considers the content of the papers published by ASCE’s Journal of Management in Engineering, which has witnessed a growth in number of papers and breadth of participation, particularly of international origin, during the 1985–2002 period. The content is analyzed in two main dimensions: the type of subject and its composing topics, and the type of contributors to the journal. The analysis shows the evolution of the engineering management discipline as represented in the journal. Over the years the discipline has been enriched by an increasing number of contributions on corporate strategies and programs, organizational change, and cultures issues, as well as a growing interest in project management topics, such as quality planning and evaluation of alternative project delivery systems. The number of papers by practitioners, initially the largest contributing group to the journal, has declined significantly over the years. 相似文献
75.
76.
Roberto Canonico Maurizio D'Arienzo Simon Pietro Romano Giorgio Ventre 《Software》2003,33(10):901-911
A number of distributed applications require communication services with quality of service (QoS) guarantees. Building global‐scale distributed systems with predictable properties is one of the great challenges for computer systems engineering in the new century. Work undertaken within the Internet Engineering Task Force has led to the definition of novel architectural models for the Internet with QoS support. According to these models, the network has to be appropriately configured in order to provide applications with the required performance guarantees. In next‐generation networks, enabling applications to interact with the underlying QoS services is of primary importance. Hence, several special‐purpose application programming interfaces (APIs) have been defined to let applications negotiate QoS parameters across QoS‐capable networks. However, so far, none of these APIs are available in different operating environments. We believe that such features should be embedded in programming environments for distributed applications. In this work we present how we included QoS control features in Tcl, a programming language that has been widely adopted for the development of distributed multimedia applications. Our work has led to the implementation of QTcl, an extended Tcl interpreter that provides programmers with a new set of primitives, in full compliance with the standard SCRAPI programming interface for the RSVP protocol. QTcl in highly portable, in that it enables standard QoS negotiation to be performed in a seamless fashion on the most common operating systems. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
77.
We study the reachability problem for cryptographic protocols represented as processes relying on perfect cryptographic functions. We introduce a symbolic reduction system that can handle hashing functions, symmetric keys, and public keys. Desirable properties such as secrecy or authenticity are specified by inserting logical assertions in the processes.We show that the symbolic reduction system provides a flexible decision procedure for finite processes and a reference for sound implementations. The symbolic reduction system can be regarded as a variant of syntactic unification which is compatible with certain set-membership constraints. For a significant fragment of our formalism, we argue that a dag implementation of the symbolic reduction system leads to an algorithm running in nptime thus matching the lower bound of the problem.In the case of iterated or finite control processes, we show that the problem is undecidable in general and in ptime for a subclass of iterated processes that do not rely on pairing. Our technique is based on rational transductions of regular languages and it applies to a class of processes containing the ping-pong protocols studied in 1982 by Dolev, Even and Karp. 相似文献
78.
Roberto Guidorzi Author Vitae Roberto Diversi Author Vitae Author Vitae 《Automatica》2003,39(2):281-289
This paper deals with optimal (minimal variance) filtering in an errors-in-variables framework. Differently from many other contexts, errors-in-variables models treat all variables in a symmetric way (no partition of the variables into inputs and outputs is required) and assume additive noise on all the variables. The filtering technique described in this paper can be easily implemented in a recursive way and does not require the use of a Riccati equation at every update. The results of Monte Carlo simulations have shown the effectiveness and consistency of the approach. 相似文献
79.
A multistep iterative calibration methodology for the opto-mechanical system introduced in Part I is proposed. The methodology makes use of a monoview coplanar set of control points, whose number has been determined on the basis of both geometrical considerations and the results of a statistical analysis aiming at assessing the procedure stability in the case of noisy image data. The calibration procedure is carried out comparing the theoretical and observed images of the calibration pattern. Both synthetic and real data have been employed to test the calibration procedure, which proved to be accurate and efficient. The experimental results achieved by the calibrated system are satisfactory in terms of measurement precision. 相似文献
80.
Roberto Bagnara Roberta Gori Patricia M. Hill Enea Zaffanella 《Information and Computation》2004,193(2):84-116
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occurs-check) and increased expressivity (cyclic terms can provide very efficient representations of grammars and other useful objects). Unfortunately, the use of infinite rational trees has problems. For instance, many of the built-in and library predicates are ill-defined for such trees and need to be supplemented by run-time checks whose cost may be significant. Moreover, some widely used program analysis and manipulation techniques are correct only for those parts of programs working over finite trees. It is thus important to obtain, automatically, a knowledge of the program variables (the finite variables) that, at the program points of interest, will always be bound to finite terms. For these reasons, we propose here a new data-flow analysis, based on abstract interpretation, that captures such information. We present a parametric domain where a simple component for recording finite variables is coupled, in the style of the open product construction of Cortesi et al., with a generic domain (the parameter of the construction) providing sharing information. The sharing domain is abstractly specified so as to guarantee the correctness of the combined domain and the generality of the approach. This finite-tree analysis domain is further enhanced by coupling it with a domain of Boolean functions, called finite-tree dependencies, that precisely captures how the finiteness of some variables influences the finiteness of other variables. We also summarize our experimental results showing how finite-tree analysis, enhanced with finite-tree dependencies, is a practical means of obtaining precise finiteness information. 相似文献