全文获取类型
收费全文 | 615篇 |
免费 | 12篇 |
国内免费 | 11篇 |
专业分类
化学 | 43篇 |
力学 | 22篇 |
综合类 | 7篇 |
数学 | 443篇 |
物理学 | 123篇 |
出版年
2023年 | 7篇 |
2022年 | 9篇 |
2021年 | 9篇 |
2020年 | 8篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 15篇 |
2016年 | 18篇 |
2015年 | 18篇 |
2014年 | 31篇 |
2013年 | 32篇 |
2012年 | 29篇 |
2011年 | 22篇 |
2010年 | 22篇 |
2009年 | 39篇 |
2008年 | 39篇 |
2007年 | 37篇 |
2006年 | 32篇 |
2005年 | 19篇 |
2004年 | 23篇 |
2003年 | 17篇 |
2002年 | 12篇 |
2001年 | 18篇 |
2000年 | 28篇 |
1999年 | 17篇 |
1998年 | 9篇 |
1997年 | 13篇 |
1996年 | 10篇 |
1995年 | 11篇 |
1994年 | 6篇 |
1993年 | 7篇 |
1992年 | 9篇 |
1991年 | 2篇 |
1989年 | 1篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 4篇 |
1985年 | 8篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1973年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有638条查询结果,搜索用时 15 毫秒
1.
模糊关系矩阵传递闭包的Warshall算法 总被引:8,自引:2,他引:6
通过对照关系的传递闭包和模糊关系的传递闭包,把求关系矩阵的传递闭包的算法完整地推广到模糊关系矩阵上。 相似文献
2.
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon. 相似文献
3.
This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting generic methods. These generalizations of a Genetic Algorithm (GA) are inspired by population genetics and take advantage of the interactions between genetic drift and migration. In this regard a new selection scheme is introduced, which is designed to directedly control genetic drift within the population by advantageous self-adaptive selection pressure steering. Additionally this new selection model enables a quite intuitive heuristics to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA), an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions. 相似文献
4.
构造一个求解椭圆型边值问题的多子域D—N交替算法,导出对应的容度方程和等价的迭代法,证明算法的收敛性。 相似文献
5.
6.
7.
用遗传算法拟合电力系统负荷短期预测的非线性模型 总被引:2,自引:0,他引:2
本文运用遗传算法,根据河北省1985—1990年春节期间每小时用电量的统计数字,建立了非线性回归模型(Gompertdz),结果表明,遗传算法性能良好,可望成为电力系统各种非线性模型辨识的有效手段。 相似文献
8.
具有两台专用机,两台通用机的Q4//Cmax问题的近似算法 总被引:8,自引:1,他引:7
本文讨论具有两台专用机、两台通用机的两组工件的同种类平行机的Q4//Cmax问题,对这类特殊的排序问题,提出一种启发式算法,得到了最差情况下性能指标的严格的界. 相似文献
9.
Hong Tao Gao Dong Mei Dai Tong Hua Li 《中国化学快报》2007,18(4):495-498
Non-negative matrix factorization(NMF)is a technique for dimensionality reduction by placing non-negativity constraints onthe matrix.Based on the PARAFAC model,NMF was extended for three-dimension data decomposition.The three-dimension non-negative matrix factorization(NMF3)algorithm,which was concise and easy to implement,was given in this paper.The NMF3algorithm implementation was based on elements but not on vectors.It could decompose a data array directly without unfolding,which was not similar to that the traditional algorithms do.It has been applied to the simulated data array decomposition andobtained reasonable results.It showed that NMF3 could be introduced for curve resolution in chemometrics. 相似文献
10.
A primal transportation algorithm is devised via post-optimization on the costs of a modified problem. The procedure involves altering the costs corresponding to the basic cells of the initial (primal feasible) solution so that it is dual feasible as well. The altered costs are then successively restored to their true values with appropriate changes in the optimal solution by the application of cell or area cost operators discussed elsewhere. The cell cost operator algorithm converges to optimum within (2T – 1) steps for primal nondegenerate transportation problems and [(2T + 1) min (m, n)] – 1 steps for primal degenerate transportation problems, whereT is the sum of the (integer) warehouse availabilities (also the sum of the (integer) market requirements) andm andn denote the number of warehouses and markets respectively. For the area cost operator algorithm the corresponding bounds on the number of steps areT and (T + 1) min (m, n) respectively.This report was prepared as part of the activities of the Management Sciences Research Group, Carnegie—Mellon University, under Contract N00014-67-A-0314-0007 NR 047-048 with the U.S. Office of Naval Research. 相似文献