Controller synthesis uses hardware description language and synthesis optimization tools from a higher abstract level. State transition graph of completely specified finite state machine is adopted to describe the beh...
详细信息
Controller synthesis uses hardware description language and synthesis optimization tools from a higher abstract level. State transition graph of completely specified finite state machine is adopted to describe the behavior of controller. State transition graph STG_org was generated before synthesized and state transition graph STG_ext was reversely extracted from structure realization of controller synthesis. If STG_org and STG_ext were equivalent then corresponding process of controller synthesis was correct. The paper gives a formal verification algorithm of controller synthesis with time complexity O(B 2 /Aldrt 1 (n)+A ldr t 2 (m,n)) .In order to further improve time complexity of algorithm, a verifying algorithm with synthetic information guidance was proposed. The algorithm is proved efficient in theory for its time complexity is decreased to O(Bldrt 1 (n) + Aldrt 2 (m,n)).
Using the locally conformal technique and the high-order symplectic integrators, the high- order conformal symplectic FDTD scheme is accurate and efficient for modeling the scattering from three-dimensional curved per...
详细信息
Using the locally conformal technique and the high-order symplectic integrators, the high- order conformal symplectic FDTD scheme is accurate and efficient for modeling the scattering from three-dimensional curved perfectly conducting objects. In addition, the decreased time step caused by the conformal model can be offset by using coarse grids.
While direct association rules are dedicated to describe the direct correlations among the items in a frequent itemset, indirect association rules are dedicated to describe the indirect correlations between the two it...
详细信息
While direct association rules are dedicated to describe the direct correlations among the items in a frequent itemset, indirect association rules are dedicated to describe the indirect correlations between the two items in a infrequent itemset. All the existing research works about indirect association rules are focused on improving the efficiency of mining algorithm for indirect association rules. Like incremental updating algorithm is important for mining association rules, incremental updating algorithm is also important for mining indirect association rules. In this paper, we put forward an incremental updating algorithm for mining indirect association rules to deal with the maintenance of discovered indirect association rules resulted from the change of the minimum support. The main idea is to re-utilize the results acquired in process with the old minimum support.
The connections between Maxwell's equations and symplectic matrix are ***,we analyze the continuoustime Maxwell's difierentia I equationsInfree space and verify its time evolution matrix(TEMA)is symplectic-uni...
详细信息
The connections between Maxwell's equations and symplectic matrix are ***,we analyze the continuoustime Maxwell's difierentia I equationsInfree space and verify its time evolution matrix(TEMA)is symplectic-unitary matrix for complex space or symplectic-orthogonal matrix for real *** spatial differential operators are discrefized by pseudo-spectral(PS)approach with collocated grid and by finitedifrerenee(FD)method with staggered *** the PS approach,the TEMA conserves *** *** the FD method,the TEMA conserves symplectic-orthogonal *** integration scheme is usedInthe time *** particular,we find the symplectiness of the TEMA also can be *** mathematicaI proofs presented are helpful for deep researching the symplectic PSTD approach and the symplectic FDTD method.
The measurement of granules is the most foundational problem in granular computing. The paper is intended to study the measurement of granules on a finite or infinite set. For a finite set we discuss the measurement o...
详细信息
ISBN:
(纸本)9781424425389
The measurement of granules is the most foundational problem in granular computing. The paper is intended to study the measurement of granules on a finite or infinite set. For a finite set we discuss the measurement of granules corresponding to an equivalence relation on a finite set and introduce a definition of conditional granularity in order to distinguish those granules with the same granularity. For an infinite set we can define different granularity in different questions, but we give the basic idea of granularity, that is, the granularity of a granule is the sum of the relative information contents of its atomic granules.
The expectation-maximization (EM) algorithm is a popular approach for parameter estimation of finite mixture model (FMM). A drawback of this approach is that the number of components of the finite mixture model is not...
详细信息
ISBN:
(纸本)9781424423101
The expectation-maximization (EM) algorithm is a popular approach for parameter estimation of finite mixture model (FMM). A drawback of this approach is that the number of components of the finite mixture model is not known in advance, nevertheless, it is a key issue for EM algorithms. In this paper, a penalized minimum matching distance-guided EM algorithm is discussed. Under the framework of Greedy EM, a fast and accurate algorithm for estimating the number of components of the Gaussian mixture model (GMM) is proposed. The performance of this algorithm is validated via simulative experiments of univariate and bivariate Gaussian mixture models.
In this paper, a similar but novel method presented in [3, 4], lifting wavelet-like transform (LWLT), is applied to the FMM method to sparsify the aggregation and disaggregation matrix. By compressing the elements in ...
详细信息
In this paper, a similar but novel method presented in [3, 4], lifting wavelet-like transform (LWLT), is applied to the FMM method to sparsify the aggregation and disaggregation matrix. By compressing the elements in those two matrices in time, the method proposed can further speed up the MVM and save much memory when the FMM is used. Numerical results for different shaped three-dimensional objects are considered. Compared with the FMM technique, the application of the LWLT to the FMM can accelerate the MVM by factor of two with lower memory consumed.
Classical finite-difference time-domain (FDTD) method has been widely used in computational electromagnetics, but for electrically large domains and for late-time analysis, FDTD method begins to show its limitations d...
详细信息
Classical finite-difference time-domain (FDTD) method has been widely used in computational electromagnetics, but for electrically large domains and for late-time analysis, FDTD method begins to show its limitations due to the accumulation of phase errors. To solve this problem, several methods have been proposed such as high-order schemes and four-stage Runge-Kutta integrator. Recently, the symplectic methods have been adopted for using in computational electromagnetics. In this paper, the concentration is on the derivation of an optimized fourth-order symplectic scheme in electromagnetic simulations.
A novel and efficient speckle noise reduction algorithm based on Bayesian contourlet shrinkage using contourlet transform is ***,we show the sub-band decompositions of SAR images using contourle transforms,which provi...
详细信息
A novel and efficient speckle noise reduction algorithm based on Bayesian contourlet shrinkage using contourlet transform is ***,we show the sub-band decompositions of SAR images using contourle transforms,which provides sparse representation at both spatial and directional ***,a Bayesian contourlet shrinkage factor is applied to the decomposed data to estimate the best value for noise-free contourle *** results show that compared with conventional wavelet despeckling algorithm,the proposed algorithm can achieve an excellent balance between suppresses speckle effectively and preserve image details,and the significant information of origina image like textures and contour details is well ma intained.
暂无评论