全文获取类型
收费全文 | 109篇 |
免费 | 14篇 |
国内免费 | 5篇 |
专业分类
化学 | 50篇 |
力学 | 12篇 |
综合类 | 5篇 |
数学 | 43篇 |
物理学 | 18篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 4篇 |
2018年 | 2篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2015年 | 5篇 |
2014年 | 2篇 |
2013年 | 10篇 |
2012年 | 9篇 |
2011年 | 6篇 |
2010年 | 7篇 |
2009年 | 3篇 |
2008年 | 5篇 |
2007年 | 2篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 10篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1991年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有128条查询结果,搜索用时 234 毫秒
21.
Deficiencies in energetics obtained using the common semiempirical methods, AM1, PM3, and MNDO, may partly be traced to the use of pseudoatomic equivalents for conversion of molecular energies to heats of formation at 298 K. We present an alternative scheme based on the use of bond and group equivalents. Values for the 61 bond and group equivalents necessary for treatment of molecules containing the common organic elements, hydrogen, carbon, nitrogen, and oxygen have been derived. For a set of 583 neutral, closed-shell molecules mean absolute errors in AM1, PM3, and MNDO heats of formation are reduced from 6.6, 4.2, and 8.2 kcal/mol to 2.3, 2.2, and 3.0 kcal/mol, respectively. Several systematic problems are overcome in the present scheme including relative stabilities of branched hydrocarbons, energetics of conjugated systems, heats of formation of long chain hydrocarbons, and enthalpies of molecules containing multiple heteroatoms. Although the approach is restricted to molecules with well-defined functional groups, the equivalents are easy to incorporate and are chemically relevant. This revised procedure allows semiempirical methods to be used for far more reliable evaluations of heats of reactions. Estimates are made of the errors inherent in these semiempirical formalisms, arising from integral approximations and the neglect of explicit treatment of electron correlation effects, while excluding those from inadequate parameterization. 相似文献
22.
Aleksandar Jurišić Jack Koolen Paul Terwilliger 《Journal of Algebraic Combinatorics》2000,12(2):163-197
We consider a distance-regular graph with diameter d 3 and eigenvalues k = 0 > 1 > ... >
d
. We show the intersection numbers a
1, b
1 satisfy
We say is tight whenever is not bipartite, and equality holds above. We characterize the tight property in a number of ways. For example, we show is tight if and only if the intersection numbers are given by certain rational expressions involving d independent parameters. We show is tight if and only if a
1 0, a
d = 0, and is 1-homogeneous in the sense of Nomura. We show is tight if and only if each local graph is connected strongly-regular, with nontrivial eigenvalues –1 – b
1(1 + 1)–1 and –1 – b
1(1 +
d
)–1. Three infinite families and nine sporadic examples of tight distance-regular graphs are given. 相似文献
23.
《Optimization》2012,61(7):961-973
In this article, we present and compare three mean-variance optimal portfolio approaches in a continuous-time market setting. These methods are the L 2-projection as presented in Schweizer [M. Schweizer, Approximation of random variables by stochastic integrals, Ann. Prob. 22 (1995), pp. 1536–1575], the Lagrangian function approach of Korn and Trautmann [R. Korn and S. Trautmann, Continuous-time portfolio optimization under terminal wealth constraints, ZOR-Math. Methods Oper. Res. 42 (1995), pp. 69–92] and the direct deterministic approach of Lindberg [C. Lindberg, Portfolio optimization when expected stock returns are determined by exposure to risk, Bernoulli 15 (2009), pp. 464–474]. As the underlying model, we choose the recent innovative market parameterization introduced by Lindberg (2009) that has the particular aim to overcome the estimation problems of the stock price drift parameters. We derive some new results for the Lagrangian function approach, in particular explicit representations for the optimal portfolio process. Further, we compare the different optimization frameworks in detail and highlight their attractive and not so attractive features by numerical examples. 相似文献
24.
When fitting parametric polynomial curves to sequences of points or derivatives we have to choose suitable parameter values
at the interpolation points. This paper investigates the effect of the parameterization on the approximation order of the
interpolation. We show that chord length parameter values yield full approximation order when the polynomial degree is at
most three. We obtain full approximation order for arbitrary degree by developing an algorithm which generates more and more
accurate approximations to arc length: the lengths of the segments of an interpolant of one degree provide parameter intervals
for interpolants of degree two higher. The algorithm can also be used to estimate the length of a curve and its arc-length
derivatives.
AMS subject classification (2000) 65D05, 65D10 相似文献
25.
26.
The estimation of the covariance matrix is a key concern in the analysis of longitudinal data. When data consist of multiple groups, it is often assumed the covariance matrices are either equal across groups or are completely distinct. We seek methodology to allow borrowing of strength across potentially similar groups to improve estimation. To that end, we introduce a covariance partition prior that proposes a partition of the groups at each measurement time. Groups in the same set of the partition share dependence parameters for the distribution of the current measurement given the preceding ones, and the sequence of partitions is modeled as a Markov chain to encourage similar structure at nearby measurement times. This approach additionally encourages a lower-dimensional structure of the covariance matrices by shrinking the parameters of the Cholesky decomposition toward zero. We demonstrate the performance of our model through two simulation studies and the analysis of data from a depression study. This article includes Supplementary Materials available online. 相似文献
27.
The conventional exponential family random graph model (ERGM) parameterization leads to a baseline density that is constant in graph order (i.e., number of nodes); this is potentially problematic when modeling multiple networks of varying order. Prior work has suggested a simple alternative that results in constant expected mean degree. Here, we extend this approach by suggesting another alternative parameterization that allows for flexible modeling of scenarios in which baseline expected degree scales as an arbitrary power of order. This parameterization is easily implemented by the inclusion of an edge count/log order statistic along with the traditional edge count statistic in the model specification. 相似文献
28.
29.
为了进行堆芯计算,需要通过组件计算提前构建少群截面参数库。传统确定论的组件截面参数化方法针对宏观截面进行截面参数化,但这种方式不仅需要考虑多种物理状态参数,而且需要考虑历史效应对截面的影响。提出了基于核素微观截面的蒙卡程序参数化方法,该方法可以消除燃耗历史的影响,且考虑的物理状态仅为燃耗深度以及材料温度。利用蒙卡程序产生组件截面参数库耦合堆芯程序进行堆芯计算,首先用蒙卡程序同时统计对应状态点下的核素密度以及核素少群微观截面,再利用核素微观截面进而获得宏观截面进行后续堆芯计算。为了验证方法正确性,构造了一个自定义的压水堆模型,计算结果与连续能量蒙卡计算结果符合良好。 相似文献
30.