The paper introduces a Kernel Weibull M-Transform Least-Mean Square (LMS) (KWMLMS) algorithm aimed to enhance filtering performance for a nonlinear system. By incorporating the Weibull M-Transformation into the cost f...
详细信息
A recently proposed 3D object encryption scheme enables hierarchical decryption, allowing a single encryption to display varied visual effects upon decryption. This has potential applications in complex scenarios wher...
详细信息
The cooperative transmission schemes based on the amplify and forward(AF) mode have the defect of low transmission rate and the exiting full-rate cooperative transmission schemes based on space-time code design have...
详细信息
ISBN:
(纸本)9781467349994
The cooperative transmission schemes based on the amplify and forward(AF) mode have the defect of low transmission rate and the exiting full-rate cooperative transmission schemes based on space-time code design have the defect of high detection ***,this paper makes the best of linear constellation precoding(LCP) technique and cyclic delay diversity(CDD) technique,and adopts the nonorthogonal amplify and forward(NAF) mode,finally proposes a new full-rate wireless cooperative transmission scheme based on space-time-frequency code *** with the cooperative transmission schemes that only pursue the transmission rate or the BER performance,this new scheme can apply to multi-relay scenario,and has the advantages of simple structure,low signal detection complexity that does not increases with the number of relay *** of above makes the real-time data transmission service of high quality come to be possible.
Community structure is one of the most important features in real networks and reveals the internal organization of the vertices. Uncovering accurate community structure is effective for understanding and exploiting n...
详细信息
Community structure is one of the most important features in real networks and reveals the internal organization of the vertices. Uncovering accurate community structure is effective for understanding and exploiting networks. Tolerance Granulation based Community Detection Algorithm(TGCDA) is proposed in this paper, which uses tolerance relation(namely tolerance granulation) to granulate a network hierarchically. Firstly, TGCDA relies on the tolerance relation among vertices to form an initial granule set. Then granules in this set which satisfied granulation coefficient are hierarchically merged by tolerance granulation operation. The process is finished till the granule set includes one granule. Finally, select a granule set with maximum granulation criterion to handle overlapping vertices among some granules. The overlapping vertices are merged into corresponding granules based on their degrees of affiliation to realize the community partition of complex networks. The final granules are regarded as communities so that the granulation for a network is actually the community partition of the *** on several datasets show our algorithm is effective and it can identify the community structure more accurately. On real world networks, TGCDA achieves Normalized Mutual Information(NMI) accuracy 17.55% higher than NFA averagely and on synthetic random networks, the NMI accuracy is also improved. For some networks which have a clear community structure, TGCDA is more effective and can detect more accurate community structure than other algorithms.
Dynamic Quality of Service(QoS)prediction for services is currently a hot topic and a challenge for research in the fields of service recommendation and *** paper addresses the problem with a Time-aWare service Qualit...
详细信息
Dynamic Quality of Service(QoS)prediction for services is currently a hot topic and a challenge for research in the fields of service recommendation and *** paper addresses the problem with a Time-aWare service Quality Prediction method(named TWQP),a two-phase approach with one phase based on historical time slices and one on the current time *** the first phase,if the user had invoked the service in a previous time slice,the QoS value for the user calling the service on the next time slice is predicted on the basis of the historical QoS data;if the user had not invoked the service in a previous time slice,then the Covering Algorithm(CA)is applied to predict the missing *** the second phase,we predict the missing values for the current time slice according to the results of the previous phase.A large number of experiments on a real-world dataset,WS-Dream,show that,when compared with the classical QoS prediction algorithms,our proposed method greatly improves the prediction accuracy.
This paper first puts forward a case based system framework based on data mining techniques. Then the paper examines the possibility of using neural networks as a method of retrieval in such a case based system. In ...
详细信息
This paper first puts forward a case based system framework based on data mining techniques. Then the paper examines the possibility of using neural networks as a method of retrieval in such a case based system. In this system we propose data mining algorithms to discover case knowledge and other algorithms.
Membrane computing is an emergent branch of natural computing, which is inspired by the structure and the functioning of living cells, as well as the organization of cells in tissues, organs, and other higher order st...
详细信息
Membrane computing is an emergent branch of natural computing, which is inspired by the structure and the functioning of living cells, as well as the organization of cells in tissues, organs, and other higher order structures. Tissue P systems are a class of the most investigated computing mod- els in the framework of membrane computing, especially in the aspect of efficiency. To generate an exponential resource in a polynomial time, cell separation is incorporated into such systems, thus obtaining so called tissue P systems with cell separation. In this work, we exploit the computational efficiency of this model and construct a uniform family of such tissue P systems for solving the independent set problem, a well-known NP-complete problem, by which an efficient so- lution can be obtained in polynomial time.
作者:
Ding, WenjieXie, GuodaHuang, Zhixiang
Ministry of Education The Key Laboratory of Intelligent Computing and Signal Processing Hefei China
Hefei China
Combining the spatial filtering (SF) technique with FDTD(2, q) method (2 and q denote the temporal differential order and spatial differential order, respectively), a novel SF-FDTD(2, q) method with more relaxed Coura...
详细信息
The subwavelength metal grating is designed and simulated by using the finite difference time domain (FDTD) algorithm. The transmission characteristics of subwavelength metal grating structure are studied based on the...
详细信息
The study of electromagnetic scattering from Gaussian rough surface is of great significance in radar reconnaissance, target tracking and ocean remote sensing. The moment method (MOM) is a commonly used method with hi...
详细信息
暂无评论