z-logo
open-access-imgOpen Access
The Transformation of College Students’ Ideological and Political Education and Learning Analysis of Education System by Streaming Media Technology
Author(s) -
Xu Lian,
SangBing Tsai
Publication year - 2021
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2021/3285830
Subject(s) - ideology , correctness , mathematics education , sociology , computer science , scheduling (production processes) , politics , mathematics , political science , mathematical optimization , algorithm , law
The development of social economy and the continuous advancement of science and technology have opened the historical prelude of the information age. Streaming media technology, with its wide audience, diverse forms, and strong guiding technology, has infinitely narrowed the time and space distances of people in different regions of the world. The difficulty of political work has very important practical significance. Therefore, this paper focuses on the theme of the reform of the teaching method system of the ideological and political theory course in colleges and universities and the analysis of the education system. From the perspective of streaming media technology, we learn the opportunities and challenges faced by college students in the transformation of ideological education and the reform of education system and explain the strategies and measures for the transformation of ideological education and the reform of education system in college students. We hope that this study can provide some theoretical support for the ideological education and teaching of college students. The problem of data scheduling for ideological and political education in the P2P system is analyzed, the data scheduling problem is formalized, and the form of optimal data scheduling is analyzed. Through theoretical analysis, the optimal scheduling problem is transformed into an equivalent minimum cost flow problem that can be calculated in binomial time. It is proved by reasoning that the consistency of the optimal data scheduling problem and the minimum cost flow problem is verified, and the correctness and feasibility of the viewpoint are verified.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom