Using mechatronics to teach mechanical design and technical communication

It is commonly accepted that hands-on experiences increase both learning and enjoyment during coursework. Mechatronics projects provide both interesting and relevant hands-on experiences for a wide range of topics including design processes, basic mechatronics concepts, technical communication, and working in a group environment. ME2110: Creative Decisions and Design at Georgia Tech integrates mechatronics and technical communication into a sophomore level mechanical design class. This paper describes the course in detail, highlighting the course goals and layout, tools provided to the students, industry involvement, and the main challenges of administering such a course.     

基于进化算法的多用户检测器

粒子群算法PSO遗传算法(Particle Swarm Optimization)是由Kennedy和Eberhart于1995年提出的一种新的进化算法,PSO能够以一种更简便、快速的方式来完成和遗传算法(GA)一样的功能。本文在PSO算法思想的基础上提出了两种新的多用户检测算法： BEP(Binary Evolution Programming)算法, BPSO(Binary PSO,BPSO)算法。分别基于这两种算法构造了新的多用户检测器。仿真结果表明,这两种新的多用户检测器的抗误码性能比传统多用户检测器和基于遗传算法的多用户检测器都好,并且新的检测器的收敛速度明显比遗传算法检测器快。     

自动化部署及流量调优的SDN网络演进研究

基于运营商数据网SDN演进的基本思路,聚焦业务自动化部署和流量调优两大应用场景,提出SDN实现框架、分析了相关SDN技术成熟度、对SDN方案演进和技术选择提出了构想。     

Review of high level fault modeling approaches for mixed-signal systems

In the modern analogue design, Transistor Level Fault Simulation (TLFS) plays the important part since every fault in the whole circuit has to be simulated at that level. Unfortunately, it is a very CPU intensive task even though it maintains the high accuracy. Therefore, High Level Fault Modeling (HLFM) and High Level Fault Simulation (HLFS) are required in order to alleviate the efforts of simulation. In this paper, different HLFM approaches are reviewed at the device level during last two decades. We clarify their domains of application and evaluate their strengths and current limitations. We also analyze causes of faults and introduce various test approaches.     

一种实用的电子线路参数优化算法

由于电子产品的设计周期越来越短，而对其降低成本和提高质量的要求却越来越高，电子线路的优化设计日益受到人们的关注。本文提出了一种实用的电子线路参数优化算法－均匀设计多项式拟合遗传优化算法。其主要思想是采用拟合的多元多项式代替电路仿真以指导遗传算法进行搜索，以便减少电路的仿真次数。并在数据采集过程中运用均匀设计方法，不仅能减少数据采样的数目，而且能使初始群体包含丰富的信息，更利于其收敛。电路优化实例表明，本算法对设计目标复杂以及参数较多电路的优化是有效的。     

Integrating viewpoints in the development of mechatronic products

The development of mechatronic products involves multiple stakeholders which have different viewpoints and therefore use different concepts, models and tools to deal with their concerns of interest. This paper argues that an increased emphasis needs to be placed on the relations between viewpoints to be able to deal with the evolving scope and requirements on mechatronic products. We study relations between viewpoints at the levels of people, models and tools, and present solutions that are used to formally and explicitly capture such relations. Viewpoint contracts are used to define the vocabulary, assumptions and constraints required for ensuring smooth communication between stakeholders (people level). Dependency models capture relations between product properties belonging to different viewpoints, and how such dependencies relate to predictions and decisions (model level). Tool integration models describe the relations between tools in terms of traceability, data exchange, invocation and notifications (tool level). A major contribution of this paper is a unification approach, elaborating how these solutions can be used synergetically to integrate viewpoints. An industrial robot case study is utilized to illustrate the challenges and solutions with respect to relations between viewpoints, including the unification approach.     

VLSI电源/地网设计方法

对芯片有效供电的电源/地网设计在VLSI设计中非常重要。电源/地网布线设计方法可分成建立电源/地网拓扑结构、在已有拓扑结构及约束条件的基础上进行线宽优化等两步。本文简要介绍了电源/地网拓扑生成、线宽优化算法的研究进展,并指出了这些算法存在的一些问题。     

用SQP时域优化高速互连线电路

提出了一个基于特征法传输线网络建模和灵敏度分析的非线性高速互连线电路的时域优化设计方法 .考虑到高速互连线电路设计的特性 ,一般其最优值只是在初值的较小邻域 ,提出用改进的序列二次规划法 SQP优化方法保证了算法的整体收敛性及局部超一次收敛性 .介绍了用于优化内循环的特征法传输线建模和灵敏度分析 .最后 ,用两个例子证明了方法的可行性 .     

电气和自动化设计在电气工程中的融合应用

本文首先对电气自动化设计进行了简要概述,并对电气和自动化设计在电气工程中的融合应用途径展开了分析,最后展望了融合应用发展的前景,以供参考.     

随机配送时间车辆路径问题的建模及算法

车辆路径问题是现代物流配送管理的一项重要内容,运输路径的合理选取,可以加快企业对客户需求的响应速度,提高服务质量,降低运营成本。本文在综合考虑企业运输成本最小化和客户满意度最大化的基础上,针对不确定配送时间的随机车辆路径问题,建立随机机会规划模型。最后通过实例对模型求解,结果表明该算法能取得更好的优化结果和更快的收敛速度。     

机电一体化技术和应用研究初探

讨论了机电一体化技术对于改变整个机械制造业面貌所起的重要作用,并说明其在钢铁工业中的应用以及发展趋势。     

面向对象C++程序设计教学改革

程序设计课程的教学目的是培养大学生的编程能力,授课的重点应该放在算法上而不是语法。C^ 语言不是纯面向对象的语言,在教学中尽早引入面向对象的思想是学生能否接受和掌握面向对象程序设计方法的关键。新的教学体系和教材反映了C^ 的新发展,突出了函数模板和类模板的应用。实验的安排也是围绕算法展开,首先采用控制台程序训练大学生的算法编程能力,稍后引入MFC编程来培养大学生Windows下可视化编程的能力。     

A Lagrangean relaxation approach for QoS networks CFA problems

This paper is about design methodologies for packet networks, under the constraints of end-to-end quality of service (QoS) metrics. The network modeling also considers the dynamics of today's packet networks. We are particularly considering the problem of capacity and flow assignment where the routing assignments and capacities are considered to be decision variables. An efficient Lagrangean relaxation-based heuristic procedure is developed to find bounds and solutions for a corporate virtual private network (VPN), where the traffic is mostly based on TCP connections. Numerical results for a variety of problem instances are reported.     

Piezo-actuators modeling for smart applications

This paper deals with piezoelectric actuators modeling. The objective is to contribute in piezo-models library construction. Compared to existing models in commercial packages, the proposal model integrate nonlinear effects, especially hysteresis, while not requiring high computing efforts. This will help in the generalization of piezo-actuator usage for smart applications. Our methodology and approaches are clearly justified in the paper.     

An Efficient Heuristic for Solving an Extended Capacitated Concentrator Location Problem

In this paper, a mathematical model and a solution algorithm are developed for solving an extended capacitated concentrator location problem. Our model extends the conventional formulation by simultaneously addressing the two capacity constraints, total connection ports and maximum data processing rate, on each concentrator to be selected for satisfying the communication demands of the given end-user nodes. Since the problem is NP-complete, an efficient and effective Lagrangian heuristic is developed and tested by solving 100 randomly generated test problems with sizes ranging from 30(nodes)×30(concentrators) to150×30. Altogether 58% of the tested problems are solved optimally with an average solution gap 0.36% from the optimality and average solution times are from a few seconds to one half of a minute.