浅析智能网联汽车感知系统电磁兼容性

本文将就智能网联汽车感知系统中的电子兼容技术进行深入的分析和探究。     

Evaluation of standard and real fire exposures on thermal response of rail car floor assembly

This work developed a computational methodology to evaluate and compare standard fire exposures such as those outlined in ASTM E119 with real fire exposures and determine the difference in the temperature rise of a rail car floor assembly. The real fire exposures simulated in this work were identified in a review of incidents and consisted of a constantly-fed diesel fuel spill, a localized trash fire, and a gasoline spill simulated from a collision of the railcar with an automobile. These realistic fire exposures were applied to a variety of exemplar rail cars representative of single-level and bi-level passenger cars. These floor assembly models exposed to realistic fires were simulated in Fire Dynamics Simulator (FDS). The thermal exposure at the underside of railcar provided by FDS was coupled with a thermal model in ABAQUS, which provided the evolution of temperature in different components of the floor assembly. The standard scenarios were simulated for 2 hours instead of the typical 30 minutes to identify the appropriate exposure duration in ASTM E119, which can better represent a real fire scenario. The average and maximum temperatures predicted at the unexposed surface for both scenarios were compared with the threshold values given in NFPA 130.     

A computer aided design method for car form and its application based on shape parameters

In the early design stage, automotive modeling should both meet the requirements of aesthetics and engineering. Therefore, a vehicle CAD (computer aided design) model that can be easily adjusted by feedbacks is necessary. Based on CE-Bézier surface, this paper presents a set of algorithms for parametric segmentation and fairing surface generation in a car model. This model is defined by a simplified automotive template and relevant control points, shape parameters and segmentation parameters, which can be modified to alter the car form efficiently. With this model and the corresponding adjustment method, more than fifty various vehicle models are established in this research according to different parameters. And two methods for calculating similarity index between car models are constructed, which are suitable for brand design trend analysis and modelling design decisionmaking.     

A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.     

欧洲轿车新战略决策——电压、阻燃材料与工作温度一并提高——兼论Synolite5001-T-1牌聚酯树脂的阻燃防火性能优于酚醛树脂

本文介绍了欧洲轿车新战略决策，也即：将要提高轿车的电池电压，，阻燃材料的比率和工作温度；Synolite5001-T-1牌聚酯树脂的阻燃防炎性能优于酚醛树脂。     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

无纸化建造

本文通过分析先锋建筑师借鉴汽车制造领域的无纸化技术进行的建造实践,揭示了无纸化建造的操作过程,并探讨了无纸化建造的意义,那就是无纸化不仅改变了传统的设计方法,而且改变了传统的建造方式,这将是人类的建造技术发展史上的一场伟大的变革.文章最后探讨了无纸化建造在中国的实践意义.     

虚拟专用网的体系结构及实现

提出VPN接入设备的体系结构 ,包括系统的应用模型、层次划分和内部详细结构 ,阐述实现VPN的关键技术。     

铁水鱼雷罐的检测方案研究

论文介绍了一种针对铁水鱼雷罐车铁水液位检测的较为可行的低成本方案。采用车上间接称重、远红外非接触传输信号方式，解决了对移动铁水罐车进行实时监测的难题。