全文获取类型
收费全文 | 141篇 |
免费 | 37篇 |
国内免费 | 16篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 3篇 |
2018年 | 1篇 |
2017年 | 9篇 |
2016年 | 9篇 |
2015年 | 13篇 |
2014年 | 6篇 |
2013年 | 9篇 |
2012年 | 10篇 |
2011年 | 18篇 |
2010年 | 13篇 |
2009年 | 11篇 |
2008年 | 13篇 |
2007年 | 12篇 |
2006年 | 12篇 |
2005年 | 9篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 8篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1990年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有194条查询结果,搜索用时 0 毫秒
61.
62.
In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013 相似文献
63.
以电磁阀为先导阀,自力式差压控制的快开阀用于模拟产生管线发生破裂时的瞬间泄露工况,在设计时间内快速、稳定的开启是该阀研制的关键技术难点.分析了差动式快开阀的机构及开启原理,以流体力学基本理论为基础,建立了压降随开度变化的关系,完成了阀门开启过程动力学分析与仿真计算,得到了不同阀门开度下的开启时间、速度及加速度,阀芯运动... 相似文献
64.
It well known that vehicle detection is an important component of the field of object detection. However, the environment of vehicle detection is particularly sophisticated in practical processes. It is compara-tively difficult to detect vehicles of various scales in traffic scene images, because the vehicles partially obscured by green belts, roadblocks or other vehicles, as well as influence of some low illumination weather. In this paper, we present a model based on Faster R-CNN with NAS optimization and feature enrichment to realize the effective detection of multi-scale vehicle targets in traffic scenes. First, we proposed a Retinex-based image adaptive correction algorithm (RIAC) to enhance the traffic images in the dataset to reduce the influence of shadow and illumination, and improve the image quality. Second, in order to improve the feature expression of the backbone network, we conducted Neural Architecture Search (NAS) on the backbone network used for feature extraction of Faster R-CNN to generate the optimal cross-layer connection to extract multi-layer features more effectively. Third, we used the object Feature Enrichment that combines the multi-layer feature information and the context information of the last layer after cross-layer connection to enrich the information of vehicle targets, and improve the robustness of the model for challenging targets such as small scale and severe occlusion. In the imple-mentation of the model, K-means clustering algorithm was used to select the suitable anchor size for our dataset to improve the convergence speed of the model. Our model has been trained and tested on the UN-DETRAC dataset, and the obtained results indicate that our method has art-of-state detection performance. 相似文献
65.
基于某型鱼雷自航发射的内弹道数学模型,选择自航管的总长度作为优化目标,讨论了约束函数的取值,确定了优化问题的数学表达.采用惩罚函数法进行寻优计算,针对约束函数具有不可微和非线性的特点,采用模式搜索算法进行了无约束优化的求解,给出了优化结果并进行了比较. 相似文献
66.
The scheduling problem addressed in this paper concerns a manufacturer who produces a variety of product types and operates in a make‐to‐order environment. Each customer order consists of known quantities of the different product types, and must be delivered as a single shipment. Periodically the manufacturer schedules the accumulated and unscheduled customer orders. Instances of this problem occur across industries in manufacturing as well as in service environments. In this paper we show that the problem of minimizing the weighted sum of customer order delivery times is unary NP‐hard. We characterize the optimal schedule, solve several special cases of the problem, derive tight lower bounds, and propose several heuristic solutions. We report the results of a set of computational experiments to evaluate the lower bounding procedures and the heuristics, and to determine optimal solutions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
67.
白凤领 《中国人民武装警察部队学院学报》2006,22(2):28-30
消防行政即时强制是消防行政强制的一种,由于其适用的目的和程序与消防行政强制执行不同而具有特殊性。对消防行政即时强制的法律性质、实施条件、手段、救济等问题进行了初步探讨。 相似文献
68.
69.
70.
This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin‐destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 287–303, 2000 相似文献