最新刊期
卷 39 ， 期 3A ， 2011
- 摘要：At present,some methods have been presented to calculate the degree of similarity between (Fuzzy numbers,FNs) or (Generalized fuzzy numbers,GFNs) Most of them are designed for standardized fuzzy numbers,i.e.,the universe of the discourse of FNs lie in unit interval.In order to deal with the non-standardized fuzzy numbers common in practice,it is necessary to transform it into standardized fuzzy numbers,such that the degree of similarity can be calculated.However,normalization process tends to cause information loss and unreasonable results of similarity measure.This paper presents a new similarity measure between GTFNs avoiding normalization process.The new method combines the concepts of exponential distance,the perimeter and the area of GTFNs for calculating the degree of similarity.Some properties of the proposed similarity measure are also proved.And then 12 typical sets of GFNs are given to compare the proposed method with most of the existing methods.The results show that the new method is more efficient to a certain extent.Finally,a practical example is given to show that the proposed method can provide a useful way to deal with the problem of D-S evidence theory based machinery fault diagnosis.关键词：generalized fuzzy number;similarity measure;fault diagnosis;DS evidence theory2|2081|0更新时间：2025-07-16
- 摘要：We study the optimal networked estimation of a kind of Linear Time Invariant (LTI) or determinate parameters systems with uncertain "Out-Of-Sequence" Measurement (OOSM) induced by random communication delays.Both available properties,which are off-line computation of filter’s parameters for these systems and linear weighted combination for the Linear Minimum Mean Square Error (LMMSE) estimate,are fully used to present the weighted summation form of the Kalman filter (KF).Afterward,two optimal delayed filters for different uncertain OOSM systems are proposed on the basis of the linear weighted summation filter.At last,four simulation examples are demonstrated to validate the effectiveness and superiority of the proposed networked estimators.关键词：linear time invariant system;uncertain delay;out-of-sequence measurement;LMMSE;Kalman filter2|1295|0更新时间：2025-07-16
- 摘要：A classification method using echo state networks (ESNs) with corresponding clusters is proposed,which is inspired by complex network topologies imitating cortical networks of the mammalian brain.The time windows functions are adopted to construct multiple-cluster reservoir.The number of clusters corresponds with the number of classes in specific classification problems to improve the classification accuracy.Experimental results based on the standard datasets and analog circuit fault diagnosis show that the proposed method outperforms the original echo state networks.关键词：echo state networks;time windows;analog circuit fault diagnosis2|1516|0更新时间：2025-07-16
- 摘要：An efficient global motion estimation algorithm on H.264/AVC compression domain is proposed.Due to many technologies of video compression coding used in H.264/AVC,on H.264/AVC compression domain,the motion vector field contains a lot of noise blocks for global motion estimation.The valid motion vector number for global motion estimation is limited.In order to reduce the influence of noise motion vectors and improve accuracy and computational efficiency of global motion estimation,it is necessary to eliminate noise motion vectors during global motion estimation.In this paper,the noise blocks were eliminated efficaciously by using information of MVD (the difference between the current vector and the predicted vector) and reference block for MV prediction in H.264 bits stream.The extensive experiments show that the proposed method is efficient and robust in terms of both computational complexity and accuracy.关键词：global motion estimation;H.264/AVC compression domain;motion vector prediction;motion vector difference2|1161|0更新时间：2025-07-16
- 摘要：A trust region based sequential quasi-Monte Carlo filter is proposed for system state estimation and object tracking which are the non-linear and non-Gaussian random procedures with multi-source uncertain information.In the proposed algorithm,the quasi-Monte Carlo (QMC) technique is used to optimize the distribution of the sampling particles in the state space,which can obtain a small error of the integration in the filtering process and a better accuracy of the state estimation.Furthermore,a trust region (TR) procedure is used to move particles to regions of high likelihood,which results in a fewer particle selection and lower computational cost.Experimental results show that the proposed algorithm overcomes the particle impoverishment,reduces the computational complexity of the QMC filter,and gets a more accuracy estimation than existing algorithms such as particle filter and QMC filter in system state estimation and object tracking.关键词：Quasi-Monte filter;trust region;state estimation;object tracking2|1774|0更新时间：2025-07-16
- 摘要：With the increment of focal element numbers in discernment framework,the computation amount in DSmT will exponentially go up,which has been the bottleneck problem to block the wide application and development of DSmT.To solve this problem,in this paper,on the base of further studying several key issues of hierarchical DSmT only with singletons,an extension is done to be fit for the case that there are singletons and conflicting focal elements with assignments in hyper-power set simultaneously.The conflicting focal elements are discoupled in terms of the proportion of assignments taken by elements involved in it.This is very helpful for further processing information according to the method only with singletons.That is,these discoupled focal elements in hyper-power set are forced to group through bintree to realize the mapping from the refined hyper-power set to the coarsened one.Finally,by comparing new method with old one from different views,i.e.computation effecieny,loss of information and similarity,the superiority of new one over old one is testified well.关键词：approximate reasoning;Information fusion;hierarchical;Dezert-Smarandache Theory (DSmT)2|1069|0更新时间：2025-07-16
- 摘要：Detecting and tracking dense multi-target under intense interference remains a major challenge in scientific research.It also has important applications in national defense and economy as well.In this paper,we proposed "signature" using the target physical characteristics and motion features of fusion measurement in spectral,spatial and temporary spaces.Thus we could eliminate noise at the earliest time by applying the kinetics Markov belief and the feature Markov belief of the target signature as well as using data association result as feedback of adaptive video surveillance to achieve high-precision multi-target tracking method.The experimental results have shown its outstanding performance.关键词：multi-target tracking;fusion;signature;adaptive video detection2|1471|0更新时间：2025-07-16
- 摘要：This paper conducted research on the super close-in PD radar’s complex target echo synthesis technology,and put forth a method of "Video synthesis combining space synthesis".The method divided the work space of radar and complex target into multi-small airspace based on equal space angle during the process of simulation.In accordance with the principle of scatter-points distribution,and made dynamic distribution of target scatter-points to the airspace on the basis of known cross posture.During simulation,target scatter-points’ echo of the same airspace will carry out video synthesis,then are sent into radar by I/Q modulation and up-conversion.In the mean time,all airspaces’ echo will undergo space synthesis again through array antenna,echo signal will finally be generated to radar receiver antenna.关键词：super close-in pulse doppler radar;video synthesis;space synthesis;array antenna;scatter-point;simulator2|1214|0更新时间：2025-07-16
- 摘要：In according with the difference of RD algorithm and CS algorithm’ processing flow and calculation method,this paper analyzed processing gain of two algorithms in the environment of shift-frequency jamming,and deduced formulas of the SJR processing gain about two algorithms.The academic analyzing result demonstrates that the restrainable capability of RD algorithm about shift-frequency jamming is stronger than CS algorithm if the sampling rate of distance dimension is equivalent with the band width of the signal.And at the condition of the over sampling rate about azimuth dimension,the SJR processing gain of RD algorithm is larger than CS algorithm because of two dimension matching fliter of RD algorithm.If the over sampling signal is filtered in azimuth dimension,the SJR processing gain of CS algorithm is uniform with the RD algorithm.Finally,the computer simulation testifies the validity and availability of theory analyzing results and conclusion.关键词：synthetic aperture radar(SAR);shift-frequency jamming;imaging algorithm;signal-to-jam ratio(SJR);gain of imaging processing2|1391|0更新时间：2025-07-16
- 摘要：The Semantic Web service discovery is a hot spot in the current web service research field.Its core research content is service descriptions and the corresponding discovery methods.Service description can be divided into the service request description and advertisement description.Service advertisement descriptions are usually complete,descriptive,information-rich descriptions;while service request description is concerned only with some of the characteristics of services,usually does not constitute a complete description of the service.Current methods of service discovery using the same mechanism to describe both request and advertisement.Compare and identify the identity or similarity of the corresponding part between the two as matching basis.Build a complete fictive service description as service request limit the practicability of the method.In this paper,we propose to use semantic web query language SPARQL-DL as the service request description language to retrieve OWL-S form published services.Treat the service discovery issue as query against the knowledge base.Through the experiment,confirmed that the method is practical,simple,reliable and easy-to-use.关键词：semantic web services;service query;SPARQL-DL2|1390|0更新时间：2025-07-16
- 摘要：To unintegrable function for the nonlinear dynamic equations of pulsed beams in six dimensional phase spaces,first of all,the integrated functions of the equations are expanded as Taylor series in independent variable,the general series solution of the independent variable for the equation can be obtained by direct integration.Then the coefficients for different order items of independent variable can be expanded as Taylor series in initial value,next series solution of the independent variable and initial value for the equation can be obtained.In order to solve the dynamic equation for relative motion of any particle to reference particle,first of all expanding the integrated function as Taylor series in independent variable,then the coefficients for difference order items of independent variable can be expanded as the series of reference particle initial value,the relative motion equation can be obtained,and series solution for the independent variable and relative motion initial value of the equation can be obtained by direct integration.关键词：pulsed beams;six dimensional nonlinear dynamic equation;series solution2|1128|0更新时间：2025-07-16
- 摘要：To improve photoconductive switch’s radiation power output,a power combining method,based on circuit,was put forward on trial.Two capacitors were used to drive the two photoconductive switches respectively,and the power combining circuit design was simplified.Experimental results revealed that photoconductive switch’s output power combining,by doubling the offset voltage serially,was feasible,and had high combining efficiency.关键词：Photoconductive switch;circuit power combining;laser excitation2|1162|0更新时间：2025-07-16
- 摘要：In this paper,we propose two algorithms.The first one is the quasi-Monte Carlo probability hypothesis density filter (PHD).Quasi-Monte Carlo is used to implement the PHD filter.In the simulation,we can find that the proposed algorithm is more accurate than the sequential Monte Carlo PHD filter in the estimation of target state and the number of targets.The second algorithm is convolution kernel quasi-Monte Carlo PHD (CKQMC-PHD) filter.The convolution kernel algorithm is used in the QMC-PHD filter.When the observation noise becomes small,CKQMC-PHD filter is very efficient to estimate the state and the number of targets,the behave of the CKQMC-PHD filter is better than that of QMC-PHD filter.The simulation results prove the effect of the CKQMC-PHD filter.关键词：probability hypothesis density (PHD);quasi-Monte Carlo (QMC);convolution kernel (CK)2|1080|0更新时间：2025-07-16
- 摘要：Automatic broadcast news transcription converts speech into text by a large vocabulary continuous speech recognizer (LVCSR).This technique is an important prerequisite to various tasks,e.g.,structural segmentation,semantic access and content-based retrieval of broadcast news.In this paper,we develop an automatic caption generator (ACG) for Mandarin broadcast news.The system integrates various functions,i.e.,audio extraction from video,audio type classification and segmentation,speaker recognition,LVCSR,caption generation and video control.Experiments show that the system can achieve high speech recognition accuracy.A potential deployment of ACG is to help the hearing impaired and elderly people in enjoying TV programs.关键词：speech recognition;broadcast news transcription;audio classification;speaker recognition;caption generation2|1529|0更新时间：2025-07-16
- 摘要：Block-sparse signal is a typical sparse signal.Among the block-sparse signal problems for compressed sensing,the most existing recovery algorithms require block sparsity as prior knowledge and have a high complexity.In this paper,a block sparsity adaptive iteration algorithm for compressed sensing has been proposed when the block sparsity is unknown.Firstly,the algorithm initializes a block sparsity which will increase by steps.Subsequently,for each block sparsity,a sub-set of the signal support set can be determined by the algorithm,which updates the previous one,until the exact support set is acquired,finally the original signal can be reconstructed through the exact support set.This algorithm doesn’t require block sparsity as prior knowledge and has a low complexity.Simulation results demonstrate its high recovery probability than most existing algorithms,which makes it a promising for practical block-sparse signal compressed sensing task.关键词：compressed sensing;block-sparse;adaptive;recovery probability3|2403|0更新时间：2025-07-16
- 摘要：According to the link instability and asymmetry of wireless sensor network,the multiple time scales link estimation (MTSLE) algorithm which takes into account long and short time scales link estimation is proposed.In MTSLE,building the topology structure by both stable link and bursty link,a bursty links discovery strategy is designed to achieve opportunistic routing.Meanwhile,the algorithm also considers a multi-path ACK policy for packet duplication cause by the asymmetry bursty links,reduces the number of duplicate packets.Experimental results show that MTSLE algorithm not only reduces the average path length but also saves energy and improve the packet reception rate to some extent,while multi-path strategy also solves the problem of packet duplication.关键词：link estimation;multiple time scale;multi-path ACK;Wireless sensor networks2|1366|0更新时间：2025-07-16
- 摘要：Web service composition is the hotspot in the field of Web services.Many methods are proposed to describe and verify its correctness.This paper researches specification and verification of Web services composition from software architecture.Refinement checking and model checking are two important formal verification methods.This paper explores the problem of Web service composition based on both software architecture description language XYZ/ADL and formal verification,then proposes a specification and verification method of Web service composition. XYZ/ADL is the extension of the temporal logic language XYZ/E.Considering most Web service with real time characteristics,we can use XYZ/RE which is the real time extension of XYZ/E to express time constraints of the system.For systems with time constraints,we transform the system description to corresponding timed automata according to the mapping rules,then use refinement checking and model checking to verify the correctness of web service composition.Experiments demonstrate feasibility and validity of above idea.关键词：web services composition;XYZ/ADL;XYZ/RE;timed automata;refinement checking;model checking2|1429|0更新时间：2025-07-16
- 摘要：Requirement analysis and modeling is an important part of requirements engineering,and how to automate this course has gradually become an important research issue.Facing the difficulties in Chinese natural language processing and requirements analysis,this paper proposes a semi-automated method based on the semantic analysis.The modeling method includes the following steps:word segmentation,class diagram elicitation based on the semantic framework,model improvement with intelligent questionnaire and manual revision.The method can achieve higher accuracy,and it can obviously improve the efficiency of Chinese requirement modeling.This paper designs and implements a modeling tool to provide full support to the proposed process.Finally,we use three practical requirements specifications as show cases to evaluate the result of model elicitation with semantic framework.关键词：semantic framework;requirement analysis and modeling;class diagram;NLP(Natural Language Processing);OOA(Object-Oriented Analysis)2|2446|0更新时间：2025-07-16
- 摘要：The IEEE 1500 standard was proposed to standardize the IP (Intellectual Property) core test interface to transfer test information.But the typical IEEE 1500-compliant test wrapper would lead IP cores into an insecure status during scan shifting.This paper presented a secure test wrapper design for embedded IP cores,which only inserted a CMOS (Complementary Metal Oxide Semiconductor) transmission gate to the test wrapper cell to eliminate the precarious effect to IP cores.Experiments show that the proposed test wrapper not only takes less area overhead and time delay,but also can test the data path and reduce the data transitions at the input port of IP cores,thus decreases the dynamic test power during scan shifting.关键词：system-on-a-chip;IEEE 1500 standard;test wrapper;transmission gate2|1298|0更新时间：2025-07-16
- 摘要：There are some methods to store reputation locally to improve efficiency,but it needs the third parties to avoid the information dropped or tampered by the peers themselves.It’s difficult to take it into reality in distributed Peer-to-Peer environments.We propose a novel protocol to store the reputation locally,which does not need the third parties.The reputation is stored in the certificates of the peers and maintained by themselves.The corresponding protocol realizes the integrity validation and creates the reputation certificates at the same process.This method can reduce communication overhead and improve the query efficiency.It’s also resistant to several of attacks.关键词：Peer-to-Peer;reputation certificates;digital signature;storage;integrity2|1256|0更新时间：2025-07-16
- 摘要：The application of traditional Kalman filtering is limited when the state of dynamic systems is constrained.A Multiscale constrained filtering method is proposed in this paper to deal with these constrained problems which is described by equation.The state of systems is rewritten as blocked form and wavelet transform are used to obtain new dynamic systems containing constrained information.The wavelet coefficients are estimated with measurements and finally obtain the estimate results of original state by using inverse wavelet transform.New algorithm is capable of Multiscale analysis and the estimate process is real time.Computer simulations show that the trace of the estimate error covariance of the new algorithm is smaller than that of the traditional Kalman filter,and the estimate accuracy of it is better than that of the existing constraint algorithm.关键词：equality constraints;Kalman filter;constrained filtering;wavelet transform2|1114|0更新时间：2025-07-16
- 摘要：Aiming at the problems of relay node’s communication capacity and the energy consumption of the whole networks which are always ignored by the existing algorithms,many constraint conditions are introduced into the existing model of fault-tolerant relay node placement in this paper,such as the irreversible factor in the forwarding paths and relay node’s communication capacity.And a new evaluation standard is presented,and it is based on the minimum distance factor of communicating network.A hybrid relay node placement algorithm based on enumeration and greedy optimization algorithm is implemented in solutions.The simulation result demonstrates the algorithm can limit the communication capacity conveniently of the relay node.Compared with other placement algorithms,improvement of energy-efficiencies in this algorithm is obvious.关键词：Wireless sensor networks;multi-restricted fault-tolerant relay node placement;the minimum distance factor of communicating network;communication capacity;greedy optimization algorithm2|1304|0更新时间：2025-07-16
- 摘要：One of the key issues in the application of Dempster-Shafer evidence theory is how to make decision based on basic probability assignment (BPA).The usual method is to transform the BPA to probability.In this paper,an optimal transformation method based on a new presented evidence correlation coefficient is proposed.The obtained probability has the maximum correlation coefficient to the original BPA.Numerical examples are used to illustrate the efficiency of the proposed method.关键词：basic probability assignment;evidence correlation coefficient;optimization;decision-making2|1567|0更新时间：2025-07-16
- 摘要：Tag code filtering by EPC Patterns is one of the main functions of RFID middleware.In order to improve filtering efficiency,a trie tree and extended B tree based tag code filtering method is proposed.By analyzing the structural features of tag code and EPC Pattern,a layered searching structure is constructed with the EPC Patterns in the system,trie tree is used for expressing normal code sections of the EPC Patterns,extended B tree is used for expressing range forms.The search in layered structure is conducted with the descending order of code segments,and searching process is also optimized based on bit vector section set.The simulation tests show that the efficiency of our method to filter tag code suffers little effect by the change of EPC Pattern quantity and can effectively reduce the data transmission delay to the upper application.关键词：RFID;middleware;EPC Pattern;filtering;trie tree;B tree2|1324|0更新时间：2025-07-16
- 摘要：An unsupervised learning algorithm for finite mixture models (FMM) by using the BIC criterion and the Gibbs sampling is proposed.The FMM parameters are estimated by the Gibbs sampling algorithm.The number of the models is further given by calculating the BIC criterion.In the final simulations,we propose two examples of Gaussian mixture models,where the FMM with different number of components is adopted to fit observation data.The final result shows that the proposed algorithm can effectively estimate the parameters and the number of the components.关键词：BIC criterion;Gibbs sampling;unsupervised learning;finite mixture models2|3234|0更新时间：2025-07-16
- 摘要：Visual focus of attention recognition is usually based on head pose estimation.However,in a real application,it is difficult to accurately estimate the head pose due to large pose variations,low resolution images and varying illuminations.To handle the problem,we propose a dynamic Bayesian network model to infer the visual focus of attention.The head pose is not explicitly computed but measured by a similarity vector which represents the likelihoods of multiple face pose clusters.The model encodes the probabilistic relations among multiple foci of attention,multiple user locations and faces captured by multiple cameras.Data are collected in a prototype ambient kitchen and results show that the model is effective.关键词：visual focus of attention recognition;dynamic Bayesian network;the ambient kitchen2|1390|0更新时间：2025-07-16
- 摘要：Inter-path interference of Multipath routing in wireless sensor networks (WSNs) is a most important problem which needs to be solved urgently.However,energy cost,concerned most in WSNs,is ignored by current interference-free schemes.The grade-based routing protocol framework MR2-GRADE (Maximally Radio-Disjoint Multipath Routing based on Grade) proposed in this paper uses hops of nodes in leading path to construct grade of nodes beyond interference zone of this path and avoids high route cost caused by broadcasting efficiently.The creation of subsequent path by grade-based local decision-making policy is affected by node distributing density of network greatly,which results in designing GRADE_GF (Grade-based Greedy Forwarding) and GRADE_RF (Grade-based Restricted Flooding).Comprehensive simulations and results indicate that compared with existed homologous routing algorithms,MR2-GRADE can decrease route cost effectively and can hold this advantage more obviously in more large-scale network.关键词：wireless sensor network;parallel multi-path routing;inter-path interference;grade value2|1100|0更新时间：2025-07-16
- 摘要：Dempster-Shafer evidence theory is widely used in the fields of decision-level information fusion.To suppress the counter-intuitive results encountered when using Dempster’s rule of combination,a modified sequential weighted evidence combination approach based on variance of evidence is proposed.According to Jousselme’s distance,variance of bodies of evidence is defined.In each combination step,the weights are generated based on the variances of the sequences of available evidence combination results before and after adding new arriving body of evidence.Then the weights generated are used to modify the bodies of evidence including the previous combination result and the new arriving body of evidence at current step.Finally,according the Dempster’s rule of combination,the weighted average combination result can be obtained.Some numerical examples provided show the efficiency and rationality of the proposed approach.关键词：evidence theory;conflict;evidence combination;distance of evidence;variance of evidence4|2277|0更新时间：2025-07-16
- 摘要：The technologies of predicting query performance try to predict the performances of queries before actual time-consuming information retrievals,and adjust the original queries based on the predicting results to improve the performances without modifying the information needs.For avoiding the terms-independence assumption in traditional query performance predicting models,this paper proposes a query performance predicting model using semantic charts of queries which describe the semantic relations between query terms.The experimental results show that the precisions of semantic charts weighted query performance predicting models are higher than traditional models significantly,and the relativities between predicting performances and actual performances are improved about 46.32% at most.关键词：information retrieval;query performance predicting;semantic chart;core term4|1282|0更新时间：2025-07-16
- 摘要：The paper describes an eye-controlled painting system which enables people with severe mobility impairments to draw just by moving their eyes.We design and implement the system,and also propose some algorithms to improve the performance of eye-tracking interaction.We present a time-domain constrained eye-tracking clustering algorithm to detect fixations,and then identify eye movement behaviors,which can reduce the "Midas touch" problem.We also present a window-adaptive discrete Gaussian smoothing algorithm,which can filter noise and smooth the path of eye-movement in a reasonable way.关键词：eye-tracking interaction;dwell time;eye movement behavior2|1962|0更新时间：2025-07-16
- Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09064830号-19
京公网安备11010802024621 - It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
- Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.
0