首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   984篇
  免费   54篇
  国内免费   2篇
工业技术   1040篇
  2024年   5篇
  2023年   14篇
  2022年   94篇
  2021年   117篇
  2020年   28篇
  2019年   26篇
  2018年   48篇
  2017年   40篇
  2016年   47篇
  2015年   29篇
  2014年   59篇
  2013年   64篇
  2012年   56篇
  2011年   60篇
  2010年   49篇
  2009年   35篇
  2008年   34篇
  2007年   20篇
  2006年   25篇
  2005年   21篇
  2004年   22篇
  2003年   14篇
  2002年   7篇
  2001年   7篇
  2000年   6篇
  1999年   13篇
  1998年   8篇
  1997年   10篇
  1996年   6篇
  1995年   10篇
  1993年   10篇
  1992年   4篇
  1990年   2篇
  1989年   2篇
  1988年   3篇
  1987年   4篇
  1986年   3篇
  1985年   5篇
  1983年   3篇
  1982年   5篇
  1981年   3篇
  1980年   2篇
  1979年   3篇
  1978年   2篇
  1976年   4篇
  1975年   3篇
  1974年   2篇
  1971年   1篇
  1965年   1篇
  1964年   1篇
排序方式: 共有1040条查询结果,搜索用时 15 毫秒
81.
A solution to the infinite-horizon min–max model predictive control (MPC) problem of constrained polytopic systems has recently been defined in terms of a sequence of free control moves over a fixed horizon and a state feedback law in the terminal region using a time-varying terminal cost. The advantage of this formulation is the enlargement of the admissible set of initial states without sacrificing local optimality, but this comes at the expense of higher computational complexity. This article, by means of a counterexample, shows that the robust feasibility and stability properties of such algorithms are not, in general, guaranteed when more than one control move is adopted. For this reason, this work presents a novel formulation of min–max MPC based on the concept of within-horizon feedback and robust contractive set theory that ensures robust stability for any choice of the control horizon. A parameter-dependent feedback extension is also proposed and analysed. The effectiveness of the algorithms is demonstrated with two numerical examples.  相似文献   
82.
Sampling (evenly) the suffixes from the suffix array is an old idea trading the pattern search time for reduced index space. A few years ago Claude et al. showed an alphabet sampling scheme allowing for more efficient pattern searches compared with the sparse suffix array, for long enough patterns. A drawback of their approach is the requirement that sought patterns need to contain at least one character from the chosen subalphabet. In this work, we propose an alternative suffix sampling approach with only a minimum pattern length as a requirement, which is more convenient in practice. Experiments show that our algorithm (in a few variants) achieves competitive time‐space tradeoffs on most standard benchmark data. Copyright © 2017 John Wiley & Sons, Ltd.  相似文献   
83.
The Parity Path problem is to decide if a given graph contains both an induced path of odd length and an induced path of even length between two specified vertices. In the related problems Odd Induced Path and Even Induced Path, the goal is to determine whether an induced path of odd, respectively even, length between two specified vertices exists. Although all three problems are NP-complete in general, we show that they can be solved in $\mathcal{O}(n^{5})$ time for the class of claw-free graphs. Two vertices s and t form an even pair in G if every induced path from s to t in G has even length. Our results imply that the problem of deciding if two specified vertices of a claw-free graph form an even pair, as well as the problem of deciding if a given claw-free graph has an even pair, can be solved in $\mathcal{O}(n^{5})$ time and $\mathcal{O}(n^{7})$ time, respectively. We also show that we can decide in $\mathcal{O}(n^{7})$ time whether a claw-free graph has an induced cycle of given parity through a specified vertex. Finally, we show that a shortest induced path of given parity between two specified vertices of a claw-free perfect graph can be found in $\mathcal {O}(n^{7})$ time.  相似文献   
84.
85.
Pattern Analysis and Applications - Training deep neural networks (DNNs) on high-dimensional data with no spatial structure poses a major computational problem. It implies a network architecture...  相似文献   
86.
Nowadays object recognition is a fundamental capability for an autonomous robot in interaction with the physical world. Taking advantage of new sensing technologies providing RGB-D data, the object recognition capabilities increase dramatically. Object recognition has been well studied, however, known object classifiers usually feature poor generality and, therefore, limited adaptivity to different application domains. Although some domain adaptation approaches have been presented for RGB data, little work has been done on understanding the effects of applying object classification algorithms using RGB-D for different domains. Addressing this problem, we propose and comprehensively investigate an approach for object recognition in RGB-D data that uses adaptive Support Vector Machines (aSVM) and, in this way, achieves an impressive robustness in cross-domain adaptivity. For evaluation, two datasets from different application domains were used. Moreover, a study of state-of-the-art RGB-D feature extraction techniques and object classification methods was performed to identify which combinations (object representation - classification algorithm) remain less affected in terms of performance while switching between different application domains.  相似文献   
87.
Experiments on concrete under uniaxial impact tensile loading   总被引:4,自引:0,他引:4  
A problem of practical importance for designing of structural elements is discussed in this paper—the behaviour of concrete subjected to uniaxial impact tensile loading. The “Split Hopkinson Bar” technique was adopted for testing concrete in uniaxial tension at stress rates between 2 and 60 N/mm2/ms. A remarkable increase in tensile strength was observed due to high stress rate. The ratio of impact and static tensile strength varied between 1.33 and 2.34 for various concrete mixes. The influence of maximum aggregate size, water-cement ratio, cement content, cement type and quality, specimen humidity, static compressive strength and loading/casting direction upon the uniaxial impact tensile strength was studied. The high stress rate resulted in an increase of the modulus of elasticity of concrete in uniaxial tension. An explanation for the observed phenomena is suggested.  相似文献   
88.
89.
The problem of computing the chromatic number of a P 5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P 5-free graph admits a k-coloring, and finding one, if it does.  相似文献   
90.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号