Association rule analysis, as one of the significant means of data mining, plays an important role in discovering the implicit knowledge in massive transaction data. Aiming at the inherent defects of the classic Aprio...
详细信息
Proxy re-signature is proposed by Blaze, Blemmer and Strauss (BBS), in which a semi-trusted proxy acts as a translator converts a signature from Alice into a signature from Bob on the same message. Proxy re-signature ...
详细信息
Proxy re-signature is proposed by Blaze, Blemmer and Strauss (BBS), in which a semi-trusted proxy acts as a translator converts a signature from Alice into a signature from Bob on the same message. Proxy re-signature is a very useful tool for the interoperable DRM architecture and the proof of passed path in cloud computing. However, cloud users usually are mobile devices which are constrained with processing and power limitations. When a mobile user obtain the converted signature from the proxy (cloud server), it still can not verify it due to the heavy computation cost. We propose a new definition of server-aided verification proxy re-signature which consist of a proxy re-signature scheme and a server-aided verification protocol. With the server-aided verification protocol, some computational tasks for a proxy re-signature verification are carried out by the proxy (cloud server), which is generally untrusted, therefore, it is very useful for mobile devices. We present, on the basis of Ateniese and Hohenberger's unidirectional proxy re-signature scheme, two novel existential unforgeability server-aided verification proxy re-signature schemes.
With Rytov approximation theory, we derive the analytic expression of de- tection probability of Airy vortex beam carrying orbital angular momentum (OAM) through an anisotropic weak oceanic turbulence. We investigate ...
详细信息
The advancement of the Internet of Things (IoT) has enabled a variety of innovative consumer electronics applications. In particular, multi-modal applications integrating audio, video, and haptic interactions have eme...
详细信息
With the rise of the Internet of Everything, machine-type wireless video applications like intelligent surveillance are increasingly becoming mainstream network services. However, the massive transmission of video str...
详细信息
With the rapid development of mobile internet cloud computing, the traditional network structure becomes non-suitable for advanced network traffic requirements. A service migration decision algorithm is proposed in th...
详细信息
In this paper, we investigate the interference scenario where Device-to-Device (D2D) users and the cellular user share the same spectrum resource, and propose two novel interference suppression algorithms for D2D comm...
详细信息
This paper addresses the information rate maximization problem under interference temperature constraint for a multiple-in multiple-out cognitive radio (MIMO-CR) network in which each CR user is equipped with multiple...
详细信息
This paper addresses the information rate maximization problem under interference temperature constraint for a multiple-in multiple-out cognitive radio (MIMO-CR) network in which each CR user is equipped with multiple antennas. We formulate this as a Nash equilibrium problem where each CR tries to maximize its own utility by choosing appropriate wave-form. A decentralized iterative water-filling algorithm (IWFA) with pricing is proposed to solve it, the pricing mechanism is used to satisfy the interference temperature constraint while achieving the Nash equilibrium. Simulation results show that our algorithm can satisfy the interference temperature constraint perfectly and is fast convergent, we also show that the proposed IWFA with pricing can achieve a performance improvement in terms of sum-rate over the existed IWFA with power shaping.
Stream data is a very common data type in big data and in many data streams applications,users tend to pay more attention to the mode information of the data *** mining frequent patterns in data streams is a significa...
详细信息
ISBN:
(纸本)9781479900763
Stream data is a very common data type in big data and in many data streams applications,users tend to pay more attention to the mode information of the data *** mining frequent patterns in data streams is a significative ***,finding frequent itemests in a data set with predefined fixed support threshold could be seen as an optimization *** this paper,the problem of frequent itemsets mining is derived as a non-linear optimization problem,then genetic algorithm is adopted to solve *** the formal and bitmap representation of frequent itemsets,the non-linear optimization problem is transformed to 0-1 programming.A set of experimental results show that unlike typical Apriori algorithm,the complexity of time and memory space grows exponentially as the support decrease,our proposed algorithm has a high time and space efficiency even with a very low support.
The problem of recovering sparse and low-rank matrices from a given matrix captures many applications. However, this recovery problem is NP-hard and thus not tractable in general. Recently, it has been shown that this...
详细信息
暂无评论