Search

Due to the overlap of time and space coverage between tasks in mobile crowd sensing, repeated data collection may happen and cause data redundancy problem. In view of this, this paper proposed a task allocation method to reduce data redundancy within and between tasks. Firstly, this method designed a trajectory sequence prediction model based on the long short-term memory (LSTM) neural network, to predict trajectory sequences of task participants within subdivided spatial-temporal units. Then based on the trajectory prediction results, the method proposed an optimization model to minimize data redundancy. Specifically, the optimization model constrained the data redundancy within a single task by minimizing the data redundancy metric in each spatial-temporal unit, and limited the data redundancy between multiple tasks by maximizing the reuse of the sensing data of each task participant in a spatial-temporal unit. Experimental results verify that the proposed task allocation method can effectively reduce the data redundancy within and between tasks. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Based on the high dimension of the channel matrix and the complexity of the received signals, the paper proposes a hybrid iterative algorithm signal detection on uplink for large-scale MIMO systems, which combines adaptive damped Jacobi（DJ） algorithm and conjugate gradient（CG） algorithm. Firstly, the paper uses CG algorithm to provide effective search direction for adaptive damped Jacobian iterative algorithm. Then, the paper proposes Chebyshev method to eliminate the influence of relaxation parameters on signal detection to reduce the complexity of the algorithm and accelerate the convergence speed. Finally, the paper uses the bit likelihood ratio in channel coding and decoding to solve the soft information approximately, which could rise detection performance. The paper analyses the complexity of algorithm quantitatively in the theory. It studies the bit error rate performances of different decision methods and analyses convergence of hybrid iterative algorithm by simulation experiments. The simulation results show that the hybrid iterative algorithm converges quickly and approximately achieves the best MMSE detection performance under a small number of iterations, and the algorithm complexity is far lower than that of MMSE algorithm. [ABSTRACT FROM AUTHOR]

Mining potential association rules between time series motif can play an important role in predicting future trends. Time series motif is a previously unknown recurring pattern in time series. Aimed at the problem of information loss caused by symbolic time series when extract the motif, this paper developed a motif extraction algorithm PM_Motif based on pruning technology. It could extract motif accurately and quickly. Aimed at the problem of inconsistent rules caused by splitting motif to find its internal association rules, this paper developed an association rule mining algorithm between time series motif based on AR_ TSM method. It could fundamentally avoid the uncertainty caused by motif segmentation and ensure the consistency of the rules. Finally, it introduced the association rule evaluation parameter RM, and could prove the prediction performance of the association rule mining algorithm on multiple datasets. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Aiming at the consensus problem of second-order multi-agent networks under undirected connected topology, this paper proposed an event-triggered control algorithm, which could reduce the frequency of the controller updates. Meanwhile, each agent had nonlinear dynamics in the model, which could make the multi-agent networks more practical. According to the Lyapunov-Krasovskii function method, this paper analysed the consensus of multi-agent networks, put forward the sufficient conditions of formalizing consensus of the second-order multi-agent networks based on event-triggered control algorithm, and obtained the requirement for communication intervals. Furthermore, it excluded Zeno behavior. Finally, some numerical simulations further validate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

The traditional routing mechanism which has fixed rigid structure and single function has already been unable to meet the various service demands. Aiming at this problem, this paper proposed an adaptive self-matching polymorphic routing model to support the diversified services demands and provided customized routing service, which was based on the adaptation between routing function and service requirements,and implemented the polymorphic routing prototype. The prototype employed programmable router software open source control platform Quagga and programmable platform NetFPGA-10G as data plane and controled plane respectively,and realized the co-existence of multiple routing protocols through virtualization technology and flexible programmable data structure to complete customized routing protocol. And it implemented the prototype system of poly-morphic routing based on NetFPGA-10G platform. Compared with the existing routing systems, polymorphic routing system guarantees a better quality of service.supports customized routing service path, and comes up to a better performance in forwarding rate, decreasing packet loss rate and improving the link transmission bandwidth. [ABSTRACT FROM AUTHOR]