全文获取类型
收费全文 | 677篇 |
免费 | 61篇 |
国内免费 | 8篇 |
专业分类
化学 | 35篇 |
力学 | 42篇 |
综合类 | 5篇 |
数学 | 331篇 |
物理学 | 131篇 |
无线电 | 202篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 8篇 |
2021年 | 11篇 |
2020年 | 14篇 |
2019年 | 15篇 |
2018年 | 12篇 |
2017年 | 19篇 |
2016年 | 29篇 |
2015年 | 23篇 |
2014年 | 49篇 |
2013年 | 30篇 |
2012年 | 38篇 |
2011年 | 33篇 |
2010年 | 32篇 |
2009年 | 56篇 |
2008年 | 30篇 |
2007年 | 46篇 |
2006年 | 31篇 |
2005年 | 37篇 |
2004年 | 21篇 |
2003年 | 20篇 |
2002年 | 24篇 |
2001年 | 22篇 |
2000年 | 20篇 |
1999年 | 15篇 |
1998年 | 15篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 11篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 3篇 |
排序方式: 共有746条查询结果,搜索用时 37 毫秒
61.
In this paper, we introduce a novel objective prior distribution levering on the connections between information, divergence and scoring rules. In particular, we do so from the starting point of convex functions representing information in density functions. This provides a natural route to proper local scoring rules using Bregman divergence. Specifically, we determine the prior which solves setting the score function to be a constant. Although in itself this provides motivation for an objective prior, the prior also minimizes a corresponding information criterion. 相似文献
62.
63.
64.
Abdelfatteh Haidine 《International Journal of Communication Systems》2013,26(10):1227-1242
In this work, we investigate the planning of hybrid fiber/very high bit rate digital subscriber line (HFV) access networks. This HFV variant is considered as an alternative to passive optical access network. It consists of implementing optical fibers in the access network part from the central office to the street cabinets, whereas the very high bit rate digital subscriber line technology is used in the last meter part, from street cabinets to subscribers. Firstly, we discuss the different tasks of this planning problem. We model this planning problem as a multi‐objective optimization problem, where different conflicting objectives have to be optimized at the same time. We consider network costs and network reliability. This problem is solved by two different approaches: the classical single‐objective optimization (SOO) and the multi‐objective optimization (MOO), which is a recent optimization approach that is gaining an increasing interest in practical optimization problems. MOO solves the problem by searching for different optimal trade‐offs between the optimization objectives. The performances of SOO and MOO are analyzed and compared with each other using three network instances. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
65.
A multiple objective waste-disposal model is developed and analysed. The model is a modification of the single objective waste-disposal model of Alley, Aguado and Remson. The solution structure is obtained using the method of constraints so that dual variables (shadow prices) are available with the solutions. 相似文献
66.
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. 相似文献
67.
在高校成本层次分类的基础上,建立了生均成本测算的一般模型,针对教育成本投入过程中因学生人数随机变化而存在的风险,引进教学质量函数,提出了办学效益和教学质量的双目标优化模型.利用凸分析和优化原理得到优化问题解的存在性,全部正解的β取值范围以及最优解满足的充要条件,对最优解的定量计算给出了基于Monte Carlo模拟的遗传算法设计,并进行了相应的经济意义分析. 相似文献
68.
在DEA中有关输出与输入的比值的模型的探讨 总被引:1,自引:0,他引:1
吴文江 《数学的实践与认识》2009,39(10)
对以决策单元的输出与输入的比值为目标函数的多目标规划模型,证明了有关它与(弱)DEA有效(C2R)关系的三个定理. 相似文献
69.
In the literature, methods for the construction of piecewise linear upper and lower bounds for the approximation of univariate convex functions have been proposed. We study the effect of the use of transformations on the approximation of univariate (convex) functions. In this paper, we show that these transformations can be used to construct upper and lower bounds for nonconvex functions. Moreover, we show that by using such transformations of the input variable or the output variable, we obtain tighter upper and lower bounds for the approximation of convex functions than without these approximations. We show that these transformations can be applied to the approximation of a (convex) Pareto curve that is associated with a (convex) bi-objective optimization problem. 相似文献
70.