全文获取类型
收费全文 | 553篇 |
免费 | 20篇 |
出版年
2021年 | 8篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2017年 | 11篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 13篇 |
2013年 | 67篇 |
2012年 | 24篇 |
2011年 | 29篇 |
2010年 | 23篇 |
2009年 | 18篇 |
2008年 | 29篇 |
2007年 | 15篇 |
2006年 | 17篇 |
2005年 | 7篇 |
2004年 | 8篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2001年 | 5篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 12篇 |
1992年 | 9篇 |
1991年 | 9篇 |
1990年 | 3篇 |
1989年 | 13篇 |
1988年 | 4篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 9篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1973年 | 3篇 |
1972年 | 12篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有573条查询结果,搜索用时 15 毫秒
151.
In financial engineering, sensitivities of derivative prices (also known as the Greeks) are important quantities in risk management, and stochastic gradient estimation methods are used to estimate them given the market parameters. In practice, the surface (function) of the Greeks with respect to the underlying parameters is much more desired, because it can be used in real‐time risk management. In this paper, we consider derivatives with multiple underlying assets, and propose three stochastic kriging‐based methods, the element‐by‐element, the importance mapping, and the Cholesky decomposition, to fit the surface of the gamma matrix that can fulfill the time constraint and the precision requirement in real‐time risk management. Numerical experiments are provided to illustrate the effectiveness of the proposed methods. 相似文献
152.
153.
154.
C4ISR(Command、Control、Communication、Computer、Intelligence、Surveillance and Reconnaissance)系统开发的仿真活动贯穿于系统全生命周期的各个阶段,仿真支持过程联系着C4ISR系统开发仿真的各类要素。首先对C4ISR系统开发仿真支持的内容进行分析,从生命周期维、仿真产品维和仿真任务维三个维度描述仿真支持内容之间的联系。然后分析了C4ISR系统开发仿真支持过程的层次性,应用UML描述了支持过程中的仿真项目模型和仿真过程模型。在此基础上,应用基于Petri网的工作流网,对C4ISR系统开发的仿真支持过程进行建模,分析了支持过程中活动、产品、角色、约束四类要素的Petri网表示方式。最后在一个C4ISR系统开发仿真支持实例中应用以上分析和建模方法,验证了方法的可行性和应用效果。 相似文献
155.
大规模地形作为分布式虚拟战场的重要组成部分,在非常有限的资源下,很难达到实时性绘制。针对此问题,设计了两级三层的概要四叉树组织地形数据,用多线程模式算法调度数据,以提高庞大地形数据的交互速率;提出基于衔接索引模板的算法来消除裂缝,实现不同细节层次的无缝拼接;引入样本纹理堆栈的纹理合成算子,增强各层次细节地貌的逼真表现。实验表明:该方法能够很好地实现战场环境下地形的实时性绘制,提供稳定的视觉漫游效果。 相似文献
156.
Consider a stochastic simulation experiment consisting of v independent vector replications consisting of an observation from each of k independent systems. Typical system comparisons are based on mean (long‐run) performance. However, the probability that a system will actually be the best is sometimes more relevant, and can provide a very different perspective than the systems' means. Empirically, we select one system as the best performer (i.e., it wins) on each replication. Each system has an unknown constant probability of winning on any replication and the numbers of wins for the individual systems follow a multinomial distribution. Procedures exist for selecting the system with the largest probability of being the best. This paper addresses the companion problem of estimating the probability that each system will be the best. The maximum likelihood estimators (MLEs) of the multinomial cell probabilities for a set of v vector replications across k systems are well known. We use these same v vector replications to form vk unique vectors (termed pseudo‐replications) that contain one observation from each system and develop estimators based on AVC (All Vector Comparisons). In other words, we compare every observation from each system with every combination of observations from the remaining systems and note the best performer in each pseudo‐replication. AVC provides lower variance estimators of the probability that each system will be the best than the MLEs. We also derive confidence intervals for the AVC point estimators, present a portion of an extensive empirical evaluation and provide a realistic example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 341–358, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10019 相似文献
157.
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003. 相似文献
158.
This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
159.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
160.
This article concerns scheduling policies in a surveillance system aimed at detecting a terrorist attack in time. Terrorist suspects arriving at a public area are subject to continuous monitoring, while a surveillance team takes their biometric signatures and compares them with records stored in a terrorist database. Because the surveillance team can screen only one terrorist suspect at a time, the team faces a dynamic scheduling problem among the suspects. We build a model consisting of an M/G/1 queue with two types of customers—red and white—to study this problem. Both types of customers are impatient but the reneging time distributions are different. The server only receives a reward by serving a red customer and can use the time a customer has spent in the queue to deduce its likely type. In a few special cases, a simple service rule—such as first‐come‐first‐serve—is optimal. We explain why the problem is in general difficult and we develop a heuristic policy motivated by the fact that terrorist attacks tend to be rare events. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献