全文获取类型
收费全文 | 9856篇 |
免费 | 752篇 |
国内免费 | 276篇 |
专业分类
化学 | 1318篇 |
晶体学 | 31篇 |
力学 | 1097篇 |
综合类 | 151篇 |
数学 | 6767篇 |
物理学 | 1520篇 |
出版年
2024年 | 21篇 |
2023年 | 103篇 |
2022年 | 334篇 |
2021年 | 335篇 |
2020年 | 208篇 |
2019年 | 223篇 |
2018年 | 246篇 |
2017年 | 328篇 |
2016年 | 312篇 |
2015年 | 230篇 |
2014年 | 457篇 |
2013年 | 555篇 |
2012年 | 616篇 |
2011年 | 475篇 |
2010年 | 446篇 |
2009年 | 553篇 |
2008年 | 551篇 |
2007年 | 600篇 |
2006年 | 488篇 |
2005年 | 433篇 |
2004年 | 337篇 |
2003年 | 318篇 |
2002年 | 290篇 |
2001年 | 268篇 |
2000年 | 263篇 |
1999年 | 193篇 |
1998年 | 213篇 |
1997年 | 196篇 |
1996年 | 137篇 |
1995年 | 161篇 |
1994年 | 133篇 |
1993年 | 111篇 |
1992年 | 101篇 |
1991年 | 86篇 |
1990年 | 75篇 |
1989年 | 61篇 |
1988年 | 48篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 54篇 |
1984年 | 51篇 |
1983年 | 15篇 |
1982年 | 22篇 |
1981年 | 22篇 |
1980年 | 17篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
981.
由于近年来实际问题特别是大数据应用的发展,矩阵优化问题越来越得到优化研究者,甚至是其他领域的研究者的高度关注,成为热点问题.优化问题的扰动性分析是优化理论研究的基础与核心,为包括算法设计在内的优化研究提供重要的理论基础.由于矩阵优化问题的非多面体性,使得相应扰动分析理论的研究本质上与经典的多面体优化问题(非线性规划)不同.结合文献[1,2],简要介绍矩阵优化扰动性分析方面取得的若干最新进展. 相似文献
982.
Minh-Ngoc Tran David J. Nott Robert Kohn 《Journal of computational and graphical statistics》2017,26(4):873-882
Variational Bayes (VB) is rapidly becoming a popular tool for Bayesian inference in statistical modeling. However, the existing VB algorithms are restricted to cases where the likelihood is tractable, which precludes their use in many interesting situations such as in state--space models and in approximate Bayesian computation (ABC), where application of VB methods was previously impossible. This article extends the scope of application of VB to cases where the likelihood is intractable, but can be estimated unbiasedly. The proposed VB method therefore makes it possible to carry out Bayesian inference in many statistical applications, including state--space models and ABC. The method is generic in the sense that it can be applied to almost all statistical models without requiring too much model-based derivation, which is a drawback of many existing VB algorithms. We also show how the proposed method can be used to obtain highly accurate VB approximations of marginal posterior distributions. Supplementary material for this article is available online. 相似文献
983.
Oscar Hernan Madrid-Padilla James Scott 《Journal of computational and graphical statistics》2017,26(3):537-546
We present an approach for penalized tensor decomposition (PTD) that estimates smoothly varying latent factors in multiway data. This generalizes existing work on sparse tensor decomposition and penalized matrix decompositions, in a manner parallel to the generalized lasso for regression and smoothing problems. Our approach presents many nontrivial challenges at the intersection of modeling and computation, which are studied in detail. An efficient coordinate-wise optimization algorithm for PTD is presented, and its convergence properties are characterized. The method is applied both to simulated data and real data on flu hospitalizations in Texas and motion-capture data from video cameras. These results show that our penalized tensor decomposition can offer major improvements on existing methods for analyzing multiway data that exhibit smooth spatial or temporal features. 相似文献
984.
Richard Kueng Holger Rauhut Ulrich Terstiege 《Applied and Computational Harmonic Analysis》2017,42(1):88-116
We study the recovery of Hermitian low rank matrices from undersampled measurements via nuclear norm minimization. We consider the particular scenario where the measurements are Frobenius inner products with random rank-one matrices of the form for some measurement vectors , i.e., the measurements are given by . The case where the matrix to be recovered is of rank one reduces to the problem of phaseless estimation (from measurements ) via the PhaseLift approach, which has been introduced recently. We derive bounds for the number m of measurements that guarantee successful uniform recovery of Hermitian rank r matrices, either for the vectors , , being chosen independently at random according to a standard Gaussian distribution, or being sampled independently from an (approximate) complex projective t-design with . In the Gaussian case, we require measurements, while in the case of 4-designs we need . Our results are uniform in the sense that one random choice of the measurement vectors guarantees recovery of all rank r-matrices simultaneously with high probability. Moreover, we prove robustness of recovery under perturbation of the measurements by noise. The result for approximate 4-designs generalizes and improves a recent bound on phase retrieval due to Gross, Krahmer and Kueng. In addition, it has applications in quantum state tomography. Our proofs employ the so-called bowling scheme which is based on recent ideas by Mendelson and Koltchinskii. 相似文献
985.
Geometric Design of Anode-Supported Micro-Tubular Solid Oxide Fuel Cells by Multiphysics Simulations
下载免费PDF全文
![点击此处可从《化学物理学报(中文版)》网站下载免费的PDF全文](/ch/ext_images/free.gif)
High volumetric power density (VPD) is the basis for the commercial success of micro-tubular solid oxide fuel cells (mtSOFCs). To find maximal VPD (MVPD) for anode-supported mtSOFC (as-mtSOFC), the effects of geometric parameters on VPD are analyzed and the anode thickness, tan, and the cathode length, lca, are identified as the key design parameters. Thermo-fluid electrochemical models were built to examine the dependence of the electrical output on the cell parameters. The multiphysics model is validated by reproducing the experimental I-V curves with no adjustable parameters. The optimal lca and the corresponding MVPDs are then determined by the multiphysics model for 20 combinations of rin, the inner tube radius, and tan. And all these optimization are made at 1073.15 K. The results show that:(i) significant performance improvement may be achieved by geometry optimization, (ii) the seemingly high MVPD of 11 and 14 W/cm3 can be easily realized for as-mtSOFC with single-and double-terminal anode current collection, respectively. Moreover, the variation of the area specific power density with lca2(2 mm, 40 mm) is determined for three representative (rin, tan) combinations. Besides, it is demonstrated that the current output of mtSOFC with proper geometric parameters is comparable to that of planar SOFC. 相似文献
986.
987.
Xiao-Bing Li Zhi Lin Qi-Lin Wang Jia-Wei Chen 《Numerical Functional Analysis & Optimization》2017,38(11):1410-1425
This paper is concerned with Hölder continuity of the solution to a saddle point problem. Some new su?cient conditions for the uniqueness and Hölder continuity of the solution for a perturbed saddle point problem are established. Applications of the result on Hölder continuity of the solution for perturbed constrained optimization problems are presented under mild conditions. Examples are given to illustrate the obtained results. 相似文献
988.
In stochastic optimization models, the optimal solution heavily depends on the selected probability model for the scenarios. However, the scenario models are typically chosen on the basis of statistical estimates and are therefore subject to model error. We demonstrate here how the model uncertainty can be incorporated into the decision making process. We use a nonparametric approach for quantifying the model uncertainty and a minimax setup to find model-robust solutions. The method is illustrated by a risk management problem involving the optimal design of an insurance contract. 相似文献
989.
We study the convex hull of a set arising as a relaxation of difficult convex mixed integer quadratic programs (MIQP). We characterize the extreme points of the convex hull of the set and the extreme points of its continuous relaxation. We derive four quadratic cutting surfaces that improve the strength of the continuous relaxation. Each of the cutting surfaces is second-order-cone representable. Via a shooting experiment, we provide empirical evidence as to the importance of each inequality type in improving the relaxation. Computational results that employ the new cutting surfaces to strengthen the relaxation for MIQPs arising from portfolio optimization applications are promising. 相似文献
990.
We study the convex hull of the intersection of a disjunctive set defined by parallel hyperplanes and the feasible set of a mixed integer second order cone optimization (MISOCO) problem. We extend our prior work on disjunctive conic cuts (DCCs), which has thus far been restricted to the case in which the intersection of the hyperplanes and the feasible set is bounded. Using a similar technique, we show that one can extend our previous results to the case in which that intersection is unbounded. We provide a complete characterization in closed form of the conic inequalities required to describe the convex hull when the hyperplanes defining the disjunction are parallel. 相似文献