全文获取类型
收费全文 | 1131篇 |
免费 | 0篇 |
专业分类
1131篇 |
出版年
2024年 | 5篇 |
2022年 | 6篇 |
2021年 | 45篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 3篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 28篇 |
2014年 | 36篇 |
2013年 | 36篇 |
2012年 | 18篇 |
2011年 | 14篇 |
2010年 | 45篇 |
2009年 | 64篇 |
2008年 | 42篇 |
2007年 | 58篇 |
2006年 | 27篇 |
2005年 | 30篇 |
2004年 | 3篇 |
2002年 | 3篇 |
2001年 | 3篇 |
2000年 | 20篇 |
1999年 | 110篇 |
1998年 | 85篇 |
1997年 | 67篇 |
1996年 | 53篇 |
1995年 | 48篇 |
1994年 | 44篇 |
1993年 | 38篇 |
1992年 | 37篇 |
1991年 | 37篇 |
1990年 | 45篇 |
1989年 | 9篇 |
1988年 | 4篇 |
1987年 | 13篇 |
1986年 | 6篇 |
1985年 | 9篇 |
1983年 | 11篇 |
1982年 | 3篇 |
1978年 | 1篇 |
排序方式: 共有1131条查询结果,搜索用时 0 毫秒
931.
This article investigates joining strategies and admission control policy for secondary users (SUs) with retrial behavior in a cognitive radio (CR) system where a single primary user (PU) coexists with multiple SUs. Under a certain reward‐cost structure, SUs opportunistically access the PU band when it is not occupied by the PU. If the band is available upon arrival, an SU decides with a probability either to use the band immediately or to balk the system. If the band is occupied, the SU must decide whether to enter the system as a retrial customer or to leave the system. Once the PU requests for service, the service of SU being served, if any, will be interrupted, and the interrupted SU leaves the band and retries for service after a random amount of time. In this article, we study the equilibrium behavior of non‐cooperative SUs who want to maximize their benefit in a selfish, distributed manner with delay‐sensitive utility function. The socially optimal strategies of SUs are also derived. To utilize the PU band more efficiently and rationally, an admission control policy is proposed to regulate SUs who enter the system in order to eliminate the gap between the individually and socially optimal strategies. 相似文献
932.
We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017 相似文献
933.
Whether military spending is capable of promoting social welfare is currently a controversial issue. The aim of this paper is to investigate how military spending affects the input and output of social welfare (i.e. social welfare expenditures and social welfare index). A panel cointegration analysis and an impulse response function are conducted with multi-country panel data, over two time periods, 1998–2011 and 1993–2007. In addition, to extend a comparative analysis over different economies, BRICS (i.e. Brazil, Russia, India, China, South Africa) and G7 (i.e. the US, Japan, Germany, the UK, France, Italy, Canada) countries are selected as representatives of emerging economies and developed countries, respectively. The empirical results show that military spending enhances social welfare expenditures in developed countries, while the effect is ambiguous in emerging economies. Also, military spending is capable of promoting the social welfare index based on the FMOLS estimation. The comparative analyses indicate that unlike in the G7, the effect of the growth of military spending on the growth of social welfare expenditures is negative and shorter in the BRICS. 相似文献
934.
Kevin Pollpeter 《战略研究杂志》2016,39(5-6):709-727
ABSTRACTThe Chinese military has embarked on a series of organizational and doctrinal reforms intended to better enable it to fight modern war. Prominent among these reforms is the growing emphasis on space to enable long-range precisions strikes and on counterspace to deny space capabilities to an adversary. The People’s Liberation Army (PLA) has officially designated space as a new domain and established an organization to command space forces. With this increased focus on space, the PLA may begin to develop a doctrine to govern the use of space in military operations. The higher priority given to space, especially space control, by the PLA coincides with similar actions by the US military, increasing the possibility of warfare in space and the risks of escalation. 相似文献
935.
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
936.
阐述了随机游走粒子一烟团模式(RPPM)的基本思想,并结合野外试验验证了该模式在烟幕扩散数值模拟中的应用效果。 相似文献
937.
Although quantity discount policies have been extensively analyzed, they are not well understood when there are many different buyers. This is especially the case when buyers face price‐sensitive demand. In this paper we study a supplier's optimal quantity discount policy for a group of independent and heterogeneous retailers, when each retailer faces a demand that is a decreasing function of its retail price. The problem is analyzed as a Stackelberg game whereby the supplier acts as the leader and buyers act as followers. We show that a common quantity discount policy that is designed according to buyers' individual cost and demand structures and their rational economic behavior is able to significantly stimulate demand, improve channel efficiency, and substantially increase profits for both the supplier and buyers. Furthermore, we show that the selection of all‐units or incremental quantity discount policies has no effect on the benefits that can be obtained from quantity discounts. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
938.
Unit‐load warehouses store and retrieve unit‐loads, typically pallets. When storage and retrieval operations are not coordinated, travel is from a pickup and deposit (P&D) point to a pallet location and back again. In some facilities, workers interleave storage and retrieval operations to form a dual‐command cycle. Two new aisle designs proposed by Gue and Meller (“Improving the unit‐load warehouse.” In Progress in Material Handling Research: 2006. Material Handling Industry of America, Charlotte, NC, 2006) use diagonal aisles to reduce the travel distance to a single pallet location by approximately 10 and 20[percnt] for the two designs, respectively. We develop analytical expressions for travel between pallet locations for one of these—the fishbone design. We then compare fishbone warehouses that have been optimized for dual‐command to traditional warehouses that have been optimized in the same manner, and show that an optimal fishbone design reduces dual‐command travel by 10–15%. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 54: 389–403, 2009 相似文献
939.
We propose a dynamic escape route system for emergency evacuation of a naval ship. The system employs signals that adapt to the causative contingency and the crew's physical distribution about the ship. A mixed‐integer nonlinear programming model, with underlying network structure, optimizes the evacuation process. The network's nodes represent compartments, closures (e.g., doors and hatches) and intersections, while arcs represent various types of passageways. The objective function integrates two potentially conflicting factors: average evacuation time and the watertight and airtight integrity of the ship after evacuation. A heuristic solves the model approximately using a sequence of mixed‐integer linear approximating problems. Using data for a Spanish frigate, with standard static routes specified by the ship's designers, computational tests show that the dynamic system can reduce average evacuation times, nearly 23%, and can improve a combined measure of ship integrity by up to 50%. In addition, plausible design changes to the frigate yield further, substantial improvements. Published 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
940.