Search

A deep learning-based Visual Inertial SLAM technique is proposed in this paper to ensure accurate autonomous localization of mobile robots in environments with dynamic objects. Addressing the limitations of real-time performance in deep learning algorithms and the poor robustness of pure visual geometry algorithms, this paper presents a deep learning-based Visual Inertial SLAM technique. Firstly, a non-blocking model is designed to extract semantic information from images. Then, a motion probability hierarchy model is proposed to obtain prior motion probabilities of feature points. For image frames without semantic information, a motion probability propagation model is designed to determine the prior motion probabilities of feature points. Furthermore, considering that the output of inertial measurements is unaffected by dynamic objects, this paper integrates inertial measurement information to improve the estimation accuracy of feature point motion probabilities. An adaptive threshold-based motion probability estimation method is proposed, and finally, the positioning accuracy is enhanced by eliminating feature points with excessively high motion probabilities. Experimental results demonstrate that the proposed algorithm achieves accurate localization in dynamic environments while maintaining real-time performance. [ABSTRACT FROM AUTHOR]

Link prediction aims to identify unknown or missing connections in a network. The methods based on network structure similarity, known for their simplicity and effectiveness, have garnered widespread attention. A core metric in these methods is "proximity", which measures the similarity or linking probability between two nodes. These methods generally operate under the assumption that node pairs with higher proximity are more likely to form new connections. However, the accuracy of existing node proximity-based link prediction algorithms requires improvement. To address this, this paper introduces a Link Prediction Algorithm Based on Weighted Local and Global Closeness (LGC). This algorithm integrates the clustering coefficient to enhance prediction accuracy. A significant advantage of LGC is its dual consideration of a network's local and global features, allowing for a more precise assessment of node similarity. In experiments conducted on ten real-world datasets, the proposed LGC algorithm outperformed eight traditional link prediction methods, showing notable improvements in key evaluation metrics, namely precision and AUC. [ABSTRACT FROM AUTHOR]

Simple Summary: Cancer is basically a tough condition on a patient's body where cell grows uncontrollably. Normal cells are affected, which destroys the health of the patient. The main problem in cancer is spreading from one part to another. Therefore, the mathematical modeling of cancerous tumors integrates to check overall stability. A novel approach is introduced such as Bernstein polynomial with combination of genetic algorithm, sliding mode controller, and synergetic control. The proposed solution has easily eliminated cancerous cells within five days using synergetic control. In addition, five cases are incorporated to evaluate error function. In addition, a brief comparative study is added to contrast the simulation results with theoretical modeling. Cancerous tumor cells divide uncontrollably, which results in either tumor or harm to the immune system of the body. Due to the destructive effects of chemotherapy, optimal medications are needed. Therefore, possible treatment methods should be controlled to maintain the constant/continuous dose for affecting the spreading of cancerous tumor cells. Rapid growth of cells is classified into primary and secondary types. In giving a proper response, the immune system plays an important role. This is considered a natural process while fighting against tumors. In recent days, achieving a better method to treat tumors is the prime focus of researchers. Mathematical modeling of tumors uses combined immune, vaccine, and chemotherapies to check performance stability. In this research paper, mathematical modeling is utilized with reference to cancerous tumor growth, the immune system, and normal cells, which are directly affected by the process of chemotherapy. This paper presents novel techniques, which include Bernstein polynomial (BSP) with genetic algorithm (GA), sliding mode controller (SMC), and synergetic control (SC), for giving a possible solution to the cancerous tumor cells (CCs) model. Through GA, random population is generated to evaluate fitness. SMC is used for the continuous exponential dose of chemotherapy to reduce CCs in about forty-five days. In addition, error function consists of five cases that include normal cells (NCs), immune cells (ICs), CCs, and chemotherapy. Furthermore, the drug control process is explained in all the cases. In simulation results, utilizing SC has completely eliminated CCs in nearly five days. The proposed approach reduces CCs as early as possible. [ABSTRACT FROM AUTHOR]

This paper generalizes the structural Markov properties for undirected decomposable graphs to arbitrary ones. This helps us to exploit the conditional independence properties of joint prior laws to analyze and compare multiple graphical structures, while being able to take advantage of the common conditional independence constraints. This work provides a theoretical support for full Bayesian posterior updating about the structure of a graph using data from a certain distribution. We further investigate the ratio of graph law so as to simplify the acceptance probability of the Metropolis–Hastings sampling algorithms. [ABSTRACT FROM AUTHOR]

UAV trajectory planning is one of the research focuses in artificial intelligence and UAV technology. The asymmetric information, however, will lead to the uncertainty of the UAV trajectory planning; the probability theory as the most commonly used method to solve the trajectory planning problem in uncertain environment will lead to unrealistic conclusions under the condition of lacking samples, while the uncertainty theory based on uncertain measures is an efficient method to solve such problems. Firstly, the uncertainties in trajectory planning are sufficiently considered in this paper; the fuel consumption, concealment and threat degree with uncertain variables are taken as the objective functions; the constraints are analyzed according to the maneuverability; and the uncertain multi-objective trajectory planning (UMOTP) model is established. After that, this paper takes both the long-term benefits and its stability into account, and then, the expected-value and standard-deviation efficient trajectory model is established. What is more, this paper solves the Pareto front of the trajectory planning, satisfying various preferences, which avoids the defects of the trajectory obtained by traditional model only applicable to a certain specific situation. In order to obtain a better solution set, this paper proposes an improved backbones particle swarm optimization algorithm based on PSO and NSGA-II, which overcomes the shortcomings of the traditional algorithm such as premature convergence and poor robustness, and the efficiency of the algorithm is tested. Finally, the algorithm is applied to the UMOTP problem; then, the optimal trajectory set is obtained, and the effectiveness and reliability of the model is verified. [ABSTRACT FROM AUTHOR]

Kullback–Leibler divergence K L (p , q) is the standard measure of error when we have a true probability distribution p which is approximate with probability distribution q. Its efficient computation is essential in many tasks, as in approximate computation or as a measure of error when learning a probability. In high dimensional probabilities, as the ones associated with Bayesian networks, a direct computation can be unfeasible. This paper considers the case of efficiently computing the Kullback–Leibler divergence of two probability distributions, each one of them coming from a different Bayesian network, which might have different structures. The paper is based on an auxiliary deletion algorithm to compute the necessary marginal distributions, but using a cache of operations with potentials in order to reuse past computations whenever they are necessary. The algorithms are tested with Bayesian networks from the bnlearn repository. Computer code in Python is provided taking as basis pgmpy, a library for working with probabilistic graphical models. [ABSTRACT FROM AUTHOR]

The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is O(nΔ·max1≤i≤n{ui}), where ui is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based (1 + pmin)-approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributedO(1)-approximation algorithm with time complexity O(1) is proposed. Experimental results show that the proposed algorithms have better performance. [ABSTRACT FROM AUTHOR]

In multi-target tracking, the key problem lies in estimating the number and states of individual targets, in which the challenge is the time-varying multi-target numbers and states. Recently, several multi-target tracking approaches, based on the sequential Monte Carlo probability hypothesis density (SMC-PHD) filter, have been presented to solve such a problem. However, most of these approaches select the transition density as the importance sampling (IS) function, which is inefficient in a nonlinear scenario. To enhance the performance of the conventional SMC-PHD filter, we propose in this paper two approaches using the cubature information filter (CIF) for multi-target tracking. More specifically, we first apply the posterior intensity as the IS function. Then, we propose to utilize the CIF algorithm with a gating method to calculate the IS function, namely CISMC-PHD approach. Meanwhile, a fast implementation of the CISMC-PHD approach is proposed, which clusters the particles into several groups according to the Gaussian mixture components. With the constructed components, the IS function is approximated instead of particles. As a result, the computational complexity of the CISMC-PHD approach can be significantly reduced. The simulation results demonstrate the effectiveness of our approaches. [ABSTRACT FROM AUTHOR]

Recently, developing efficient processing techniques in spatio-temporal databases has been a much discussed topic. Many applications, such as mobile information systems, traffic control system, and geographical information systems, can benefit from efficient processing of spatio-temporal queries. In this paper, we focus on processing an important type of spatio-temporal queries, the K-nearest neighbor (KNN) queries. Different from the previous research, the locations of objects are located by the sensors which are deployed in a grid-based manner. As the positioning technique used is not the GPS technique, but the sensor network technique, this results in a greater uncertainty regarding object location. With the uncertain location information of objects, we try to develop an efficient algorithm to process the KNN queries. Moreover, we design a probability model to quantify the possibility of each object being the query result. Finally, extensive experiments are conducted to demonstrate the efficiency of the proposed algorithms. [ABSTRACT FROM AUTHOR]

Fault diagnosis in multistage manufacturing processes (MMPs) is a challenging task where most of the research presented in the literature considers a predefined inspection scheme to identify the sources of variation and make the process diagnosable. In this paper, a sequential inspection procedure to detect the process fault based on a sequential testing algorithm and a minimum monitoring system is proposed. After the monitoring system detects that the process is out of statistical control, the features to be inspected (end of line or in process measurements) are defined sequentially according to the expected information gain of each potential inspection measurement. A case study is analyzed to prove the benefits of this approach with respect to a predefined inspection scheme and a randomized sequential inspection considering both the use and non-use of fault probabilities from historical maintenance data. [ABSTRACT FROM AUTHOR]

Lattices used in cryptography are integer lattices. Defining and generating a "random integer lattice" are interesting topics. A generation algorithm for a random integer lattice can be used to serve as a random input of all the lattice algorithms. In this paper, we recall the definition of the random integer lattice given by G. Hu et al. and present an improved generation algorithm for it via the Hermite normal form. It can be proven that with probability ≥0.99, this algorithm outputs an n-dim random integer lattice within O (n 2) operations. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of optimal routing for the pair of two-server heterogeneous queues operating in parallel and subsequent optimal allocation of customers between the servers in each queue. Heterogeneity implies different servers in terms of speed of service. An open-loop control assumes the static resource allocation when a router has no information about the state of the system. We discuss here the algorithm to calculate the optimal routing policy based on specially constructed Markov-modulated Poisson processes. As an alternative static policy, we consider an optimal Bernoulli splitting which prescribes the optimal allocation probabilities. Then, we show that the optimal allocation policy between the servers within each queue is of threshold type with threshold levels depending on the queue length and phase of an arrival process. This dependence can be neglected by using a heuristic threshold policy. A number of illustrative examples show interesting properties of the systems operating under the introduced policies and their performance characteristics. [ABSTRACT FROM AUTHOR]

In a health management system, prognostics, which is an engineering discipline that predicts a system's future health, is an important aspect yet there is currently limited research in this field. In this paper, a hybrid approach for prognostics is proposed. The approach combines the least squares support vector regression (LSSVR) with the hidden Markov model (HMM). Features extracted from sensor signals are used to train HMMs, which represent different health levels. A LSSVR algorithm is used to predict the feature trends. The LSSVR training and prediction algorithms are modified by adding new data and deleting old data and the probabilities of the predicted features for each HMM are calculated based on forward or backward algorithms. Based on these probabilities, one can determine a system's future health state and estimate the remaining useful life (RUL). To evaluate the proposed approach, a test was carried out using bearing vibration signals. Simulation results show that the LSSVR/HMM approach can forecast faults long before they occur and can predict the RUL. Therefore, the LSSVR/HMM approach is very promising in the field of prognostics. [ABSTRACT FROM AUTHOR]

In order to provide the seamless navigation and positioning services for indoor environments, an indoor location based service (LBS) test bed is developed to integrate the indoor positioning system and the indoor three-dimensional (3D) geographic information system (GIS). A wireless sensor network (WSN) is used in the developed indoor positioning system. Considering the power consumption, in this paper the ZigBee radio is used as the wireless protocol, and the received signal strength (RSS) fingerprinting positioning method is applied as the primary indoor positioning algorithm. The matching processes of the user location include the nearest neighbor (NN) algorithm, the K-weighted nearest neighbors (KWNN) algorithm, and the probabilistic approach. To enhance the positioning accuracy for the dynamic user, the particle filter is used to improve the positioning performance. As part of this research, a 3D indoor GIS is developed to be used with the indoor positioning system. This involved using the computer-aided design (CAD) software and the virtual reality markup language (VRML) to implement a prototype indoor LBS test bed. Thus, a rapid and practical procedure for constructing a 3D indoor GIS is proposed, and this GIS is easy to update and maintenance for users. The building of the Department of Aeronautics and Astronautics at National Cheng Kung University in Taiwan is used as an example to assess the performance of various algorithms for the indoor positioning system. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid classifier for polarimetric SAR images. The feature sets consist of span image, the H/A/α decomposition, and the GLCM-based texture features. Then, a probabilistic neural network (PNN) was adopted for classification, and a novel algorithm proposed to enhance its performance. Principle component analysis (PCA) was chosen to reduce feature dimensions, random division to reduce the number of neurons, and Brent's search (BS) to find the optimal bias values. The results on San Francisco and Flevoland sites are compared to that using a 3-layer BPNN to demonstrate the validity of our algorithm in terms of confusion matrix and overall accuracy. In addition, the importance of each improvement of the algorithm was proven. [ABSTRACT FROM AUTHOR]

Noise radars employ random waveforms in their transmission as compared to traditional radars. Considered as enhanced Low Probability of Intercept (LPI) radars, they are resilient to interference and jamming and less vulnerable to adversarial exploitation than conventional radars. At its simplest, using a random waveform such as bandpass Gaussian noise as a probing signal provides limited radar performance. After a concise review of a particular noise radar architecture and related correlation processing, this paper justifies the rationale for having synthetic (tailored) noise waveforms and proposes the Combined Spectral Shaping and Peak-to-Average Power Reduction (COSPAR) algorithm, which can be utilized for synthesizing noise-like sequences with a Taylor-shaped spectrum under correlation sidelobe level constraints and assigned Peak-to-Average-Power-Ratio (PAPR). Additionally, the Spectral Kurtosis measure is proposed to evaluate the LPI property of waveforms, and experimental results from field trials are reported. [ABSTRACT FROM AUTHOR]

In order to minimize the influence of decorrelation noise on multi-temporal interferometric synthetic aperture radar (MT-InSAR) applications, a series of phase reconstruction methods have been proposed in recent years. Unfortunately, current phase reconstruction methods generally exhibit a low computational efficiency due to their high non-linearity, in particular in the case that the dimension of a SAR stack is high. In this paper, a new approach is proposed to efficiently resolve phase reconstruction problems. This approach is inspired by the theory of probabilistic principle component analysis. A complex valued probability generative model is constructed to portray a phase reconstruction process. Moreover, in order to resolve such a model, a targeted algorithm based on the idea of expectation maximization is designed and implemented. For validation purposes, the proposed approach is compared to the traditional eigenvalue decomposition-based method by using simulated data and 101 real Sentinel-1A SAR images. The experimental results demonstrate that the proposed method can accelerate the phase reconstruction process drastically, in particular when a high-dimensional SAR stack is required to be processed. [ABSTRACT FROM AUTHOR]

In the present paper, a novel approach is introduced for the study, estimation and exact tracking of the finite precision error generated and accumulated during any number of multiplications. It is shown that, as a rule, this operation is very "toxic", in the sense that it may force the finite precision error accumulation to grow arbitrarily large, under specific conditions that are fully described here. First, an ensemble of definitions of general applicability is given for the rigorous determination of the number of erroneous digits accumulated in any quantity of an arbitrary algorithm. Next, the exact number of erroneous digits produced in a single multiplication is given as a function of the involved operands, together with formulae offering the corresponding probabilities. In case the statistical properties of these operands are known, exact evaluation of the aforementioned probabilities takes place. Subsequently, the statistical properties of the accumulated finite precision error during any number of successive multiplications are explicitly analyzed. A method for exact tracking of this accumulated error is presented, together with associated theorems. Moreover, numerous dedicated experiments are developed and the corresponding results that fully support the theoretical analysis are given. Eventually, a number of important, probable and possible applications is proposed, where all of them are based on the methodology and the results introduced in the present work. The proposed methodology is expandable, so as to tackle the round-off error analysis in all arithmetic operations. [ABSTRACT FROM AUTHOR]

This paper employs Bayesian probability theory for analyzing data generated in femtosecond pump-probe photoelectron-photoion coincidence (PEPICO) experiments. These experiments allow investigating ultrafast dynamical processes in photoexcited molecules. Bayesian probability theory is consistently applied to data analysis problems occurring in these types of experiments such as background subtraction and false coincidences. We previously demonstrated that the Bayesian formalism has many advantages, amongst which are compensation of false coincidences, no overestimation of pump-only contributions, significantly increased signal-to-noise ratio, and applicability to any experimental situation and noise statistics. Most importantly, by accounting for false coincidences, our approach allows running experiments at higher ionization rates, resulting in an appreciable reduction of data acquisition times. In addition to our previous paper, we include fluctuating laser intensities, of which the straightforward implementation highlights yet another advantage of the Bayesian formalism. Our method is thoroughly scrutinized by challenging mock data, where we find a minor impact of laser fluctuations on false coincidences, yet a noteworthy influence on background subtraction. We apply our algorithm to data obtained in experiments and discuss the impact of laser fluctuations on the data analysis. [ABSTRACT FROM AUTHOR]

In health sciences, identifying the leading causes that govern the behaviour of a response variable is a question of crucial interest. Formally, this can be formulated as a variable selection problem. In this paper, we introduce the basic concepts of the Bayesian approach for variable selection based on model choice, emphasizing the model space prior adoption and the algorithms for sampling from the model space and for posterior probabilities approximation; and show its application to two common problems in health sciences. The first concerns a problem in the field of genetics while the second is a longitudinal study in cardiology. In the context of these applications, considerations about control for multiplicity via the prior distribution over the model space, linear models in which the number of covariates exceed the sample size, variable selection with censored data, and computational aspects are discussed. The applications presented here also have an intrinsic statistical interest as the proposed models go beyond the standard general linear model. We believe this work will broaden the access of practitioners to Bayesian methods for variable selection. [ABSTRACT FROM AUTHOR]

In data clustering, the measured data are usually regarded as uncertain data. As a probability-based clustering technique, possible world can easily cluster the uncertain data. However, the method of possible world needs to satisfy two conditions: determine the data of different possible worlds and determine the corresponding probability of occurrence. The existing methods mostly make multiple measurements and treat each measurement as deterministic data of a possible world. In this paper, a possible world-based fusion estimation model is proposed, which changes the deterministic data into probability distribution according to the estimation algorithm, and the corresponding probability can be confirmed naturally. Further, in the clustering stage, the Kullback–Leibler divergence is introduced to describe the relationships of probability distributions among different possible worlds. Then, an application in wearable body networks (WBNs) is given, and some interesting conclusions are shown. Finally, simulations show better performance when the relationships between features in measured data are more complex. [ABSTRACT FROM AUTHOR]

As multimedia traffic has been increasing and is expected to grow more sharply, various technologies using caches have been attracting lots of attention. As one breakthrough technology to deal with the explosively growing traffic, exclusive OR (XOR)-based index coding has been widely investigated because it can greatly enhance the efficiency of network resource by reducing the number of transmissions. In this paper, we investigate how to apply XOR-based index coding to large-scaled practical streaming systems for video traffic that accounts for more than 70% of total Internet traffic. Contrary to most previous studies that have focused on theoretical analysis of optimal performance or development of optimal index coding schemes, our study proposes a new XOR coding-based video streaming (XC). We also propose a new grouping algorithm for creating XC groups while guaranteeing the complete backward compatibility of XC with existing streaming schemes such as unicast (UC), multicast (MC), and broadcast (BC). The performance of the proposed scheme is analyzed in two steps. First, the behavior of video contents in caches at clients is modeled as a Markov chain, and the steady-state probabilities and caching probabilities for each piece of video content are derived. Based on the probabilities, the performance of the proposed system is then analyzed in terms of the average number of connections that each client requires in order to receive one video content. Our numerical results show that the proposed video streaming scheme using XC can reduce the average number of transmissions by up to 18%, compared to the conventional scheme. [ABSTRACT FROM AUTHOR]

Probability of collision between non-cooperative space object (NCSO) and the reference spacecraft (RS) has been increased drastically over the past few decades. The traditional method is difficult to identify the maneuvering of non-cooperative space object. In the present paper, not only positions and velocities, but also accelerations of non-cooperative space object are estimated as parameters by the extended Kalman filtering based on setting up the state linear equation and measurement model of the non-cooperative space object. The algorithm for predicting collision probability is derived from position error ellipsoid, and the algorithm for determining maneuvering probability is derived from maneuvering acceleration and its error ellipsoid, which can be employed to identify whether the upcoming space object is being maneuvered. An epoch Earth-centered inertial (EECI) coordinate system is suggested to replace Earth-centered inertial (ECI) to simplify coordinate transformation. Finally, a set of simulations were conducted to validate the proposed algorithms with the simulated measurement data of the reference spacecraft space-borne millimeter-wave (MMW) radar. [ABSTRACT FROM AUTHOR]

About a decade ago, the PERTI algorithm was launched as a tool for a data-adaptive probability-based analysis of electrical resistivity tomography datasets. It proved to be an easy and versatile inversion method providing estimates of the resistivity values within a surveyed volume as weighted averages of the whole apparent resistivity dataset. In this paper, with the aim of improving the interpretative process, the PERTI method is extended by exploiting some peculiar aspects of the general theory of probability. Bernoulli's conceptual scheme is assumed to comply with any resistivity dataset, which allows a multiplicity of mutually independent subsets to be extracted and analysed singularly. A standard least squares procedure is at last adopted for the statistical determination of the model resistivity at each point of the surveyed volume as the slope of a linear equation that relates the multiplicity of the resistivity estimates from the extracted data subsets. A 2D synthetic test and a field apparent resistivity dataset collected for archaeological purposes are discussed using the new extended PERTI (E-PERTI) approach. The comparison with the results from the original PERTI shows that by the E-PERTI approach a significantly greater robustness against noise can be achieved, besides a general optimisation of the estimates of the most probable resistivity values. [ABSTRACT FROM AUTHOR]

Recognizing the characteristics of a well-developed running style is a central issue in athletic sub-disciplines. The development of portable micro-electro-mechanical-system (MEMS) sensors within the last decades has made it possible to accurately quantify movements. This paper introduces an analysis method, based on limit-cycle attractors, to identify subjects by their specific running style. The movement data of 30 athletes were collected over 20 min. in three running sessions to create an individual gaitprint. A recognition algorithm was applied to identify each single individual as compared to other participants. The analyses resulted in a detection rate of 99% with a false identification probability of 0.28%, which demonstrates a very sensitive method for the recognition of athletes based solely on their running style. Further, it can be seen that these differentiations can be described as individual modifications of a general running pattern inherent in all participants. These findings open new perspectives for the assessment of running style, motion in general, and a person's identification, in, for example, the growing e-sports movement. [ABSTRACT FROM AUTHOR]

Digital flicker detection devices need to store a large amount of evaluation data during measurement process, which leads to high requirements for hardware resources and algorithm execution efficiency. In this paper, a digital flicker detection method based on probability resampling is studied. In particular, before statistical evaluation, probability resampling is applied to screen the instantaneous flicker visual sensitivity data to compress redundant data. Additionally, the effectiveness of the method was numerically simulated and experimentally tested. The results show that the proposed method can accurately measure the voltage flicker value and can effectively compress the redundant evaluation data to be evaluated and has significant advantages in releasing hardware storage space, in improving algorithm execution efficiency and real-time performance, and in reducing processor workload. This method provides an engineering application reference for designing digital flicker detectors, especially for the software upgrade of traditional power quality testing equipment. [ABSTRACT FROM AUTHOR]

The Jensen–Shannon divergence is a renown bounded symmetrization of the Kullback–Leibler divergence which does not require probability densities to have matching supports. In this paper, we introduce a vector-skew generalization of the scalar α -Jensen–Bregman divergences and derive thereof the vector-skew α -Jensen–Shannon divergences. We prove that the vector-skew α -Jensen–Shannon divergences are f-divergences and study the properties of these novel divergences. Finally, we report an iterative algorithm to numerically compute the Jensen–Shannon-type centroids for a set of probability densities belonging to a mixture family: This includes the case of the Jensen–Shannon centroid of a set of categorical distributions or normalized histograms. [ABSTRACT FROM AUTHOR]

In this paper, we prove recursive formulas for ultimate time survival probability when three random claims X , Y , Z in the discrete time risk model occur in a special way. Namely, we suppose that claim X occurs at each moment of time t ∈ { 1 , 2 , ... } , claim Y additionally occurs at even moments of time t ∈ { 2 , 4 , ... } and claim Z additionally occurs at every moment of time, which is a multiple of three t ∈ { 3 , 6 , ... } . Under such assumptions, the model that is obtained is called the three-risk discrete time model. Such a model is a particular case of a nonhomogeneous risk renewal model. The sequence of claims has the form { X , X + Y , X + Z , X + Y , X , X + Y + Z , ... } . Using the recursive formulas, algorithms were developed to calculate the exact values of survival probabilities for the three-risk discrete time model. The running of algorithms is illustrated via numerical examples. [ABSTRACT FROM AUTHOR]

The usage of multiple flow tables (MFT) has significantly extended the flexibility and applicability of software-defined networking (SDN). However, the size of MFT is usually limited due to the use of expensive ternary content addressable memory (TCAM). Moreover, the pipeline mechanism of MFT causes long flow processing time. In this paper a novel approach called Agg-ExTable is proposed to efficiently manage the MFT. Here the flow entries in MFT are periodically aggregated by applying pruning and the Quine–Mccluskey algorithm. Utilizing the memory space saved by the aggregation, a front-end ExTable is constructed, keeping popular flow entries for early match. Popular entries are decided by the Hidden Markov model based on the match frequency and match probability. Computer simulation reveals that the proposed scheme is able to save about 45% of space of MFT, and efficiently decrease the flow processing time compared to the existing schemes. [ABSTRACT FROM AUTHOR]

The ground Penetrating Radar (GPR) is a promising remote sensing modality for Antipersonnel Mine (APM) detection. However, detection of the buried APMs are impaired by strong clutter, especially the reflection caused by rough ground surfaces. In this paper, we propose a novel clutter suppression method taking advantage of the low-rank and sparse structure in multidimensional data, based on which an efficient target detection can be accomplished. We firstly created a multidimensional image tensor using sub-band GPR images that are computed from the band-pass filtered GPR signals, such that differences of the target response between sub-bands can be captured. Then, exploiting the low-rank and sparse property of the image tensor, we use the recently proposed Tensor Robust Principal Analysis to remove clutter by decomposing the image tensor into three components: a low-rank component containing clutter, a sparse component capturing target response, and noise. Finally, target detection is accomplished by applying thresholds to the extracted target image. Numerical simulations and experiments with different GPR systems are conducted. The results show that the proposed method effectively improves signal-to-clutter ratio by more than 20 dB and yields satisfactory results with high probability of detection and low false alarm rates. [ABSTRACT FROM AUTHOR]

Incorporating obstacle information into maneuvering target-tracking algorithms may lead to a better performance when the target when the target maneuver is caused by avoiding collision with obstacles. In this paper, we propose a fuzzy-logic-based method incorporating new obstacle information into the interacting multiple-model (IMM) algorithm (FOIA-MM). We use convex polygons to describe the obstacles and then extract the distance from and the field angle of these obstacle convex polygons to the predicted target position as obstacle information. This information is fed to two fuzzy logic inference systems; one system outputs the model weights to their probabilities, the other yields the expected sojourn time of the models for the transition probability matrix assignment. Finally, simulation experiments and an Unmanned Aerial Vehicle experiment are carried out to demonstrate the efficiency and effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we study the multi-sensor multi-target tracking problem in the formulation of random finite sets. The Gaussian Mixture probability hypothesis density (GM-PHD) method is employed to formulate the sequential fusing multi-sensor GM-PHD (SFMGM-PHD) algorithm. First, the GM-PHD is applied to multiple sensors to get the posterior GM estimations in a parallel way. Second, we propose the SFMGM-PHD algorithm to fuse the multi-sensor GM estimations in a sequential way. Third, the unbalanced weighted fusing and adaptive sequence ordering methods are further proposed for two improved SFMGM-PHD algorithms. At last, we analyze the proposed algorithms in four different multi-sensor multi-target tracking scenes, and the results demonstrate the efficiency. [ABSTRACT FROM AUTHOR]

GDP is a classic indicator of the extent of national economic development. Research based on the World Trade Network has found that a country's GDP depends largely on the products it exports. In order to increase the competitiveness of a country and further increase its GDP, a crucial issue is finding the right direction to upgrade the industry so that the country can enhance its competitiveness. The proximity indicator measures the similarity between products and can be used to predict the probability that a country will develop a new industry. On the other hand, the Fitness–Complexity algorithm can help to find the important products and developing countries. In this paper, we find that the maximum of the proximity between a certain product and a country's existing products is highly correlated with the probability that the country exports this new product in the next year. In addition, we find that the more products that are related to a certain product, the higher probability of the emergence of the new product. Finally, we combine the proximity indicator and the Fitness–Complexity algorithm and then attempt to provide a recommendation list of new products that can help developing countries to upgrade their industry. A few examples are given in the end. [ABSTRACT FROM AUTHOR]

Structure learning is one of the main concerns in studies of Bayesian networks. In the present paper, we consider networks consisting of both observable and hidden nodes, and propose a method to investigate the existence of a hidden node between observable nodes, where all nodes are discrete. This corresponds to the model selection problem between the networks with and without the middle hidden node. When the network includes a hidden node, it has been known that there are singularities in the parameter space, and the Fisher information matrix is not positive definite. Then, the many conventional criteria for structure learning based on the Laplace approximation do not work. The proposed method is based on Bayesian clustering, and its asymptotic property justifies the result; the redundant labels are eliminated and the simplest structure is detected even if there are singularities. [ABSTRACT FROM AUTHOR]