双端制动器惯性试验台的设计

随着我国汽车工业的迅猛发展,汽车产量不断增多,车速越来越高,对汽车制动性能要求也越来越高。汽车制动器是汽车上的重要设备,其质量的好坏影响着行车的安全。电惯量模拟是近几年兴起的一种比较先进的负载模拟方法,文章就制动器惯性试验台系统结构以及电惯量模拟的方法进行了比较详细的说明。     

基于数值模拟的接水盘冲压成形工艺分析与设计

分析了冰箱接水盘的形状和结构特点 ,设计了零件的冲压成形工艺 ,运用板料成形有限元软件对其中的拉伸和翻边工艺进行数值模拟 ,得到成形过程中工件各部位的厚度分布和成形极限图 ,分析了在不同工艺条件下可能产生的缺陷及其原因 ,并确定其初始毛坯和中间毛坯的合理形状 ,有效地保证了成形工艺的可靠性     

ZTC4筒形件温成形扩口数值模拟

对铸造Ti-6Al-4V筒形件温成形扩口成形工艺进行了数值模拟分析,得出了优化的工艺参数,并对凸模锥角进行了优化模拟,得出了合适的锥角。     

板料弯曲回弹的有限元模拟影响因素研究

阐述了板料成形数值模拟中回弹问题的研究历史和发展现状,分析了塑性弯曲加工中工件发生弯曲回弹的原因、特点及有限元模拟过程的影响因素,总结了回弹模拟的算法,从成形过程模拟和回弹计算两方面系统分析了影响回弹模拟准确性和收敛性的主要因素及改进方向,讨论了模具设计中回弹的补偿算法 ,并提出了当前控制回弹的基本方法     

数据中心网络TCP Incast仿真分析

为分析云计算数据中心网络中的TCP Incast问题的产生原因并探讨缓解该问题的有效途径,采用基于NS2仿真实验的方法,通过改变TCP协议类型、交换机缓冲区大小、服务请求单元大小及重传超时RTO值等影响因素,分析传输吞吐率性能的变化。分析结果表明,通过改变这些影响因素有助于缓解TCP Incast问题,但同时也存在各种缺点和局限性。     

基于Packet Tracer的Multiuser扩展构建分布式网络模拟实验环境

Packet Tracer广泛应用于计算机网络课程的教学实践中.不同于传统的单机模拟,利用Packet Tracer的Multiuser扩展构建分布式的网络模拟实验环境,可解决单机模拟在规模、性能等方面的限制.该实验环境可用于加强教学互动,帮助学生掌握概念和操作方法,提高教学效果.     

Web proxy cache replacement scheme based on back-propagation neural network

Web proxy caches are used to reduce the strain of contemporary web traffic on web servers and network bandwidth providers. In this research, a novel approach to web proxy cache replacement which utilizes neural networks for replacement decisions is developed and analyzed. Neural networks are trained to classify cacheable objects from real world data sets using information known to be important in web proxy caching, such as frequency and recency. Correct classification ratios between 0.85 and 0.88 are obtained both for data used for training and data not used for training. Our approach is compared with Least Recently Used (LRU), Least Frequently Used (LFU) and the optimal case which always rates an object with the number of future requests. Performance is evaluated in simulation for various neural network structures and cache conditions. The final neural networks achieve hit rates that are 86.60% of the optimal in the worst case and 100% of the optimal in the best case. Byte-hit rates are 93.36% of the optimal in the worst case and 99.92% of the optimal in the best case. We examine the input-to-output mappings of individual neural networks and analyze the resulting caching strategy with respect to specific cache conditions.     

A general topology-based framework for adaptive insertion of cohesive elements in finite element meshes

Large-scale simulation of separation phenomena in solids such as fracture, branching, and fragmentation requires a scalable data structure representation of the evolving model. Modeling of such phenomena can be successfully accomplished by means of cohesive models of fracture, which are versatile and effective tools for computational analysis. A common approach to insert cohesive elements in finite element meshes consists of adding discrete special interfaces (cohesive elements) between bulk elements. The insertion of cohesive elements along bulk element interfaces for fragmentation simulation imposes changes in the topology of the mesh. This paper presents a unified topology-based framework for supporting adaptive fragmentation simulations, being able to handle two- and three-dimensional models, with finite elements of any order. We represent the finite element model using a compact and “complete” topological data structure, which is capable of retrieving all adjacency relationships needed for the simulation. Moreover, we introduce a new topology-based algorithm that systematically classifies fractured facets (i.e., facets along which fracture has occurred). The algorithm follows a set of procedures that consistently perform all the topological changes needed to update the model. The proposed topology-based framework is general and ensures that the model representation remains always valid during fragmentation, even when very complex crack patterns are involved. The framework correctness and efficiency are illustrated by arbitrary insertion of cohesive elements in various finite element meshes of self-similar geometries, including both two- and three-dimensional models. These computational tests clearly show linear scaling in time, which is a key feature of the present data-structure representation. The effectiveness of the proposed approach is also demonstrated by dynamic fracture analysis through finite element simulations of actual engineering problems.

Evolving BlenX programs to simulate the evolution of biological networks

We present a formal approach to study the evolution of biological networks. We use the Beta Workbench and its BlenX language to model and simulate networks in connection with evolutionary algorithms. Mutations are done on the structure of BlenX programs and networks are selected at any generation by using a fitness function. The feasibility of the approach is illustrated with a simple example.