全文获取类型
收费全文 | 512篇 |
免费 | 55篇 |
国内免费 | 1篇 |
出版年
2021年 | 6篇 |
2019年 | 14篇 |
2018年 | 8篇 |
2017年 | 15篇 |
2016年 | 18篇 |
2015年 | 20篇 |
2014年 | 17篇 |
2013年 | 128篇 |
2012年 | 15篇 |
2011年 | 11篇 |
2010年 | 11篇 |
2009年 | 13篇 |
2008年 | 14篇 |
2007年 | 14篇 |
2006年 | 12篇 |
2005年 | 13篇 |
2004年 | 9篇 |
2003年 | 14篇 |
2002年 | 12篇 |
2001年 | 8篇 |
2000年 | 8篇 |
1999年 | 8篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1994年 | 5篇 |
1993年 | 10篇 |
1992年 | 6篇 |
1991年 | 8篇 |
1989年 | 7篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 6篇 |
1973年 | 8篇 |
1972年 | 5篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有568条查询结果,搜索用时 312 毫秒
431.
The Akko 1 shipwreck is the remains of a 26-metre-long Egyptian armed vessel or auxiliary naval brig built at the beginning of the 19th century. Remains of six flintlock muskets were retrieved from the shipwreck, and characterised by various metallurgical methods. The research aimed to study the composition and microstructure of the musket fittings and their manufacturing processes, and if possible, to determine the date and origin of the raw materials. The lead isotope analysis of the fittings suggests that their raw material originated in Great Britain. Based on their typology and composition, the fittings were made in Great Britain of brass alloy and manufactured by casting, probably at the same workshop; and the staple was manufactured by casting and drawing. Considering the zinc content, combined with the manufacturing techniques, the fittings were manufactured between the latter part of the 18th and the early 19th centuries, which might indicate that they were purchased in the course of 19th century weapons trade to be used on board the Egyptian ship. 相似文献
432.
This article deals with the problem of minimizing the transportation and inventory cost associated with the shipment of several products from a source to a destination, when a finite set of shipping frequencies is available. A mixed-integer programming model—shown to be NP-hard—is formulated for that problem. The computational complexity of some similar models applied to different problems is also investigated. In particular, whereas the capacitated plant location problem with operational cost in product form is NP-hard, the simple plant location problem with the same characteristics can be solved in polynomial time. A branch-and-bound algorithm is finally worked out, and some computational results are presented. © 1996 John Wiley & Sons, Inc. 相似文献
433.
This paper considers a warehouse sizing problem whose objective is to minimize the total cost of ordering, holding, and warehousing of inventory. Unlike typical economic lot sizing models, the warehousing cost structure examined here is not the simple unit rate type, but rather a more realistic step function of the warehouse space to be acquired. In the cases when only one type of stock‐keeping unit (SKU) is warehoused, or when multiple SKUs are warehoused, but, with separable inventory costs, closed form solutions are obtained for the optimal warehouse size. For the case of multi‐SKUs with joint inventory replenishment cost, a heuristic with a provable performance bound of 94% is provided. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 299–312, 2001 相似文献
434.
Ship berthing plans reserve a location for inbound U.S. Navy surface vessels prior to their port entrance, or reassign ships once in port to allow them to complete, in a timely manner, reprovisioning, repair, maintenance, training, and certification tests prior to redeploying for future operational commitments. Each ship requires different services when in port, such as shore power, crane, ordnance, and fuel. Unfortunately, not all services are offered at all piers, and berth shifting is disruptive and expensive: A port operations scheduler strives to reduce unnecessary berth shifts. We present an optimization model for berth planning and demonstrate it for Norfolk Naval Station, which exhibits all the richness of berthing problems the Navy faces. ® 1994 John Wiley & Sons, Inc. 相似文献
435.
Mark G. Tang 《海军后勤学研究》1993,40(5):677-696
In this article we solve and analyze a stochastic version of the Boiteux problem by employing the stochastic optimal control method. Our setup is close to that of Thompson [22]. Our focus is to analyze, under the same structure, how different production functions and how the variance in machine deterioration/maintenance affect our optimal machine maintenance and sale date decisions. © 1993 John Wiley & Sons, Inc. 相似文献
436.
The Stein-Chen method for establishing Poisson convergence is used to approximate the reliability of coherent systems with exponential-type distribution functions. These bounds lead to quite general limit theorems for the lifetime distribution of large coherent systems. © 1993 John Wiley & Sons, Inc. 相似文献
437.
With incomplete data the maximum likelihood estimates of the parameters of the Weibull process can only be obtained by solving the likelihood equations iteratively. In this article we show that the solution of the likelihood equations may lie outside of the parameter space if none of the processes can be observed from time zero. 相似文献
438.
This paper describes the Value Added Analysis methodology which is used as part of the U.S. Army's Planning, Programming, Budgeting, and Execution System to assist the Army leadership in evaluating and prioritizing competing weapon system alternatives during the process of building the Army budget. The Value Added Analysis concept uses a family of models to estimate an alternative system's contribution to the Army's effectiveness using a multiattribute value hierarchy. A mathematical optimization model is then used to simultaneously determine an alternative's cost‐benefit and to identify an optimal mix of weapon systems for inclusion in the Army budget. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 233–253, 1999 相似文献
439.
A. Gmez‐Corral 《海军后勤学研究》1999,46(5):561-581
Retrial queueing systems are widely used in teletraffic theory and computer and communication networks. Although there has been a rapid growth in the literature on retrial queueing systems, the research on retrial queues with nonexponential retrial times is very limited. This paper is concerned with the analytical treatment of an M/G/1 retrial queue with general retrial times. Our queueing model is different from most single server retrial queueing models in several respectives. First, customers who find the server busy are queued in the orbit in accordance with an FCFS (first‐come‐first‐served) discipline and only the customer at the head of the queue is allowed for access to the server. Besides, a retrial time begins (if applicable) only when the server completes a service rather upon a service attempt failure. We carry out an extensive analysis of the queue, including a necessary and sufficient condition for the system to be stable, the steady state distribution of the server state and the orbit length, the waiting time distribution, the busy period, and other related quantities. Finally, we study the joint distribution of the server state and the orbit length in non‐stationary regime. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 561–581, 1999 相似文献
440.