Higher-dimensional Chen-Lee-Liu equation and asymmetric peakon soliton

Integrable systems play a crucial role in physics and mathematics.In particular,the traditional(1+1)-dimensional and(2+1)-dimensional integrable systems have received significant attention due to the rarity of integrable systems in higher dimensions.Recent studies have shown that abundant higher-dimensional integrable systems can be constructed from(1+1)-dimensional integrable systems by using a deformation algorithm.Here we establish a new(2+1)-dimensional Chen-Lee-Liu(C-L-L)equation using the deformation algorithm from the(1+1)-dimensional C-L-L equation.The new system is integrable with its Lax pair obtained by applying the deformation algorithm to that of the(1+1)-dimension.It is challenging to obtain the exact solutions for the new integrable system because the new system combines both the original C-L-L equation and its reciprocal transformation.The traveling wave solutions are derived in implicit function expression,and some asymmetry peakon solutions are found.

A modified OMP method for multi-orbit three dimensional ISAR imaging of the space target

The conventional two dimensional(2D)inverse synthetic aperture radar(ISAR)imaging fails to provide the targets'three dimensional(3D)information.In this paper,a 3D ISAR imaging method for the space target is proposed based on mutliorbit observation data and an improved orthogonal matching pursuit(OMP)algorithm.Firstly,the 3D scattered field data is converted into a set of 2D matrix by stacking slices of the 3D data along the elevation direction dimension.Then,an improved OMP algorithm is applied to recover the space target's amplitude information via the 2D matrix data.Finally,scattering centers can be reconstructed with specific three dimensional locations.Numerical simulations are provided to demonstrate the effectiveness and superiority of the proposed 3D imaging method.

Binary Archimedes Optimization Algorithm for Computing Dominant Metric Dimension Problem

In this paper,we consider the NP-hard problem of finding the minimum dominant resolving set of graphs.A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the vertices in B.A resolving set is dominating if every vertex of G that does not belong to B is a neighbor to some vertices in B.The dominant metric dimension of G is the cardinality number of the minimum dominant resolving set.The dominant metric dimension is computed by a binary version of the Archimedes optimization algorithm(BAOA).The objects of BAOA are binary encoded and used to represent which one of the vertices of the graph belongs to the dominant resolving set.The feasibility is enforced by repairing objects such that an additional vertex generated from vertices of G is added to B and this repairing process is iterated until B becomes the dominant resolving set.This is the first attempt to determine the dominant metric dimension problem heuristically.The proposed BAOA is compared to binary whale optimization(BWOA)and binary particle optimization(BPSO)algorithms.Computational results confirm the superiority of the BAOA for computing the dominant metric dimension.

Three-dimensional weighting reconstruction algorithm for circular cone-beam CT under large scan angles

Improving imaging quality of cone-beam CT under large cone angle scan has been an important area of CT imaging research. Considering the idea of conjugate rays and making up missing data, we propose a three-dimensional(3D) weighting reconstruction algorithm for cone-beam CT. The 3D weighting function is added in the back-projection process to reduce the axial density drop and improve the accuracy of FDK algorithm. Having a simple structure, the algorithm can be implemented easily without rebinning the native cone-beam data into coneparallel beam data. Performance of the algorithm is evaluated using two computer simulations and a real industrial component, and the results show that the algorithm achieves better performance in reduction of axial intensity drop artifacts and has a wide range of application.

Evaluation of 4 three-dimensional representation algorithms in capsule endoscopy images

AIM:To evaluate the three-dimensional(3-D)representation performance of 4 publicly available Shapefrom-Shading(SfS)algorithms in small-bowel capsule endoscopy(SBCE).METHODS:SfS techniques recover the shape of objects using the gradual variation of shading.There are4 publicly available SfS algorithms.To the best of our knowledge,no comparative study with images obtained during clinical SBCE has been performed to date.Three experienced reviewers were asked to evaluate 54 twodimensional(2-D)images(categories:protrusion/inflammation/vascular)transformed to 3-D by the aforementioned SfS 3-D algorithms.The best algorithm was selected and inter-rater agreement was calculated.RESULTS:Four publicly available SfS algorithms were compared.Tsai’s SfS algorithm outperformed the rest(selected as best performing in 45/54 SBCE images),followed by Ciuti’s algorithm(best performing in 7/54images)and Torre o’s(in 1/54 images).In 26/54 images;Tsai’s algorithm was unanimously selected as the best performing 3-D representation SfS software.Tsai’s 3-D algorithm superiority was independent of lesion category(protrusion/inflammatory/vascular;P=0.678)and/or CE system used to obtain the 2-D images(MiroCam/PillCam;P=0.558).Lastly,the interobserver agreement was good(kappa=0.55).CONCLUSION:3-D representation software offers a plausible alternative for 3-D representation of conventional capsule endoscopy images(until optics technology matures enough to allow hardware enabled-"real"3-D reconstruction of the gastrointestinal tract).

HIGH RESOLUTION PARAMETRIC MODELLING FOR TWO-DIMENSIONAL RADAR TARGET USING PRONY ALGORITHM

On the conditions of low-resolution radar, a parametric model for two-dimensional radar target is described here according to the theory of electromagnetic scattering and the geometrical theory of diffraction. A high resolution estimation algorithm to extract the model parameters is also developed by building the relation of the scattering model and Prony model. The analysis of Cramer-Rao bound and simulation show that the method here has better statistical performance. The simulated analysis also indicates that the accurate extraction of the diffraction coefficient of scattering center is restricted by signal to noise ratio, radar center frequency and radar bandwidth.

Design of a Two-dimensional Recursive Filter Using the Bees Algorithm

This paper presents the first application of the bees algorithm to the optimisation of parameters of a two-dimensional （2D） recursive digital filter. The algorithm employs a search technique inspired by the foraging behaviour of honey bees. The results obtained show clear improvement compared to those produced by the widely adopted genetic algorithm （GA）.

Three-Dimensional Distance-Error-Correction-Based Hop Localization Algorithm for IoT Devices

The Internet of Things(IoT)is envisioned as a network of various wireless sensor nodes communicating with each other to offer state-of-the-art solutions to real-time problems.These networks of wireless sensors monitor the physical environment and report the collected data to the base station,allowing for smarter decisions.Localization in wireless sensor networks is to localize a sensor node in a two-dimensional plane.However,in some application areas,such as various surveillances,underwater monitoring systems,and various environmental monitoring applications,wireless sensors are deployed in a three-dimensional plane.Recently,localization-based applications have emerged as one of the most promising services related to IoT.In this paper,we propose a novel distributed range-free algorithm for node localization in wireless sensor networks.The proposed three-dimensional hop localization algorithm is based on the distance error correction factor.In this algorithm,the error decreases with the localization process.The distance correction factor is used at various stages of the localization process,which ultimately mitigates the error.We simulated the proposed algorithm using MATLAB and verified the accuracy of the algorithm.The simulation results are compared with some of the well-known existing algorithms in the literature.The results show that the proposed three-dimensional error-correctionbased algorithm performs better than existing algorithms.

Dimensional Complexity and Algorithmic Efficiency

This paper uses the concept of algorithmic efficiency to present a unified theory of intelligence. Intelligence is defined informally, formally, and computationally. We introduce the concept of dimensional complexity in algorithmic efficiency and deduce that an optimally efficient algorithm has zero time complexity, zero space complexity, and an infinite dimensional complexity. This algorithm is used to generate the number line.

S-box:six-dimensional compound hyperchaotic map and artificial bee colony algorithm

Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion（SAC）,bits independence criterion（BIC）,differential probability（DP） and linear probability（LP）.To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm（CSABC） is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.

An Improved DV-Hop Localization Algorithm Based on Hop Distances Correction

DV-Hop localization algorithm has greater localization error which estimates distance from an unknown node to the different anchor nodes by using estimated average size of a hop to achieve the location of the unknown node.So an improved DV-Hop localization algorithm based on correctional average size of a hop,HDCDV-Hop algorithm,is proposed.The improved algorithm corrects the estimated distance between the unknown node and different anchor nodes based on fractional hop count information and relatively accurate coordinates of the anchor nodes information,and it uses the improved Differential Evolution algorithm to get the estimate location of unknown nodes so as to further reduce the localization error.Simulation results show that our proposed algorithm have lower localization error and higher localization accuracy compared with the original DV-Hop algorithm and other classical improved algorithms.

Soft measurement model of ring's dimensions for vertical hot ring rolling process using neural networks optimized by genetic algorithm

Vertical hot ring rolling(VHRR) process has the characteristics of nonlinearity,time-variation and being susceptible to disturbance.Furthermore,the ring's growth is quite fast within a short time,and the rolled ring's position is asymmetrical.All of these cause that the ring's dimensions cannot be measured directly.Through analyzing the relationships among the dimensions of ring blanks,the positions of rolls and the ring's inner and outer diameter,the soft measurement model of ring's dimensions is established based on the radial basis function neural network(RBFNN).A mass of data samples are obtained from VHRR finite element(FE) simulations to train and test the soft measurement NN model,and the model's structure parameters are deduced and optimized by genetic algorithm(GA).Finally,the soft measurement system of ring's dimensions is established and validated by the VHRR experiments.The ring's dimensions were measured artificially and calculated by the soft measurement NN model.The results show that the calculation values of GA-RBFNN model are close to the artificial measurement data.In addition,the calculation accuracy of GA-RBFNN model is higher than that of RBFNN model.The research results suggest that the soft measurement NN model has high precision and flexibility.The research can provide practical methods and theoretical guidance for the accurate measurement of VHRR process.

Space gripper configuration and its dimension synthesis based on genetic algorithm

The special fingers of the gripper on the space robot have been developed based on genetic algorithmfor the space application.Therefore,the symmetrical wedgelike finger composed of the 4-1ink mechanismand the relevant track were designed.To decrease the weight and optimize the kinematics and grip force,the compositive fitness function for dynamics and kinematics was created.The calculation efficiency couldbe improved by novel methods which overcame the problem of too many constraints in the solution space,such as introducing the specialist's experience and punishment function and simplifying the variables.The solutions show that the optimized finger could perform well and the methods were effectual.

Multi-objective strategy to optimize dithering technique for high-quality three-dimensional shape measurement

Dithering optimization techniques can be divided into the phase-optimized technique and the intensity-optimized technique. The problem with the former is the poor sensitivity to various defocusing amounts, and the problem with the latter is that it cannot enhance phase quality directly nor efficiently. In this paper, we present a multi-objective optimization framework for three-dimensional(3D) measurement by utilizing binary defocusing technique. Moreover, a binary patch optimization technique is used to solve the time-consuming issue of genetic algorithm. It is demonstrated that the presented technique consistently obtains significant phase performance improvement under various defocusing amounts.

Rough Sets Hybridization with Mayfly Optimization for Dimensionality Reduction

Big data is a vast amount of structured and unstructured data that must be dealt with on a regular basis.Dimensionality reduction is the process of converting a huge set of data into data with tiny dimensions so that equal information may be expressed easily.These tactics are frequently utilized to improve classification or regression challenges while dealing with machine learning issues.To achieve dimensionality reduction for huge data sets,this paper offers a hybrid particle swarm optimization-rough set PSO-RS and Mayfly algorithm-rough set MA-RS.A novel hybrid strategy based on the Mayfly algorithm(MA)and the rough set(RS)is proposed in particular.The performance of the novel hybrid algorithm MA-RS is evaluated by solving six different data sets from the literature.The simulation results and comparison with common reduction methods demonstrate the proposed MARS algorithm’s capacity to handle a wide range of data sets.Finally,the rough set approach,as well as the hybrid optimization techniques PSO-RS and MARS,were applied to deal with the massive data problem.MA-hybrid RS’s method beats other classic dimensionality reduction techniques,according to the experimental results and statistical testing studies.

Part Orientation Optimization in Three Dimensional Printing

Part orientation is one of the important factors in manufacturing with three dimensional printing (3DP) of rapid prototyping system. The minimum building time, being achieved by the part’s minimum building height and minimum width in 3DP’s y direction, is set as the objective of optimizing the part orientation. Genetic algorithm is adopted to find the minimum building height of parts and then ergodic searching is used to get the minimum width of part in y direction. A corresponding program for optimizing part orientation in 3DP was developed. Tests show the proposed approach is effective and fast.

Three-Dimensional Space Interpolation of Grey / Depth Image Sequence-A New Technique of Computer Graphics Synthesis

This paper advances a three-dimensional space interpolation method of grey / depth image sequence, which breaks free from the limit of original practical photographing route. Pictures can cruise at will in space. By using space sparse sampling, great memorial capacity can be saved and reproduced scenes can be controlled. To solve time consuming and complex computations in three-dimensional interpolation algorithm, we have studied a fast and practical algorithm of scattered space lattice and that of 'Warp' algorithm with proper depth. By several simple aspects of three dimensional space interpolation, we succeed in developing some simple and practical algorithms. Some results of simulated experiments with computers have shown that the new method is absolutely feasible.

Three-Dimensional Scenes Restore Using Digital Image

Encryption and decryption method of three-dimensional objects uses holograms computer-generated and suggests encoding stage. Information obtained amplitude and phase of a three-dimensional object using mathematically stage transforms overlap stored on a digital computer. Different three-dimensional images restore and develop the system for the expansion of the three-dimensional scenes and camera movement parameters. This article talks about these kinds of digital image processing algorithms as the reconstruction of three-dimensional model of the scene. In the present state, many such algorithms need to be improved in this paper proposing one of the options to improve the accuracy of such reconstruction.

Vertical two-dimensional non-hydrostatic pressure model with single layer

The vertical two-dimensional non-hydrostatic pressure models with multiple layers can make prediction more accurate than those obtained by the hydrostatic pres- sure assumption. However, they are time-consuming and unstable, which makes them unsuitable for wider application. In this study, an efficient model with a single layer is developed. Decomposing the pressure into the hydrostatic and dynamic components and integrating the x-momentum equation from the bottom to the free surface can yield a horizontal momentum equation, in which the terms relevant to the dynamic pressure are discretized semi-implicitly. The convective terms in the vertical momentum equation are ignored, and the rest of the equation is approximated with the Keller-box scheme. The velocities expressed as the unknown dynamic pressure are substituted into the continuity equation, resulting in a tri-diagonal linear system solved by the Thomas algorithm. The validation of solitary and sinusoidal waves indicates that the present model can provide comparable results to the models with multiple layers but at much lower computation cost.