Story Problem Solver: A Schema-Based System of Instruction

1989 ◽  
Author(s):  
Sandra P. Marshall ◽  
Kathryn E. Barthuli ◽  
Margaret A. Brewer ◽  
Frederic E. Rose
Keyword(s):  
Problem Solver ◽  
Story Problem

A Generic Model of Clinical Practice

2003 ◽  
Vol 42 (03) ◽  
pp. 203-211 ◽  
Author(s):  
J. L. G. Dietz ◽  
A. Hasman ◽  
P. F. de Vries Robbé ◽  
H. J. Tange
Keyword(s):  
Clinical Practice ◽  
Theoretical Model ◽  
Action Theory ◽  
Human Subjects ◽  
Shared Care ◽  
Patient Record ◽  
Generic Model ◽  
Problem Solver ◽  
Record Keeping ◽  
Process View

Summary Objectives: Many shared-care projects feel the need for electronic patient-record (EPR) systems. In absence of practical experiences from paper record keeping, a theoretical model is the only reference for the design of these systems. In this article, we review existing models of individual clinical practice and integrate their useful elements. We then present a generic model of clinical practice that is applicable to both individual and collaborative clinical practice. Methods: We followed the principles of the conversation-for-action theory and the DEMO method. According to these principles, information can only be generated by a conversation between two actors. An actor is a role that can be played by one or more human subjects, so the model does not distinguish between inter-individual and intra-individual conversations. Results: Clinical practice has been divided into four actors: service provider, problem solver, coordinator, and worker. Each actor represents a level of clinical responsibility. Any information in the patient record is the result of a conversation between two of these actors. Connecting different conversations to one another can create a process view with meta-information about the rationale of clinical practice. Such process view can be implemented as an extension to the EPR. Conclusions: The model has the potential to cover all professional activities, but needs to be further validated. The model can serve as a theoretical basis for the design of EPR-systems for shared care, but a successful EPR-system needs more than just a theoretical model.

scholarly journals Can DWI-MRI be an alternative to DCE-MRI in the diagnosis of troublesome breast lesions?

2021 ◽  
Vol 52 (1) ◽  
Author(s):  
Lamiaa Mohamed Bassam Hashem ◽  
Sherihan W. Y. Gareer ◽  
Aya Mohamed Bassam Hashem ◽  
Sherihan Fakhry ◽  
Yasmin Mounir Tohamey
Keyword(s):  
Problem Solver ◽  
Breast Lesions ◽  
Diffusion Weighted Mri ◽  
Resonance Imaging ◽  
Contrast Administration ◽  
Dce Mri ◽  
Water Diffusivity ◽  
Contrast Enhanced ◽  
Mri Study ◽  
Established Technique

Abstract Background Dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) has always been a problem solver in troublesome breast lesions. Despite its many advantages, the encountered low specificity results in unnecessary biopsies. Diffusion-weighted MRI (DW-MRI) is a well-established technique that helps in characterizing breast lesions according to their water diffusivity. So this work aimed to assess the diagnostic performance of DW-MRI in troublesome breast lesions and see if it can replace DCE-MRI study. Results In our prospective study, we included 86 patients with mammography and/or ultrasound-detected 90 probably benign or probably malignant (BIRADS 3 or 4) breast lesions. Among the studied cases, 49/90 lesions were benign, and 41/90 were malignant. Combined analysis of morphological and kinetic findings in DCE-MRI had achieved the highest sensitivity of 95.1%. DW-MRI alone was less sensitive (73.2%) yet more specific (83.7%) than DCE-MRI (77.6%). Diagnostic accuracy of DCE-MRI was higher (85.6%) as compared to DW-MRI which was (78.9%). Conclusion DCE-MRI is the cornerstone in the workup of troublesome breast lesions. DW-MRI should not be used as supplementary tool unless contrast administration is contraindicated. Combining both DCE-MRI and DW-MRI is the ultimate technique for better lesion evaluation.

A prolog simulation for a Delphi-based problem solver

1988 ◽  
Vol 19 (4) ◽  
pp. 36-43 ◽  
Author(s):  
Adel S. Elmaghraby
Keyword(s):  
Problem Solver

scholarly journals Flow towards a Stagnation Region of a Vertical Plate in a Hybrid Nanofluid: Assisting and Opposing Flows

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 448
Author(s):  
Iskandar Waini ◽  
Anuar Ishak ◽  
Ioan Pop
Keyword(s):  
Radiation Effects ◽  
Vertical Plate ◽  
Similarity Transformation ◽  
Fluid Motion ◽  
Hybrid Nanoparticles ◽  
Problem Solver ◽  
Hybrid Nanofluid ◽  
Al2o3 Nanoparticles ◽  
Nanofluid Flow ◽  
Stagnation Region

This study investigates a hybrid nanofluid flow towards a stagnation region of a vertical plate with radiation effects. The hybrid nanofluid consists of copper (Cu) and alumina (Al2O3) nanoparticles which are added into water to form Cu-Al2O3/water nanofluid. The stagnation point flow describes the fluid motion in the stagnation region of a solid surface. In this study, both buoyancy assisting and opposing flows are considered. The similarity equations are obtained using a similarity transformation and numerical results are obtained via the boundary value problem solver (bvp4c) in MATLAB software. Findings discovered that dual solutions exist for both opposing and assisting flows. The heat transfer rate is intensified with the thermal radiation (49.63%) and the hybrid nanoparticles (32.37%).

TABU PROGRAMMING: A NEW PROBLEM SOLVER THROUGH ADAPTIVE MEMORY PROGRAMMING OVER TREE DATA STRUCTURES

2011 ◽  
Vol 10 (02) ◽  
pp. 373-406 ◽  
Author(s):  
ABDEL-RAHMAN HEDAR ◽  
EMAD MABROUK ◽  
MASAO FUKUSHIMA
Keyword(s):  
Search Algorithm ◽  
Benchmark Problems ◽  
Problem Solver ◽  
Learning Tools ◽  
Mutation Operators ◽  
Tree Data ◽  
Tree Data Structure ◽  
Comprehensive Framework ◽  
Rate Of Success ◽  
Crossover And Mutation

Since the first appearance of the Genetic Programming (GP) algorithm, extensive theoretical and application studies on it have been conducted. Nowadays, the GP algorithm is considered one of the most important tools in Artificial Intelligence (AI). Nevertheless, several questions have been raised about the complexity of the GP algorithm and the disruption effect of the crossover and mutation operators. In this paper, the Tabu Programming (TP) algorithm is proposed to employ the search strategy of the classical Tabu Search algorithm with the tree data structure. Moreover, the TP algorithm exploits a set of local search procedures over a tree space in order to mitigate the drawbacks of the crossover and mutation operators. Extensive numerical experiments are performed to study the performance of the proposed algorithm for a set of benchmark problems. The results of those experiments show that the TP algorithm compares favorably to recent versions of the GP algorithm in terms of computational efforts and the rate of success. Finally, we present a comprehensive framework called Meta-Heuristics Programming (MHP) as general machine learning tools.

Sign in / Sign up

Export Citation Format

Share Document