Performance Comparison of Hyper-V and KVM for Cryptographic Tasks in Cloud Computing

As the extensive use of cloud computing raises questions about the security of any personal data stored there,cryptography is being used more frequently as a security tool to protect data confidentiality and privacy in the cloud environment.A hypervisor is a virtualization software used in cloud hosting to divide and allocate resources on various pieces of hardware.The choice of hypervisor can significantly impact the performance of cryptographic operations in the cloud environment.An important issue that must be carefully examined is that no hypervisor is completely superior in terms of performance;Each hypervisor should be examined to meet specific needs.The main objective of this study is to provide accurate results to compare the performance of Hyper-V and Kernel-based Virtual Machine(KVM)while implementing different cryptographic algorithms to guide cloud service providers and end users in choosing the most suitable hypervisor for their cryptographic needs.This study evaluated the efficiency of two hypervisors,Hyper-V and KVM,in implementing six cryptographic algorithms:Rivest,Shamir,Adleman(RSA),Advanced Encryption Standard(AES),Triple Data Encryption Standard(TripleDES),Carlisle Adams and Stafford Tavares(CAST-128),BLOWFISH,and TwoFish.The study’s findings show that KVM outperforms Hyper-V,with 12.2%less Central Processing Unit(CPU)use and 12.95%less time overall for encryption and decryption operations with various file sizes.The study’s findings emphasize how crucial it is to pick a hypervisor that is appropriate for cryptographic needs in a cloud environment,which could assist both cloud service providers and end users.Future research may focus more on how various hypervisors perform while handling cryptographic workloads.

A PID Tuning Approach for Inertial Systems Performance Optimization

In the practice of control the industrial processes, proportional-integral-derivative controller remains pivotal due to its simple structure and system performance-oriented tuning process. In this paper are presented two approaches for synthesis the proportional-integral-derivative controller to the models of objects with inertia, that offer the procedure of system performance optimization based on maximum stability degree criterion. The proposed algorithms of system performance optimization were elaborated for model of objects with inertia second and third order and offer simple analytical expressions for tuning the PID controller. Validation and verification are conducted through computer simulations using MATLAB, demonstrating successful performance optimization and showcasing the effectiveness PID controllers’ tuning. The proposed approaches contribute insights to the field of control, offering a pathway for optimizing the performance of second and third-order inertial systems through robust controller synthesis.

An approach to improving maneuver performance of coning algorithm

Aiming to improve the maneuver performance of the strapdown inertial navigation attitude coning algorithm a new coning correction structure is constructed by adding a sample to the traditional compressed coning correction structure. According to the given definition of classical coning motion the residual coning correction error based on the new coning correction structure is derived. On the basis of the new structure the frequency Taylor series method is used for designing a coning correction structure coefficient and then a new coning algorithm is obtained.Two types of error models are defined for the coning algorithm performance evaluation under coning environments and maneuver environments respectively.Simulation results indicate that the maneuver accuracy of the new 4-sample coning algorithm is almost double that of the traditional compressed 4-sample coning algorithm. The new coning algorithm has an improved maneuver performance while maintaining coning performance compared to the traditional compressed coning algorithm.

A Performance Fault Diagnosis Method for SaaS Software Based on GBDT Algorithm

SaaS software that provides services through cloud platform has been more widely used nowadays.However,when SaaS software is running,it will suffer from performance fault due to factors such as the software structural design or complex environments.It is a major challenge that how to diagnose software quickly and accurately when the performance fault occurs.For this challenge,we propose a novel performance fault diagnosis method for SaaS software based on GBDT(Gradient Boosting Decision Tree)algorithm.In particular,we leverage the monitoring mean to obtain the performance log and warning log when the SaaS software system runs,and establish the performance fault type set and determine performance log feature.We also perform performance fault type annotation for the performance log combined with the analysis result of the warning log.Moreover,we deal with the incomplete performance log and the type non-equalization problem by using the mean filling for the same type and combination of SMOTE(Synthetic Minority Oversampling Technique)and undersampling methods.Finally,we conduct an empirical study combined with the disaster reduction system deployed on the cloud platform,and it demonstrates that the proposed method has high efficiency and accuracy for the performance diagnosis when SaaS software system runs.

Randomized Algorithms for Probabilistic Optimal Robust Performance Controller Design

Polynomial-time randomized algorithms were constructed to approximately solve optimal robust performance controller design problems in probabilistic sense and the rigorous mathematical justification of the approach was given. The randomized algorithms here were based on a property from statistical learning theory known as (uniform) convergence of empirical means (UCEM). It is argued that in order to assess the performance of a controller as the plant varies over a pre-specified family, it is better to use the average performance of the controller as the objective function to be optimized, rather than its worst-case performance. The approach is illustrated to be efficient through an example.

Hardware Performance Evaluation of SHA-3 Candidate Algorithms

Secure Hashing Algorithms (SHA) showed a significant importance in today’s information security applications. The National Institute of Standards and Technology (NIST), held a competition of three rounds to replace SHA1 and SHA2 with the new SHA-3, to ensure long term robustness of hash functions. In this paper, we present a comprehensive hardware evaluation for the final round SHA-3 candidates. The main goal of providing the hardware evaluation is to: find the best algorithm among them that will satisfy the new hashing algorithm standards defined by the NIST. This is based on a comparison made between each of the finalists in terms of security level, throughput, clock frequancey, area, power consumption, and the cost. We expect that the achived results of the comparisons will contribute in choosing the next hashing algorithm (SHA-3) that will support the security requirements of applications in todays ubiquitous and pervasive information infrastructure.

PERFORMANCE COMPARISON OF ECG COMPRESSION ALGORITHMS BASED ON CLINICAL DIAGNOSIS

This paper reviewed the recent progress in the field of electrocardiogram (ECG) compression and compared the efficiency of some compression algorithms. By experimenting on the 500 cases of ECG signals from the ECG database of China, it obtained the numeral indexes for each algorithm. Then by using the automatic diagnostic program developed by Shanghai Zhongshan Hospital, it also got the parameters of the reconstructed signals from linear approximation distance threshold (LADT), wavelet transform (WT), differential pulse code modulation (DPCM) and discrete cosine transform (DCT) algorithm. The results show that when the index of percent of root mean square difference(PRD) is less than 2.5%, the diagnostic agreement ratio is more than 90%; the index of PRD cannot completely show the damage of significant clinical information; the performance of wavelet algorithm exceeds other methods in the same compression ratio (CR). For the statistical result of the parameters of various methods and the clinical diagnostic results, it is of certain value and originality in the field of ECG compression research.

Robust Performance of Scene Matching Algorithm

Performance analysis is very important in the study and design of scene matching algorithm. Based on the analysis of the common performance parameters, robustness of scene matching algorithm is defined, including the definitions of robust stability and robust performance, and the corresponding evaluation parameters matching margin and matching adaptability are given. With application of these robustness parameters on 8 scene matching algorithms, quantitative analysis results of algorithm robustness are obtained. The paper provides an important theoretical reference to the performance evaluation of scene matching algorithm.

Improved Genetic Algorithm and Its Performance Analysis

Although ge ne tic algorithm has become very famous with its global searching, parallel computi ng, better robustness, and not needing differential information during evolution .However, it also has some demerits, such as slow convergence speed. In this pap er, based on several general theorems, an improved genetic algorithm using varia nt chromosome length and probability of crossover and mutation is proposed, and its main idea is as follows:at the beginning of evolution, our solution with sho rter length chromosome and higher probability of crossover and mutation; and at the vicinity of global optimum, with longer length chromosome and lower probabil ity of crossover and mutation. Finally, testing with some critical functions sho ws that our solution can improve the convergence speed of genetic algorithm sign ificantly, its comprehensive performance is better than that of the genetic algo rithm which only reserves the best individual.

Assessing supply chain performance using genetic algorithm and support vector machine

The rough set-genetic support vector machine(SVM) model is applied to supply chain performance evaluation. First, the rough set theory is used to remove the redundant factors that affect the performance evaluation of supply chain to obtain the core influencing factors. Then the support vector machine is used to extract the core influencing factors to predict the level of supply chain performance. In the process of SVM classification, the genetic algorithm is used to optimize the parameters of the SVM algorithm to obtain the best parameter model, and then the supply chain performance evaluation level is predicted. Finally, an example is used to predict this model, and compared with the result of using only rough set-support vector machine to predict. The results show that the method of rough set-genetic support vector machine can predict the level of supply chain performance more accurately and the prediction result is more realistic, which is a scientific and feasible method.

BER Performance of Finite in Time Optimal FTN Signals for the Viterbi Algorithm

In this article, we consider the faster than Nyquist(FTN) technology in aspects of the application of the Viterbi algorithm(VA). Finite in time optimal FTN signals are used to provide a symbol rate higher than the "Nyquist barrier" without any encoding. These signals are obtained as the solutions of the corresponding optimization problem. Optimal signals are characterized by intersymbol interference(ISI). This fact leads to significant bit error rate(BER) performance degradation for "classical" forms of signals. However, ISI can be controlled by the restriction of the optimization problem. So we can use optimal signals in conditions of increased duration and an increased symbol rate without significant energy losses. The additional symbol rate increase leads to the increase of the reception algorithm complexity. We consider the application of VA for optimal FTN signals reception. The application of VA for receiving optimal FTN signals with increased duration provides close to the potential performance of BER,while the symbol rate is twice above the Nyquist limit.

Distributed multicast routing algorithm with dynamic performance in multimedia networks

The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.

On the E-Valuation of Certain E-Business Strategies on Firm Performance by Adaptive Algorithmic Modeling： An Alternative Strategic Managerial Approach

This paper describes an innovative adaptive algorithmic modeling approach, for solving a wide class of e-business and strategic management problems under uncertainty conditions. The proposed methodology is based on basic ideas and concepts of four key-field interrelated sciences, i.e., computing science, applied mathematics, management sciences and economic sciences. Furthermore, the fundamental scientific concepts of adaptability and uncertainty are shown to play a critical role of major importance for a （near） optimum solution of a class of complex e-business/services and strategic management problems. Two characteristic case studies, namely measuring e-business performance under certain environmental pressures and organizational constraints and describing the relationships between technology, innovation and firm performance, are considered as effective applications of the proposed adaptive algorithmic modeling approach. A theoretical time-dependent model for the evaluation of firm e-business performances is also proposed.

Satellite constellation design with genetic algorithms based on system performance

Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optical system by taking into account the system tasks（i.e., target detection and tracking）. We then propose a new non-dominated sorting genetic algorithm（NSGA） to maximize the system surveillance performance. Pareto optimal sets are employed to deal with the conflicts due to the presence of multiple cost functions. Simulation results verify the validity and the improved performance of the proposed technique over benchmark methods.

Comparative Analysis of Scheduling Algorithms Performance in a Long Term Evolution Network

The advancement in cellular communications has enhanced the special attention given to the study of resource allocation schemes.This study is to enhance communications to attain efficiency and thereby offers fairness to all users in the face of congestion experienced anytime a new product is rolled out.The comparative analysis was done on the performance of Enhanced Proportional Fair,Qos-Aware Proportional Fair and Logarithmic rule scheduling algorithms in Long Term Evolution in this work.These algorithms were simulated using LTE system toolbox in MATLAB and their performances were compared using Throughput,Packet delay and Packet Loss Ratio.The results showed Qos-Aware Proportional Fair has a better performance in all the metrics used for the evaluation.

Stability and performance analysis of the compressed Kalman filter algorithm for sparse stochastic systems

This paper considers the problem of estimating unknown sparse time-varying signals for stochastic dynamic systems.To deal with the challenges of extensive sparsity,we resort to the compressed sensing method and propose a compressed Kalman filter(KF)algorithm.Our algorithm first compresses the original high-dimensional sparse regression vector via the sensing matrix and then obtains a KF estimate in the compressed low-dimensional space.Subsequently,the original high-dimensional sparse signals can be well recovered by a reconstruction technique.To ensure stability and establish upper bounds on the estimation errors,we introduce a compressed excitation condition without imposing independence or stationarity on the system signal,and therefore suitable for feedback systems.We further present the performance of the compressed KF algorithm.Specifically,we show that the mean square compressed tracking error matrix can be approximately calculated by a linear deterministic difference matrix equation,which can be readily evaluated,analyzed,and optimized.Finally,a numerical example demonstrates that our algorithm outperforms the standard uncompressed KF algorithm and other compressed algorithms for estimating high-dimensional sparse signals.

Self-adaptive PID controller of microwave drying rotary device tuning on-line by genetic algorithms

The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.

Acid-pickling plates and strips speed control system by microwave heating based on self-adaptive fuzzy PID algorithm

Double self-adaptive fuzzy PID algorithm-based control strategy was proposed to construct quasi-cascade control system to control the speed of the acid-pickling process of titanium plates and strips. It is very useful in overcoming non-linear dynamic behavior, uncertain and time-varying parameters, un-modeled dynamics, and couples between the automatic turbulence control (ATC) and the automatic acid temperature control (AATC) with varying parameters during the operation process. The quasi-cascade control system of inner and outer loop self-adaptive fuzzy PID controller was built, which could effectively control the pickling speed of plates and strips. The simulated results and real application indicate that the plates and strips acid pickling speed control system has good performances of adaptively tracking the parameter variations and anti-disturbances, which ensures the match of acid pickling temperature and turbulence of flowing with acid pickling speed, improving the surface quality of plates and strips acid pickling, and energy efficiency.

Unfolding neutron spectra from water-pumping-injection multilayered concentric sphere neutron spectrometer using self-adaptive differential evolution algorithm

A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neutron spectrometer(WMNS).Specifically,the neutron fluence bounds are estimated to accelerate the algorithm convergence,and the minimum error between the optimal solution and input neutron counts with relative uncertainties is limited to 10^(-6)to avoid unnecessary calculations.Furthermore,the crossover probability and scaling factor are self-adaptively controlled.FLUKA Monte Carlo is used to simulate the readings of the WMNS under(1)a spectrum of Cf-252 and(2)its spectrum after being moderated,(3)a spectrum used for boron neutron capture therapy,and(4)a reactor spectrum.Subsequently,the measured neutron counts are unfolded using the SDENUA.The uncertainties of the measured neutron count and the response matrix are considered in the SDENUA,which does not require complex parameter tuning or an a priori default spectrum.The results indicate that the solutions of the SDENUA agree better with the IAEA spectra than those of MAXED and GRAVEL in UMG 3.1,and the errors of the final results calculated using the SDENUA are less than 12%.The established SDENUA can be used to unfold spectra from the WMNS.

Enhanced self-adaptive evolutionary algorithm for numerical optimization

There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.