全文获取类型
收费全文 | 1604篇 |
免费 | 515篇 |
国内免费 | 160篇 |
出版年
2024年 | 2篇 |
2023年 | 19篇 |
2022年 | 25篇 |
2021年 | 35篇 |
2020年 | 43篇 |
2019年 | 33篇 |
2018年 | 27篇 |
2017年 | 76篇 |
2016年 | 117篇 |
2015年 | 72篇 |
2014年 | 134篇 |
2013年 | 124篇 |
2012年 | 143篇 |
2011年 | 111篇 |
2010年 | 93篇 |
2009年 | 138篇 |
2008年 | 94篇 |
2007年 | 117篇 |
2006年 | 159篇 |
2005年 | 136篇 |
2004年 | 104篇 |
2003年 | 85篇 |
2002年 | 60篇 |
2001年 | 57篇 |
2000年 | 45篇 |
1999年 | 48篇 |
1998年 | 43篇 |
1997年 | 31篇 |
1996年 | 18篇 |
1995年 | 17篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 14篇 |
1991年 | 14篇 |
1990年 | 15篇 |
1989年 | 5篇 |
1987年 | 1篇 |
排序方式: 共有2279条查询结果,搜索用时 31 毫秒
111.
以简谐外磁场环境下的J-C模型为研究对象,从系统的哈密顿矩阵出发,通过计算模拟得出热力学纠缠度解析表达式。计算结果表明,对应于不同的外磁场强度,系统热力学纠缠度呈周期性余弦变化,但随环境温度升高快速衰减;在相同环境温度下,系统热力学纠缠度关于磁场强度左右不对称变化。 相似文献
112.
顺序输送是利用一条管道输送多种油品,因其可最大限度发挥管道输送潜能而被广泛应用。按照前后行液体不同可分为水顶油、油顶水和不同油品间顺序输送等,其中水顶油顺序输送主要用于管道撤收前的排空作业。对水顶油顺序输送油水混合过程进行了分析,建立了油水混合模型,利用CFD对其进行数值求解,并将仿真结果与前期理论分析进行了对比,两者吻合较好。所得结论可为机动管线水顶油排空作业提供科学指导。 相似文献
113.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
114.
Model parameter estimation and residual life prediction for a partially observable failing system 下载免费PDF全文
We consider a partially observable degrading system subject to condition monitoring and random failure. The system's condition is categorized into one of three states: a healthy state, a warning state, and a failure state. Only the failure state is observable. While the system is operational, vector data that is stochastically related to the system state is obtained through condition monitoring at regular sampling epochs. The state process evolution follows a hidden semi‐Markov model (HSMM) and Erlang distribution is used for modeling the system's sojourn time in each of its operational states. The Expectation‐maximization (EM) algorithm is applied to estimate the state and observation parameters of the HSMM. Explicit formulas for several important quantities for the system residual life estimation such as the conditional reliability function and the mean residual life are derived in terms of the posterior probability that the system is in the warning state. Numerical examples are presented to demonstrate the applicability of the estimation procedure and failure prediction method. A comparison results with hidden Markov modeling are provided to illustrate the effectiveness of the proposed model. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 190–205, 2015 相似文献
115.
Sheldon M. Ross 《海军后勤学研究》2015,62(8):659-663
There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time of customer i has distribution Fi, and on completion of service of customer i a positive reward ri is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015 相似文献
116.
117.
118.
基于人工社会的计算实验使应急管理的定量分析与研究成为可能。然而,应急管理模型涉及多个学科与领域,具有多层次、非线性和多粒度等特点,需要一套规范的流程来指导人工社会的模型建立和模型管理。论文梳理了面向应急管理的模型体系,提出了基于领域特定建模的人工社会建模方法,解决了多领域建模问题;研究了模型的形式化描述与编码问题,并实现了模型的有效管理;结合"甲型H1N1"病程模型,详细论述了模型的构建方法与管理问题,为面向应急管理的计算实验提供一体化的模型服务。 相似文献
119.
在雷达成像中,基于CS的方法因其压缩采样的特性而在高分辨雷达成像中得到广泛应用。然而由于其是一种基于参数化的成像方法,对观测位置误差特别敏感。在实际中,一般无法知道精确的观测位置。观测位置的误差会造成成像结果位置的偏离、散焦以及无法聚焦。针对基于压缩感知的成像算法存在的观测位置依赖性问题,提出了一种基于调幅-线性调频(AM-LFM)分解和逆Radon变换(IRT)的微动目标成像算法。该方法根据分解后信号调频率分离目标微动信号与主体信号,再进行IRT成像。仿真及实验结果验证了算法的可行性和有效性。 相似文献
120.