LUO Yi-ping, XIA Wen-hua, LIU Guo-rong, DENG Fei-qi
Vol. 36, Issue 4, Pages: 609-613(2008)
摘要:Based on extended Hanalay inequality,the exponential asymptotic stability for a class of cellular neural networks with delays and reaction-diffusion terms is investigated by using Poincare inequality. The obtained criteria have a distinguished feature from previous studies,and our results contain diffusion operator terms. The new results are less conservative than the existing ones. Finally,an illustrative example is give to verify the effectiveness of the method.
LU Xin-guo, LIN Ya-ping, WANG Hai-jun, LI Xiao-long, YI Ye-qing
Vol. 36, Issue 4, Pages: 614-619(2008)
摘要:Classification of patient samples with gene expression profiles is important to cancer treatment.In the large redundant and high dimensional gene expression data,a cancer is sensitive to some cancerogenic factors while another cancer is sensitive to some others.So we proposed a weight based classification with relative space(WCRS).The main idea is that a cancer’s relative space is obtained via the diagonalization of its covariance matrix,and we built the cancer’s model based on its relative space.Then the energy of a cancer is presented for measuring its relative spaces,and a minimal spread space based classification algorithm is proposed.The experiments show WCRS makes better precision than traditional classifications.
关键词:cancer classification;gene expression profile;relative space
WANG Kun, LI San-li, CHAI Yun-peng, WANG Xiao-ying
Vol. 36, Issue 4, Pages: 620-626(2008)
摘要:As a service oriented architecture,data grid provides distributed data access,storage and management for remote users.It has become growing concern among developers about the data classification issue in data grid environment.This paper proposes a high-efficient system used in data grid which makes dynamical synthesis of multiple methods(DSMM),distributes workloads to each node of the grid with the load-balance premise,and improves the low classification accuracy points of traditional methods.In spite of that,as an application in loose coupling grid environment,DSMM,which provides life time management of multiple classification methods,guarantees its robustness and flexibility.Experiment uses 2927 breast cancer cases and proves that the DSMM system has flexibility,high efficiency and increases the classification accuracy in data grid.
摘要:On the basis of linear phase and perfect reconstruction characteristics of M-channel LPPRFB,not only is the necessary and sufficient condition for choosing analysis filters’symmetry polarities and lengths found,but also the permissible combinations of analysis filters and the relation of analysis filters’lengths are derived. Consequently,a general method for choosing analysis filters’symmetry polarities and lengths of M-channel LPPRFB is proposed. The generality and availability of the method is verified by the strict derivations and the results of M-channel LPPRFB reported in the literature.
关键词:filter banks;linear phase;perfect reconstruction;permissible combinations of analysis filters
摘要:In WI coding scheme,how to decompose and quantize the characteristic waveforms with low delay,low complexity and high precision have always been a hot research topic.The characteristic waveform decomposition based on non-negative matrix factorization is proposed in this paper.This CW decomposition method doesn't bring any additional delay to WI coder;In order to improve decomposition precision,the CW is firstly classified according to the maximum pitch of its sub-frames before being decomposed.Besides,band-partitioning initialization constraints are set to basis vectors before NMF is carried out,and this has made the CW decomposition precision of NMF-based method be comparable with that of 2 ranks of SVD;In order to reduce the computational complexity of WI coder,the CW alignment procedure is removed in our NMF-WI coder,and the factorization rank of NMF is set to 16 as a trade-off between computational complexity and decomposition precision.In the end,the low dimensional coding matrix is quantized by splitting matrix quantization scheme.The subjective A/B listening tests show that the proposed 2kb/s NMF-WI coder can give smooth speech with quality close to 2.4kb/s SVD-based WI coder.Mean Opinion Score test results indicate that the performance of proposed coder is a little worse than that of 2.4kbps MELP coder.
摘要:A new fast two dimension 8×8 Inverse Discrete Cosine Transform (IDCT) algorithm based on Look-Up Table (LUT) is presented,in which,the LUT structure is based on the DCT basic images.The LUT size is decreased by using two techniques.One is to use the symmetries of the basic images;another is to elicit the range of each quantized DCT coefficient. As a result,the LUT only has 10.9746K data.If the quantization matrix has the symmetry q(u,v)=q(v,u),the LUT size can be decreased half nearly again.The new algorithm avoids multiplications by using LUT and decreases additions greatly by utilizing the characteristics of actual images and the symmetries of the basic images. The experimental results indicate that it only needs 182 additions averagely and decreases about 15 percent of additions besides eliminating multiplications compared with Feig’s algorithm that needs least arithmetic operations nowadays.
摘要:To reduce the psudo-Gibbs effects and the"curvelet like"aliased curves resulted from using curvelet transform for image denoising,a noise removal method which combines computational harmonic analysis and variation is presented.Firstly,the nonlinear thresholding strategy is applied to the coefficients of the second generation curvelet transform of noisy image.And then,a total variation regularization model with constraint condition on curvelet transform domain is established,whose feasible domain is determined by the coefficients remained.Finally,the projected gradient algorithm is used to solve the model.Experiments show that the method can remove noisy and remain edges,while the distortions are suppressed efficiently,and that the vision effect has an advantage of improving.
摘要:All Optical Wavelength Conversion(AOWC)of 2.5Gbit/s non return-to-zero(NRZ)data based on cross-gain modulation(XGM)in a semiconductor optical amplifier(SOA)is demonstrated.The experiment shows that the power and wavelength of input light have great influence on extinction ratio(ER),signal to noise ratio(SNR)and average power of converted signal.Optical SNR of converted signal is larger than 40dB.ER and SNR of detected signal are both larger than 10dB,meeting ITU-T G.691 standard.The wavelength separation for down-conversion is larger than 60nm.This is the largest separation achieved from wavelength down-conversion based on XGM in SOA.
摘要:Noncoherent space-frequency coding in MIMO-OFDM is an important method to obtain space and frequency diversity in the absence of channel state information. In this paper,we address a new view of the transmission of space-frequency codes which transform the transmission in frequency selective channels into flat fading channels. Then,a sub-block noncoherent space-frequency coding is proposed which divides the space-frequency plane into small sub-blocks and each one constitutes a space-frequency codeword. By a modified signal model,an asymptotic analysis of the pairwise error probability (PEP) is derived and thus the design criteria for full diversity-achieving code is explicitly defined. We also propose a code construct that achieves the promised order of diversity and demonstrate our conclusion by computer simulation.
摘要:A novel way achieving geometrical reconstruction of actual human face through projecting two types of texture on face in short time is advanced.The first type texture is stripe which is used to establish parallax grid between images.Taking into account of its results,the second type projecting texture is used to match by virtue of its abundant traits.After realizing geometrical reconstruction,the paper provides a general way about achieving actual texture reconstruction by the outer spherical surface surrounding object.In order to uniform color,it deals with parts of images in conjunct region and makes the color change meeting a certain function on condition of keeping their original information mostly.Results show this way can improve reconstruction quality and decrease complicacy of algorithm.
摘要:Consulted some previous mutations,this paper proposed an evolutionary programming(EP)using mutations based on the t probability distribution(tEP).The t probability distribution can connect with Gaussian and Cauchy probability distribution.Its variance is changeable by adjusting degree of freedom n.Rules of t mutations according to the change ofn and standard deviation are analyzed by simulations,and the relationship among number of generations,standard deviation and minimum fitness are briefly summarized.Then an EP using adaptive t mutations(AtEP)is put forward at the end.The AtEP uses several t mutations with different n at the same time,so it can integrate the advantages of Gaussian and Cauchy mutation.And simulation evidence shows the algorithm is better than classical EP algorithm.
关键词:evolutionary programming;mutation;t probability distribution;tmutation
摘要:Using scale-space theory and the local shape of auto-correlation matrix,a new general approach is proposed to extract affine invariant regions.First,the feature points and their characteristic scales are detected by the local maxima of normal Gaussian derivatives over scale-space;Then,the auto-correlation matrices,which are used to describe local image structure,are computed on the characteristic scales of feature points.The extracted ellipse regions are affine invariant.Four affine invariant region algorithms,namely Harris3D,Laplace3D,Hessian3D and Localjet43D,are presented using the general approach.The experimental results show the four algorithms are invariant to illumination,rotation and scale changes.The affine invariance is verified by the simulation test we designed for affine invariance.Comparing the four algorithms,we find that the performance of other three algorithms is similar except for Harris3D.
摘要:A novel shape recognition method is presented.The proposed approach is based on the fact that the distribution of geometric features of a shape is invariant to rotation and scaling.An even-grid-polar mapping is applied to the shape and two invariant projections(one is up to circle-shift) are performed in the sampling plane.Thus,two extreme point vectors of the projections are collected.Then,corresponding weight vector features are calculated based on extreme point's style and scope to reduce the instability of the projections caused by geometrical deformation.The position of each element in the weighted vector illustrates the distribution of local parts with higher/lower pixel density in a shape and the magnitude is related to the pixel density.After analyzing the range of variations of the weight vectors caused by geometrical deformation,special templates and special matching scheme based on reparametrization are exploited so as to make this method invariant to rotation,scaling,translation (RST) and small non-rigid deformation.Experimental results show that the proposed method is valid.
摘要:The hierarchical structure of JPEG2000 stream calls for unequal error protection (UEP) schemes to achieve robustness efficiently.In this paper,a novel unequal error protection scheme is proposed for JPEG2000 image transmission,which encodes each bit-plane with ERAC of different code rate.Comparing with UEP schemes based on channel coding,the proposed scheme reserves the structure of JPEG2000 standard streams and avoids complicate channel framing process.Comparison with published equal error protection scheme proves the effectiveness of this method.
摘要:During the intra prediction step of H.264/AVC video compression standard,information hiding is implemented by modifying the intra prediction modes of qualified intra 4×4 luma blocks.The modulation is based on the mapping rules between these modes and the hidden bits.The specific positions of the host 4×4 blocks are determined by the features of every block and a position template indicated by the key.The detection of hidden information needs no original media,and merely requires decoding the intra prediction modes from bit stream rather than decoding the whole video.
摘要:Ternary solution with NaCl and sucrose is widely employed in the osmotic dehydration process of food.In this paper,a novel multifunctional sensor was adopted to online sense temperature,ultrasonic velocity and electrical conductivity of ternary solution.With these three measurable parameters as basis,this study laid emphasis on the support vector regression (SVR)method used to implement multifunctional sensor signal reconstruction,where the concentrations of two components in ternary solution with NaCl and sucrose can be simultaneously estimated.Support vector machine (SVM)is a new machine learning method based on structural risk minimization,which is well adapted to small sample size problem of calibration data and can efficiently restrain over-fitting and improve the generalization capability.The experimental results show that the mean absolute errors of the reconstructed concentrations of NaCl and sucrose for test data set are 0.00615 and 0.00369mol/kg,respectively.It could demonstrate the high reliability and high accuracy of the proposed reconstruction algorithm and verify the feasibility.
摘要:Multi-rate query in wireless sensor networks is that multiple sink nodes query the same data source with different frequencies.Because the data are requested at different frequencies,how to share the bandwidth for transmission becomes a new problem.Based on the data correlation between different data series,this paper proposes an energy-efficient optimization scheme,in which we can broadcast consolidated data series along the shared path and reconstruct the requested data series from these consolidated data series.Theoretical analysis results and simulation results indicate that we can save the energy consumption with a reasonable level of tolerance of the average relative error.
摘要:Secure multi-party ranking is a problem generalized from the millionaires’ problem,which can be used by n people to know about their secrets’ order among all their inputs without leaking further information.Through the study on millionaires’ protocol,we presented a secure two-party ranking protocol under semi-honest model based on homomorphic encryption.Then we generalized it to secure multi-party ranking,and we presented two algorithms whose efficiency are both improved.Finally,we gave a secure multi-party ranking protocol based on fuzzy nearness degree,and we analyzed the efficiency and security of these protocols.
摘要:Topology connectivity of wireless Ad Hoc networks is an essential prerequisite to end-to-end data communication,and biconnectivity is the basic condition to maintain topology connectivity in the case of unexpected node failure.Based on the analysis of the probability of cut-vertexes whose failure will partition a network,this paper derives a practicable formula for one-dimensional networks with nodes distributed randomly and uniformly.It formulates the relationship between biconnectivity probability and three basic network parameters,such as the size of network area,the number of network nodes and the transmission range of each node.According to this formula,we can optimize network topology efficiently.Simulation results validate the accuracy of our conclusion and confirm its efficiency in practical network design.
关键词:wireless Ad Hoc network;Topology;connectivity;one-dimensional network
摘要:This paper presents a robust detection approach for the hidden information in the discrete cosine transform (DCT) domain.The proposed approach uses the α -stable distributions,which are more accurate probability models than the gaussian and generalized gaussian distributions for those heavy tailed non-gaussian data with the algebraic tails,to model AC DCT coefficients with distinct impulse distributional behavior.By applying the statistical inference on the probability models under the generalized Neyman-Pearson criterion,the robust detection structure is then developed.The resulting detector is based on the statistical signal detection theory and it exploits the imperceptibility constraints of the hidden information.Experiments show that:a) the novel detector is superior over the matched filter and b) though the performance of the novel detector is close to that of the detector based on the generalized gaussian models,the proposed detector does not need the "point elimination process",which simplifies the realization of the new detector.
YING Zi-lu, TANG Jing-hai, LI Jing-wen, ZHANG You-wei
Vol. 36, Issue 4, Pages: 725-730(2008)
摘要:Dimension reduction of data is usually an important preprocessing step in pattern recognition.PCA and Fisher’s LDA and their kernelized versions are widely used approaches for dimension reduction.But they have limitations when used for small sample training because of their Gaussian distribution assumption.This paper propose an algorithm for dimension reduction called support vector discriminant analysis (SVDA),which first looks for the optimal separating hyperplane by SVM algorithm and then project data in the corresponding normal direction.In multiclass cases,the algorithm has many choices for selecting projecting axis.The algorithm has the intrinsic nice generalization ability of SVM.The paper applies the algorithm to the feature extraction in facial expression recognition application and compares the results to other algorithms such as PCA,LDA,KPCA and GDA.The results show the effectiveness of the proposed algorithm.
MA Zhi-yi, LIU Hui, HE Xiao, ZHANG Le, JI Zhe, GE Mu
Vol. 36, Issue 4, Pages: 731-736(2008)
摘要:Because of the complexity of software systems nowadays,the manifold modeling languages and transformation definition languages are needed in model driven software development. This paper presents a meta-modeling platform for defining and improving the needed languages. The paper primarily discusses the technology of modeling meta-models and notations of modeling languages,the mechanism for the assuring modeling language quality,and the facility for automatically generating the related tools aiming at the defined languages.
摘要:The fundamentals and properties of non-negative matrix factorization (NMF) are introduced,and available NMF algorithms are classified into two categories:basic NMF model-based algorithms and improved NMF model-based algorithms.Based on these,the design principles,application characteristics,and existing problems of the algorithms are systematically discussed.Besides,some open problems in the development of NMF algorithms are presented and analyzed.
关键词:non-negative matrix factorization;multivariate data representation;feature extraction
摘要:The origin of the TSM-based piezoelectric immunosensors is reviewed in this paper.The limitation of the Sauerbrey equation is presented.The impact of the viscoelasticity of the sensitive film,the viscosity,conductivity and the dielectric constant of the testing fluid on the equivalent circuit is analyzed and discussed.The equivalent circuit under the bio-sensitive film and the fluid co-worked loading condition is shown.The remained problems and the future development trends in this research field are commented briefly.
摘要:For the motif discovery problem of biological sequences,a mixture Gibbs sampling algorithm is presented.Based on mixture motifs model learning through likelihood maximization,a greedy strategy that adds sequentially new motif to a mixture model is employed.Two sampling methods are designed,site sampling and motif sampling,the two sampling methods are applied by turns.In order to speed up the searching procedure,a hierarchical partitioning scheme based on kd-trees is used for partitioning the input dataset.Experimental results indicate that the proposed algorithm is advantageous in identifying larger groups of motifs characteristic of biological families.In addition,it offers better diagnostic capabilities by building more powerful statistical motif models with improved classification accuracy.
关键词:bioinformatics;motif discovery;Gibbs sampling;mixture motifs model
摘要:In order to make use of the speed of analog to digital converter (ADC),advance the ADC’s ability of measuring weak signal,predigest the circuit and reduce the cost,over-sampling were combined with the saw-tooth shaped function to detect the weak signal in this paper.The analysis shows that medium resolution ADC sampling straightly can achieve high precision which is acquired only by using high resolution ADC.
关键词:saw-tooth shaped function;over-sampling;high precision;weak signal detection;high resolution
TIAN Qi-chuan, LIU Zheng-guang, PAN Quan, LI Lin-sheng
Vol. 36, Issue 4, Pages: 760-766(2008)
摘要:Iris matching similarity will be affected by some fluky and unfixed features among iris feature templates,that make iris classification false rate(include false accept rate and false reject rate)increase.In order to resolve this problem,a stable feature extraction algorithm is proposed in this paper,the stable features of an iris can be extracted from its several images,then iris feature template can be built based on these stable features,thus,iris feature template can be used for iris classification.Simulation results show that the selected stable features achieve quite high classification accuracy and the proposed algorithm is effective for improving iris recognition performance on the CASIA Iris database.
摘要:False matching in particle tracking velocimetry(PTV)and low-pass feature of particle correlation velocimetry(PCV)can make the processing error improve.However,the two problems can be reduced by application of cell segmentation theory(CST)presented in this paper.Furthermore,the CST processing model is described as:Firstly,the interrogation fields are divided into different local spaces named as cells,and these cells continue to segment into sub-cells according to correlation degree and close degree.Secondly,these sub-cells compete against each other and the final victorious one attends competition in other fields.Thirdly,the velocity vector field is gotten according to the positional alteration of the victorious cell.At last,the standard particle images were tested and the errors were analyzed.The experimental results demonstrate the effectiveness and practicability of the proposed method.
摘要:One of the central problems in stereo matching is the selection of optimal window sizes for comparing image regions.This paper presents a fast and reliable multi-scale stereo matching algorithm based on the Nonsubsampled Contourelet Transform (NSCT),which is a fully shift-invariant,multi-scale,and multi-direction expansion that has better directional frequency localization.This method consists of multiple passes which compute stereo matches with a coarse-to-fine and sparse-to-dense paradigm.Then,we using a fast local algorithm,referred to as single matching phase (SMP),which reduce computation and is suitable to real time applications.The proposed approach is also compared with bidirectional matching (BM),since the latter is the basic method for detecting unreliable matches in most area-based stereo algorithms.Experimental results with real images are presented.
摘要:User activities are normally in variant forms or may be aberrant in some cases.This kind of uncertainty leads to the difficulty for current intrusion detection algorithm in deciding whether the user is masquerading or not.In the proposed algorithm,the user features are properly selected and the corresponding user trustworthiness computation methods are introduced.Different types of trustworthiness are integrated with interval type-2 fuzzy set,thus user trustworthiness is got and applied to a threshold-based decision.Theory analysis and experiments show that the proposed algorithm can handle the uncertainties that exist in user actirity or user model,so better detection performance can be achieved,compared with the detection algorithm based on ordinal fuzzy set.
摘要:This paper proposed a novel integration model based on BACnet/XML protocols and BACnet/WS interfaces.We described the implementation of the kernel BACnet/WS service module of this model.Excellent performance was shown through theoretcial analysis and simulations,which indicates a promising solution of this problem.
摘要:Armed at the difficult solution of uncontrolled random nonlinear systems,a method for any order approximate solution of the state equation for uncontrolled random nonlinear systems is proposed. Based on general Langevin gradient equation in uncontrolled state space,the random nonlinear Volterra’s integral equation for the second kind,which is equivalent to general Langevin gradient equation,is obtained,by utilizing constant variation method.Then,any order approximate solution of the equation is also obtained,by successive approximation method.Finally,the influences of nonlinearity and randomness for state space transformation of the system is discussed.The method for any order approximate solution of the state equation for uncontrolled random nonlinear systems is an effective method of quantitative analysis for random nonlinear systems.
关键词:random nonlinear system;Langevin gradient equation;Volterra’s integral equation;any order approximate solution
ZHANG Xu-jin, ZHANG Chang-yao, ZHU Zhao-da, DENG Hai-tao
Vol. 36, Issue 4, Pages: 789-793(2008)
摘要:According to the characteristic of the radar system,this paper applied clutter suppression interferometry (CSI) processing to improve clutter cancellation ability of the system.The processing compensates the difference phases for each receive channel in image domain and makes clutter cancellation between sub-images.According interfered phase of moving target to determine its azimuth location.So the approach can perform the detection,radial velocity estimation and accurate relocation of moving targets masked by ground clutter.Finally,show part processing results of the actual measured data recorded from the SAR/MTI system.
摘要:An data fusion algorithm of improving vertical positioning accuracy based on GPS/barometric altimeter is introduced in order to ensure an airplane fly precisely over an assigned,and endow it with the ability of precision approach and landing in complicated weather condition.This data fusion algorithm using Kalman filtering accomplish data fusion of GPS/barometric altimeter.An adaptive federated Kalman filtering model for GPS/barometric altimeter integrated navigation system is established by means of kinetic vector model of airplane,location error model of GPS,this data fusion algorithm is deduced in detail.simulation results demonstrated that the algorithm is efficient in improving vertical positioning accuracy ,reliability,adaptivity and real-time processing rate,improves safety and reliability of airplane in the process of near-enter,and satisfy landing requirement of civil aviation.
摘要:A Boolean function is said to be correlation immune if its output leaks no information about its input values.Such functions have extensive applications in computer security practices.This paper studies the construction and enumeration problem for mth-order correlation immune functions and presents two new construction methods.Furthermore,we compare new methods with Seigenthaler,Yang,Camion,Seberry,Wen et al’s and show that new methods actually generalize relational conclusions in these references.Using new methods not only can construct directly mth-order correlation-immune functions,but also can construct new correlation immune functions on the basis of known correlation immune functions.In addition,based on new construction methods,the enumeration lower bound of balanced mth-order correlation immune functions is improved.
摘要:Detecting super-connection hosts is an important issue in network security and flow sampling is the key to solve this problem in high speed networks.The existing solutions use hash-based flow sampling algorithm,which assumes that the uniform random hash functions are available.However,this assumption can not be justified.By technical analysis and experiment tests,this paper concludes that the assumption is not true for linear flow IDs in high speed networks (above 2.5Gbps).A new flow sampling algorithm is presented subsequently,which exploits the Bloom Filter data structure.An analysis demonstrates that the new algorithm can support the 10Gbps line-speed processing with low space complexity.Experiments are also conducted based on real network traces.Results show that the proposed algorithm can achieve equal probability flow sampling independent of flow ID distribution.
摘要:The complex sphere decoding has lower complexity compared with real sphere decoding for space-frequency block codes with PSK modulation.When the initial radius of the complex sphere decoder tends to infinity,sorting has high complexity.For symbols of PSK modulation,a new sorting method is proposed in every layer according to the zigzag rule centred the middle reference point in the angle dimension of the polar coordination.Through looking up the table,the sorted symbol sequence can be fast gained.Compared with the general complex sphere decoding algorithm,the sphere decoding algorithm through looking up table of sorted symbol sequence can save approximate 61% complexity for 16-PSK in 14dB average bit SNR.
摘要:To solve the energy efficiency problem in the wireless sensor networks(WSNs),a clustering hierarchy arithmetic based on energy prediction (CHEP) was presented.Taking use of the sensor nodes state diversion module,the proposed remaining energy was added as a considered parameter in calculating the threshold in CHEP.Hence it can guarantee the node with high remaining energy be chosen as the cluster-head node in priority in each round.From the experiments,we analyzed the performance of CHEP and compared it with other cluster-based routing arithmetics where there was no prediction used in selecting the cluster-head node.It was satisfied that the arithmetic of CHEP could prove the validity of energy prediction mechanism and threshold amended.Simulation results show that the process of CHEP can balance the energy load in the network and prolong the lifetime of the network.