全文获取类型
收费全文 | 538篇 |
免费 | 213篇 |
国内免费 | 11篇 |
出版年
2023年 | 3篇 |
2022年 | 9篇 |
2021年 | 29篇 |
2020年 | 6篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 5篇 |
2016年 | 6篇 |
2015年 | 22篇 |
2014年 | 17篇 |
2013年 | 34篇 |
2012年 | 19篇 |
2011年 | 15篇 |
2010年 | 29篇 |
2009年 | 29篇 |
2008年 | 20篇 |
2007年 | 37篇 |
2006年 | 15篇 |
2005年 | 32篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 10篇 |
2000年 | 24篇 |
1999年 | 47篇 |
1998年 | 50篇 |
1997年 | 39篇 |
1996年 | 40篇 |
1995年 | 30篇 |
1994年 | 32篇 |
1993年 | 26篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 21篇 |
1989年 | 11篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有762条查询结果,搜索用时 15 毫秒
141.
142.
陈坚男 《军队政工理论研究》2005,6(2):43-44
贯彻落实<军队基层建设纲要>,扎实做好抓基层打基础的工作,要按照新时期基层建设特点和规律的要求,进一步确立依靠官兵、依靠制度、依靠创新、依靠激励打基础建基层的意识和工作方法,努力把基层建设提高到一个新水平,为提升部队战斗力奠定坚实的基础. 相似文献
143.
针对复杂电磁环境中存在多个非均匀分布的、不同带宽的信号的情况,提出一种新的动态信道化接收机设计方法。设计一个半带滤波器,并通过内插运算压缩它的频率响应,形成周期频谱;对输入信号进行滤波,同时使原信号经过一定延迟后减去滤波后的信号,形成两路在频谱上互补的信号;用均匀分析滤波器组对得到的两路信号分别进行滤波分解处理,实现监视频段的均匀信道化;根据能量检测结果将属于同一信号的相邻子信道信号作为下一步重构处理的输入,并设计出相应的综合滤波器组提取信号。理论分析和仿真结果验证了新方法的有效性。 相似文献
144.
采用叠加组播技术为XMSF提供多对多的通信服务,同时使用拥塞控制机制保证其网络服务质量。提出了一种新的组播拥塞控制模型,在MAX-PLUS代数基础上采用线性循环法分析计算了其吞吐量,经过仿真验证了该模型的可行性和灵活性。 相似文献
145.
146.
陈岸然 《军队政工理论研究》2006,7(6):53-55
科学人才观是做好人才工作,落实人才强军战略的思想基础。全面理解和践行科学人才观,一要牢固树立人才资源是第一资源、人人都可以成才、以人为本的观念;二要始终坚持党管人才原则,加强各级党委对人才工作的领导;三要构建与科学人才观相适应的军事人才激励机制。 相似文献
147.
This article studies (nQ, r) inventory policies, under which the order quantity is restricted to be an integer multiple of a base lot size Q. Both Q and r are decision variables. Assuming the one-period expected holding and backorder cost function is unimodal, we develop an efficient algorithm to compute the optimal Q and r. The algorithm is facilitated by simple observations about the cost function and by tight upper bounds on the optimal Q. The total number of elementary operations required by the algorithm is linear in these upper bounds. By using the algorithm, we compare the performance of the optimal (nQ, r) policy with that of the optimal (s, S) policy through a numerical study, and our results show that the difference between them is small. Further analysis of the model shows that the cost performance of an (nQ, r) policy is insensitive to the choice of Q. These results establish that (nQ, r) models are potentially useful in many settings where quantized ordering is beneficial. 相似文献
148.
Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it. 相似文献
149.
We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable. 相似文献
150.