全文获取类型
收费全文 | 125篇 |
免费 | 1篇 |
专业分类
126篇 |
出版年
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 2篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2015年 | 1篇 |
2014年 | 2篇 |
2013年 | 5篇 |
2012年 | 6篇 |
2011年 | 10篇 |
2010年 | 5篇 |
2009年 | 8篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2006年 | 1篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 1篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
排序方式: 共有126条查询结果,搜索用时 0 毫秒
101.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms. 相似文献
102.
We consider the problem of placing sensors across some area of interest. The sensors must be placed so that they cover a fixed set of targets in the region, and should be deployed in a manner that allows sensors to communicate with one another. In particular, there exists a measure of communication effectiveness for each sensor pair, which is determined by a concave function of distance between the sensors. Complicating the sensor location problem are uncertainties related to sensor placement, for example, as caused by drifting due to air or water currents to which the sensors may be subjected. Our problem thus seeks to maximize a metric regarding intrasensor communication effectiveness, subject to the condition that all targets must be covered by some sensor, where sensor drift occurs according to a robust (worst‐case) mechanism. We formulate an approximation approach and develop a cutting‐plane algorithm to solve this problem, comparing the effectiveness of two different classes of inequalities. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 582–594, 2015 相似文献
103.
In this paper, we investigate systems subject to random shocks that are classified into critical and noncritical categories, and develop two novel critical shock models. Classical extreme shock models and run shock models are special cases of our developed models. The system fails when the total number of critical shocks reaches a predetermined threshold, or when the system stays in an environment that induces critical shocks for a preset threshold time, corresponding to failure mechanisms of the developed two critical shock models respectively. Markov renewal processes are employed to capture the magnitude and interarrival time dependency of environment-induced shocks. Explicit formulas for systems under the two critical shock models are derived, including the reliability function, the mean time to failure and so on. Furthermore, the two critical shock models are extended to the random threshold case and the integrated case where formulas of the reliability indexes of the systems are provided. Finally, a case study of a lithium-ion battery system is conducted to illustrate the proposed models and the obtained results. 相似文献
104.
柔性加工单元故障诊断的模糊Petri网模型 总被引:4,自引:0,他引:4
针对故障诊断专家系统中专家知识的模糊性和不确定性,给出用模糊Petri网(FPN)模型表示模糊产生式规则(FPR)知识的方法、知识的存储、模糊推理机制及算法的实现。同时,以JCS—020(FANUC)加工中心主轴伺服故障诊断为例,说明该方法在故障诊断专家系统(FDES)中应用的可行性与有效性。 相似文献
105.
八路军第115师作为八路军的3个主力师之一,第一个开赴华北抗日前线,"首战平型关,威名天下扬";除一部兵力先期留守陕甘宁边区,执行保卫中共中央和中央军委的任务外,主力相继移师晋西南、挺进齐鲁大地,同时另以一部兵力像种子一样,撒在晋察冀边区、晋冀鲁豫边区和苏北等地区,开花、结果.第115师在全国抗战中的伟大历史地位与作用,是有目共睹的. 相似文献
106.
饮酒对大学生注意网络功能的影响 总被引:1,自引:0,他引:1
[目的]探讨中等剂量的酒精摄入对大学生注意网络及各子系统的影响.[方法]研究对象为60名大学生,均为社会性饮酒者,采用抽签的方式随机分配到饮酒组(30人)和对照组(30人).运用注意网络测试分别从警觉、定向和执行控制三个维度对注意网络进行测量.[结果]与对照组相比,饮酒组注意网络中警觉效率、执行控制效率和反应时间均受到明显影响,差异有统计学意义(P<0.05或P<0.01);定向效率和正确率未受到明显的影响(P>0.05).[结论]大学生社会饮酒者摄入中等剂量的酒精后注意网络出现损伤,酒精对注意网络的各子系统影响有差异. 相似文献
107.
[目的]探讨关系和谐、自我建构与心理幸福感之间的关系.[方法]采用中学生自我建构量表、总体幸福感量表以及关系和谐量表对790名中学生进行了调查.[结果](1)中学生的心理幸福感普遍高于全国常模,且在家庭所在地(t=3.67,P<0.001)和年级上(t=15.63,p<0.001)存在显著性差异.(2)自我建构与心理幸福感、关系和谐两两之间呈显著正相关(r=0.35~ 0.44,p<0.01);(3)采用Amos17.0进行结构方程模型拟合,发现各项拟合指标良好:x 2/df=3.635,NFI=0.996,NNFI=0.982,CFI=0.997,RMSEA=0.061,关系和谐的中介效应显著(P<0.001),关系和谐在中学生自我建构与心理幸福感之间起部分中介作用,中介效应占总效应的24.9%.[结论]自我建构既可以直接影响中学生心理幸福感,也可以通过关系和谐间接影响心理幸福感. 相似文献
108.
109.
归因理论对英语教学的启示 总被引:1,自引:0,他引:1
林岚 《兵团教育学院学报》2004,14(3):65-68
本文通过对归因理论的阐述和对学生学业状况的归因倾向分析,提出了归因理论对英语教学的启示:一要关注学生的归因反应;二要研究学生的归因倾向,引导学生正确归因;三要重视培养学生的情感智力和认知技能;四要对教师自身的教学工作进行正确的归因。 相似文献
110.
保证人员疏散安全是建筑防火安全设计的重要目标之一,而疏散逃生设施是疏散设施不可或缺的组成部分。分别从理念、技术和应用层面介绍动态疏散逃生系统在机场环境中的应用,该系统实现了信息化控制管理,可根据火灾实时情况动态引导人员疏散,具有语音、调整疏散路径、光流等特点,实现"安全、准确、迅速"地引导人员避烟逃生,较以往应急疏散指示灯具具有更高的可靠性和安全性。 相似文献