Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Rapid convergence course arrangement algorithm based on three-dimensional matrix operation

A three-dimensional matrix, fast convergence technology, applied in the field of fast convergence course scheduling algorithm, can solve the problem of reducing the amount of calculation, unable to meet various course scheduling conditions, etc., to reduce the number of calculations and iterations, improve efficiency, reduce The effect of calculation

Pending Publication Date: 2022-03-04
南宁市迈越软件有限责任公司
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The embodiment of the present application provides a fast convergent class scheduling algorithm based on three-dimensional matrix operations, which solves the problem of reducing the three-dimensional space to two-dimensional class scheduling space in the prior art, although it greatly simplifies the complexity of the class scheduling problem. The degree and calculation, but it can not meet the technical problems of various course scheduling conditions in practice. It realizes the conversion of the original three-dimensional calculation of week, day and hour into two-dimensional calculation of day and hour, retaining the characteristics of the week, and It still has the three dimensions of week, day, and hour, which greatly reduces the effect of subsequent calculations

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Rapid convergence course arrangement algorithm based on three-dimensional matrix operation
  • Rapid convergence course arrangement algorithm based on three-dimensional matrix operation
  • Rapid convergence course arrangement algorithm based on three-dimensional matrix operation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0025] figure 1 It is a flow chart of a fast convergent class scheduling algorithm based on three-dimensional matrix operation in the embodiment of the present application. The specific steps are described in detail below:

[0026] Step 1: Define three matrices for the course S.

[0027] In the specific implementation, there can be four important factors in teaching and scheduling, namely time, class, teacher, and classroom. These four factors will affect each other, and these four factors will generate three dimensions. The three dimensions are respectively It is time-class, time-teacher, and time-classroom; among them, the time factor can involve week, day, and hour, and for different courses, the start week and end week of class may be different, and time also involves holidays In the case of class factors, the limitation of class factors is that each class can only arrange one course at the same time, which can satisfy the division and combination of classes. The limitati...

Embodiment 2

[0061] refer to Figure 4 As shown, the embodiment of the present application provides a fast convergent course scheduling system based on three-dimensional matrix operation. The algorithm is applied to the course scheduling system, and the course scheduling system includes: an input module, a calculation module and an output module.

[0062] The input module includes a data cleaning unit and a data conversion unit; the data cleaning unit is configured to collect the raw data of the teaching plan, and the raw data can be the basic information data such as courses that need to be scheduled through the teaching plan decomposition, classes and teachers; the data conversion a unit configured to convert said raw data into a matrix expression configured for computation, for example converting a semester timetable into a three-dimensional matrix;

[0063] The calculation module includes a schedule calculation unit and a classroom arrangement unit; the schedule calculation unit is con...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to the field of smart schools, and discloses a rapid convergence course arrangement algorithm based on three-dimensional matrix operation, which comprises the following steps: step 1, defining three matrixes of a course S, the three matrixes comprising a free matrix F, a mask matrix K and a weight matrix I, the free matrix F and the mask matrix K being 0 and 1 matrixes, the weight matrix I being a matrix with a numerical value greater than or equal to 0, and the mask matrix K being a matrix with a numerical value greater than or equal to 1; a floating-point number less than or equal to 1; 2, solving a time class schedule W of the courses S of the classes and the teachers by using a three-dimensional matrix solving formula; 3, allocating classrooms according to the time class schedule W of the classes and the teachers; and step 4, calculating the score of quality of the time class schedule W. According to the method, original weekly, daily and hour three-dimensional calculation can be converted into two-dimensional calculation, weekly characteristics are reserved, and meanwhile the effect of the subsequent calculation amount is greatly reduced.

Description

technical field [0001] This application relates to the field of smart campuses, in particular to a fast convergent class scheduling algorithm based on three-dimensional matrix operations. Background technique [0002] The existing class scheduling algorithm actually simplifies the original three-dimensional class scheduling space of week, day, and hour into day and hour, directly reducing one dimension feature. But some colleges and universities have many different courses. For example, if you consider the holiday situation throughout the year, the available class time may be completely different each week. Another example is that some courses have a teaching plan, and the start week and end week of the course are different. For example, the teaching plan requires course A to be taught from the first week to the tenth week, and course B to be taught from the ninth week to the twentieth week. Classes are held every week, so the course schedule is not from the beginning of t...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06Q10/06G06Q50/20G06F17/16
CPCG06Q10/06316G06F17/16G06Q50/205
Inventor 张浩李康
Owner 南宁市迈越软件有限责任公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products