首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2015篇
  免费   418篇
  国内免费   164篇
  2024年   3篇
  2023年   12篇
  2022年   20篇
  2021年   40篇
  2020年   50篇
  2019年   41篇
  2018年   58篇
  2017年   106篇
  2016年   90篇
  2015年   65篇
  2014年   167篇
  2013年   181篇
  2012年   137篇
  2011年   198篇
  2010年   138篇
  2009年   184篇
  2008年   128篇
  2007年   142篇
  2006年   125篇
  2005年   121篇
  2004年   121篇
  2003年   74篇
  2002年   72篇
  2001年   70篇
  2000年   46篇
  1999年   41篇
  1998年   35篇
  1997年   17篇
  1996年   20篇
  1995年   20篇
  1994年   20篇
  1993年   13篇
  1992年   14篇
  1991年   10篇
  1990年   8篇
  1989年   5篇
  1988年   3篇
  1987年   1篇
  1975年   1篇
排序方式: 共有2597条查询结果,搜索用时 15 毫秒
751.
党的十八大和十八届三中全会提出"健全鼓励高校毕业生到基层工作的服务保障机制"的工作任务,基层就业成为大学生就业的重要渠道之一。为深入了解兵团高校大学生赴到兵团基层单位就业的状况,以石河子大学为个案,通过分析和梳理石河子大学毕业生到兵团基层就业情况及存在问题,尝试构建高校毕业生到兵团基层单位就业新机制,以期更好的为兵团基层发展提供智力支持和人才保障。  相似文献   
752.
对成像雷达的脉冲分段排序转发干扰   总被引:1,自引:1,他引:0       下载免费PDF全文
多假目标图像欺骗是目前宽带雷达干扰的难点。针对宽带雷达中常用的线性调频(Linear Frequency Modulated,LFM)信号,提出一种脉冲分段排序转发干扰方法。结合散射波信号模型,推导了合成干扰信号二维成像输出形式,讨论了假目标图像个数、分辨率与分段数以及转发次序之间的关系,并进行了仿真实验。结果表明该干扰方法可较便捷地产生多个沿距离向分布的假目标图像。结果对于成像雷达图像欺骗干扰具有理论指导意义。  相似文献   
753.
We consider a capacitated inventory model with flexible delivery upgrades, in which the seller allocates its on‐hand inventory to price‐ and delivery‐time‐sensitive customers. The seller has two decisions: inventory commitment and replenishment. The former addresses how the on‐hand inventories are allocated between the two classes of customers within an inventory cycle. The latter addresses how the inventory is replenished between inventory cycles. We develop optimal inventory allocation, upgrade, and replenishment policies and demonstrate that the optimal policy can be characterized by a set of switching curves. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 418–426, 2014  相似文献   
754.
We consider the problem of assessing the value of demand sharing in a multistage supply chain in which the retailer observes stationary autoregressive moving average demand with Gaussian white noise (shocks). Similar to previous research, we assume each supply chain player constructs its best linear forecast of the leadtime demand and uses it to determine the order quantity via a periodic review myopic order‐up‐to policy. We demonstrate how a typical supply chain player can determine the extent of its available information in the presence of demand sharing by studying the properties of the moving average polynomials of adjacent supply chain players. The retailer's demand is driven by the random shocks appearing in the autoregressive moving average representation for its demand. Under the assumptions we will make in this article, to the retailer, knowing the shock information is equivalent to knowing the demand process (assuming that the model parameters are also known). Thus (in the event of sharing) the retailer's demand sequence and shock sequence would contain the same information to the retailer's supplier. We will show that, once we consider the dynamics of demand propagation further up the chain, it may be that a player's demand and shock sequences will contain different levels of information for an upstream player. Hence, we study how a player can determine its available information under demand sharing, and use this information to forecast leadtime demand. We characterize the value of demand sharing for a typical supply chain player. Furthermore, we show conditions under which (i) it is equivalent to no sharing, (ii) it is equivalent to full information shock sharing, and (iii) it is intermediate in value to the two previously described arrangements. Although it follows from existing literature that demand sharing is equivalent to full information shock sharing between a retailer and supplier, we demonstrate and characterize when this result does not generalize to upstream supply chain players. We then show that demand propagates through a supply chain where any player may share nothing, its demand, or its full information shocks (FIS) with an adjacent upstream player as quasi‐ARMA in—quasi‐ARMA out. We also provide a convenient form for the propagation of demand in a supply chain that will lend itself to future research applications. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 515–531, 2014  相似文献   
755.
In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014  相似文献   
756.
Abstract

This article draws upon previously unavailable document materials to question views pointing to a degree of stagnation in Japanese maritime thinking. It similarly reviews claims about trends to compensate the decline of national military power with the build-up of projection capabilities. The article’s main argument is that Japanese seapower is not declining. The Japanese Navy is evolving to combine enhanced capabilities to retain sea control in the Sea of Japan and the East China Sea with extended operational reach and flexibility, including an expeditionary component to meet alliance and diplomatic commitments in East Asia and beyond its confines.  相似文献   
757.
舰艇编队防空过程建模及分析   总被引:1,自引:0,他引:1       下载免费PDF全文
防空作战是大型水面舰艇编队的主要作战样式之一。运用PEPA(性能评价过程代数)方法对舰艇编队防空作战全过程进行有效建模,形式化描述了预警探测、情报传递、命令下达、防空拦截等作战主要过程。建立的PEPA模型具有层次化结构,考虑了要素间相互协作,体现了编队防空作战分布、并发的特点。通过对建立的PEPA模型进行性能指标选择和稳定状态分析,得到了不同因素对编队能力发挥的影响情况,获得了防空作战的基本要素组成,从而提供了一种解决舰艇编队问题的新方法。  相似文献   
758.
由于不确定数据流应用的出现,给传统的精确、静态数据环境下的多维建模带来了巨大挑战。针对不确定数据流动态、无限和不确定等特征,提出了一种不确定数据流多维模型。该模型中引入了不确定对象来描述不确定事实元组,并且通过定义时间维度的层次时间窗口,很好地反映了数据流的动态性和无限性,最后还对此多维不确定数据流模型的基本代数操作和分析代数操作进行了形式化定义,为不确定数据流多维查询与分析提供了理论依据。  相似文献   
759.
竖立状态的运载火箭一旦遭遇地震,极易造成箭体倾倒等灾难性后果。为了确保运载火箭在地震中的安全,针对某型运载火箭,采用时程分析法对其进行地震响应分析,得到了火箭的弯矩、位移响应峰值沿箭体纵向的分布规律。分析了火箭关键位置处弯矩响应的频域特性,设计了火箭的减震措施,并分析了火箭与发射台的连接刚度、隔震支座刚度对火箭地震响应的影响规律。结果表明:火箭弯矩响应的最大值发生在靠近火箭尾段的位置,位移响应的最大值发生在火箭头部位置;改变火箭与发射台连接刚度以及在发射台底部加装隔震支座的方式可以有效地减小火箭的地震响应。  相似文献   
760.
针对舰炮火控雷达高精度实时仿真建模的问题,运用高斯分布和正态平稳过程的两种误差序列生成方法,建立火控雷达简化仿真模型。通过对某火控雷达实测数据误差的统计及时序相关性分析,完成误差序列仿真生成与验证,给出了实现舰炮火控雷达探测误差仿真的优选方法。实践证明,正态平稳模型的误差生成方法可以有效满足新型舰炮仿真试验火控雷达建模要求。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号