Combining Case Teaching and Case Writing Creatively

2017 ◽  
pp. 121-140
Author(s):  
Urs Müller ◽  
Martin Kupp
Keyword(s):  
Case Writing ◽  
Independent Tasks

In this chapter, the authors propose that not only do case teaching and case writing belong together, they can also support and inform each other in many ways. The authors highlight the fact that case teaching and case writing are not two separate and independent tasks, and therefore they should be combined continually in new and creative ways. Although it is obvious that it does not make a lot of sense to write cases without there being a teaching need, the authors argue that educators can start teaching the case even before writing it, and by doing so improve their writing. Many examples are given on how case teaching can be used for case writing, and vice versa.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

The Power of Giving Feedback: Outcomes from Implementing an Online Peer Assessment System

2014 ◽  
Vol 31 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Fred Phillips
Keyword(s):  
Peer Assessment ◽  
Individual Case ◽  
Assessment System ◽  
Financial Accounting ◽  
Writing Assignments ◽  
Quality Feedback ◽  
Course Work ◽  
Case Writing ◽  
Online Peer Assessment ◽  
Giving Feedback

ABSTRACTThis paper describes an online system that facilitates peer assessment of students' course work and then uses data from individual case writing assignments in introductory financial accounting to empirically examine associations between peer assessment and case writing performance. Through this description and empirical analysis, the paper addresses the following questions: (1) Why use peer assessment? (2) How does online peer assessment work? (3) Is student peer assessment reliable? (4) What do students think of peer assessment? (5) Does student peer assessment contribute to academic performance? Three key findings from this study are that students at the sophomore level were able to generate reasonably reliable feedback for peers, they valued the experiences involved in providing peer feedback, and giving quality feedback had a more significant and enduring impact on students' accounting case analyses than did receiving quality feedback, after controlling for differences in accounting knowledge and case writing skills.

scholarly journals In-Memory Interval Joins

2021 ◽  
Author(s):  
Panagiotis Bouros ◽  
Nikos Mamoulis ◽  
Dimitrios Tsitsigkos ◽  
Manolis Terrovitis
Keyword(s):  
Parallel Computation ◽  
State Of The Art ◽  
Complex Data ◽  
Plane Sweep ◽  
Join Algorithm ◽  
Sweep Algorithm ◽  
Join Algorithms ◽  
Domain Partitioning ◽  
Complex Data Structure ◽  
Independent Tasks

AbstractThe interval join is a popular operation in temporal, spatial, and uncertain databases. The majority of interval join algorithms assume that input data reside on disk and so, their focus is to minimize the I/O accesses. Recently, an in-memory approach based on plane sweep (PS) for modern hardware was proposed which greatly outperforms previous work. However, this approach relies on a complex data structure and its parallelization has not been adequately studied. In this article, we investigate in-memory interval joins in two directions. First, we explore the applicability of a largely ignored forward scan (FS)-based plane sweep algorithm, for single-threaded join evaluation. We propose four optimizations for FS that greatly reduce its cost, making it competitive or even faster than the state-of-the-art. Second, we study in depth the parallel computation of interval joins. We design a non-partitioning-based approach that determines independent tasks of the join algorithm to run in parallel. Then, we address the drawbacks of the previously proposed hash-based partitioning and suggest a domain-based partitioning approach that does not produce duplicate results. Within our approach, we propose a novel breakdown of the partition-joins into mini-joins to be scheduled in the available CPU threads and propose an adaptive domain partitioning, aiming at load balancing. We also investigate how the partitioning phase can benefit from modern parallel hardware. Our thorough experimental analysis demonstrates the advantage of our novel partitioning-based approach for parallel computation.

Introduction

2021 ◽  
pp. e513022021
Author(s):  
Jennifer J. Connor
Keyword(s):  
Newfoundland And Labrador ◽  
Humanitarian Aid ◽  
Medical Practitioners ◽  
Narrative Approaches ◽  
Theoretical Approaches ◽  
Introductory Article ◽  
Medical Reports ◽  
Geographically Distributed ◽  
Case Writing ◽  
Clinical Records

This article provides context for three studies about early 20th-century medical cases in the geographically distributed humanitarian aid organization founded by Wilfred Grenfell in pre-Confederation Newfoundland and Labrador. It situates these studies within historiographical and theoretical approaches to case histories and their publication by medical practitioners, the background for research on the clinical records of the Grenfell organization’s main hospital, and the history behind specific case information for coastal patients. While the cases examined cohere through their organizational origin, the authors of these three studies reveal sometimes unexpected representations of the patient in text and illustration. In these ways, both this introductory article and the following three studies emphasize the enduring appeal of narrative approaches to case writing while also pointing to the evolving ethics of publishing medical reports for general readers and scholars. Together they invite renewed attention to the representation of medical cases in publications that increasingly are available globally in internet collections.

scholarly journals InterRC: An Inter-Resources Collaboration Heuristic for Scheduling Independent Tasks on Heterogeneous Distributed Environments

MENDEL ◽  
2019 ◽  
Vol 25 (1) ◽  
pp. 179-188
Author(s):  
Abdelhamid Khiat ◽  
Abdelkamel Tari
Keyword(s):  
Task Scheduling ◽  
Initial Solution ◽  
Distributed Environments ◽  
Scheduling Problem ◽  
Reasonable Time ◽  
Independent Task ◽  
Np Hard Problem ◽  
Computing Environments ◽  
Scheduling Heuristic ◽  
Independent Tasks

The independent task scheduling problem in distributed computing environments with makespan optimization as an objective is an NP-Hard problem. Consequently, an important number of approaches looking to approximate the optimal makespan in reasonable time have been proposed in the literature. In this paper, a new independent task scheduling heuristic called InterRC is presented. The proposed InterRC solution is an evolutionary approach, which starts with an initial solution, then executes a set of iterations, for the purpose of improving the initial solution and close the optimal makespan as soon as possible. Experiments show that InterRC obtains a better makespan compared to the other efficient algorithms.

Sign in / Sign up

Export Citation Format

Share Document