基于改进AGA算法求解含交易费用组合投资模型

根据国内证券交易市场的实际情况提出了含交易费用的投资组合优化模型,并利用改进自适应遗传算法(AGA)求解该模型,最后结合实际数据,利用Matlab语言编程仿真求解并取得了很好的效果。     

一种改进的各向异性全变差去噪模型

全变差（TV）正则化模型是最经典的去噪模型,利用分裂的Bregman迭代算法可以简单有效地求解该模型。结合TV-L1模型和OSV模型,提出了一种改进的各向异性全变差去噪模型,并且利用分裂的Bregman迭代算法进行求解。通过数值实验可以看出改进的模型保护了恢复图像的边缘,突出了几何特征和纹理,使其更加清晰,去噪效果比原模型有所提高。     

基于非线性Logistic模型的改进UDEED算法

针对UDEED算法中线性Logistic模型分类预测准确率较低的问题,基于泰勒展开式,提出一种多项式核的非线性Logistic模型改进算法。研究非线性Logistic模型的核函数参数估计方法,更新损失函数的计算规则,并利用梯度下降法求解改进UDEED模型,实现数据集的分类预测。实验结果表明,与UDEED算法相比,改进算法提高了分类预测的准确率。     

改进的差分进化算法在电力经济调度中的应用

以优化发电系统中的发电总费用为目标,结合实际运行中机组的约束条件和阀点效应,建立了电力经济调度(ED)模型,并提出了求解该模型的改进的差分进化算法(ADE)。针对标准差分进化算法存在的种群多样性和收敛性能之间的矛盾,在度量种群多样性的基础上,引入了基于排序的可行解选取递减策略改进变异策略current-to-best。此外,提出一种新颖的等式约束修复机制,确保求解的可行性。最后,利用13个机组的测试系统进行仿真试验,结果证明了ADE算法求解ED模型的有效性。     

一种改进的三边定位算法

针对基于加权最小二乘(WLS)的三边定位算法在线性化过程中损失定位信息的问题,提出了一种改进的三边定位算法。该算法利用WLS算法粗略估计未知节点的坐标,并利用损失的定位信息构建定位模型,通过求解该定位模型实现精确定位。仿真结果表明,与基于WLS的三边定位算法相比,该算法有效提高了定位精度,且巷道长宽比越大,定位性能越好。     

改进的多模态遗传算法及其在投资组合中的应用

提出用多模态遗传算法求解投资组合的新思路。首先,针对小生境遗传算法搜索结果不稳定的缺点,提出具有“迁徙操作”的新多模态遗传算法,不仅有效地找到了全部优质解,而且无需峰间距的信息。然后,针对传统的投资组合模型存在不能满足不同风险偏好投资者需要的缺点,提出符合中国国情的证券投资组合模型,并给出利用改进的多模态遗传算法求解的方法。最后进行了实证研究,得到了满意的结果。     

基于改进FA算法的河流突发水污染事件溯源

针对河流突发水污染事件的溯源问题,利用正向和逆向质量概率密度之间的耦合关系,实现污染源的位置、排放时间和污染源排放强度之间解耦,并结合一维水体扩散模型和美国特拉基河示踪剂实验监测数据,建立了基于改进萤火虫算法的河流突发水污染事件溯源求解方法.在求解过程中将监测数据划分为训练集和实验集,通过训练集数据利用改进的萤火虫算法对河流的水文参数进行调整,在实验集采用调整后的水文参数,并通过不同监测断面数据独立求解,通过方差分析结果,排除了溯源误差较大的监测断面数据.研究结果表明,溯源结果精度较高,并具有对监测数据的纠错能力,对实际河流突发水污染事件具有一定的指导意义.     

基于改进鱼群算法的几何约束求解

几何约束求解是CAD建模中的关键技术。针对求解质量不高和求解速度慢的问题,进行了研究。提出了一种鱼群算法和混沌算法相结合的几何约束求解方法。首先,将CAD模型中的几何约束关系表示为一组代数方程组;然后,利用代数方程组来构造目标函数。将几何约束求解问题转换为目标函数的优化问题。最后,使用混沌算法来改进鱼群算法以寻找目标函数的最优解。实验结果表明：该方法可以有效地解决几何约束问题。     

基于改进遗传算法的压力控制系统参数求解及仿真

本文针对遗传算法的特点,在隔代映射遗传算法基础上引入自适应策略,建立了自适应遗传算法数学模型,给出了具体算法流程。通过自适应策略,使IP_GA中的交叉、变异概率能够根据函数适应度大小自动调节,提高了收敛速度及解的质量。通过该算法对液压压力系统传递函数进行参数求解,建立了液压系统的开环模型。利用Matlab/Simulink工具对开环模型进行仿真并与实测输出曲线对比,验证了遗传算法求解液压伺服系统参数的可行性。同时,通过分析仿真结果,找出了材料试验机比例压力控制系统与伺服压力控制系统在辨识方法上的差别。     

基于GM(1,1)灰色预测模型的改进与应用

针对传统的GM(1,1)模型预测精度不高,并且其求解优化与多项式拟合各有片面性的缺点,给出了基于求解优化和多项式拟合优化相结合的改进灰色等维动态预测方法。结合美国近两百年人口的相关统计数据,利用传统的GM(1,1)模型及其优化后的模型进行误差比较。结果表明改进后的灰色模型预测精度更高,说明改进后的灰色预测模型的可行性与可靠性更好。     

ROD-based hybrid TH precoding and combining for mmWave large-scale MIMO systems

Hybrid precoding is one of key techniques for millimeter wave (mmWave) large-scale multiple-input multiple-output (MIMO) systems. This paper considers a nonlinear hybrid precoding architecture which consists of a nonlinear unit, a reductive digital precoder and a constant modulus radio frequency (RF) precoder, and presents a novel hybrid Tomlinson-Harashima (TH) precoding and combining algorithm. Firstly, due to the intractability of the sum rates maximization problem for such a nonlinear hybrid precoding architecture, a tractable three-stage optimization problem is constructed through the lower bound of the sum rates, which allows the digital precoding matrix, the RF precoding matrix and the RF combining matrix to be optimized sequentially and independently. Then, in order to solve the three-stage optimization problem effectively, a novel row orthogonal decomposition (ROD) is defined. Based on the ROD, it is interesting that the necessary and sufficient condition of the optimal digital precoding matrix can be obtained, and a near-optimal RF precoding matrix can be derived. Finally, the optimization of the RF combining matrix is reformulated as a unimodular quadratic programming and solved by a generalized power method. Theoretical analyses and simulations indicate that the proposed ROD-based hybrid TH precoding and combining algorithm can offer a higher sum rates and a lower bit error rate with a comparable complexity in comparison to the previous works.     

关于一种网格运行时结构的若干注记

进程是传统计算机系统的一个核心概念，自1960年出现以来一直沿用至今，进程的一个主要目的是为主体提供一种运行时结构，在操作系统和处理器硬件支持下，代表主体访问和使用各种资源，与传统的单机和并行机计算平台相比，网格计算机中进程所对应的概念面临新的挑战，包括网格资源繁杂、自主控制的条件下的单一系统映像和资源的共享与协同、与特定操作系统的松耦合、时间和空间的流动性、更高级的交互性，提出一种称为网程(grip)的运行时结构，试图解决上述问题，网程运行在网格操作系统之上，代表网格主体，访问和使用网格资源。     

Genetic algorithm-based optimisation of load-balanced routing for AMI with wireless mesh networks

The advanced metering infrastructure (AMI) in a smart grid contains hardware, software, and other electronic components connected through a communication infrastructure. AMI transfers meter-reading data between a group of smart meters and a utility centre. Herein, a wireless mesh network (WMN) with a random mesh topology is used to deploy the AMI communication network. In a WMN, paths are identified using a hybrid wireless mesh routing protocol (HWMP) with a load balancing feature called load aware-HWMP (LA-HWMP). These paths reduce the demand on links with a minimal air time metric; however, the delay in the data transmission of certain smart meters is high, given the large number of retransmissions caused by packet drop. To avert this problem and enhance the end-to-end delay, a genetic algorithm is applied on the LA-HWMP to obtain the optimal path. The optimisation process will result in the selection of paths with minimal delay. The genetic algorithm is developed with a rank-based selection, a two-point crossover, and a random reset mutation with a repair function to eliminate duplicate entries. The proposed method is compared with the HWMP, the LA-HWMP, and a state-of-the-art method that uses a combination of the ant colony algorithm and simulated annealing (ACA-SA) for AMI networks of different sizes. The obtained results show that the path identified by the proposed method yields a shorter delay and higher throughput than paths identified using the other methods.     

Near-future perception system: Previewed Reality

ABSTRACT

The present paper introduces a near-future perception system called Previewed Reality. In a co-existence environment of a human and a robot, unexpected collisions between the human and the robot must be avoided to the extent possible. In many cases, the robot is controlled carefully so as not to collide with a human. However, it is almost impossible to perfectly predict human behavior in advance. On the other hand, if a user can determine the motion of a robot in advance, he/she can avoid a hazardous situation and exist safely with the robot. In order to ensure that a user perceives future events naturally, we developed a near-future perception system named Previewed Reality. Previewed Reality consists of an informationally structured environment, a VR display or an AR display, and a dynamics simulator. A number of sensors are embedded in an informationally structured environment, and information such as the position of furniture, objects, humans, and robots, is sensed and stored structurally in a database. Therefore, we can forecast possible subsequent events using a robot motion planner and a dynamics simulator and can synthesize virtual images from the viewpoint of the user, which will actually occur in the near future. The viewpoint of the user, which is the position and orientation of a VR display or an AR display, is also tracked by an optical tracking system in the informationally structured environment, or the SLAM technique on an AR display. The synthesized images are presented to the user by overlaying these images on a real scene using the VR display or the AR display. This system provides human-friendly communication between a human and a robotic system, and a human and a robot can coexist safely by intuitively showing the human possible hazardous situations in advance.     

COS:度量分布式大数据处理系统的效率

【目的】在大数据处理领域,分布式计算系统得到广泛应用,它们的可扩展性得到重点关注,但其绝对性能往往没有得到重视。我们希望提出科学合理、与时俱进的度量标准,对分布式系统的性能进行评估。【方法】本文通过对比特定任务的单机实现和分布式实现来讨论分布式系统的性能,提出COS(Configuration that Outperforms a Single machine)这一指标,来衡量分布式系统在达到单台机器的性能时,需要的硬件资源数量。我们选取k-means聚类和逻辑回归两个经典机器学习算法,对其进行单机多线程实现,并通过向量化计算、优化内存分配与访问等方式对性能进行了优化,为分布式多机系统的性能提供参考。【结果】以Apache Spark作为对标系统,实验发现无论是使用其原生编程接口,还是经过悉心优化的机器学习库,都要使用数倍甚至数百倍的机器,才能达到单机多线程实现的性能。【局限】分布式系统与单机实现进行性能对比并不是完全公平的,分布式系统的额外开销客观存在。【结论】但COS指标仍能反映分布式系统存在的绝对性能较差、没有充分利用硬件优势等问题。     

Better combination of thickness and hardness of mattress topper for supine sleeping posture: A physiological measurements evaluation

Placing a topper on a sleeping system is common practice to enhance sleeping comfort. The aim of this study was to determine the thickness and hardness effect of a mattress topper by measuring the four physiological measurements from 40 healthy males. The results showed that the use of a thin mattress topper (30 mm) significantly induced lower body pressure and temperature, higher muscle activities in the biceps femoris, and a straighter spinal alignment in the T12–L4 vertebrae. The use of a hard mattress topper significantly induced a higher body pressure, a lower body temperature in the lower extremities, a higher EMG (%MVC) in the trapezius, but a lower EMG (%MVC) in the biceps femoris, and a straighter spinal alignment at T1–T4, T4–T6, and T6–T8. Overall, a soft topper of 30-mm thickness was suggested as the best combination. The findings can provide very useful information for topper design and selection.     

Design of phononic materials/structures for surface wave devices using topology optimization

We develop a topology optimization approach to design two- and three-dimensional phononic (elastic) materials, focusing primarily on surface wave filters and waveguides. These utilize propagation modes that transmit elastic waves where the energy is contained near a free surface of a material. The design of surface wave devices is particularly attractive given recent advances in nano- and micromanufacturing processes, such as thin-film deposition, etching, and lithography, which make it possible to precisely place thin film materials on a substrate with submicron feature resolution. We apply our topology optimization approach to a series of three problems where the layout of two materials (silicon and aluminum) is sought to achieve a prescribed objective: (1) a grating to filter bulk waves of a prescribed frequency in two and three dimensions, (2) a surface wave device that uses a patterned thin film to filter waves of a single or range of frequencies, and (3) a fully three-dimensional structure to guide a wave generated by a harmonic input on a free surface to a specified output port on the surface. From the first to the third example, the resulting topologies increase in sophistication. The results demonstrate the power and promise of our computational framework to design sophisticated surface wave devices.     

New instant confirmation mechanism based on interactive incontestable signature in consortium blockchain

The blockchain is a radical innovation that has a considerable effect on payments, stock exchanges, cybersecurity, and computational law. However, its limitations in terms of the uncertainty involved in transaction confirmation are significant. In this paper, we describe the design of a decentralized voting protocol for the election of a block generator in a consortium blockchain and propose a new system framework that allows fast and exact confirmation of all transactions. In addition, to replace a transaction’s owner signature, a new interactive incontestable signature between the dealer and owner is used to confirm a transaction. By means of this signature, the dealer can assure the owner that a transaction will be permanently included in the blockchain in a non-repudiation manner. Moreover, the signatures of all transactions in a block share only one witness that provides membership proof between the block and these transactions. Finally, a security and performance analysis shows that the proposed schemes are provably secure and highly efficient.     

A disruption recovery plan in a three-stage production-inventory system

This paper proposes a recovery plan for managing disruptions in a three-stage production-inventory system under a mixed production environment. First, a mathematical model is developed to deal with a disruption at any stage while maximizing total profit during the recovery-time window. The model is solved after the occurrence of a disruption event, with changed data used to generate a revised plan. We also propose a new and efficient heuristic for solving the developed mathematical model. Second, multiple disruptions are considered, where a new disruption may or may not affect the recovery plans of earlier disruptions. The heuristic, developed for a single disruption, is extended to deal with a series of disruptions so that it can be implemented for disruption recovery on a real-time basis. We compare the heuristic solutions with those obtained by a standard search algorithm for a set of randomly generated disruption test problems, and that show the consistent performance of our developed heuristic with lower computational times. Finally, some numerical examples and a real-world case study are presented to demonstrate the benefits and usefulness of our proposed approach.