全文获取类型
收费全文 | 1873篇 |
免费 | 12篇 |
国内免费 | 11篇 |
专业分类
教育 | 326篇 |
科学研究 | 1088篇 |
各国文化 | 19篇 |
体育 | 11篇 |
综合类 | 14篇 |
信息传播 | 438篇 |
出版年
2023年 | 2篇 |
2022年 | 9篇 |
2021年 | 13篇 |
2020年 | 12篇 |
2019年 | 571篇 |
2018年 | 456篇 |
2017年 | 181篇 |
2016年 | 23篇 |
2015年 | 16篇 |
2014年 | 61篇 |
2013年 | 47篇 |
2012年 | 60篇 |
2011年 | 57篇 |
2010年 | 39篇 |
2009年 | 37篇 |
2008年 | 41篇 |
2007年 | 42篇 |
2006年 | 36篇 |
2005年 | 50篇 |
2004年 | 30篇 |
2003年 | 37篇 |
2002年 | 24篇 |
2001年 | 16篇 |
2000年 | 13篇 |
1999年 | 4篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1985年 | 1篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1980年 | 1篇 |
1978年 | 3篇 |
1977年 | 4篇 |
1976年 | 1篇 |
排序方式: 共有1896条查询结果,搜索用时 15 毫秒
991.
In this paper, the event-triggered distributed H∞ state estimation problem is investigated for a class of state-saturated systems with randomly occurring mixed delays over sensor networks. The mixed delays, which comprise both discrete and distributed delays, are allowed to occur in a random manner governed by two mutually independent Bernoulli distributed random variables. In order to alleviate the communication burden, an event-triggered mechanism is utilized for each sensor node to decide whether or not its current information should be broadcasted to its neighbors. The aim of this paper is to design event-triggered state estimators such that the error dynamics of state estimation is exponentially mean-square stable with a prescribed H∞ performance index. By resorting to intensive stochastic analysis, sufficient conditions are first derived to guarantee the existence of the desired estimators, and the parameters of the desired distributed estimators are then obtained in light of the feasibility of a certain set of matrix inequalities. A numerical example is employed to illustrate the usefulness of the proposed distributed estimation algorithm. 相似文献
992.
In this paper, two relaxed gradient-based iterative algorithms for solving a class of generalized coupled Sylvester-conjugate matrix equations are proposed. The proposed algorithm is different from the gradient-based iterative algorithm and the modified gradient-based iterative algorithm that are recently available in the literature. With the real representation of a complex matrix as a tool, the sufficient and necessary condition for the convergence factor is determined to guarantee that the iterative solution given by the proposed algorithms converge to the exact solution for any initial matrices. Moreover, some sufficient convergence conditions for the suggested algorithms are presented. Finally, numerical example is provided to illustrate the effectiveness of the proposed algorithms and testify the conclusions suggested in this paper. 相似文献
993.
By resorting to the vector space structure of finite games, skew-symmetric games (SSGs) are proposed and investigated as a natural subspace of finite games. First of all, for two player games, it is shown that the skew-symmetric games form an orthogonal complement of the symmetric games. Then for a general SSG its linear representation is given, which can be used to verify whether a finite game is skew-symmetric. Furthermore, some properties of SSGs are also obtained in the light of its vector subspace structure. Finally, a symmetry-based decomposition of finite games is proposed, which consists of three mutually orthogonal subspaces: symmetric subspace, skew-symmetric subspace and asymmetric subspace. An illustrative example is presented to demonstrate this decomposition. 相似文献
994.
Javier A. Gallegos Manuel A. Duarte-Mermoud Rafael Castro-Linares 《Journal of The Franklin Institute》2018,355(8):3399-3422
We provide a solution to the adaptive control problem of an unknown linear system of a given derivation order, using a reference model or desired poles defined in a possibly different derivation order and employing continuous adjustment of parameters ruled by possibly another different derivation order. To this purpose, we present an extension for the fractional settings of the Bezout’s lemma and gradient steepest descent adjustment. We analyze both the direct and indirect approaches to adaptive control. We discuss some robustness advantages/disadvantages of the fractional adjustment of parameters in comparison with the integer one and, through simulations, the possibility to define optimal derivation order controllers. 相似文献
995.
Chuanjiang Li Liangming Chen Yanning Guo Yueyong Lyu 《Journal of The Franklin Institute》2018,355(12):5182-5202
This paper investigates the cooperative surrounding control problem for networked multi-agent systems with nonlinear Lagrangian dynamics. With the consideration of the target with constant and time-varying velocity, two cooperative surrounding control algorithms with collision avoidance are proposed, in which possible collision among agents is prevented so as to achieve a more reliable and safer performance. For the case when the target has a constant velocity, a velocity observer is designed firstly for each agent. Secondly, to handle the nonlinear dynamics and avoid collisions, the neural networks and potential functions are used for the controller design. Then, the cooperative surrounding control algorithm is proposed such that all the agents surround the target with the desired relative positions. For the case when the target has a time-varying velocity, the velocity observer is designed under the assumption that the target’s partial acceleration is known for each agent. Then, the cooperative surrounding control algorithm is proposed such that the surrounding error between the target and each agent is bounded. The main difference between these two algorithms is that the former can ensure the collision avoidance among target and agents, while the latter can do so only among agents because the target’s velocity is time-varying. The Lyapunov theory is used to prove the stability of the cooperative surrounding control algorithms. The simulation illustrates the effectiveness of the theoretical results. 相似文献
996.
997.
In this paper, we consider the stability of a class of stochastic delay Hopfield neural networks driven by G-Brownian motion. Under a sublinear expectation framework, we give the definition of exponential stability in mean square and construct some conditions such that the stochastic system is exponentially stable in mean square. Moreover, we also consider the stability of the Euler numerical solution of such equation. Finally, we give an example and its numerical simulation to illustrate our results. 相似文献
998.
To collect data on ozone pollution and foliar damage, we established the first Philadelphia Ozone Bioindicator Garden at The Franklin Institute Science Museum. In this paper, we examine the relationship between ozone concentrations in an urban environment and changes in foliar damage in cutleaf coneflower (Rudbeckia laciniata) plants. Higher ozone concentrations were observed during Summer 2015 than during Summer 2014 at our site. Diurnal analysis reveals a nightly diminishment of ozone's rate of dissipation around 4am, which we attributed to intrusions of air from the residual layer (the layer of air above the boundary layer). We saw that visible foliar injury starts relatively slowly and accelerates beginning in late July for stippling and early August for chlorosis and necrosis. We found that injury ratings on ozone-damaged leaves progress faster later in the season despite lower ambient ozone concentrations; we hypothesized that this is evidence of a “latency period” in the cutleaf coneflower's foliar injury response to ozone. Cutleaf coneflowers may serve as engaging tools to alert and inform Philadelphians about air quality issues. Our results suggest that these plants are good candidates for future work in developing bioindicators of ozone where direct monitoring is not feasible. 相似文献
999.
Xiucheng Shi Jianquan Lu Yang Liu Tingwen Huang Fuad E. Alssadi 《Journal of The Franklin Institute》2018,355(12):5256-5271
In this paper, we study the fixed-time consensus problem for multi-agent systems with structurally balanced signed graph. A new class of fixed-time nonlinear consensus protocols is designed by employing the neighbor’s information. By using Lyapunov stability method, states of all agents can be guaranteed to reach agreement in a fixed time under our presented protocols, and the consensus values are the same in modulus but different in sign. Moreover, it is shown that the settling time is not dependent on the initial conditions, and it makes a good convenience to estimate the convergence time by just knowing the graph topology and the information flow of the multi-agent systems. Finally, two numerical examples are given to demonstrate the effectiveness of the proposed consensus protocols. 相似文献
1000.
Xian-He Zhang Guang-Song Han Zhi-Hong Guan Juan Li Ding-Xue Zhang Rui-Quan Liao 《Journal of The Franklin Institute》2018,355(8):3677-3690
A robust multi-tracking problem is solved for heterogeneous multi-agent systems with uncertain nonlinearities and disturbances. The nonlinear function satisfies a Lipschitz condition with a time-varying gain, the integral of which is bounded by a linear function. A distributed impulsive protocol is proposed, where the position data and velocity data of desired trajectories are needed only at sampling instants. Based on the system decomposition technique, the error dynamic system of achieving multi-tracking is decomposed into two impulsive dynamic systems with vanishing perturbation and nonvanishing perturbation, respectively. Constructing a nominal model, then the multi-tracking problem is converted into the stability of impulsive dynamic system with nonvanishing perturbation under some conditions. It is proved that the proposed impulsive protocol is robust enough to solve the multi-tracking problem. Numerical examples are presented to illustrate the effectiveness of our theoretical results. 相似文献