program schema
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 1)

H-INDEX

2
(FIVE YEARS 0)

Author(s):  
Enzo G. Plaitano ◽  
Bianca L. Pate ◽  
Elana F. Everett ◽  
Sarah K. Golden ◽  
Raymond A. Levy ◽  
...  

Abstract Objective: A mass gathering medicine training program was established for a 7,200-seat arena. The objectives of this study were to describe the program schema and determine its impact in preparing novice emergency medical technicians (EMTs) to manage the difficulties of large-venue emergency medical services (EMS). Methods: Optional, anonymous surveys were administered to EMTs. Novice EMTs were assessed pre-/post-program implementation, and both novice and experienced EMTs completed self-reported Likert scales. Data were analyzed with nonparametric methods. Results: A total of 43/56 responses (response rate = 76.8%) were received. Only 37.2% of providers felt prepared to work mass gatherings before the training, and 60.5% stated that their previous education did not prepare them for large-venue challenges. After the training program, novice EMTs were significantly associated with increased knowledge of large-venue EMS procedures (P = 0.0170), higher proficiency using extrication equipment (P = 0.0248), increased patient care skills (P = 0.0438), and both increased confidence working events (P = 0.0002) and better teamwork during patient encounters (P = 0.0001). The majority of EMTs reported the program as beneficial. Conclusion: Upon hire, EMS providers felt unprepared to work large-venue EMS. The analyses demonstrated that this training program improved select large-venue emergency skills for prehospital providers and may fill a gap in the education system regarding mass gathering medicine.


1982 ◽  
Vol 5 (3-4) ◽  
pp. 313-318
Author(s):  
Paweł Urzyczyn

We show an example of a first-order complete theory T, with no locally finite models and such that every program schema, total over a model of T, is strongly equivalent in that model to a loop-free schema. For this purpose we consider the notion of an algorithmically prime model, what enables us to formulate an analogue to Ryll-Nardzewski Theorem.


Sign in / Sign up

Export Citation Format

Share Document