摘要:It is very difficult to calculate the magnetic field which a ferromagnetic sphere system produces in a uniform external magnetic field,as a result of the difficulty in handling the mutual magnetization between the ferromagnetic spheres.The expressions of image magnetic dipole and magnetic charge were derived from image method of the system that consists of the point magnetic charge and magnetic medium sphere on condition that the image linear magnetic charges were simplified.Additional magnetic field was calculated,which ferromagnetic spheres produce because of the mutual magnetization.The image analytical solution was obtained according to the basic expression for magnetic field of the ferromagnetic sphere system,and the choice of the maximum order is analyzed.The verified results of the simulation experiment show that the image analytical solution has a very small error,and applies to all ferromagnetic sphere systems.
关键词:ferromagnetic sphere system;analytical solution of image;magnetic dipole;magnetic charge
摘要:The constellation figure of merit (CFM),in terms of lattice theory,can be separated into the coding gain of a lattice and the shaping gain of the boundary of a constellation.In this paper,maximizing the CFM of multi-dimensional signal constellations is formulated as a series of optimization problems.The geometric characteristics of signal constellations are taken as the constraints of such problems.Since the desirable signal constellations can be achieved by solving the optimization problems,our approach can serve as a general method of the construction of multi-dimensional signal constellations.In comparison with the fact that the existing methods can only be applied when the number of signal points is small,the proposed approach can construct large size constellations with ease.The simulation results show that the symbol error probabilities (SEP) of small size constellations built by our approach are very close to the optimum and that the proposed large size constellations have better SEPs than the traditional constellations generated by integer lattices.
关键词:multi-dimensional signal constellations;lattice;the constellation figure of merit;coding gain;shaping gain;symbol error probability
摘要:In the presence of the statistical property of phantom track and target track,an algorithm of discriminating phantom track and target track is proposed,which is based on multivariate statistical analysis theory.The algorithm originates from the generation mechanism of phantom track in the background of radar network.When the phantom track is generated by the ECAVs,the variance of the phantom track is different from the variance of target track because of the random error caused by the ECAVs.A kind of sample vector is constructed to extract the variance then the phantom track is recognized by likelihood ratio tests.Simulation results verify the feasibility and validity of the proposed algorithm.
关键词:Radar network;phantom track;likelihood ratio tests
摘要:The existing recovery algorithm of modulated wideband converter (MWC)-based sub-Nyquist sampling is far from satisfactory.Aiming at this problem,a recovery algorithm for MWC based on random projection method is proposed.This algorithm projects the measurement value matrix of MWC onto a random matrix with lower dimension to form a new measurement value matrix,and then solves a multiple measurement vector problem using a solver proposed.The recovery performance is enhanced through examining and repeating the tentative solving processes.This paper validates the effectiveness of the algorithm from both theoretical and experimental perspectives.Numerical experiments demonstrate that,compared with the popular ReMBo algorithm,the proposed algorithm significantly improves the success rate of recovery.From the same number of channels a signal with more spectral bands can be recovered by this algorithm,and a signal with the same number of bands can be recovered using fewer channels.Furthermore,the run time of this algorithm does not increase greatly.In contrast,compared with ReMBo,this algorithm can use a lower time cost to achieve a higher recovery performance when the spectral bands of the signal exceed a specific number.
摘要:This paper proposes an extreme learning machine (ELM) and memetic algorithm (MA) based miniature four-band (0.92/2.4/3.5/5.8GHz) antenna design algorithm namely the AntMA-ELM.It combines a comprehensive learning particle swarm optimizer(CLPSO)based global search and a DSCG(Davies,Swann,and Campey with Gram-schmidt) orthogonalization based local search in the MA framework to form a novel optimization algorithm for the geometrical parameters selection of the antenna.An ELM based regression model is introduced to estimate antenna performance,and accelerate the search speed.Experimental results show that the AntMA-ELM obtains promising performance with short computational time.Particularly,the return losses at all targeted frequency bands are smaller than -10dB.
摘要:In single carrier frequency domain equalization(SC-FDE)systems,linear equalization is simple and practical,but it does not do well in noise and inter-symbol interference(ISI)suppression.Therefore,nonlinear feedback and iteration mechanism is needed to improve the performance.Iterative block decision feedback equalization(IBDFE)is an effective nonlinear algorithm with a disadvantage of high computational complexity.In view of this,a simplified algorithm is derived on the basis of IBDFE structure using the minimum mean square error(MMSE)criterion.Then the mean square error(MSE)of the simplified algorithm and the existing low complexity algorithm is analyzed and compared.Three algorithms are simulated considering two kinds of wireless multipath fading channels.Results show that the proposed algorithm is convergent after two iterations under the given channels.Simulations also validate the conclusions of MSE analysis.Computational complexity comparison indicates that the proposed algorithm decreases the bit error rate(BER)performance,but it can efficiently reduce the amount of calculation.
关键词:single carrier frequency domain equalization(SC-FDE);decision feedback equalization;iterative block decision feedback equalization(IBDFE);minimum mean square error
摘要:Aiming to improve the detection performance of colocated multiple-input-multiple-output (MIMO) radar in the presence of strong clutter,we addressed the joint optimization problem of the waveform and receiver based on maximizing signal to clutter plus noise ratio (SCNR).Considering that practical radar systems employ constant envelope signals,we also imposed a constant envelope constraint on the waveform.During the optimizations,we divided the joint design problem into two steps,and proposed an algorithm for the design of the constant envelope waveform based on semi-definite relaxation (SDR) and Gaussian randomizations.Numerical simulations show that the proposed algorithm converges with increasing SCNR.Moreover,compared with the optimal waveform under the energy constraint,the SCNR loss is negligible.Finally,the capability of adaptive clutter suppression and improved detection performance of the proposed algorithm is clearly demonstrated.
摘要:Many existing range-free localization methods encounter large localization error.To address this problem,this paper proposes a range-free localization algorithm based on proximity.Proximity is used to denote the distance relation between neighbor nodes.First,a linear function is designed based on the geometric features and neighbor relation.The output is the value of proximity.Then a correction value is generated by the distances of anchors and proximity of neighbor nodes.The product of the correction value and proximity between neighbor nodes is the estimation distance.Finally,the estimated positions of non-anchor nodes are calculated based on the estimated distances.The simulation results show the proposed algorithm achieves better results than the current algorithms in both distance estimation error and localization error.
关键词:range-free;proximity;neighbor relation;anchor nodes;correction value
摘要:In recent years,l-diversity models are suitable not only for single sensitive attribute data tables,but also for multiple sensitive attributes data tables.However,most of the research is based on lossy join,it breaks the relationship between data.To address these problems,a model based on multiple sensitive attributes is proposed.The main idea of the model is that it proposes a l-maximum principle that can satisfy the multiple sensitive attributes l-diversity at first.Then,to protect the relationship between data,the model partitions attributes by the dependency degree between attributes.Finally,a multiple sensitive attributes l-maximum algorithm(MSA l-maximum)is proposed.The experiment results show that the proposed model can preserve the security of sensitive data,meanwhile it can also reduce the information hidden rate and keep a high data utility.
摘要:Distributed node localization is an important issue in wireless sensor networks.However,traditional distributed localization algorithms have the drawback of low localization accuracy and high processing complexity.In response to these problems,a distributed localization model based on game theory is presented,where the utility function for each participant is defined as the sum of neighbor distance error.Formally,the proposed localization game is proved as a type of potential game.Through theoretical analysis,the existence of Nash Equilibrium and the validity of the final converged solution are testified.Furthermore,a distributed localization algorithm based on game theory is proposed,where each sensor exchanging information only with its neighbors.Finally,to avoid converging in local optimum and accelerate the convergence speed,the strategy space determination and unknown nodes elevation are developed.Extensive simulation results are performed to demonstrate the effectiveness of our proposed algorithm.
关键词:wireless sensor network;distributed localization;potential game;utility function
摘要:There are the disadvantages of easily falling into premature convergence and local optimal solution which the elementary artificial bee colony algorithm had in some degree.Chaotic Catfish effect was hence adopted in this paper to achieve the optimum performance of artificial bee colony algorithm,in which,chaotic mechanism was conducted to instantiate each individual of the swarm firstly owing to its marvelous intrinsic randomness.Then the efficacious competition and coordination mechanism among Catfish bees which were derived from the integration of Chaos theory with Catfish effect and originals were intended to boost the capabilities of them leaping out of local optimal solution and converging expeditiously.The practicability of Support Vector Machines(SVM)is excessively affected due to the difficulty of selecting appropriate penalty factor C and kernel function parameter of SVM.Conversely,all of the common SVM parameters optimization methods have their respective disadvantages with some degree of competence.We utilized the improved artificial bee colony algorithm to optimize the two parameters of SVM,simultaneously,the public datasets from the University of California-Irvine(UCI)and the activity recognition reality data were employed for evaluating the proposed model.Experimental results demonstrate that the classification accuracy obtained by the developed SVM was higher
摘要:Due to the long delay and frequent disconnection,"store-carry-forward" manner was designed and adopted for bundle propagation in delay tolerant networks (DTN).The transmission process is on the basis of the hypothesis that DTN nodes depend on each other and participate in cooperation honestly.However,as constrained with the limited communication and bandwidth resources,selfish nodes will usually deny cooperating,which degrades the performance of DTNs.To address the selfishness issue,a reputation-based incentive scheme is proposed for DTN to stimulate nodes to share resources and restrain misbehaving in this paper.An observation protocol is presented to observe other's behavior.A novel reputation model is proposed to determine the degree of trust,influence routing decision,and punish selfish nodes.The simulation results demonstrate the effectiveness of the proposed scheme.
摘要:In order to fully detect null pointer dereference for C procedures,this paper introduces a method based on region-based memory model.Firstly,region-based symbolic three-valued logic(RSTVL)is proposed,which can describe shape of data structures,all kinds of memory states and relations of addressable expressions.Then,an approach to fully recognizing pointer dereferences based on abstract syntax tree and procedure summary is introduced.Furthermore,this paper introduces a null pointer dereference detection method,which translates pointer dereference detection into region detection applying the result of data flow analysis based on RSTVL,and detects interprocedural null pointer dereference based on procedure summary.Experiment results show that compared with DTSC_STVL and Klocwork9,the proposed method could dramatically reduce null pointer dereference false negative on the precondition of guarantee the detection precision.
摘要:Power electronic circuits are typical hybrid system.The paper established a hybrid system model for a fault-tolerant inverter.Compared with the switch function model,the hybrid system model of circuit could particularly depict the dynamic process of circuit,which would be beneficial to the accurate control for the circuit.Then,this paper researched circuit model predictive control(MPC) based on feasibility and move blocking,and replaced optimal solution with feasibility solution,which could reduce the number of control sequence and lower the switching frequency to fast solve the circuit MPC.Its feasibility and validity is verified by the simulation and experiment.
摘要:Low-rate Denial of Service (LDoS) attack is TCP-targeted attack,which attempts to deny bandwidth of TCP flows.LDoS attacks send intensive periodic pulses at sufficiently low average rate to elude detection of DoS defense system.Based on the sequence relation between the distributed LDoS attack pulses arriving at the destination,a cross-correlation LDoS attack detection method is proposed by using cyclic convolution.This method builds a detection sequence for the purpose of exploring the timing relationship for distributed LDoS attack pulses arriving at the specific destination.Through computing the relation between the constructed detection sequence and sampled network flow sequence,the cross sequence is obtained.The cyclic convolution cross-relation algorithm is utilized to compute the precise time that the attack pulses arriving at the specific destination through different transferring channels.With nonperiodic monopulse prediction technology,the periodic parameters of LDoS attack are estimated,the relation characteristic of the pulse durations of LDoS attacks is extracted,and the threshold rules are designed.Experimental results show that the proposed algorithm of LDoS attack detection based on signal correlation achieves good detection performance.
关键词:low-rate denial of service (LDoS);cross-correlation;circular convolution;time sequence;detection
摘要:Aiming to the new problems of cost optimization for concurrent multiple DAG(Directed Acyclic Graph) workflow sharing heterogeneous resource on the basis of maximizing overall throughput of DAGs scheduling,we propose an algorithm called PDTC(based on the Probe of the Total Cost Decrease)to minimize the total cost of these DAG while meeting a user-defined deadline.Last experiments demonstrate that these algorithms and methods can improve the related performances.
关键词:multiple DAGs scheduling;urgency level;satisfaction degree to deadline;normalized cost
摘要:In order to evaluate the capability that block ciphers resist differential attack accurately,a multiple differential cryptanalysis method is proposed in which chi-square statistics is constructed based on multiple differential characteristics with high probablities.We analyze the probability distribution of statistics corresponding correct key and incorrect key,and give the relation of data complexity,computational complexity and success probability.We point that the multiple differential cryptanalysis method can be applied to the the instance when the probabilities of differential characteristics are unknown.
关键词:block cipher;multiple differential cryptanalysis;differential characteristic;data complexity;success probability
摘要:To reduce synchronization error and sensitivity to carrier frequency offset of MIMO-OFDM system,this paper proposes that construction of training sequence and synchronization method for MIMO-OFDM system.The training sequences of the synchronization method consist of two sequences of different structures:the first one is repetitive and the second one is antisymmetric.The factor β in the training sequences affects timing synchronization performance of the system.The timing synchronization is caught At the receiver by cross-correlating the training sequence and the local signal.The fractional frequency offset and integer frequency offset are estimated after catching precise timing synchronization,with the range of the integer frequency offset estimation being one-quarter of the bandwidth.Theoretical analysis and simulation show that the proposed synchronization has better synchronization performance than the conventional methods and reduces the computational complexity.
摘要:The basic principle behind the track-before-detect(TBD)scheme was introduced,and an overview of the studies on state-of-art TBD methods was then presented.The paper paid special attention to the following TBD methods:dynamic programming,recursive Bayesian filtering,finite set statistics,histogram probability multi-hypothesis tracking,and also the relevant applications.Finally,some key issues to enhance the precision and robustness of dim target detection and tracking are indicated based on the progress of the existing research,which deserve more attention of the researchers' for solution.These include:performance analysis and evaluation of the existing TBD methods,the TBD solutions for closely-spaced and/or maneuvering dim targets,multi-sensor fusion for the TBD problem,joint target detection,tracking and classification(JDTC) for dim targets,and so on.
关键词:dim target detection;track before detect;dynamic programming;particle filter;finite sets statistics
摘要:Multi-classification has been one of the research hotspot in pattern recognition,and there are many solutions to it.As a common way to model multi-classification to design a set of binary classifiers and fuse them,Error-correcting output codes(ECOC) represents a successful framework to deal with this type of problems and is attracting more and more attention of researchers.In this paper,the framework of ECOC is concluded at first.Then the two keys of multi-classification based on ECOC,i.e.,the coding strategies and decoding strategies are proposed.The main part focuses on the research of the two keys and the application of ECOC.Finally,the still existing problems of ECOC are pointed out and the promising research fields are given.The analysis of the paper will provide reference and advice in the practical application of multi-classification based on ECOC.
摘要:To overcome problems caused by improper parameters selection when least mean square(LMS)or normalized LMS(NLMS)method is apphied to model second-order Volterra,based on the LMS method,a novel Davidon-Fletcher-Powell(DFP)-method-based second-order Volterra filter(DFPSOVF)was proposed,which is based on a posteriori error assumption and is characteristic of a variable convergence factor.Recursive update formulation positive definiteness and bounded property of the inverse autocorrelation matrix estimation,role of τ(n) of DFPSOVF model are studied.Simulations,which apply DFPSOVF model to single step predictions for Rössler chaotic time series,illustrate that the proposed algorithm can guarantee its stability and convergence and there haven't divergence problems using LMS and NLMS algorithms.
关键词:second-order Volterra model;Davidon-Fletcher-Powell algorithm;DFPSOVF;Rössler chaotic series prediction
摘要:Sparse representation based classification (SRC) and kernel methods are applied in many pattern recognition problems.In order to improve the classification accuracy,we propose multiple kernel sparse representation based classification (MKSRC).A fast optimization iteration method to solve sparse coefficients and the associated convergence proof to global optimal solution are given.In order to update the kernel weights of MKSRC,two different updating methods and the associated comparison are given.The experimental results on three face image databases show the superiority of the proposed multiple kernel sparse representation based classification.
关键词:sparse representation based classification (SRC);kernel method;multiple kernel;kernel weight;pattern recognition
摘要:In the passive sensor networks,the sampling data are aperiodic and lack of distance information,a data association algorithm is proposed based on fuzzy synthetic closeness.Because the measurements of passive sensor were lack of distance information and the detection ranges of passive sensor were small,the algorithm used two thresholds to select the effective measurements;then the heading-angle was obtained by the heading-angle definition method;at last the fuzzy synthetic closeness algorithm was used for the final data association,which combined the information of the azimuths and the elevations to resolve the problem of high error rate of association.The extended Kalman filter is used to update the target state and covariance.The experimental results show the validity of this algorithm.
摘要:A deterministic finite automaton(DFA)structure based on multi-dimensional cube is proposed aiming at the state explosion problem generated by the interaction among regular expression rules containing ".*" under certain conditions.It divides and compresses redundant states by dimension.Then the algorithm M-D-Cube-DFA is proposed.It achieves equivalent state transition by constructing dynamic intersections.Theory and simulation results show that,compared with the conventional DFA algorithm,M-D-Cube-DFA achieves a logarithm-level compression of the number of states and the storage space without changing the time complexity.
摘要:The globalized simulation of the response of the mono-pulse antenna in the near field region of the scatterer is done by using the method of moment(MoM)and the multi-level fast multipole algorithm(MLFMA) to evaluate quantitatively the performance of the angle measurement in near range for mono-pulse antenna.In this model the amplitude and the phase distribution of the scattering field in near region,and the radiation and the receiving response of the mono-pulse antenna are calculated accurately through the full wave analysis.First,the radiated field from the antennas with the summation beam,as the incidence to illuminate the target,is calculated.Then,the scattered field in the near region produced by the target,as the incidence to the received antenna,is simulated numerically.Finally,the electric signals received by the antennas with the difference beams are calculated and the measured angle is obtained by using the phase-comparison or the amplitude-comparison of the signals received from difference beams.The errors of the measured angles and its sources are discussed.The numerical results in the example with a missile-like target show that the angle measurement based on the summation and the difference beams of the mono-pulse antenna in the near field result in remarkable errors,and the application of the signals with the relative lower frequency dead to the less errors of the angle measurement.The corresponding physics behind above phenomena is given and the recommendation of the lower frequency signal for near range measurement is presented.
关键词:mono-pulse antenna;globalized numerical modeling;angle measurement in near field;amplitude-comparison;phase-comparison.
摘要:In order to strengthen the diversity of Pareto sets obtained by multi-objective optimization algorithms and balance the exploration and exploitation of the algorithms,a cellular multi-objective particle swarm optimization algorithm based on multi-strategy differential evolution (MPSOCell) is proposed.This algorithm is composed by integrating the cellular automate mechanism into the basic particle swarm optimization algorithm,and it is aimed at promoting the communication and information transmission among the particles.To avoid the local convergence caused by the fast flying speed of particles,a strategy used to limit the flying speed is designed;to strengthen the disturbance to the particles,a multi-strategy differential evolution operator is also brought into the algorithm.The experiments demonstrate that MPSOCell has better performance in terms of convergence and diversity.
关键词:cellular automata;particle swarm optimization;multi-strategy differential evolution;speed control strategy;multi-objective optimization
摘要:In the original IB (Information Bottleneck) algorithms,all the data points are employed to learn the cluster patterns.However,in many real-world applications,some data show clear coherent behavior and can be summarized well,while some data present weak tendencies to be assigned to any particular pattern.For such situations,this paper proposes a DSIB (Data Selection Information Bottleneck) algorithm which has the ability to select data points with clear coherent behavior and find their corresponding cluster patterns.To realize this goal,the DSIB algorithm takes the information loss as the data selection criterion,which is generated when we try to compress the data point into one of the clusters.The DSIB algorithm adopts sequential "draw-and-merge" procedure to select the data and learn the cluster patterns.This learning process can take full account of each datum's natural pattern.Experimental results show that with the improvement of the data selection criterion,the DSIB algorithm can improve the clustering precision while the expense of the recall is small.In our evaluation,the DSIB algorithm is found to be consistently superior to all the other clustering methods we examine.
摘要:We use bivariate Poisson point process(BPPP) to model the scenario where a wireless ad hoc broadcast network coexists with a wiretapping network.By using stochastic geometry tools,we study the secrecy broadcast transmission capacity of wireless ad hoc network,which is defined as the product among the spatial density of broadcast transmissions without secrecy outage,the average number of neighbors of a broadcasting node,and the secrecy rate.We first derive the average number of eavesdropping neighbors that causes secrecy outage and then characterize the secrecy broadcast transmission capacity over general fading and Rayleigh fading channels.Finally,numerical results are presented to show that in comparison to the case without correlation,the correlation between the legitimate nodes and the eavesdroppers degrades the secrecy broadcast transmission capacity.
关键词:wireless ad hoc networks;secrecy broadcast transmission capacity;spatial bivariate Poisson point process;secrecy rate
摘要:The application of GSM(Global System for Mobile communication) signal as opportunity source of passive bistatic radar has been demonstrated in many references.However,in the early research,only the suppression of direct signal and multipath from the host station is considered.In practice,GSM based passive bistatic radar receives interference not only from the host station but also from other station with the same frequency.In order to suppress the interference from the host station as well as the one from other stations,this paper proposes that the host station's interference is firstly cancelled using ECA(Extensive Cancellation Algorithm) algorithm,and then the other stations' interference is suppressed by a robust adaptive beamformer based worst-case optimization.In the end,simulations verify the availability of the proposed method.
关键词:passive bistatic radar;global system for mobile communication (GSM) signal;disturbance suppression;robust adaptive beamformer
摘要:Biometric authentication is a hot topic in the current information security field.Based on the analysis of the current biometric authentication methods and the problems of their applications on smart phones,we propose an identity authentication method based on a dynamic gesture matching algorithm named EI-DTW,which combines relaxation of the endpoints restriction and early termination of authentication based on dynamic time warping(DTW)algorithm.The experimental results show our algorithm EI-DTW enhances the authentication accuracy by canceling the endpoint alignment restriction on gesture matching,and improves the authentication efficiency by the early termination strategy and limiting the warp slope.
关键词:DTW(Dynamic Time Warping);dynamic gesture;identity authentication
摘要:The traditional model "Bag of Words" does not capture the spatial relationship among local features,thus affecting the retrieval performance.Hence,the spatial encoding method based on hierarchical salient information is proposed,which aims at fully exploring the geometric context of all visual words in images and increasing the discriminative power of the features based on hierarchical salient information.We propose a new encoding method in the geometric verification step.The spatial layout of every 3 points within a certain salient area will be represented by angle encoding and location encoding,meanwhile we sum all spatial matching scores with weights based on hierarchical salient information to generate the final ranking list.Experimental results prove that our scheme improves the retrieval accuracy significantly and reduces the computing time during the geometric verification step.
关键词:image retrieval;bag of words model;hierarchical salient information;angle encoding;location encoding
摘要:This paper presents a monolithic micro-electro-mechanical systems (MEMS) gyroscope interface circuit for angular velocity signal readout.The proposed interface circuit uses correlated double sampling (CDS) to reject 1/f noise and the offset from operational transconductance amplifiers (OTAs).In order to facilitate the circuit simulation and the test,a MEMS gyroscope equivalent circuit is developed.The interface circuit has been fabricated in 0.35 μmCMOS process,and the chip area is 1.09mm×0.87mm.Post-layout simulation results show that the interface circuit has a capacitance resolution of 0.58aF,and the dynamic range is 99.7dB.Test results show that the system gain is 26.6mV/fF,and the total power consumption is 20.4mW with a 3.5V power supply.