Fast dynamic casting

We describe a scheme for implementing dynamic casts suitable for systems where the performance and predictability of performance is essential. A dynamic cast from a base class to a derived class in an object‐oriented language can be performed quickly by having the linker assign an integer type ID to each class. A simple integer arithmetic operation verifies whether the cast is legal at run time. The type ID scheme presented uses the modulo function to check that one class derives from another. A 64‐bit type ID is sufficient to handle class hierarchies of large size at least nine levels of derivation deep. We also discuss the pointer adjustments required for a C++ dynamic_cast. All examples will be drawn from the C++ language. Copyright © 2005 John Wiley & Sons, Ltd.     

一维弹道修正模块设计与仿真

简要介绍了一种用于维弹道修正引信的执行机构。通过数学模型，结合MDT三机械设计软件和Working Model动力学仿真软件，对机构的受力情况和工作过程进行了数字仿真和系统分析，并通过对飞行弹道的模拟，得出了一维时间控制射程修正规律。     

飞行时间二次离子质谱--强有力的表面、界面和薄膜分析手段

二次离子质谱（Secondary ion mass spectrometry，简称SIMS）是一种对表面灵敏的质谱技术，建立在表面各种类型带正、负电荷原子或分子发射的基础上。用飞行时间（Time of flight，简称TOF）仪器对这些二次离子进行质量分析，能确保并行质量登录、高质量范围、高流通率下的高分辨和精确质量测定这些优异性能。配合细聚焦扫描一次离子束，可在优于1nm的高深度分辨和优于50nm的横向分辨本领下，实现对表面优于单层ppm(百万分之一）量级的极高检测灵敏度。当今TOF－SIMS已发展为一种成熟且完善的表面分析技术。极高的灵敏度，再加上即使对大分子及不易挥发性分子都独具的敏感性，使它成为很多高技术领域不可缺少的分析手段，这些领域包括微电子学、化学和材料科学以至纳米技术和生命科学等。本文简述了TOF－SIMS的原理、仪器及其多方面的应用和展望。     

信号时域积分性质的一个推广应用

对信号进行运算（卷积运算，傅氏变换，拉纸变换）时，应用时域积分性质，得出由函数导数的运算式求取原函数的相应运算结果的一般性计算公式，使时域积分性质的应用得到推广。     

Optimal size,hydraulic retention time and volatile solids loading rate of biogas unit using water hyacinth

With a view to evaluate the effects of hydraulic retention time and volatile solids loading rate on methane production using water hyacinth, experiments were conducted in a 160 dm³ capacity, well-mixed continuous digestion unit at ambient temperature. The optimal design of biogas plant using water hyacinth was elucidated, to provide a unit giving a maximum methane yield of 0.16 nm³ kg^?1 volatile solids added, which was 60% greater than the conventional plant using cowdung. The calculations of optimal design factors were based on reactor size, hydraulic retention time and volatile solids loading rate; considerations were made of capital cost, running costs and operational revenue.     

Minimum variance control and performance assessment of time-variant processes

This paper is concerned with (1) an explicit solution of a minimum variance control law for linear time-variant (LTV) processes in the transfer function form, and (2) performance assessment of LTV processes using minimum variance control as the benchmark. It is shown that there exists a time-variant, absolute lower bound of process variance that is achievable under LTV minimum variance control and can be estimated from routine operating data. This lower bound can subsequently be used to assess the benefit of implementing LTV control such as adaptive control. The proposed methods are illustrated through simulated examples and an industrial case study.     

形式化语言在UMTS开发中的应用

由于3G协议规范的复杂性，3GPP方法论指导方针中鼓励使用标准的形式化语言来进行UMTS产品的设计、开发与测试。文中概要性地描述了UMTS的体系结构和在规范描述中用到的一些形式化语言的基本概念和特点，探讨了这些形式化语言在UMTS开发中的应用。使用形式化语言开发UMTS可以简化和改进测试程序，实现新产品与新标准的同步推出。     

Income, Time Effects and Direct Preferences in a Multimodal Choice Context: Application of Mixed RP/SP Models with Non-Linear Utilities

Transport problems typically involve at least two types of constraints, on income and on time. Therefore, the indirect utility function depends either on the income available after having subtracted the cost of the discrete alternative and on the free time left after having worked and travelled by each competing option. In the typical linear-in-the-attributes and in-the-parameters specification, that represents the first grade approximation of the indirect utility function, the effect of income and time constraints cancel out and only the cost and time of the alternatives matter in the comparison between them. From a microeconomic point of view this is equivalent to assume that income and time effects could be disregarded; which is not always the case. To account for these effects the utility function should include second order attributes; however, in non-linear utility functions it may not be easy to distinguish among several effects that could be relevant: direct preferences for good and leisure, and simple interactions between attributes other than income and time effects. This paper analyses these effects from a theoretical point of view focusing on the possible confounding problem in detecting income and time effects. We use a dataset collected for a modal choice context and containing both revealed and stated preference data, and estimate several NL models examining the effect of the different second-order terms on detecting income and time effects. We compared specifications including square cost and time attributes, interactions between time and cost, cost divided by the income available to be spent on free time, and time multiplied by free time. Our results confirm the strong effect of direct preferences for goods and leisure time on choice, and the potential confounding effect between quadratic attributes and other non-linear omitted terms. Finally, we also found that care should be taken in highlighting income and time effects using mixed data sources, since confounding effects can occur when non-linearities are accounted for in both data sets.     

Minimum spanning trees made easier via multi-objective optimization

Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate the Pareto front, multi-objective optimization problems are considered as more difficult than single-objective problems. One should not forget that the fitness vector with respect to more than one objective contains more information that in principle can direct the search of evolutionary algorithms. Therefore, it is possible that a single-objective problem can be solved more efficiently via a generalized multi-objective model of the problem. That this is indeed the case is proved by investigating the computation of minimum spanning trees.This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center Computational Intelligence (SFB 531) and by the German-Israeli Foundation (GIF) in the project Robustness Aspects of Algorithms.