全文获取类型
收费全文 | 10349篇 |
免费 | 29篇 |
国内免费 | 138篇 |
专业分类
电工技术 | 131篇 |
综合类 | 1篇 |
化学工业 | 337篇 |
金属工艺 | 434篇 |
机械仪表 | 53篇 |
建筑科学 | 49篇 |
能源动力 | 41篇 |
轻工业 | 15篇 |
水利工程 | 19篇 |
石油天然气 | 14篇 |
无线电 | 326篇 |
一般工业技术 | 154篇 |
冶金工业 | 91篇 |
原子能技术 | 89篇 |
自动化技术 | 8762篇 |
出版年
2023年 | 7篇 |
2022年 | 18篇 |
2021年 | 21篇 |
2020年 | 14篇 |
2019年 | 20篇 |
2018年 | 15篇 |
2017年 | 4篇 |
2016年 | 13篇 |
2015年 | 11篇 |
2014年 | 220篇 |
2013年 | 189篇 |
2012年 | 769篇 |
2011年 | 3080篇 |
2010年 | 1141篇 |
2009年 | 1008篇 |
2008年 | 670篇 |
2007年 | 586篇 |
2006年 | 451篇 |
2005年 | 570篇 |
2004年 | 528篇 |
2003年 | 588篇 |
2002年 | 282篇 |
2001年 | 6篇 |
2000年 | 10篇 |
1999年 | 21篇 |
1998年 | 87篇 |
1997年 | 26篇 |
1996年 | 20篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 9篇 |
1991年 | 5篇 |
1990年 | 10篇 |
1989年 | 6篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 12篇 |
1985年 | 6篇 |
1984年 | 24篇 |
1983年 | 12篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1979年 | 2篇 |
1977年 | 3篇 |
1975年 | 2篇 |
1962年 | 1篇 |
1960年 | 1篇 |
1959年 | 1篇 |
1958年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 9 毫秒
31.
32.
Alvaro E. Gil Author Vitae Author Vitae 《Automatica》2006,42(2):245-250
Resource allocation involves deciding how to divide a resource of limited availability among multiple demands in a way that optimizes current objectives. In this brief paper we focus on one type of distributed resource allocation problem where via an imperfect communication network multiple processors can share the load presented by multiple task types. We introduce asynchronous “cooperative” resource allocation strategies, and show that they lead to a bounded cumulative demand. 相似文献
33.
Andrea Bacciotti Author Vitae Author Vitae 《Automatica》2006,42(3):453-458
Differential equations with discontinuous right-hand side and solutions intended in Carathéodory sense are considered. For these equations, sufficient conditions which guarantee both Lyapunov stability and asymptotic stability in terms of nonsmooth Lyapunov functions are given. An invariance principle is also proven. 相似文献
34.
Bullwhip reduction for ARMA demand: The proportional order-up-to policy versus the full-state-feedback policy 总被引:1,自引:0,他引:1
Gerard Gaalman Author Vitae 《Automatica》2006,42(8):1283-1290
A ‘proportional’ order-up-to policy reacting to ARMA demand is analyzed using stochastic optimal control theory. This policy is compared with a full-state-feedback order-up-to policy. Necessary conditions for an optimum of a weighted sum of the inventory and the ordering variances for both policies are formulated. Based on this a relatively simple expression for the ‘full-state’ policy is derived. The comparison between the two policies demonstrates that the ‘intuitively’ designed proportional policy does not fulfill the objective of controlling both the inventory and ordering variance for all parameter values of the demand model as well as the full-state-feedback policy. The full-state-feedback policy outperforms the proportional policy in several aspects. 相似文献
35.
36.
In the last decade there was growing interest in strategic management literature about factors that influence a company's ability to use IT. There is general consensus that knowledge and competency are necessary in developing an IT capability, but there is very little understanding of what the necessary competencies are, and how they influence IS usage in different contexts. The small and medium-sized enterprise context is particularly interesting for two reasons: it constitutes a major part of the economy and it has been relatively unsuccessful in exploiting e-business. 相似文献
37.
Marco Dalai Author Vitae 《Automatica》2007,43(8):1418-1425
In this paper we consider the problem of constructing confidence regions for the parameters of nonlinear dynamical systems. The proposed method uses higher order statistics and extends the LSCR (leave-out sign-dominant correlation regions) algorithm for linear systems introduced in Campi and Weyer [2005, Guaranteed non-asymptotic confidence regions in system identification. Automatica 41(10), 1751-1764. Extended version available at 〈http://www.ing.unibs.it/∼campi〉]. The confidence regions contain the true parameter value with a guaranteed probability for any finite number of data points. Moreover, the confidence regions shrink around the true parameter value as the number of data points increases. The usefulness of the proposed approach is illustrated on some simple examples. 相似文献
38.
Based on a polynomial operator approach, a new sparse controller structure is derived, which is actually an improved version of the recently proposed structure [Li, G. (2004). A polynomial-operator-based DFIIt structure for IIR filters. IEEE Transactions on Circuits and Systems II, 51, 147-151]. The performance of the proposed structure is analyzed by deriving the corresponding expression of roundoff noise gain and the problem of finding optimized sparse structures is solved efficiently with a genetic algorithm (GA). A numerical example is given, which shows that the newly developed structure can achieve much better performance than some well-known structures and particularly outperforms the traditional optimal fully parametrized realization greatly in terms of reducing roundoff noise and implementation complexity. 相似文献
39.
Herve Charlery Author Vitae Adrijean Andriahantenaina Author Vitae Author Vitae 《Computers & Electrical Engineering》2007,33(4):299-309
This paper presents the physical design methodology of the VCI/SPIN wrappers. The challenge was the validation of the wrappers’ specification with Alliance CAD Tools.A wrapper is a standard gateway used by a subscriber to access an interconnect. Because there are as many wrappers as subscribers, it is relevant to have an estimation of the wrapper’s area, its frequency and then compare these results to the router’s.The interest to perform this study with academic tools is to show that commercial tools are not the unique way for experimentations. 相似文献
40.
S. Kumar Author Vitae Author Vitae S. Ranganath Author Vitae Author Vitae F.T. Chew Author Vitae 《Pattern recognition》2006,39(6):1088-1098
This paper presents a robust rule-based approach for the splitting of binary clumps that are formed by objects of diverse shapes and sizes. First, the deepest boundary pixels, i.e., the concavity pixels in a clump, are detected using a fast and accurate scheme. Next, concavity-based rules are applied to generate the candidate split lines that join pairs of concavity pixels. A figure of merit is used to determine the best split line from the set of candidate lines. Experimental results show that the proposed approach is robust and accurate. 相似文献