Search

Truck hoisting detection constitutes a key focus in port security, for which no optimal resolution has been identified. To address the issues of high costs, susceptibility to weather conditions, and low accuracy in conventional methods for truck hoisting detection, a non-intrusive detection approach is proposed in this paper. The proposed approach utilizes a mathematical model and an extreme gradient boosting (XGBoost) model. Electrical signals, including voltage and current, collected by Hall sensors are processed by the mathematical model, which augments their physical information. Subsequently, the dataset filtered by the mathematical model is used to train the XGBoost model, enabling the XGBoost model to effectively identify abnormal hoists. Improvements were observed in the performance of the XGBoost model as utilized in this paper. Finally, experiments were conducted at several stations. The overall false positive rate did not exceed 0.7% and no false negatives occurred in the experiments. The experimental results demonstrated the excellent performance of the proposed approach, which can reduce the costs and improve the accuracy of detection in container hoisting. [ABSTRACT FROM AUTHOR]

Detecting small targets and handling target occlusion and overlap are critical challenges in weld defect detection. In this paper, we propose the S-YOLO model, a novel weld defect detection method based on the YOLOv8-nano model and several mathematical techniques, specifically tailored to address these issues. Our approach includes several key contributions. Firstly, we introduce omni-dimensional dynamic convolution, which is sensitive to small targets, for improved feature extraction. Secondly, the NAM attention mechanism enhances feature representation in the region of interest. NAM computes the channel-wise and spatial-wise attention weights by matrix multiplications and element-wise operations, and then applies them to the feature maps. Additionally, we replace the SPPF module with a context augmentation module to improve feature map resolution and quality. To minimize information loss, we utilize Carafe upsampling instead of the conventional upsampling operations. Furthermore, we use a loss function that combines IoU, binary cross-entropy, and focal loss to improve bounding box regression and object classification. We use stochastic gradient descent (SGD) with momentum and weight decay to update the parameters of our model. Through rigorous experimental validation, our S-YOLO model demonstrates outstanding accuracy and efficiency in weld defect detection. It effectively tackles the challenges of small target detection, target occlusion, and target overlap. Notably, the proposed model achieves an impressive 8.9% improvement in mean Average Precision (mAP) compared to the native model. [ABSTRACT FROM AUTHOR]

Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). To evaluate FSAs effectively, controlled environments are required, and the use of synthetic datasets offers significant advantages. We introduce a set of ten synthetically generated datasets with known relevance, redundancy, and irrelevance of features, derived from various mathematical, logical, and geometric sources. Additionally, eight FSAs are evaluated on these datasets based on their relevance and novelty. The paper first introduces the datasets and then provides a comprehensive experimental analysis of the performance of the selected FSAs on these datasets including testing the FSAs' resilience on two types of induced data noise. The analysis has guided the grouping of the generated datasets into four groups of data complexity. Lastly, we provide public access to the generated datasets to facilitate bench-marking of new feature selection algorithms in the field via our Github repository. The contributions of this paper aim to foster the development of novel feature selection algorithms and advance their study. [ABSTRACT FROM AUTHOR]

This article presents a pioneering mathematical model, fuzzy bipolar hypersoft (FBHS) sets, which combines the bipolarity of parameters with the fuzziness of data. Motivated by the need for a comprehensive framework capable of addressing uncertainty and variability in complex phenomena, our approach introduces a novel method for representing both the presence and absence of parameters through FBHS sets. By employing two mappings to estimate positive and negative fuzziness levels, we bridge the gap between bipolarity, fuzziness, and parameterization, allowing for more realistic simulations of multifaceted scenarios. Compared to existing models like bipolar fuzzy hypersoft (BFHS) sets, FBHS sets offer a more intuitive and user-friendly approach to modeling phenomena involving bipolarity, fuzziness, and parameterization. This advantage is underscored by a detailed comparison and a practical example illustrating FBHS sets' superiority in modeling such phenomena. Additionally, this paper provides an in-depth exploration of fundamental FBHS set operations, highlighting their robustness and applicability in various contexts. Finally, we demonstrate the practical utility of FBHS sets in problem-solving and introduce an algorithm for optimal object selection based on available information sets, further emphasizing the advantages of our proposed framework. [ABSTRACT FROM AUTHOR]

In this paper, the methodology for designing an asymmetrical four-phase 8/6 switched reluctance motor (SRM) that achieves approximately constant output power over a wide speed range is described. In an asymmetrical 8/6 SRM, orthogonal phase pairs are different in terms of the pole width and number of turns. The main comparison criterion between the asymmetrical and symmetrical 8/6 SRM is the power-speed characteristic, obtained for a given rated RMS phase current of the symmetrical drive. The obtained results demonstrate that the asymmetrical 8/6 SRM allows the shape of the power-speed characteristic to be modified, thereby extending the constant power region well beyond that of the symmetrical configuration with the same rated power level. To make a fair comparison between the asymmetrical and symmetrical 8/6 SRM drives, the converter volt-ampere rating, machine volume, slot fill factor, and ohmic losses per phase are kept constant in all analyzed cases. For determination of the optimal control parameters and maximal drive performance for both designs, the appropriate SRM mathematical model and differential evolution algorithm are used. The applied model includes all substantial non-linearities and mutual coupling between phases. The simulation results are verified using a Finite Element Method (FEM)-based model in the Ansys Electronics 2020 R2 software package. [ABSTRACT FROM AUTHOR]

In modern converter-dominated power systems, total inertia is very variable and depends on the share of power generated by renewable-based converter-interfaced generation (CIG) at each specific moment. As a result, the limits required by the grid codes on the rate of change of frequency and its nadir or zenith during disturbances become challenging to achieve with conventional control approaches. Therefore, the transition to a novel control strategy of CIG with a grid-forming power converter is relevant. For this purpose, a control algorithm based on a virtual synchronous generator (VSG) is used, which simulates the properties and capabilities of a conventional synchronous generation. However, due to continuously changing operating conditions in converter-dominated power systems, the virtual inertia formed by VSG must be adaptive. At the same time, the efficiency of adaptive algorithms strongly depends on the used VSG structure. In this connection, this paper proposes an enhanced VSG structure for which the transfer function of the active power control loop was formed. With the help of it, the advantages over the conventional VSG structure were proven, which are necessary for the effective adaptive control of the VSG parameters. Then, the analysis of the impact of the VSG parameters on the dynamic response using the transient characteristics in the time domain was performed. Based on the results obtained, adaptive algorithms for independent control of the virtual inertia and the parameters of the VSG damper winding were developed. The performed mathematical modeling confirmed the reliable and effective operation of the developed adaptive control algorithms and the enhanced VSG structure. The theoretical and experimental results obtained in this paper indicate the need for simultaneous development and improvement of both adaptive control algorithms and VSG structures used for this purpose. [ABSTRACT FROM AUTHOR]

Simple Summary: Neuroblastoma is a rare type of cancer that usually affects children. The high-risk patients' expected survival rate is less than 50%. One reason is the lack of precision in the standard treatment protocol: a one-size-fits-all multi-modal therapy. The study presented in this paper was designed to address this deficit by optimising the use of two chemotherapeutic agents—vincristine and cyclophosphamide—during induction chemotherapy—the part of the protocol that shrinks the primary tumour before surgical removal. We combined a mathematical model and an optimisation algorithm to identify the best chemotherapy schedules for a cohort of virtual patients with different initial tumour compositions. Our results reveal novel strategies to exploit a pair of drugs with different levels of efficacy, provide a platform on which to individualise induction chemotherapy, and lay the foundation for a personalised therapy that leverages targeted therapies, multi-region sequencing, liquid biopsies, and modern computational methods to improve today's multi-modal therapy. Neuroblastoma is the most common extra-cranial solid tumour in children. Despite multi-modal therapy, over half of the high-risk patients will succumb. One contributing factor is the one-size-fits-all nature of multi-modal therapy. For example, during the first step (induction chemotherapy), the standard regimen (rapid COJEC) administers fixed doses of chemotherapeutic agents in eight two-week cycles. Perhaps because of differences in resistance, this standard regimen results in highly heterogeneous outcomes in different tumours. In this study, we formulated a mathematical model comprising ordinary differential equations. The equations describe the clonal evolution within a neuroblastoma tumour being treated with vincristine and cyclophosphamide, which are used in the rapid COJEC regimen, including genetically conferred and phenotypic drug resistance. The equations also describe the agents' pharmacokinetics. We devised an optimisation algorithm to find the best chemotherapy schedules for tumours with different pre-treatment clonal compositions. The optimised chemotherapy schedules exploit the cytotoxic difference between the two drugs and intra-tumoural clonal competition to shrink the tumours as much as possible during induction chemotherapy and before surgical removal. They indicate that induction chemotherapy can be improved by finding and using personalised schedules. More broadly, we propose that the overall multi-modal therapy can be enhanced by employing targeted therapies against the mutations and oncogenic pathways enriched and activated by the chemotherapeutic agents. To translate the proposed personalised multi-modal therapy into clinical use, patient-specific model calibration and treatment optimisation are necessary. This entails a decision support system informed by emerging medical technologies such as multi-region sequencing and liquid biopsies. The results and tools presented in this paper could be the foundation of this decision support system. [ABSTRACT FROM AUTHOR]

Legalized routing is an essential part of PCB automatic routing. It solves the problem of wiring conflicts and obtains routing results that comply with the constraints of design rules. Traditional legalized routing problems mostly use trial backtracking methods, but with increasing design complexity and design rules, avoiding wiring conflicts between networks has become increasingly challenging. This paper proposes a legalized routing algorithm based on linear programming to obtain the optimal wiring trajectory under specified topological constraints. First, the corresponding routing model was established based on numerous routing rules, and a routing grid diagram was found using obstacles as grid points. Secondly, a global routing algorithm was used to obtain the estimated wiring path, and integer linear programming was used to realize the mathematical modeling of the legalized routing problem. Finally, a multi-line simultaneous routing strategy was used to design and implement a detailed routing algorithm, optimizing the routing results. We use C++ to complete the coding work and thoroughly test the PCB use cases of different sizes. The experimental results show that our algorithm still maintains a 100% routing success rate, good time performance, and excellent routing quality with large-scale use cases compared with the trial backtracking method. [ABSTRACT FROM AUTHOR]

The indoor positioning technology of an ultra-wideband (UWB) can play an excellent supplementary role in satellite navigation and has broad application prospects. However, if strong interference exists, the measurement data based on UWB will fluctuate abnormally, which seriously affects the accuracy of positioning. In view of the above problems, based on the combination of mathematical modeling, this paper starts from the subject data, and proposes a positioning method suitable for non-interference/interference conditions and an abnormal data identification method to improve the positioning accuracy. The specific scheme includes data preprocessing model establishment and solution, positioning model establishment and solution, migration application of positioning model, interfering data identification model establishment and solution, and movement track positioning model establishment and solution. [ABSTRACT FROM AUTHOR]

The problem of sparse-view computed tomography (SVCT) reconstruction has become a popular research issue because of its significant capacity for radiation dose reduction. However, the reconstructed images often contain serious artifacts and noise from under-sampled projection data. Although the good results achieved by the prior image constrained compressed sensing (PICCS) method, there may be some unsatisfactory results in the reconstructed images because of the image gradient L1-norm used in the original PICCS model, which leads to the image suffering from step artifacts and over-smoothing of the edge as a result. To address the above-mentioned problem, this paper proposes a novel improved PICCS algorithm (NPICCS) for SVCT reconstruction. The proposed algorithm utilizes the advantages of PICCS, which could recover more details. Moreover, the algorithm introduces the L0-norm of image gradient regularization into the framework, which overcomes the disadvantage of conventional PICCS, and enhances the capability to retain edge and fine image detail. The split Bregman method has been used to resolve the proposed mathematical model. To verify the effectiveness of the proposed method, a large number of experiments with different angles are conducted. Final experimental results show that the proposed algorithm has advantages in edge preservation, noise suppression, and image detail recovery. [ABSTRACT FROM AUTHOR]

Path planning is crucial in the scheduling and motion planning of multiple robots. However, solving multi-robot path-planning problems efficiently and quickly is challenging due to their high complexity and long computational time, especially when dealing with many robots. This paper presents a unified mathematical model and algorithm for the path planning of multiple robots moving from one formation to another in an area with obstacles. The problem was initially simplified by constructing a cost matrix, and then the route planning was achieved by integrating an elite enhanced multi-population genetic algorithm and an ant colony algorithm. The performance of the proposed planning method was verified through numerical simulations in various scenarios. The findings indicate that this method exhibits high computational efficiency and yields a minimal overall path distance when addressing the path-planning problem of a multi-robot formation reconstruction. As a result, it holds promising potential for the path-planning problem of a multi-robot formation reconstruction. [ABSTRACT FROM AUTHOR]

This paper focuses on downlink power allocation for a cognitive radio-based non-orthogonal multiple access (CR-NOMA) system in a femtocell environment involving device-to-device (D2D) communication. The proposed power allocation scheme employs the greedy asynchronous distributed interference avoidance (GADIA) algorithm. This research aims to optimize the power allocation in the downlink transmission, considering the unique characteristics of the CR-NOMA-based femtocell D2D system. The GADIA algorithm is utilized to mitigate interference and effectively optimize power allocation across the network. This research uses a fairness index to present a novel fairness-constrained power allocation algorithm for a downlink non-orthogonal multiple access (NOMA) system. Through extensive simulations, the maximum rate under fairness (MRF) algorithm is shown to optimize system performance while maintaining fairness among users effectively. The fairness index is demonstrated to be adaptable to various user counts, offering a specified range with excellent responsiveness. The implementation of the GADIA algorithm exhibits promising results for sub-optimal frequency band distribution within the network. Mathematical models evaluated in MATLAB further confirm the superiority of CR-NOMA over optimum power allocation NOMA (OPA) and fixed power allocation NOMA (FPA) techniques. [ABSTRACT FROM AUTHOR]

As an important technology in 3D vision, point-cloud registration has broad development prospects in the fields of space-based remote sensing, photogrammetry, robotics, and so on. Of the available algorithms, the Iterative Closest Point (ICP) algorithm has been used as the classic algorithm for solving point cloud registration. However, with the point cloud data being under the influence of noise, outliers, overlapping values, and other issues, the performance of the ICP algorithm will be affected to varying degrees. This paper proposes a global structure and adaptive weight aware ICP algorithm (GSAW-ICP) for image registration. Specifically, we first proposed a global structure mathematical model based on the reconstruction of local surfaces using both the rotation of normal vectors and the change in curvature, so as to better describe the deformation of the object. The model was optimized for the convergence strategy, so that it had a wider convergence domain and a better convergence effect than either of the original point-to-point or point-to-point constrained models. Secondly, for outliers and overlapping values, the GSAW-ICP algorithm was able to assign appropriate weights, so as to optimize both the noise and outlier interference of the overall system. Our proposed algorithm was extensively tested on noisy, anomalous, and real datasets, and the proposed method was proven to have a better performance than other state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we research the dynamic car sequencing problem with car body buffer (DCSPwB) in automotive mixed-flow assembly. The objective is to reorder the sequence of cars in the paint shop using the post-painted body buffers to minimize the violation of constraint rules and the time cost of sequencing in the general assembly shop. We establish a mathematical model of DCSPwB and propose a decomposition-based algorithm based on the dynamic genetic algorithm (DGA) and greedy algorithm for delayed car release (PGDA). Experiments are conducted based on production orders from actual companies, and the results are compared with the solution results of the underlying genetic algorithm (GA) and greedy algorithm (GDA) to verify the effectiveness of the algorithm. In addition, the effect of buffer capacity on DCSPwB is investigated. [ABSTRACT FROM AUTHOR]

An efficient and more accurate millimeter-wave imaging algorithm, applied to a close-range monostatic personnel screening system, with consideration of dual path propagation loss, is presented in this paper. The algorithm is developed in accordance with a more rigorous physical model for the monostatic system. The physical model treats incident waves and scattered waves as spherical waves with a more rigorous amplitude term as per electromagnetic theory. As a result, the proposed method can achieve a better focusing effect for multiple targets in different range planes. Since the mathematical methods in classical algorithms, such as spherical wave decomposition and Weyl identity, cannot handle the corresponding mathematical model, the proposed algorithm is derived through the method of stationary phase (MSP). The algorithm has been validated by numerical simulations and laboratory experiments. Good performance in terms of computational efficiency and accuracy has been observed. The synthetic reconstruction results show that the proposed algorithm has significant advantages compared with the classical algorithms, and the reconstruction by using full-wave data generated by FEKO further verifies the validity of the proposed algorithm. Finally, the proposed algorithm performs as expected over real data acquired by our laboratory prototype. [ABSTRACT FROM AUTHOR]

Modal-free optimization algorithms do not require specific mathematical models, and they, along with their other benefits, have great application potential in adaptive optics. In this study, two different algorithms, the single-dimensional perturbation descent algorithm (SDPD) and the second-order stochastic parallel gradient descent algorithm (2SPGD), are proposed for wavefront sensorless adaptive optics, and a theoretical analysis of the algorithms' convergence rates is presented. The results demonstrate that the single-dimensional perturbation descent algorithm outperforms the stochastic parallel gradient descent (SPGD) and 2SPGD algorithms in terms of convergence speed. Then, a 32-unit deformable mirror is constructed as the wavefront corrector, and the SPGD, single-dimensional perturbation descent, and 2SPSA algorithms are used in an adaptive optics numerical simulation model of the wavefront controller. Similarly, a 39-unit deformable mirror is constructed as the wavefront controller, and the SPGD and single-dimensional perturbation descent algorithms are used in an adaptive optics experimental verification device of the wavefront controller. The outcomes demonstrate that the convergence speed of the algorithm developed in this paper is more than twice as fast as that of the SPGD and 2SPGD algorithms, and the convergence accuracy of the algorithm is 4% better than that of the SPGD algorithm. [ABSTRACT FROM AUTHOR]

Most existing ICP (Iterative Closet Point)-based 3D ear recognition approaches resort to the coarse-to-fine ICP algorithms to match 3D ear models. With such an approach, the gallery-probe pairs are coarsely aligned based on a few local feature points and then finely matched using the original ear point cloud. However, such an approach ignores the fact that not all the points in the coarsely segmented ear data make positive contributions to recognition. As such, the coarsely segmented ear data which contains a lot of redundant and noisy data could lead to a mismatch in the recognition scenario. Additionally, the fine ICP matching can easily trap in local minima without the constraint of local features. In this paper, an efficient and fully automatic 3D ear recognition system is proposed to address these issues. The system describes the 3D ear surface with a local feature--the Local Surface Variation (LSV), which is responsive to the concave and convex areas of the surface. Instead of being used to extract discrete key points, the LSV descriptor is utilized to eliminate redundancy flat non-ear data and get normalized and refined ear data. At the stage of recognition, only one-step modified iterative closest points using local surface variation (ICP-LSV) algorithm is proposed, which provides additional local feature information to the procedure of ear recognition to enhance both the matching accuracy and computational efficiency. On an Inter®Xeon®W3550, 3.07 GHz work station (DELL T3500, Beijing, China), the authors were able to extract features from a probe ear in 2.32 s match the ear with a gallery ear in 0.10 s using the method outlined in this paper. The proposed algorithm achieves rank-one recognition rate of 100% on the Chinese Academy of Sciences' Institute of Automation 3D Face database (CASIA-3D FaceV1, CASIA, Beijing, China, 2004) and 98.55% with 2.3% equal error rate (EER) on the Collection J2 of University of Notre Dame Biometrics Database (UND-J2, University of Notre Dame, South Bend, IN, USA, between 2003 and 2005). [ABSTRACT FROM AUTHOR]

In this paper, a flow shop scheduling problem with minimal and maximal machine idle time with the goal of minimizing makespan is considered. The mathematical model of the problem is presented. A generalization of the prefix sum, called the job shift scan, for computing required shifts for overlapping jobs is proposed. A work-efficient algorithm for computing the job shift scan in parallel for the PRAM model with n processors is proposed and its time complexity of O (log n) is proven. Then, an algorithm for computing the makespan in time O (m log n) in parallel using the prefix sum and job shift scan is proposed. Computer experiments on GPU were conducted using the CUDA platform. The results indicate multi-thread GPU vs. single-thread GPU speedups of up to 350 and 1000 for job shift scan and makespan calculation algorithms, respectively. Multi-thread GPU vs. single-thread CPU speedups up to 4.5 and 14.7, respectively, were observed as well. The experiments on the Taillard-based problem instances using a simulated annealing solving method and employing the parallel makespan calculation show that the method is able to perform many more iterations in the given time limit and obtain better results than the non-parallel version. [ABSTRACT FROM AUTHOR]

The generation of mathematical models for the analysis of buildings with multiple thermal zones is a large and complex task. Furthermore, the order and complexity of the dynamical model are increased by the number of included thermal zones. To overcome this problem, this paper presents an algorithm to define the mathematical model automatically, using the geometric and physics parameters as inputs. Additionally, the spatial position of each thermal zone must be recorded in an arrangement called a contact matrix. The algorithm for modeling systems with multiple thermal zones is the main contribution of this work. This algorithm is presented in pseudocode format and as an annex, an implementation in MATLAB software. One of the advantages of this methodology is that it allows us to work with parallelepipeds and not necessarily cubic thermal zones. The algorithm allows us to generate mathematical models with symbolic variables, starting from the knowledge of how many thermal zones compose the system and its geometric organization. This information must be organized in a matrix arrangement called a contact matrix. Different arrays of thermal zones were constructed with wooden boxes to verify the functionality of the models generated with the algorithm. Each case provided information that allowed us to adjust the mathematical models and their simulations, obtaining a range of errors between experimental and simulated temperatures from 2.08 to 5.6 , depending on the number of thermal zones studied. [ABSTRACT FROM AUTHOR]

Stochastic configuration network (SCN) is a mathematical model of incremental generation under a supervision mechanism, which has universal approximation property and advantages in data modeling. However, the efficiency of SCN is affected by some network parameters. An optimized searching algorithm for the input weights and biases is proposed in this paper. An optimization model with constraints is first established based on the convergence theory and inequality supervision mechanism of SCN; Then, a hybrid bat-particle swarm optimization algorithm (G-BAPSO) based on gradient information is proposed under the framework of PSO algorithm, which mainly uses gradient information and local adaptive adjustment mechanism characterized by pulse emission frequency to improve the searching ability. The algorithm optimizes the input weights and biases to improve the convergence rate of the network. Simulation results over some datasets demonstrate the feasibility and validity of the proposed algorithm. The training RMSE of G-BAPSO-SCN increased by 5.57 × 10 − 5 and 3.2 × 10 − 3 compared with that of SCN in the two regression experiments, and the recognition accuracy of G-BAPSO-SCN increased by 0.07% on average in the classification experiments. [ABSTRACT FROM AUTHOR]

Stereophonic audio devices employ two loudspeakers and two microphones in order to create a bidirectional sound effect. In this context, the stereophonic acoustic echo cancellation (SAEC) setup requires the estimation of four echo paths, each one corresponding to a loudspeaker-to-microphone pair. The widely linear (WL) model was proposed in recent literature in order to simplify the handling of the SAEC mathematical model. Moreover, low complexity recursive least- squares (RLS) adaptive algorithms were developed within the WL framework and successfully tested for SAEC scenarios. This paper proposes to apply a data-reuse (DR) approach for the combination between the RLS algorithm and the dichotomous coordinate descent (DCD) iterative method. The resulting WL-DR-RLS-DCD algorithm inherits the convergence properties of the RLS family and requires an amount of mathematical operations attractive for practical implementations. Simulation results show that the DR approach improves the tracking capabilities of the RLS-DCD algorithm, with an acceptable surplus in terms of computational workload. [ABSTRACT FROM AUTHOR]

Numerical methods have gained momentum among specific engineering problems that must be solved in such a manner that accuracy and speed are the two most important aspects to consider regarding the output. This paper presents a fast, semi-analytical method (SAM) and original mathematical algorithms to determine the pressure distribution and von Mises stress for spur gears' meshing teeth. The SAM begins with the Hartnett approach, based on Boussinesq's equation for the half-space theory of linear elasticity, which implicitly means an infinite width of the gear flank. To simulate more realistic quarter-space conditions, corrections based on virtual mirror pressure are introduced in the computational algorithm. Mathematical surfaces modeling is an important aspect for spur gears as an intermediate stage to determine the pressure distribution and von Mises stress. Shaft misalignment changes the contact problem from symmetric, in which the half- or quarter-space model can be used, to asymmetric. In the latter case, the model must determine the entire contact area. The obtained output is validated by comparisons between our original FEA results and results from the literature using SAMs and FEA. [ABSTRACT FROM AUTHOR]

Unmanned surface vehicle (USV) formation is a hot topic of current research. Path planning is the core technology for USV formation. This paper focuses on a USV formation path planning problem considering kinetic constraints. Firstly, an improved A* algorithm is proposed to solve the point-to-point path planning of a USV considering kinetic constraints. In this algorithm, the yaw constraint is introduced on top of the position constraint to extend the state space of the USV to three dimensions, and the convergence speed is accelerated by building a heuristic map. The dynamics model of the USV is used to generate the minimum trajectory elements to ensure that the path conforms to the kinetic constraints. Secondly, the mathematical model of USV formation based on the virtual structure method is established, and the path planning scheme of formation navigation and formation reconfiguration is given according to the improved A* algorithm. Finally, we carry out a USV model identification experiment for SL900 USV and simulation experiments based on the model. The experimental results show that the output path of the proposed method is smoother compared with the traditional method. This method can provide a globally safe path with kinetic constraints for USV formation navigation and formation reconstruction. [ABSTRACT FROM AUTHOR]

The wheel slide protection control system for rail vehicles plays a crucial role in ensuring a consistent braking performance in all operating environments, making it a vital factor in the safety and efficiency of rail transportation. In this paper, a hybrid approach to wheel slide protection control is presented, which combines the rule-based control strategy and the model-based control methods using adhesion force estimation. Model-based control usually relies on mathematical models to characterize the vehicle dynamics, requiring online estimators to be designed or extra sensors to be added for practical application. Rule-based control operates on predefined rules and thresholds and the available data from vehicles in service. A comparative test was conducted between the traditional rule-based control strategy and the proposed combined control strategy using a semi-physical simulation test bench. The performance differences of the control strategies were analyzed from two perspectives: adhesion utilization and air consumption. It was observed that among the traditional 2-phase, 3-phase, 4-phase and the optimized 4-phase combined control method, the combined control strategy has the best adhesion utilization and the traditional 4-phase control strategy has the least air consumption. [ABSTRACT FROM AUTHOR]

Brain tumors (BTs) are an uncommon but fatal kind of cancer. Therefore, the development of computer-aided diagnosis (CAD) systems for classifying brain tumors in magnetic resonance imaging (MRI) has been the subject of many research papers so far. However, research in this sector is still in its early stage. The ultimate goal of this research is to develop a lightweight effective implementation of the U-Net deep network for use in performing exact real-time segmentation. Moreover, a simplified deep convolutional neural network (DCNN) architecture for the BT classification is presented for automatic feature extraction and classification of the segmented regions of interest (ROIs). Five convolutional layers, rectified linear unit, normalization, and max-pooling layers make up the DCNN's proposed simplified architecture. The introduced method was verified on multimodal brain tumor segmentation (BRATS 2015) datasets. Our experimental results on BRATS 2015 acquired Dice similarity coefficient (DSC) scores, sensitivity, and classification accuracy of 88.8%, 89.4%, and 88.6% for high-grade gliomas. When it comes to segmenting BRATS 2015 BT images, the performance of our proposed CAD framework is on par with existing state-of-the-art methods. However, the accuracy achieved in this study for the classification of BT images has improved upon the accuracy reported in prior studies. Image classification accuracy for BRATS 2015 BT has been improved from 88% to 88.6%. [ABSTRACT FROM AUTHOR]

A huge amount of construction waste is generated in construction sites every day that needs to be transported by vehicle to disposal facilities for processing. Unlike in most typical transportation problems, once these vehicles are loaded with construction waste, they must travel directly to the disposal facility. Moreover, there are different types of construction waste that may require handling by different disposal facilities. In this paper, we develop a model and algorithm for identifying the optimal transportation routes specific to construction waste transportation. Our results can not only minimize the overall costs for both the logistics company and the contractor but also minimize the distance traveled, thus reducing urban traffic emissions. [ABSTRACT FROM AUTHOR]

In this paper, a fault-tolerant control method is proposed for a hexacopter under uncertainties. The proposed method is based on adaptive-sliding-mode control (ASMC) and a control allocation scheme. First, a mathematical model of the hexacopter is employed with model uncertainties. Next, the control allocation strategy is combined with ASMC to handle actuator faults, which can distribute the virtual control signal to redundant actuators. A modified fault-tolerant control is proposed to overcome this virtual input saturation. Finally, the system stability is validated using the Lyapunov theory. The performance of the proposed method is compared with that of normal ASMC. The simulation results show that the suggested strategy can realize quicker compensation under faulty conditions. [ABSTRACT FROM AUTHOR]

E-bikes, i.e., bikes equipped with a small electrical engine, are becoming increasingly widespread, thanks to their positive contribution to mobility and sustainability. A key component of an e-bike is the battery that feeds the drive unit: clearly, the higher the capacity of the battery, the longer the distances that the biker will cover under engine support. On the negative side, the additional weight incurred by the electric components is likely to ruin the riding experience in case the battery runs out of power. For this reason, an integrated hardware-software system that provides accurate information about the remaining range is essential, especially for older or "not-in-shape" bikers. Many e-bikes systems are already equipped with a small control unit that displays useful information, such as speed, instantaneous power consumption, and estimated range as well. Existing approaches rely on machine learning techniques applied to collected data, or even on the remaining battery capacity and the assistance level required by the drive unit. They do not consider crucial aspects of the planned route, in particular the difference in altitude, the combined weight of bike and biker, and road conditions. In this paper, we propose a mathematical model implemented in an application to compute battery consumption, and hence the presumed remaining range, in a more accurate way. Our application relies on external sources to compute the route and the elevation data of a number of intermediate points. We present the mathematical model on which our application is based, we show the implemented application in shape of an app, and we report the results of the experiments. [ABSTRACT FROM AUTHOR]

An iterative QR-based soft feedback segment interference cancellation (QRSFSIC) detection and decoder algorithm for a Reed-Muller (RM) space-time turbo system is proposed in this paper. It forms the sufficient statistic for the minimum-mean-square error (MMSE) estimate according to QR decomposition-based soft feedback successive interference cancellation, stemmed from the a priori log-likelihood ratio (LLR) of encoded bits. Then, the signal originating from the symbols of the reliable segment, the symbol reliability metric, in terms of an a posteriori LLR of encoded bits which is larger than a certain threshold, is iteratively cancelled with the QRSFSIC in order to further obtain the residual signal for evaluating the symbols in the unreliable segment. This is done until the unreliable segment is empty, resulting in the extrinsic information for a RM turbo-coded bit with the greatest likelihood. Bridged by de-multiplexing and multiplexing, an iterative QRSFSIC detection is concatenated with an iterative trellis-based maximum a posteriori probability RM turbo decoder as if a principal Turbo detection and decoder is embedded with an iterative subordinate QRSFSIC detection and a RM turbo decoder, exchanging each other's detection and decoding soft-decision information iteratively. These three stages let the proposed algorithm approach the upper bound of the diversity. The simulation results also show that the proposed scheme outperforms the other suboptimum detectors considered in this paper. [ABSTRACT FROM AUTHOR]

The purpose of this work is to present a new method for estimating the parameters of the biomass of agricultural crops based on Earth remote sensing (ERS) data. The method includes mathematical models and algorithms estimation and has been tested on the example of spring wheat sowing. Sowing biomass parameters are the basis for making management decisions aimed at obtaining a given crop yield. Currently, for these purposes, vegetation indices are most widely used. It is impossible to estimate the physical parameters of the crop sowing biomass using these indices, due to their scalar form and lack of dimension. The paper develops a classical approach to the problem of estimating the parameters of the state of agricultural crops, in which remote sensing data are considered as an indirect measurement of the estimated parameters. The basis for the implementation of the estimation method is the dynamic model of biomass parameters and the remote sensing model, which reflects the relationship between the spectral reflection parameters and the estimated parameters of the crop biomass. The parameters of the dynamic model and the remote sensing model are refined by selective ground measurements in separate elementary sections of the field. The difference between this article and previous works of a similar nature lies in the fact that agricultural crops with a more complex morphological structure are considered as the object of evaluation. In addition, such an important feature of agricultural objects as their spatial distribution is considered here. To take it into account, a new type of mathematical models is used, in which spatial coordinates are introduced. Due to the significant complication of modeling and estimation algorithms based on such models, simpler approximation schemes are proposed. The advantage of the proposed approach is that the assessment is considered as a dynamic process that meets the content of the task of monitoring crops. [ABSTRACT FROM AUTHOR]

The dynamics of the particle size distribution (PSD) of polydispersed fuel spray is important in the evaluation of the combustion process. A better understanding of the dynamics can provide a tool for selecting a PSD that will more effectively meet the needs of the system. In this paper, we present an efficient and elegant method for evaluating the dynamics of the PSD. New insights into the behaviour of polydispersed fuel spray were obtained. A simplified theoretical model was applied to the experimental data and a known approximation of the polydispersed fuel spray. This model can be applied to any distribution, not necessarily an experimental distribution or approximation, and involves a time-dependent function of the PSD. Such simplified models are particularly helpful in qualitatively understanding the effects of various sub-processes. Our main results show that during the self-ignition process, the radii of the droplets decreased as expected, and the number of smaller droplets increased in inverse proportion to the radius. An important novel result (visualised by graphs) demonstrates that the mean radius of the droplets initially increases for a relatively short period of time, which is followed by the expected decrease. Our modified algorithm is superior to the well-known 'parcel' approach because it is much more compact; it permits analytical study because the right-hand sides of the mathematical model are smooth, and thus eliminates the need for a numerical algorithm to transition from one parcel to another. Moreover, the method can provide droplet radii resolution dynamics because it can use step functions that accurately describe the evolution of the radii of the droplets. The method explained herein can be applied to any approximation of the PSD, and involves a comparatively negligible computation time. [ABSTRACT FROM AUTHOR]

The Ground-based Radio Navigation System (GRNS) is an alternative/backup navigation system based on time synchronized pseudolites. It has been studied for some years due to the potential vulnerability issue of satellite navigation systems (e.g., GPS or Galileo). In the framework of our study, a periodic pulsed sequence was used instead of the randomized pulse sequence recommended as the RTCM (radio technical commission for maritime services) SC (special committee)-104 pseudolite signal, as a randomized pulse sequence with a long dwell time is not suitable for applications requiring high dynamics. This paper introduces a mathematical model of the post-correlation output in a navigation sensor, showing that the aliasing caused by the additional frequency term of a periodic pulsed signal leads to a false lock (i.e., Doppler frequency bias) during the signal acquisition process or in the carrier tracking loop of the navigation sensor. We suggest algorithms to resolve the frequency false lock issue in this paper, relying on the use of a multi-correlator. A flight test with an unmanned helicopter was conducted to verify the implemented navigation sensor. The results of this analysis show that there were no false locks during the flight test and that outliers stem from bad dilution of precision (DOP) or fluctuations in the received signal quality. [ABSTRACT FROM AUTHOR]

Modeling of a time-varying dynamical system provides insights into the functions of biological neural networks and contributes to the development of next-generation neural prostheses. In this paper, we have formulated a novel sparse multiwavelet-based generalized Laguerre-Volterra (sMGLV) modeling framework to identify the time-varying neural dynamics from multiple spike train data. First, the significant inputs are selected by using a group least absolute shrinkage and selection operator (LASSO) method, which can capture the sparsity within the neural system. Second, the multiwavelet-based basis function expansion scheme with an efficient forward orthogonal regression (FOR) algorithm aided by mutual information is utilized to rapidly capture the time-varying characteristics from the sparse model. Quantitative simulation results demonstrate that the proposed sMGLV model in this paper outperforms the initial full model and the state-of-the-art modeling methods in tracking performance for various time-varying kernels. Analyses of experimental data show that the proposed sMGLV model can capture the timing of transient changes accurately. The proposed framework will be useful to the study of how, when, and where information transmission processes across brain regions evolve in behavior. [ABSTRACT FROM AUTHOR]

An energy storage system (ESS) in a power system facilitates tasks such as renewable integration, peak shaving, and the use of ancillary services. Among the various functions of an ESS, this study focused on frequency regulation (or secondary reserve). This paper presents an optimal scheduling algorithm for frequency regulation by an ESS. This algorithm determines the bidding capacity and base point of an ESS in each operational period to achieve the maximum profit within a stable state-of-charge (SOC) range. However, the charging/discharging efficiency of an ESS causes SOC errors whenever the ESS performs frequency regulation. With an increase in SOC errors, the ESS cannot respond to an automatic generation control (AGC) signal. This situation results in low ESS performance scores, and finally, the ESS is disqualified from performing frequency regulation. This paper also presents a real-time SOC management algorithm aimed at solving the SOC error problem in real-time operations. This algorithm compensates for SOC errors by changing the base point of the ESS. The optimal scheduling algorithm is implemented in MATLAB by using the particle swarm optimization (PSO) method. In addition, changes in the SOC when the ESS performs frequency regulation in a real-time operation are confirmed using the PSCAD/EMTDC tool. The simulation results show that the optimal scheduling algorithm manages the SOC more efficiently than a commonly employed planning method. In addition, the proposed real-time SOC management algorithm is confirmed to be capable of performing SOC recovery. [ABSTRACT FROM AUTHOR]

In this paper; we introduce an enhanced electromyography (EMG) pattern recognition algorithm based on a split-and-merge deep belief network (SM-DBN). Generally, it is difficult to classify the EMG features because the EMG signal has nonlinear and time-varying characteristics. Therefore, various machine-learning methods have been applied in several previously published studies. A DBN is a fast greedy learning algorithm that can identify a fairly good set of weights rapidly--even in deep networks with a large number of parameters and many hidden layers. To reduce overfitting and to enhance performance, the adopted optimization method was based on genetic algorithms (GA). As a result, the performance of the SM-DBN was 12.06% higher than conventional DBN. Additionally, SM-DBN results in a short convergence time, thereby reducing the training epoch. It is thus efficient in reducing the risk of overfitting. It is verified that the optimization was improved using GA. [ABSTRACT FROM AUTHOR]

Logistics plays an important role in the field of global economy, and the storage and retrieval of tasks in a warehouse which has symmetry is the most important part of logistics. Generally, the shelves of a warehouse have a certain degree of symmetry and similarity in their structure. The storage and retrieval efficiency directly affects the efficiency of logistics. The efficiency of the traditional storage and retrieval mode has become increasingly inconsistent with the needs of the industry. In order to solve this problem, this paper proposes a greedy algorithm based on cost matrix to solve the path planning problem of the automatic storage and retrieval system (AS/RS). Firstly, aiming at the path planning mathematical model of AS/RS, this paper proposes the concept of cost matrix, which transforms the traditional storage and retrieval problem into the element combination problem of cost matrix. Then, a more efficient backtracking algorithm is proposed based on the exhaustive method. After analyzing the performance of the backtracking algorithm, combined with some rules, a greedy algorithm which can further improve efficiency is proposed; the convergence of the improved greedy algorithm is also proven. Finally, through simulation, the time consumption of the greedy algorithm is only 0.59% of the exhaustive method, and compared with the traditional genetic algorithm, the time consumption of the greedy algorithm is about 50% of the genetic algorithm, and it can still maintain its advantage in time consumption, which proves that the greedy algorithm based on cost matrix has a certain feasibility and practicability in solving the path planning of the automatic storage and retrieval system. [ABSTRACT FROM AUTHOR]

Data has attributes, and synchronous changes between data and attributes are the basic characteristics of a type of data: under the condition of supplementing (deleting) some attributes, some data elements are deleted (supplemented) from data. The attributes of data elements follow the conjunctive normal form. Based on the dynamic mathematical model P-sets, firstly, the conception and generation criteria of embedded data are proposed, and the inference theory of embedded data are studied. Secondly, intelligent retrieval and retrieval theorems for embedded data are proposed. Then, intelligent retrieval and secure acquisition algorithms for embedded data are designed. Finally, an application example is presented. [ABSTRACT FROM AUTHOR]

The optimization problems in a fluid catalytic cracking process with dynamic constraints and conflicting objectives are challenging due to the complicated constraints and dynamic environments. The decision variables need to be reoptimized to obtain the best objectives when dynamic environments arise. To solve these problems, we established a mathematical model and proposed a dynamic constrained multiobjective optimization evolution algorithm for the fluid catalytic cracking process. In this algorithm, we design an offspring generation strategy based on minimax solutions, which can explore more feasible regions and converge quickly. Additionally, a dynamic response strategy based on population feasibility is proposed to improve the feasible and infeasible solutions by different perturbations, respectively. To verify the effectiveness of the algorithm, we test the algorithm on ten instances based on the hypervolume metric. Experimental results show that the proposed algorithm is highly competitive with several state-of-the-art competitors. [ABSTRACT FROM AUTHOR]

The sensor-weapon–target assignment (S-WTA) problem is a crucial decision issue in C4ISR. The cooperative engagement capability (CEC) of sensors and weapons depends on the S-WTA schemes, which can greatly affect the operational effectiveness. In this paper, a mathematical model based on the synthetical framework of the S-WTA problem is established, combining the dependent and independent cooperative engagement modes of sensors and weapons. As this problem is a complex combinatorial optimization problem, a novel genetic algorithm is proposed to improve the solution of this formulated S-WTA model. Based on the prior knowledge of this problem, a problem-specific population initialization method and two novel repair operators are introduced. The performances of the proposed algorithm have been validated on the known benchmarks. Extensive experimental studies compared with three state-of-the-art approaches demonstrate that the proposed algorithm can generate better assignment schemes for the most of the benchmarks. [ABSTRACT FROM AUTHOR]

In recent years, various applications regarding sparse continuous signal recovery such as source localization, radar imaging, communication channel estimation, etc., have been addressed from the perspective of compressive sensing (CS) theory. However, there are two major defects that need to be tackled when considering any practical utilization. The first issue is off-grid problem caused by the basis mismatch between arbitrary located unknowns and the pre-specified dictionary, which would make conventional CS reconstruction methods degrade considerably. The second important issue is the urgent demand for low-complexity algorithms, especially when faced with the requirement of real-time implementation. In this paper, to deal with these two problems, we have presented three fast and accurate sparse reconstruction algorithms, termed as HR-DCD, Hlog-DCD and Hlp -DCD, which are based on homotopy, dichotomous coordinate descent (DCD) iterations and non-convex regularizations, by combining with the grid refinement technique. Experimental results are provided to demonstrate the effectiveness of the proposed algorithms and related analysis. [ABSTRACT FROM AUTHOR]

The k-means problem has been paid much attention for many applications. In this paper, we define the uncertain constrained k-means problem and propose a (1 + ϵ) -approximate algorithm for the problem. First, a general mathematical model of the uncertain constrained k-means problem is proposed. Second, the random sampling properties of the uncertain constrained k-means problem are studied. This paper mainly studies the gap between the center of random sampling and the real center, which should be controlled within a given range with a large probability, so as to obtain the important sampling properties to solve this kind of problem. Finally, using mathematical induction, we assume that the first j − 1 cluster centers are obtained, so we only need to solve the j-th center. The algorithm has the elapsed time O ((1891 e k ϵ 2) 8 k / ϵ n d) , and outputs a collection of size O ((1891 e k ϵ 2) 8 k / ϵ n) of candidate sets including approximation centers. [ABSTRACT FROM AUTHOR]

This paper focuses on the investigation of a new efficient method for solving machine scheduling and sequencing problems. The complexity of production systems significantly affects companies, especially small- and medium-sized enterprises (SMEs), which need to reduce costs and, at the same time, become more competitive and increase their productivity by optimizing their production processes to make manufacturing processes more efficient. From a mathematical point of view, most real-world machine scheduling and sequencing problems are classified as NP-hard problems. Different algorithms have been developed to solve scheduling and sequencing problems in the last few decades. Thus, heuristic and metaheuristic techniques are widely used, as are commercial solvers. In this paper, we propose a matheuristic algorithm to optimize the job-shop problem which combines a genetic algorithm with a disjunctive mathematical model, and the Coin-OR Branch & Cut open-source solver is employed. The matheuristic algorithm allows efficient solutions to be found, and cuts computational times by using an open-source solver combined with a genetic algorithm. This provides companies with an easy-to-use tool and does not incur costs associated with expensive commercial software licenses. [ABSTRACT FROM AUTHOR]

Phasor measurement units (PMUs) are deployed at power grid nodes around the transmission grid, determining precise power system monitoring conditions. In real life, it is not realistic to place a PMU at every power grid node; thus, the lowest PMU number is optimally selected for the full observation of the entire network. In this study, the PMU placement model is reconsidered, taking into account single- and multi-capacity placement models rather than the well-studied PMU placement model with an unrestricted number of channels. A restricted number of channels per monitoring device is used, instead of supposing that a PMU is able to observe all incident buses through the transmission connectivity lines. The optimization models are declared closely to the power dominating set and minimum edge cover problem in graph theory. These discrete optimization problems are directly related with the minimum set covering problem. Initially, the allocation model is declared as a constrained mixed-integer linear program implemented by mathematical and stochastic algorithms. Then, the 0 / 1 integer linear problem is reformulated into a non-convex constraint program to find optimality. The mathematical models are solved either in binary form or in the continuous domain using specialized optimization libraries, and are all implemented in YALMIP software in conjunction with MATLAB. Mixed-integer linear solvers, nonlinear programming solvers, and heuristic algorithms are utilized in the aforementioned software packages to locate the global solution for each instance solved in this application, which considers the transformation of the existing power grids to smart grids. [ABSTRACT FROM AUTHOR]

The current trend of the civil aviation technology is to modernize the legacy air traffic control (ATC) system that is mainly supported by many ground based navigation aids to be the new air traffic management (ATM) system that is enabled by global positioning system (GPS) technology. Due to the low receiving power of GPS signal, it is a major concern to aviation authorities that the operation of the ATM system might experience service interruption when the GPS signal is jammed by either intentional or unintentional radio-frequency interference. To maintain the normal operation of the ATM system during the period of GPS outage, the use of the current radar system is proposed in this paper. However, the tracking performance of the current radar system could not meet the required performance of the ATM system, and an enhanced tracking algorithm, the interacting multiple model and probabilistic data association filter (IMMPDAF), is therefore developed to support the navigation and surveillance services of the ATM system. The conventional radar tracking algorithm, the nearest neighbor Kalman filter (NNKF), is used as the baseline to evaluate the proposed radar tracking algorithm, and the real flight data is used to validate the IMMPDAF algorithm. As shown in the results, the proposed IMMPDAF algorithm could enhance the tracking performance of the current aviation radar system and meets the required performance of the new ATM system. Thus, the current radar system with the IMMPDAF algorithm could be used as an alternative system to continue aviation navigation and surveillance services of the ATM system during GPS outage periods. [ABSTRACT FROM AUTHOR]

Based on information theory, the single neuron adaptive control problem for stochastic systems with non-Gaussian noises is investigated in this paper. Here, the statistic information of the output within a receding window rather than the output value is used for the tracking problem. Firstly, the single neuron controller structure, which has the ability of self-learning and self-adaptation, is established. Then, an improved performance criterion is given to train the weights of the single neuron. Furthermore, the mean-square convergent condition of the proposed control algorithm is formulated. Finally, comparative simulation results are presented to show that the proposed algorithm is superior to the PID controller. The contributions of this work are twofold: (1) the optimal control algorithm is formulated in the data-driven framework, which needn't the precise system model that is usually difficult to obtain; (2) the control problem of non-Gaussian systems can be effectively dealt with by the simple single neuron controller under improved minimum entropy criterion. [ABSTRACT FROM AUTHOR]

Principal–assistant agent teams are often employed to solve tasks in multiagent collaboration systems. Assistant agents attached to the principal agents are more flexible for task execution and can assist them to complete tasks with complex constraints. However, how to employ principal–assistant agent teams to execute time-critical tasks considering the dependency between agents and the constraints among tasks is still a challenge so far. In this paper, we investigate the principal–assistant collaboration problem with deadlines, which is to allocate tasks to suitable principal–assistant teams and construct routes satisfying the temporal constraints. Two cases are considered in this paper, including single principal–assistant teams and multiple principal–assistant teams. The former is formally formulated in an arc-based integer linear programming model. We develop a hybrid combination algorithm for adapting larger scales, the idea of which is to find an optimal combination of partial routes generated by heuristic methods. The latter is defined in a path-based integer linear programming model, and a branch-and-price-based (BP-based) algorithm is proposed that introduces the number of assistant-accessible tasks surrounding a task to guide the route construction. Experimental results validate that the hybrid combination algorithm and the BP-based algorithm are superior to the benchmarks in terms of the number of served tasks and the running time. [ABSTRACT FROM AUTHOR]

The paper investigates an algorithm for the numerical solution of a parametric eigenvalue problem for the Helmholtz equation on the plane specially tailored for the accurate mathematical modeling of lasing modes of microring lasers. The original problem is reduced to a nonlinear eigenvalue problem for a system of Muller boundary integral equations. For the numerical solution of the obtained problem, we use a trigonometric Galerkin method, prove its convergence, and derive error estimates in the eigenvalue and eigenfunction approximation. Previous numerical experiments have shown that the method converges exponentially. In the current paper, we prove that if the generalized eigenfunctions are analytic, then the approximate eigenvalues and eigenfunctions exponentially converge to the exact ones as the number of basis functions increases. To demonstrate the practical effectiveness of the algorithm, we find geometrical characteristics of microring lasers that provide a significant increase in the directivity of lasing emission, while maintaining low lasing thresholds. [ABSTRACT FROM AUTHOR]

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the initial value of the KP parameter. In addition, a new diagonal recurrence relation is introduced and used in the proposed algorithm. The diagonal recurrence algorithm was derived from the existing n direction and x direction recurrence algorithms. The diagonal and existing recurrence algorithms were subsequently exploited to compute the KP coefficients. First, the KP coefficients were computed for one partition after dividing the KP plane into four. To compute the KP coefficients in the other partitions, the symmetry relations were exploited. The performance evaluation of the proposed recurrence algorithm was determined through different comparisons which were carried out in state-of-the-art works in terms of reconstruction error, polynomial size, and computation cost. The obtained results indicate that the proposed algorithm is reliable and computes lesser coefficients when compared to the existing algorithms across wide ranges of parameter values of p and polynomial sizes N. The results also show that the improvement ratio of the computed coefficients ranges from 18.64% to 81.55% in comparison to the existing algorithms. Besides this, the proposed algorithm can generate polynomials of an order ∼8.5 times larger than those generated using state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Fuzzy goal programming has important applications in many areas of supply chain, logistics, transportation and shipping business. Business management has complications, and there exist many interactions between the factors of its components. The locomotive of world trade is maritime transport and approximately 90% of the products in the world are transported by sea. Optimization of maritime operations is a challenge in order to provide technical, operational and financial benefits. Fuzzy goal programming models attract interests of many scholars, therefore the objective of this paper is to investigate the problem of minimization of total cost and minimization of loss or damage of containers returned from destination port. There are various types of fuzzy goal programming problems based on models and solution methods. This paper employs fuzzy goal programming with triangular fuzzy numbers, membership functions, constraints, assumptions as well as the variables and parameters for optimizing the solution of the model problem. The proposed model presents the mathematical algorithm, and reveals the optimal solution according to satisfaction rank from 0 to 1. Providing a theoretical background, this study offers novel ideas to researchers, decision makers and authorities. [ABSTRACT FROM AUTHOR]

Traditional detectors for spectrum sensing in cognitive radio networks always become disabled when noise uncertainty is severe. Shannon entropy-based detection methods have aroused widespread attention in recent years due to the characteristics of effective anti-noise uncertainty. However, in existing entropy-based sensing schemes, the uniform quantization method cannot guarantee the maximum entropy distribution when primary users do not exist, and cannot effectively distinguish between two hypotheses, which severely limits the promotion of detection performance. Moreover, the Shannon entropy-based sensing schemes are prone to misconvergence occurring when estimating entropy values, thus causing failure detection, which leads to system detection inefficiency and resource waste. These are the two major serious defects in Shannon entropy-based detectors, which restrict the performance improvement. In this paper, a novel non-uniform quantized exponential entropy-based (NQEE) detector is proposed for local sensing to deal with the problems of maximum entropy distribution and detection failure. To further improve the reliability of the detection, a collaborative spectrum sensing algorithm based on an NQEE detector with multiple fusion rules is presented. Simulation results verify that the detection performance of the improved local entropy-based detector is superior to the existing Shannon entropy-based detectors and is proved to be robust to noise power uncertainty. In addition, the novel collaborative detection algorithm outperforms the traditional collaborative spectrum detection method to a great degree. [ABSTRACT FROM AUTHOR]