全文获取类型
| 收费全文 | 943篇 |
| 免费 | 8篇 |
| 国内免费 | 7篇 |
专业分类
| 958篇 |
出版年
| 2025年 | 1篇 |
| 2024年 | 2篇 |
| 2023年 | 10篇 |
| 2022年 | 3篇 |
| 2021年 | 14篇 |
| 2020年 | 25篇 |
| 2019年 | 23篇 |
| 2018年 | 8篇 |
| 2017年 | 29篇 |
| 2016年 | 42篇 |
| 2015年 | 32篇 |
| 2014年 | 53篇 |
| 2013年 | 89篇 |
| 2012年 | 42篇 |
| 2011年 | 44篇 |
| 2010年 | 47篇 |
| 2009年 | 56篇 |
| 2008年 | 54篇 |
| 2007年 | 54篇 |
| 2006年 | 47篇 |
| 2005年 | 40篇 |
| 2004年 | 51篇 |
| 2003年 | 28篇 |
| 2002年 | 25篇 |
| 2001年 | 23篇 |
| 2000年 | 24篇 |
| 1999年 | 16篇 |
| 1998年 | 12篇 |
| 1997年 | 10篇 |
| 1996年 | 11篇 |
| 1995年 | 4篇 |
| 1994年 | 8篇 |
| 1993年 | 13篇 |
| 1992年 | 5篇 |
| 1991年 | 6篇 |
| 1990年 | 5篇 |
| 1989年 | 1篇 |
| 1975年 | 1篇 |
排序方式： 共有958条查询结果，搜索用时 0 毫秒
701.
用GPS标校平台罗经方位安装误差与航向精度测量 总被引：1，自引：0，他引：1
提高实船平台罗经方位安装精度是超视距作战系统的需要 ,为此提出用GPS标校平台罗经新方案。该方案曾在某国制造的导弹艇上首次进行了实船检验 ,取得了圆满成功。主要介绍该方案的具体操作方法、数据处理、误差分析及总结的初步经验。 相似文献
702.
杨润生 《军械工程学院学报》1993,(1)
本文在分析高速数据采集电路的基础上,采用单片机技术,设计了一种通用性能好、分析频带宽的瞬态信号测试系统。该系统成功地解决了采样速度和频率分辩率的矛盾,提供了一种解决瞬态波形测量的有效方法。 相似文献
703.
Yemane Wolde-Rufael 《Defence and Peace Economics》2016,27(6):871-884
The rising trend in income inequality has recently attracted a renewed interest in the determinants of this growing trend across many countries. This article adds to the debate by investigating the impact of defence expenditure as a possible determinant of inequality in Taiwan, a country once was considered to be a poster child of an equitable growth, but now income inequality has become one of the Taiwan’s growing challenges. Applying the bounds test approach to cointegration and four long-run estimators for the period from 1976–2011, we found a long-run relationship between the various measures of inequality and defence expenditure where defence expenditure exerts a positive and a statistically significant impact on the worse income inequality in Taiwan. Further application of the lag-augmented causality test procedure also reveals a unidirectional causality running from defence expenditure to income inequality with defence expenditure causing income inequality to rise. 相似文献
704.
Additive convolution of unimodal and α‐unimodal random variables are known as an old classic problem which has attracted the attention of many authors in theory and applied fields. Another type of convolution, called multiplicative convolution, is rather younger. In this article, we first focus on this newer concept and obtain several useful results in which the most important ones is that if is logconcave then so are and for some suitable increasing functions ?. This result contains and as two more important special cases. Furthermore, one table including more applied distributions comparing logconcavity of f(x) and and two comprehensive implications charts are provided. Then, these fundamental results are applied to aging properties, existence of moments and several kinds of ordered random variables. Multiplicative strong unimodality in the discrete case is also introduced and its properties are investigated. In the second part of the article, some refinements are made for additive convolutions. A remaining open problem is completed and a conjecture concerning convolution of discrete α‐unimodal distributions is settled. Then, we shall show that an existing result regarding convolution of symmetric discrete unimodal distributions is not correct and an easy alternative proof is presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 109–123, 2016 相似文献
705.
Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016 相似文献
706.
Sunkyo Kim 《海军后勤学研究》2016,63(7):549-561
A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n2 for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016 相似文献
707.
A new connection between the distribution of component failure times of a coherent system and (adaptive) progressively Type‐II censored order statistics is established. Utilizing this property, we develop inferential procedures when the data is given by all component failures until system failure in two scenarios: In the case of complete information, we assume that the failed component is also observed whereas in the case of incomplete information, we have only information about the failure times but not about the components which have failed. In the first setting, we show that inferential methods for adaptive progressively Type‐II censored data can directly be applied to the problem. For incomplete information, we face the problem that the corresponding censoring plan is not observed and that the available inferential procedures depend on the knowledge of the used censoring plan. To get estimates for distributional parameters, we propose maximum likelihood estimators which can be obtained by solving the likelihood equations directly or via an Expectation‐Maximization‐algorithm type procedure. For an exponential distribution, we discuss also a linear estimator to estimate the mean. Moreover, we establish exact distributions for some estimators in the exponential case which can be used, for example, to construct exact confidence intervals. The results are illustrated by a five component bridge system. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 512–530, 2015 相似文献
708.
Hub terminals are important entities in modern distribution networks and exist for any transportation device, that is, cross docks and parcel distribution centers for trucks, container ports for ships, railway yards for trains, and hub airports for aircraft. In any of these hubs, the mid‐term planning task of synchronizing the transshipment of goods and passengers when servicing the transportation devices has to be solved, for which many different solution approaches specifically tailored to the respective application exist. We, however, take a unified view on synchronization in hubs and aim at a general building block. As a point of origin, a basic vertex ordering problem, the circular arrangement problem (CAP), is identified. We explain the relation between the CAP and hub processes, develop suited algorithms for solving the CAP, and extend the basic CAP by multiple additions, for example, arrival times, limited storage space, and multiple service points, make the problem adaptable to a wide range of hub terminals. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 454–469, 2015 相似文献
709.
Motivated by the presence of loss‐averse decision making behavior in practice, this article considers a supply chain consisting of a firm and strategic consumers who possess an S‐shaped loss‐averse utility function. In the model, consumers decide the purchase timing and the firm chooses the inventory level. We find that the loss‐averse consumers' strategic purchasing behavior is determined by their perceived gain and loss from strategic purchase delay, and the given rationing risk. Thus, the firm that is cognizant of this property tailors its inventory stocking policy based on the consumers' loss‐averse behavior such as their perceived values of gain and loss, and their sensitivity to them. We also demonstrate that the firm's equilibrium inventory stocking policy reflects both the economic logic of the traditional newsvendor inventory model, and the loss‐averse behavior of consumers. The equilibrium order quantity is significantly different from those derived from models that assume that the consumers are risk neutral and homogeneous in their valuations. We show that the firm that ignores strategic consumer's loss‐aversion behavior tends to keep an unnecessarily high inventory level that leads to excessive leftovers. Our numerical experiments further reveal that in some extreme cases the firm that ignores strategic consumer's loss‐aversion behavior generates almost 92% more leftovers than the firm that possesses consumers’ loss‐aversion information and takes it into account when making managerial decisions. To mitigate the consumer's forward‐looking behavior, we propose the adoption of the practice of agile supply chain management, which possesses the following attributes: (i) procuring inventory after observing real‐time demand information, (ii) enhanced design (which maintains the current production mix but improves the product performance to a higher level), and (iii) customized design (which maintains the current performance level but increases the variety of the current production line to meet consumers’ specific demands). We show that such a practice can induce the consumer to make early purchases by increasing their rationing risk, increasing the product value, or diversifying the product line. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 435–453, 2015 相似文献
710.
Thomas W. Lucas W. David Kelton Paul J. Sánchez Susan M. Sanchez Ben L. Anderson 《海军后勤学研究》2015,62(4):293-303
Decades ago, simulation was famously characterized as a “method of last resort,” to which analysts should turn only “when all else fails.” In those intervening decades, the technologies supporting simulation—computing hardware, simulation‐modeling paradigms, simulation software, design‐and‐analysis methods—have all advanced dramatically. We offer an updated view that simulation is now a very appealing option for modeling and analysis. When applied properly, simulation can provide fully as much insight, with as much precision as desired, as can exact analytical methods that are based on more restrictive assumptions. The fundamental advantage of simulation is that it can tolerate far less restrictive modeling assumptions, leading to an underlying model that is more reflective of reality and thus more valid, leading to better decisions. Published 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 293–303, 2015 相似文献