全文获取类型
收费全文 | 1090篇 |
免费 | 124篇 |
国内免费 | 41篇 |
专业分类
化学 | 35篇 |
晶体学 | 2篇 |
力学 | 266篇 |
综合类 | 18篇 |
数学 | 705篇 |
物理学 | 229篇 |
出版年
2023年 | 13篇 |
2022年 | 18篇 |
2021年 | 23篇 |
2020年 | 22篇 |
2019年 | 28篇 |
2018年 | 25篇 |
2017年 | 33篇 |
2016年 | 42篇 |
2015年 | 26篇 |
2014年 | 55篇 |
2013年 | 62篇 |
2012年 | 72篇 |
2011年 | 54篇 |
2010年 | 48篇 |
2009年 | 47篇 |
2008年 | 48篇 |
2007年 | 75篇 |
2006年 | 59篇 |
2005年 | 55篇 |
2004年 | 51篇 |
2003年 | 36篇 |
2002年 | 65篇 |
2001年 | 39篇 |
2000年 | 41篇 |
1999年 | 42篇 |
1998年 | 25篇 |
1997年 | 17篇 |
1996年 | 16篇 |
1995年 | 16篇 |
1994年 | 23篇 |
1993年 | 21篇 |
1992年 | 11篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 5篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1982年 | 4篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1971年 | 1篇 |
1957年 | 3篇 |
排序方式: 共有1255条查询结果,搜索用时 15 毫秒
1.
研究来源于多元统计分析中的一类矩阵迹函数最小化问题$\min c+ tr(AX)+\sum\limits_{j=1}^{m}tr(B_j X C_jX^{T}),\ \ {\rm s. t.} \ X^TX=I_p,$其中$c$为常数, $A\in R^{p\times n}\ (n\geq p)$, $B_j\in R^{n\times n}, C_j\in R^{p\times p}$为给定系数矩阵. 数值实验表明已有的Majorization算法虽可行, 但收敛速度缓慢且精度不高. 本文从黎曼流形的角度重新研究该问题, 基于Stiefel流形的几何性质, 构造一类黎曼非单调共轭梯度迭代求解算法, 并给出算法收敛性分析.数值实验和数值比较验证所提出的算法对于问题模型是高效可行的. 相似文献
2.
《Operations Research Letters》2022,50(3):246-253
We consider a model in which the representative investor makes optimal portfolio and consumption choices robust to ambiguity with a sustainable constraint. We find that the influences of ambiguity on risk-taking are two ways. Those are gambling when the risk-free interest rate is less than a critical value, but derisk when the risk-free interest rate is greater than the critical value. Moreover, the erosion of ambiguity on consumption is more substantial in constrained cases, and ambiguity will magnify welfare losses. 相似文献
3.
针对近年来养老金管理遇到的问题,基于模型不确定性,考虑随机环境和退休保障限制的DC型养老金最优投资策略具有重要意义.以养老金的最终价值相对于退休后年金担保的不变相对风险厌恶期望效用最大化为目标,利用随机动态规划的方法,求出鲁棒最优投资策略及相应的价值函数.最后,通过数值分析,得到各参数对最优投资策略的影响. 相似文献
4.
Ieva
Dauickait Amos S. Lawless Jennifer A. Scott Peter Jan van Leeuwen 《Numerical Linear Algebra with Applications》2020,27(5)
We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds. 相似文献
5.
6.
《中国化学快报》2020,31(9):2353-2357
NiS2 has become a research hotspot of anode materials for Na-ion batteries due to its high theoretical specific capacity. However, the volume effect, the dissolution of polysulfide intermediates and the low conductivity during the charge/discharge process lead to the low specific capacity and poor cycling stability. NiS2/rGO nanocomposite was prepared by a facile two-step process: GO was prepared by modified Hummers method, and then NiS2/rGO nanocomposite was synthesized by l-cys assisted hydrothermal method. NiS2/rGO nanocomposite shows excellent cycle performance and rate performance, which could be attributed to the mesoporous structure on the graphene skeleton with high conductivity. Besides, the chemical constraint of a unique SO bond on NiS2 could inhibit the dissolution of intermediates and the loss of irreversible capacity. 相似文献
7.
演化算法能够同时满足结构拓扑优化的前沿领域对全局优化、黑箱函数优化、组合优化和多目标优化的需求,但采用此类算法的可行性与必要性由其收敛性与计算效率决定。本文以应力约束桁架多目标拓扑优化问题为求解对象,致力于揭示在收敛性与计算效率两方面具有竞争力的算法。首先提出评估演化算法求解拓扑优化问题收敛性与计算效率的通用方法,采用穷举法严格推导了典型桁架多目标拓扑优化问题的全局最优解,并采用超体积指标定义了多层次收敛性能准则。最后通过比较研究得到不同收敛性需求下具有最快收敛速度的演化算法,并揭示了具有竞争力的算法机制。本研究为演化算法求解多目标拓扑优化问题的收敛速度奠定了理论基础,同时为高效求解实际工程拓扑优化问题提供算法支持。 相似文献
8.
Given an undirected graph, a star partition is a partition of the nodes into subsets with at least two nodes so that the subgraph induced by each subset has a spanning star. Star partitions are related to well-known problems concerning domination in graphs and edge covering. We focus on the Constrained Star Partition Problem (CSP) that asks for finding a star partition of given cardinality. The problem is new and presents interesting peculiarities. We explore the relation between the cardinalities of star partitions and domatic bipartitions, showing that there are star partitions of any cardinality between minimum and maximum values, and that a similar but weaker result holds for domatic bipartitions. We study the computational complexity of different versions of star partition and domatic bipartition problems, proving that most of them, in particular CSP, constrained domatic bipartition and balanced domatic bipartition, are NP-complete. We also show that star partition problems are polynomial on trees and, more generally, on bounded treewidth graphs. We introduce an integer linear programming formulation that defines a polytope containing all the star partitions of a graph, showing that its vertices have only integral components for trees, which implies that linear programming can be used to solve weighted star partition problems on trees. 相似文献
9.
10.
《Operations Research Letters》2020,48(5):549-551
We generalize the result of Yaari (1965) on annuitization with borrowing constraint. We show that inability to borrow against future labor income has a significant influence on an individual’s consumption and asset allocation strategies. We also show that there exists a certain threshold of wealth for annuitization. We find that the wealth threshold is lower in the presence of borrowing constraint than in its absence, implying the individual’s earlier retirement. 相似文献