全文获取类型
收费全文 | 235篇 |
免费 | 28篇 |
国内免费 | 10篇 |
专业分类
化学 | 7篇 |
力学 | 4篇 |
综合类 | 10篇 |
数学 | 220篇 |
物理学 | 32篇 |
出版年
2022年 | 3篇 |
2021年 | 9篇 |
2020年 | 6篇 |
2019年 | 8篇 |
2018年 | 8篇 |
2017年 | 1篇 |
2016年 | 11篇 |
2015年 | 6篇 |
2014年 | 19篇 |
2013年 | 16篇 |
2012年 | 8篇 |
2011年 | 13篇 |
2010年 | 12篇 |
2009年 | 13篇 |
2008年 | 34篇 |
2007年 | 18篇 |
2006年 | 13篇 |
2005年 | 13篇 |
2004年 | 3篇 |
2003年 | 7篇 |
2002年 | 15篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 6篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1985年 | 3篇 |
1982年 | 2篇 |
排序方式: 共有273条查询结果,搜索用时 15 毫秒
1.
2.
《Discrete Mathematics》2019,342(7):1956-1965
3.
4.
天体光谱包含着许多重要的关于天体的物理和化学信息,如天体表面的有效温度、重力加速度以及化学丰度等,天体光谱的处理和分析对天文研究具有重要的科学意义。一些大型巡天计划的实施(如SDSS,LAMOST等)使我们获得了海量的天文光谱数据,因此天文光谱数据的自动分类成为重要的科学研究课题,然而面对如此海量的光谱数据,一些传统的光谱自动分类方法已经不适用,迫切需要寻找高效率的光谱自动分类技术。研究了基于局部均值的K-近质心近邻(local mean-based K-nearest centroid neighbor,LMKNCN)算法在恒星(Star)、星系(Galaxy)和类星体(Quasar,QSO)的光谱分类中的应用。LMKNCN算法的基本思想是根据近质心近邻原则,从每一类训练样本集中为待测样本点选取k个近质心近邻点,然后根据每一类中所选取的k个近质心近邻点的均值点到待测样本点x的距离来判别x的所属类别。针对美国SDSS-DR8的天体光谱数据,对比了K-近邻、K-近质心近邻、LMKNCN三种算法在恒星、星系和类星体的光谱分类中所表现的性能,结果表明三种方法中,LMKNCN算法对这三种光谱的识别率高于其他两种算法或者与其相当,而且其平均分类正确率高于另外两种算法,特别是在类星体的识别率上表现的更好。表明了该算法对天文光谱大数据的快速处理和有效利用具有重要的意义。 相似文献
5.
6.
For parallel neighborhoods of the paths of the d ‐dimensional Brownian motion, so‐called Wiener sausages, formulae for the expected surface area are given for any dimension d ≥ 2. It is shown by means of geometric arguments that the expected surface area is equal to the first derivative of the mean volume of the Wiener sausage with respect to its radius (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
7.
[a,b]-对等图的范-型条件 总被引:1,自引:0,他引:1
既是[a,b]-覆盖又是[a,b]-消去的图称为[a,b]-对等图.设1≤aan+1a+b,则G为[a,b]-对等图.给出了一个图是[a,b]-对等图的关于范-型条件及邻域并的若干充分条件,并指出定理中的条件在一定意义上是最好可能的. 相似文献
8.
This study introduces a rollon–rolloff waste collection vehicle routing problem involving large containers that accumulate huge amounts of garbage at construction sites and shopping districts. In this problem, tractors move one container at a time between customer locations, a depot, disposal facilities, and container storage yards. The complicated constraints discussed in this study arise from having multiple disposal facilities, multiple container storage yards, seven service types of customer demands, different time windows for customer demands and facilities, various types and sizes of containers, and the lunch break of tractor drivers. In addition, real-world issues, such as changing service types, multiple demands at a customer’s location, and tractors with different work schedules, are dealt with. This study proposes a large neighborhood search based iterative heuristic approach consisting of several algorithms for the problem. The effectiveness of the proposed methods is demonstrated by computational experiments using benchmark data, some instances of which are derived from real-world problems. 相似文献
9.
In this survey, the notion of a balanced best multipoint local approximation is fully exposed since they were treated in the Lpspaces and recent results in Orlicz spaces. The notion of balanced point, which was introduced by Chui et al. in 1984 are extensively used. 相似文献
10.
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities 总被引:2,自引:0,他引:2
Michael Polacek Karl F. Doerner Richard F. Hartl Vittorio Maniezzo 《Journal of Heuristics》2008,14(5):405-423
The capacitated arc routing problem (CARP) focuses on servicing edges of an undirected network graph. A wide spectrum of applications
like mail delivery, waste collection or street maintenance outlines the relevance of this problem. A realistic variant of
the CARP arises from the need of intermediate facilities (IFs) to load up or unload the service vehicle and from tour length
restrictions. The proposed Variable Neighborhood Search (VNS) is a simple and robust solution technique which tackles the
basic problem as well as its extensions. The VNS shows excellent results on four different benchmark sets. Particularly, for
all 120 instances the best known solution could be found and in 71 cases a new best solution was achieved. 相似文献