全文获取类型
收费全文 | 2374篇 |
免费 | 492篇 |
国内免费 | 149篇 |
出版年
2024年 | 8篇 |
2023年 | 22篇 |
2022年 | 25篇 |
2021年 | 26篇 |
2020年 | 42篇 |
2019年 | 31篇 |
2018年 | 29篇 |
2017年 | 99篇 |
2016年 | 114篇 |
2015年 | 58篇 |
2014年 | 192篇 |
2013年 | 177篇 |
2012年 | 178篇 |
2011年 | 222篇 |
2010年 | 176篇 |
2009年 | 210篇 |
2008年 | 172篇 |
2007年 | 165篇 |
2006年 | 148篇 |
2005年 | 164篇 |
2004年 | 157篇 |
2003年 | 126篇 |
2002年 | 88篇 |
2001年 | 70篇 |
2000年 | 41篇 |
1999年 | 43篇 |
1998年 | 51篇 |
1997年 | 35篇 |
1996年 | 19篇 |
1995年 | 22篇 |
1994年 | 25篇 |
1993年 | 13篇 |
1992年 | 18篇 |
1991年 | 16篇 |
1990年 | 21篇 |
1989年 | 11篇 |
1988年 | 1篇 |
排序方式: 共有3015条查询结果,搜索用时 13 毫秒
831.
832.
833.
834.
图像修复是指对图像破损区域进行填充或者将图像中多余物体进行移除。在Criminisi算法的基础上进行改进,在待修复块优先权的计算过程中,由于等照度线的曲率可以反映图像的局部特征,块与块之间的方差值可以反映图像的边缘信息,因此,将二者考虑进来,确保修复过程能够准确有序地进行。在寻找最佳匹配块时,将等照度线的曲率也作为一个因素增加进来,有效地提高了最佳匹配块搜索的精确性。经过仿真实验证明,改进后的算法不仅在PSNR值上比原算法有所提高,而且修复结果也比原算法更加准确可靠。 相似文献
835.
836.
837.
838.
839.
In the literature two common macroscopic evacuation planning approaches exist: The dynamic network flow approach and the Cell–Transmission–Based approach. Both approaches have advantages and disadvantages. Many efficient solution approaches for the dynamic network flow approach exist so that realistic problem instances can be considered. However, the consideration of (more) realistic aspects (eg, density dependent travel times) results in non‐linear model formulations. The Cell‐Transmission‐Based approach on the other hand considers realistic traffic phenomena like shock waves and traffic congestion, but this approach leads to long computational times for realistic problem instances. In this article, we combine the advantages of both approaches: We consider a Cell‐Transmission‐Based Evacuation Planning Model (CTEPM) and present a network flow formulation that is equivalent to the cell‐based model. Thus, the computational costs of the CTEPM are enormously reduced due to the reformulation and the detailed representation of the traffic flow dynamics is maintained. We investigate the impacts of various evacuation scenario parameters on the evacuation performance and on the computational times in a computational study including 90 realistic instances. 相似文献
840.
The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017 相似文献