首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   489篇
  免费   1篇
  490篇
  2021年   5篇
  2020年   8篇
  2019年   4篇
  2017年   11篇
  2016年   10篇
  2015年   8篇
  2014年   8篇
  2013年   56篇
  2012年   23篇
  2011年   31篇
  2010年   24篇
  2009年   18篇
  2008年   28篇
  2007年   15篇
  2006年   17篇
  2005年   6篇
  2004年   5篇
  2002年   4篇
  2001年   4篇
  1999年   2篇
  1998年   6篇
  1997年   6篇
  1995年   5篇
  1994年   7篇
  1993年   10篇
  1992年   7篇
  1991年   6篇
  1990年   4篇
  1989年   12篇
  1988年   3篇
  1987年   10篇
  1986年   10篇
  1985年   7篇
  1983年   5篇
  1982年   5篇
  1981年   8篇
  1980年   9篇
  1979年   11篇
  1978年   4篇
  1977年   6篇
  1976年   7篇
  1975年   7篇
  1974年   2篇
  1973年   2篇
  1972年   12篇
  1971年   3篇
  1970年   3篇
  1969年   9篇
  1968年   7篇
  1966年   3篇
排序方式: 共有490条查询结果,搜索用时 0 毫秒
191.
针对铁谱分析的磨粒识别过程中存在原始磨粒特征描述指标参数多、非线性突出的问题,提出基于核主成分分析的磨粒特征提取方法,介绍该方法的原理与算法。结合某柴油发动机故障检测与分析系统中铁谱磨粒自动识别的应用实例,并与传统主成份分析方法进行对比分析,结果表明该方法在进行样本非线性特征参数指标综合以及特征维数压缩方面具有可行性和有效性。  相似文献   
192.
针对海战场态势中,由于系统误差、电磁干扰、地理环境隔绝、电子静默等原因,出现的传感器信号长时间中断、目标丢失,导致态势中航迹不连续的问题,提出了一种改进的模糊航迹关联算法。该算法通过采用统一速度模糊因素和方向模糊因素、改进加速度模糊因素、制定二级关联策略和自动调整隶属度函数关联阈值等方法,实现了在目标机动性较强、中断时间较长等情况下的航迹关联,保证了态势的稳定。通过Monte Carlo仿真实验表明,该算法具备较高的关联性和鲁棒性。  相似文献   
193.
194.
n periodic tasks are to be processed by a single machine, where each task i has a maximum request rate or periodicity Fi, a processing time Ei, a deadline Di, relative to each request of task i, a task-request interrupt overhead Ii, and a task-independent scheduling overhead S. Two scheduling strategies are considered for sequencing the execution of an arbitrary arrangement of task requests in time: the preemptive and the nonpreemptive earliest-deadline algorithms. Necessary and sufficient conditions are derived for establishing whether a given set of tasks can be scheduled by each scheduling strategy. The conditions are given in the form of limited simulations of a small number of well-defined task-request arrangements. If all simulations succeed, the schedule is feasible for the given set of tasks. If any simulation fails, the schedule is infeasible. While interrupt handling and scheduling overheads can be handled by such simulations, context switching overhead resulting from preemption cannot. A counterexample illustrates how the simulations fail to uncover unschedulable task sets when context switching overhead is considered.  相似文献   
195.
196.
197.
Efficient computation of tight bounds is of primary concern in any branch-and-bound procedure for solving integer programming problems. Many successful branch-and-bound approaches use the linear programming relaxation for bounding purposes. Significant interest has been reported in Lagrangian and surrogate duals as alternative sources of bounds. The existence of efficient techniques such as subgradient search for solving Lagrangian duals has led to some very successful applications of Lagrangian duality in solving specially structured problems. While surrogate duals have been theoretically shown to provide stronger bounds, the difficulty of surrogate dual-multiplier search has discouraged their employment in solving integer programs. Based on the development of a new relationship between surrogate and Lagrangian duality, we suggest a new strategy for computing surrogate dual values. The proposed approach allows us to directly use established Lagrangian search methods for exploring surrogate dual multipliers. Computational experience with randomly generated capital budgeting problems validates the economic feasibility of the proposed ideas.  相似文献   
198.
This paper gives a mathematical programming model for the problem of assigning frequencies to nodes in a communications network. The objective is to select a frequency assignment which minimizes both cochannel and adjacent-channel interference. In addition, a design engineer has the option to designate key links in which the avoidance of jamming due to self interference is given a higher priority. The model has a nonconvex quadratic objective function, generalized upper-bounding constraints, and binary decision variables. We developed a special heuristic algorithm and software for this model and tested it on five test problems which were modifications of a real-world problem. Even though most of the test problems had over 600 binary variables, we were able to obtain a near optimum in less than 12 seconds of CPU time on a CDC Cyber-875.  相似文献   
199.
This chapter examines how Al Qaeda, an asymmetric power, was able to become a global challenger to the existing international structure. Neither regional insurgency theories nor grand-scale global theories alone are adequate to explain Al Qaeda's ability. Rather, a modification of the seven dimensions of the Manwaring paradigm for successful insurgency combined with key concepts of global revolutionary or imperial powers formerly applied to states gives insight to this fundamental question. Al Qaeda's asymmetric global challenge is unique, and understanding the nature of the threat is key to finally defeating it.  相似文献   
200.
The object of this article is to investigate the risk-pooling effect of depot stock in two-echelon distribution system in which the depot serves n retailers in parallel, and to develop computationally tractable optimization procedures for such systems. The depot manager has complete information about stock levels and there are two opportunities to allocate stock to the retailers within each order cycle. We identify first- and second-order aspects to the risk-pooling effect. In particular, the second-order effect is the property that the minimum stock available to any retailer after the second allocation converges in probability to a constant as the number of retailers in the system increases, assuming independence of the demands. This property is exploited in the development of efficient procedures to determine near-optimal values of the policy parameters.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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