全文获取类型
收费全文 | 2438篇 |
免费 | 48篇 |
国内免费 | 2篇 |
学科分类
工业技术 | 2488篇 |
出版年
2021年 | 20篇 |
2020年 | 11篇 |
2019年 | 17篇 |
2018年 | 21篇 |
2017年 | 24篇 |
2016年 | 27篇 |
2015年 | 18篇 |
2014年 | 28篇 |
2013年 | 99篇 |
2012年 | 51篇 |
2011年 | 872篇 |
2010年 | 95篇 |
2009年 | 108篇 |
2008年 | 60篇 |
2007年 | 55篇 |
2006年 | 55篇 |
2005年 | 43篇 |
2004年 | 47篇 |
2003年 | 51篇 |
2002年 | 34篇 |
2001年 | 24篇 |
2000年 | 30篇 |
1999年 | 16篇 |
1998年 | 107篇 |
1997年 | 62篇 |
1996年 | 33篇 |
1995年 | 27篇 |
1994年 | 30篇 |
1993年 | 23篇 |
1992年 | 33篇 |
1991年 | 23篇 |
1990年 | 26篇 |
1989年 | 22篇 |
1988年 | 21篇 |
1987年 | 15篇 |
1986年 | 19篇 |
1985年 | 14篇 |
1984年 | 16篇 |
1983年 | 22篇 |
1982年 | 18篇 |
1981年 | 19篇 |
1980年 | 20篇 |
1979年 | 12篇 |
1978年 | 10篇 |
1977年 | 12篇 |
1976年 | 10篇 |
1975年 | 15篇 |
1974年 | 7篇 |
1973年 | 13篇 |
1970年 | 9篇 |
排序方式: 共有2488条查询结果,搜索用时 15 毫秒
91.
Achint Oommen Thomas Amalia Rusu Venu GovindarajuAuthor vitae 《Pattern recognition》2009,42(12):3365-3373
CAPTCHAs (completely automated public Turing test to tell computers and humans apart) are in common use today as a method for performing automated human verification online. The most popular type of CAPTCHA is the text recognition variety. However, many of the existing printed text CAPTCHAs have been broken by web-bots and are hence vulnerable to attack. We present an approach to use human-like handwriting for designing CAPTCHAs. A synthetic handwriting generation method is presented, where the generated textlines need to be as close as possible to human handwriting without being writer-specific. Such handwritten CAPTCHAs exploit the differential in handwriting reading proficiency between humans and machines. Test results show that when the generated textlines are further obfuscated with a set of deformations, machine recognition rates decrease considerably, compared to prior work, while human recognition rates remain the same. 相似文献
92.
A routing-table-based adaptive and minimal routing scheme on network-on-chip architectures 总被引:1,自引:0,他引:1
Ling Wang Hui Song Yingtao Jiang Lihong ZhangAuthor vitae 《Computers & Electrical Engineering》2009,35(6):846-855
In this paper, we present a routing algorithm that combines the shortest path routing and adaptive routing schemes for NoCs. In specific, routing follows the shortest path to ensure low latency and low energy consumption. This routing scheme requires routing information be stored in a series of routing tables created at the routers along the routing path from the source to the destination. To reduce the exploration space and timing cost for selecting the routing path, a routing list and routing table for each node are created off-line. Routing table is updated on-line to reflect the dynamic change of the network status to avoid network congestion. To alleviate the high hardware implementation cost associated with the routing tables, a method to help reduce the size of the routing tables is also introduced. Compared to the existing routing algorithms, the experimental results have confirmed that the proposed algorithm has better performance in terms of routing latency and power consumption. 相似文献
93.
Generalized honeycomb torus (GHT) is recognized as an attractive alternative to existing torus interconnection networks in parallel computing systems. Assume that m and d are integers with m ? 2 and d ? 8. This paper addresses the fault-tolerant hamiltonicity of GHT(m, 2d, d) with fault set F = {(w, y), (x, y)}, where w < x, w + y is even and x + y is odd. We show that such a faulty GHT is hamiltonian by presenting a systematic method for constructing a fault-free hamiltonian cycle. This result reveals another appealing feature of GHTs. 相似文献
94.
This paper studies event design in event-triggered feedback systems. A novel event-triggering scheme is presented to ensure exponential stability of the resulting sampled-data system. The scheme postpones the triggering of events over previously proposed methods and therefore enlarges the intersampling period. The resulting intersampling periods and deadlines are bounded strictly away from zero when the continuous time system is input-to-state stable with respect to measurement errors. 相似文献
95.
The null controllable set of a system is the largest set of states that can be controlled to the origin. Control systems that have a region of attraction equal to the null controllable set are said to be maximally controllable closed-loop systems. In the case of open-loop unstable plants with amplitude constrained control it is well known that the null controllable set does not cover the entire state-space. Further the combination of input constraints and unstable system dynamics results in a set of state constraints which we call implicit constraints. It is shown that the simple inclusion of implicit constraints in a controller formulation results in a controller that achieves maximal controllability for a class of open-loop unstable systems. 相似文献
96.
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. 相似文献
97.
Lossless convexification of a class of optimal control problems with non-convex control constraints 总被引:2,自引:0,他引:2
We consider a class of finite time horizon optimal control problems for continuous time linear systems with a convex cost, convex state constraints and non-convex control constraints. We propose a convex relaxation of the non-convex control constraints, and prove that the optimal solution of the relaxed problem is also an optimal solution for the original problem, which is referred to as the lossless convexification of the optimal control problem. The lossless convexification enables the use of interior point methods of convex optimization to obtain globally optimal solutions of the original non-convex optimal control problem. The solution approach is demonstrated on a number of planetary soft landing optimal control problems. 相似文献
98.
Céline Casenave Author vitae 《Automatica》2011,47(10):2273-2278
We present a time-continuous identification method for nonlinear dynamic Volterra models of the form HX=f(u,X)+v with H, a causal convolution operator. It is mainly based on a suitable parameterization of H deduced from the so-called diffusive representation, which is devoted to state representations of integral operators. Following this approach, the complex dynamic nature of H can be summarized by a few numerical parameters on which the identification of the dynamic part of the model will focus. The method is validated on a physical numerical example. 相似文献
99.
This paper is concerned with semi-global stabilization of discrete-time linear periodic systems subject to actuator saturation. Provided that the open loop characteristic multipliers are within the closed unit circle, a low gain feedback design approach is proposed to solve the problem by state feedback. Our approach is based on the solution to a parametric discrete-time periodic Lyapunov equation. The proposed approaches not only generalize the corresponding results for time-invariant systems to periodic systems, but also reveal some important intrinsic properties of this class of periodic matrix equations. A numerical example is worked out to illustrate the effectiveness of the proposed approaches. 相似文献
100.
Graziano Chesi Author vitae 《Automatica》2011,47(6):1131-1138
A fundamental problem in systems biology consists of investigating robustness properties of genetic regulatory networks (GRNs) with respect to model uncertainty. This paper addresses this problem for GRNs where the coefficients are rationally affected by polytopic uncertainty, and where the saturation functions are not exactly known. First, it is shown that a condition for ensuring that the GRN has a globally asymptotically stable equilibrium point for all admissible uncertainties can be obtained in terms of a convex optimization problem with linear matrix inequalities (LMIs), hence generalizing existing results that mainly consider only the case of GRNs where the coefficients are linearly affected by the uncertainty and the regulatory functions are in SUM form. Second, the problem of estimating the worst-case convergence rate of the trajectories to the equilibrium point over all admissible uncertainties is considered, and it is shown that a lower bound of this rate can be computed by solving a quasi-convex optimization problem with LMIs. Third, the paper considers the problem of estimating the set of uncertainties for which the GRN has a globally asymptotically stable equilibrium point. This problem is addressed, first, by showing how one can compute estimates with fixed shape by solving a quasi-convex optimization problem with LMIs, and second, by deriving a procedure for computing estimates with variable shape. Numerical examples illustrate the use of the proposed techniques. 相似文献