In this paper,we study a class of nonlinear fractional integro-differential equations,the fractional derivative is described in the Caputo *** the properties of the Caputo derivative,we convert the fractional integro-...
详细信息
In this paper,we study a class of nonlinear fractional integro-differential equations,the fractional derivative is described in the Caputo *** the properties of the Caputo derivative,we convert the fractional integro-differential equations into equivalent integral-differential equations of Volterra type with singular kernel,then we propose and analyze a spectral Jacobi-collocation approximation for nonlinear integro-differential equations of Volterra *** provide a rigorous error analysis for the spectral methods,which shows that both the errors of approximate solutions and the errors of approximate fractional derivatives of the solutions decay exponentially in L^(∞)-norm and weighted L^(2)-norm.
A pilot allocation(PA) scheme is propose to reduce pilot contamination for time division duplex(TDD) massive multiple-input multiple-output(MIMO) system enabled twotier heterogeneous cellular network(Het Net). In orde...
详细信息
ISBN:
(纸本)9781509038237;9781509038220
A pilot allocation(PA) scheme is propose to reduce pilot contamination for time division duplex(TDD) massive multiple-input multiple-output(MIMO) system enabled twotier heterogeneous cellular network(Het Net). In order to reduce inter-tier interference during channel estimation, proposed scheme assigns mutually orthogonal pilots between macro-cells and small-cells, and pilots are reused among macro-cells with different pilot reuse factors. Comprehensive analyses and simulations of uplink average signal to interference plus noise ratio(SINR) and average achievable ergodic rate for the proposed scheme are developed. Simulation results show that the proposed PA scheme can reduce pilot contamination and improve the SINR and ergodic rate at base stations(BSs). In addition, the average SINR increases when pilot reuse factor grows, which shows the benefit of the proposed scheme. The average ergodic rate first becomes larger and then becomes smaller when pilot reuse factor becomes larger, which means the large number of pilot symbols limits the increase of ergodic rate.
Reverse auction-based incentive mechanisms have been commonly proposed to stimulate mobile users to participate in crowdsensing, where users submit bids to the platform to compete for tasks. Recent works pointed out t...
详细信息
Reverse auction-based incentive mechanisms have been commonly proposed to stimulate mobile users to participate in crowdsensing, where users submit bids to the platform to compete for tasks. Recent works pointed out that bid is a private information which can reveal sensitive information of users (e.g., location privacy), and proposed bid-preserving mechanisms with differential privacy against inference attack. However, all these mechanisms rely on a trusted platform, and would fail in bid protection completely when the platform is untrusted (e.g., honest-but-curious). In this paper, we focus on the bid protection problem in mobile crowdsensing with an untrusted platform, and propose a novel privacy-preserving incentive mechanism to protect users' true bids against the honest-but-curious platform while minimizing the social cost of winner selection. To this end, instead of uploading the true bid to the platform, a differentially private bid obfuscation function is designed with the exponential mechanism, which helps each user to obfuscate bids locally and submit obfuscated task-bid pairs to the platform. The winner selection problem with the obfuscated task-bid pairs is formulated as an integer linear programming problem and proved to be NP-hard. We consider the optimization problem at two different scenarios, and propose a solution based on Hungarian method for single measurement and a greedy solution for multiple measurements, respectively. The proposed incentive mechanism is proved to satisfy ε-differential privacy, individual rationality and γ-truthfulness. The extensive experiments on a real-world data set demonstrate the effectiveness of the proposed mechanism against the untrusted platform.
This paper is devoted to the construction of one-Lee weight codes and two-Lee weight codes over IF_p+vIF_p(v^2=v) with type p^(2 k_1)p^(k2)p^(k3) based on two different distance-preserving Gray maps from((IF_p+vIF_p)~...
详细信息
This paper is devoted to the construction of one-Lee weight codes and two-Lee weight codes over IF_p+vIF_p(v^2=v) with type p^(2 k_1)p^(k2)p^(k3) based on two different distance-preserving Gray maps from((IF_p+vIF_p)~n, Lee weight) to(IF_p^(2 n), Hamming weight), where p is a prime. Moreover, the authors prove that the obtained two-Lee weight codes are projective only when p=2.
Social media systems are very popular in today's dynamic web. One of the famous social media systems is Twitter, in which peoples used to share their personal ideas about current issues with their friends. This wo...
详细信息
ISBN:
(纸本)9781509064151;9781509064144
Social media systems are very popular in today's dynamic web. One of the famous social media systems is Twitter, in which peoples used to share their personal ideas about current issues with their friends. This work focuses on the problem of discovering a user's interest over time on twitter. Previous approaches have used to model the user topic of interest on twitter by building the profile of the users, that contain the words which can be used the user in his or her conversions with other users, but on twitter users used the noisy words which does not represent the correct topics or topic related to interest. This model has extended by a novel framework by using twitter user model. This model uses the latent topic variable to indicate the relatedness of the topic with any user. In this work, we propose a Temporal User Topic(TUT) approach which can consider the text of tweet by any user and time of the tweet. The proposed approach is used to discover topically related Users for different time periods. We also show how the interests and relationships of these users are changeovers a time period.
We study skew cyclic codes over a nonchain ring,which generalizes our previous results in IEICE *** Fundamentals of Electronic Communications and Computer Sciences,*** describe generator polynomials of skew cyclic cod...
详细信息
We study skew cyclic codes over a nonchain ring,which generalizes our previous results in IEICE *** Fundamentals of Electronic Communications and Computer Sciences,*** describe generator polynomials of skew cyclic codes over this ring and investigate the structural properties of skew cyclic codes over the ring by a decomposition *** generator polynomial of the dual code of a skew cyclic code are ***,the idempotent generators of skew cyclic codes are *** examples are also presented to illustrate the discussed results.
The p-rank of a Steiner triple system B is the dimension of the linear span of the set of characteristic vectors of blocks of B, over GF(p). We derive a formula for the number of different Steiner triple systems of or...
Based on pairs of spatial symmetric patches, a novel efficient and distinctive binary descriptor was proposed in this paper. To achieve rotation invariance during feature computation, a local coordinate system was fou...
详细信息
Based on pairs of spatial symmetric patches, a novel efficient and distinctive binary descriptor was proposed in this paper. To achieve rotation invariance during feature computation, a local coordinate system was found with radial transform technology. On the basis of that, local binary patterns against rotation could be extracted. Meanwhile, the circular image was divided into a set of overlapped annular regions, and pairs of patch description were constructed with histogram within the ring. Finally the rotation invariant image description could be obtained by concatenating the ring features from inner to outer. The performance of proposed method was tested with 3 data sets. The test results showed that its recognition accuracy reached 100%, 100% and 97.07% respectively, which were superior to the results of traditional methods based on LBP feature. Moreover, the algorithm was efficient, as single point feature computation needed only 0.045ms.
Considering the photonic crystal structure is critical to the future development of communication, the enthusiasm for the research of photonic crystal is always high. In this paper, the nonlinear finite-difference tim...
详细信息
The Bernstein Bezoutian with respect to the Bernstein polynomials basis is investigated. A general linear control system under the Bernstein polynomials basis is established from the classical one, and a kind of gener...
详细信息
暂无评论