全文获取类型
收费全文 | 184篇 |
免费 | 45篇 |
国内免费 | 25篇 |
出版年
2022年 | 1篇 |
2021年 | 7篇 |
2020年 | 13篇 |
2019年 | 9篇 |
2018年 | 10篇 |
2017年 | 16篇 |
2016年 | 9篇 |
2015年 | 9篇 |
2014年 | 18篇 |
2013年 | 35篇 |
2012年 | 11篇 |
2011年 | 17篇 |
2010年 | 9篇 |
2009年 | 14篇 |
2008年 | 11篇 |
2007年 | 9篇 |
2006年 | 17篇 |
2005年 | 8篇 |
2004年 | 5篇 |
2003年 | 1篇 |
2002年 | 5篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 3篇 |
1997年 | 2篇 |
1995年 | 2篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 3篇 |
排序方式: 共有254条查询结果,搜索用时 15 毫秒
141.
伴随着3G时代的到来,3G手机逐渐走进武警警营。然而它在给官兵带来视频通话、网络冲浪、导航定位、彩信即拍即发等方便与快捷享受的同时,也给安全保密工作敲响了警钟。通过对3G手机的概念及主要功能的分析,指出它对安全保密工作的影响,探讨解决问题的对策,能够为部队管理者有效消除3G手机给部队安全保密工作带来的不利影响提供参考。 相似文献
142.
通过分析消防部队执行灭火抢险救援任务的特点,提出了利用全球卫星定位系统(GPS)、遥感(RS)、地理信息系统(GIS)及网络通讯等高新技术,及时对火灾预警,采取防范措施;在火灾发生发展过程中,不断监测火灾的进程和势态,及时把信息传到防火扑救指挥中心,以便有效地组织救助活动;火灾之后,可以在大范围内实施快速反应,迅速准确地查明受损状况,做出较为准确的评估,为消防移动指挥系统提供了设计理念,并给出了设计方案。 相似文献
143.
This article investigates the method of allocating arriving vessels to the terminals in transshipment hubs. The terminal allocation decision faced by a shipping alliance has the influence on the scheduled arrival time of vessels and further affects the bunker consumption cost for the vessels. A model is formulated to minimize the bunker consumption cost as well as the transportation cost of inter‐terminal transshipment flows/movements. The capacity limitation of the port resources such as quay cranes (QCs) and berths is taken into account. Besides the terminal allocation, the QC assignment decision is also incorporated in the proposed model. A local branching based method and a particle swarm optimization based method are developed to solve the model in large‐scale problem instances. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 14% of the cost when compared with the “First Come First Served” decision rule. Moreover, the proposed solution methods not only solve the proposed model within a reasonable computation time, but also obtain near‐optimal results with about 0.1~0.7% relative gap. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 529–548, 2016 相似文献
144.
We address the problem of optimal decision‐making in conflicts based on Lanchester square law attrition model where a defending force needs to be partitioned optimally, and allocated to two different attacking forces of differing strengths and capabilities. We consider a resource allocation scheme called the Time Zero Allocation with Redistribution (TZAR) strategy, where allocation is followed by redistribution of defending forces, on the occurrence of certain decisive events. Unlike previous work on Lanchester attrition model based tactical decision‐making, which propose time sequential tactics through an optimal control approach, the present article focuses on obtaining simpler resource allocation tactics based on a static optimization framework, and demonstrates that the results obtained are similar to those obtained by the more complex dynamic optimal control solution. Complete solution for this strategy is obtained for optimal partitioning of resources of the defending forces. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
145.
Like airlines and hotels, sports teams and entertainment venues can benefit from revenue management efforts for their ticket sales. Teams and entertainment venues usually offer bundles of tickets early in their selling horizon and put single‐event tickets on sale at a later date; these organizations must determine the best time to offer individual tickets because both types of ticket sales consume the same fixed inventory. We model the optimal a priori timing decision for a seller with a fixed number of identical tickets to switch from selling the tickets as fixed bundles to individual tickets to maximize the revenue realized before the start of the performance season. We assume that bundle and single‐ticket customers each arrive according to independent, nonhomogeneous Markovian death processes with a linear death rate that can vary over time and that the benefit from selling a ticket in a package is higher than from selling the ticket individually. We characterize the circumstances in which it is optimal for the seller to practice mixed bundling and when the seller should only sell bundles or individual tickets, and we establish comparative statics for the optimal timing decision for the special case of constant customer arrival rates. We extend our analytical results to find the optimal time for offering two groups of tickets with high and low demand. Finally, we apply the timing model to a data set obtained from the sports industry. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
146.
复合式移动系统是当前移动机器人研究的热点之一.总结了已有的一些轮-腿复合式移动系统的研究成果及结构特点,提出一种基于球齿轮机构的新型轮-腿复合式移动平台的结构设计方案,这种新型移动平台的轮腿机构具有不同于已有轮-腿复合式移动系统独特的运动特征,在结构上可实现"轮"、"腿"的真正融合,使得平台具有轮式、腿式和轮-腿复合三种移动模式,可实现直行、斜行、小半径转弯甚至原地转弯等多种运动姿态.对轮腿机构进行了计算机虚拟模型运动仿真研究,并对平台样机进行了姿态调整实验,结果表明这种新型移动平台能够实现设定的多种复杂运动姿态. 相似文献
147.
In some industries such as automotive, production costs are largely fixed and therefore maximizing revenue is the main objective. Manufacturers use promotions directed to the end customers and/or retailers in their distribution channels to increase sales and market share. We study a game theoretical model to examine the impact of “retailer incentive” and “customer rebate” promotions on the manufacturer's pricing and the retailer's ordering/sales decisions. The main tradeoff is that customer rebates are given to every customer, while the use of retailer incentives is controlled by the retailer. We consider several models with different demand characteristics and information asymmetry between the manufacturer and a price discriminating retailer, and we determine which promotion would benefit the manufacturer under which market conditions. When demand is deterministic, we find that retailer incentives increase the manufacturer's profits (and sales) while customer rebates do not unless they lead to market expansion. When the uncertainty in demand (“market potential”) is high, a customer rebate can be more profitable than the retailer incentive for the manufacturer. With numerical examples, we provide additional insights on the profit gains by the right choice of promotion.© 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
148.
We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
149.
150.