全文获取类型
收费全文 | 233篇 |
免费 | 40篇 |
出版年
2021年 | 3篇 |
2019年 | 7篇 |
2018年 | 3篇 |
2017年 | 6篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 9篇 |
2013年 | 76篇 |
2012年 | 9篇 |
2011年 | 7篇 |
2010年 | 4篇 |
2009年 | 7篇 |
2008年 | 9篇 |
2007年 | 12篇 |
2006年 | 7篇 |
2005年 | 11篇 |
2004年 | 7篇 |
2003年 | 11篇 |
2002年 | 10篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 7篇 |
1998年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1973年 | 2篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1970年 | 2篇 |
1968年 | 1篇 |
排序方式: 共有273条查询结果,搜索用时 15 毫秒
101.
Software metrics try to identify, define, and assign various indices of merit that can support the quantitative comparisons and evaluations of software in all phases of its life cycle. This article is a state-of-the-art and state-of-the-practice review of literature related to software quality measurements and metrics. 相似文献
102.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
103.
Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
104.
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 相似文献
105.
Within a reasonable life‐testing time, how to improve the reliability of highly reliable products is one of the great challenges to today's manufacturers. By using a resolution III experiment together with degradation test, Tseng, Hamada, and Chiao (1995) presented an interesting case study of improving the reliability of fluorescent lamps. However, in conducting such an experiment, they did not address the problem of how to choose the optimal settings of variables, such as sample size, inspection frequency, and termination time for each run, which are influential to the correct identification of significant factors and the experimental cost. Assuming that the product's degradation paths satisfy Wiener processes, this paper proposes a systematic approach to the aforementioned problem. First, an intuitively appealing identification rule is proposed. Next, under the constraints of a minimum probability of correct decision and a maximum probability of incorrect decision of the proposed identification rule, the optimum test plan (including the determinations of inspection frequency, sample size, and termination time for each run) can be obtained by minimizing the total experimental cost. An example is provided to illustrate the proposed method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 514–526, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10024 相似文献
106.
In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039 相似文献
107.
The class of functions expressed as linear (not necessarily convex) combinations of negative exponential functions is dense in the set of all square integrable functions on the nonnegative reals. Because of this and resultant mathematical properties, linear combinations of exponential densities have excellent potential for wide application in stochastic modeling. This work documents the development and testing of a practical procedure for maximum-likelihood estimation for these generalized exponential mixtures. The algorithm offered for the problem is of the Jacobi type and guarantees that the result will provide a legitimate probability function of the prescribed type. Extensive testing has been performed and results are very favorable: convergence is rapid and the use of computer resources rather limited. 相似文献
108.
109.
Edward Katumba‐Wamala 《Small Wars & Insurgencies》2013,24(3):160-171
Africa has had no shortage of guerrilla movements since 1975. However, very few have been successful that have not fought against European colonial rule or white minority regimes. Fundamentally, without external support, these movements have been almost universally failures. One major exception to this rule was the National Resistance Army of Uganda, which overthrew the regime led by General Tito Okello in 1986. What made the National Resistance Army a success and distinct from other guerrilla armies were its sound leadership, its superior organization and its creative strategy. 相似文献
110.
David A. Charters Sam C. Sarkesian Daniel W. Fitz‐Simons 《Small Wars & Insurgencies》2013,24(2):280-286
A. Hamish Ion and E.J. Errington (eds.), Great Powers and Little Wars: the Limits of Power. Westport, CT: Praeger, 1993. Pp.246, select biblio, index. $49.95. ISBN 0275–93965–0 John M. Rothgeb, Jr., Defining Power: Influence and Force in the Contemporary International System. New York: St. Martin's Press, 1993. Pp.205. $39.95 (hbk); $18.70 (pbk). ISBN 0312–086–822 and 061–056 Brian L. Job (ed.), The Insecurity Dilemma: National Security in Third World States. Boulder, CO: Lynne Rienner Publishers, 1992, Pp.257. $37. ISBN 1–55587–267–0 Edwin G. Corr and Stephen Sloan (eds.), Low‐Intensity Conflict: Old Threats in a New World. Westview Studies in Regional Security, Boulder, CO: Westview, 1992. Pp.310, maps, figures, index. $55 (hbk); $18.85 (pbk). ISBN 0–8133–8593–8 and 8594–6 相似文献