首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   652篇
  免费   32篇
  国内免费   1篇
  2021年   7篇
  2019年   10篇
  2018年   9篇
  2017年   18篇
  2016年   12篇
  2015年   14篇
  2014年   12篇
  2013年   134篇
  2011年   11篇
  2010年   11篇
  2009年   18篇
  2008年   7篇
  2007年   14篇
  2006年   9篇
  2005年   12篇
  2004年   16篇
  2003年   10篇
  2002年   14篇
  2001年   14篇
  2000年   11篇
  1999年   13篇
  1998年   13篇
  1997年   13篇
  1996年   11篇
  1995年   18篇
  1994年   16篇
  1993年   15篇
  1992年   15篇
  1991年   15篇
  1990年   8篇
  1989年   7篇
  1988年   12篇
  1987年   12篇
  1985年   10篇
  1984年   9篇
  1983年   8篇
  1982年   5篇
  1981年   12篇
  1980年   7篇
  1979年   12篇
  1978年   6篇
  1977年   5篇
  1976年   6篇
  1975年   11篇
  1974年   7篇
  1973年   7篇
  1972年   8篇
  1971年   7篇
  1968年   5篇
  1967年   5篇
排序方式: 共有685条查询结果,搜索用时 109 毫秒
101.
This article presents an approximate analytical method for evaluating an aircraft sortie generation process. The process is modeled as a closed network of multiserver queues and fork-join nodes that allow concurrent service activities. The model uses a variation of mean value analysis (MVA) to capture the effect of mean service times, resource levels, and network topology on performance measures including resource utilizations and the overall sortie generation rate. The quality of the analytical approximation is demonstrated through comparison with simulation results. © 1997 John Wiley & Sons, Inc.
  • 1 This article is a US Government work and, as such, is in the public domain in the United States of America.
  • Naval Research Logistics 44: 153–164, 1997  相似文献   
    102.
    This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011  相似文献   
    103.
    104.
    The human visual system is still an important factor in military warfare; military personnel receive training on effective search strategies, and camouflage that can effectively conceal objects and personnel is a key component of a successful integrated survivability strategy. Previous methods of camouflage assessment have, amongst others, used psychophysics to generate distinctiveness metrics. However, the population from which the human observers are drawn is often not well defined, or necessarily appropriate. In this experiment we designed a new platform for testing multiple patterns based on a camouflaged object detection task, and investigate whether trained military observers perform better than civilians. We use a two-alternative forced choice paradigm, with participants searching images of woodland for a replica military helmet displaying Olive Green, Multi Terrain Pattern, US Marine Pattern or, as a conspicuous control, UN Peacekeeper Blue. Our data show that there is no difference in detection performance between the two observer groups but that there are clear differences in the effectiveness of the different helmet colour patterns in a temperate woodland environment. We conclude that when tasks involve very short stimulus presentation times, task-specific training has little effect on the success of target detection and thus this paradigm is particularly suitable for robust estimates of camouflage efficacy.  相似文献   
    105.
    Cyber operations are relatively a new phenomenon of the last two decades.During that period,they have increased in number,complexity,and agility,while their design and development have been processes well kept under secrecy.As a consequence,limited data(sets)regarding these incidents are available.Although various academic and practitioner public communities addressed some of the key points and dilemmas that surround cyber operations(such as attack,target identification and selection,and collateral damage),still methodologies and models are needed in order to plan,execute,and assess them in a responsibly and legally compliant way.Based on these facts,it is the aim of this article to propose a model that i))estimates and classifies the effects of cyber operations,and ii)assesses proportionality in order to support targeting decisions in cyber operations.In order to do that,a multi-layered fuzzy model was designed and implemented by analysing real and virtual realistic cyber operations combined with interviews and focus groups with technical-military experts.The proposed model was evaluated on two cyber operations use cases in a focus group with four technical-military experts.Both the design and the results of the evaluation are revealed in this article.  相似文献   
    106.
    A great number of visual simultaneous localization and mapping (VSLAM) systems need to assume static features in the environment. However, moving objects can vastly impair the performance of a VSLAM system which relies on the static-world assumption. To cope with this challenging topic, a real-time and robust VSLAM system based on ORB-SLAM2 for dynamic environments was proposed. To reduce the influence of dynamic content, we incorporate the deep-learning-based object detection method in the visual odometry, then the dynamic object probability model is added to raise the efficiency of object detection deep neural network and enhance the real-time performance of our system. Experiment with both on the TUM and KITTI benchmark dataset, as well as in a real-world environment, the results clarify that our method can significantly reduce the tracking error or drift, enhance the robustness, accuracy and stability of the VSLAM system in dynamic scenes.  相似文献   
    107.
    108.
    本文以韩国高丽大学校图书馆馆藏的日本殖民主义统治朝鲜时期收藏、编辑、重印、影印的中国典籍为例,对其进行了梳理,并作了简要的评论,指出殖民统治者选择出版如此众多的中国典籍,并未能起到将朝鲜人民变成其幻想中“帝国臣民”,他们的主观愿望与实际效果并未能成正比。所收藏和出版发行的汉籍为中韩两国学者研究东亚三国的这段历史提供了有价值的第一手资料。  相似文献   
    109.
    We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
    110.
    The Federal Aviation Administration (FAA) and the airline community within the United States have adopted a new paradigm for air traffic flow management, called Collaborative Decision Making (CDM). A principal goal of CDM is shared decision‐making responsibility between the FAA and airlines, so as to increase airline control over decisions that involve economic tradeoffs. So far, CDM has primarily led to enhancements in the implementation of Ground Delay Programs, by changing procedures for allocating slots to airlines and exchanging slots between airlines. In this paper, we discuss how these procedures may be formalized through appropriately defined optimization models. In addition, we describe how inter‐airline slot exchanges may be viewed as a bartering process, in which each “round” of bartering requires the solution of an optimization problem. We compare the resulting optimization problem with the current procedure for exchanging slots and discuss possibilities for increased decision‐making capabilities by the airlines. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
    设为首页 | 免责声明 | 关于勤云 | 加入收藏

    Copyright©北京勤云科技发展有限公司  京ICP备09084417号