Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.     

基于多尺度双线性卷积神经网络的多角度下车型精细识别

针对多角度下车辆出现一定的尺度变化和形变导致很难被准确识别的问题，提出基于多尺度双线性卷积神经网络（MS-B-CNN）的车型精细识别模型。首先，对双线性卷积神经网络（B-CNN）算法进行改进，提出MS-B-CNN算法对不同卷积层的特征进行了多尺度融合，以提高特征表达能力；此外，还采用基于中心损失函数与Softmax损失函数联合学习的策略，在Softmax损失函数基础上分别对训练集每个类别在特征空间维护一个类中心，在训练过程中新增加样本时，网络会约束样本的分类中心距离，以提高多角度情况下的车型识别的能力。实验结果显示，该车型识别模型在CompCars数据集上的正确率达到了93.63%，验证了模型在多角度情况下的准确性和鲁棒性。     

Ions motion algorithm for solving optimization problems

This paper proposes a novel optimization algorithm inspired by the ions motion in nature. In fact, the proposed algorithm mimics the attraction and repulsion of anions and cations to perform optimization. The proposed algorithm is designed in such a way to have the least tuning parameters, low computational complexity, fast convergence, and high local optima avoidance. The performance of this algorithm is benchmarked on 10 standard test functions and compared to four well-known algorithms in the literature. The results demonstrate that the proposed algorithm is able to show very competitive results and has merits in solving challenging optimization problems.     

A design of experiments investigation into dry separation using a Knelson Concentrator

Enhanced gravity, or centrifugal, separators have revolutionised gold processing over the past decades, significantly increasing the recovery of fine (−100 μm) free gold. One of the main drawbacks of centrifugal gravity concentrators is the large volume of water required (even if it is all recycled). With water becoming an ever increasingly important “commodity”, reducing this is of importance both from an environmental and a monetary point of view. This work investigated operating a laboratory scale Knelson Concentrator with a dry feed and using air as the fluidising medium. The feed used was a synthetic mixture of tungsten and quartz, used to mimic a gold ore. The response surface method and central composite design techniques were used to design the experiments and to model the results, with the experimental variables being the bowl speed (G-Level), air fluidising pressure and the feed rate. The models corresponded well to the experimental results, indicating that for this experimental setup, the optimal conditions were a bowl G-Level of 40 G, a feed rate of 220 g/min and an air fluidising pressure of 8 psi.     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

iM-SIMPLE: iMproved stable increased-throughput multi-hop link efficient routing protocol for Wireless Body Area Networks

Wireless Body Area Networks (WBANs) are envisaged to play crucial role in psychological, medical and non-medical applications. This paper presents iM-SIMPLE; a reliable, and power efficient routing protocol with high throughput for WBAN. We deploy sensor nodes on human body to measure the physiological parameters such as blood pressure, temperature, glucose, lactic acid, EMG, acceleration, pressure, and position. Data from sensors is forwarded to intermediate node, from where it is transmitted to sink. An end user can access the required information available at sink via internet. To minimize energy consumption of the network, we utilize multi-hop mode of communication. A cost function is introduced to select the forwarder; node with high residual energy and least distance to sink has minimum cost function value and is selected. Residual energy parameter balances the energy consumption among the sensor nodes, and least distance improves packet delivery to sink because of reduced less path loss. We formulate the minimum energy consumption and high throughput problems as an Integer Linear Program. In order to support mobility, we also consider two body postures. Simulation results confirm the performance advantage of iM-SIMPLE compared to contemporary schemes in terms of maximizing stability period and throughput of the network.     

Assessing the cost-effectiveness of electric vehicles in European countries using integrated modeling

Electric vehicles (EVs) are considered alternatives to internal combustion engines due to their energy efficiency and contribution to CO₂ mitigation. The adoption of EVs depends on consumer preferences, including cost, social status and driving habits, although it is agreed that current and expected costs play a major role. We use a partial equilibrium model that minimizes total energy system costs to assess whether EVs can be a cost-effective option for the consumers of each EU27 member state up to 2050, focusing on the impact of different vehicle investment costs and CO₂ mitigation targets. We found that for an EU-wide greenhouse gas emission reduction cap of 40% and 70% by 2050 vis-à-vis 1990 emissions, battery electric vehicles (BEVs) are cost-effective in the EU only by 2030 and only if their costs are 30% lower than currently expected. At the EU level, vehicle costs and the capability to deliver both short- and long-distance mobility are the main drivers of BEV deployment. Other drivers include each state’s national mobility patterns and the cost-effectiveness of alternative mitigation options, both in the transport sector, such as plug-in hybrid electric vehicles (PHEVs) or biofuels, and in other sectors, such as renewable electricity.     

无源光网络标准发展及关键技术研究

无源光网络(Passive Optical Network,PON)作为当今接入网的主要技术解决方案,具有带宽使用效率高、传输距离远、抗干扰能力强等特点.通过研究PON技术的发展动态,本文首先归纳了各种PON技术的产生背景和应用特点,整理出各技术间的连接关系及主要标准;其次介绍了PON技术的帧结构,并对带宽、波长、传输模式等PON技术的主要参数进行了汇总;然后将国内外研究热点进行划分,围绕媒体访问控制协议、帧结构、动态带宽分配算法、节能机制等关键技术,阐述了其研究现状及在PON中的重要作用;最后对PON技术的发展趋势进行了展望.     

On the origin of strain hardening in glassy polymers

The influence of network density on the strain hardening behaviour of amorphous polymers is studied. The network density of polystyrene is altered by blending with poly(2,6-dimethyl-1,4-phenylene-oxide) and by cross-linking during polymerisation. The network density is derived from the rubber-plateau modulus determined by dynamic mechanical thermal analysis. Subsequently uniaxial compression tests are performed to obtain the intrinsic deformation behaviour and, in particular, the strain hardening modulus. At room temperature, the strain hardening modulus proves to be proportional to the network density, irrespective of the nature of the network, i.e. physical entanglements or chemical cross-links. With increasing temperature, the strain hardening modulus is observed to decrease. This decrease appears to be related to the influence of thermal mobility of the chains, determined by the distance to the glass-transition temperature (T−T_g).