首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   342篇
  免费   5篇
  国内免费   21篇
化学   4篇
晶体学   1篇
力学   3篇
综合类   4篇
数学   344篇
物理学   12篇
  2024年   1篇
  2023年   1篇
  2022年   2篇
  2021年   1篇
  2020年   4篇
  2019年   5篇
  2018年   2篇
  2017年   8篇
  2016年   4篇
  2015年   3篇
  2014年   2篇
  2013年   18篇
  2012年   16篇
  2011年   9篇
  2010年   10篇
  2009年   20篇
  2008年   29篇
  2007年   20篇
  2006年   21篇
  2005年   13篇
  2004年   16篇
  2003年   18篇
  2002年   12篇
  2001年   8篇
  2000年   7篇
  1999年   6篇
  1998年   9篇
  1997年   13篇
  1996年   8篇
  1995年   5篇
  1994年   9篇
  1993年   6篇
  1992年   3篇
  1991年   8篇
  1990年   7篇
  1989年   3篇
  1988年   4篇
  1987年   3篇
  1986年   3篇
  1985年   5篇
  1984年   2篇
  1983年   1篇
  1982年   3篇
  1981年   6篇
  1980年   3篇
  1979年   4篇
  1978年   4篇
  1977年   1篇
  1976年   1篇
  1974年   1篇
排序方式: 共有368条查询结果,搜索用时 31 毫秒
1.
A method using third order moments for estimating the regression coefficients as well as the latent state scores of the reduced-rank regression model when the latent variable(s) are non-normally distributed is presented in this paper. It is shown that the factor analysis type indeterminacy of the regression coefficient matrices is eliminated. A real life example of the proposed method is presented. Differences of this solution with the reduced-rank regression eigen solution are discussed.  相似文献   
2.
Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.  相似文献   
3.
We prove a property of the Bouligand tangent cone to the epigraph (or to the graph) of a locally Lipschitz function. It is also shown how this result can be used in determining Dini sequences. Finally, some relationships between such a cone and Dini derivatives are provided.  相似文献   
4.
Combining the results of Walczak (Ref. 1) and Lasiecka (Refs. 2 and 3), we extend the well-known Dubovicki-Milutin theorem in two directions: (i) We allow for treatment of several equality constraints in optimization problems; and (ii) We assume less regularity of optimization problems by requiring the existence of external cones instead of tangent cones. An example of an optimization problem is also considered.  相似文献   
5.
本文讨论了笔者在[1]中提出的伪凸集,拟凸集的支撑函数与障碍锥的性质,并通过这些性质得出了二个闭性准则。  相似文献   
6.
This paper is mainly dealt with the structure of totally ordered rings (t.o. rings) whose positive cones are finitely generated as multiplicative right ideals.AMS Subject Classification (1991): 16W80, 13J25  相似文献   
7.
Generalized Equilibrium Problems and Generalized Complementarity Problems   总被引:2,自引:0,他引:2  
From a general minimax inequality or an abstract lopsided saddle-point theorem, we deduce general Karamardian-type equilibrium theorems and generalized complementarity theorems. Our new results extend a number of well-known earlier works of many authors.  相似文献   
8.
Optimality for set functions with values in ordered vector spaces   总被引:3,自引:0,他引:3  
Let (X, , ) be a finite atomless measure space,L a convex subfamily of , andY andZ locally convex Hausdorff topological vector spaces which are ordered by the conesC andD, respectively. LetF:LY beC-convex andG:LZ beD-convex set functions. Consider the following optimization problem (P): minimizeF(), subject to L andG() D . The paper generalizes the Moreau-Rockafellar theorem with set functions. By applying this theorem, a Kuhn-Tucker type optimality condition and a Fritz John type optimality condition for problem (P) are established. The duality theorem for problem (P) is also studied.This work was partially supported by National Science Council, Taipei, Taiwan. This paper was written while the first author was visiting at the University of Iowa, 1987-88.The authors would like to express their gratitude to the two anonymous referees for their valuable comments. Also, they would like to thank Professor P. L. Yu for his encouragement and suggestions which improved the material presented here considerably.  相似文献   
9.
Necessary conditions for a given pointx 0 to be a locally weak solution to the Pareto minimization problem of a vector-valued functionF=(f 1,...,f m ),F:XR m,XR m, are presented. As noted in Ref. 1, the classical necessary condition-conv {Df 1(x 0)|i=1,...,m}T *(X, x 0) need not hold when the contingent coneT is used. We have proven, however, that a properly adjusted approximate version of this classical condition always holds. Strangely enough, the approximation form>2 must be weaker than form=2.The authors would like to thank the anonymous referee for the suggestions which led to an improved presentation of the paper.  相似文献   
10.
It is shown that, given a lower semicontinuous convex integrandf satisfying a suitable integrability condition, there exists a sequence of Lipschitz simple integrands which Mosco converges tof and such that the sequence of conjugate integrands Mosco converges tof *. Moreover, this sequence can be chosen so that the sequence of associated integral functionals, respectively defined onL 1(X) andL (X *), Mosco converges as well.We wish to thank Professor Erik J. Balder for interesting remarks on the first version of this work.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号