全文获取类型
收费全文 | 668篇 |
免费 | 71篇 |
国内免费 | 89篇 |
专业分类
化学 | 22篇 |
力学 | 40篇 |
综合类 | 9篇 |
数学 | 671篇 |
物理学 | 86篇 |
出版年
2023年 | 8篇 |
2022年 | 9篇 |
2021年 | 9篇 |
2020年 | 15篇 |
2019年 | 20篇 |
2018年 | 22篇 |
2017年 | 18篇 |
2016年 | 26篇 |
2015年 | 24篇 |
2014年 | 39篇 |
2013年 | 45篇 |
2012年 | 29篇 |
2011年 | 49篇 |
2010年 | 27篇 |
2009年 | 53篇 |
2008年 | 37篇 |
2007年 | 52篇 |
2006年 | 42篇 |
2005年 | 41篇 |
2004年 | 37篇 |
2003年 | 36篇 |
2002年 | 46篇 |
2001年 | 30篇 |
2000年 | 14篇 |
1999年 | 17篇 |
1998年 | 24篇 |
1997年 | 15篇 |
1996年 | 15篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1983年 | 2篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1976年 | 2篇 |
排序方式: 共有828条查询结果,搜索用时 140 毫秒
1.
2.
Amirali Sadeqi Shapour Moradi Kourosh Heidari Shirazi 《Mathematical and Computer Modelling of Dynamical Systems: Methods, Tools and Applications in Engineering and Related Sciences》2020,26(1):55-79
ABSTRACTThe scope of output-only/blind identification is restricted to stochastic/statistical processes, but for the first time in this study, the detectability conditions for general output-only subspace identification are investigated. This aids the range of input sources to be extended in a much realistic manner, beyond the only stochastic inputs. For this purpose, the subspace framework is assigned to make a connection between the output signal contents and the LTI system order. A few substantial hypotheses and algebraic statements are propounded affirming the sufficiency of the genuine output sequences for the identification purpose. This can be perceived as the cornerstone of state-space model reconstruction. In order to consolidate the notions according to reality, several examples are studied and examined for different input classes with stochastic disturbance. 相似文献
3.
4.
Let A be a unital algebra and M be a unital A-bimodule. A linear map δ : A →M is said to be Jordan derivable at a nontrivial idempotent P ∈ A if δ(A) ? B + A ? δ(B) =δ(A ? B) for any A, B ∈ A with A ? B = P, here A ? B = AB + BA is the usual Jordan product. In this article, we show that if A = Alg N is a Hilbert space nest algebra and M = B(H), or A = M = B(X), then, a linear map δ : A → M is Jordan derivable at a nontrivial projection P ∈ N or an arbitrary but fixed nontrivial idempotent P ∈ B(X) if and only if it is a derivation. New equivalent characterization of derivations on these operator algebras was obtained. 相似文献
5.
Roee David Elazar Goldenberg Robert Krauthgamer 《Random Structures and Algorithms》2017,51(4):607-630
We study the problem of reconstructing a low‐rank matrix, where the input is an n × m matrix M over a field and the goal is to reconstruct a (near‐optimal) matrix that is low‐rank and close to M under some distance function Δ. Furthermore, the reconstruction must be local, i.e., provides access to any desired entry of by reading only a few entries of the input M (ideally, independent of the matrix dimensions n and m). Our formulation of this problem is inspired by the local reconstruction framework of Saks and Seshadhri (SICOMP, 2010). Our main result is a local reconstruction algorithm for the case where Δ is the normalized Hamming distance (between matrices). Given M that is ‐close to a matrix of rank (together with d and ), this algorithm computes with high probability a rank‐d matrix that is ‐close to M. This is a local algorithm that proceeds in two phases. The preprocessing phase reads only random entries of M, and stores a small data structure. The query phase deterministically outputs a desired entry by reading only the data structure and 2d additional entries of M. We also consider local reconstruction in an easier setting, where the algorithm can read an entire matrix column in a single operation. When Δ is the normalized Hamming distance between vectors, we derive an algorithm that runs in polynomial time by applying our main result for matrix reconstruction. For comparison, when Δ is the truncated Euclidean distance and , we analyze sampling algorithms by using statistical learning tools. A preliminary version of this paper appears appears in ECCC, see: http://eccc.hpi-web.de/report/2015/128/ © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 607–630, 2017 相似文献
6.
Sufficient dimension reduction (SDR) is a paradigm for reducing the dimension of the predictors without losing regression information. Most SDR methods require inverting the covariance matrix of the predictors. This hinders their use in the analysis of contemporary datasets where the number of predictors exceeds the available sample size and the predictors are highly correlated. To this end, by incorporating the seeded SDR idea and the sequential dimension-reduction framework, we propose a SDR method for high-dimensional data with correlated predictors. The performance of the proposed method is studied via extensive simulations. To demonstrate its use, an application to microarray gene expression data where the response is the production rate of riboflavin (vitamin B2) is presented. 相似文献
7.
8.
In this paper, continuity of the set-valued metric generalized inverse T∂ in approximatively compact Banach spaces is investigated by means of the methods of geometry of Banach spaces. Necessary and sufficient conditions for upper semicontinuity (continuity) for the set-valued metric generalized inverses T∂ are given. Moreover, authors also prove that if X is a nearly dentable space and H is a hyperplane of X, then H is approximatively compact iff PH(x) is compact for any x∈X. 相似文献
9.
We consider the numerical solution of the continuous algebraic Riccati equation A*X + XA ? XFX + G = 0, with F = F*,G = G* of low rank and A large and sparse. We develop an algorithm for the low‐rank approximation of X by means of an invariant subspace iteration on a function of the associated Hamiltonian matrix. We show that the sought‐after approximation can be obtained by a low‐rank update, in the style of the well known Alternating Direction Implicit (ADI) iteration for the linear equation, from which the new method inherits many algebraic properties. Moreover, we establish new insightful matrix relations with emerging projection‐type methods, which will help increase our understanding of this latter class of solution strategies. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
10.
The controllability for switched linear system with time-delay in controls was first investigated. The whole work contains
three parts. This is the first part, including problem formulation and some preliminaries. Firstly, the mathematical model
of switched linear systems with time-delay in control functions was presented. Secondly, the concept of column space, cyclic
invariant subspace and generalized cyclic invariant subspace were introduced. And some basic properties, such as separation
lemma, were presented. Finally, a basic lemma was given to reveal the relation between the solution set of a centain integral
equations and the generalized cyclic invariant subspace. This lemma will play an important role in the determination of controllability.
All these definitions and lemmas are necessary research tools for controllability analysis.
Contributed by YE Qing-kai
Foundation items: the National Natural Science Foundation of China (69925307, 60274001); the National Key Basic Reasearch and Development
Program (2002CB312200); the Postdoctoral Program Foundation of China
Biography: XIE Guang-ming (1972∼), Doctor (E-mail: xiegming@mech.pku.edu.cn) 相似文献