全文获取类型
收费全文 | 949篇 |
免费 | 347篇 |
国内免费 | 83篇 |
出版年
2024年 | 1篇 |
2023年 | 16篇 |
2022年 | 7篇 |
2021年 | 22篇 |
2020年 | 30篇 |
2019年 | 25篇 |
2018年 | 13篇 |
2017年 | 69篇 |
2016年 | 74篇 |
2015年 | 53篇 |
2014年 | 67篇 |
2013年 | 111篇 |
2012年 | 82篇 |
2011年 | 70篇 |
2010年 | 57篇 |
2009年 | 97篇 |
2008年 | 71篇 |
2007年 | 84篇 |
2006年 | 74篇 |
2005年 | 51篇 |
2004年 | 60篇 |
2003年 | 41篇 |
2002年 | 45篇 |
2001年 | 30篇 |
2000年 | 29篇 |
1999年 | 18篇 |
1998年 | 14篇 |
1997年 | 17篇 |
1996年 | 11篇 |
1995年 | 8篇 |
1994年 | 8篇 |
1993年 | 9篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 8篇 |
1989年 | 2篇 |
排序方式: 共有1379条查询结果,搜索用时 375 毫秒
851.
随机频率步进信号兼具步进频率雷达和宽带噪声雷达的特点,不仅可以降低系统瞬时带宽和数据采样率,还具有优良的低截获概率(LPI)、电磁兼容性(EMC)和抗射频干扰(ARFI)特性.分析了随机频率步进信号的相关输出及模糊函数的统计特性,如一阶矩、二阶矩和方差等,并与均匀频率步进信号做了抗干扰性能的比较.提出并分析了相关输出结... 相似文献
852.
针对电子侦察卫星的使用约束,及不同任务的调度需求,建立了电子侦察卫星联合侦察的多目标混合整数规划模型.利用进化算法的全局搜索能力和变邻域搜索的局部优化能力,提出了一种多目标进化算法和变邻域搜索相结合两阶段混合调度算法MOEA VNS.针对问题多时间窗组合优化特点,设计了进化算子与邻域移动算子,在确保解多样性的同时使算法... 相似文献
853.
针对目前部队在制定装备计量保障计划时存在的效率低、难以达到计量保障力量的合理配置,易造成人力、物力和财力浪费等问题,提出了制定雷达旅团装备计量保障计划的排序优化方法.首先介绍雷达旅团计量保障计划的相关概念,然后建立了描述制定计量保障计划的数学模型,并提出了求解模型的优化方法,最后通过实例对模型进行了验证. 相似文献
854.
无线传感器网络路由算法面临着节省能量、延长网络寿命、提高可靠性等方面的挑战。提出了一种基于遗传的无线传感器网络路由算法。对算法中的算子编码、适应度函数设计、编码方式及参数选取进行了细致研究。仿真结果表明,本算法减少了能耗、延长了网络生存时间并提高了网络的可靠性。 相似文献
855.
856.
紧致格式具有模板紧凑、精度高的特点,然而直接应用该格式捕捉激波会产生虚假振荡。解决该问题有多种思路,本文着重研究基于TVD思想的紧致方法。首先推导了两种5阶迎风紧致格式,并采用Fourier分析比较其耗散与色散特性。然后,采用保单调保精度方法和限制器两种不同的TVD方法,进行算例验证。计算结果表明,应用TVD方法后,格式对激波、接触间断分辨率好且鲁棒性增强,但不同的TVD方法仍存在精度降低、耗散不足等问题。 相似文献
857.
This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
858.
Transfer pricing refers to the pricing of an intermediate product or service within a firm. This product or service is transferred between two divisions of the firm. Thus, transfer pricing is closely related to the allocation of profits in a supply chain. Motivated by the significant impact of transfer pricing methods for tax purposes on operational decisions and the corresponding profits of a supply chain, in this article, we study a decentralized supply chain of a multinational firm consisting of two divisions: a manufacturing division and a retail division. These two divisions are located in different countries under demand uncertainty. The retail division orders an intermediate product from the upstream manufacturing division and sets the retail price under random customer demand. The manufacturing division accepts or rejects the retail division's order. We specifically consider two commonly used transfer pricing methods for tax purposes: the cost‐plus method and the resale‐price method. We compare the supply chain profits under these two methods. Based on the newsvendor framework, our analysis shows that the cost‐plus method tends to allocate a higher percentage of profit to the retail division, whereas the resale‐price method tends to achieve a higher firm‐wide profit. However, as the variability of demand increases, our numerical study suggests that the firm‐wide and divisional profits tend to be higher under the cost‐plus method than they are under the resale‐price method. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
859.
This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013 相似文献
860.
伴随着互联网规模的不断扩展,信息过载问题越来越突出。信息推荐系统被视为解决信息过载问题的最有效方法。然而目前的方法大多数仅考虑用户独立的反馈,而忽略用户的社会属性对推荐的重要作用,这对信息推荐系统的性能会造成巨大的影响。为此,本文提出了基于朋友关系预测的信息推荐算法,将用户的社会关系预测引入信息推荐过程中,分别基于用户的拓扑信息及历史交互信息建立用户社会关系的存在性判定及关系类型判定,并利用线性回归分析方法和逻辑回归分析方法实现了基本特征的融合。最后,通过在Epinions和Slashdot真实数据集上的实验证明,本方法能够有效提高用户社会关系预测的准确性。 相似文献