汽车计算平台工程国外相关标准概述

结合我国汽车计算平台工程,分析了国外相关的标准现状和基本框架,并为今后工作的开展提出了建议.     

Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.     

没有SDC的(t，n)门限秘密共享方案

利用椭圆曲线离散问题对数问题的难解性,给出了基于椭圆曲线密码体制的(t,n)门限秘密共享方案。基于门限秘密共享方案一般分为需要SDC和不需要SDC两类,在分布式环境下,一个被所有成员信任的SDC并不存在,不需要SDC的门限秘密共享方案的安全性得到很大的提高,该方案中由组成员共同生成群公钥和私有密钥。并给出了当新成员加入时,无SDC下的周期密钥分片的更新方案。还给出了一个本方案数据实例,最后对本方案的安全性进行了分析。     

网格资源管理系统模型研究

网格资源管理系统是网格计算系统的重要组成部分。文章分析了网格资源管理系统的功能需求，具体论述了该模型的原型系统，最后介绍了相关研究工作。     

The 4D Klein-Gordon, Dirac and Quantization Equations from 5D Null Paths

Results from 5D induced-matter and membrane theory with null paths are extended to show that a particle obeys the 4D Klein-Gordon equation but with a variable mass. The Dirac equation also follows, but raises concerns about 4D quantization in the two natural 5D gauges, and reopens the question of a Regge-like trajectory for the spin angular momenta and squared masses of gravitationally-dominated systems.     

双贴合无光焦度校正板在主反射镜前的两镜系统的像差特性

在光学系统中特别是反射系统中经常通过加无光焦度校正板来减少或消除其他元件所产生的像差。讨论了双贴合无光焦度校正板放在主镜前的双反射球面系统，根据像差理论分析了消像差的条件，研究了系统中各种参数的变化对系统高级残余像差的影响。结果表明主镜的相对孔径越大，系统的残余像差增加；正透镜在前的校正板结构优于负透镜在前的结构；选择合适的校正板单透镜的光焦度，可使系统的高级残余像差最小。     

可信计算与可信网络

论文对主流的可信计算技术——TCPA和NGSCB进行了分析,并对可信计算平台(TCP)进行了研究,对基于可信计算的可信网络的三个基本属性进行了分析和研究,最后介绍了可信网络的发展现状。     

基于模式理论光栅椭偏参数反演的数值模拟

将一种广泛用于求解系统优化问题的方法——正单纯形法，求解光栅的椭偏方程。首先，利用求解光栅的傅立叶模式理论对TE和TM波的复反射系数进行求解。然后计算出其相应的椭偏参数(△，Ψ)，并在该值的基础上加入不同偏差的随机高斯噪声，将加入噪声后的值(△m，Ψm)作为模拟测量值。最后使用优化算法进行反演。通过对几种常用面形光栅椭偏参数的数值模拟，一方面表明傅立叶模式理论计算光栅的椭偏参数不仅精度高。而且速度快；另一方面表明利用正单纯形法得到的光栅参数值很接近于正演时假设的参数值，从而从理论上证明了利用椭偏法测量光栅各种光学参数的可行性。     

基于支持向量机的多类分类研究

现今流行的分类方法的重要基础是传统的统计学，前提是要有足够的样本，当样本数目有限时容易出现过学习的问题，导致分类效果不理想。引入支持向量机方法，它基于统计学习理论，采用了结构风险最小化原则代替经验风险最小化原则，较好的解决了小样本学习的问题；又由于采用了核函数思想，把非线性空间的问题转换到线性空间，降低了算法的复杂度。对其相关内容包括优化算法及多类分类问题的解决进行了研究，最后用一个实例说明了该方法的可行性和有效性。     

用Delphi实现快速删除TList的批连续结点算法的探讨

在编制遥测数据处理软件的过程中，面对大量的测试数据，经常需要编写高效率的数据过滤器。本文讨论了一种通过采用跨单元、跨类访问Delphi类的私有域的方法实现快速删除TList批连续结点的新算法，并通过测试结果得到验证。