全文获取类型
收费全文 | 1076篇 |
免费 | 304篇 |
国内免费 | 299篇 |
学科分类
工业技术 | 1679篇 |
出版年
2024年 | 38篇 |
2023年 | 94篇 |
2022年 | 103篇 |
2021年 | 129篇 |
2020年 | 137篇 |
2019年 | 101篇 |
2018年 | 119篇 |
2017年 | 116篇 |
2016年 | 128篇 |
2015年 | 73篇 |
2014年 | 121篇 |
2013年 | 190篇 |
2012年 | 73篇 |
2011年 | 58篇 |
2010年 | 34篇 |
2009年 | 27篇 |
2008年 | 20篇 |
2007年 | 27篇 |
2006年 | 16篇 |
2005年 | 15篇 |
2004年 | 10篇 |
2003年 | 9篇 |
2002年 | 1篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 5篇 |
1998年 | 2篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1977年 | 1篇 |
1974年 | 1篇 |
1961年 | 1篇 |
1957年 | 2篇 |
排序方式: 共有1679条查询结果,搜索用时 15 毫秒
1.
Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays 总被引:5,自引:0,他引:5
In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results. 相似文献
2.
3.
研究具有随机丢包的网络化多自主体系统的均方一致性问题,其中不同自主体间的通信通道具有相同的丢包情况并且均服从马尔可夫(Markov)分布。首先,利用系统变换和迭代方法,得到了系统达到均方一致的一个初等充要条件。然后,利用矩阵理论和图论知识,如果拓扑图含有有向生成树,则可以将系统的均方一致性转化成一个线性Markov跳变系统的均方稳定性,并且可以建立线性矩阵不等式形式的均方可镇定准则。最后,通过相应的仿真实例说明了所得结论的可行性。 相似文献
4.
《自动化学报》2014,(11)
A linear transformation is proposed to deal with the consensus problem of high-order linear multi-agent systems(LMASs).In virtue of the linear transformation, the consensus problem is equivalently translated into a partial stability problem. We discuss three issues of the LMASs under a generalized linear protocol: 1) to find criteria of consensus convergence; 2) to calculate consensus function; 3) to design gain matrices in the linear consensus protocol. Precisely, we provide a necessary and sufficient criterion of consensus convergence in terms of Hurwitz stability of a matrix and give an analytical expression of the consensus function. In addition, we set up a relation between the gain matrices in the protocol and the convergence time and consensus accuracy of the agents, and then design the gain matrices with respect to a pre-specified convergence time and a required consensus accuracy. 相似文献
5.
Cortajarena AL Kajander T Pan W Cocco MJ Regan L 《Protein engineering, design & selection : PEDS》2004,17(4):399-409
Protein design aims to understand the fundamentals of protein structure by creating novel proteins with pre-specified folds. An equally important goal is to understand protein function by creating novel proteins with pre-specified activities. Here we describe the design and characterization of a tetratricopeptide (TPR) protein, which binds to the C-terminal peptide of the eukaryotic chaperone Hsp90. The design emphasizes the importance of both direct, short-range protein-peptide interactions and of long-range electrostatic optimization. We demonstrate that the designed protein binds specifically to the desired peptide and discriminates between it and the similar C-terminal peptide of Hsp70. 相似文献
6.
7.
This article considers the finite-time consensus of multiple second-order dynamic agents without velocity measurements. A feasible protocol under which each agent can only obtain the measurements of its position relative to its neighbours is proposed. By applying the graph theory, Lyapunov theory and the homogeneous domination method, some sufficient conditions for finite-time consensus of second-order multi-agent systems are established under the different kinds of communication topologies. Some examples are presented to illustrate the effectiveness of the theoretical results. 相似文献
8.
Yulian Jiang Jianchang Liu Shubin Tan Pingsong Ming 《International journal of systems science》2014,45(9):1869-1879
In this paper, a robust consensus algorithm is developed and sufficient conditions for convergence to consensus are proposed for a multi-agent system (MAS) with exogenous disturbances subject to partial information. By utilizing H∞ robust control, differential game theory and a design-based approach, the consensus problem of the MAS with exogenous bounded interference is resolved and the disturbances are restrained, simultaneously. Attention is focused on designing an H∞ robust controller (the robust consensus algorithm) based on minimisation of our proposed rational and individual cost functions according to goals of the MAS. Furthermore, sufficient conditions for convergence of the robust consensus algorithm are given. An example is employed to demonstrate that our results are effective and more capable to restrain exogenous disturbances than the existing literature. 相似文献
9.
针对多属性群决策中的共识问题, 提出两种使群体达成共识的方法. 假设群体决策的结果以从个体偏好通过集结得到的群体偏好为基础, 在使用算术加权集结算子和几何加权集结算子的条件下, 分别设计相应的共识达成算法, 并对算法的收敛性进行分析. 与已有方法相比, 所提出算法能够体现决策个体的差异和决策个体对群体的影响. 通过某市政图书馆空调系统安装方案的选择表明了所提出方法的合理性和可行性.
相似文献10.
This paper investigates robust consensus for multi‐agent systems with discrete‐time dynamics affected by uncertainty. In particular, the paper considers multi‐agent systems with single and double integrators, where the weighted adjacency matrix is a polynomial function of uncertain parameters constrained into a semialgebraic set. Firstly, necessary and sufficient conditions are provided for robust consensus based on the existence of a Lyapunov function polynomially dependent on the uncertainty. In particular, an upper bound on the degree required for achieving necessity is provided. Secondly, a necessary and sufficient condition is provided for robust consensus with single integrator and nonnegative weighted adjacency matrices based on the zeros of a polynomial. Lastly, it is shown how these conditions can be investigated through convex programming by exploiting linear matrix inequalities and sums of squares of polynomials. Some numerical examples illustrate the proposed results. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献