全文获取类型
收费全文 | 206篇 |
免费 | 4篇 |
国内免费 | 5篇 |
专业分类
化学 | 15篇 |
力学 | 2篇 |
数学 | 37篇 |
物理学 | 56篇 |
综合类 | 105篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 2篇 |
2017年 | 5篇 |
2016年 | 3篇 |
2014年 | 41篇 |
2013年 | 31篇 |
2012年 | 11篇 |
2011年 | 9篇 |
2010年 | 15篇 |
2009年 | 13篇 |
2008年 | 11篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 10篇 |
2004年 | 1篇 |
2003年 | 2篇 |
2002年 | 6篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1998年 | 5篇 |
1997年 | 1篇 |
1995年 | 3篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1986年 | 1篇 |
排序方式: 共有215条查询结果,搜索用时 5 毫秒
1.
2.
3.
This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R0-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically. 相似文献
4.
面子及对面子的需求在中西文化中具有不同的文化特征。通过对《围城》文本的分析,可以检验布朗和莱文森·的面子理论在中国文化中的价值与理论解释力,从而阐释中国文化中面子的特殊含义与礼貌表现。 相似文献
5.
基于特征脸的人脸检测与识别 总被引:1,自引:0,他引:1
人脸识别是属于生物特征识别范畴.然而与其他识别不同的是人脸是一个动态的图像,有位置与光照的变化,并且具有相似的外貌特征,这使得人脸识别成为一个比较困难的问题.文章阐述了基于特征脸的人脸检测与识别方法.该方法本质上是主要成分分析方法,他首先构造特征脸向量,然后计算新图像和数据库中特征脸的空间距离,来决定此图像是否是一副人脸图像,如果是人脸图像,他是那一副人脸图像。 相似文献
6.
Stable local feature detection is a critical prerequisite in the problem of infrared (IR) face recognition. Recently, Scale Invariant Feature Transform (SIFT) is introduced for feature detection in an infrared face frame, which is achieved by applying a simple and effective averaging window with SIFT termed as Y-styled Window Filter (YWF). However, the thermal IR face frame has an intrinsic characteristic such as lack of feature points (keypoints); therefore, the performance of the YWF-SIFT method will be inevitably influenced when it was used for IR face recognition. In this paper, we propose a novel method combining multi-scale fusion with YWF-SIFT to explore more good feature matches. The multi-scale fusion is performed on a thermal IR frame and a corresponding auxiliary visual frame generated from an off-the-shelf low-cost visual camera. The fused image is more informative, and typically contains much more stable features. Besides, the use of YWF-SIFT method enables us to establish feature correspondences more accurately. Quantitative experimental results demonstrate that our algorithm is able to significantly improve the quantity of feature points by approximately 38%. As a result, the performance of YWF-SIFT with multi-scale fusion is enhanced about 12% in infrared human face recognition. 相似文献
7.
8.
Tamás Hausel 《Central European Journal of Mathematics》2005,3(1):26-38
Building on a recent paper [8], here we argue that the combinatorics of matroids are intimately related to the geometry and topology of toric hyperkähler varieties. We show that just like toric varieties occupy a central role in Stanley’s proof for the necessity of McMullen’s conjecture (or g-inequalities) about the classification of face vectors of simplicial polytopes, the topology of toric hyperkähler varieties leads to new restrictions on face vectors of matroid complexes. Namely in this paper we will give two proofs that the injectivity part of the Hard Lefschetz theorem survives for toric hyperkähler varieties. We explain how this implies the g-inequalities for rationally representable matroids. We show how the geometrical intuition in the first proof, coupled with results of Chari [3], leads to a proof of the g-inequalities for general matroid complexes, which is a recent result of Swartz [20]. The geometrical idea in the second proof will show that a pure O-sequence should satisfy the g-inequalities, thus showing that our result is in fact a consequence of a long-standing conjecture of Stanley. 相似文献
9.
A modified first order kinetic law, which describes the roles of bound and unbound vacancies, is proposed in order to predict
defect decay and short-range-order kinetics of quenched binary alloys during linear heating experiments. The model has been
applied to differential scanning calorimetry (DSC) curves of Cu–5 at%Zn quenched from different temperatures. Activation energy
for migration of solute-vacancy complexes was also assessed from the kinetics of short-range-order using DSC traces. A value
of 89.5±0.32 kJ mol–1 was obtained. The relative contribution of bound and unbound vacancies to the ordering process as influenced by quenching
temperature was determined. In conjunction, a parametric study of the initial total defect concentration and effective energy
for defect migration was performed in order to envisage their influence on the calculated DSC profiles.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
10.
In many classification applications and face recognition tasks, there exist unlabelled data available for training along with
labelled samples. The use of unlabelled data can improve the performance of a classifier. In this paper, a semi-supervised
growing neural gas is proposed for learning with such partly labelled datasets in face recognition applications. The classifier
is first trained on the labelled data and then gradually unlabelled data is classified and added to the training data. The
classifier is retrained; and so on. The proposed iterative algorithm conforms to the EM framework and is demonstrated, on
both artificial and real datasets, to significantly boost the classification rate with the use of unlabelled data. The improvement
is particularly great when the labelled dataset is small. Comparison with support vector machine classifiers is also given.
The algorithm is computationally efficient and easy to implement. 相似文献