数据库备份与恢复技术研究及应用

针对数据库备份、数据库恢复的概念、技术原理和方法等方面进行了分析和探讨。事实证明,通过借助于网络信息技术、数据库处理技术、网络存储等技术有助于实现企业信息系统的数据库备份与恢复。     

LPNet: A DNN based latency prediction technique for application mapping in Network-on-Chip design

Analytical models used for latency estimation of Network-on-Chip (NoC) are not producing reliable accuracy. This makes these analytical models difficult to use in optimization of design space exploration. In this paper, we propose a learning based model using deep neural network (DNN) for latency predictions. Input features for DNN model are collected from analytical model as well as from Booksim simulator. Then this DNN model has been adopted in mapping optimization loop for predicting the best mapping of given application and NoC parameters combination. Our simulations show that using the proposed DNN model, prediction error is less than 12% for both synthetic and application specific traffic. More than 108 times speedup could be achieved using DPSO with DNN model compared to DPSO using Booksim simulator.     

Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.     

A new time invariant fuzzy time series forecasting method based on particle swarm optimization

In the analysis of time invariant fuzzy time series, fuzzy logic group relationships tables have been generally preferred for determination of fuzzy logic relationships. The reason of this is that it is not need to perform complex matrix operations when these tables are used. On the other hand, when fuzzy logic group relationships tables are exploited, membership values of fuzzy sets are ignored. Thus, in defiance of fuzzy set theory, fuzzy sets’ elements with the highest membership value are only considered. This situation causes information loss and decrease in the explanation power of the model. To deal with these problems, a novel time invariant fuzzy time series forecasting approach is proposed in this study. In the proposed method, membership values in the fuzzy relationship matrix are computed by using particle swarm optimization technique. The method suggested in this study is the first method proposed in the literature in which particle swarm optimization algorithm is used to determine fuzzy relations. In addition, in order to increase forecasting accuracy and make the proposed approach more systematic, the fuzzy c-means clustering method is used for fuzzification of time series in the proposed method. The proposed method is applied to well-known time series to show the forecasting performance of the method. These time series are also analyzed by using some other forecasting methods available in the literature. Then, the results obtained from the proposed method are compared to those produced by the other methods. It is observed that the proposed method gives the most accurate forecasts.     

A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests

Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in progress. In this case, routes must be reconfigured dynamically while executing the current simulation. The DVRP is an extension of a conventional routing problem, its main interest being the connection to many real word applications (repair services, courier mail services, dial-a-ride services, etc.). In this article, a DVRP is examined, and solving methods based on particle swarm optimization and variable neighborhood search paradigms are proposed. The performance of both approaches is evaluated using a new set of benchmarks that we introduce here as well as existing benchmarks in the literature. Finally, we measure the behavior of both methods in terms of dynamic adaptation.     

A new hybrid approach for dynamic continuous optimization problems

A new hybrid approach for dynamic optimization problems with continuous search spaces is presented. The proposed approach hybridizes efficient features of the particle swarm optimization in tracking dynamic changes with a new evolutionary procedure. In the proposed dynamic hybrid PSO (DHPSO) algorithm, the swarm size is varied in a self-regulatory manner. Inspired from the microbial life, the particles can reproduce infants and the old ones die. The infants are especially reproduced by high potential particles and located near the local optimum points, using the quadratic interpolation method. The algorithm is adapted to perform in continuous search spaces, utilizing continuous movement of the particles and using Euclidian norm to define the neighborhood in the reproduction procedure. The performance of the new proposed approach is tested against various benchmark problems and compared with those of some other heuristic optimization algorithms. In this regard, different types of dynamic environments including periodic, linear and random changes are taken with different performance metrics such as real-time error, offline performance and offline error. The results indicate a desirable better efficiency of the new algorithm over the existing ones.     

Internal-oxide-band formation during oxidation of Ag-Mg alloys

Ag-3a/oMg was oxidized in air over the range of 400–900°C. Internal-oxide bands of MgO formed approximately parallel to the surface, the first band appearing at some finite, but irregular depth below the surface. The region between the surface and the first band appeared to be free of precipitates, but TEM showed that very small clusters, about 50 Å in diameter, formed in the PFZ, causing significant hardness (greater than 300 VHN). The clusters contain more oxygen than that corresponding to stoichiometric MgO. The hardness between oxide bands was also high, but not as high as in the PFZ. The kinetics of thickening of the internal-band region followed the parabolic rate law between 400 and 700° C, with departures from the parabolic law occurring at higher temperatures. The activation energy for the parabolic rate constants was 19.4 Kcal/mol, a value less than the total for oxygen diffusion and oxygen dissolution. The reaction front was planar and parallel to the surface prior to band formation at temperatures of 400–600° C. Nucleation of the first band resulted in nonplanar and nonparallel oxide. Little or no correlation existed between grain boundaries and oxide formation. Nodules of virtually pure silver formed on the surface initially at grain boundaries and subsequently within grains. Nodule formation is attributed to stress-enhanced (resulting from strains associated with precipitation) diffusion of silver to the surface via dislocation pipes. Internal-band formation is discussed in terms of prior data in the literature and various models. It is thought that stress effects (induced by precipitation), nucleation, and clustering of oxygen with Mg play significant roles in causing internal-band formation.     

无人机空中加油控制设计与仿真

无人机空中加油控制精度问题,无人受油机模型的各种不确定性与来自外部的各种干扰归结为扰动,造成控制精度差。为解决上述问题,提出一种免疫粒子群优化算法的自抗扰无人机自主空中加油飞行控制律设计方法。利用自抗扰控制能够自动检测并补偿内部与外部干扰影响的特点,并利用扩张状态观测器进行估计与补偿,从而增强了所设计飞行控制律的鲁棒性,用免疫粒子群优化算法对自抗扰控制器参数进行了优化研究,以提高设计效率。仿真结果表明,所设计的自抗扰自主空中加油控制系统具有优良的控制性能与较高的控制精度,能够满足无人机自主空中加油的要求。     

涡扇发动机最优加速控制规律

关于涡扇发动机最优加速控问题,由于状态系统存在较强的非线性,控制性能差,改善发动机加速性,传统非线性规划算法求解过程中因采用罚函数处理约束条件而无法充分搜索控制参数的可行域。为提高系统性能,并充分挖掘发动机的加速特性,采用Sigma方法的多目标粒子群算法求解。可以在带限制因子的粒子群算法的基础上,利用粒子群算法的快速寻优能力和Sigma方法沿约束边界的充分搜索方法,求解发动机加速过程中控制参数,并进行仿真。结果证明,采用多目标粒子群算法优化后,加速时间缩短了约2.01s,结果表明改进方法是可行的,能在确保发动机安全工作的前提下,进一步提升了发动机的加速性能。     

基于群智能混合算法的物流配送路径研究

针对物流车辆路径优化问题,考虑到基本蚁群算法有收敛速度慢、易陷入局部最优的缺点,采用了一种双种群蚁群算法,在蚁群的基础上引入差分进化(DE)和粒子群算法(PSO)。通过在PSOAS种群和DEAS种群之间建立一种信息交流机制,使信息能够在两个种群中传递,以免某一方因错误的信息判断而陷入局部最优点。通过matlab仿真实验测试,表明该群智能混合算法可以较好地解决TSP的问题。