全文获取类型
收费全文 | 4659篇 |
免费 | 379篇 |
国内免费 | 332篇 |
专业分类
化学 | 58篇 |
晶体学 | 2篇 |
力学 | 274篇 |
综合类 | 36篇 |
数学 | 565篇 |
物理学 | 266篇 |
综合类 | 4169篇 |
出版年
2024年 | 39篇 |
2023年 | 74篇 |
2022年 | 147篇 |
2021年 | 157篇 |
2020年 | 133篇 |
2019年 | 146篇 |
2018年 | 152篇 |
2017年 | 215篇 |
2016年 | 163篇 |
2015年 | 215篇 |
2014年 | 284篇 |
2013年 | 274篇 |
2012年 | 332篇 |
2011年 | 327篇 |
2010年 | 246篇 |
2009年 | 280篇 |
2008年 | 273篇 |
2007年 | 388篇 |
2006年 | 289篇 |
2005年 | 242篇 |
2004年 | 254篇 |
2003年 | 189篇 |
2002年 | 111篇 |
2001年 | 113篇 |
2000年 | 66篇 |
1999年 | 51篇 |
1998年 | 34篇 |
1997年 | 25篇 |
1996年 | 29篇 |
1995年 | 23篇 |
1994年 | 16篇 |
1993年 | 19篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 12篇 |
1989年 | 6篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 1篇 |
1985年 | 6篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1979年 | 3篇 |
1957年 | 2篇 |
1955年 | 2篇 |
排序方式: 共有5370条查询结果,搜索用时 15 毫秒
1.
提出了一种图象搜索的方法 ,适用于变化的环境 ,通过灰度值偏移校正二维阈值化和噪声滤波的方法能有效排除由于光源所引起的各种干扰 .本方法处理速度快 ,满足自引导车实时跟踪和导航的需要 相似文献
2.
3.
在网络建设和运行中,采用测试的方法对其性能进行评估对于网络的正常运营具有重要的意义.本文研究了网络路由收敛性能测试方法,为得到路由收敛性能指标,对OSPF和iBGP的路由收敛时间进行了测量.提出了一种简化的路由收敛时间测量方法,通过测量数据平面的传输性能指标,对路由控制平面的收敛时间进行估算.该方法对于测试设备要求不高,实施简单方便.采用该方法在CERNET2投入运营之前对其进行了路由性能测试,实验结果表明CERNET2在路由变化时具有较好的路由收敛性能. 相似文献
4.
5.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
6.
Consider a network where two routes are available for users wishing to travel from a source to a destination. On one route (which could be viewed as private transport) service slows as traffic increases. On the other (which could be viewed as public transport) the service frequency increases with demand. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. Using the model proposed by Calvert [10], with a ⋅|M|1 queue corresponding to the private transport route, and a bulk-service infinite server queue modelling the public transport route, we give a complete analysis of this system in the setting of probabilistic routing. We obtain the user equilibria (which are not always unique), and determine their stability.AMS subject classification: 60K30, 90B15, 90B20, 91A10, 91A13This revised version was published online in June 2005 with corrected coverdate 相似文献
7.
Han-xing Wang Xi Hu Qin Zhang 《应用数学学报(英文版)》2007,23(2):235-244
In this paper,we present a random graph model with spatial reuse for a mobile ad hoc network(MANET) based on the dynamic source routing protocol.Many important performance parameters of theMANET are obtained,such as the average flooding distance (AFD),the probability generating function of theflooding distance,and the probability of a flooding route to be symmetric.Compared with the random graphmodel without spatial reuse,this model is much more effective because it has a smaller value of AFD and alarger probability for finding a symmetric valid route. 相似文献
8.
汽车碰撞事故的速度分析 总被引:2,自引:0,他引:2
通过对交通事故中汽车的碰撞问题的简化 ,运用动量守恒定理和能量守恒定律着重研究了正面碰撞、追尾碰撞和侧面碰撞三种情况下 ,汽车碰撞前动量和速度的求解方法 ,为交通事故模拟和再现提供了一种更为实用的方法 ,并为科学处理交通事故、明确事故责任提供了重要参考。 相似文献
9.
基于小波变换的运动汽车阴影分割 总被引:3,自引:0,他引:3
利用在阴影区域内的点所接受环境光强与汽车的相对位置关系,结合多分辨率小波分析,提出了一种新的基于小波变换的运动汽车阴影分割方法.该方法不需要知道光源的方向,也不需要车体的彩色信息;对背景的纹理也没有要求,适用于复杂纹理背景下任何颜色的汽车阴影分割.实验表明,该方法定位准确、速度快、抗噪能力强. 相似文献
10.
Rafael Caballero Mercedes González Flor M Guerrero Julián Molina Concepción Paralera 《European Journal of Operational Research》2007
In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have to locate some plants within a set of possible locations to meet the demands of a number of clients with multiple objectives. This type of model is used to solve a problem with real data in the region of Andalusia (Spain). Thus, we study the location of two incineration plants for the disposal of solid animal waste from some preestablished locations in Andalusia, and design the routes to serve the different slaughterhouses in this region. This must be done while taking into account certain economic objectives (start-up, maintenance, and transport costs) and social objectives (social rejection by towns on the truck routes, maximum risk as an equity criterion, and the negative implications for towns close to the plant). 相似文献