全文获取类型
收费全文 | 1471篇 |
免费 | 36篇 |
国内免费 | 3篇 |
学科分类
工业技术 | 1510篇 |
出版年
2022年 | 8篇 |
2021年 | 14篇 |
2020年 | 12篇 |
2019年 | 16篇 |
2018年 | 19篇 |
2017年 | 28篇 |
2016年 | 23篇 |
2015年 | 18篇 |
2014年 | 36篇 |
2013年 | 88篇 |
2012年 | 55篇 |
2011年 | 75篇 |
2010年 | 73篇 |
2009年 | 82篇 |
2008年 | 87篇 |
2007年 | 82篇 |
2006年 | 82篇 |
2005年 | 75篇 |
2004年 | 54篇 |
2003年 | 68篇 |
2002年 | 57篇 |
2001年 | 25篇 |
2000年 | 23篇 |
1999年 | 29篇 |
1998年 | 27篇 |
1997年 | 29篇 |
1996年 | 33篇 |
1995年 | 41篇 |
1994年 | 21篇 |
1993年 | 28篇 |
1992年 | 18篇 |
1991年 | 15篇 |
1990年 | 18篇 |
1989年 | 22篇 |
1988年 | 10篇 |
1987年 | 11篇 |
1986年 | 14篇 |
1985年 | 11篇 |
1984年 | 9篇 |
1983年 | 10篇 |
1982年 | 10篇 |
1980年 | 6篇 |
1979年 | 3篇 |
1978年 | 8篇 |
1977年 | 4篇 |
1976年 | 10篇 |
1975年 | 4篇 |
1973年 | 5篇 |
1970年 | 4篇 |
1966年 | 2篇 |
排序方式: 共有1510条查询结果,搜索用时 15 毫秒
21.
Analysis of Two-Dimensional Non-Rigid Shapes 总被引:1,自引:0,他引:1
Alexander M. Bronstein Michael M. Bronstein Alfred M. Bruckstein Ron Kimmel 《International Journal of Computer Vision》2008,78(1):67-88
Analysis of deformable two-dimensional shapes is an important problem, encountered in numerous pattern recognition, computer
vision and computer graphics applications. In this paper, we address three major problems in the analysis of non-rigid shapes:
similarity, partial similarity, and correspondence. We present an axiomatic construction of similarity criteria for deformation-invariant
shape comparison, based on intrinsic geometric properties of the shapes, and show that such criteria are related to the Gromov-Hausdorff
distance. Next, we extend the problem of similarity computation to shapes which have similar parts but are dissimilar when
considered as a whole, and present a construction of set-valued distances, based on the notion of Pareto optimality. Finally,
we show that the correspondence between non-rigid shapes can be obtained as a byproduct of the non-rigid similarity problem.
As a numerical framework, we use the generalized multidimensional scaling (GMDS) method, which is the numerical core of the
three problems addressed in this paper. 相似文献
22.
Tal Nir Alfred M. Bruckstein Ron Kimmel 《International Journal of Computer Vision》2008,76(2):205-216
A novel optical flow estimation process based on a spatio-temporal model with varying coefficients multiplying a set of basis
functions at each pixel is introduced. Previous optical flow estimation methodologies did not use such an over parameterized
representation of the flow field as the problem is ill-posed even without introducing any additional parameters: Neighborhood
based methods of the Lucas–Kanade type determine the flow at each pixel by constraining the flow to be described by a few
parameters in small neighborhoods. Modern variational methods represent the optic flow directly via the flow field components
at each pixel. The benefit of over-parametrization becomes evident in the smoothness term, which instead of directly penalizing
for changes in the optic flow, accumulates a cost of deviating from the assumed optic flow model. Our proposed method is very
general and the classical variational optical flow techniques are special cases of it, when used in conjunction with constant
basis functions. Experimental results with the novel flow estimation process yield significant improvements with respect to
the best results published so far. 相似文献
23.
Ron van der Meyden 《Information and Computation》1998,140(2):115
Logics of knowledge have been shown to provide a useful approach to the high level specification and analysis of distributed systems. It has been proposed that such systems can be developed using knowledge- based protocols, in which agents' actions have preconditions that test their state of knowledge. Both computer-assisted analysis of the knowledge properties of systems and automated compilation of knowledge-based protocols require the development of algorithms for the computation of states of knowledge. This paper studies one of the computational problems of interest, the model checking problem for knowledge formulae in the S5nKripke structures generated by finite state environments in which states determine an observation for each agent. Agents are assumed to have perfect recall and may operate synchronously or asynchronously. It is shown that, in this setting, model checking of common knowledge formulae is intractable, but efficient incremental algorithms are developed for formulae containing only knowledge operators. Connections to knowledge updates and compilation of knowledge-based protocols are discussed. 相似文献
24.
The first measurement of a turnover rate with respect to surface intermediate concentration in a high pressure heterogeneous catalytic reaction is reported. By using infrared-visible sum frequency generation to study the hydrogenation of ethylene on Pt(111), it was found that the surface concentration of -bonded ethylene, the key reaction intermediate, represented approximately 4% of a monolayer. Thus the absolute turnover rate per surface adsorbed ethylene molecule is 25 times faster than the rate measured per platinum atom. To explain these results, we propose a model of weakly adsorbed ethylene intermediates reacting on atop sites. 相似文献
25.
Ron Koster Albert C. Van der Woerd Wouter A. Serdijn Jan Davidse Arthur H. M. Van Roermund 《Analog Integrated Circuits and Signal Processing》1996,9(3):207-214
In this paper design rules for a circuit topology in which there is an inseparable combination of an amplifier and a filter characteristic, are presented. By intentionally using the capacitance of an already present input sensor for the filtering, the total required integrated capacitance is much less than that in circuits, which have a separately designed amplifier and filter function. Consequently, it is possible to have the advantage of a better integratability. Moreover, less complexity in the design is achieved. The presented circuit shows a current-to-voltage conversion and an inherently controllable second-order low-pass filter characteristic. A discrete realization has been designed to test the circuit. This circuit operates down to a 1 V supply voltage and the transfer shows a 1.8 M currentto-voltage conversion with a bandwidth of 6 kHz. Measurement results of this circuit show that a 63 dB dynamic range can be achieved with a total required integrated capacitance of only 31 pF. 相似文献
26.
Ron Martin说:新技术是现代工业网络中的信息技术(IT)和操作技术(OT)的界限越来越模糊。因此,各方组织机构正在寻找能够监控他们以太网网络的新方法。 相似文献
27.
28.
29.
Marc Secanell Ron Songprakorp Ned Djilali Afzal Suleman 《Structural and Multidisciplinary Optimization》2010,40(1-6):563-583
A computational framework for fuel cell analysis and optimization is presented as an innovative alternative to the time consuming trial-and-error process currently used for fuel cell design. The framework is based on a two-dimensional through-the-channel isothermal, isobaric and single phase membrane electrode assembly (MEA) model. The model input parameters are the manufacturing parameters used to build the MEA: platinum loading, platinum to carbon ratio, electrolyte content and gas diffusion layer porosity. The governing equations of the fuel cell model are solved using Netwon’s algorithm and an adaptive finite element method in order to achieve near quadratic convergence and a mesh independent solution respectively. The analysis module is used to solve the optimization problem of finding the optimal MEA composition for maximizing performance. To solve the optimization problem a gradient-based optimization algorithm is used in conjunction with analytical sensitivities. By using a gradient-based method and analytical sensitivities, the framework presented is capable of solving a complete MEA optimization problem with state-of-the-art electrode models in approximately 30 min, making it a viable alternative for solving large-scale fuel cell problems. 相似文献
30.
Matching with don't-cares and a small number of mismatches 总被引:1,自引:0,他引:1
In matching with don't-cares and k mismatches we are given a pattern of length m and a text of length n, both of which may contain don't-cares (a symbol that matches all symbols), and the goal is to find all locations in the text that match the pattern with at most k mismatches, where k is a parameter. We present new algorithms that solve this problem using a combination of convolutions and a dynamic programming procedure. We give randomized and deterministic solutions that run in time O(nk2logm) and O(nk3logm), respectively, and are faster than the most efficient extant methods for small values of k. Our deterministic algorithm is the first to obtain an O(polylog(k)⋅nlogm) running time. 相似文献