全文获取类型
收费全文 | 137篇 |
免费 | 4篇 |
国内免费 | 4篇 |
专业分类
力学 | 2篇 |
数学 | 138篇 |
物理学 | 5篇 |
出版年
2022年 | 2篇 |
2020年 | 2篇 |
2019年 | 2篇 |
2018年 | 2篇 |
2017年 | 5篇 |
2016年 | 2篇 |
2015年 | 7篇 |
2014年 | 3篇 |
2013年 | 17篇 |
2012年 | 6篇 |
2011年 | 4篇 |
2010年 | 8篇 |
2009年 | 12篇 |
2008年 | 18篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 4篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1980年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有145条查询结果,搜索用时 15 毫秒
131.
Pedro Sánchez Terraf 《Order》2008,25(4):377-386
We study varieties with a term-definable poset structure, po-groupoids. It is known that connected posets have the strict refinement property (SRP). In Sánchez Terraf and Vaggione (Trans Am Math Soc, in press) it is proved that semidegenerate varieties with the SRP have definable factor congruences and if the similarity type is
finite, directly indecomposables are axiomatizable by a set of first-order sentences. We obtain such a set for semidegenerate
varieties of connected po-groupoids and show its quantifier complexity is bounded in general.
Supported by Conicet. 相似文献
132.
Stephen E. Wright 《Operations Research Letters》2008,36(1):67-70
Given an optimal solution for a convex quadratic programming (QP) problem, the optimal partition of the QP can be computed by solving a pair of linear or QP problems for which nearly optimal solutions are known. 相似文献
133.
In this work, we study a nonsmooth optimization problem with generalized inequality constraints and an arbitrary set constraint.
We present necessary conditions for a point to be a strict local minimizer of order k in terms of higher-order (upper and lower) Studniarski derivatives and the contingent cone to the constraint set. In the
same line, when the initial space is finite dimensional, we develop sufficient optimality conditions. We also provide sufficient
conditions for minimizers of order k using the lower Studniarski derivative of the Lagrangian function. Particular interest is put for minimizers of order two,
using now a special second order derivative which leads to the Fréchet derivative in the differentiable case. 相似文献
134.
We provide explicit closed form expressions for strict Lyapunov functions for time-varying discrete time systems. Our Lyapunov functions are expressed in terms of known nonstrict Lyapunov functions for the dynamics and finite sums of persistency of excitation parameters. This provides a discrete time analog of our previous continuous time Lyapunov function constructions. We also construct explicit strict Lyapunov functions for systems satisfying nonstrict discrete time analogs of the conditions from Matrosov’s Theorem. We use our methods to build strict Lyapunov functions for time-varying hybrid systems that contain mixtures of continuous and discrete time evolutions. 相似文献
135.
Bienvenido Jiménez Miguel Sama 《Journal of Mathematical Analysis and Applications》2009,352(2):788-2157
In this paper necessary and sufficient conditions for strict minimizers of a general vector optimization problem are given by means of different notions of graphical or epigraphical derivatives, extending some existing results in the literature. In first place, these conditions are established by means of contingent derivatives and secondly, by applying a nonconvex separation result, in terms of contingent epiderivatives and hypoderivatives. Moreover, through a variational approach, a scalarization method is developed in order to obtain scalar versions of these results. 相似文献
136.
A graph is a strict-quasi parity (SQP) graph if every induced subgraph that is not a clique contains a pair of vertices with
no odd chordless path between them (an “even pair”). We present an O(n
3) algorithm for recognizing planar strict quasi-parity graphs, based on Wen-Lian Hsu's decomposition of planar (perfect) graphs
and on the (non-algorithmic) characterization of planar minimal non-SQP graphs given in [9].
Received: September 21, 1998 Final version received: May 9, 2000 相似文献
137.
138.
A. Anthony Eldred 《Journal of Mathematical Analysis and Applications》2006,323(2):1001-1006
Consider a self map T defined on the union of two subsets A and B of a metric space and satisfying T(A)⊆B and T(B)⊆A. We give some contraction type existence results for a best proximity point, that is, a point x such that d(x,Tx)=dist(A,B). We also give an algorithm to find a best proximity point for the map T in the setting of a uniformly convex Banach space. 相似文献
139.
The Polya algorithm in sequence spaces 总被引:1,自引:1,他引:0
140.
具非负特征形式二阶微分方程的第一边值问题众所周知是Fichera提出的在边界子集∑_2∪∑_3上给值的形式.在主部系数矩阵最小特征值λ的负一次方为可积的条件下,辜联崑教授提出了只在∑_3上给值的另一形式.本文指出λ~(-1)的可积性会影响边界的划分,这种情况下整个边界除了一个零测集外全部是∑_3,因此第二种形式只是Fichera形式的特例. 相似文献