首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   37篇
  免费   22篇
  国内免费   1篇
  2020年   1篇
  2019年   1篇
  2018年   1篇
  2016年   4篇
  2015年   3篇
  2014年   2篇
  2013年   3篇
  2012年   1篇
  2011年   5篇
  2010年   5篇
  2009年   2篇
  2008年   7篇
  2007年   3篇
  2006年   1篇
  2005年   3篇
  2004年   6篇
  2002年   2篇
  2001年   1篇
  1999年   1篇
  1998年   1篇
  1997年   1篇
  1995年   1篇
  1994年   2篇
  1993年   2篇
  1990年   1篇
排序方式: 共有60条查询结果,搜索用时 15 毫秒
1.
一类高次多项式系统极限环的讨论   总被引:1,自引:0,他引:1  
通过变换将一类高次多项式系统化为Lienard系统,利用Hopf分枝定理和张芷芬唯一性定理,证明了该类系统极限环的存在性与唯一性。  相似文献   
2.
分析了某型外贸机空对地发射57-2航箭射导弹着点超前的基本原因,并从工程实践出发,提出了解决超前问题的新思路。其基本设想是在武器瞄准方程计算火箭弹道的初始条件中加入一个火箭爬升角增量和火箭虚拟速度增量,使计算弹道逼近实际弹道,避免了重新修正火箭阻力函数,重新计算弹道及弹道拟合的周期长、费用高的常规办法。进而在此基础上修改了平显软件。经验证试飞,获得满意结果。  相似文献   
3.
过盈配合数值分析与优化设计   总被引:1,自引:0,他引:1  
围绕高速转盘的过盈配合问题,应用Ansys9.0有限元软件非线性接触技术和优化分析技术确定传递扭矩所需的最佳过盈配合量。实践证明,有限元技术在工程应用中能够优化过盈配合量,缩短设计周期,提高设计质量。  相似文献   
4.
讨论了微分多项式fnP(f)(n≥2)之导数的Picard例外集问题,在Picard例外集的意义之下推广了Anderson等人的结果。  相似文献   
5.
讨论作业具有线性加工时间,作业间具有链约束的两台处理机流水作业排序问题,目标函数为极小化完工时间。在作业加工时间简单线性恶化下,提出作业的非负开始和停止延迟恶化率,构造了满足约束条件的复合作业。在此基础上,给出作业间具有平行链约束的两台处理机流水作业排序问题的最优多项式算法。  相似文献   
6.
以45^#金属套和氮化硅陶瓷柱为研究对象,采用有限元法分析了不同过盈量下金属套/陶瓷柱外伸式过盈连接的应力分布规律。结果表明:陶瓷柱在接触边缘均存在明显的边缘效应,轴向应力梯度较大;金属套在接触边缘内侧存在显著的应力集中,其值远大于对应位置陶瓷柱的压应力,易于导致陶瓷材料破坏。采用热胀法进行了试验验证,过盈连接试样均在12h内发生自然断裂,较好地验证了有限元分析结果。  相似文献   
7.
The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
8.
Instead of measuring a Wiener degradation or performance process at predetermined time points to track degradation or performance of a product for estimating its lifetime, we propose to obtain the first‐passage times of the process over certain nonfailure thresholds. Based on only these intermediate data, we obtain the uniformly minimum variance unbiased estimator and uniformly most accurate confidence interval for the mean lifetime. For estimating the lifetime distribution function, we propose a modified maximum likelihood estimator and a new estimator and prove that, by increasing the sample size of the intermediate data, these estimators and the above‐mentioned estimator of the mean lifetime can achieve the same levels of accuracy as the estimators assuming one has failure times. Thus, our method of using only intermediate data is useful for highly reliable products when their failure times are difficult to obtain. Furthermore, we show that the proposed new estimator of the lifetime distribution function is more accurate than the standard and modified maximum likelihood estimators. We also obtain approximate confidence intervals for the lifetime distribution function and its percentiles. Finally, we use light‐emitting diodes as an example to illustrate our method and demonstrate how to validate the Wiener assumption during the testing. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
9.
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020  相似文献   
10.
针对拦截弹上实时测得的带有随机干扰的测量值,讨论了测量数据的建模与处理方法,并结合数据处理过程中所涉及到的阶次的确定、样本数的选取和拐点问题提出数据处理的简化方法。最后给出了一个仿真算例  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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