CN109840710B - Automatic rotary shift scheduling system for hospital standardized training - Google Patents
Automatic rotary shift scheduling system for hospital standardized training Download PDFInfo
- Publication number
- CN109840710B CN109840710B CN201910112895.0A CN201910112895A CN109840710B CN 109840710 B CN109840710 B CN 109840710B CN 201910112895 A CN201910112895 A CN 201910112895A CN 109840710 B CN109840710 B CN 109840710B
- Authority
- CN
- China
- Prior art keywords
- student
- department
- scheduling
- time length
- practice
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an automatic rotary scheduling system for hospital standardized training, which relates to the field of medical informatization auxiliary design and comprises the following components in percentage by weight: the device comprises a storage module, a data processing module and a display module; the data processing module is used for determiningTotal practice duration T of each student i And the practice time length of each department required for practice of each student accounts for the total practice time length T i A list of ratios of; the practice time length of each department required to practice from each student accounts for the total practice time length T i Determining the maximum ratio in the ratio list; obtaining a first sequencing sequence by sequencing the maximum proportions from high to low, and determining the first sequencing sequence as a scheduling sequence of departments; the scheduling sequence of departments is determined according to the student scheduling algorithm in turn, so that the scheduling is free from overlapping, omission and conflict, and the number of people in each department is balanced as much as possible.
Description
Technical Field
The invention relates to the field of medical informatization auxiliary design, in particular to an automatic rotary shift scheduling system for hospital standardized training.
Background
The standardized training of the hospitalized physicians (hereinafter referred to as "standard training") is an important component of the graduation back education of medical students, and is very important for training high-level clinical physicians and improving the medical quality. The method occupies the important position of the president (basic education of medical institutions) and the poststage (continuing medical education) of the medical lifetime education, and is the key point of the formation process of medical clinical experts.
However, the regular culture faces many students, and students of different academic systems have different regular culture time requirements, and the regular culture departments of the student requirements of different departments are different. As departments increase, the number of people increases, and the typesetting possibility increases sharply. A disciplined student needs to cycle through the assigned departments within a specified time (usually 2 or 3 years). In a hospital with a conventional scale, the number of people is more than 20, and the total number of departments is more than 30. On average, each person has about 20 departments to cycle through. The time requirements of the students in different academic systems are different, and the students in different departments require different discipline departments.
At present, a runner scheduling list can only be arranged manually by a specially-assigned person, the scheduling complexity is greatly increased along with the increase of personnel and the number of shifts, the scheduling efficiency is low, the manual scheduling can have the phenomena of wrong scheduling and missed shooting, and the scheduling error in the medical field can cause very serious consequences.
Disclosure of Invention
The embodiment of the invention provides an automatic rotary scheduling system for hospital standardized training, which can achieve no overlapping, no omission and no conflict in scheduling, avoid pressure caused by manual scheduling and has high scheduling efficiency.
The embodiment of the invention provides an automatic shift scheduling system for hospital standardized training, which comprises: the device comprises a storage module, a data processing module and a display module;
the data processing module is used for executing an automatic shift scheduling step, wherein the automatic shift scheduling step comprises the following steps:
step S1, receiving attribute information of a plurality of shift scholars, and storing the attribute information of the shift scholars in a relation list; the attribute information of the scholar staff comprises the identity of the scholar staff; the relation list is used for storing the corresponding relation between the attribute information of the shift schooler and the practice time length of the required practice department;
step S2, receiving all departments needing rotation of each of a plurality of shift scholars and the practice time length of each rotated department, and storing the practice time length to the corresponding position of the relation list according to the type of the rotated departments;
step S3, when a shift scheduling request is received, acquiring the relation list;
step S4, determining the total practice duration T of each student based on the relation list i And the practice time length of each department required for practice of each student accounts for the total practice time length T i A list of ratios of;
step S5, calculating the practice time length of each department required by each student to practice in the total practice time length T i Determining the maximum proportion and the department category corresponding to the maximum proportion in the proportion list;
s6, obtaining a first sequencing sequence by sequencing the maximum proportions from high to low, and determining the first sequencing sequence as the scheduling sequence of the department;
s7, determining the class-scheduling sequence of each department according to the class-scheduling algorithm of the students;
step S8, combining the student scheduling sequences of a plurality of departments to obtain an automatic runner scheduling list;
the storage module is used for storing the relation list;
and the display module is used for displaying the automatic runner scheduling list.
Preferably, the data processing module is used for executing a trainee shift scheduling algorithm; wherein, the trainee shift scheduling algorithm comprises:
acquiring a plurality of first student attribute information corresponding to a current highest-ranking department based on a plurality of proportion lists;
acquiring the time length ratio of the current highest-ranking department of each student based on the first student attribute information, sequencing the time length ratios of the multiple current highest-ranking departments from high to low to obtain a second sequencing order, and determining the second sequencing order as the scheduling order of the students of the current highest-ranking departments, wherein the time length ratio of the current highest-ranking department is the practice time length of the current highest-ranking department to the total practice time length T i The ratio of (A) to (B);
selecting a next higher department from the scheduling sequence of the departments, and acquiring a plurality of second student attribute information corresponding to the next higher department;
and acquiring the time length ratio of the next highest department of each student based on the second student attribute information, sequencing the time length ratio of the next highest department from high to low to obtain a third sequencing order, and combining the third sequencing order with a student conflict avoidance algorithm to obtain the student scheduling order of the next highest department.
Preferably, the data processing module is configured to execute the specific steps of the student conflict avoidance algorithm:
step 3-1, determining the time length L to be inserted by the current student;
step 3-2, checking the current student schedule culture residual time period;
3-3, judging whether the residual time period is a complete residual time period or not;
and 3-4, if the residual time period is an incomplete residual time period, moving the student time period by L steps on the basis of an end point of a certain residual time period, and vacating the residual time period: the time length M of each incomplete residual time period is smaller than the time length L to be inserted, and the residual time periods are discontinuous;
step 3-5, if the residual time period is a complete residual time period, selecting an insertion time position; when the time length M of the remaining time period is greater than the time length L to be inserted, the remaining time period is called as a complete remaining time period;
the selecting an insertion time position comprises:
calculating all candidate shift insertion points: c 1 ,C 2 ,…C n Maximum number of people inserted into department H 1 ,H 2 ,…H n ；
Selection of H 1 ,H 2 ,…H n The minimum value in (C) is used as the final insertion position, and if there are multiple identical minimum values, multiple insertion points C are selected i Insertion point C with minimum index i i As the final insertion position.
In the embodiment of the invention, when a scheduling request is received, the relation list is obtained; determining the total practice duration T of each student based on the relationship list i And the practice time length of each department required for practice of each student accounts for the total practice time length T i A list of ratios of; the practice time length of each department required to practice from each student accounts for the total practice time length T i Determining the maximum proportion and the department category corresponding to the maximum proportion in the proportion list; obtaining a first sequencing sequence by sequencing a plurality of maximum proportions from high to low, and determining the first sequencing sequence as a scheduling sequence of departments; the scheduling order of departments is determined according to the student scheduling algorithm in turn, so that the scheduling is free of overlapping, omission and conflict, the number of people in each department is balanced as much as possible, the advantage of high-speed operation of a computer is fully utilized, the scheduling pressure of medical staff is greatly reduced, the scheduling efficiency is high, and the normal operation of a hospital is guaranteed.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a block diagram of an automatic shift scheduling system for hospital standardized training according to an embodiment of the present invention.
Detailed Description
An embodiment of the present invention will be described in detail below with reference to the accompanying drawings, but it should be understood that the scope of the present invention is not limited to the embodiment.
Fig. 1 is a block diagram schematically illustrating an automatic shift scheduling system for hospital standardized training according to an embodiment of the present invention, which includes a storage module 1, a data processing module 2, and a display module 3; the data processing module 2 is configured to execute an automatic shift scheduling step, where the automatic shift scheduling step includes:
step S1, receiving attribute information of a plurality of shift scholars, and storing the attribute information of the shift scholars in a relation list; the attribute information of the schoolman and the schoolman comprises the identity of the schoolman; the relation list is used for storing the corresponding relation between the attribute information of the shift schooler and the practice time length of the required practice department.
Step S2, receiving all departments needing turns of each of the plurality of shift scholars and the practice time length of each department of each turn, and storing the practice time length in a corresponding position of the relationship list according to the category of the departments of the turns.
In the embodiment of the invention, the identity of the scheduling staff can be a name or a specific marker, such as a user 1 ,user 2 ,…user n When receiving the identity of the shift scheduling personnel, storing the identity into a relationship list, wherein the relationship list used in the invention is shown in a table 1.
TABLE 1
Step S3, when a shift scheduling request is received, acquires the relationship list.
Step S4, determining the total practice duration T of each student based on the relation list i And the practice time length of each department required for practice of each student accounts for the total practice time length T i List of ratios of (a).
Table 2 the practice time length of each department of practice required by the trainee accounts for the total practice time T i To a ratio list of
Step S5, calculating the practice time length of each department required by each student to practice in the total practice time length T i The maximum proportion and the department category corresponding to the maximum proportion are determined in the proportion list.
And step S6, obtaining a first sequencing order by sequencing the maximum proportions from high to low, and determining the first sequencing order as the scheduling order of departments.
It should be noted that if there is the same maximum ratio value in a plurality of departments, the departments are randomly arranged.
That is, in the actual processing, the departments corresponding to the same maximum ratio value are sorted first, and then the departments corresponding to the large ratio value are sorted.
And step S7, determining the student scheduling sequence of each department according to the student scheduling algorithm in turn for the scheduling sequence of departments.
And step S8, combining the scheduling sequences of the students in a plurality of departments to obtain an automatic runner scheduling list.
The storage module is used for storing the relation list.
The display module is used for displaying an automatic runner scheduling list.
The data processing module is used for executing a trainee shift scheduling algorithm; wherein, the trainee shift scheduling algorithm comprises the following steps:
and acquiring a plurality of first student attribute information corresponding to the current highest-ranking department based on the plurality of proportion lists.
Acquiring the time length ratio of the current highest-ranking department of each student based on the first student attribute information, sequencing the time length ratios of the multiple current highest-ranking departments from high to low to obtain a second sequencing order, and determining the second sequencing order as the scheduling order of the students of the current highest-ranking departments, wherein the department time length ratio is the practice time length of the department to the total practice time length T i The ratio of (a) to (b).
Selecting a next higher department from the scheduling sequence of the department, and acquiring a plurality of second student attribute information corresponding to the next higher department;
and acquiring the time length ratio of the next highest department of each student based on the second student attribute information, sequencing the time length ratio of the next highest department from high to low to obtain a third sequencing order, and combining the third sequencing order with a student conflict avoidance algorithm to obtain the student scheduling order of the next highest department.
Specifically, the data processing module is configured to execute the specific steps of the student conflict avoidance algorithm:
and 3-1, determining the time length L to be inserted by the current student.
And 3-2, checking the current student rule culture residual time period.
And 3-3, judging whether the residual time period is a complete residual time period.
And 3-4, if the residual time period is an incomplete residual time period, moving the student time period by L steps on the basis of an end point of a certain residual time period, and vacating the residual time period: the incomplete remaining time periods have a time length M of each remaining time period smaller than the time length L to be inserted, and the remaining time periods are not continuous with each other.
Step 3-5, if the remaining time period is a complete remaining time period, selecting an insertion time position; when the time length M of the remaining time period is greater than the time length L to be inserted, the remaining time period is called a complete remaining time period.
The selecting the insertion time position comprises:
calculating all candidate shift insertion points: c 1 ,C 2 ,…C n "maximum number of subjects in post-insertion" H 1 ,H 2 ,…H n ；
Selection of H 1 ,H 2 ,…H n Is used as the final insertion position, and if there are multiple identical minimum values, multiple insertion points C are selected i Insertion point C with minimum index i i As the final insertion position.
The invention aims to design a set of complete automatic rotary shift scheduling system, and the following specific embodiment is described by combining a simple sample as follows:
the scenario is as follows:
definition 1: (department), the department of the hospital includes: department of obstetrics and gynecology, department of anesthesia, department of endocrinology, etc.
Definition 2: (personnel, user) this shift involves 30 trainees, trainee 1, trainee 2, etc.
Definition 3: the standard is established and issued according to the national health council of students, "standardized training contents and standards (trial implementation) of inpatients," standard "hereinafter, which specifies the department and the time length of the rounds required by each student. For example, for student user 1 His standard is:<dep 1,i ,t 1,i >,<dep 1,j ,t 1,j >…. Meaning that dep is to be in the department 1,i Training full t 1,i Time of day, dep in the department 1,j Training full t 1,j Time, and so on. There is no ordering requirement between departments.
Definition 4: (time unit) in practice, for the sake of simplification of processing, "0.5 month" is taken as a basic time unit. In the standard, the length of time the trainee is in a single department (t in definition 3) 1,i Etc.) should be an integer multiple of "0.5 months," such as 0.5 months, 1 month, 1.5 months, 2 months, etc.
The time sequence is from 1 month in 2018 to 12 months in 2020 for 3 months and 36 months. The shift is arranged as follows:
(1) calculating a shift arrangement sequence: one department is arranged completely each time, and then the next department is arranged.
(1-1) for each student, say student 1, calculate his total practice duration, which is 36 months (3 years). For student 2, the total length of time was 24 months (2 years).
(1-2) for student 1, calculate his scale list: { < gynaecology and obstetrics, 7/36>, < Anaesthetic, 8/36>, … }, the highest ratio being the Anaesthetic, i.e. < Anaesthetic, 8/36 >. For the scale list of student 2: { < endocrinology, 1/24>, < gynecology, 9/24>, … }, the highest proportion being gynecology, i.e. < gynecology, 9/24 >.
(1-3) ranking the highest proportion of all people from high to low to obtain the sequence of departments. For example, student 1 is < anesthesia department, 8/36>, student 2 is < gynecology, 9/24>, and so on. The sequence of the sequenced departments is as follows: < gynaecology and obstetrics, 9/24>, < Anaesthetics, 8/36>, …
(2) And scheduling the department with the highest current rank. First, the obstetrics and gynecology department is arranged.
(2-1) the proportion list calculated in (1-2), and the obstetrics and gynecology department is in the standard of 10 out of 30 students. Their proportions are ordered: < student 2, obstetrics and gynecology, 9/24>, < student 1, obstetrics and gynecology, 7/36>, …, first ranks student 2's obstetrics and gynecology.
(2-2) now the shift schedule is empty, and it is clear that the department of obstetrics and gynecology of the student 2 directly ranks in 2018 from 1 month to 3 months. But to explain the more complex case, we assume that we now rank "student 5" of "endocrinology", requiring training for 1 month: for the student 1, the department of obstetrics and gynecology needs to be inserted into the shift at present, and the duration requirement is L2 months.
(2-2-1) checking the remaining period: the specified training time of the student is 2015-01-2018-12, other parts are full, only 2 months of vacant space such as 2018-04 and 2018-12 are left, but the trainee is cut, no complete '2 months' is left, and the requirement of 'complete remainder' is not met.
(2-2-2) vacating a remaining period of time: all shift schedules for student 1 are merged forward. The whole scheduling of the students from 2018-05 to 2018-11 is moved forward to 2018-04 to 2018-10, so that the vacant time period is changed into 2018-11 to 2018-12, and the requirement of 'complete remainder' is met.
(2-2-3) selecting an insertion time position: for the above example, only 1 candidate insertion position (2018-11) cannot be selected. We consider another example. The student now needs to insert a "gynaecology-2 month" shift. The vacant time periods are 2018-10, 2018-11 and 2018-12, and the number of the existing departments in the 3 months is 10, 9 and 9 respectively. The trainee has two candidate insertion points (C) 1 ＝2018-10～2018-11，C 2 2018-11 to 2018-12). If 2018-10-2018-11 is selected, the number of obstetrics and gynecology in the two months is 11 or 10, and the maximum number of people H 1 11; if 2018-11-2018-12 are selected, the number of obstetrics and gynecology in the two months is 10, and the maximum number of people H 2 10. Thus selecting C 2 As an insertion point, uniform allocation of resources is facilitated.
The invention can ensure no overlapping, no omission and no conflict in the shift through a perfect algorithm, and simultaneously, the number of people in each department is balanced as much as possible; the practical requirement of scheduling is combined with the computer program design, the advantage of high-speed operation of a computer is fully utilized, the scheduling pressure of medical personnel is greatly reduced, and the normal operation of a hospital is guaranteed.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (1)
1. The utility model provides an automatic cycle scheduling system of hospital's normalized training which characterized in that includes: the device comprises a storage module, a data processing module and a display module;
the data processing module is used for executing an automatic shift scheduling step, wherein the automatic shift scheduling step comprises the following steps:
step S1, receiving attribute information of a plurality of shift scholars, and storing the attribute information of the shift scholars in a relation list; the attribute information of the scheduling staff comprises the identity of the scheduling staff; the relation list is used for storing the corresponding relation between the attribute information of the shift schooler and the practice time length of the required practice department;
step S2, receiving all departments needing rotation of each of a plurality of shift scholars and the practice time length of each rotated department, and storing the practice time length to the corresponding position of the relation list according to the type of the rotated departments;
step S3, when a scheduling request is received, acquiring the relation list;
step S4, determining the total practice duration T of each student based on the relation list i And the practice time length of each department required for practice of each student accounts for the total practice time length T i A list of ratios of;
step S5, calculating the practice time length of each department required by each student to practice in the total practice time length T i Determining the maximum proportion and the department category corresponding to the maximum proportion in the proportion list;
s6, obtaining a first sequencing sequence by sequencing the maximum proportions from high to low, and determining the first sequencing sequence as the scheduling sequence of the department;
s7, determining the class-scheduling sequence of each department according to the class-scheduling algorithm of the students;
step S8, combining the student scheduling sequences of a plurality of departments to obtain an automatic runner scheduling list;
the storage module is used for storing the relation list;
the display module is used for displaying an automatic runner scheduling list;
the data processing module is used for executing a trainee shift scheduling algorithm; wherein, the trainee shift scheduling algorithm comprises:
acquiring a plurality of first student attribute information corresponding to a current highest-ranking department based on a plurality of proportion lists;
acquiring the time length ratio of the current highest-ranking department of each student based on the first student attribute information, sequencing the time length ratios of the multiple current highest-ranking departments from high to low to obtain a second sequencing order, and determining the second sequencing order as the scheduling order of the students of the current highest-ranking departments, wherein the time length ratio of the current highest-ranking department is the practice time length of the current highest-ranking department to the total practice time length T i The ratio of (a);
selecting a next higher department from the scheduling sequence of the departments, and acquiring a plurality of second student attribute information corresponding to the next higher department;
acquiring the time length ratio of the next highest department of each student based on the second student attribute information, sequencing the time length ratio of the next highest department from high to low to obtain a third sequencing order, and combining the third sequencing order with a student conflict avoidance algorithm to obtain a student scheduling order of the next highest department;
the data processing module is used for executing the specific steps of the student conflict avoidance algorithm:
step 3-1, determining the time length L to be inserted by the current student;
step 3-2, checking the current student schedule culture residual time period;
3-3, judging whether the residual time period is a complete residual time period or not;
and 3-4, if the residual time period is an incomplete residual time period, moving the student time period by L steps on the basis of an end point of a certain residual time period, and vacating the residual time period: the incomplete residual time periods are that the time length M of each residual time period is smaller than the time length L to be inserted, and the residual time periods are discontinuous;
step 3-5, if the residual time period is a complete residual time period, selecting an insertion time position; when the time length M of the remaining time period is greater than the time length L to be inserted, the remaining time period is called as a complete remaining time period;
the selecting an insertion time position comprises:
calculating all candidate shift insertion points: c 1 ,C 2 ,…C n Maximum number of people inserted into department H 1 ,H 2 ,…H n ；
Selection of H 1 ,H 2 ,…H n The minimum value in (C) is used as the final insertion position, and if there are multiple identical minimum values, multiple insertion points C are selected i Insertion point C with minimum index i i As the final insertion position.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910112895.0A CN109840710B (en) | 2019-02-13 | 2019-02-13 | Automatic rotary shift scheduling system for hospital standardized training |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910112895.0A CN109840710B (en) | 2019-02-13 | 2019-02-13 | Automatic rotary shift scheduling system for hospital standardized training |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109840710A CN109840710A (en) | 2019-06-04 |
| CN109840710B true CN109840710B (en) | 2022-09-02 |
Family
ID=66884653
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910112895.0A Active CN109840710B (en) | 2019-02-13 | 2019-02-13 | Automatic rotary shift scheduling system for hospital standardized training |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109840710B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112365378B (en) * | 2020-11-10 | 2021-11-09 | 上海凌立健康管理股份有限公司 | Docking system interacting with HIS (hardware-in-the-system) |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106779369B (en) * | 2016-12-03 | 2020-09-25 | 安徽中医药大学第一附属医院 | Hospital rotary scheduling method |
| JP6804383B2 (en) * | 2017-05-17 | 2020-12-23 | キヤノンメディカルシステムズ株式会社 | Resident allocation device, Resident allocation program, and Resident allocation system |
| CN108565013A (en) * | 2018-04-19 | 2018-09-21 | 南方医科大学第三附属医院（广东省骨科研究院） | A kind of intelligence rotation method and system of nursing practice students |
| CN108647296A (en) * | 2018-05-08 | 2018-10-12 | 南方医科大学第三附属医院（广东省骨科研究院） | A kind of the intelligent tutoring management method and system of nursing practice students |
-
2019
- 2019-02-13 CN CN201910112895.0A patent/CN109840710B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109840710A (en) | 2019-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Borko et al. | Teacher Decision Making 1 | |
| Shaw et al. | Student experience of final-year undergraduate research projects: an exploration of ‘research preparedness’ | |
| Careau et al. | Health leadership education programs, best practices, and impact on learners' knowledge, skills, attitudes, and behaviors and system change: a literature review | |
| Weitzman et al. | The development and initial validation of scales to assess attitudes toward multiple role planning | |
| Thompson et al. | A comparison of student performance on discipline-specific versus integrated exams in a medical school course | |
| Ma et al. | Knowledge map-based online micro-learning: impacts on learning engagement, knowledge structure, and learning performance of in-service teachers | |
| CN109840710B (en) | Automatic rotary shift scheduling system for hospital standardized training | |
| Bas | Pre-Service Secondary Mathematics Teachers' Metacognitive Awareness and Metacognitive Behaviours in Problem Solving Processes. | |
| Robinson-Reilly et al. | Adding telehealth simulation into NP programs | |
| Hooshangi et al. | Factors influencing student performance and persistence in cs2 | |
| Gray et al. | Performance indicators: flourish or perish? | |
| CN110276464A (en) | A kind of environmental protection technology service consultation management system Internet-based | |
| Cosgrove et al. | Understanding achievement in PIRLS and TIMSS 2011 | |
| CN112925919A (en) | Knowledge graph driven personalized job layout method | |
| US20170221163A1 (en) | Create a heterogeneous learner group | |
| CN114154053B (en) | Book recommendation method, device and storage medium | |
| CN115658928A (en) | Method and device for assembling test paper, computer equipment and storage medium | |
| Michaelson-Cohen et al. | Teaching clinicians practical genomic medicine: 7 years’ experience in a tertiary care center | |
| Neilens et al. | Effects of training and instruction on analytic and belief-based reasoning processes | |
| Balzer et al. | How we avoid patient shortage with an integrated analysis of learning objectives and clinical data during development of undergraduate medical curricula | |
| Tileng et al. | Social media application features to support coaching and mentoring process for student final project | |
| Chang et al. | Adaptive recommendations to students based on working memory capacity | |
| Thomas et al. | Mixed-methods study to develop a patient complexity assessment instrument for district nurses | |
| Patten et al. | Mentorship experiences and Perceptions of Didactic Program in Dietetics Students | |
| Pence et al. | Identifying Relevant Topics for Inclusion in an Ethics Curriculum for Anesthesiology Trainees: A Survey of Practitioners in the Field |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |