全文获取类型
收费全文 | 499篇 |
免费 | 33篇 |
国内免费 | 4篇 |
学科分类
数理化 | 536篇 |
出版年
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 8篇 |
2019年 | 9篇 |
2018年 | 11篇 |
2017年 | 14篇 |
2016年 | 13篇 |
2015年 | 12篇 |
2014年 | 31篇 |
2013年 | 14篇 |
2012年 | 26篇 |
2011年 | 27篇 |
2010年 | 21篇 |
2009年 | 44篇 |
2008年 | 20篇 |
2007年 | 35篇 |
2006年 | 23篇 |
2005年 | 31篇 |
2004年 | 16篇 |
2003年 | 10篇 |
2002年 | 21篇 |
2001年 | 15篇 |
2000年 | 15篇 |
1999年 | 12篇 |
1998年 | 11篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 10篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1988年 | 4篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 3篇 |
排序方式: 共有536条查询结果,搜索用时 31 毫秒
1.
介绍了一种可用于实时监测直径0.2~1.0 mm激光核聚变靶球涂敷状态的光学系统的设计,系统采用环形LED照明系统以适合特殊的照明要求,用Petzval型物镜使500 mm处的微球清晰成像于CCD像面上,CCD输出的图像电信号经图像采集卡转换成数字信号,最后该数字信号由计算机进行处理,实现了系统对靶球膜层涂敷作业的自动监控,大大提高了涂敷效率。所设计的系统轴上点最大弥散斑直径为12.6 mm,轴外最大弥散斑直径为15.8 mm,整个视场的像质比较均匀,分辨率较高,对于波长522 nm的光线,场曲和畸变分别小于15 mm和0.012%,像质优良。 相似文献
2.
We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help. 相似文献
3.
In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques. 相似文献
4.
5.
Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce. 相似文献
6.
We propose objectives consisting of two mirrors with central holes for passage of a light beam. The optical layout ensures
multiple reflection of rays from both mirrors. We consider several approaches to calculating the design parameters for which
three and four aberrations do not occur. The objectives can be used in optical devices operating in the UV and IR regions
of the spectrum.
__________
Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 74, No. 2, pp. 267–270, March–April, 2007. 相似文献
7.
Dirk P. Kroese Sergey Porotsky Reuven Y. Rubinstein 《Methodology and Computing in Applied Probability》2006,8(3):383-407
In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In
this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness
of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear
constraints.
相似文献
8.
In this paper an algorithm is developed to generate all nondominated extreme points and edges of the set of objective values of a multiple objective linear program. The approach uses simplex tableaux but avoids generating unnecessary extreme points or bases of extreme points. The procedure is based on, and improves, an algorithm Dauer and Liu developed for this problem. Essential to this approach is the work of Gal and Kruse on the neighborhood problem of determining all extreme points of a convex polytope that are adjacent to a given (degenerate) extreme point of the set. The algorithm will incorporate Gal's degeneracy graph approach to the neighborhood problem with Dauer's objective space analysis of multiple objective linear programs. 相似文献
9.
Wojciech Paszkowicz 《Analytica chimica acta》2006,566(1):81-98
Genetic algorithms represent a powerful global-optimisation tool applicable in solving tasks of high complexity in science, technology, medicine, communication, etc. The usual genetic-algorithm calculation scheme is extended here by introduction of a quadratic self-learning operator, which performs a partial local search for randomly selected representatives of the population. This operator is aimed as a minor deterministic contribution to the (stochastic) genetic search. The population representing the trial solutions is split into two equal subpopulations allowed to exhibit different mutation rates (so called asymmetric mutation). The convergence is studied in detail exploiting a crystallographic-test example of indexing of powder diffraction data of orthorhombic lithium copper oxide, varying such parameters as mutation rates and the learning rate. It is shown through the averaged (over the subpopulation) fitness behaviour, how the genetic diversity in the population depends on the mutation rate of the given subpopulation. Conditions and algorithm parameter values favourable for convergence in the framework of proposed approach are discussed using the results for the mentioned example. Further data are studied with a somewhat modified algorithm using periodically varying mutation rates and a problem-specific operator. The chance of finding the global optimum and the convergence speed are observed to be strongly influenced by the effective mutation level and on the self-learning level. The optimal values of these two parameters are about 6 and 5%, respectively. The periodic changes of mutation rate are found to improve the explorative abilities of the algorithm. The results of the study confirm that the applied methodology leads to improvement of the classical genetic algorithm and, therefore, it is expected to be helpful in constructing of algorithms permitting to solve similar tasks of higher complexity. 相似文献
10.
Ignacy Kaliszewski Janusz MiroforidisDmitry Podkopaev 《European Journal of Operational Research》2012,216(1):188-199
We present an approach to interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy.The approach relies on formulae for lower and upper bounds on coordinates of the outcome of an arbitrary efficient variant corresponding to preference information expressed by the Decision Maker. In contrast to earlier works on that subject, here lower and upper bounds can be calculated and their accuracy controlled entirely within evolutionary computation framework. This is made possible by exploration of not only the region of feasible variants - a standard within evolutionary optimization, but also the region of infeasible variants, the latter to our best knowledge being a novel approach within Evolutionary Multiobjective Optimization.To illustrate how this concept can be applied to interactive Multiple Criteria Decision Making, two algorithms employing evolutionary computations are proposed and their usefulness demonstrated by a numerical example. 相似文献