摘要:The design of secure wireless communication suffers a great challenge for openness of wireless channel and the broadcast nature of radio signals.The security problem introduced by wireless channel may be solved adequately by wireless channel itself.The space redundancy is often used in existing physical-layer security method to enhance security.So the concept of γ mean square error is proposed in the paper,which is used to introduce redundancy for pre-coding weight.The concrete analysis and corresponding formal derivations are also given in the paper.Based on these,a novel physical-layer encryption method is proposed according to short-term reciprocity,rapid Decorrelation of wireless channel.Simulation results show that the proposed method guarantees wireless transmission in the authorized receiver and reduces the probability of interception.
关键词:physical-layer security;wireless channel;low probability of interception;Γmean square error
摘要:For nonlinear estimation with additive noise,we utilized the sparse-grid theory to propose a novel nonlinear filter,Sparse-grid Square-Root Quadrature Filter (SSRQF).The quadrature points for the conventional QF increases exponentially with the dimension.However,the new filter SSRQF uses the sparse-grid theory to reduce the number of quadrature points to a polynomial with the dimension,which alleviates the computation burden greatly.Through the theoretical analysis,we proposed that Unscented Kalman Filter (UKF) is only a special case for Sparse-grid Quadrature Filter (SQF),thus SSRQF is more flexible in terms of choosing points and controlling accuracy.The simulation results show that the SSRQF achieves higher accuracy than the UKF and the Extended Kalman Filter (EKF).Thus,it is a high accuracy nonlinear filter algorithm with computationally efficient.
摘要:Linear network coding scheme is hard to be introduced to optical networks for the reason of lacking optical random access memory.To introduce network coding to optical networks,a two channels optical network coding scheme based on optical logic shift and XOR operations was presented.The scheme can be realized in photonic domain without OEO conversion and more universal than XOR network coding scheme.Moreover,to solve the problem of operations unclosed when performing the scheme,a network coding node structure which can support the scheme was designed.The coding node can ensure the scheme being accomplished in optical networks through the all-optical XOR gate and the all-optical shift register.Experiment results of some key modules of the coding node were presented.The results indicated that the modules can realize the required functions.
摘要:A Transform Domain Anti-Interference Method based on fast algorithm Cosine Modulated Filter Banks (CMFB) and Sine Modulated Filter Banks (SMFB) combining spectrum estimation is proposed.Compared with existing CMFB Transform Domain Anti-Interference Method,this method not only avoids the signal phase effect on the amplitude spectrum,but also enhances the excision capacity of short periodic stationary signals.For increasing the technical realization,fast algorithm structures of CMFB and SMFB are obtained by improving and supplementing the CMFB fast algorithm by Malvar,and then used to the proposed Anti-Interference method.The simulation and recourse analysis confirm that the multiplication and the addition of the proposed Method are just 75% and 45% of the overlapped-and-add DFT Anti-Interference Method,when the bit error rate performances are close to each other and sub-filters are enough.
摘要:Opportunistic spectrum access is an effective method to improve the spectrum utilization.In this paper,a multi-objective optimization model is proposed to take the time-variance characteristic of wireless channel,confidence level of sub-channel detection and the mutual interference between the primary networks and the cognitive radio networks into consideration,in which the effective capacity and user satisfaction are jointly optimized.Then,we also present a resource allocation scheme for power allocation and user scheduling (PAUS).The simulation results show that in lower density environment for the primary user,the proposed optimization model can achieve better performance in user satisfaction than that of the model to maximize the system capacity,and it can obtain higher network capacity than that of the optimization model to maximize the user satisfaction.
关键词:capacity;user satisfaction;resource allocation;user scheduling;cognitive radio
摘要:This paper considers linear transceiver design for amplify-and-forward multiple-input multiple-output (MIMO) multiple-relay systems,aiming to minimize the mean squared error (MSE) under the total relay transmit power constraint.We first introduce the singular value decomposition (SVD) of matrix product and simplify the original optimization problem to one which takes a singular value vector and a unitary matrix as optimization variables.By employing variable substitution and penalty term,the simplified problem only has one unitary matrix constraint.Then we develop a new Riemann Euclidean steepest descent algorithm to deal with the unitary matrix constraint.Finally,simulation results demonstrate that the performance of the proposed scheme is better than traditional schemes and closes to the lower bound of MSE.
摘要:The LFM signal and noise could be separated more effectively by FRFT than by traditional FFT.The energy gathering of FRFT spectrum is effected by duty ratio and FM bandwidth.With small duty ratio and wide FM bandwidth,the spectrum peak of FRFT would not be very sharp.The article presents a new slipping window way used in fractional Fourier filtering of LFM signal.The effect of time and frequency intercept in FRFT is also analyzed.A differentiation principle used in LFM signal detection under the condition of low SNR is provided based on the analysis before.Also,the filtering process in fractional Fourier domain is discussed in detail.It is indicated by the emulation result that blind signal could be processed by the filtering way in pipelining mode with little noise energy.The SNR could increase more than 10dB.It also indicates that the effect is improved in radar deception jamming domain.
关键词:fractional Fourier transform (FRFT);time and frequency intercept;fractional filtering;deception jamming
摘要:A method of DCF (Distributed Coordination Function) optimization—Stop and Wait DCF integrated with the rate control and its performance analysis model are proposed in order to increase the effective throughput.SNR (Signal to Noise Ratio) thresholds of rate control are determined by tuning the BER (Bit Error Rate) of frame with the help of AMC (Adaptive Modulation and Coding) technology.When the SNR is below the lowest threshold,the DCF backoff process stops and waits till the channel SNR becomes big enough again.Therefore the transmission error could be decreased.Meanwhile,the access collision could be reduced either.Since the channel time,collision probability and frame error rate are changed differently as tuning BER,maximized throughput can be get at the tradeoff point of these parameters.The analysis and simulation indicate that the proposed model is accurate.The problem without packet loss differentiation is overcome and the cross layer optimization is implemented.
关键词:IEEE 802.11;distributed coordination function(DCF);rate control;adaptive modulation and coding;optimization
摘要:Embeddedness is the core idea of social network analysis.The existing Internet structure research only uses the methods as reference but pays no attention to the social network theory.It is not conductive to understanding and mining the deep relationship between user behavior and network structure.Aiming at the limitations of framework of the correlations between users and resources,this paper constructs an analysis framework of network behavior based on user preference,proposes the view of embedded network structure,and analyzes the double embedded relationships among user behavior,Internet social network and real society network.This article present a series of measurement indexes and analysis methods from two dimensions—relational embeddedness and structural embeddedness.The study is an exploration for the deep structure of Internet.
关键词:user preference;embedded network structure;relational embeddedness;structural embeddedness;measurement index
摘要:The quality of output waveform is one important factor for the single-phase inverter.This paper proposed the algorithm based on neural network internal model theory,which is used for an output sine waveform control.Based on this control algorithm,two back propagation estimate neural networks were established.One is the internal model of single-phase inverter,which is used to estimate the actual output waveform.The other one is used to make the internal model to fit the actual single-phase inverter due to the estimate error.We finished the simulation and experiment,where the algorithm was proved that it could improve the output waveform quality and load compatibility.
关键词:single-phase inverter;internal model theory;back propagation neural network;waveform control
摘要:When there exists the array steering vector error,the performance of standard Capon beamforming will be severely degraded.In this paper,in the view of the constraints on the weight vector and the uncertainty sets,we propose a new approach,which is called Vector Optimization Robust Beamforming.It is shown that the proposed algorithm can be reformulated in a convex form as the so-called Second-Order Cone (SOC) program and solved efficiently using the well-established optimization tool,sedumi.Furthermore,this paper gives the approximate analytical expression for the adaptive weight vector,and reveals the main factors influencing the weight vector.Through the theory analysis and computer simulations,the influences of the constraint parameters,Signal Noise Ratio,snapshots,and bearing estimation errors on the output Signal Interference Noise Ratio and the spatial spectrum estimation are discussed in detail.Finally,the experimental results show that the robust high-resolution bearing estimation results can be obtained by our proposed method in practice.
关键词:information processing technology;robust adaptive beamforming;vector optimization;regularization;second-order cone program
摘要:According to the auxiliary training data with large redundancy and imbalance between positive and negative samples,an improved integrated transfer learning algorithmic -The Unbalanced Integrated Transfer Learning Algorithmic is proposed.Applied these auxiliary training data to transfer and help classifying on target data.New sample initialization and regulation weight method highlighted negative sample identification ability.Through dynamic adjusting auxiliary training set,eliminated redundant data according to the weight lower threshold,reduced their influence on the classifier and improved the transfer learning’s performance.Experimental results on the actual bridge monitoring data show that this algorithmic is advanced than TrAdaboost.
关键词:transfer learning;classifier integration;redundant data elimination;weight distribution
摘要:Particle swarm optimization (PSO) algorithm is a population-based,self-adaptive search optimization method motivated by the observation of simplified animal social behaviors.Most of the analysis of PSO algorithm is in the deterministic assumptions.Based on the theory of stochastic process,this paper studies the mean square convergence of the particle swarm optimization algorithm.Simulations demonstrate the validity of the proposed method.
摘要:Crosstalk is the major factor affecting the transmission performance of the VDSL2 system.Most of the existing crosstalk cancellation algorithms are used when the number of the users remains unchanged.In actual access environment,the old users often are offline or the new users are on-line,causing changes of crosstalk environment.In this paper,by using matrix elementary transformations and matrix partition,we propose a novel method to update the Zero-forcing cancellation method as the old users get offline.The new algorithm dramatically reduces the computational complexity of the original Zero-forcing algorithm while maintaining the same performance.Simulation results based on measured data demonstrate the effectiveness of the algorithm.
摘要:In a shared-cache multi-core architecture one thread may interfere with a second thread if the second one tries to access the shared cache simultaneously.Consequently,this causes the eviction of the second thread instructions.To track this challenge,designers need to consider runtime inter-thread interference while analyzing WCET of a real-time application on multi-core architectures.This paper proposes an iterative approach for WCET estimation which considers the circular dependence between shared bus and the runtime inter-thread interference in shared cache.Our approach analyzes inter-thread interference in shared cache based on access timings,which combines static analysis and dynamic timing estimation.The iterative method presented can improve the tightness of WCET estimation by refining estimations of inter-thread interference.Our experiments demonstrate that the proposed approach can reasonably estimate inter-thread interference in shared caches and improve the tightness of WCET estimation by an average of 21% and 14%,compared with the estimations in literatures.
摘要:The huge VLIW code size has brought serious problems to the capacity and energy consumption of instruction memory in stream architecture.Through analyzing the characteristics of instruction,this paper proposes a novel domain-divided VLIW compression scheme,designs a distributed on-chip instruction memory for stream architecture and proposes a new SIMD pipeline execution model.The experiment results show that about 38% of the off-chip instruction accessing and 65% of the on-chip instruction memory space demand can be reduced by the compression;the distributed instruction memory depresses about 37% of the area of on-chip instruction memory,and about 8.92% of the area of MASA stream processor.At the same time,the energy consumption of the instruction memory is reduced by 61%.
关键词:stream architecture;distributed instruction memory;very long instruction word compression
摘要:To assure application requirements of composition transaction,it is inevitable fact for appropriate failure recovery mechanisms that can provide reliable execution semantics.An execution semantic analysis method based on comprehensive transaction recovery mechanism including forward recovery,backward recovery and alternative recovery is proposed,by means of dynamic execution reasoning and data flow analysis of extended Petri nets,which constructs seamlessly Add/Remove recovery behavior for composition transaction.Finally,an application case with recovery capacity is implemented and shows the proposed semantic analysis method is feasible.
关键词:composition transaction;failure recovery mechanism;execution semantic analysis;extended Petri nets
摘要:How to compose services automatically and efficiently is a difficult issue,especially for a large number of services.Traditional methods based on single-computation usually come to inefficiency due to the explosion of the planning and searching space when the number of services grows too much.Based on the MapReduce framework,this paper proposes an automatic service composition method based on depth-first searching for the Top-k Qos service composition issue.The result from a serial of experiments indicates that the method can satisfy composition requirements quickly and efficiently even with a large-scale service repository.
关键词:Web service;service composition;MapReduce;backward tree
摘要:ASC (Automatic Service Composition) is the key issue in cloud computing.It is an urgent problem of ASC in cloud computing to provide multiple composition service which can satisfy the personalized requirements for large-scale users.An extended graph-planning based Top-K service composition method is proposed in this paper.By using service indexes and the auxiliary nodes in extended planning graph,Top-K composition service can be found through one search.The approach can improve the efficiency of service composition and ensure the correctness of the result.It applies to the ASC problem in cloud which has a large number of services and the users' requirements are personalized.
摘要:Cost sensitive learning is the hot research area in machine learning.In practical real applications,the datasets are usually class-imbalanced,most of the samples are unlabeled,only a few of the samples are labeled,and noise samples are existed.Although some progress has been made in cost sensitive learning for such situation,it needs further solved.For that we propose a semi-supervised Laplacian support vector machine based on cost sensitive learning.On the basis of label propagation,the proposed model integrates the misclassification costs considering class-imbalance into the hinge loss and Laplacian regularization of the Laplacian support vector machine.At the same time,considering the effect on the decision hypersphere of the noise samples,we define an example-dependent cost which makes the weights of noise samples lower.The experimental results on 7 UCI,8 NASA datasets demonstrate the superiority of our proposed algorithm.
关键词:cost sensitive learning;semi-supervised learning;Laplacian support vector machine
摘要:How to reconstruct the original image from fewer observations is still a crucial question in compressed imaging.According to the probability distribution characteristics of the random projection energy,a novel adaptive sampling method and the corresponding reconstruction algorithm are proposed.The algorithm makes full use of the priors of the sparse representation based on the dictionary and the non-local properties.In order to achieve the sparse image representation,we construct the redundant dictionary that contains several directional dictionaries and one orthogonal DCT dictionary,and solve the sparse optimization problem with constraint of l1 norm.The proposed compressed imaging algorithm which combines the local traits of the image patches and the non-local properties of the image can reconstruct the high quality image in low sampling rate.
摘要:Compensation of wall effects is the key problem of Synthetic Aperture Radar (SAR) in through-the-wall imaging.Wall parameters are usually unknown,which are essential for wall effects compensation.In this paper,an approach to compensate wall effects in the image domain is proposed on the quantitative analysis of the wall effects on focusing and locating of behind-the-wall targets.The proposed method estimates the wall parameters from the image formed by traditional image formations and its filtered results,which has the advantages of high precision and low computational burden.It is validated that the proposed method can precisely focus and locate behind-the-wall targets using simulated data.
摘要:A new polarization-space-time joint domain processing (PST-JDP) method is proposed,because it is difficult to suppress clutter and to detect slowly moving target in airborne radar.The method uses adequately the three-domain information which includes the polarization,space and Doppler frequency information of radar echo.It is shown that polarization information together with space and Doppler frequency information can be used effectively to significantly enhance the performance of clutter suppression in airborne radar.Signal model and adaptive algorithm model are established.Some new techniques,(i.e.,covariance matrix eigendecomposition,spectral analysis and resolution grid method),are utilized for deriving the performance of PST-JDP.The main factors which affect on the performance of clutter rejection are the spatial,Doppler and polarized matching coefficient,and slope of clutter ridge,signal-to-noise ratio (SNR),input clutter-to-noise ratio (CNR).The new PST-JDP method performed significantly better than the traditional optimum space-time processing technology,especially in the case of the target slowly moving.Simulations demonstrate the correctness of models.
关键词:polarization array;space time adaptive processing;clutter suppression;polarization-space-time joint domain processing
摘要:Signal understanding of multifunction radars is one of the difficult issues in the field of Electronic Intelligence (ELINT).The search schema of multifunction radars is modeled as a task sequence,and a new method is proposed based on sequence alignment which is used extensively for biological sequence analysis in the field of bioinformatics.The recognition is achieved by extracting the similarity between two observed signal intervals.Simulation results show that the method is applicable and effective.
摘要:Finite Sets Statistics (FISST) provides an "engineering friendly" theoretic tool for target tracking in clutter.An overview of the studies on the FISST-based target tracking techniques is presented here.Special attention is paid to the following areas:optimal multi-target Bayes filter and its principled approximations,multi-target filter under unknown parameters,multiple maneuvering targets tracking,track-valued estimation,Joint Target detection and Tracking Filter (JoTTF),Bayesian filtering with random finite set observations,and also the relevant applications.Finally,based on the progress of existing research in these areas,some key issues to enhance the precision and robustness of target tracking further are introduced which deserve more attention of the researchers' for solution.These include:performance evaluation of multi-target filtering,dim/small target tracking,multiple maneuvering targets tracking,multi-sensor multi-target tracking,Joint target Detection,Tracking and Classification (JDTC),and so on.
关键词:target tracking;finite sets statistics;probability hypothesis density filter;joint target detection,tracking and classification
摘要:A blind subspace code-aided technique for narrow-band interference (NBI) suppression of direct sequence-code division multiple access (DS-CDMA) systems is proposed.This technique is to improve the performance of direct matrix inverse (DMI) code-aided technique.The rejection of this technique is against three type of NBI,namely,sinusoidal tones,data NBI and autoregressive (AR) stochastic process by jointly estimating character space of virtual CDMA formed by CDMA and NBI.In this paper,signal to noise and interference rate (SINR) performance of blind subspace code-aided is addressed and revealed superiority with blind DMI code-aided.The feasibility of proposed technique is proved through simulations.
关键词:DS-CDMA;NBI suppression;blind subspace code-aided technique;blind direct matrix inverse code-aide technique
摘要:The decoding order has a deep impact on the complexity of sphere detection.A new ordering scheme for sphere decoding algorithm is presented in this paper which is based on the reliability defined by the accumulated probability of the difference between symbol element and the zero forcing solution.The proposed ordering scheme takes into account the channel states,the receiver signal and the effect of the noise amplification to get the decoding order according to the probability.The simulation results show that the proposed scheme can achieve a significant complexity reduction.
摘要:This paper proposes a new algorithm that can be used for estimating the parameters of a sinusoidal frequency modulated (FM) signal.Asymptotic statistical results are derived for the modulation index and amplitude estimates.Simulation results show that the theoretical results are asymptotically optimal at the SNR above -3dB,which indicates the efficiency and superiority of the proposed algorithm as well as the exactness of the accuracy analysis.
关键词:parameters estimation;sinusoid FM signal;cyclic autocorrelation function maximum search (CAFMS) algorithm;modulation index;estimation accuracy
摘要:The current state-of-the-art spatial window aggregation query processing algorithms in wireless sensor networks do not take node movement,link failures and node failures into consideration in an integrated way,which results in low query success rate and large energy consumption.We propose a spatial window query processing algorithm called RSA which takes advantage of node redundancy to ensure the robustness of query processing.It divides the query region into several grids and collects the data of the nodes within each grid along a well-designed itinerary.An adaptive grid size setting method and a representative node selection strategy for the grids is put forward to reduce energy consumption and increase query success rate.We propose an approach based on target rectangle to bypass the region without nodes in order to avoid interruptions in the process of query processing.Experimental results show that RSA outperforms the existing IWQE algorithm.
摘要:Collaborative transmission is an efficient solution to high-speed wireless communication and the question of rate allocation arises as how to divide the traffic flow among networks.As the players in collaborative transmission,heterogeneous networks would like choose collectively an outcome in the negotiating method to benefit all the individuals,which is a progress of bargaining.Then the static rate allocation over networks is formulated as a weighted bargaining game framework,where the heterogeneity of the transmission capabilities of different networks is taken into account.With the minimized transmission time as the optimal objective,the utility function is proved to be convex and the closed Nash bargaining solution is derived with the Lagrange multipliers method.Moreover,an algorithm is presented to realize rate allocation in the multi-mode device.Simulation results demonstrate that the proposed method is more efficient with the least transmission time and suitable for the emergency communication scenario.
摘要:Reconfigurable processor suffers a severely performance loss from reconfiguration overhead.A NN(neural network algorithm) based configuration prefetching algorithm was proposed in this paper to reduce the overhead.Not only the receptor weight but also the history RFUOP ID constructs an advanced receptor model.The neural network studies the RFUOP trace through collaborative training of receptor weight and history RFUOP ID.With the learning result,the neural network predicts next RFUOPs and completes configuration prefetching,overlapping the configuration loading with the computation on the host processor.Furthermore,an extensible architecture for neural network storage was proposed.As a component of RFUOP,reception information is located on off-chip memory and linked to corresponding configuration field.Once configuration was prefetched,neuron information was loaded and computed for next prediction.Experiments show that the NN-based prefetching algorithm can reach 91% prediction accuracy,while gaining performance improving by 40% on average.
摘要:In this paper,the phase space reconstruction of audio time sequences producing by different instruments is discussed based on the nonlinear dynamic theory.The dense ratio,a novel quantitative recurrence parameter,is proposed to describe the difference of wind,string and keyboard instruments in the phase space by analyzing the recursive property of every instrument.In addition,a method of musical instrument family classification is developed using several classification models by combining the dense ratio with traditional timbre features.The experiments indicate that the accuracy of the proposed method is improved by 4%-7% and 3% in the instrument family classification and individual instrument classification,respectively.
关键词:musical instrument classification;nonlinear dynamic theory;phase space reconstruction;dense ratio;recurrence plot
摘要:Generally,in the situation of vast amount of Web services,it is often a challenge to automatically searching for Top-k QoS-optimal service composition plans.To address the challenge,service composition modeling is proposed firstly.Then,a forward service filtering algorithm is employed for reducing solution spaces.Lastly,a greedy-based pruning algorithm is designed for backward searching for Top-k QoS-optimal solutions efficiently.In addition,a platform is designed for implementing the proposed method,and its experiment results validate the effectiveness and efficiency of the method.
关键词:Web service;service composition;quality of service (QoS);ontological semantics;pruning
摘要:Fuzzy commitment based on classical cryptographic algorithms can not resist the attack of quantum algorithms.This paper presents a quantum fuzzy commitment by using entanglement-assisted quantum error correcting codes and quantum hash.Fuzzy commitment set can be constructed from the codes space of the entanglement-assisted quantum error-correcting codes,and the quantum codes need not satisfy the requirement of self-dual constraint.In commitment phase,the code word is transformed based on commitment witness.The information process can resist quantum Fourier sampling attack.Then,we present a quantum hash algorithm.The random qubits are adjusted with diffusion and confusion,and then encrypted by using the random secret key.The security of the process is same as the one-time pad.The proposed scheme can resist the attack of quantum Turing machines.Based on the quantum fuzzy commitment,this paper also gives a quantum challenge-response biometric authentication scheme.Theoretical analysis shows that our protocol has good security and validity.