全文获取类型
收费全文 | 678篇 |
免费 | 14篇 |
出版年
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 17篇 |
2018年 | 9篇 |
2017年 | 14篇 |
2016年 | 18篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 125篇 |
2012年 | 22篇 |
2011年 | 34篇 |
2010年 | 23篇 |
2009年 | 17篇 |
2008年 | 31篇 |
2007年 | 18篇 |
2006年 | 17篇 |
2005年 | 9篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 6篇 |
1999年 | 7篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1995年 | 7篇 |
1994年 | 10篇 |
1993年 | 13篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1990年 | 5篇 |
1989年 | 16篇 |
1988年 | 7篇 |
1987年 | 13篇 |
1986年 | 11篇 |
1985年 | 9篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 13篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 9篇 |
1973年 | 5篇 |
1972年 | 16篇 |
1971年 | 5篇 |
1970年 | 6篇 |
1969年 | 10篇 |
1968年 | 9篇 |
排序方式: 共有692条查询结果,搜索用时 31 毫秒
181.
This article considers a two-person game in which the first player has access to certain information that is valuable but unknown to the second player. The first player can distort the information before it is passed on to the second player. The purpose in distorting the information is to render it as useless as possible to the second player. Based on the distorted information received, the second player then maximizes some given objective. In certain cases he may still be able to use the distorted information, but sometimes the information has been so badly distorted that it becomes completely useless to him. © 1993 John Wiley & Sons, Inc. 相似文献
182.
183.
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. 相似文献
184.
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 相似文献
185.
This work continues to develop the 'netwar' concept that the authors introduced in 1993 and have expanded upon in their various RAND and other writings ever since. Deeper understanding of the nature, strengths and vulnerabilities of networks will prove useful in combating terrorism and transnational crime, but also in understanding militant social activism, both of the violently disruptive sort and that which aims at fostering the rise of a global civil society. This essay also assesses recent US performance in the terror war, and concludes by raising concerns over the possible rise of a new form of network-based fascism. 相似文献
186.
基于模糊数的防空C3I系统效能评估 总被引:1,自引:0,他引:1
根据模糊数适于量化模糊信息的特点,运用模糊集理论,提出了一种基于模糊数的模糊综合评估方法.通过计算被评估系统效能的模糊数,将问题转化为模糊数的排序问题,并给出了采用该方法对防空C3I系统效能评估的模型及实现步骤.该方法能对防空C3I系统的效能指标进行合理的量化处理,较好地解决了防空C3I系统效能评估问题,通过计算实例验证了该方法的正确性和实用性. 相似文献
187.
分析了RGB-D传感器的标定模型及标定方法,利用标定棋盘和Matlab工具箱对RGB-D传感器进行了标定。采用摄像机标定方法计算了彩色摄像机和深度摄像机的初始化参数,根据标定棋盘和标定板的共面关系计算了相对位姿的初始估计值,并采用非线性最小化方法对标定参数进行了优化。实验结果表明:标定后的彩色图像和深度图像的重投影误差较小,深度测量不确定性标准差比标定前约减小了1/2,有效地提高了RGB-D传感器的测量精度。 相似文献
188.
The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature. 相似文献
189.
In September 1878 the British Museum received a donation of a folded metal plate which had been embossed and gilded. Restoration of the object revealed that the folded plate was in fact the outer casing of a Roman copper alloy cavalry sports type helmet which dates to the late second or third century AD. The story of what became known as the Guisborough helmet began 14 years earlier in what was then the North Riding of Yorkshire when workers employed by the Cleveland Railway Company discovered a ‘very curious plate of metal’ during road construction. It appears that the helmet was deliberately prepared for deposition and buried at a depth of c30 cm close to a stream. Examination by the authors suggests that this was a high value item that had been repaired many times. Experimental evidence suggests that the decoration alone required approximately 16 h to fashion. 相似文献
190.
The Replenishment at Sea Planner (RASP) is saving the U.S. Navy millions of dollars a year by reducing fuel consumption of its Combat Logistics Force (CLF). CLF shuttle supply ships deploy from ports to rendezvous with underway U.S. combatants and those of coalition partners. The overwhelming commodity transferred is fuel, ship‐to‐ship by hoses, while other important packaged goods and spare parts are high‐lined, or helicoptered between ships. The U.S. Navy is organized in large areas of responsibility called numbered fleets, and within each of these a scheduler must promulgate a daily forecast of CLF shuttle operations. The operational planning horizon extends out several weeks, or as far into the future as we can forecast demand. We solve RASP with integer linear optimization and a purpose‐built heuristic. RASP plans Replenishment‐at‐Sea (RAS) events with 4‐hour (Navy watch) time fidelity. For five years, RASP has served two purposes: (1) it helps schedulers generate a daily schedule and animates it using Google Earth, and (2) it automates reports command‐to‐ship messages that are essential to keep this complex logistics system operating. 相似文献