Stokes identification in an atomic ensemble using a filtering system

Polarization filtering and atomic cell filtering are applied in the identification of Stokes signals in an atomic ensemble, and reduce the noise to a level of 10-5 and 10-4 respectively. Good Stokes signals are then obtained. In this article the two filtering systems and the final Stokes output are presented, and the optimization of the polarization filtering system is highlighted.

Efficient Spam Filtering System Based on Smart Cooperative Subjective and Objective Methods

Most of the spam filtering techniques are based on objective methods such as the content filtering and DNS/reverse DNS checks. Recently, some cooperative subjective spam filtering techniques are proposed. Objective methods suffer from the false positive and false negative classification. Objective methods based on the content filtering are time consuming and resource demanding. They are inaccurate and require continuous update to cope with newly invented spammer’s tricks. On the other side, the existing subjective proposals have some drawbacks like the attacks from malicious users that make them unreliable and the privacy. In this paper, we propose an efficient spam filtering system that is based on a smart cooperative subjective technique for content filtering in addition to the fastest and the most reliable non-content-based objective methods. The system combines several applications. The first is a web-based system that we have developed based on the proposed technique. A server application having extra features suitable for the enterprises and closed work groups is a second part of the system. Another part is a set of standard web services that allow any existing email server or email client to interact with the system. It allows the email servers to query the system for email filtering. They can also allow the users via the mail user agents to participate in the subjective spam filtering problem.

Recursive Filtering for Stochastic Systems With Filter-and-Forward Successive Relays

In this paper,the recursive filtering problem is considered for stochastic systems over filter-and-forward successive relay(FFSR)networks.An FFSR is located between the sensor and the remote filter to forward the measurement.In the successive relay,two cooperative relay nodes are adopted to forward the signals alternatively,thereby existing switching characteristics and inter-relay interferences(IRI).Since the filter-and-forward scheme is employed,the signal received by the relay is retransmitted after it passes through a linear filter.The objective of the paper is to concurrently design optimal recursive filters for FFSR and stochastic systems against switching characteristics and IRI of relays.First,a uniform measurement model is proposed by analyzing the transmission mechanism of FFSR.Then,novel filter structures with switching parameters are constructed for both FFSR and stochastic systems.With the help of the inductive method,filtering error covariances are presented in the form of coupled difference equations.Next,the desired filter gain matrices are further obtained by minimizing the trace of filtering error covariances.Moreover,the stability performance of the filtering algorithm is analyzed where the uniform bound is guaranteed on the filtering error covariance.Finally,the effectiveness of the proposed filtering method over FFSR is verified by a three-order resistance-inductance-capacitance circuit system.

Dynamic Event-Triggered Quadratic Nonfragile Filtering for Non-Gaussian Systems:Tackling Multiplicative Noises and Missing Measurements

This paper focuses on the quadratic nonfragile filtering problem for linear non-Gaussian systems under multiplicative noises,multiple missing measurements as well as the dynamic event-triggered transmission scheme.The multiple missing measurements are characterized through random variables that obey some given probability distributions,and thresholds of the dynamic event-triggered scheme can be adjusted dynamically via an auxiliary variable.Our attention is concentrated on designing a dynamic event-triggered quadratic nonfragile filter in the well-known minimum-variance sense.To this end,the original system is first augmented by stacking its state/measurement vectors together with second-order Kronecker powers,thus the original design issue is reformulated as that of the augmented system.Subsequently,we analyze statistical properties of augmented noises as well as high-order moments of certain random parameters.With the aid of two well-defined matrix difference equations,we not only obtain upper bounds on filtering error covariances,but also minimize those bounds via carefully designing gain parameters.Finally,an example is presented to explain the effectiveness of this newly established quadratic filtering algorithm.

A Conceptual and Computational Framework for Aspect-Based Collaborative Filtering Recommender Systems

Many datasets in E-commerce have rich information about items and users who purchase or rate them. This information can enable advanced machine learning algorithms to extract and assign user sentiments to various aspects of the items thus leading to more sophisticated and justifiable recommendations. However, most Collaborative Filtering (CF) techniques rely mainly on the overall preferences of users toward items only. And there is lack of conceptual and computational framework that enables an understandable aspect-based AI approach to recommending items to users. In this paper, we propose concepts and computational tools that can sharpen the logic of recommendations and that rely on users’ sentiments along various aspects of items. These concepts include: The sentiment of a user towards a specific aspect of a specific item, the emphasis that a given user places on a specific aspect in general, the popularity and controversy of an aspect among groups of users, clusters of users emphasizing a given aspect, clusters of items that are popular among a group of users and so forth. The framework introduced in this study is developed in terms of user emphasis, aspect popularity, aspect controversy, and users and items similarity. Towards this end, we introduce the Aspect-Based Collaborative Filtering Toolbox (ABCFT), where the tools are all developed based on the three-index sentiment tensor with the indices being the user, item, and aspect. The toolbox computes solutions to the questions alluded to above. We illustrate the methodology using a hotel review dataset having around 6000 users, 400 hotels and 6 aspects.

Finite-time H_(∞) filtering for Markov jump systems with uniform quantization

This paper is concerned with finite-time H_(∞) filtering for Markov jump systems with uniform quantization. The objective is to design quantized mode-dependent filters to ensure that the filtering error system is not only mean-square finite-time bounded but also has a prescribed finite-time H_(∞) performance. First, the case where the switching modes of the filter align with those of the MJS is considered. A numerically tractable filter design approach is proposed utilizing a mode-dependent Lyapunov function, Schur’s complement, and Dynkin’s formula. Then, the study is extended to a scenario where the switching modes of the filter can differ from those of the MJS. To address this situation, a mode-mismatched filter design approach is developed by leveraging a hidden Markov model to describe the asynchronous mode switching and the double expectation formula. Finally, a spring system model subject to a Markov chain is employed to validate the effectiveness of the quantized filter design approaches.

Nonlinear Filtering With Sample-Based Approximation Under Constrained Communication:Progress, Insights and Trends

The nonlinear filtering problem has enduringly been an active research topic in both academia and industry due to its ever-growing theoretical importance and practical significance.The main objective of nonlinear filtering is to infer the states of a nonlinear dynamical system of interest based on the available noisy measurements. In recent years, the advance of network communication technology has not only popularized the networked systems with apparent advantages in terms of installation,cost and maintenance, but also brought about a series of challenges to the design of nonlinear filtering algorithms, among which the communication constraint has been recognized as a dominating concern. In this context, a great number of investigations have been launched towards the networked nonlinear filtering problem with communication constraints, and many samplebased nonlinear filters have been developed to deal with the highly nonlinear and/or non-Gaussian scenarios. The aim of this paper is to provide a timely survey about the recent advances on the sample-based networked nonlinear filtering problem from the perspective of communication constraints. More specifically, we first review three important families of sample-based filtering methods known as the unscented Kalman filter, particle filter,and maximum correntropy filter. Then, the latest developments are surveyed with stress on the topics regarding incomplete/imperfect information, limited resources and cyber security.Finally, several challenges and open problems are highlighted to shed some lights on the possible trends of future research in this realm.

Accurate method based on data filtering for quantitative multi-element analysis of soils using CF-LIBS

To obtain more stable spectral data for accurate quantitative analysis of multi-element,especially for the large-area in-situ elements detection of soils, we propose a method for a multielement quantitative analysis of soils using calibration-free laser-induced breakdown spectroscopy(CF-LIBS) based on data filtering. In this study, we analyze a standard soil sample doped with two heavy metal elements, Cu and Cd, with a specific focus on the line of Cu I324.75 nm for filtering the experimental data of multiple sample sets. Pre-and post-data filtering,the relative standard deviation for Cu decreased from 30% to 10%, The limits of detection(LOD)values for Cu and Cd decreased by 5% and 4%, respectively. Through CF-LIBS, a quantitative analysis was conducted to determine the relative content of elements in soils. Using Cu as a reference, the concentration of Cd was accurately calculated. The results show that post-data filtering, the average relative error of the Cd decreases from 11% to 5%, indicating the effectiveness of data filtering in improving the accuracy of quantitative analysis. Moreover, the content of Si, Fe and other elements can be accurately calculated using this method. To further correct the calculation, the results for Cd was used to provide a more precise calculation. This approach is of great importance for the large-area in-situ heavy metals and trace elements detection in soil, as well as for rapid and accurate quantitative analysis.

CRBFT:A Byzantine Fault-Tolerant Consensus Protocol Based on Collaborative Filtering Recommendation for Blockchains

Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants to maintain the storage state consistently.However,with the improvement of network environment complexity and system scale,blockchain development is limited by the performance,security,and scalability of the consensus protocol.To address this problem,this paper introduces the collaborative filtering mechanism commonly used in the recommendation system into the Practical Byzantine Fault Tolerance(PBFT)and proposes a Byzantine fault-tolerant(BFT)consensus protocol based on collaborative filtering recommendation(CRBFT).Specifically,an improved collaborative filtering recommendation method is designed to use the similarity between a node’s recommendation opinions and those of the recommender as a basis for determining whether to adopt the recommendation opinions.This can amplify the recommendation voice of good nodes,weaken the impact of cunningmalicious nodes on the trust value calculation,andmake the calculated resultsmore accurate.In addition,the nodes are given voting power according to their trust value,and a weight randomelection algorithm is designed and implemented to reduce the risk of attack.The experimental results show that CRBFT can effectively eliminate various malicious nodes and improve the performance of blockchain systems in complex network environments,and the feasibility of CRBFT is also proven by theoretical analysis.

3D robust anisotropic diffusion filtering algorithm for sparse view neutron computed tomography 3D image reconstruction

The most critical part of a neutron computed tomography(NCT) system is the image processing algorithm,which directly affects the quality and speed of the reconstructed images.Various types of noise in the system can degrade the quality of the reconstructed images.Therefore,to improve the quality of the reconstructed images of NCT systems,efficient image processing algorithms must be used.The anisotropic diffusion filtering(ADF) algorithm can not only effectively suppress the noise in the projection data,but also preserve the image edge structure information by reducing the diffusion at the image edges.Therefore,we propose the application of the ADF algorithm for NCT image reconstruction.To compare the performance of different algorithms in NCT systems,we reconstructed images using the ordered subset simultaneous algebraic reconstruction technique(OS-SART) algorithm with different regular terms as image processing algorithms.In the iterative reconstruction,we selected two image processing algorithms,the Total Variation and split Bregman solved total variation algorithms,for comparison with the performance of the ADF algorithm.Additionally,the filtered back-projection algorithm was used for comparison with an iterative algorithm.By reconstructing the projection data of the numerical and clock models,we compared and analyzed the effects of each algorithm applied in the NCT system.Based on the reconstruction results,OS-SART-ADF outperformed the other algorithms in terms of denoising,preserving the edge structure,and suppressing artifacts.For example,when the 3D Shepp–Logan was reconstructed at 25 views,the root mean square error of OS-SART-ADF was the smallest among the four iterative algorithms,at only 0.0292.The universal quality index,mean structural similarity,and correlation coefficient of the reconstructed image were the largest among all algorithms,with values of 0.9877,0.9878,and 0.9887,respectively.

Traffic Control Based on Integrated Kalman Filtering and Adaptive Quantized Q-Learning Framework for Internet of Vehicles

Intelligent traffic control requires accurate estimation of the road states and incorporation of adaptive or dynamically adjusted intelligent algorithms for making the decision.In this article,these issues are handled by proposing a novel framework for traffic control using vehicular communications and Internet of Things data.The framework integrates Kalman filtering and Q-learning.Unlike smoothing Kalman filtering,our data fusion Kalman filter incorporates a process-aware model which makes it superior in terms of the prediction error.Unlike traditional Q-learning,our Q-learning algorithm enables adaptive state quantization by changing the threshold of separating low traffic from high traffic on the road according to the maximum number of vehicles in the junction roads.For evaluation,the model has been simulated on a single intersection consisting of four roads:east,west,north,and south.A comparison of the developed adaptive quantized Q-learning(AQQL)framework with state-of-the-art and greedy approaches shows the superiority of AQQL with an improvement percentage in terms of the released number of vehicles of AQQL is 5%over the greedy approach and 340%over the state-of-the-art approach.Hence,AQQL provides an effective traffic control that can be applied in today’s intelligent traffic system.

Joint Modeling of Citation Networks and User Preferences for Academic Tagging Recommender System

In the tag recommendation task on academic platforms,existing methods disregard users’customized preferences in favor of extracting tags based just on the content of the articles.Besides,it uses co-occurrence techniques and tries to combine nodes’textual content for modelling.They still do not,however,directly simulate many interactions in network learning.In order to address these issues,we present a novel system that more thoroughly integrates user preferences and citation networks into article labelling recommendations.Specifically,we first employ path similarity to quantify the degree of similarity between user labelling preferences and articles in the citation network.Then,the Commuting Matrix for massive node pair paths is used to improve computational performance.Finally,the two commonalities mentioned above are combined with the interaction paper labels based on the additivity of Poisson distribution.In addition,we also consider solving the model’s parameters by applying variational inference.Experimental results demonstrate that our suggested framework agrees and significantly outperforms the state-of-the-art baseline on two real datasets by efficiently merging the three relational data.Based on the Area Under Curve(AUC)and Mean Average Precision(MAP)analysis,the performance of the suggested task is evaluated,and it is demonstrated to have a greater solving efficiency than current techniques.

An anti-aliasing filtering of quantum images in spatial domain using a pyramid structure

As a part of quantum image processing,quantum image filtering is a crucial technology in the development of quantum computing.Low-pass filtering can effectively achieve anti-aliasing effects on images.Currently,most quantum image filterings are based on classical domains and grayscale images,and there are relatively fewer studies on anti-aliasing in the quantum domain.This paper proposes a scheme for anti-aliasing filtering based on quantum grayscale and color image scaling in the spatial domain.It achieves the effect of anti-aliasing filtering on quantum images during the scaling process.First,we use the novel enhanced quantum representation(NEQR)and the improved quantum representation of color images(INCQI)to represent classical images.Since aliasing phenomena are more pronounced when images are scaled down,this paper focuses only on the anti-aliasing effects in the case of reduction.Subsequently,we perform anti-aliasing filtering on the quantum representation of the original image and then use bilinear interpolation to scale down the image,achieving the anti-aliasing effect.The constructed pyramid model is then used to select an appropriate image for upscaling to the original image size.Finally,the complexity of the circuit is analyzed.Compared to the images experiencing aliasing effects solely due to scaling,applying anti-aliasing filtering to the images results in smoother and clearer outputs.Additionally,the anti-aliasing filtering allows for manual intervention to select the desired level of image smoothness.

A dual adaptive unscented Kalman filter algorithm for SINS-based integrated navigation system

In this study, the problem of measuring noise pollution distribution by the intertial-based integrated navigation system is effectively suppressed. Based on nonlinear inertial navigation error modeling, a nested dual Kalman filter framework structure is developed. It consists of unscented Kalman filter (UKF)master filter and Kalman filter slave filter. This method uses nonlinear UKF for integrated navigation state estimation. At the same time, the exact noise measurement covariance is estimated by the Kalman filter dependency filter. The algorithm based on dual adaptive UKF (Dual-AUKF) has high accuracy and robustness, especially in the case of measurement information interference. Finally, vehicle-mounted and ship-mounted integrated navigation tests are conducted. Compared with traditional UKF and the Sage-Husa adaptive UKF (SH-AUKF), this method has comparable filtering accuracy and better filtering stability. The effectiveness of the proposed algorithm is verified.

Bayesian Filtering for High-Dimensional State-Space Models With State Partition and Error Compensation

In the era of exponential growth of data availability,the architecture of systems has a trend toward high dimensionality,and directly exploiting holistic information for state inference is not always computationally affordable.This paper proposes a novel Bayesian filtering algorithm that considers algorithmic computational cost and estimation accuracy for high-dimensional linear systems.The high-dimensional state vector is divided into several blocks to save computation resources by avoiding the calculation of error covariance with immense dimensions.After that,two sequential states are estimated simultaneously by introducing an auxiliary variable in the new probability space,mitigating the performance degradation caused by state segmentation.Moreover,the computational cost and error covariance of the proposed algorithm are analyzed analytically to show its distinct features compared with several existing methods.Simulation results illustrate that the proposed Bayesian filtering can maintain a higher estimation accuracy with reasonable computational cost when applied to high-dimensional linear systems.

Set-Membership Filtering Approach to Dynamic Event-Triggered Fault Estimation for a Class of Nonlinear Time-Varying Complex Networks

The present study addresses the problem of fault estimation for a specific class of nonlinear time-varying complex networks,utilizing an unknown-input-observer approach within the framework of dynamic event-triggered mechanism(DETM).In order to optimize communication resource utilization,the DETM is employed to determine whether the current measurement data should be transmitted to the estimator or not.To guarantee a satisfactory estimation performance for the fault signal,an unknown-input-observer-based estimator is constructed to decouple the estimation error dynamics from the influence of fault signals.The aim of this paper is to find the suitable estimator parameters under the effects of DETM such that both the state estimates and fault estimates are confined within two sets of closed ellipsoid domains.The techniques of recursive matrix inequality are applied to derive sufficient conditions for the existence of the desired estimator,ensuring that the specified performance requirements are met under certain conditions.Then,the estimator gains are derived by minimizing the ellipsoid domain in the sense of trace and a recursive estimator parameter design algorithm is then provided.Finally,a numerical example is conducted to demonstrate the effectiveness of the designed estimator.

A Novel Clutter Suppression Algorithm for Low-Slow-Small Targets Detecting Based on Sparse Adaptive Filtering

Passive detection of low-slow-small(LSS)targets is easily interfered by direct signal and multipath clutter,and the traditional clutter suppression method has the contradiction between step size and convergence rate.In this paper,a frequency domain clutter suppression algorithm based on sparse adaptive filtering is proposed.The pulse compression operation between the error signal and the input reference signal is added to the cost function as a sparsity constraint,and the criterion for filter weight updating is improved to obtain a purer echo signal.At the same time,the step size and penalty factor are brought into the adaptive iteration process,and the input data is used to drive the adaptive changes of parameters such as step size.The proposed algorithm has a small amount of calculation,which improves the robustness to parameters such as step size,reduces the weight error of the filter and has a good clutter suppression performance.

Detection of UAV Target Based on Continuous Radon Transform and Matched Filtering Process for Passive Bistatic Radar

Long-time integration technique is an effective way of improving target detection performance for unmanned aerial vehicle(UAV)in the passive bistatic radar(PBR),while range migration(RM)and Doppler frequency migration(DFM)may have a major effect due to the target maneuverability.This paper proposed an innovative long-time coherent integration approach,regarded as Continuous Radon-matched filtering process(CRMFP),for low-observable UAV target in passive bistatic radar.It not only mitigates the RM by collaborative research in range and velocity dimensions but also compensates the DFM and ensures the coherent integration through the matched filtering process(MFP).Numerical and real-life data following detailed analysis verify that the proposed method can overcome the Doppler mismatch influence and acquire comparable detection performance.

Novel Static Security and Stability Control of Power Systems Based on Artificial Emotional Lazy Q-Learning

The stability problem of power grids has become increasingly serious in recent years as the size of novel power systems increases.In order to improve and ensure the stable operation of the novel power system,this study proposes an artificial emotional lazy Q-learning method,which combines artificial emotion,lazy learning,and reinforcement learning for static security and stability analysis of power systems.Moreover,this study compares the analysis results of the proposed method with those of the small disturbance method for a stand-alone power system and verifies that the proposed lazy Q-learning method is able to effectively screen useful data for learning,and improve the static security stability of the new type of power system more effectively than the traditional proportional-integral-differential control and Q-learning methods.

Electrically controllable spin filtering in zigzag phosphorene nanoribbon based normal–antiferromagnet–normal junctions

We investigated the electric controllable spin-filtering effect in a zigzag phosphorene nanoribbon(ZPNR) based normal–antiferromagnet–normal junction. Two ferromagnets are closely coupled to the edges of the nanoribbon and form the edge-to-edge antiferromagnetism. Under an in-plane electric field, the two degenerate edge bands of the edge-to-edge antiferromagnet split into four spin-polarized sub-bands and a 100% spin-polarized current can be easily induced with the maximal conductance 2e~2/h. The spin polarization changes with the strength of the electric field and the exchange field,and changes sign at opposite electric fields. The spin-polarized current switches from one edge to the other by reversing the direction of the electric field. The edge current can also be controlled spatially by changing the electric potential of the scattering region. The manipulation of edge current is useful in spin-transfer-torque magnetic random-access memory and provides a practical way to develop controllable spintronic devices.