摘要:Because a key step of Grobner basis attack on Rijndael is constructing its zero-dimensional Grobner basis,authors perform some particular studies on the linear transformation and the system of multivariate polynomial equations of Rijndael-192,and propose its zero-dimensional Grobner basis construction method through choosing suitable term order and variable order.After presenting the construction method of the Grobner basis,authors give the necessary theorical proves.Moreover,authors propose an algebraic attack on Rijndael-192 based on Grobner basis.Analysis suggest that the attack complexity is lower than exhaustive attack.
关键词:Rijndael algorithm;Grobner basis;Algebraic attack;Multivariate equation system
摘要:A centralized hough track initialization algorithm is introduced for line in 3 dimensions space.Based on Roberts representation of 3D line,the hypothesis statistics is designed for Roberts parameters similarity.Through random sampling data from multiple sensors,the candidate Roberts parameter for 3D line is created corresponding to the data samples.Similar Roberts parameters are merged to accumulate to proper detection threshold for valid and credible line track.To reduce unreasonable random sampling and improper Roberts parameter merging,the object moving speed constrains are check when algorithm is realized,which will not only speeds up algorithm,but also decreases track false alarm ratio.Through performance analysis from simulation,our 3D centralized hough algorithm can be adapted to multi-sensor,multi-object environment,where different data updating rates,dense clutter and strong jamming will be encountered.
摘要:A novel algorithm for near-field acoustic source localization,i.e.,range and Direction-of-Arrival (DOA) estimation by using a velocity sensor array is proposed in this paper.Compared with the existing algorithms,the proposed one has the following advantages:No need to compute higher-order cumulants,hence having lower computational loads; achieving automatic pairing in range and DOA estimation,and having no limitation of the intersensor spacing within 1/4-wavelength,and enabling to obtain higher estimation accuracy by increasing the intersensor spacing for a larger array aperture.Monte-Carlo simulations are presented to verify the efficacy of the proposed algorithm.
摘要:According to the difficulties in the evolving large scale neural networks using the traditional direct encoding methods,many researchers are proposing the novel indirect encoding methods for evolutionary neural networks.That is,a network structure that repeats many times can be represented by a single set of genes that is reused in mapping from genotype to phenotype,and such genetic reuse allows searching the large scale neural networks through a lower dimensional genotypic space.In this paper,we introduce a general computational framework for the indirect encoding methods of evolutionary neural networks through the study of existed methods,in which every evolutionary process of neural networks is divided into three stages:development,learning and evolution.Additionally,we analyze the advantages and disadvantages for the different indirect encoding methods from two aspects of the computational framework:genome evolution and neural network development.
摘要:Algebraic-side channel attack(ASCA) was proposed by Renauld et al.which combines algebraic attack and side channel attack.The current research of ASCA mainly focuses on the 8-bit implementation of a block cipher.For 64-bit platform,there is no such research.This paper gives an extended algebraic side channel attack which represents the leaked information as explicit function of the key bits.Compared with the original ASCA,the extended ASCA needs less leaked information.As an application,we give an extended ASCA on LBlock light weight block cipher:For LBlock implemented on 64-bit platform,if the Hamming weight of the output of 1-3 round of LBlock can be obtained without error,then with 35 known plaintexts,an equation system concerning the 80 bit maser key can be set up;on a general PC,the 80 bit master key can be obtained in a minute by using Magma mathematical software v2.12-16 to find the Groebner basis.This is the first ASCA attack on LBlock,which shows that the method of moving form 8-bit platform to larger devices suggested by Renauld et al.to prevent ASCA is not enough.
关键词:lightweight block cipher;LBlock;algebraic side channel attack;Magma mathematical software;Groebner basis
摘要:Standard particle swarm optimization presented in 2007(namely,PSO-2007)inclines towards stagnation phenomena in the later stage of evolution,which leads to premature convergence.Therefore,a PSO based on dynamic boundary(namely,DBPSO)is proposed in this paper.According to the movement characteristics of particles at stagnation stage,DBPSO introduces a strategy of boundary adjusting in PSO-2007.By tracking the distribution of the particles’locations,DBPSO adjusts the boundary of search space dynamically,which could guide the particles to more promising region.This strategy helps PSO-2007 decrease premature convergence and improve convergence precision.The results of experiments of four typical functions show that DBPSO are feasible and effective.
摘要:For global numeric optimization problems,this paper presents a novel heuristic global optimization algorithm based on membrane computing.Inspired by the irregular movement of liquid molecules,two mechanisms are designed to simulate the movement of molecules along an arbitrary direction or a certain direction.These two mechanisms enable the algorithm to implement global exploration and local exploitation.Simulation results for eight benchmark functions indicate that the proposed algorithm can maintain the diversity of solutions,and jump out of local minima.
摘要:The concept of strong left-continuous t-norm and SMTL propositional logic system is introduced.It is proved that the left continuous t-norm is the strong left-continuous t-norm if and only if its adjoining implication operator is strong regular implication operator.Based on the fuzzy propositional logic of strong regular implication operator the integral truth degree of formula is defined and inference rules w.r.t the integral truth degree of formula is proved.Moreover,a pseudo-metric is defined therefrom on the set of formulas in SMTL system,and three models for approximate reasoning are given,hence a possible framework suitable for developing approximate reasoning theory in SMTL propositional logic is established.
摘要:In this paper,we identified the features of passive worm.Further the models of propagation and immunization of passive worms are proposed in the mean-field methods.Based on the model of worm propagation and Epidemiology,the sufficient condition for the global stability of the worm free equilibrium is deduced.Simulations validate the condition.Both the sufficient condition and all the experiment results show that amongst all P2P-related factors having effect on passive wormpropagation,attack performance of passive worms is most sensitive to two P2P system parameters:the download rate and the recovery rate.Controlling the two parameters,i.e.decreasing the download rate and increasing the recovery rate,provides an effective means for throttling the spread of passive worms.
摘要:Two new constructions of shift sequence are proposed and the upper bound of the shift distinct sequence sets is computed.The concepts of initial point and initial distance are presented.CBIID selects initial point arbitrarily and multiple distinct shift sequence sets are obtained by designing suitable initial distance.By utilizing interleaving technique one can get multiple shift distinct low-correlation zone or zero-correlation zone(LCZ/ZCZ)sequence sets.The initial point is selected flexibly,so it is the expansion of the existing methods.CBVID,which is based on CBIID,designs shift sequence based on different initial distance in a shift sequence set.It can gain more spread-spectrum sequences for quasi-synchronous code-division multiple-access(QS-CDMA)system compared with previous constructions.Shift distinct LCZ/ZCZ sequence sets are allocated to different cells to reduce interference.
关键词:quasi-synchronous code-division multiple-access(QS-CDMA);low correlation zone or zero correlation zone;interleaving;shift sequence;shift distinct
摘要:When the information of partial data is missing,the classical fuzzy systems constructed based on this dataset will have the weak generalization abilities for this scene.In order to overcome this shortcoming,the fuzzy system with the transfer learning abilities,i.e.,transfer fuzzy system,is proposed.In the learning procedure,the transfer fuzzy system can learn not only from the data information in the current scene,but also from the existing useful historical knowledge.Based on this idea,a transfer learning mechanism.a specified,and L2-norm penalty based 0-order-TSK-transfer fuzzy system(0-L2-TSK-TFS)was proposed,and a transfer learning mechanism was introducde.The proposed method was verified by experiments on simulation data and real data,and shows better adaptability than traditional fuzzy modeling methods in the scene with information missing.
关键词:transfer learning;information missing;history knowledge;0-order-L2-norm-Takagi-Sugeno-Kang fuzzy system
摘要:How to improve the reconstructed image quality using inherent prior knowledge of natural image is still a crucial issue in compressive imaging.In this paper,an efficient compressive imaging algorithm is proposed,which combines the sparse property of the entire image patches and the manifold property.In the algorithm,image patches are represented sparsely by a dictionary and approximated simultaneously by a set of neighbor points.These neighbor points are embedded in the same manifold with the original signal,ensuring that the recovered signal using sparse approximation is close with its manifold.In addition,the proposed compressive imaging algorithm which makes full use of the sparse properties of patches in any position of the image can reconstruct the high quality image in low sampling rate.
摘要:The faults occurring in the input ports and crossbar of the router will seriously affect the performance of the entire network in Three-dimensional Network-on-Chip.This article proposes a fault and congestion-aware fault-tolerant router.By adding a redundancy of the input port and the bypass bus,our scheme can achieve fault tolerance of input ports and crossbar faults,and can effectively solve the congestion problem in the case of no fault port using the redundant port.The fault tolerance mechanism proposed can tolerate more fault-routers and still maintain good performance in a serious case of congestion.
摘要:MQ-encoder is a key bottleneck in the JPEG2000 image compression system.In this paper,the dependence between contexts in the MQ-encoder has been extracted;and an improved mechanism has been proposed to acquire indexes by separating the "start-up" states and remaining states.Besides,a prediction method has been proposed to resolve the stall problem when the current context is the same as the previous context.Also the probabilities of MPS and LPS coding events in the renormalization procedure have been analyzed;and either of the MPS and LPS coding events has been optimized.Based on this improved arithmetic,a VLSI architecture for Two-context MQ-encoder is proposed.Synthesis result shows that the processing speed of the MQ-encoder could reach as high as 286.80MHz with a throughput of 573.60Msymbols/sec.Compared with the "Brute force with modified byteout" architecture,the throughput obtained in this work has been improved by 35% and the area has been reduced by 78%.
摘要:Considering a linear sparse array with the constraints of the array aperture,the minimum and the maximum element spacing,an improved genetic algorithm(IGA)for the element position synthesis is proposed to reduce the peak sidelobe level(PSLL)of the array.In order to avoid the infeasible solution during the optimization,a special vector mapping between the element spaces and their gene coding is utilized by the IGA.Then the strong constrained optimization problem is transformed to an optimization problem with only upper and lower limit,and the infeasible solution is naturally avoided.The computational cost of the IGA can be far less than that of a recently reported modified real genetic algorithm.And the efficiency and the robustness of the IGA have been illustrated clearly from the simulations.
摘要:Two novel methods,which are referred to as signal subspace comparison method(SSCM)and antenna pattern method(APM),are proposed to estimate the channel phase errors for spaceborne high resolution and wide swath(HRWS)synthetic aperture radar(SAR)system.The SSCM is based on the fact that the space spanned by the signal eigenvectors referred to as the signal subspace is equal to that by the practical steering vectors.One of the great advantages of this method is its low computational burden and high accuracy.Combined with the antenna patterns,the APM estimates the channel phase errors directly without decomposing the covariance matrix,which is suitable for uniform distributed scenes.Finally,the ground-based real data confirms the validity of the two approaches.
摘要:As one of the most popular techniques for direction-of-arrival(DOA)estimation,the multiple signal classification(MUSIC)algorithm has a tremendous computational complexity for 2-D DOA estimation problems,which is mainly caused by an involved 2-D spectral search step.To reduce the complexity,a new algorithm named the transformed domain MUSIC(TD-MUSIC)for fast 2-D DOA estimation with arbitrary arrays is presented by this work based on a new concept of the transformed domain DOA.It is shown by theoretical analysis and experiment results that TD-MUSIC not only realizes a compression for the spectral search region,but also has a dimension-reduced noise subspace and hence,it requires much lower complexity than the standard MUSIC.Moreover,the new method also shows an improved resolution as compared to MUSIC.
关键词:transformed domain MUSIC;direction-of-arrival estimation;virtual source;alternate projection method(APM);singular value decomposition(SVD)
摘要:A broadband beamforming algorithm in time-domain with minimum sidelobe and constant beamwidth on convex optimization is proposed.The array response is expressed as a linear function of a set of the finite impulse response(FIR)filter weights.The filter weights are designed in the optimized constraint beamwidth and minimum sidelobes minimizing the sidelobes while guaranteeing the beamwidth invariance.Norm constraint on tap weights and nulls widening constraint in the direction of the interference are also imposed to improve the robustness of the beamformer.The construction process of the desired response and the approaching process of the actual response are combined together to get the global optimal solution.Computationally efficient convex formulation for beamformer design problem is derived.Simulation results demonstrate the satisfactory performance of the proposed algorithm.
摘要:Wideband digital channelized receivers have an important application in Electronic Warfare(EW)and wireless communication,especially in Electronic Intelligence systems(ELINT)and Radar Warning Receiver(RWR)systems.This paper introduces the channelized receiver systems and the structures of the channelized technique.And base on the analysis of the development history of the channelized Receivers,we can see that the channelized Receivers system trend towards wideband digital and the digital channelized technique trend towards nouniform channelized to make channelized Receivers more suitable to the modern EW.
摘要:Time synchronization is the basis for collaboration across multiple sensor nodes.Underwater sensor networks (UWSNs) have different characteristics from the terrestrial wireless sensor networks,where communication is primarily via acoustic signals,producing new challenges to time synchronization.This paper first illustrates the definitions of the problem and algorithm of time synchronization,describes the major differences between underwater acoustic communication and terrestrial wireless communication,and discusses the influences to time synchronization causing by these differences;then reviews the terrestrial time synchronization algorithms,pointing out the reasons why such algorithms cannot be applied to underwater environment.Afterwards,a thorough review of the research progress on time synchronization for UWSNs has been presented with the performance comparison among four major algorithms through simulations.Finally,we summarize the crucial issues on time synchronization for UWSNs,and indicate the future research directions.
关键词:time synchronization;high-latency network;underwater sensor networks;acoustic communication
摘要:Data uncertainty is pervasive in various fields,for example,economy,military,logistic,finance and telecommunication,etc.Uncertain data are inherent in some important applications,such as environmental surveillance,market analysis,Location-Based Service(LBS),and quantitative economics research.Due to the importance of those applications and the rapidly increasing amount of uncertain data collected and accumulated,querying large collections of uncertain data has become an important task and has received more and more attention from the database community in recent years.This paper introduces the principle of uncertain data query,and surveys the advance of the research on uncertain data query processing,including Nearest Neighbor(NN)query,Reverse Nearest Neighbor(RNN)query,Ranking query,top-k query and join query.By a detailed comparison,the pros and cons of the techniques are discussed.In the end,the problems in current research and some future research issues are outlined.
摘要:For some complex specified domain retrieval requirements,many researches use semantic related technologies to resolve such problems.In terms of rule inference,it always leverages the inference algorithm of Semantic Web directly.However,the efficiency is not good.On the respects of searching results ordering,the ordering algorithm for search engine,which is based on keywords,is not suitable for ranking on search results generated by semantic retrieving.Focusing on the above issues,this paper proposes a semantic rule modeling method,and gives a new rule reasoning algorithm based on closed world assumption backwards reasoning chain to get higher inference efficiency compared to most semantic inference engines.Moreover,this paper proposes a new ordering algorithm based on feature similarity.Taking advantage of the above methods this paper describes,the search engine-Material Hub has been built up.Experiments show this semantic search engine improves the searching precision rate,recall rate,and rational responding time.So far,this system has been applied in industry.
摘要:Compressed Imaging (CI) is one of the most important research area of compressed sensing.Analyzing the constraints on actual measurement matrix and measurement values in CI,a frequency domain phase encoding CI method is proposed,which can be physically realized based on 4-f optical architecture.This method exploits two-way optical architecture compensated for the phase-encoding CI to implement the value non-negative for recording,and then accurately recover the original image from the measured values,to resolve inconsistencies between the theoretical requirements and physical constraints in CI.With measured values can be obtained in a single exposure,such method can reconstruct the original image precisely without additional information,and is a very practical scheme for physical realization of CI.Simulation experiments demonstrate that our proposed method can effectively capture compressed measurements of image and achieve super-resolution reconstruction.
摘要:In consideration of the cast shadows,specularities,occlusions and corruptions in the images that violate the low-rank structure,a novel recognition method of joint sparse representation based on low-rank subspace recovery is proposed.Firstly,using all training images of each class to form a data matrix D,we can decompose D as the sum of a low-rank matrix A and a sparse error matrix E,where A denotes the"clean"images which follow strictly the low-rank subspace structure and E accounts for cast shadows,specularities,occlusions and corruptions in the images that violate the low-rank structure.Then the test sample can be represented as the linear combination of dictionary which is composed of low rank matrix and error matrix,using the sparse approximation of this two parts calculates the residual which used for classification.Experiment results show that the algorithm is effective ,and effectively improve the recognition accuracy.
摘要:Aiming to resolve the classification problem that image samples are multi-subclass distributed and non-linearly separable,a kernel two-dimensional subclass discriminant analysis algorithm (K2DSDA) is proposed.In this paper,it has shown that K2DSDA algorithm is theoretically equivalent to column/row-2DSDA based algorithm on kernel samples.Meanwhile,the optimal discriminant vectors are computed via the approximate kernel samples,so that the computational complexity is greatly reduced.The experimental results which tested on benchmark face database show that the proposed algorithm is superior to other state-of-the-art discriminant analysis algorithms,which confirms the effectiveness of K2DSDA.
摘要:An improved super-resolution image reconstruction algorithm based on dictionary-learning is studied in order to solve the problem that the dictionary training process is time-consuming in the existing algorithms.The K-SVD dictionary algorithm is combined with the idea that the high and low resolution dictionaries can be co-generated.Then the high and low resolution dictionaries generated are used to the super-resolution reconstruction algorithm via sparse representation.Experiment results show that the algorithm can not only reduce the time of the dictionary training effectively,and also improve the quality of the reconstruction of high-resolution images.
关键词:super-resolution;K-SVD;dictionary-learning;joint dictionary training
摘要:A proximity box based detection algorithm is presented to improve the efficiency of proximity detecting in distributed environment.Proximity detection is to find each pair of friends such that the distance between them is within a given threshold.Servers in Location-Based Services are likely to be the bottlenecks in large scale proximity detecting,therefore,the state-art-of proximity detection methods are designed with the goal to reduce the server load.In this paper,we propose a detecting method based on proximity box instead of the Euclidean distance or the shorted distance,thereby improving the processing efficiency of the system.At user client,an adaptive method with the road map information is introduced to predicting the user’s security moving zone for reducing the message exchange between the client and server.The detailed steps of the proximity detection algorithm are given and approaches to deal with suspected proximity user are discussed.An indexing algorithm for moving users and proximity relations between friends is also discussed.The experimental results indicate the algorithm is effective in a real city map.The results also prove that proposed index algorithm can significantly improve the overall efficiency of the system.
摘要:A reprogramming protocol named MovPro was proposed.MovPro is used to disseminating large block of binary image from the mobile sink to all other sensor nodes in wireless sensor network over multiple hops.When the sink walks in the sensor network,it reliably transmits the new binary image to the sensor nodes along its traveling trajectory.After receiving part of the new binary image,these nodes reliably propagate the received image to the rest of the network.MovPro is the first real reprogramming system in sensor networks with mobile sink.We apply window transfer method to reduce the radio transmissions so as to save energy.And a BitVector method is also adopted in order to reduce the number of flash writes.Experiments demonstrate that MovPro works well in sensor networks with mobile sinks.
摘要:A threshold attribute-based signature (t-ABS) scheme defines each signer with a set of attributes,which determine signature ability for each signer.In a t-ABS,signature holder prove possession of signatures by revealing only a threshold number of attributes in common with the verification attribute set,hence providing signer-attribute privacy for the signers.In this paper,we analyze a flexiblethreshold ABS proposed by Li et al and demonstrate its vulnerability to forgeable attacks.Finally,we introduce a t-ABS scheme,which is proved to be secure in the standard model based on CDH problem.
关键词:threshold attribute-based signature;security;standard model
摘要:A novel TLP simulation method for ESD protection device in integrated circuit is proposed,which is similar with the real TLP process.By imposing series of current pulses on the device structure,the corresponding voltage vs.time curves are obtained.The average current value in the range of 70%~90% time for each I-t curve is calculated,and so is the average voltage value,and hence the simulated I-V curve can be obtained,from which not only the trigger voltage and the holding voltage,but also the second breakdown current can be evaluated.The simulation results for LSCR fit well with the test one,from which the validity of this method can be verified.
摘要:The stability and reliability of multicore systems have been gotten more attentions with the widely used in all kinds of fields.After analyzing the current reliability model for chips,a reliability evaluating model considering the temperature and workloads for the multiprocessor is proposed.Based on construction characteristic of the multiprocessor,the model hierarchically constructs the evaluating index from instruction level to the task level that enables to quantitatively evaluate the reliability of the multiprocessor.To check the effectiveness of this model,a stability-oriented task scheduling algorithm is designed to enhance the stability of multicore system.It calculates the evaluating index for each scheduling scheme and chooses the scheduling scheme with highest evaluating index to obtain the low error rate caused by multicore.According to the results of simulation experiment,we can see that this model and method are effective that have the potential to reduce 45% of the error in multicore system.
关键词:multicore system;task scheduling;stability;error evaluating model
摘要:PID control which has integrator,causes motor system response slow.Differences are shown between waves of phase-voltage and ideal square wave related to the influence of inductance in reversing process,leading to large torque ripple and slow response of speed.An optimized design of control system based on dynamic soft variable structure control is presented,by changing the control strategy of soft variable structure,and combining the stable linear system.Results of simulation experiments show that dynamic soft variable structure control compared PID control is with better performance,fast in speed response and small torque ripple.Dynamic soft variable structure control also can be applied to optimize the design of other control systems.
摘要:Local characteristic-scale decomposition(LCD)was a new non-stationary data analysis method,which was proposed recently and similar to empirical mode decomposition(EMD).In order to solve its mode mixing problem,firstly a noise-assisted data analysis method named ensemble local characteristic-scale decomposition(ELCD)is presented.However,since ELCD inherited the shortcomings of ensemble empirical mode decomposition(EEMD)and complementary ensemble empirical mode decomposition(CEEMD),in the same time,based on the new randomicity detecting method-permutation entropy(PE),another method for restraining mode mixing called partly ensemble local characteristic-scale decomposition(PELCD)had been proposed in this paper.Lastly,the novel method was compared with the existing method(CEEMD)by analyzing simulation data and real data and the results indicate that the proposed method can restrain the phenomenon of mode mixing effectively and is superior to ELCD and other traditional noise-assisted method in aspects of inhibiting false components and improving the accuracy of components.
摘要:In order to overcome the problems of traditional evolution algorithms in designing digital logic circuits,such as slow evolution speed and premature convergence,a memetic algorithm (MA) for evolving digital circuits is presented based on CGP encoding.It adopts genetic algorithm as global search method.A local search strategy based on gate type is proposed.The search ability of the proposed method is tested by evolving one-bit full adder.Experimental results show that it is efficient in solving the problems of hardware evolution and has the ability of fast global and local convergence.