全文获取类型
收费全文 | 180篇 |
免费 | 33篇 |
国内免费 | 8篇 |
专业分类
化学 | 12篇 |
力学 | 12篇 |
综合类 | 4篇 |
数学 | 122篇 |
物理学 | 71篇 |
出版年
2023年 | 3篇 |
2022年 | 9篇 |
2021年 | 11篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 6篇 |
2017年 | 5篇 |
2016年 | 6篇 |
2015年 | 2篇 |
2014年 | 7篇 |
2013年 | 13篇 |
2012年 | 17篇 |
2011年 | 18篇 |
2010年 | 8篇 |
2009年 | 9篇 |
2008年 | 9篇 |
2007年 | 7篇 |
2006年 | 15篇 |
2005年 | 6篇 |
2004年 | 9篇 |
2003年 | 9篇 |
2002年 | 3篇 |
2001年 | 3篇 |
2000年 | 7篇 |
1999年 | 3篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1991年 | 1篇 |
1989年 | 1篇 |
1986年 | 2篇 |
1982年 | 1篇 |
排序方式: 共有221条查询结果,搜索用时 15 毫秒
41.
对多元多项式分次插值适定结点组的构造理论进行了深入的研究与探讨.在沿无重复分量代数曲线进行Lagrange插值的基础上,给出了沿无重复分量分次代数曲线进行分次Lagrane插值的方法,并利用这一结果进一步给出了在R~2上构造分次Lagrange插值适定结点组的基本方法.另外,利用弱Gr(o|¨)bner基这一新的数学概念,以及构造平面代数曲线上插值适定结点组的理论,进一步给出了构造平面分次代数曲线上分次插值适定结点组的方法,从而基本上弄清了多元分次Lagrange插值适定结点组的几何结构和基本特征. 相似文献
42.
在构造拉格朗日插值算法时,插值结点的选择是十分重要的.给定一个足够光滑的函数,如果结点选择的不好,当插值结点个数趋于无穷时,插值函数不收敛于函数本身.例如龙格现象:对于龙格函数f(x)=1/1+25x^2,如果拉格朗日插值的结点取[-1,1]上的等距结点,那么逼近的误差会随着结点个数增多而趋于无穷大⑴,由此可知插值结点的选择尤为重要. 相似文献
43.
The interference property of the fluorescence field from two nonidentical atoms driven by a laser field is investigated. It is found that there are differences for the intensity and the second-order correlation function between the two identical atoms system and the two nonidentical atoms system. It is shown that the intensity and the second-order correlation function have different behaviors under the weak laser field and the strong case for two identical atoms and two nonidentical atoms systems. 相似文献
44.
Koduru Hajarathaiah Murali Krishna Enduri Satish Anamalamudi Tatireddy Subba Reddy Srilatha Tokala 《Entropy (Basel, Switzerland)》2022,24(5)
Computing influential nodes gets a lot of attention from many researchers for information spreading in complex networks. It has vast applications, such as viral marketing, social leader creation, rumor control, and opinion monitoring. The information-spreading ability of influential nodes is greater compared with other nodes in the network. Several researchers proposed centrality measures to compute the influential nodes in a complex network, such as degree, betweenness, closeness, semi-local centralities, and PageRank. These centrality methods are defined based on the local and/or global information of nodes in the network. However, due to their high time complexity, centrality measures based on the global information of nodes have become unsuitable for large-scale networks. Very few centrality measures exist that are based on the attributes between nodes and the structure of the network. We propose the nearest neighborhood trust PageRank (NTPR) based on the structural attributes of neighbors and nearest neighbors of nodes. We define the measure based on the degree ratio, the similarity between nodes, the trust values of neighbors, and the nearest neighbors. We computed the influential nodes in various real-world networks using the proposed centrality method. We found the maximum influence by using influential nodes with SIR and independent cascade methods. We also compare the maximum influence of our centrality measure with the existing basic centrality measures. 相似文献
45.
Yajing Hao Shaoting Tang Longzhao Liu Hongwei Zheng Xin Wang Zhiming Zheng 《Entropy (Basel, Switzerland)》2022,24(9)
Identifying the most influential spreaders in online social networks plays a prominent role in affecting information dissemination and public opinions. Researchers propose many effective identification methods, such as k-shell. However, these methods are usually validated by simulating propagation models, such as epidemic-like models, which rarely consider the Push-Republish mechanism with attenuation characteristic, the unique and widely-existing spreading mechanism in online social media. To address this issue, we first adopt the Push-Republish (PR) model as the underlying spreading process to check the performance of identification methods. Then, we find that the performance of classical identification methods significantly decreases in the PR model compared to epidemic-like models, especially when identifying the top 10% of superspreaders. Furthermore, inspired by the local tree-like structure caused by the PR model, we propose a new identification method, namely the Local-Forest (LF) method, and conduct extensive experiments in four real large networks to evaluate it. Results highlight that the Local-Forest method has the best performance in accurately identifying superspreaders compared with the classical methods. 相似文献
46.
针对直升机舱门结构强度有限元力学分析中,不均匀分布气动载荷难以施加的问题,提出基于数学分析,采用最小二乘法,对直升机机身局部结构的气动压力点的压力值进行压力分布曲面拟合,快速得到所有有限元节点的压力值,并通过Patran分析软件前处理中的Field (域)功能实现对有限元节点快速加载。该方法对某型机舱门的不均匀分布气动载荷加载进行验证,结果表明该方法精度高,可快速实现不均匀分布载荷的施加,有效解决有限元仿真分析前处理中不均匀载荷的加载问题。 相似文献
47.
Laiyi Zhu Zhiyong Huang School of Information People's University of China Beijing P. R. China 《分析论及其应用》2009,(1)
We study the optimal order of approximation for |x|α (0 < α < 1) by Lagrange interpolation polynomials based on Chebyshev nodes of the first kind. It is proved that the Jackson order of approximation is attained. 相似文献
48.
It is a classical result of Bernstein that the sequence of Lagrange interpolation polynomials to |x| at equally spaced nodes in [-1, 1] diverges everywhere, except at zero and the end-points. In the present paper, we prove that the sequence of Lagrange interpolation polynomials corresponding to |x|α(2 <α< 4) on equidistant nodes in [-1,1] diverges everywhere, except at zero and the end-points. 相似文献
49.
Sven Ehrich Giuseppe Mastroianni 《Journal of Computational Analysis and Applications》2000,2(2):125-147
The Gauss-Kronrod quadrature scheme, which is based on the zeros of Legendrepolynomials and Stieltjes polynomials, is a standard rule for automaticnumerical integration in mathematical software libraries. For a long time,very little was known about the underlying Lagrange interpolationprocesses. Recently, the authors proved new bounds and asymptoticproperties for the Stieltjes polynomials and, subsequently, appliedthese results to investigate the associated interpolation processes. Thepurpose of this paper is to survey the quality of these interpolationprocesses, with additional results that extend and complete the existingones. The principal new results in this paper are necessary and sufficientconditions for weighted convergence. In particular, we show that theLagrange interpolation polynomials associated with the above interpolationprocesses have the same speed of convergence as the polynomials of bestapproximation in certain weighted Besov spaces. 相似文献
50.
The detection of overlapping community structure in networks can give insight into the structures and functions of many complex systems. In this paper, we propose a simple but efficient overlapping community detection method for very large real-world networks. Taking a high-quality, non-overlapping partition generated by existing, efficient, non-overlapping community detection methods as input, our method identifies overlapping nodes between each pair of connected non-overlapping communities in turn. Through our analysis on modularity, we deduce that, to become an overlapping node without demolishing modularity, nodes should satisfy a specific condition presented in this paper. The proposed algorithm outputs high quality overlapping communities by efficiently identifying overlapping nodes that satisfy the above condition. Experiments on synthetic and real-world networks show that in most cases our method is better than other algorithms either in the quality of results or the computational performance. In some cases, our method is the only one that can produce overlapping communities in the very large real-world networks used in the experiments. 相似文献