Subjects: Digital Publishing >> New Media submitted time 2023-10-08 Cooperative journals: 《中国传媒科技》
Abstract：近年来,自媒体、第三方直播平台发展日新月异,受众获取信息的手段和收看习惯也随之发生了改变。为适应发展需要,传统广播电视台在保持原有优势的同时,应积极面对新媒体的挑战,积极创新传播新手段,大小屏联动,生产出更多优质的、受观众喜爱的内容产品。本文将结合实际介绍安徽网络广播电视台常用的几类融媒体直播应用,并进行归纳总结。
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-01-28 Cooperative journals: 《计算机应用研究》
Abstract： Aimed at the problems of hyperspectral unmixing, it was found that the unmixing accuracy of the traditional unmixing algorithm was not high when the number of endmember was kept constant in unmixing. Thus, based on the artificial neural network (ANN) , this paper proposes a novel unmixing algorithm of estimating the number and category of endmember in a single pixel. Firstly, the unmixing algorithm uses the artificial neural network to estimate the number and category of each mixed pixel’s endmember in the remote sensing image. Then, the objective function of the algorithm is determined based on the estimation results, and the improved differential search algorithm is introduced to solve the objective function. Finally, the abundances and the parameters are obtained to realize the unmixing of hyperspectral images. The experimental results on simulated and real hyperspectral data demonstrate that compared with the existing unmixing algorithms, the proposed unmixing algorithm has higher performance and is more in line with the actual scene.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-01-28 Cooperative journals: 《计算机应用研究》
Abstract： Some methods for points cloud registration only use the swarm intelligence optimization algorithm and the points’ spatial information. Those methods have such shortcomings as slow convergence speed and long time consuming. To overcome these weakness, this paper proposed a registration algorithm based on the curvature information of points cloud. The algorithm extracted feature points according to the curvature information. And it obtained the best transformation matrix to make the two point cloud coincide by the improved artificial bee colony algorithm. In the process of population optimization, the corresponding points were searched according to the curvature information, and the scale of point cloud was reduced. The experimental results show that compared with the registration algorithm only using random point selection method and point cloud spatial coordinate information, the proposed algorithm can effectively accelerate the convergence speed and significantly shorten the registration time without reducing the registration accuracy.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： Aiming at the problem of low computational efficiency of the current certificateless aggregation signcryption (CLASC) scheme, this paper proposed an aggregate signcryption scheme which is suitable for the Internet of things without bilinear pairings. Compared with the current best scheme[15], the efficiency of the scheme is increased by nearly 6 times. The scheme only needs (2n+1) times of dot multiplication operation in the aggregate signcryption stage, and (5n+1) times of dot multiplication operation in the aggregate unsigncryption stage. Based on the discrete logarithm problem, the scheme satisfied confidentiality and the unforgeability under the random oracle model. In the aggregate signcryption verification phase, there is no need to provide the third party’s secret information, so the scheme satisfies public verifiability. Finally, it also pointed out that the scheme can achieve higher security at lower computation speed and is more suitable for Internet of things.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-05-24 Cooperative journals: 《计算机应用研究》
Abstract： This paper proposed a new threshold secret sharing scheme based on the Shamir(n, t) threshold secret sharing scheme. Used the characteristic that the characteristic equation of the n-th order matrix has multiple roots, realized the secret sharing of participants in different sets. The secondary master key corresponding to the same participation set is the same, that is, the eigenvalue are the same. The algorithm firstly used the feature vector corresponding to the same eigenvalue as a subkey , then it distributed the subkey to the participating members of the same participating set. what's more, the members of the same collection could use the black box to verify the authenticity of the sub-keys in their own hands so as to achieve the purpose of fraud prevention. The analysis result shows that this scheme is safe and ideal .
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-05-20 Cooperative journals: 《计算机应用研究》
Abstract： Traditional evolutionary point cloud registration methods often not using the color information in the models. To overcome the defect, this paper introduced a point cloud registration method based on self-adaptive evolutionary optimization algorithm and color information. It subsampled the input point clouds by extracting the color feature points and randomly chosen points, it utilized the median of all pairs of color constrained points as the object function. At last, it used the self-adaptive evolutionary optimization algorithm to get optimal solution. The registration experiments on four colorized point clouds show that, compared with the evolutionary point cloud registration methods only spatial information use in and two state-of-the-art registration methods, the method significantly shorten the processing time while achieving similar registration precision.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-04-17 Cooperative journals: 《计算机应用研究》
Abstract： According to the slow convergence and easiness to trap in local optimum of backtracking search optimization algorithm, this paper presented an improved algorithm. The method proposed a mutation scale factor based on t distribution firstly to speed up the convergence rate; then the algorithm improved the structure of crossover equation and introduced the optimal individual to control the direction of population search, which effectively improved the development capability. Finally, the algorithm proposed the evolutionary selection mechanism, introduced the mutation factor of differential evolution algorithm and replaced the optimal solution with worse solution under a certain probability, which can avoid algorithm to fall into the local optimum. The numerical experiments selected 15 test functions for simulation and compared with 5 well-behaved algorithms. The results show that the proposed algorithm has obvious advantages in terms of convergence rate and search accuracy.
Hits
Hits
Downloads
Comment