To see the other types of publications on this topic, follow the link: Asynchronous scheduler.
Journal articles on the topic 'Asynchronous scheduler'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Asynchronous scheduler.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Cicerone, Serafino, Gabriele Di Stefano, and Alfredo Navarra. "“Semi-Asynchronous”: A New Scheduler in Distributed Computing." IEEE Access 9 (2021): 41540–57. http://dx.doi.org/10.1109/access.2021.3064880.
Full text
2
Pinkas, G., and R. Dechter. "Improving Connectionist Energy Minimization." Journal of Artificial Intelligence Research 3 (October 1, 1995): 223–48. http://dx.doi.org/10.1613/jair.130.
Full textAbstract:
Symmetric networks designed for energy minimization such as Boltzman machines and Hopfield nets are frequently investigated for use in optimization, constraint satisfaction and approximation of NP-hard problems. Nevertheless, finding a global solution (i.e., a global minimum for the energy function) is not guaranteed and even a local solution may take an exponential number of steps. We propose an improvement to the standard local activation function used for such networks. The improved algorithm guarantees that a global minimum is found in linear time for tree-like subnetworks. The algorithm, called activate, is uniform and does not assume that the network is tree-like. It can identify tree-like subnetworks even in cyclic topologies (arbitrary networks) and avoid local minima along these trees. For acyclic networks, the algorithm is guaranteed to converge to a global minimum from any initial state of the system (self-stabilization) and remains correct under various types of schedulers. On the negative side, we show that in the presence of cycles, no uniform algorithm exists that guarantees optimality even under a sequential asynchronous scheduler. An asynchronous scheduler can activate only one unit at a time while a synchronous scheduler can activate any number of units in a single time step. In addition, no uniform algorithm exists to optimize even acyclic networks when the scheduler is synchronous. Finally, we show how the algorithm can be improved using the cycle-cutset scheme. The general algorithm, called activate-with-cutset, improves over activate and has some performance guarantees that are related to the size of the network's cycle-cutset.
3
SRIVASTAVA, JAIDEEP, JAU-HWANG WANG, KUO WEI HWANG, and WEI TEK TSAI. "A TRANSACTION MODEL FOR PARALLEL RULE EXECUTION PART I: MODEL AND ALGORITHMS." International Journal on Artificial Intelligence Tools 02, no. 03 (September 1993): 395–429. http://dx.doi.org/10.1142/s0218213093000205.
Full textAbstract:
This paper introduces a transaction model for parallel production systems, where rules can be fired in a completely asynchronous parallel manner. A model is developed to describe two properties of a serial production system execution, namely, conditional dependence (a rule firing removes another from the conflict set) and prioritization (by the conflict resolution mechanism). These are used as the basis to define the correctness criteria for parallel production execution, namely, conditional serializability, prioritized serializability, and prioritized conditional serializability. A graph model is used to represent production system execution which provides a means of expressing correctness as graph acyclicity, which in turn is used as a basis to develop practical schedulers that manage the concurrent asynchronous production execution and ensure correctness. Two practical schedulers, namely, conditional strict two-phase locking and priority queue scheduler are developed for conditional serializability and prioritized serializability, respectively. They are combined for prioritized conditional serializability.
4
Pavon-Marino, P., M. Bueno-Delgado, W. Cerroni, A. Campi, and F. Callegati. "A parallel iterative scheduler for asynchronous Optical Packet Switching networks." Optical Switching and Networking 8, no. 2 (April 2011): 103–15. http://dx.doi.org/10.1016/j.osn.2010.11.001.
Full text
5
Sun, Jianhui, Xidong Wu, Heng Huang, and Aidong Zhang. "On the Role of Server Momentum in Federated Learning." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 13 (March 24, 2024): 15164–72. http://dx.doi.org/10.1609/aaai.v38i13.29439.
Full textAbstract:
Federated Averaging (FedAvg) is known to experience convergence issues when encountering significant clients system heterogeneity and data heterogeneity. Server momentum has been proposed as an effective mitigation. However, existing server momentum works are restrictive in the momentum formulation, do not properly schedule hyperparameters and focus only on system homogeneous settings, which leaves the role of server momentum still an under-explored problem. In this paper, we propose a general framework for server momentum, that (a) covers a large class of momentum schemes that are unexplored in federated learning (FL), (b) enables a popular stagewise hyperparameter scheduler, (c) allows heterogeneous and asynchronous local computing. We provide rigorous convergence analysis for the proposed framework. To our best knowledge, this is the first work that thoroughly analyzes the performances of server momentum with a hyperparameter scheduler and system heterogeneity. Extensive experiments validate the effectiveness of our proposed framework. Due to page limit, we leave all proofs to the full version https://arxiv.org/abs/2312.12670.
6
Aumann, Yonatan, and Michael A. Bender. "Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler." Distributed Computing 17, no. 3 (March 2005): 191–207. http://dx.doi.org/10.1007/s00446-004-0113-4.
Full text
7
Shakir, Shaffath Hussain, and A. Rajesh. "Improved calendar disc scheduler for LTE advanced networks with HARQ." Journal of High Speed Networks 27, no. 2 (July 7, 2021): 139–49. http://dx.doi.org/10.3233/jhs-210656.
Full textAbstract:
Long Term Evolution Advanced (LTE-A) is a broadband wireless technology that supports variety of services with different data rate. In order to achieve this the evolved Node B (eNB) uses different features provided in the 3GPP standards. Features like Carrier Aggregation (CA), Multiple input and Multiple output (MIMO) and Hybrid Automatic Repeat Request (HARQ) help to increase the throughput and spectral efficiency. In this paper, a novel two-level calendar disc algorithm with HARQ is introduced at the eNB for effectively scheduling real time and non-real time traffic with different service types. The algorithm also uses a burst profile management module that analyzes the current user profile and notifies the scheduler about the need to change in profile based on power boosting. The Calendar Disc Scheduler (CDS) is improved by adding HARQ retransmission index as a parameter in calculating the metric weight. The scheduler was tested for both adaptive and non-adaptive methods of HARQ in both synchronous and asynchronous modes. The proposed improved CDS scheduler was simulated with LTESim simulator and compared with calendar disc algorithm without HARQ improvements. Results show that the proposed scheduling method provides increased performance in terms of goodput, delay and spectral efficiency.
8
Peng, Quan, and Shan Wang. "MASA: Multi-Application Scheduling Algorithm for Heterogeneous Resource Platform." Electronics 12, no. 19 (September 27, 2023): 4056. http://dx.doi.org/10.3390/electronics12194056.
Full textAbstract:
Heterogeneous architecture-based systems-on-chip enable the development of flexible and powerful multifunctional RF systems. In complex and dynamic environments where applications arrive continuously and stochastically, real-time scheduling of multiple applications to appropriate processor resources is crucial for fully utilizing the heterogeneous SoC’s resource potential. However, heterogeneous resource-scheduling algorithms still face many problems in practical situations, including generalized abstraction of applications and heterogeneous resources, resource allocation, efficient scheduling of multiple applications in complex mission scenarios, and how to ensure the effectiveness combining with real-world applications of scheduling algorithms. Therefore, in this paper, we design the Multi-Application Scheduling Algorithm, named MASA, which is a two-phase scheduler architecture based on Deep Reinforcement Learning. The algorithm is made up of neural network scheduler-based task prioritization for dynamic encoding of applications and heuristic scheduler-based task mapping for solving the processor resource allocation problem. In order to achieve stable and fast training of the network scheduler based on the actor–critic strategy, we propose optimization methods for the training of MASA: reward dynamic alignment (RDA), earlier termination of the initial episodes, and asynchronous multi-agent training. The performance of the MASA is tested with classic directed acyclic graph and six real-world application datasets, respectively. Experimental results show that MASA outperforms other neural scheduling algorithms and heuristics, and ablation experiments illustrate how these training optimizations improve the network’s capacity.
9
Ageev, Aleksey Vladimirovich, Andrey Alexandrovich Boguslavskiy, and Sergey Mikhailovich Sokolov. "Task scheduling in the onboard computer system." Keldysh Institute Preprints, no. 43 (2023): 1–27. http://dx.doi.org/10.20948/prepr-2023-43.
Full textAbstract:
The problem of rational resource allocation in the on-board computing system of a robotic complex is considered. As a first step, the possibility of using online scheduling algorithms without preemptive for distributed systems, the Round Robin cyclic algorithm, is analyzed. To demonstrate the basic capabilities of the developed scheduler, a video stream segmentation task is used. The peculiarities of task processing for real-time vision systems are demonstrated. The problem of inter-node synchronization of sensor data is solved. A feature of on-board robotics resources, such as the need for a linking software in the form of Robot Operation System, is taken into account. To develop the task scheduler, the C++ programming language and the ROS2 framework, which provides asynchronous networking, are used. A scheduling model and software implementing this model are being built to perform tasks in a distributed environment in order to control the processing of video streams in a vision system.
10
Lv, Fang, Lei Liu, Hui-min Cui, Lei Wang, Ying Liu, Xiao-bing Feng, and Pen-Chung Yew. "WiseThrottling: a new asynchronous task scheduler for mitigating I/O bottleneck in large-scale datacenter servers." Journal of Supercomputing 71, no. 8 (April 26, 2015): 3054–93. http://dx.doi.org/10.1007/s11227-015-1427-7.
Full text
11
Riley, Daniel, and Christopher Jones. "Multi-threaded Output in CMS using ROOT." EPJ Web of Conferences 214 (2019): 02016. http://dx.doi.org/10.1051/epjconf/201921402016.
Full textAbstract:
CMS has worked aggressively to make use of multi-core architectures, routinely running 4- to 8-core production jobs in 2017. The primary impediment to efficiently scaling beyond 8 cores has been our ROOT-based output module, which has been necessarily single threaded. In this paper we explore the changes made to the CMS framework and our ROOT output module to overcome the previous scaling limits, using two new ROOT features: the TBufferMerger asynchronous file merger, and Implicit Multi-Threading. We examine the architecture of the new parallel output module, the specific accommodations and modifications that were made to ensure compatibility with the CMS framework scheduler, and the performance characteristics of the new output module.
12
Martínez-García, Edgar A., Rafael Torres-Córdoba, Victor M. Carrillo-Saucedo, and Elifalet López-González. "Neural control and coordination of decentralized transportation robots." Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering 232, no. 5 (March 9, 2018): 519–40. http://dx.doi.org/10.1177/0959651818756777.
Full textAbstract:
This work presents the modeling, control architecture and simulation of a decentralized multi-robot system for transporting material in a warehouse. Each robot has a task scheduler comprising two different neural networks for task allocation and fault tolerance. The path planner consists of a first-order dynamical state equation to control the robot’s four-wheel asynchronous driving and steering, as well as a partial differential equation to coordinate speeds and arrival times. The task allocation and motion coordination combine the robot’s kinematic control law with a one-layer artificial neural network that classifies five-dimensional symbolic logical equations that define the state transitions between asynchronous events. These events include carry and fetch, material supply, robots stop, obstacle avoidance and battery state. Another multilayer artificial neural network reads the same state inputs for fault detection and recovery. The two neural systems feed forward a navigation planner, which uses a partial differential equation to coordinate the robot’s speed and its relaxation time with respect to the robot in front of it. The energy cost is measured by a Lagrangian function. The proposed planning control scheme was computationally validated through parallel computing simulations. The system is shown to be consistent, reliable and feasible, and it allows for fast navigational tasks.
13
Bhagat, Subhash, Abhinav Chakraborty, Bibhuti Das, and Krishnendu Mukhopadhyaya. "Gathering over Meeting Nodes in Infinite Grid*." Fundamenta Informaticae 187, no. 1 (September 12, 2022): 1–30. http://dx.doi.org/10.3233/fi-222128.
Full textAbstract:
The gathering over meeting nodes problem asks the robots to gather at one of the pre-defined meeting nodes. The robots are deployed on the nodes of an anonymous two-dimensional infinite grid, which has a subset of nodes marked as meeting nodes. Robots are identical, autonomous, anonymous and oblivious. They operate under an asynchronous scheduler. They do not have any agreement on a global coordinate system. All the initial configurations for which the problem is deterministically unsolvable have been characterized. A deterministic distributed algorithm has been proposed to solve the problem for the remaining configurations. The efficiency of the proposed algorithm is studied in terms of the number of moves required for gathering. A lower bound concerning the total number of moves required to solve the gathering problem has been derived.
14
Wolfmann, Gustavo. "Parallel Execution on HeterogeneousMultiprocessors from Algorithm Models Based on Petri Nets." EQUATIONS 1 (July 14, 2021): 47–54. http://dx.doi.org/10.37394/232021.2021.1.7.
Full textAbstract:
Current supercomputers are composed by nodes containing a combination of general purpose computing units (CPUs) and specific mathematical coprocessors. In this way, GPGPUs or Xeon Phi cards are attached to the nodes to improve its performance. Both types of processors, CPUs and coprocessors, have many differences, like their architecture, the clock rate of the processors and the operation of the related memory. These are the main factors that conform an heterogeneous multiprocessor. A parallel program that wants to achieve the sum of the performance of both types of processors, must consider not only the complexity of the parallel algorithm, but also the differences in the architecture of processors, increasing its complexity. As a contribution on this problem, this paper presents a model of parallel execution based on Petri Nets, called PN-PEM, that is used not only to model a parallel algorithm, but also to execute it directly on a computer with heterogeneous multiprocessors. An asynchronous execution of tasks and a dynamic scheduler are the main characteristics that allow execute a parallel program on this type of parallel computer. Tests done on a multicore computer with two Xeon Phi cards reach the aggregate performance of both type of processors, confirming the quality of the model used.
15
Ngoc, Duong Van, and Nguyen Tien Dat. "A design in system architecture based on mobile cloud computing for a virtual try-on solution." International Journal of ADVANCED AND APPLIED SCIENCES 9, no. 6 (June 2022): 36–42. http://dx.doi.org/10.21833/ijaas.2022.06.005.
Full textAbstract:
Cloud computing is an emerging technology in this digital century. It provides an excellent but low-cost source for database storage, computing power, applications, and services through an internet-delivered cloud platform. Thanks to the cost savings in investing and maintaining physical data centers, as well as the stability of Quality of Service (QoS), it has no restrictions on company size or sector for enterprises to shift their operations to a cloud platform. The fashion industry, particularly the fashion e-commerce sector, is a case study in leveraging the cloud platform via a technology called “Virtual try-on” (VTO). VTO solution allows fashion brands to increase the shopping experience, however, requires installing and maintaining a bulky system for implementation. There are different methods and approaches to design architectures using cloud computing, however, there have not been many studies addressing tasks related to machine learning that uses the high Graphics Processing Unit (GPU) encountered in VTO solutions. To design a scheduler that could optimize the system performance while lowering operational expenses in VTO solutions, this research proposes a system to (1) handle synchronous model and asynchronous model separately and clearly, (2) perform multi-layered task processing architecture by hashing task ID and implementing a queue management system. This method would satisfy three major requirements: (1) Avoid complex hardware requirements for users, (2) Ensure the system stability and the ease of horizontal and vertical extension, and (3) Protect user information privacy.
16
JOSHI, POONAM, SMITA DAS, SHASHI MAWAR, LAKSHMANAN GOPICHANDRAN, NITISH NAIK, AHAMADULLA SHARIFF, and RAKESH GARG. "Comparing two different schedules of online learning for updated cardiopulmonary resuscitation guidelines in Covid-19 patients: A randomized study." National Medical Journal of India 35 (November 30, 2022): 168–71. http://dx.doi.org/10.25259/nmji-35-3-168.
Full textAbstract:
Background Coronavirus disease 2019 (Covid-19) is an evolving disease with newly generated evidence related to the clinical management of Covid-19 patients. We aimed to compare two online learning schedules for disseminating new cardiopulmonary resuscitation (CPR) guidelines in terms of knowledge gain and acceptability among nurses. Methods In a prospective randomized controlled study, 61 nurses trained in comprehensive cardiopulmonary life support (CCLS) were randomized to synchronous (n=31) and asynchronous learning groups (n= 30). The enhanced training module on CPR (ETMCPR) prepared by a team of experts was used to impart training to the nurses. Baseline data and pre-intervention knowledge of participants were collected using a structured demographic sheet and knowledge questionnaire (25 items) in a google form. Nurses in the synchronous group were provided training using ETMCPR through a licensed Zoom platform, while the nurses in the asynchronous group had access to the uploaded ETMCPR module in the e-learning platform. At the end of the intervention, the knowledge of the nurses was assessed along with their acceptability to the online learning schedule. Results Both schedules of online learning were effective in improving the knowledge scores of the nurses (11.93 [3.26] v. 21.15 [1.90], p=0.01 and 11.71 [3.12] v. 20.32 [1.71], p=0.01). The mean acceptability scores of nurses in the asynchronous group were statistically lower than in the synchronous group (38.93 [2.50] v. 42.5 [3.08], p=0.007). Conclusion Both synchronous and asynchronous schedules of online learning were effective in disseminating updated CPR guidelines; however, nurses in the synchronous group were more satisfied with the learning schedule.
17
Bin Zamanhuri, Mohd Afiq, Zalilah Abd Aziz, Rose Hafsah Abd Rauf, Elly Johana Johan, and Noratikah Shamsudin. "A review on various methods of collaborative computing." Indonesian Journal of Electrical Engineering and Computer Science 16, no. 2 (November 1, 2019): 1002. http://dx.doi.org/10.11591/ijeecs.v16.i2.pp1002-1008.
Full textAbstract:
Currently, mosques in Malaysia distribute their lecture schedules either on paper-based form or by uploading the schedule on their social media platform. This has some disadvantages such as paper schedules are susceptible to damages and information on social media platform is often not updated to current changes. Collaborative Computing is a system that enable individuals to work together remotely by making use of the reach ability of the internet. In order to utilise the Internet’s obvious advantages over paper-based and rapid information distribution and asynchronous communication, a review is conducted to study the available methods of collaborative computing, further analyse current research papers. Result shows that Centralized Computing method is the most suitable method for developing collaborative mobile application for Islamic Lectures schedule.
18
Clevenger, Carolyn. "BRINGING INTERACTIVITY TO FULLY ASYNCHRONOUS PROGRAMS." Innovation in Aging 6, Supplement_1 (November 1, 2022): 434. http://dx.doi.org/10.1093/geroni/igac059.1703.
Full textAbstract:
Abstract Asynchronous online learning brings both new opportunities as well as challenges to an asynchronous psychoeducation program like Tele-Savvy@Home. While asynchronous learning offers engagement flexibility for time-strapped family caregivers, a lack of scheduled meetings represents a lack of contact and interactivity, threatens accountability, and produces a high incompletion rate. To engage participants in the next generation of this asynchronous, self-paced course, we have implemented a small cohort structure (10 participants each) and created a combination of automated prompts and optional touchpoints. The cohort structure and touchpoints mimic important shared and active learning components of the facilitated sessions. Prompts include weekly messages that nudge learners with reminders of their ideal progress point and offer value propositions for staying on-time. A pacing guide allows caregivers to build the course into their schedule in advance of the course’s start. Optional touchpoints include unit-by-unit post-tests, a cohort-based discussion board, and free text reflective exercises.
19
Rhodes, David L., and Wayne Wolf. "TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS." International Journal of Foundations of Computer Science 12, no. 05 (October 2001): 565–80. http://dx.doi.org/10.1142/s0129054101000667.
Full textAbstract:
While many forms of schedule decision problems are known to be NP-complete, two forms of schedule analysis problems are shown to be coNP-complete in the strong sense. Each of these involve guaranteeing that all deadlines are met for a set of task-graphs in statically-mapped, priority-based, multiprocessor schedules given particular variabilities. Specifically, the first of these allows run-times which axe bracketed, where the actual run-time of some tasks can take on any value within a given range. The second deals with task-graphs which arrive asynchronously, that is where the release-time for each task-graphs may take either any or a bracketed value. These variations correspond to task-graphs with either release-time or run-time jitter. The results are robust in the sense that they apply when schedules are either preemptive or non-preemptive as well as for several other problem variations.
20
Balbi, Helga D., Ricardo C. Carrano, Diego Passos, and Célio Albuquerque. "Revisiting Probabilistic Schedule-Based Asynchronous Duty Cycling." International Journal of Wireless Information Networks 26, no. 1 (December 10, 2018): 24–38. http://dx.doi.org/10.1007/s10776-018-0420-5.
Full text
21
Aida-Zade, Kamil, Reshad Ismibayli, and Sona Rzayeva. "Automated Schedule System for Universities under the Bologna Education Process." Cybernetics and Computer Technologies, no. 1 (March 29, 2024): 75–90. http://dx.doi.org/10.34229/2707-451x.24.1.6.
Full textAbstract:
Introduction. Countries that have joined the Bologna Process in higher education assume certain obligations. One of them is the transition to a credit education system, which is based on the personal participation of each student in the formation of their curriculum. Each student has the opportunity to structure the learning process, choose subjects and the sequence of their study within the framework of the curriculum for the chosen specialty, create their own individual schedule in accordance with their interests, capabilities and needs. The credit training system is asynchronous. Naturally, software applications for scheduling classes, developed for the classical education system, do not work in this case. Purpose. Development of an algorithm and software for a class scheduling system designed for the credit education system and taking into account its features, and also meets all the “hard” restrictions and most of the “soft” requirements for the class schedule. Results. The algorithm and software of the interactive system of scheduling classes for universities that have joined the Bologna process, which takes into account the features of credit-modular system of training, have been developed. Conclusions. The developed system covers the full cycle of including students in groups to study selected subjects and teachers, starting from scheduling teachers, registering students and ending with the formation of individual schedules for each student; The proposed iterative process of scheduling makes it possible to make changes to the schedule of teachers and re-register students in the case of teachers who have not formed groups, or a significant number of students who were unable to enroll in subjects of interest to them; The interactive mode of operation with the system combines an automated process of scheduling with active participation of the user responsible for scheduling; The system guarantees the preparation of permissible timetables for teachers and students, taking into account the implementation of all "hard" restrictions, and significantly reduces the time required for scheduling; The system ensures to the maximum extent the quality of teachers’ schedules, namely, taking into account “soft” requirements with the active participation of the user, who has the opportunity to choose an option that reduces the value of the function proposed in the article that evaluates the quality of the schedule; The developed system ensures the effective use of the classroom fund in accordance with its capacity, specialization and affiliation. Keywords: Bologna process of education, credit system, asynchronous learning system, class schedule, scheduling requirements, computer system.
22
Turner, J. "Strong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers." IEEE/ACM Transactions on Networking 17, no. 4 (August 2009): 1017–28. http://dx.doi.org/10.1109/tnet.2008.2006221.
Full text
23
Chang, Chin-Yao, Jorge Cortes, and Sonia Martinez. "Scheduled-Asynchronous Distributed Algorithm for Optimal Power Flow." IEEE Transactions on Control of Network Systems 6, no. 1 (March 2019): 261–75. http://dx.doi.org/10.1109/tcns.2018.2809963.
Full text
24
Hu, Hsu-Chieh, and Stephen F. Smith. "Using Bi-Directional Information Exchange to Improve Decentralized Schedule-Driven Traffic Control." Proceedings of the International Conference on Automated Planning and Scheduling 29 (May 25, 2021): 200–208. http://dx.doi.org/10.1609/icaps.v29i1.3477.
Full textAbstract:
Recent work in decentralized, schedule-driven traffic control has demonstrated the ability to improve the efficiency of traffic flow in complex urban road networks. In this approach, a scheduling agent is associated with each intersection. Each agent senses the traffic approaching its intersection and in real-time constructs a schedule that minimizes the cumulative wait time of vehicles approaching the intersection over the current look-ahead horizon. In order to achieve network level coordination in a scalable manner, scheduling agents communicate only with their direct neighbors. Each time an agent generates a new intersection schedule it communicates its expected outflows to its downstream neighbors as a prediction of future demand and these outflows are appended to the downstream agent’s locally perceived demand. In this paper, we extend this basic coordination algorithm to additionally incorporate the complementary flow of information reflective of an intersection’s current congestion level to its upstream neighbors. We present an asynchronous decentralized algorithm for updating intersection schedules and congestion level estimates based on these bi-directional information flows. By relating this algorithm to the self-optimized decision making of the basic operation, we are able to approach network-wide optimality and reduce inefficiency due to strictly self-interested intersection control decisions.
25
Lubitch, Ronit, and Shlomo Moran. "Closed schedulers: a novel technique for analyzing asynchronous protocols." Distributed Computing 8, no. 4 (June 1995): 203–10. http://dx.doi.org/10.1007/bf02242738.
Full text
26
Jang, Beakcheol, Jun Bum Lim, and Mihail L. Sichitiu. "An asynchronous scheduled MAC protocol for wireless sensor networks." Computer Networks 57, no. 1 (January 2013): 85–98. http://dx.doi.org/10.1016/j.comnet.2012.09.002.
Full text
27
Tian, Ye, Qingfan Li, Yongxin Feng, and Xiaoling Gao. "A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary." Mathematical Problems in Engineering 2013 (2013): 1–13. http://dx.doi.org/10.1155/2013/391493.
Full textAbstract:
A virtual channels scheduling algorithm with broad applicability based on movable boundary is proposed. According to the types of date sources, transmission time slots are divided into synchronous ones and asynchronous ones with a movable boundary between them. During the synchronous time slots, the virtual channels are scheduled with a polling algorithm; during the asynchronous time slots, the virtual channels are scheduled with an algorithm based on virtual channel urgency and frame urgency. If there are no valid frames in the corresponding VC at a certain synchronous time slot, a frame of the other synchronous VCs or asynchronous VCs will be transmitted through the physical channel. Only when there are no valid frames in all VCs would an idle frame be generated and transmitted. Experiments show that the proposed algorithm yields much lower scheduling delay and higher channel utilization ratio than those based on unmovable boundary or virtual channel urgency in many kinds of sources. Therefore, broad applicability can be achieved by the proposed algorithm.
28
Ishii, Taku, and Takayuki Sakagami. "Self-control and impulsiveness with asynchronous presentation of reinforcement schedules." Behavioural Processes 59, no. 1 (July 2002): 25–35. http://dx.doi.org/10.1016/s0376-6357(02)00059-1.
Full text
29
Umoren, Rachel A., Julie A. Poore, Linda Sweigart, Natalia Rybas, Evalyn Gossett, Miles Johnson, Martina Allen, Patricia J. Scott, Barbara Truman, and Rohit Das. "TeamSTEPPS Virtual Teams: Interactive Virtual Team Training and Practice for Health Professional Learners." Creative Nursing 23, no. 3 (2017): 184–91. http://dx.doi.org/10.1891/1078-4535.23.3.184.
Full textAbstract:
Medical errors because of communication failure are common in health care settings. Teamwork training, such as Team Strategies and Tools to Enhance Performance and Patient Safety (TeamSTEPPS), improves team performance and patient outcomes. Academic institutions seek high-quality, low-cost curricula for interprofessional education (IPE) to prepare learners for clinical experiences before and after graduation; however, most IPE curricula involve lectures, simple tabletop exercises, and in-person simulations and are not readily accessible to geographically distributed and asynchronously engaged learners. To address this need, interprofessional faculty from multiple institutions and specialties created a series of eight screen-based interactive virtual simulation cases featuring typical clinical situations, with the goal of preparing learners to provide safe and effective care in clinical teams. Virtual simulations permit flexible, asynchronous learning on the learner’s schedule and allow educators an opportunity to identify gaps in knowledge and/or attitudes that can be addressed during class or forum discussions. In 2016, 1,128 unique users accessed the scenarios. As a result of such virtual activities, learner selection of the appropriate TeamSTEPPS tool increased with progression through the scenarios.
30
DAHLEM, MARC, ANOOP BHAGYANATH, and KLAUS SCHNEIDER. "Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP." Theory and Practice of Logic Programming 18, no. 3-4 (July 2018): 438–51. http://dx.doi.org/10.1017/s1471068418000170.
Full textAbstract:
AbstractConventional processor architectures are restricted in exploiting instruction level parallelism (ILP) due to the relatively low number of programmer-visible registers. Therefore, more recent processor architectures expose their datapaths so that the compiler (1) can schedule parallel instructions to different processing units and (2) can make effective use of local storage of the processing units. Among these architectures, the Synchronous Control Asynchronous Dataflow (SCAD) architecture is a new exposed datapath architecture whose processing units are equipped with first-in first-out (FIFO) buffers at their input and output ports.In contrast to register-based machines, the optimal code generation for SCAD is still a matter of research. In particular, SAT and SMT solvers were used to generate optimal resource constrained and optimal time constrained schedules for SCAD, respectively. As Answer Set Programming (ASP) offers better flexibility in handling such scheduling problems, we focus in this paper on using an answer set solver for both resource and time constrained optimal SCAD code generation. As a major benefit of using ASP, we are able to generatealloptimal schedules for a given program which allows one to study their properties. Furthermore, the experimental results of this paper demonstrate that the answer set solver can compete with SAT solvers and outperforms SMT solvers.This paper is under consideration for acceptance in TPLP.
31
Perkins, Tanya. "Reading Together." KULA: Knowledge Creation, Dissemination, and Preservation Studies 6, no. 1 (March 1, 2022): 1–8. http://dx.doi.org/10.18357/kula.238.
Full textAbstract:
This teaching reflection examines how “reading together” was fostered in synchronous and asynchronous online environments in two undergraduate creative writing courses through participation in a virtual book club. In the first course, prior to the pandemic, students had the option of meeting in person or via Zoom while we read Daisy Johnson’s Oedipus Rex retelling, Everything Under, for the book club. In the second course, during the pandemic, students had virtual synchronous and written participation choices while we read together Jessica Anthony’s political satire, Enter the Aardvark, with the author visiting in two sessions. In both cases, the goals were consistent: to get students reading as writers; to foster intrinsic motivation through personal choice; and to satisfy students’ desire for community connection while still accommodating personal schedules and geographical location. A virtual book club lets students read on their own schedule and in their own space, but still share their experience and observations with peers over greater distances (and time zones) than would otherwise be possible.
32
Yuan, Li-yong, Fei-long Lin, and Jun-ke Lv. "An improved asynchronous energy-saving mechanism for IEEE 802.15.5-based networks." International Journal of Distributed Sensor Networks 14, no. 9 (September 2018): 155014771880218. http://dx.doi.org/10.1177/1550147718802184.
Full textAbstract:
IEEE 802.15.5 standard introduces the mesh routing which improves reliability and robustness of routing in wireless sensor network since there are multiple routes from source node to destination node. To achieve energy efficiency for a long network lifetime, the asynchronous energy saving is proposed in IEEE 802.15.5, which includes the receiver-initiated unicast mechanism and the sender-initiated broadcast mechanism. In this article, an improved asynchronous energy saving named semi-synchronous energy saving is proposed to deal with the energy inefficiency from idle listening existing in asynchronous energy saving. In semi-synchronous energy saving, every node maintains the wake/sleep schedule information of nodes in its two-hop neighborhood and uses this information to calculate the wake-up time of an interested neighbor that the data will be sent to, which reduces idle listening time in both unicast and broadcast mechanisms. A low delay routing mechanism is also proposed based on the wake/sleep schedule information of neighbors. Furthermore, the optimal guard time to guarantee receiving the wake-up notification from neighbor in the presence of clock drift is investigated for saving energy. The performance analysis and simulation evaluation show that semi-synchronous energy saving saves more than 80% of energy with less than 30% memory cost compared to asynchronous energy saving, and it also improves the time of completing broadcast and the end-to-end delay.
33
Saletin, Jared, Judith Owens, Kyla Wahlstrom, Sarah Honaker, Amy Wolfson, Azizi Seixas, Patricia Wong, Mary Carskadon, and Lisa Meltzer. "237 Sleep disturbances, online instruction, and learning during COVID-19: evidence from 4148 adolescents in the NESTED study." Sleep 44, Supplement_2 (May 1, 2021): A94—A95. http://dx.doi.org/10.1093/sleep/zsab072.236.
Full textAbstract:
Abstract Introduction COVID-19 fundamentally altered education in the United States. A variety of in-person, hybrid, and online instruction formats took hold in Fall 2020 as schools reopened. The Nationwide Education and School in TEens During COVID (NESTED) study assessed how these changes impacted sleep. Here we examined how instruction format was associated with sleep disruption and learning outcomes. Methods Data from 4148 grade 6-12 students were included in the current analyses (61% non-male; 34% non-white; 13% middle-school). Each student’s instructional format was categorized as: (i) in-person; (ii) hybrid [≥1 day/week in-person]; (iii) online/synchronous (scheduled classes); (iv) online/asynchronous (unscheduled classes); (v) online-mixed; or (vi) no-school. Sleep disturbances (i.e., difficulty falling/staying asleep) were measured with validated PROMIS t-scores. A bootstrapped structural equation model examined how instructional format and sleep disturbances predict school/learning success (SLS), a latent variable loading onto 3 outcomes: (i) school engagement (ii) likert-rated school stress; and (iii) cognitive function (PROMIS t-scores). The model covaried for gender, race-ethnicity, and school-level Results Our model fit well (RMSEA=.041). Examining total effects (direct + indirect), online and hybrid instruction were associated with lower SLS (b’s:-.06 to -.26; p’s<.01). The three online groups had the strongest effects (synchronous: b=-.15; 95%CI: [-.20, -.11]; asynchronous: b=-.17; [-.23, -.11]; mixed: b=-.14; [-.19, -.098]; p’s<.001). Sleep disturbance was also negatively associated with SLS (b=-.02; [-.02, -.02], p<.001). Monte-carlo simulations confirmed sleep disturbance mediated online instruction’s influence on SLS. The strongest effect was found for asynchronous instruction, with sleep disturbance mediating 24% of its effect (b = -.042; [-0.065, -.019]; p<.001). This sleep-mediated influence of asynchronous instruction propagated down to each SLS measure (p’s<.001), including a near 3-point difference on PROMIS cognitive scores (b = -2.86; [-3.73, -2.00]). Conclusion These analyses from the NESTED study indicate that sleep disruption may be one mechanism through which online instruction impacted learning during the pandemic. Sleep disturbances were unexpectedly influential for unscheduled instruction (i.e., asynchronous). Future analyses will examine specific sleep parameters (e.g., timing) and whether sleep’s influence differs in teens who self-report learning/behavior problems (e.g., ADHD). These nationwide data further underscore the importance of considering sleep as educators and policy makers determine school schedules. Support (if any):
34
Hu, Hsu-Chieh, and Stephen Smith. "Coping with Large Traffic Volumes in Schedule-Driven Traffic Signal Control." Proceedings of the International Conference on Automated Planning and Scheduling 27 (June 5, 2017): 154–62. http://dx.doi.org/10.1609/icaps.v27i1.13835.
Full textAbstract:
Recent work in decentralized, schedule-driven traffic control has demonstrated the ability to significantly improve traffic flow efficiency in complex urban road networks. However, in situations where vehicle volumes increase to the point that the physical capacity of a road network reaches or exceeds saturation, it has been observed that the effectiveness of a schedule-driven approach begins to degrade, leading to progressively higher network congestion. In essence, the traffic control problem becomes less of a scheduling problem and more of a queue management problem in this circumstance. In this paper we propose a composite approach to real-time traffic control that uses sensed information on queue lengths to influence scheduling decisions and gracefully shift the signal control strategy to queue management in high volume/high congestion settings. Specifically, queue-length information is used to establish weights for the sensed vehicle clusters that must be scheduled through a given intersection at any point, and hence bias the wait time minimization calculation. To compute these weights, we develop a model in which successive movement phases are viewed as different states of an Ising model, and parameters quantify strength of interactions. To ensure scalability, queue information is only exchanged between direct neighbors and the asynchronous nature of local intersection scheduling is preserved. We demonstrate the potential of the approach through microscopic traffic simulation of a real-world road network, showing a 60% reduction in average wait times over the baseline schedule-driven approach in heavy traffic scenarios. We also report initial field test results, which show the ability to reduce queues during heavy traffic periods.
35
Chen, Sixia, Reynaldo Morillo, Yanyuan Qin, Alexander Russell, Ruofan Jin, Bing Wang, and Sudarshan Vasudevan. "Asynchronous Neighbor Discovery on Duty-Cycled Mobile Devices: Models and Schedules." IEEE Transactions on Wireless Communications 19, no. 8 (August 2020): 5204–17. http://dx.doi.org/10.1109/twc.2020.2990764.
Full text
36
Lytvyn, Valentyna, Olena Akimova, Halyna Kuznetsova, Tetiana Zenchenko, Olena Stepanenko, and Inna Koreneva. "use of synchronous and asynchronous teaching methods in pedagogical education in COVID-19 terms." International journal of health sciences 5, no. 3 (December 24, 2021): 617–29. http://dx.doi.org/10.53730/ijhs.v5n3.2681.
Full textAbstract:
The purpose of the academic paper lies in determining the ratio of synchronous and asynchronous teaching methods in modern pedagogy on the example of the analysis of the activity of higher education institutions within the conditions of quarantine restrictions. The sociological survey was conducted in two stages. Stage I – July – September 2021 (stage of information collection: opinion poll). The second stage is October 2021 (analytical). The advantages of synchronous teaching and learning have been determined, namely: easy interaction; real-time mode; questioning, instant answers, motivation, and help, immediate feedback from the teacher, group classes, high concentration. The disadvantages of synchronous teaching and learning have been identified, namely: physical compliance with the schedule, poor implementation of individualization, appropriate training, poor content of the digital learning platform, poor organization of various communication channels, and low level of digital alternative. The list of benefits of asynchronous learning has been revealed as follows: flexibility, antilocalization, economy, time mobility, one’s own working pace, the schedule convenience, point definition of the purposes. It has been found that the drawbacks of asynchronous learning are as follows: a decrease in an academic discipline, a decrease in socialization, feedback difficulty, limited contact, isolation, the need for self-discipline.
37
Lee, Woosik, and Teukseob Song. "Block combination–based asynchronous wake-up schedule in wireless sensor networks." International Journal of Distributed Sensor Networks 13, no. 10 (October 2017): 155014771773602. http://dx.doi.org/10.1177/1550147717736026.
Full text
38
Carrano, Ricardo C., Diego Passos, Luiz C. S. Magalhães, and Célio V. N. Albuquerque. "Nested block designs: Flexible and efficient schedule-based asynchronous duty cycling." Computer Networks 57, no. 17 (December 2013): 3316–26. http://dx.doi.org/10.1016/j.comnet.2013.07.020.
Full text
39
Wong, Patricia, Amy Wolfson, Sarah Honaker, Judith Owens, Kyla Wahlstrom, Jared Saletin, Azizi Seixas, Lisa Meltzer, and Mary Carskadon. "238 Adolescent Sleep Variability, Social Jetlag, and Mental Health during COVID-19: Findings from a Large Nationwide Study." Sleep 44, Supplement_2 (May 1, 2021): A95. http://dx.doi.org/10.1093/sleep/zsab072.237.
Full textAbstract:
Abstract Introduction Adolescents are vulnerable to short, insufficient sleep stemming from a combined preference for late bedtimes and early school start times, and also circadian disruptions from frequent shifts in sleep schedules (i.e., social jetlag). These sleep disruptions are associated with poor mental health. The COVID-19 pandemic has impacted education nationwide, including changes in instructional formats and school schedules. With data from the Nationwide Education and Sleep in TEens During COVID (NESTED) study, we examined whether sleep variability and social jetlag (SJL) during the pandemic associate with mental health. Methods Analyses included online survey data from 4767 students (grades 6-12, 46% female, 36% non-White, 87% high school). For each weekday, participants identified if they attended school in person (IP), online-scheduled synchronous classes (O/S), online-no scheduled classes (asynchronous, O/A), or no school. Students reported bedtimes (BT) and wake times (WT) for each instructional format and for weekends/no school days. Sleep opportunity (SlpOpp) was calculated from BT and WT. Weekday night-to-night SlpOpp variability was calculated with mean square successive differences. SJL was calculated as the difference between the average sleep midpoint on free days (O/A, no school, weekends) versus scheduled days (IP, O/S). Participants also completed the PROMIS Pediatric Anxiety and Depressive Symptoms Short Form. Data were analyzed with hierarchical linear regressions controlling for average SlpOpp, gender, and school-level (middle vs high school). Results Mean reported symptoms of anxiety (60.0 ±9.1; 14%≧70) and depression (63.4 ±10.2; 22%≧70) fell in the at-risk range. Shorter average SlpOpp (mean=8.3±1.2hrs) was correlated with higher anxiety (r=-.10) and depression (r=-.11; p’s<.001) T-scores. Greater SlpOpp variability was associated with higher anxiety (B=.71 [95%CI=.41-1.01, p<.001) and depression (B=.67 [.33-1.00], p<.001) T-scores. Greater SJL (mean=1.8±1.2hrs; 94% showed a delay in midpoint) was associated with higher anxiety (B=.36 [.12-.60], p<.001) and depression (B=.77 [.50-1.03], p<.001) T-scores. Conclusion In the context of system-wide education changes during COVID-19, students on average reported at-risk levels of anxiety and depression symptoms which were associated with greater variability in sleep opportunity across school days and greater social jetlag. Our findings suggest educators and policymakers should consider these sleep-mental health associations when developing instructional formats and school schedules during and post-pandemic. Support (if any) T32MH019927(P.W.)
40
Dondo Gazzano, Julio, Fernando Rincon, Carlos Vaderrama, Felix Villanueva, Julian Caba, and Juan Carlos Lopez. "Facilitating Preemptive Hardware System Design Using Partial Reconfiguration Techniques." Scientific World Journal 2014 (2014): 1–15. http://dx.doi.org/10.1155/2014/164059.
Full textAbstract:
In FPGA-based control system design, partial reconfiguration is especially well suited to implement preemptive systems. In real-time systems, the deadline for critical task can compel the preemption of noncritical one. Besides, an asynchronous event can demand immediate attention and, then, force launching a reconfiguration process for high-priority task implementation. If the asynchronous event is previously scheduled, an explicit activation of the reconfiguration process is performed. If the event cannot be previously programmed, such as in dynamically scheduled systems, an implicit activation to the reconfiguration process is demanded. This paper provides a hardware-based approach to explicit and implicit activation of the partial reconfiguration process in dynamically reconfigurable SoCs and includes all the necessary tasks to cope with this issue. Furthermore, the reconfiguration service introduced in this work allows remote invocation of the reconfiguration process and then the remote integration of off-chip components. A model that offers component location transparency is also presented to enhance and facilitate system integration.
41
Xie, Xiao-Feng, Stephen Smith, and Gregory Barlow. "Schedule-Driven Coordination for Real-Time Traffic Network Control." Proceedings of the International Conference on Automated Planning and Scheduling 22 (May 14, 2012): 323–31. http://dx.doi.org/10.1609/icaps.v22i1.13510.
Full textAbstract:
Real-time optimization of the dynamic flow of vehicle traffic through a network of signalized intersections is an important practical problem. In this paper, we take a decentralized, schedule-driven coordination approach to address the challenge of achieving scalable network-wide optimization. To be locally effective, each intersection is controlled independently by an on-line scheduling agent. At each decision point, an agent constructs a schedule that optimizes movement of the observable traffic through the intersection, and uses this schedule to determine the best control action to take over the current look-ahead horizon. Decentralized coordination mechanisms, limited to interaction among direct neighbors to ensure scalability, are then layered on top of these asynchronously operating scheduling agents to promote overall performance. As a basic protocol, each agent queries for newly planned output flows from its upstream neighbors to obtain an optimistic projection of future demand. This projection may incorporate non-local influence from indirect neighbors depending on horizon length. Two additional mechanisms are then introduced to dampen ``nervousness'' and dynamic instability in the network, by adjusting locally determined schedules to better align with those of neighbors. We present simulation results on two traffic networks of tightly-coupled intersections that demonstrate the ability of our approach to establish traffic flows with lower average vehicle wait times than both a simple isolated control strategy and other contemporary coordinated control strategies that use moving average forecast or traditional offset calculation.
42
Lim, Jun Bum, Beakcheol Jang, and Mihail L. Sichitiu. "MCAS-MAC: A multichannel asynchronous scheduled MAC protocol for wireless sensor networks." Computer Communications 56 (February 2015): 98–107. http://dx.doi.org/10.1016/j.comcom.2014.10.008.
Full text
43
HANSSON, A. Å., H. S. MORTVEIT, and C. M. REIDYS. "ON ASYNCHRONOUS CELLULAR AUTOMATA." Advances in Complex Systems 08, no. 04 (December 2005): 521–38. http://dx.doi.org/10.1142/s0219525905000555.
Full textAbstract:
We study asynchronous cellular automata (ACA) induced by symmetric Boolean functions [1]. These systems can be considered as sequential dynamical systems (SDS) over words, a class of dynamical systems that consists of (a) a finite, labeled graph Y with vertex set {v1,…,vn} and where each vertex vi has a state xvi in a finite field K, (b) a sequence of functions (Fvi,Y)i, and (c) a word w = (w1,…,wk), where each wi is a vertex in Y. The function Fvi,Y updates the state of vertex vi as a function of the state of vi and its Y-neighbors and maps all other vertex states identically. The SDS is the composed map [Formula: see text]. In the particular case of ACA, the graph is the circle graph on n vertices (Y = Circ n), and all the maps Fvi are induced by a common Boolean function. Our main result is the identification of all w-independent ACA, that is, all ACA with periodic points that are independent of the word (update schedule) w. In general, for each w-independent SDS, there is a finite group whose structure contains information about for example SDS with specific phase space properties. We classify and enumerate the set of periodic points for all w-independent ACA, and we also compute their associated groups in the case of Y = Circ 4. Finally, we analyze invertible ACA and offer an interpretation of S35 as the group of an SDS over the three-dimensional cube with local functions induced by nor3 + nand3.
44
Daggitt, Matthew L., Ran Zmigrod, and Timothy G. Griffin. "A Relaxation of Üresin and Dubois’ Asynchronous Fixed-Point Theory in Agda." Journal of Automated Reasoning 64, no. 5 (December 10, 2019): 857–77. http://dx.doi.org/10.1007/s10817-019-09536-w.
Full textAbstract:
AbstractÜresin and Dubois’ paper “Parallel Asynchronous Algorithms for Discrete Data” shows how a class of synchronous iterative algorithms may be transformed into asynchronous iterative algorithms. They then prove that the correctness of the resulting asynchronous algorithm can be guaranteed by reasoning about the synchronous algorithm alone. These results have been used to prove the correctness of various distributed algorithms, including in the fields of routing, numerical analysis and peer-to-peer protocols. In this paper we demonstrate several ways in which the assumptions that underlie this theory may be relaxed. Amongst others, we (i) expand the set of schedules for which the asynchronous iterative algorithm is known to converge and (ii) weaken the conditions that users must prove to hold to guarantee convergence. Furthermore, we demonstrate that two of the auxiliary results in the original paper are incorrect, and explicitly construct a counter-example. Finally, we also relax the alternative convergence conditions proposed by Gurney based on ultrametrics. Many of these relaxations and errors were uncovered after formalising the work in the proof assistant Agda. This paper describes the Agda code and the library that has resulted from this work. It is hoped that the library will be of use to others wishing to formally verify the correctness of asynchronous iterative algorithms.
45
Saluky and Nurul Bahiyah. "Revolutionizing Education: Unlocking the Potential of Asynchronous Video for Interactive Online Learning." International Journal of Education and Humanities 3, no. 2 (July 4, 2023): 187–96. http://dx.doi.org/10.58557/(ijeh).v3i2.149.
Full textAbstract:
The traditional education landscape has witnessed a significant transformation in recent years due to advancements in technology and the growing demand for flexible learning options. Asynchronous video has emerged as a powerful tool in online education, offering learners the freedom to access course materials and engage with interactive content at their own pace and convenience. This paper explores the potential of asynchronous video in revolutionizing education by unlocking new possibilities for interactive online learning. The paper begins by discussing the limitations of traditional synchronous learning models and the need for innovative approaches that cater to the diverse learning styles and schedules of today's students. It then delves into the concept of asynchronous video, highlighting its key features and advantages. By enabling learners to access video lectures, tutorials, and demonstrations anytime and anywhere, the asynchronous video promotes self-paced learning and facilitates personalized educational experiences. Moreover, the paper examines how interactive elements can be seamlessly integrated into asynchronous video content. By incorporating quizzes, assessments, and interactive discussions within video platforms, educators can foster active engagement, promote critical thinking, and enhance knowledge retention. The potential of augmented reality (AR) and virtual reality (VR) technologies in creating immersive and interactive learning experiences through asynchronous video is also explored. Furthermore, the paper addresses the challenges and considerations associated with implementing asynchronous video in educational settings. It discusses issues related to video production, accessibility, and learner support, offering practical solutions and best practices to overcome these hurdles. The paper highlights successful case studies and initiatives that have effectively harnessed the potential of asynchronous video for interactive online learning. It presents evidence of improved learning outcomes, increased student engagement, and enhanced instructor-student interaction through the utilization of asynchronous video
46
Meltzer, Lisa, Kyla Wahlstrom, Judith Owens, Amy Wolfson, Sarah Honaker, Jared Saletin, Azizi Seixas, Patricia Wong, and Mary Carskadon. "675 COVID-19 Instruction Style (In-Person, Virtual, Hybrid), School Start Times, and Sleep in a Large Nationwide Sample of Adolescents." Sleep 44, Supplement_2 (May 1, 2021): A264. http://dx.doi.org/10.1093/sleep/zsab072.673.
Full textAbstract:
Abstract Introduction The COVID-19 pandemic significantly disrupted how and when adolescents attended school. This analysis used data from the Nationwide Education and Sleep in TEens During COVID (NESTED) study to examine the association of instructional format (in-person, virtual, hybrid), school start times, and sleep in a large diverse sample of adolescents from across the U.S. Methods In October/November 2020, 5346 nationally representative students (grades 6–12, 49.8% female, 30.6% non-White) completed online surveys. For each weekday, participants identified if they attended school in person (IP), online-scheduled synchronous classes (O/S), online-no scheduled classes (asynchronous, O/A), or no school. Students reported school start times for IP or O/S days, and bedtimes (BT) and wake times (WT) for each applicable school type and weekends/no school days (WE). Sleep opportunity (SlpOpp, total sleep time proxy) was calculated from BT and WT. Night-to-night sleep variability was calculated with mean square successive differences. Results Significant differences for teens’ sleep across instructional formats were found for all three sleep variables. With scheduled instructional formats (IP and O/S), students reported earlier BT (IP=10:54pm, O/S=11:24pm, O/A=11:36pm, WE=12:30am), earlier WT (IP=6:18am, O/S=7:36am, O/A=8:48am, WE=9:36am), and shorter SlpOpp (IP=7.4h, O/S=8.2h, O/A=9.2h, WE=9.2h). Small differences in BT, but large differences in WT were found, based on school start times, with significantly later wake times associated with later start times. Students also reported later WT on O/S days vs. IP days, even with the same start times. Overall, more students reported obtaining sufficient SlpOpp (>8h) for O/S vs. IP format (IP=40.0%, O/S=58.8%); when school started at/after 8:30am, sufficient SlpOpp was even more common (IP=52.7%, O/S=72.7%). Greater night-to-night variability was found for WT and SlpOpp for students with hybrid schedules with >1 day IP and >1 day online vs virtual schedules (O/S and O/A only), with no differences in BT variability reported between groups. Conclusion This large study of diverse adolescents from across the U.S. found scheduled school start times were associated with early wake times and shorter sleep opportunity, with greatest variability for hybrid instruction. Study results may be useful for educators and policy makers who are considering what education will look like post-pandemic. Support (if any):
47
Abdullabekov, Islombek A., Murakam M. Mirsaidov, Odiljon O. Zaripov, Samad J. Nimatov, and Yulduz M. Eralieva. "Reducing reactive energy consumption by optimizing operating modes of irrigation pumping stations." E3S Web of Conferences 486 (2024): 06017. http://dx.doi.org/10.1051/e3sconf/202448606017.
Full textAbstract:
The article develops energy and resource efficiency modes of the technological process that meet the requirements of the “frequency converter - asynchronous motor - pump - pressure pipeline” system as a control object. Methods for regulating water pressure and water flow produced by pumping units are considered in order to ensure a schedule for water supply to irrigation pumping stations. The active, reactive and total electrical energies received by an asynchronous motor to change water flow by changing the position of the pressure valve in the pressure pipeline are calculated. In order to optimize water flow and water pressure by changing the speed of rotation of the pump impeller, the frequency converter system of an asynchronous motor with a squirrel-cage rotor was calculated and compared with the method of changing water flow using a push valve, by calculating active, reactive and total electrical energy from the network.
48
Frenzel, Leslie, Sushil Paudyal, and Kathrin Dunlap. "Designing a High Enrollment Asynchronous Core Curriculum Science Course, General Animal Science for Declared Non-animal Science Majors." Journal of Animal Science 99, Supplement_2 (May 1, 2021): 44–45. http://dx.doi.org/10.1093/jas/skab096.082.
Full textAbstract:
Abstract General Animal Science is a core curriculum science class providing students with an overview of the livestock industry. This case study describes delivery of a high enrollment (n = 634) asynchronous core curriculum science class, General Animal Science, for non-animal science majors. The class progresses from basic agriculture nomenclature, to reproduction, nutrition, genetics, food safety, and concludes with growth and development of beef, sheep, horses, swine, dairy, poultry, and provides a brief description of the companion animal industry. Asynchronous design requires clear and repetitive communication, organized course content, and effective faculty and student engagement. Use of multiple platforms including a learning management system (Canvas), email, and video announcements is helpful for communication and a detailed schedule creates expectations for course progression, vital in an asynchronous course. While content was delivered primarily via lecture and supplementary materials, optional zoom sessions and virtual office hours generate additional engagement opportunities. Learning outcomes were assessed via weekly topic-focused formative student activities and quizzes vs conventional summative exams. Automated grading of assessments provided students with frequent, real-time feedback. In a post-course survey conducted among students enrolled in the Fall 2020 course (n = 634), 97.9% of respondents agreed that course participation was a valuable learning experience and the majority (50.5%) attributed it to lectures, 22% to assignments, 12.2% to group projects, 11.04% to supplementary materials, and 3.9% to optional office hours. Respondents indicated a mean score of 2.02 (SD 2.84) on a Likert scale (0–10) on likely to change their major to Animal Science. This was expected as Biomedical sciences, Agribusiness, Economics, Psychology, and Business were the most frequently declared majors. We concluded that structured schedule utilizing multiple methods of communication and formative assessments are valuable components of a large asynchronous core curriculum general animal science course, and that this course has potential to educate and engage non-animal science majors.
49
Chen, Binglin, Matthew West, and Craig Zilles. "Analyzing the decline of student scores over time in self‐scheduled asynchronous exams." Journal of Engineering Education 108, no. 4 (October 2019): 574–94. http://dx.doi.org/10.1002/jee.20292.
Full text
50
Asaduddin, Aiman Hilmi, and Utiya Nabila Maulani. "Beyond Synchronous and Asynchronous Systems towards Blended Learning: Perspective on Medical Education through COVID-19 Pandemic." Journal of Academia Perspectives 1, no. 2 (October 6, 2021): 110–16. http://dx.doi.org/10.30998/jap.v1i2.733.
Full textAbstract:
Coronavirus Disease 2019 (COVID-19) pandemic affected various aspects, such as the health sector, education, economy, etc., being distracted. This transition requires technology acceleration to maintain the e-learning process across the world, including medical education. E-learning systems, such as synchronous and asynchronous learning, have their own advantages and limitations, especially in medical education that needs theoretical and practical education. In this paper, a new model of mixed synchronous and asynchronous systems towards blended learning was described as an idea for better medical education through the COVID-19 pandemic. Learning systems can be divided into several types prior to previous researches, namely face-to-face learning, blended learning, flipped classroom, Information, and Communication Technology (ICT) supported face-to-face learning, synchronous learning, and asynchronous learning. COVID-19 pandemic forced the education system to full-online system learning, which is synchronous and asynchronous e-learning. In terms of theoretical learning, asynchronous systems may offer flexibility and convenience as well as the system can be used in conditions of time-zone difference, various internet connectivity, and different golden times for each student to learn factual information. However, asynchronous systems also may have a challenge in controlling the students to make sure they follow the class properly. To evaluate students’ progress, educational stakeholders can hold a weekly reflection program asynchronous distance learning. Besides, knowledge practice also can be conducted by focus group discussion (FGD) through synchronous distance learning The synchronous and asynchronous systems provide the students to arrange their schedule more flexible thus can be utilized to learn practical skills in face-to-face education, such as clinical skills and laboratory practices, with strict health protocols. This system will lead to blended learning, which is an online learning and shift-based traditional learning. This approach provides combination systems of asynchronous and synchronous distance learning to support blended learning in terms of lack of practice skills and laboratory competencies.