全文获取类型
收费全文 | 328篇 |
免费 | 15篇 |
国内免费 | 18篇 |
专业分类
电工技术 | 7篇 |
综合类 | 6篇 |
化学工业 | 20篇 |
金属工艺 | 10篇 |
机械仪表 | 21篇 |
建筑科学 | 16篇 |
矿业工程 | 1篇 |
能源动力 | 8篇 |
轻工业 | 5篇 |
水利工程 | 1篇 |
石油天然气 | 3篇 |
无线电 | 25篇 |
一般工业技术 | 25篇 |
原子能技术 | 10篇 |
自动化技术 | 203篇 |
出版年
2023年 | 2篇 |
2022年 | 10篇 |
2021年 | 10篇 |
2020年 | 5篇 |
2019年 | 2篇 |
2018年 | 3篇 |
2017年 | 13篇 |
2016年 | 12篇 |
2015年 | 13篇 |
2014年 | 14篇 |
2013年 | 33篇 |
2012年 | 17篇 |
2011年 | 20篇 |
2010年 | 18篇 |
2009年 | 18篇 |
2008年 | 19篇 |
2007年 | 20篇 |
2006年 | 33篇 |
2005年 | 10篇 |
2004年 | 10篇 |
2003年 | 7篇 |
2002年 | 12篇 |
2001年 | 4篇 |
2000年 | 8篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 4篇 |
1988年 | 2篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1978年 | 1篇 |
排序方式: 共有361条查询结果,搜索用时 15 毫秒
1.
In this paper, we investigate the approximation of completely resonant nonlinear wave systems via deterministic learning. The plants are distributed parameter systems (DPS) describing homogeneous and isotropic elastic vibrating strings with fixed endpoints. The purpose of the paper is to approximate the infinite-dimensional dynamics, rather than the parameters of the wave systems. To solve the problem, the wave systems are first transformed into finite-dimensional dynamical systems described by ordinary differential equation (ODE). The properties of the finite-dimensional systems, including the convergence of the solution, as well as the dominance of partial system dynamics according to point-wise measurements, are analyzed. Based on the properties, second, by using the deterministic learning algorithm, an approximately accurate neural network (NN) approximation of the the finite-dimensional system dynamics is achieved in a local region along the recurrent trajectories. Simulation studies are included to demonstrate the effectiveness of the proposed approach. 相似文献
2.
In this paper, we investigate state estimations of a dynamical system in which not only process and measurement noise, but also parameter uncertainties and deterministic input signals are involved. The sensitivity penalization based robust state estimation is extended to uncertain linear systems with deterministic input signals and parametric uncertainties which may nonlinearly affect a state-space plant model. The form of the derived robust estimator is similar to that of the well-known Kalman filter with a comparable computational complexity. Under a few weak assumptions, it is proved that though the derived state estimator is biased, the bound of estimation errors is finite and the covariance matrix of estimation errors is bounded. Numerical simulations show that the obtained robust filter has relatively nice estimation performances. 相似文献
3.
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate the increase in power, in terms of language recognition, of a classical Deterministic Finite Automaton (DFA) when endowed with the facility of interference. The question is in the spirit of Two-Way Finite Automata With Quantum and Classical States (2QCFA) [A. Ambainis, J. Watrous, Two-way finite automata with quantum and classical states, Theoret. Comput. Sci. 287 (1) (2002) 299–311] wherein the classical DFA is augmented with a quantum component of constant size. We test the power of 2OIA against the languages mentioned in the above paper. We give efficient 2OIA algorithms to recognize languages for which 2QCFA machines have been shown to exist, as well as languages whose status vis-a-vis 2QCFA has been posed as open questions. Having a DFA as a component, it trivially recognizes regular languages. We show that our model can recognize all languages recognized by 1-way deterministic blind counter automata. Finally we show the existence of a language that cannot be recognized by a 2OIA but which can be recognized by an O(n3) space Turing machine. 相似文献
4.
Jan Rosell Carlos Vázquez Alexander Pérez Pedro Iñiguez 《Journal of Intelligent and Robotic Systems》2008,53(3):223-245
Haptic devices allow a user to feel either reaction forces from virtual interactions or reaction forces reflected from a remote
site during a bilateral teleoperation task. Also, guiding forces can be exerted to train the user in the performance of a
virtual task or to assist him/her to safely teleoperate a robot. The generation of guiding forces relies on the existence
of a motion plan that provides the direction to be followed to reach the goal from any free configuration of the configuration
space (-space). This paper proposes a method to obtain such a plan that interleaves a sampling-based exploration of -space with an efficient computation of harmonic functions. A deterministic sampling sequence (with a bias based on harmonic
function values) is used to obtain a hierarchical cell decomposition model of -space. A harmonic function is iteratively computed over the partially known model using a novel approach. The harmonic function
is the navigation function used as motion plan. The approach has been implemented in a planner (called the Kautham planner) that, given an initial and a goal configuration, provides: (a) a channel of cells connecting the cell that contains
the initial configuration with the cell that contains the goal configuration; (b) two harmonic functions over the whole -space, one that guides motions towards the channel and another that guides motions within the channel towards the goal; and
(c) a path computed over a roadmap built with the free samples of the channel. The harmonic functions and the solution path
are then used to generate the guiding forces for the haptic device. The planning approach is illustrated with examples on
2D and 3D workspaces.
This work was partially supported by the CICYT projects DPI2005-00112 and DPI2007-63665. 相似文献
5.
The eigenvector associated with the smallest eigenvalue of the autocorrelation matrix of input signals is called minor component. Minor component analysis (MCA) is a statistical approach for extracting minor component from input signals and has been applied in many fields of signal processing and data analysis. In this letter, we propose a neural networks learning algorithm for estimating adaptively minor component from input signals. Dynamics of the proposed algorithm are analyzed via a deterministic discrete time (DDT) method. Some sufficient conditions are obtained to guarantee convergence of the proposed algorithm. 相似文献
6.
Katalin Friedl Gábor Ivanyos Miklos Santha Yves F. Verhoeven 《Theory of Computing Systems》2009,45(3):629-646
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give
a deterministic algorithm for Sperner problems over pseudo-manifolds of arbitrary dimension. The query complexity of our algorithm
is linear in the separation number of the skeleton graph of the manifold and the size of its boundary. As a corollary we get
an
deterministic query algorithm for the black-box version of the problem 2D-SPERNER, a well studied member of Papadimitriou’s complexity class PPAD. This upper bound matches the
deterministic lower bound of Crescenzi and Silvestri. The tightness of this bound was not known before. In another result
we prove for the same problem an
lower bound for its probabilistic, and an
lower bound for its quantum query complexity, showing that all these measures are polynomially related.
Research supported by the European Commission IST Integrated Project Qubit Application (QAP) 015848, the OTKA grants T42559
and T46234, and by the ANR Blanc AlgoQP grant of the French Research Ministry. 相似文献
7.
8.
We develop theory on the efficiency of identifying (learning) timed automata. In particular, we show that: (i) deterministic timed automata cannot be identified efficiently in the limit from labeled data and (ii) that one-clock deterministic timed automata can be identified efficiently in the limit from labeled data. We prove these results based on the distinguishability of these classes of timed automata. More specifically, we prove that the languages of deterministic timed automata cannot, and that one-clock deterministic timed automata can be distinguished from each other using strings in length bounded by a polynomial. In addition, we provide an algorithm that identifies one-clock deterministic timed automata efficiently from labeled data.Our results have interesting consequences for the power of clocks that are interesting also out of the scope of the identification problem. 相似文献
9.
Yingda Cheng Irene M. Gamba Armando Majorana Chi-Wang Shu 《Computer Methods in Applied Mechanics and Engineering》2009,198(37-40):3130-3150
In this paper, we present results of a discontinuous Galerkin (DG) scheme applied to deterministic computations of the transients for the Boltzmann–Poisson system describing electron transport in semiconductor devices. The collisional term models optical-phonon interactions which become dominant under strong energetic conditions corresponding to nano-scale active regions under applied bias. The proposed numerical technique is a finite element method using discontinuous piecewise polynomials as basis functions on unstructured meshes. It is applied to simulate hot electron transport in bulk silicon, in a silicon n+–n–n+ diode and in a double gated 12 nm MOSFET. Additionally, the obtained results are compared to those of a high order WENO scheme simulation and DSMC (Discrete Simulation Monte Carlo) solvers. 相似文献
10.