全文获取类型
收费全文 | 275篇 |
免费 | 45篇 |
国内免费 | 7篇 |
出版年
2022年 | 1篇 |
2021年 | 5篇 |
2020年 | 3篇 |
2019年 | 7篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 11篇 |
2015年 | 15篇 |
2014年 | 15篇 |
2013年 | 61篇 |
2012年 | 10篇 |
2011年 | 11篇 |
2010年 | 8篇 |
2009年 | 13篇 |
2008年 | 13篇 |
2007年 | 16篇 |
2006年 | 7篇 |
2005年 | 18篇 |
2004年 | 10篇 |
2003年 | 12篇 |
2002年 | 10篇 |
2001年 | 9篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 5篇 |
1997年 | 12篇 |
1996年 | 7篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1988年 | 2篇 |
1986年 | 1篇 |
1983年 | 1篇 |
排序方式: 共有327条查询结果,搜索用时 343 毫秒
61.
磁悬挂平天的位置传感器具有一定的特殊性,它需要同时获取被悬挂的飞行器模型的多自由度位置分量。本文对这一问题进行了研究,并讨论了其工程实现问题。 相似文献
62.
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 相似文献
63.
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 相似文献
64.
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 相似文献
65.
We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016 相似文献
66.
本文介绍了微带线有效介电常数ε_e的测量方法,给出了当切割量不等于λ_m/2的整数倍时的精确修正方法。详细讨论了一种新的微带线ε_r的侧量方法——网络扰动法。 相似文献
67.
有源消声技术对于管道中低频噪声的控制非常有效。本文描述的自适应管道有源消声系统,性能稳定,对单频的消声量可达30dB,对宽带随机噪声的消声量不低于14dB。 相似文献
68.
69.
通过对某船体结构钢的系列ETT试验和相应的宏微观分析,不仅验证了材料冲击韧性与撕裂抗力之间的相关性,而且还显示了材料宏观性能与微观结构之间的密切联系及高ε下的断裂特点。 相似文献
70.
针对自适应有源消声最常用的滤波—XLMS算法(FLMS)运算量小、收敛缓慢、宽带消声效果差等不足之处,利用误差通道滤波特性,提出了变换域滤波—XLMS算法。新算法的突出优点是收敛速度较快、宽带消声效果较好。 相似文献