全文获取类型
收费全文 | 970篇 |
免费 | 369篇 |
国内免费 | 84篇 |
专业分类
1423篇 |
出版年
2024年 | 1篇 |
2023年 | 20篇 |
2022年 | 7篇 |
2021年 | 25篇 |
2020年 | 30篇 |
2019年 | 28篇 |
2018年 | 13篇 |
2017年 | 70篇 |
2016年 | 79篇 |
2015年 | 56篇 |
2014年 | 71篇 |
2013年 | 114篇 |
2012年 | 84篇 |
2011年 | 72篇 |
2010年 | 58篇 |
2009年 | 98篇 |
2008年 | 70篇 |
2007年 | 86篇 |
2006年 | 75篇 |
2005年 | 52篇 |
2004年 | 61篇 |
2003年 | 43篇 |
2002年 | 45篇 |
2001年 | 30篇 |
2000年 | 32篇 |
1999年 | 18篇 |
1998年 | 14篇 |
1997年 | 16篇 |
1996年 | 11篇 |
1995年 | 9篇 |
1994年 | 8篇 |
1993年 | 10篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 9篇 |
1989年 | 2篇 |
排序方式: 共有1423条查询结果,搜索用时 15 毫秒
81.
82.
83.
基于有限元法(FEM)和光滑粒子流体动力学(SPH)结合的算法,用数值模拟了钢质弹丸对钢筒约束土体的侵彻过程。基于ANSYS/LS-DYNA显式动力分析和LS-PrePost后处理软件,形象再现了钢质弹丸冲击作用下土体飞溅形成漏斗坑和直线通道的物理过程。侵彻深度计算结果与实验数据吻合较好,钢质弹丸的速度和加速度时程曲线图与理论分析一致,体现了FEM/SPH算法的精确性。研究结果表明FEM/SPH算法在模拟侵彻土体方面具有可行性和有效性。 相似文献
84.
85.
为提高军队自动化立体仓库的出库能力,提出应根据需求变化对在库物资货位进行动态调整,从而最大限度地保障军队物资需求。综合考虑堆垛机总行程、货物离散度和出库频率等评价指标,采用遗传算法对该多目标优化问题进行求解,并运用Matalab仿真。结果表明,该方法能较好地提高军队自动化立体仓库在需求动态变化时的出库能力。同时,该研究对一般仓库的货位优化也有一定的借鉴意义。 相似文献
86.
针对反导拦截弹助推段一般不进行大机动飞行、弹道相对平直的特点,基于小扰动线性化方程,设计了由阻尼回路、攻角回路和过载回路组成的三回路自动驾驶仪。在理想弹道计算的基础上选取特征点,在每个特征点处将弹体简化为二阶环节来近似。针对待优化参数多、且处于不同控制回路的特点,采用遗传算法对控制器参数进行优化。仿真结果证明所设计的控制器能够很好地跟踪指令信号。 相似文献
87.
针对水下电磁探测系统对直接耦合干扰的补偿精度受限于硬件采样分辨率的问题,研究了基于自适应技术的直接耦合干扰两级补偿方法。采用高速 DSP 芯片实现直接耦合干扰补偿电路,完成直接耦合干扰的粗调补偿;提出了基于可变遗忘因子的 QRD-LS 算法,并采用基于该算法的自适应陷波器实现了直接耦合干扰的微调补偿。实验研究验证了两级补偿方法对直接耦合干扰的补偿性能。结果表明:基于可变遗忘因子的QRD-LS 算法稳定性好,收敛速度快;基于该算法的自适应两级补偿方法对直接耦合干扰的补偿精度达到10-4倍。 相似文献
88.
In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014 相似文献
89.
Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process 下载免费PDF全文
Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014 相似文献
90.
We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014 相似文献