The fusion of ordered propositions is an important and widespread problem in artificial intelligence,but existing fusion methods have difficulty handling the fusion of ordered propositions. In this paper, we propose a...
详细信息
The fusion of ordered propositions is an important and widespread problem in artificial intelligence,but existing fusion methods have difficulty handling the fusion of ordered propositions. In this paper, we propose a solution based on consistency and uncertainty measurements. The main contributions of this paper are as follows. First, we propose the concept of convexity degree, mean, and center of basic support function to comprehensively describe the basic support function of ordered propositions. Second, we introduce entropy as a measure of uncertainty in the basic support function of ordered propositions. Third, we generalize the indeterminacy of the basic support function and propose a novel method to measure the consistency between two basic support functions. Finally, based on the above researches, we propose a novel algorithm for fusing ordered propositions. Theoretical analysis and experimental results demonstrate that the proposed method outperforms state-of-the-art methods.
Multimodal Sentiment Analysis (MSA) is an attractive research that aims to integrate sentiment expressed in textual, visual, and acoustic signals. There are two main problems in the existing methods: 1) the dominant r...
详细信息
We consider a discrete model that describes a linear chain of particles coupled to an isolated ring composed of N defects. This simple system can be regarded as a generalization of the familiar Fano Anderson model. It...
详细信息
We consider a discrete model that describes a linear chain of particles coupled to an isolated ring composed of N defects. This simple system can be regarded as a generalization of the familiar Fano Anderson model. It can be used to model discrete networks of coupled defect modes in photonic crystals and simple waveguide arrays in two-dimensional lattices. The analytical result of the transmission coefficient is obtained, along with the conditions for perfect reflections and transmissions due to either destructive or constructive interferences. Using a simple example, we further investigate the relationship between the resonant frequencies and the number of defects N, and study how to affect the numbers of perfect reflections and transmissions. In addition, we demonstrate how these resonance transmissions and refections can be tuned by one nonlinear defect of the network that possesses a nonlinear Kerr-like response.
We have investigated theoretically the field-driven electron transport through a single-quantum-well semiconductor heterostructure with spin-orbit coupling. The splitting of the asymmetric Fano-type resonance peaks du...
详细信息
We have investigated theoretically the field-driven electron transport through a single-quantum-well semiconductor heterostructure with spin-orbit coupling. The splitting of the asymmetric Fano-type resonance peaks due to the Dresselhaus spin-orbit coupling is found to be highly sensitive to the direction of the incident electron. The splitting of the Fano-type resonance induces the spin-polarization dependent electron current. The location and the line shape of the Fano-type resonance can be controlled by adjusting the energy and the direction of the incident electron, the oscillation frequency, and the amplitude of the external field. These interesting features may be used to devise tunable spin filters and realize pure spin transmission currents.
Image registration is a vital research branch in medical image processing and analysis. In this paper, we proposed a new framework for rigid medical image registration. It can also be regarded as a pre-processing of n...
详细信息
Image registration is a vital research branch in medical image processing and analysis. In this paper, we proposed a new framework for rigid medical image registration. It can also be regarded as a pre-processing of non-rigid image registration algorithms. The interest of the algorithm lies in its simplicity and high e±ciency. In the registration algorithm, we firstly segmented the reference image and °oat image into two parts: tissue parts and background parts. Then the centers of the two images were located through performing distance transform on the two segmented tissue images. Finally, we detected the longest radius of the two tissue regions, by which we determined the rotating angle. We tested the registration algorithm on dozens of medical images, and the experimental results show us that the algorithm is competent for medical image registration.
This paper studies error formulas for Lagrange projectors determined by Cartesian sets. Cartesian sets are properly subgrids of tensor product grids. Given interpolated functions with all order continuous partial deri...
详细信息
This paper studies error formulas for Lagrange projectors determined by Cartesian sets. Cartesian sets are properly subgrids of tensor product grids. Given interpolated functions with all order continuous partial derivatives, the authors directly construct the good error formulas for Lagrange projectors determined by Cartesian sets. Owing to the special algebraic structure, such a good error formula is useful for error estimate.
Stochastic variational inference (SVI) can learn topic models with very big corpora. It optimizes the variational objective by using the stochastic natural gradient algorithm with a decreasing learning rate. This ra...
详细信息
Stochastic variational inference (SVI) can learn topic models with very big corpora. It optimizes the variational objective by using the stochastic natural gradient algorithm with a decreasing learning rate. This rate is crucial for SVI; however, it is often tuned by hand in real applications. To address this, we develop a novel algorithm, which tunes the learning rate of each iteration adaptively. The proposed algorithm uses the Kullback-Leibler (KL) divergence to measure the similarity between the variational distribution with noisy update and that with batch update, and then optimizes the learning rates by minimizing the KL divergence. We apply our algorithm to two representative topic models: latent Dirichlet allocation and hierarchical Dirichlet process. Experimental results indicate that our algorithm performs better and converges faster than commonly used learning rates.
Locomotor intent classification has become a research hotspot due to its importance to the development of assistive robotics and wearable *** work have achieved impressive performance in classifying steady locomotion ...
详细信息
Locomotor intent classification has become a research hotspot due to its importance to the development of assistive robotics and wearable *** work have achieved impressive performance in classifying steady locomotion ***,it remains challenging for these methods to attain high accuracy when facing transitions between steady locomotion *** to the similarities between the information of the transitions and their adjacent steady ***,most of these methods rely solely on data and overlook the objective laws between physical activities,resulting in lower accuracy,particularly when encountering complex locomotion modes such as *** address the existing deficiencies,we propose the locomotion rule embedding long short-term memory(LSTM)network with Attention(LREAL)for human locomotor intent classification,with a particular focus on transitions,using data from fewer sensors(two inertial measurement units and four goniometers).The LREAL network consists of two levels:One responsible for distinguishing between steady states and transitions,and the other for the accurate identification of locomotor *** classifier in these levels is composed of multiple-LSTM layers and an attention *** introduce real-world motion rules and apply constraints to the network,a prior knowledge was added to the network via a rule-modulating *** method was tested on the ENABL3S dataset,which contains continuous locomotion date for seven steady and twelve transitions *** results showed that the LREAL network could recognize locomotor intents with an average accuracy of 99.03%and 96.52%for the steady and transitions states,*** is worth noting that the LREAL network accuracy for transition-state recognition improved by 0.18%compared to other state-of-the-art network,while using data from fewer sensors.
Ideal interpolation is a generalization of the univariate Hermite interpolation. It is well known that every univariate Hermite interpolant is a pointwise limit of some Lagrange ***, a counterexample provided by Shekh...
详细信息
Ideal interpolation is a generalization of the univariate Hermite interpolation. It is well known that every univariate Hermite interpolant is a pointwise limit of some Lagrange ***, a counterexample provided by Shekhtman Boris shows that, for more than two variables,there exist ideal interpolants that are not the limit of any Lagrange interpolants. So it is natural to consider: Given an ideal interpolant, how to find a sequence of Lagrange interpolants(if any) that converge to it. The authors call this problem the discretization for ideal interpolation. This paper presents an algorithm to solve the discretization problem. If the algorithm returns "True", the authors get a set of pairwise distinct points such that the corresponding Lagrange interpolants converge to the given ideal interpolant.
This paper simulates the cuckoo incubation process and flight path to optimize the Wavelet Neural Network(WNN)model,and proposes a parking prediction algorithm based on WNN and improved Cuckoo Search(CS)***,the initia...
详细信息
This paper simulates the cuckoo incubation process and flight path to optimize the Wavelet Neural Network(WNN)model,and proposes a parking prediction algorithm based on WNN and improved Cuckoo Search(CS)***,the initialization parameters are provided to optimize the WNN using the improved *** traditional CS algorithm adopts the strategy of overall update and evaluation,but does not consider its own information,so the convergence speed is very *** proposed algorithm employs the evaluation strategy of group update,which not only retains the advantage of fast convergence of the dimension-by-dimension update evaluation strategy,but also increases the mutual relationship between the nests and reduces the overall running ***,we use the WNN model to predict parking *** proposed algorithm is compared with six different heuristic algorithms in five *** experimental results show that the proposed algorithm is superior to other algorithms in terms of running time and accuracy.
暂无评论