Orbit Weighting Scheme in the Context of Vector Space Information Retrieval

This study introduces the Orbit Weighting Scheme(OWS),a novel approach aimed at enhancing the precision and efficiency of Vector Space information retrieval(IR)models,which have traditionally relied on weighting schemes like tf-idf and BM25.These conventional methods often struggle with accurately capturing document relevance,leading to inefficiencies in both retrieval performance and index size management.OWS proposes a dynamic weighting mechanism that evaluates the significance of terms based on their orbital position within the vector space,emphasizing term relationships and distribution patterns overlooked by existing models.Our research focuses on evaluating OWS’s impact on model accuracy using Information Retrieval metrics like Recall,Precision,InterpolatedAverage Precision(IAP),andMeanAverage Precision(MAP).Additionally,we assessOWS’s effectiveness in reducing the inverted index size,crucial for model efficiency.We compare OWS-based retrieval models against others using different schemes,including tf-idf variations and BM25Delta.Results reveal OWS’s superiority,achieving a 54%Recall and 81%MAP,and a notable 38%reduction in the inverted index size.This highlights OWS’s potential in optimizing retrieval processes and underscores the need for further research in this underrepresented area to fully leverage OWS’s capabilities in information retrieval methodologies.

A Reference Vector-Assisted Many-Objective Optimization Algorithm with Adaptive Niche Dominance Relation

It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence and diversity and can only find a group of solutions focused on a small area on the Pareto front,resulting in poor performance of those algorithms.For this reason,we propose a reference vector-assisted algorithmwith an adaptive niche dominance relation,for short MaOEA-AR.The new dominance relation forms a niche based on the angle between candidate solutions.By comparing these solutions,the solutionwith the best convergence is found to be the non-dominated solution to improve the selection pressure.In reproduction,a mutation strategy of k-bit crossover and hybrid mutation is used to generate high-quality offspring.On 23 test problems with up to 15-objective,we compared the proposed algorithm with five state-of-the-art algorithms.The experimental results verified that the proposed algorithm is competitive.

Stability prediction of hard rock pillar using support vector machine optimized by three metaheuristic algorithms

Hard rock pillar is one of the important structures in engineering design and excavation in underground mines.Accurate and convenient prediction of pillar stability is of great significance for underground space safety.This paper aims to develop hybrid support vector machine(SVM)models improved by three metaheuristic algorithms known as grey wolf optimizer(GWO),whale optimization algorithm(WOA)and sparrow search algorithm(SSA)for predicting the hard rock pillar stability.An integrated dataset containing 306 hard rock pillars was established to generate hybrid SVM models.Five parameters including pillar height,pillar width,ratio of pillar width to height,uniaxial compressive strength and pillar stress were set as input parameters.Two global indices,three local indices and the receiver operating characteristic(ROC)curve with the area under the ROC curve(AUC)were utilized to evaluate all hybrid models’performance.The results confirmed that the SSA-SVM model is the best prediction model with the highest values of all global indices and local indices.Nevertheless,the performance of the SSASVM model for predicting the unstable pillar(AUC:0.899)is not as good as those for stable(AUC:0.975)and failed pillars(AUC:0.990).To verify the effectiveness of the proposed models,5 field cases were investigated in a metal mine and other 5 cases were collected from several published works.The validation results indicated that the SSA-SVM model obtained a considerable accuracy,which means that the combination of SVM and metaheuristic algorithms is a feasible approach to predict the pillar stability.

Indirect Vector Control of Linear Induction Motors Using Space Vector Pulse Width Modulation

Vector control schemes have recently been used to drive linear induction motors(LIM)in high-performance applications.This trend promotes the development of precise and efficient control schemes for individual motors.This research aims to present a novel framework for speed and thrust force control of LIM using space vector pulse width modulation(SVPWM)inverters.The framework under consideration is developed in four stages.To begin,MATLAB Simulink was used to develop a detailed mathematical and electromechanical dynamicmodel.The research presents a modified SVPWM inverter control scheme.By tuning the proportional-integral(PI)controller with a transfer function,optimized values for the PI controller are derived.All the subsystems mentioned above are integrated to create a robust simulation of the LIM’s precise speed and thrust force control scheme.The reference speed values were chosen to evaluate the performance of the respective system,and the developed system’s response was verified using various data sets.For the low-speed range,a reference value of 10m/s is used,while a reference value of 100 m/s is used for the high-speed range.The speed output response indicates that themotor reached reference speed in amatter of seconds,as the delay time is between 8 and 10 s.The maximum amplitude of thrust achieved is less than 400N,demonstrating the controller’s capability to control a high-speed LIM with minimal thrust ripple.Due to the controlled speed range,the developed system is highly recommended for low-speed and high-speed and heavy-duty traction applications.

An Improved HVQ Algorithm for Compression and Rendering of Space Environment Volume Data with Multi-correlated Variables

Volume visualization can not only illustrate overall distribution but also inner structure and it is an important approach for space environment research.Space environment simulation can produce several correlated variables at the same time.However,existing compressed volume rendering methods only consider reducing the redundant information in a single volume of a specific variable,not dealing with the redundant information among these variables.For space environment volume data with multi-correlated variables,based on the HVQ-1d method we propose a further improved HVQ method by compositing variable-specific levels to reduce the redundant information among these variables.The volume data associated with each variable is divided into disjoint blocks of size 43 initially.The blocks are represented as two levels,a mean level and a detail level.The variable-specific mean levels and detail levels are combined respectively to form a larger global mean level and a larger global detail level.To both global levels,a splitting based on a principal component analysis is applied to compute initial codebooks.Then,LBG algorithm is conducted for codebook refinement and quantization.We further take advantage of progressive rendering based on GPU for real-time interactive visualization.Our method has been tested along with HVQ and HVQ-1d on high-energy proton flux volume data,including>5,>10,>30 and>50 MeV integrated proton flux.The results of our experiments prove that the method proposed in this paper pays the least cost of quality at compression,achieves a higher decompression and rendering speed compared with HVQ and provides satisficed fidelity while ensuring interactive rendering speed.

Near-Vector Spaces Constructed over Zp, for p a Prime

The purpose of this paper is to construct near-vector spaces using a result by Van der Walt, with Zp for p a prime, as the underlying near-field. There are two notions of near-vector spaces, we focus on those studied by André [1]. These near-vector spaces have recently proven to be very useful in finite linear games. We will discuss the construction and properties, give examples of these near-vector spaces and give its application in finite linear games.

Some Results for Exact Support Recovery of Block Joint Sparse Matrix via Block Multiple Measurement Vectors Algorithm

Block multiple measurement vectors (BMMV) is a reconstruction algorithm that can be used to recover the support of block K-joint sparse matrix X from Y = ΨX + V. In this paper, we propose a sufficient condition for accurate support recovery of the block K-joint sparse matrix via the BMMV algorithm in the noisy case. Furthermore, we show the optimality of the condition we proposed in the absence of noise when the problem reduces to single measurement vector case.

Edge Enhancement for Remote Sensing Image Using Norm Algorithm in L_2 Vector Space

The Householder transformation-norm structure function in L2 vector space of linear algebra is introduced, and the edge enhancement for remote sensing images is realized. The experiment result is compared with traditional Laplacian and Sobel edge enhancements and it shows that the effect of the new method is better than that of the traditional algorithms.

Secure Transmission of Compressed Medical Image Sequences on Communication Networks Using Motion Vector Watermarking

Medical imaging plays a key role within modern hospital management systems for diagnostic purposes.Compression methodologies are extensively employed to mitigate storage demands and enhance transmission speed,all while upholding image quality.Moreover,an increasing number of hospitals are embracing cloud computing for patient data storage,necessitating meticulous scrutiny of server security and privacy protocols.Nevertheless,considering the widespread availability of multimedia tools,the preservation of digital data integrity surpasses the significance of compression alone.In response to this concern,we propose a secure storage and transmission solution for compressed medical image sequences,such as ultrasound images,utilizing a motion vector watermarking scheme.The watermark is generated employing an error-correcting code known as Bose-Chaudhuri-Hocquenghem(BCH)and is subsequently embedded into the compressed sequence via block-based motion vectors.In the process of watermark embedding,motion vectors are selected based on their magnitude and phase angle.When embedding watermarks,no specific spatial area,such as a region of interest(ROI),is used in the images.The embedding of watermark bits is dependent on motion vectors.Although reversible watermarking allows the restoration of the original image sequences,we use the irreversible watermarking method.The reason for this is that the use of reversible watermarks may impede the claims of ownership and legal rights.The restoration of original data or images may call into question ownership or other legal claims.The peak signal-to-noise ratio(PSNR)and structural similarity index(SSIM)serve as metrics for evaluating the watermarked image quality.Across all images,the PSNR value exceeds 46 dB,and the SSIM value exceeds 0.92.Experimental results substantiate the efficacy of the proposed technique in preserving data integrity.

Enhancing Cancer Classification through a Hybrid Bio-Inspired Evolutionary Algorithm for Biomarker Gene Selection

In this study,our aim is to address the problem of gene selection by proposing a hybrid bio-inspired evolutionary algorithm that combines Grey Wolf Optimization(GWO)with Harris Hawks Optimization(HHO)for feature selection.Themotivation for utilizingGWOandHHOstems fromtheir bio-inspired nature and their demonstrated success in optimization problems.We aimto leverage the strengths of these algorithms to enhance the effectiveness of feature selection in microarray-based cancer classification.We selected leave-one-out cross-validation(LOOCV)to evaluate the performance of both two widely used classifiers,k-nearest neighbors(KNN)and support vector machine(SVM),on high-dimensional cancer microarray data.The proposed method is extensively tested on six publicly available cancer microarray datasets,and a comprehensive comparison with recently published methods is conducted.Our hybrid algorithm demonstrates its effectiveness in improving classification performance,Surpassing alternative approaches in terms of precision.The outcomes confirm the capability of our method to substantially improve both the precision and efficiency of cancer classification,thereby advancing the development ofmore efficient treatment strategies.The proposed hybridmethod offers a promising solution to the gene selection problem in microarray-based cancer classification.It improves the accuracy and efficiency of cancer diagnosis and treatment,and its superior performance compared to other methods highlights its potential applicability in realworld cancer classification tasks.By harnessing the complementary search mechanisms of GWO and HHO,we leverage their bio-inspired behavior to identify informative genes relevant to cancer diagnosis and treatment.

Structure-preserving algorithms for guiding center dynamics based on the slow manifold of classical Pauli particle

The classical Pauli particle(CPP) serves as a slow manifold, substituting the conventional guiding center dynamics. Based on the CPP, we utilize the averaged vector field(AVF) method in the computations of drift orbits. Demonstrating significantly higher efficiency, this advanced method is capable of accomplishing the simulation in less than one-third of the time of directly computing the guiding center motion. In contrast to the CPP-based Boris algorithm, this approach inherits the advantages of the AVF method, yielding stable trajectories even achieved with a tenfold time step and reducing the energy error by two orders of magnitude. By comparing these two CPP algorithms with the traditional RK4 method, the numerical results indicate a remarkable performance in terms of both the computational efficiency and error elimination. Moreover, we verify the properties of slow manifold integrators and successfully observe the bounce on both sides of the limiting slow manifold with deliberately chosen perturbed initial conditions. To evaluate the practical value of the methods, we conduct simulations in non-axisymmetric perturbation magnetic fields as part of the experiments,demonstrating that our CPP-based AVF method can handle simulations under complex magnetic field configurations with high accuracy, which the CPP-based Boris algorithm lacks. Through numerical experiments, we demonstrate that the CPP can replace guiding center dynamics in using energy-preserving algorithms for computations, providing a new, efficient, as well as stable approach for applying structure-preserving algorithms in plasma simulations.

Prediction of Ground Vibration Induced by Rock Blasting Based on Optimized Support Vector Regression Models

Accurately estimating blasting vibration during rock blasting is the foundation of blasting vibration management.In this study,Tuna Swarm Optimization(TSO),Whale Optimization Algorithm(WOA),and Cuckoo Search(CS)were used to optimize two hyperparameters in support vector regression(SVR).Based on these methods,three hybrid models to predict peak particle velocity(PPV)for bench blasting were developed.Eighty-eight samples were collected to establish the PPV database,eight initial blasting parameters were chosen as input parameters for the predictionmodel,and the PPV was the output parameter.As predictive performance evaluation indicators,the coefficient of determination(R2),rootmean square error(RMSE),mean absolute error(MAE),and a10-index were selected.The normalizedmutual information value is then used to evaluate the impact of various input parameters on the PPV prediction outcomes.According to the research findings,TSO,WOA,and CS can all enhance the predictive performance of the SVR model.The TSO-SVR model provides the most accurate predictions.The performances of the optimized hybrid SVR models are superior to the unoptimized traditional prediction model.The maximum charge per delay impacts the PPV prediction value the most.

Enhanced Wolf Pack Algorithm (EWPA) and Dense-kUNet Segmentation for Arterial Calcifications in Mammograms

Breast Arterial Calcification(BAC)is a mammographic decision dissimilar to cancer and commonly observed in elderly women.Thus identifying BAC could provide an expense,and be inaccurate.Recently Deep Learning(DL)methods have been introduced for automatic BAC detection and quantification with increased accuracy.Previously,classification with deep learning had reached higher efficiency,but designing the structure of DL proved to be an extremely challenging task due to overfitting models.It also is not able to capture the patterns and irregularities presented in the images.To solve the overfitting problem,an optimal feature set has been formed by Enhanced Wolf Pack Algorithm(EWPA),and their irregularities are identified by Dense-kUNet segmentation.In this paper,Dense-kUNet for segmentation and optimal feature has been introduced for classification(severe,mild,light)that integrates DenseUNet and kU-Net.Longer bound links exist among adjacent modules,allowing relatively rough data to be sent to the following component and assisting the system in finding higher qualities.The major contribution of the work is to design the best features selected by Enhanced Wolf Pack Algorithm(EWPA),and Modified Support Vector Machine(MSVM)based learning for classification.k-Dense-UNet is introduced which combines the procedure of Dense-UNet and kU-Net for image segmentation.Longer bound associations occur among nearby sections,allowing relatively granular data to be sent to the next subsystem and benefiting the system in recognizing smaller characteristics.The proposed techniques and the performance are tested using several types of analysis techniques 826 filled digitized mammography.The proposed method achieved the highest precision,recall,F-measure,and accuracy of 84.4333%,84.5333%,84.4833%,and 86.8667%when compared to other methods on the Digital Database for Screening Mammography(DDSM).

The Dual of the Two-Variable Exponent Amalgam Spaces (Lq(),lp())(Ω)

Wiener amalgam spaces are a class of function spaces where the function’s local and global behavior can be easily distinguished. These spaces are ex-tensively used in Harmonic analysis that originated in the work of Wiener. In this paper: we first introduce a two-variable exponent amalgam space (Lq(),lp())(Ω). Secondly, we investigate some basic properties of these spaces, and finally, we study their dual.

Modified Lorentz Transformations and Space-Time Splitting According to the Inverse Relativity Model

Analysis of a four-dimensional displacement vector on the fabric of space-time in the special or general case into two Four-dimensional vectors, according to specific conditions leads to the splitting of the total fabric of space-time into a positive subspace-time that represents the space of causality and a negative subspace-time which represents a space without causality, thus, in the special case, we have new transformations for the coordinates of space and time modified from Lorentz transformations specific to each subspace, where the contraction of length disappears and the speed of light is no longer a universal constant. In the general case, we have new types of matric tensor, one for positive subspace-time and the other for negative subspace-time. We also find that the speed of the photon decreases in positive subspace-time until it reaches zero and increases in negative subspace-time until it reaches the speed of light when the photon reaches the Schwarzschild radius.

Feature Extraction of Stored-grain Insects Based on Ant Colony Optimization and Support Vector Machine Algorithm

[Objective] The aim was to study the feature extraction of stored-grain insects based on ant colony optimization and support vector machine algorithm, and to explore the feasibility of the feature extraction of stored-grain insects. [Method] Through the analysis of feature extraction in the image recognition of the stored-grain insects, the recognition accuracy of the cross-validation training model in support vector machine （SVM） algorithm was taken as an important factor of the evaluation principle of feature extraction of stored-grain insects. The ant colony optimization （ACO） algorithm was applied to the automatic feature extraction of stored-grain insects. [Result] The algorithm extracted the optimal feature subspace of seven features from the 17 morphological features, including area and perimeter. The ninety image samples of the stored-grain insects were automatically recognized by the optimized SVM classifier, and the recognition accuracy was over 95%. [Conclusion] The experiment shows that the application of ant colony optimization to the feature extraction of grain insects is practical and feasible.

NONEMPTY INTERSECTION THEOREMS AND SYSTEM OF GENERALIZED VECTOR EQUILIBRIUM PROBLEMS IN PRODUCT G-CONVEX SPACES

By using an existence theorems of maximal elements for a family of set-valued mappings in G-convex spaces due to the author, some new nonempty intersection theorems for a family of set-valued mappings were established in noncompact product G-convex spaces. As applications, some equilibrium existence theorems for a system of generalized vector equilibrium problems were proved in noncompact product G-convex spaces. These theorems unify, improve and generalize some important known results in literature.

Parameters selection in gene selection using Gaussian kernel support vector machines by genetic algorithm

In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying results by using conventional linear sta- tistical methods. Recursive feature elimination based on support vector machine (SVM RFE) is an effective algorithm for gene selection and cancer classification, which are integrated into a consistent framework. In this paper, we propose a new method to select parameters of the aforementioned algorithm implemented with Gaussian kernel SVMs as better alternatives to the common practice of selecting the apparently best parameters by using a genetic algorithm to search for a couple of optimal parameter. Fast implementation issues for this method are also discussed for pragmatic reasons. The proposed method was tested on two repre- sentative hereditary breast cancer and acute leukaemia datasets. The experimental results indicate that the proposed method per- forms well in selecting genes and achieves high classification accuracies with these genes.

Parameter selection of support vector regression based on hybrid optimization algorithm and its application

Choosing optimal parameters for support vector regression （SVR） is an important step in SVR. design, which strongly affects the pefformance of SVR. In this paper, based on the analysis of influence of SVR parameters on generalization error, a new approach with two steps is proposed for selecting SVR parameters, First the kernel function and SVM parameters are optimized roughly through genetic algorithm, then the kernel parameter is finely adjusted by local linear search, This approach has been successfully applied to the prediction model of the sulfur content in hot metal. The experiment results show that the proposed approach can yield better generalization performance of SVR than other methods,

Prediction of Pressure Drop of Slurry Flow in Pipeline by Hybrid Support Vector Regression and Genetic Algorithm Model

This paper describes a robust support vector regression （SVR） methodology, which can offer superior performance for important process engineering problems. The method incorporates hybrid support vector regression and genetic algorithm technique （SVR-GA） for efficient tuning of SVR meta-parameters. The algorithm has been applied for prediction of pressure drop of solid liquid slurry flow. A comparison with selected correlations in the lit- erature showed that the developed SVR correlation noticeably improved the prediction of pressure drop over a wide range of operating conditions, physical properties, and pipe diameters.