全文获取类型
收费全文 | 1926篇 |
免费 | 325篇 |
国内免费 | 135篇 |
专业分类
化学 | 514篇 |
晶体学 | 2篇 |
力学 | 116篇 |
综合类 | 63篇 |
数学 | 1298篇 |
物理学 | 393篇 |
出版年
2024年 | 2篇 |
2023年 | 45篇 |
2022年 | 113篇 |
2021年 | 98篇 |
2020年 | 105篇 |
2019年 | 90篇 |
2018年 | 82篇 |
2017年 | 92篇 |
2016年 | 120篇 |
2015年 | 77篇 |
2014年 | 146篇 |
2013年 | 168篇 |
2012年 | 99篇 |
2011年 | 120篇 |
2010年 | 94篇 |
2009年 | 123篇 |
2008年 | 100篇 |
2007年 | 102篇 |
2006年 | 84篇 |
2005年 | 75篇 |
2004年 | 63篇 |
2003年 | 57篇 |
2002年 | 48篇 |
2001年 | 32篇 |
2000年 | 33篇 |
1999年 | 22篇 |
1998年 | 33篇 |
1997年 | 33篇 |
1996年 | 20篇 |
1995年 | 10篇 |
1994年 | 9篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 9篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 4篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 7篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 5篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1970年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有2386条查询结果,搜索用时 626 毫秒
11.
We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004 相似文献
12.
13.
Capacity Constrained Transit Assignment with Common Lines 总被引:1,自引:0,他引:1
Fumitaka Kurauchi Michael G. H. Bell Jan-Dirk Schmöcker 《Journal of Mathematical Modelling and Algorithms》2003,2(4):309-327
This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking
common lines into account. The approach handles congested transit networks, where some passengers will not be able to board
because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends
on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
14.
§ 1. Introduction Anecessaryandsufficientconditionandasufficientconditiontoensurethataset valuedmappingandasingle valuedmappinginacompletemetricspaceandacompleteconvexmetricspacehavingacommonfixedpointarerespectivelygivenin [1 ] .Meanwhilethemainresultsin[2 ]— [5]areimprovedandextendedin [1 ] .Inthispaper ,theexistenceatcommonfixedpointsoftwoset valuedmappingandasing valuedmappingwerestudied ,andthecorrespond ingresultsin [1 ]— [5]wereextendedandimproved .Let(X ,d)beanon emptymetricspa… 相似文献
15.
This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems. 相似文献
16.
仓库容量有限条件下的一类存贮管理模型 总被引:10,自引:1,他引:9
建立了一类仓库容量有限条件下存贮管理决策模型 ,给出最优存贮策略 . 相似文献
17.
本文利用一个新的分片线性NCP函数提出一个新的可行的QP-free方法解非线性不等式约束优化问题.不同于其他的QP-free方法,这个方法只考虑在工作集中的约束函数,工作集是积极集的一个估计,因此子问题的维数不是满秩的.这个方法可行的并且不需假定严格互补条件、聚点的孤立性得到算法的全局收敛性,并且积极约束函数的梯度不要求线性独立的,其中由拟牛顿法得到的子矩阵不需要求一致正定性. 相似文献
18.
In this paper, we consider the optimal investment strategy which maximizes the utility of the terminal wealth of an insurer with SAHARA utility functions. This class of utility functions has non-monotone absolute risk aversion, which is more flexible than the CARA and CRRA utility functions. In the case that the risk process is modeled as a Brownian motion and the stock process is modeled as a geometric Brownian motion, we get the closed-form solutions for our problem by the martingale method for both the constant threshold and when the threshold evolves dynamically according to a specific process. Finally, we show that the optimal strategy is state-dependent. 相似文献
19.
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms 总被引:2,自引:0,他引:2
Hoang Tuy 《Journal of Global Optimization》1991,1(1):23-36
We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions. 相似文献
20.
分析了一个新的复杂的四维混沌系统的基本特性,该系统每个方程中包含一个三次交叉乘积项,共有9个平衡点,它们相对于原点和坐标轴具有完美的对称性,并且相对于线性特性和不变流形具有很好的相似性.描述了两个同时共存的对称双翼吸引子.最后,设计了一个模拟电路来实现这个新的四维混沌系统,表明数值仿真和电路实现具有很好的一致性,同时说明在应用上由于频率不同导致的仿真与物理实现之间的重要区别.
关键词:
四维混沌系统
Lyapunov 指数
共存双翼吸引子
电路实现 相似文献