全文获取类型
收费全文 | 393篇 |
免费 | 43篇 |
国内免费 | 26篇 |
专业分类
化学 | 12篇 |
晶体学 | 1篇 |
力学 | 73篇 |
综合类 | 13篇 |
数学 | 316篇 |
物理学 | 47篇 |
出版年
2023年 | 3篇 |
2022年 | 1篇 |
2021年 | 10篇 |
2020年 | 17篇 |
2019年 | 8篇 |
2018年 | 15篇 |
2017年 | 14篇 |
2016年 | 19篇 |
2015年 | 15篇 |
2014年 | 15篇 |
2013年 | 38篇 |
2012年 | 27篇 |
2011年 | 17篇 |
2010年 | 15篇 |
2009年 | 15篇 |
2008年 | 16篇 |
2007年 | 14篇 |
2006年 | 21篇 |
2005年 | 21篇 |
2004年 | 15篇 |
2003年 | 17篇 |
2002年 | 17篇 |
2001年 | 10篇 |
2000年 | 20篇 |
1999年 | 10篇 |
1998年 | 12篇 |
1997年 | 3篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1985年 | 2篇 |
1984年 | 7篇 |
1981年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
排序方式: 共有462条查询结果,搜索用时 0 毫秒
461.
Julia Böttcher Yoshiharu Kohayakawa Aldo Procacci 《Random Structures and Algorithms》2012,40(4):425-436
Let G be a graph on n vertices with maximum degree Δ. We use the Lovász local lemma to show the following two results about colourings χ of the edges of the complete graph Kn. If for each vertex v of Kn the colouring χ assigns each colour to at most (n ‐ 2)/(22.4Δ2) edges emanating from v, then there is a copy of G in Kn which is properly edge‐coloured by χ. This improves on a result of Alon, Jiang, Miller, and Pritikin [Random Struct. Algorithms 23(4), 409–433, 2003]. On the other hand, if χ assigns each colour to at most n/(51Δ2) edges of Kn, then there is a copy of G in Kn such that each edge of G receives a different colour from χ. This proves a conjecture of Frieze and Krivelevich [Electron. J. Comb. 15(1), R59, 2008]. Our proofs rely on a framework developed by Lu and Székely [Electron. J. Comb. 14(1), R63, 2007] for applying the local lemma to random injections. In order to improve the constants in our results we use a version of the local lemma due to Bissacot, Fernández, Procacci, and Scoppola [preprint, arXiv:0910.1824]. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 425–436, 2012 相似文献
462.
In this paper a high‐fidelity aerodynamic model is presented for use in parametric studies of weapon aerodynamics. The method employs a reduced‐order model obtained from the proper orthogonal decomposition (POD) of an ensemble of computational fluid dynamics (CFD) solutions with varying parameters. This decomposition produces an optimal linear set of orthogonal basis functions that best describe the ensemble of numerical solutions. These solutions are then projected onto this set of basis functions to provide a finite set of scalar coefficients that represent the solutions. A pseudo‐continuous representation of these projection coefficients is constructed, which allows predictions to be made of parameter combinations not in the original set of observations. The paper explores the performance of a few design‐of‐experiment approaches for the generation of the initial ensemble of computational experiments. Response surface construction methods based on parametric and non‐parametric models for the pseudo‐continuous representation of the projection coefficients are also evaluated. The model has been applied to two‐flow problems related to high‐speed weapon aerodynamics, inviscid flow around a flare‐stabilized hypersonic projectile and supersonic turbulent flow around a fin‐stabilized projectile with drooping nose control. Comparisons of model predictions with high‐fidelity CFD simulations suggest that the POD provides a reliable and robust approach to the construction of reduced‐order models. The practicality of the model is shown to be sensitive to the technique used to generate the ensemble of observations from which the model is constructed, while the accuracy of the approach depends on the pseudo‐continuous representation of the projection coefficients. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献