综合传动装置起动扭矩测试试验研究

低温环境起动性能是表征车辆动力性能的一项重要指标。对液力机械传动车辆而言,由于综合传动装置自身技术特点,改善车辆起动性能除应当考虑发动机自身起动阻力外,还应当考虑综合传动装置的起动阻力。在系统分析综合传动装置技术特点和功率流向的基础上,总结了发动机起动过程的主要特征,提出采用稳态试验与动态试验相结合的台架试验方法进行综合传动装置起动扭矩测试。以某高速履带车辆为研究对象,进行了综合传动装置起动扭矩测试。试验结果表明,传动油温的变化和各类油泵的功率消耗是决定综合传动装置起动扭矩大小的关键因素,为改进车辆总体设计和提高车辆起动性能提供了依据。     

紧凑式低温换热器研究进展

介绍了紧凑式低温换热器的研究进展,对低温换热器传热机理研究中所存在的问题以及新型低温换热器的研制进行了详细分析,对现有换热器优化设计方法进行了比较,给出了作者的一些观点,为低温换热器的设计及以后的进一步研究提供参考。     

Holomorphic maps preserving parts of the local spectrum

Let x ₀ be a nonzero vector in \({\mathbb{C}^{n}}\) , and let \({U\subseteq \mathcal{M}_{n}}\) be a domain containing the zero matrix. We prove that if φ is a holomorphic map from U into \({\mathcal{M}_{n}}\) such that the local spectrum of T ∈ U at x ₀ and the local spectrum of φ(T) at x ₀ have always a common value, then T and φ(T) have always the same spectrum, and they have the same local spectrum at x ₀ a.e. with respect to the Lebesgue measure on U. If \({\varphi \colon U\rightarrow \mathcal{M}_{n}}\) is holomorphic with φ(0) = 0 such that the local spectral radius of T at x ₀ equals the local spectral radius of φ(T) at x ₀ for all T ∈ U, there exists \({\xi \in \mathbb{C}}\) of modulus one such that ξT and φ(T) have the same spectrum for all T in U. We also prove that if for all T ∈ U the local spectral radius of φ(T) coincides with the local spectral radius of T at each vector x, there exists \({\xi \in \mathbb{C}}\) of modulus one such that φ(T) = ξT on U.     

Exploring the performance of small- and medium-sized enterprises through the credit crunch

Small- and medium-sized enterprises (SMEs) are major contributors to most western economies. They are often supported by government policies, and in the UK the government encourages banks to lend to them. It is generally believed that the credit crunch has had an impact on the performance of SMEs. This study looks at the impact of the crunch using large samples from 2007 through to 2010. It looks at performance by region, age and industrial sector (SIC code). It then proceeds to explore the modelling of default over the years, with a focus on young businesses. It was found that there is a degree of stability within the models, though the level of default varies across years. Young businesses, as has been found before, are shown to be more vulnerable.     

Allocating operating funding in the public sector and the newsvendor problem

Public sector managers, particularly those at the highest level of government, tend to view lapsed (or unused) funds at the end of a fiscal year as a consequence of poor management and/or inadequate financial controls. The aim of this paper is to challenge this view. We show that the planning environment in the public sector is in essence the classical Newsvendor Problem. This simple model argues that lapsed funds are a direct consequence of a manager doing his job properly; that is, lapsed funds occur from time to time when a manager is maximizing value for the organization. An extension of the model shows that allowing low-value year-end spending has an undesirable effect on the value of spending during the year and this suggests a role for a strong audit function for year-end spending.     

A self-tuning heuristic for the design of communication networks

This paper addresses the design of communication networks that has a large application area. The problem is to design a minimum cost network subject to a given reliability level. Complexity of the problem is twofold: (1) finding a minimum-cost network topology that every pair of nodes can communicate with each other and (2) computing overall reliability to provide the reliability constraint. Over the last two decades, metaheuristic algorithms have been widely applied to solve this problem due to its NP-hardness. In this study, a self-tuning heuristic (STH), which is a new approach free from parameter tuning, is applied to the design of communication networks. Extensive computational results confirm that STH generates superior solutions to the problem in comparison to some well-known local search metaheuristics, and also more sophisticated metaheuristics proposed in the literature. The practical advantage of STH lies in both its effectiveness and simplicity in application to the design problem.     

An extended slacks-based measure model for data envelopment analysis with negative data

Data envelopment analysis (DEA) is a non-parametric approach based on linear programming that has been widely applied for evaluating the relative efficiency of a set of homogeneous decision-making units (DMUs) with multiple inputs and outputs. The original DEA models use positive input and output variables that are measured on a ratio scale, but these models do not apply to the variables in which negative data can appear. However, with the widespread use of interval scale data and undesirable data, the emphasis has been directed towards the simultaneous consideration of the positive and negative data in DEA models. In this paper, using the slacks-based measure, we propose an extended model to evaluate the efficiency of DMUs, even if some variables are measured on an interval scale and some on a ratio scale. Moreover, the extended model allows for the presence of all interval-scale variables, which are capable of taking both negative and positive values.     

An axiomatic characterization of the potential decisiveness index

Let us consider that somebody is extremely interested in increasing the probability of a proposal to be approved by a certain committee and that to achieve this goal he/she is prepared to pay off one member of the committee. In a situation like this one, and assuming that vote-buying is allowed and free of stigma, which voter should be offered a bribe? The potential decisiveness index for simple games, which measures the effect that ensuring one positive vote produces for the probability of passing the issue at hand, is a good tool with which to acquire the answer. An axiomatic characterization of this index is given in this paper, and its relation to other classical power indices is shown.     

No-wait scheduling of position dependent jobs and adjustable processing intervals

In this paper, we consider a single machine no-wait scheduling model whereby job processing times are general functions of their position in the job sequence. We assume that the single machine must operate at a certain cycle, which can be determined by the scheduler. Furthermore, exactly one job has to be completed by the end of each cycle. Using different variations of the Linear Assignment Problem formulation, we develop polynomial time algorithms for minimizing the following objectives: makespan, total completion time, maximum earliness and total earliness.     

Time-dependent discrete road network design with both tactical and strategic decisions

This paper aims to model and investigate the discrete urban road network design problem, using a multi-objective time-dependent decision-making approach. Given a base network made up with two-way links, candidate link expansion projects, and candidate link construction projects, the problem determines the optimal combination of one-way and two-way links, the optimal selection of capacity expansion projects, and the optimal lane allocations on two-way links over a dual time scale. The problem considers both the total travel time and the total CO emissions as the two objective function measures. The problem is modelled using a time-dependent approach that considers a planning horizon of multiple years and both morning and evening peaks. Under this approach, the model allows determining the sequence of link construction, the expansion projects over a predetermined planning horizon, the configuration of street orientations, and the lane allocations for morning and evening peaks in each year of the planning horizon. This model is formulated as a mixed-integer programming problem with mathematical equilibrium constraints. In this regard, two multi-objective metaheuristics, including a modified non-dominated sorting genetic algorithm (NSGA-II) and a multi-objective B-cell algorithm, are proposed to solve the above-mentioned problem. Computational results for various test networks are also presented in this paper.