Stochastic User Equilibrium Traffic Assignment with Turn-delays in Intersections

Turn-delays in intersections contribute significantly to travel times and thus route choices in urban networks. However, turns are difficult to handle in traffic assignment models due to the asymmetric Jacobian in the cost functions. The paper describes a model where turn delays have been included in the solution algorithm of Stochastic User Equilibrium (SUE) traffic assignment. When the Jacobian is symmetric, SUE minimises the road users' 'perceived travel resistances'. This is a probit-model where the links cost-functions of the links are traffic dependent. Hereby, overlapping routes are handled in a consistent way. However, no theoretical proof of convergence has been given if the Jacobian is asymmetric, although convergence can be shown probable for model data representing realistic road-networks. However, according to the authors knowledge SUE with intersection delays have not been tested earlier on a full-scale network. Therefore, an essential part of the paper presents practical tests of convergence. Both geometric delays and delays caused by other turns are considered for each turn. Signalised and non-signalised intersections are handled in different ways, as are roundabouts. In signalised intersections a separate model handles queues longer than one green-period. Green-waves can also be taken into consideration. The model has been tested on a large-scale network for Copenhagen with good results. To make it possible to establish the comprehensive data, a GIS-based 'expert system' was implemented (see Nielsen, O.A., Frederiksen, R. D. and Simonsen, N. (1997). Using expert system rules to establish data on intersections and turns in road networks. International Transactions in Operational Research , 5 , 513–529.     

Delay-dependent observer-based stabilizing controller design for linear multiple state-delayed systems

This article concerns a coupled LMIs approach to delay-dependent observer-based output feedback stabilizing controller design for linear continuous-time systems with multiple state delays. The advantage of our proposed delay-dependent coupled LMIs criterion lies in that: (1) it can optimize one of multiple time delays with others selected properly, and at the same time, the feedback-gain and observer-gain can be obtained, respectively. (2) it is less conservative than the existing delay-independent ones in the literature. Algorithm to solve the coupled LMIs is also given. Numerical examples illustrate the effectiveness of our method.     

Oscillation theorems for second-order half-linear delay dynamic equations with damping on time scales

By using the generalized Riccati transformation and the inequality technique, we establish a few new oscillation criteria for certain second-order half-linear delay dynamic equations with damping on a time scale. Our results extend and improve some known results, but also unify the oscillation of the second-order half-linear delay differential equation with damping and the second-order half-linear delay difference equation with damping.     

Adaptive channel assignment scheme for wireless networks

In this paper, an adaptive channel assignment scheme is proposed to ensure the quality of services for the wireless networks. The proposed scheme divides the channels into two categories, the guard channels and the shared channels. The number of guard channels is estimated by the Markovian model in order to keep the handoff calls higher priority. The remaining channels, called shared channels, can be used by both new calls and handoff calls. The proposed scheme based on incoming rates of handoff and new calls allocates channels for guard and shared channels. In addition, this approach is able to provide quality of service guarantee in terms of handoff dropping rate. From the simulation, the proposed scheme significantly improves the dropping rate and the blocking rate in comparison with the existing methods.     

机器人群体合作的信念分析

从群体合作的角度分析了多机器人系统的特殊性,提出信念的多元表示方法和基于 信息熵的信念修改规则．通过运行试验,证明了所提出的方法和规则的可行性．     

Connectivity-based multiple-circle fitting

This paper proposes a connectivity-based method for circle fitting. The use of pixel connectivity effectively avoids false circle detection, improves the robustness against noise and significantly reduces the computational load. The desired circular models are extracted by searching for meaningful circular arcs. The algorithm does not require a good initial guess, and is effective for extracting an a priori unknown number of circles even when the number of outliers exceeds 50%. The experimental results demonstrate that the proposed method performs well in detecting multiple intersecting or occluded circles.     

Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems

Evolutionary algorithms (EAs) are often employed to multiobjective optimization, because they process an entire population of solutions which can be used as an approximation of the Pareto front of the tackled problem. It is a common practice to couple local search with evolutionary algorithms, especially in the context of combinatorial optimization. In this paper a new local search method is proposed that utilizes the knowledge concerning promising search directions. The proposed method can be used as a general framework and combined with many methods of iterating over a neighbourhood of an initial solution as well as various decomposition approaches. In the experiments the proposed local search method was used with an EA and tested on 2-, 3- and 4-objective versions of two well-known combinatorial optimization problems: the travelling salesman problem (TSP) and the quadratic assignment problem (QAP). For comparison two well-known local search methods, one based on Pareto dominance and the other based on decomposition, were used with the same EA. The results show that the EA coupled with the directional local search yields better results than the same EA coupled with any of the two reference methods on both the TSP and QAP problems.     

采用STRAIGHT模型和深度信念网络的语音转换方法

提出一种将STRAIGHT模型和深度信念网络DBN相结合实现语音转换的方式。首先,通过STRAIGHT模型提取出源说话人和目标说话人的语音频谱参数,用提取的频谱参数分别训练两个DBN得到语音高阶空间的个性特征信息;然后,用人工神经网络ANN将两个具有高阶特征的空间连接并进行特征转换;最后,用基于目标说话人数据训练出的DBN来对转换后的特征信息进行逆处理得到语音频谱参数,并用STRAIGHT模型合成具有目标说话人个性化特征的语音。实验结果表明,采用此种方式获得的语音转换效果要比传统的采用GMM实现语音转换更好,转换后的语音音质和相似度与目标语音更接近。     

Two fault‐tolerant control problems for multiple‐integrator networks

The paper considers a network of agents with multiple‐integrator internal dynamics, which share partial information on their states according to an arbitrary topology. For this system, two control problems are addressed and solved. The first consists in assigning the dominant closed‐loop poles. The second consists in achieving a specified consensus with arbitrary dominant dynamics. In both cases, the regulator is required to be decentralized, and the controlled network has to result tolerant with respect to faults in the communication apparatuses of the agents. Copyright © 2015 John Wiley & Sons, Ltd.     

两个新的数字图像加密效果评价准则

图像信息熵和灰度变化平均值是两个常用的图像加密效果评价准则。分析指出,图像信息熵和灰度变化平均值受图像尺寸大小的影响较大,为此提出了两个新的图像加密效果评价准则:直方图均衡度和游程统计量。直方图均衡度可用于基于像素灰度值变换的加密过程的评价,游程统计量可用于图像坐标置换的加密过程的评价。新方法表达简单,计算便捷,其显著优点是与图像大小无关,不需要借助原图像。