期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
PARAMETER IDENTIFICATION OF LUGRE FRICTION MODEL FOR FLIGHT SIMULATION SERVO SYSTEM BASED ON ANT COLONY ALGORITHM 被引量:4
1
作者 段海滨 王道波 +1 位作者 朱家强 黄向华 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2004年第3期179-183,共5页
In light of the high nonlinearity of LuGre friction model, a novel method based on ant colony algorithm(ACA) for identifying the friction parameters of flight simulation servo system is proposed. ACA is a parallelized... In light of the high nonlinearity of LuGre friction model, a novel method based on ant colony algorithm(ACA) for identifying the friction parameters of flight simulation servo system is proposed. ACA is a parallelized bionic optimization algorithm inspired from the behavior of real ants, and a kind of positive feedback mechanism is adopted in ACA. On the basis of brief introduction of LuGre friction model, a method for identifying the static LuGre friction parameters and the dynamic LuGre friction parameters using ACA is derived. Finally, this new friction parameter identification scheme is applied to a electric-driven flight simulation servo system with high precision. Simulation and application results verify the feasibility and the effectiveness of the scheme. It provides a new way to identify the friction parameters of LuGre model. 展开更多
关键词 parameter identification LuGre friction mo-del flight simulation servo system
下载PDF
大型油藏数模软件网上共享管理系统设计与实现
2
作者 陈苏 《今日科苑》 2008年第13期119-119,共1页
本文结合油藏数值模拟软件和并行计算服务器资源的使用现状,探讨如何实现相应软硬件资源的共享应用。并针对用户管理、资源调度、作业发送、许可证管理等应用开发过程中遇到的网络通讯、数据库操作等技术问题开展了深入的探讨。
关键词 油藏数值模拟软件 并行计算服 务器 资源共享
下载PDF
Optimal online algorithms for scheduling on two identical machines under a grade of service 被引量:9
3
作者 蒋义伟 何勇 唐春梅 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2006年第3期309-314,共6页
This work is aimed at investigating the online scheduling problem on two parallel and identical machines with a new feature that service requests from various customers are entitled to many different grade of service ... This work is aimed at investigating the online scheduling problem on two parallel and identical machines with a new feature that service requests from various customers are entitled to many different grade of service (GoS) levels, so each job and machine are labelled with the GoS levels, and each job can be processed by a particular machine only when its GoS level is no less than that of the machine. The goal is to minimize the makespan. For non-preemptive version, we propose an optimal online al-gorithm with competitive ratio 5/3. For preemptive version, we propose an optimal online algorithm with competitive ratio 3/2. 展开更多
关键词 Online algorithm Competitive analysis Parallel machine scheduling Grade of service (GoS)
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部