Visual/Graphic Aids for the Technical Report

1979 ◽  
Vol 9 (3) ◽  
pp. 287-291 ◽  
Author(s):  
Robert Cury
Keyword(s):  
Flow Chart ◽  
White Space ◽  
Grid Graph ◽  
Grid Graphs ◽  
Process Maps ◽  
Technical Report ◽  
Technical Writer ◽  
Flow Charts ◽  
Visual Description ◽  
Visual Graphic

Authors of technical papers have many visual/graphic aids available to them. The most common are: grid graphs, tables, bar charts, flow charts, maps, pie diagrams, and drawings and sketches. Grid graphs are used to show relationships. Tables allow the reader to make comparisons of data. The bar chart is another form of the grid graph and is used for the same purpose. A flow chart gives the reader a visual description of a process. Maps show the location of specific features. Pie diagrams show the proportional breakdown of a topic. Pictures and sketches show the reader exactly what is being talked about in the report. Visual/graphic aids allow the technical writer to condense and present his information in an aesthetically pleasing manner; in addition, these aids serve as psychological white space.

New Directions in Teaching Technical Report Writing

1975 ◽  
Vol 5 (3) ◽  
pp. 199-205 ◽  
Author(s):  
Michael P. Jordan
Keyword(s):  
North America ◽  
Traditional Instruction ◽  
Technical Writing ◽  
Report Writing ◽  
English Grammar ◽  
Technical Report ◽  
New Directions ◽  
Technical Writer

The traditional instruction of technical report writing leans heavily on the conventions of English grammar and on principles advocated by grammarians, journalists, and literature scholars. The effect has been so strong—particularly in North America—that the word “technical” in technical writer, technical writing, and technical reports has literally become almost meaningless. This article discusses a few important differences between technical and nontechnical writing. It also explains some shortcomings of the traditional instruction and suggests methods of improvement.

scholarly journals Computing the Domination Number of Grid Graphs

10.37236/628 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Samu Alanko ◽  
Simon Crevals ◽  
Anton Isopoussu ◽  
Patric Östergård ◽  
Ville Pettersson
Keyword(s):  
Dynamic Programming ◽  
Dominating Set ◽  
Domination Number ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Dominating Sets ◽  
Grid Graph ◽  
Grid Graphs ◽  
Square Grid ◽  
Minimum Dominating Set

Let $\gamma_{m,n}$ denote the size of a minimum dominating set in the $m \times n$ grid graph. For the square grid graph, exact values for $\gamma_{n,n}$ have earlier been published for $n \leq 19$. By using a dynamic programming algorithm, the values of $\gamma_{m,n}$ for $m,n \leq 29$ are here obtained. Minimum dominating sets for square grid graphs up to size $29 \times 29$ are depicted.

scholarly journals Edge Even Graceful Labeling of Cylinder Grid Graph

Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 584 ◽  
Author(s):  
Ahmed A. Elsonbaty ◽  
Salama Nagy Daoud
Keyword(s):  
Undirected Graph ◽  
Grid Graph ◽  
Explicit Formulas ◽  
Graceful Labeling ◽  
Grid Graphs ◽  
The Family ◽  
Edge Labeling

Edge even graceful labeling (e.e.g., l.) of graphs is a modular technique of edge labeling of graphs, introduced in 2017. An e.e.g., l. of simple finite undirected graph G = ( V ( G ) , E ( G ) ) of order P = | ( V ( G ) | and size q = | E ( G ) | is a bijection f : E ( G ) → { 2 , 4 , … , 2 q } , such that when each vertex v ∈ V ( G ) is assigned the modular sum of the labels (images of f ) of the edges incident to v , the resulting vertex labels are distinct mod 2 r , where r = max ( p , q ) . In this work, the family of cylinder grid graphs are studied. Explicit formulas of e.e.g., l. for all of the cases of each member of this family have been proven.

An Algorithmic Approach to the Brain Biopsy—Part I

2006 ◽  
Vol 130 (11) ◽  
pp. 1630-1638
Author(s):  
B. K. Kleinschmidt-DeMasters ◽  
Richard A. Prayson
Keyword(s):  
Brain Biopsy ◽  
Thinking Skills ◽  
Flow Chart ◽  
Differential Diagnoses ◽  
Logical Thinking ◽  
Algorithmic Approach ◽  
Flow Diagrams ◽  
Flow Charts ◽  
The Brain ◽  
Difficult Cases

Abstract Context.—The formulation of appropriate differential diagnoses for a slide is essential to the practice of surgical pathology but can be particularly challenging for residents and fellows. Algorithmic flow charts can help the less experienced pathologist to systematically consider all possible choices and eliminate incorrect diagnoses. They can assist pathologists-in-training in developing orderly, sequential, and logical thinking skills when confronting difficult cases. Objective.—To present an algorithmic flow chart as an approach to formulating differential diagnoses for lesions seen in surgical neuropathology. Design.—An algorithmic flow chart to be used in teaching residents. Results.—Algorithms are not intended to be final diagnostic answers on any given case. Algorithms do not substitute for training received from experienced mentors nor do they substitute for comprehensive reading by trainees of reference textbooks. Algorithmic flow diagrams can, however, direct the viewer to the correct spot in reference texts for further in-depth reading once they hone down their diagnostic choices to a smaller number of entities. The best feature of algorithms is that they remind the user to consider all possibilities on each case, even if they can be quickly eliminated from further consideration. Conclusions.—In Part I, we assist the resident in learning how to handle brain biopsies in general and how to distinguish nonneoplastic lesions that mimic tumors from true neoplasms.

scholarly journals Bounds on the Size of the Minimum Dominating Sets of Some Cylindrical Grid Graphs

2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Mrinal Nandi ◽  
Subrata Parui ◽  
Avishek Adhikari
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Domination Number ◽  
Cartesian Product ◽  
Wireless Sensor ◽  
Dominating Sets ◽  
Grid Graph ◽  
Grid Graphs ◽  
Cylindrical Grid ◽  
Domination Numbers

Let γPm □ Cn denote the domination number of the cylindrical grid graph formed by the Cartesian product of the graphs Pm, the path of length m, m≥2, and the graph Cn, the cycle of length n, n≥3. In this paper we propose methods to find the domination numbers of graphs of the form Pm □ Cn with n≥3 and m=5 and propose tight bounds on domination numbers of the graphs P6 □ Cn, n≥3. Moreover, we provide rough bounds on domination numbers of the graphs Pm □ Cn, n≥3 and m≥7. We also point out how domination numbers and minimum dominating sets are useful for wireless sensor networks.

Continuous Flow Charts

SIMULATION ◽  
1970 ◽  
Vol 14 (6) ◽  
pp. 281-290
Author(s):  
Louis R. Gieszl ◽  
Frank C. Rieman
Keyword(s):  
Continuous Flow ◽  
Large Scale ◽  
Flow Chart ◽  
Machine Language ◽  
Language Program ◽  
Complex Program ◽  
Level Transition ◽  
Flow Charts ◽  
Game Simulation ◽  
Dynamic Documentation

The current concept of the flow chart for documenting a computer program seems to be more heavily influenced by its business data processing background than by its mathematically oriented inception. The result of this is a loss of definition which inhibits further developments in program documentation. This paper proceeds from an analysis of the structure of a program and how this structure is represented by a flow chart to derive an extension of this: continuous flow charts. A continuous flow chart, which may be constructed from a conventional flow chart by removing its points of (flow) discontinuity, is shown to be a form of docu mentation ideally suited for large-scale programs that by their nature involve complex logic (such as a war-game simulation). The motivation for continuous flow charting is the pos sibility of dynamic documentation arising from a set of such flow charts. That is, the requirements suggested in this paper for a flow chart to be called continuous pro vide an inductive definition for the members of a set of levels of documentation of a simulation (such that the ease of a user's level to level transition of understanding [the logic depicted] is maintained). Such a set would have, at its highest level, a flow chart picturing the overall logic of the entire simulation, and, at successively lower levels it would contain flow charts describing smaller portions of the program in greater detail. An actual machine-language program would constitute the lowest level of documentation in this set. Since the creation of such a set of continuous flow charts can be started from either the highest level or the lowest level, then this procedure should serve equally well for either developing a complex program from its most basic logical conception, or for documenting such a program as has already been written.

Original Flow Chart for the Management of Hydroureteronephrosis Caused by Pessary Placement

2017 ◽  
Vol 84 (4) ◽  
pp. 240-243 ◽  
Author(s):  
Matteo Balzarro ◽  
Emanuele Rubilotta ◽  
Antonio B. Porcaro ◽  
Nicolò Trabacchin ◽  
Antonio D'Amico ◽  
...  
Keyword(s):  
Urinary Tract ◽  
Urinary Tract Obstruction ◽  
Pelvic Organ ◽  
Flow Chart ◽  
Concomitant Increase ◽  
Abdominal Ultrasonography ◽  
Non Invasive ◽  
History Of ◽  
Underlying Causes ◽  
Flow Charts

Hydroureteronephrosis due to pessary is a dangerous complication that can become critical if urosepsis is present. We propose a flow chart to manage the condition. Introduction The use of a pessary to treat a pelvic organ prolapse (POP) is a valid non-invasive option. Severe complications are usually associated with neglected, oversized, or misplaced pessaries. Major complications include fistulas, bowel or bladder erosion, and hydroureteronephrosis (HUN). Materials and Methods We reviewed the literature and our experience in the management of HUN in the last decade, as a consequence of pessary placement. Results We used flow charts to take an accurate medical history of each patient. Blood and urine analyses were taken at admission to assess the potential presence of sepsis, renal failure, and urinary tract infection. Physical examination included vaginal examination. In cases of pessary presence with a concomitant increase of serum creatinine value, a possible ureteral obstruction is suspected. In order to assess the presence of HUN and its underlying causes, a computed tomography (CT) scan should be performed to assess the mechanism of urinary tract obstruction. However, in case of renal insufficiency, abdominal ultrasonography (US) could be sufficient. If HUN is detected in a patient with no signs of urosepsis, we suggest a conservative management by the removal of the pessary and catheter placement. When urosepsis is suspected, it is mandatory to administer antibiotic therapy and evaluate the HUN drainage by nephrostomy. Conclusions There is no uniform management of women with HUN and a concomitant pessary. For this reason, and based on the literature and our experience, we propose an original management flowchart.

On the Unwinding of Flow-Charts with Stacks

1982 ◽  
Vol 5 (1) ◽  
pp. 119-126
Author(s):  
Paweł Urzyczyn
Keyword(s):  
Flow Chart ◽  
Total Flow ◽  
Flow Charts

Let A be a structure with the property that every flow-chart with one stack /every recursive schema/, total over A, is strongly equivalent in A to a loop-free schema. We show that every total flow-chart with one stack can be unwound in A.

An Algorithmic Approach to the Brain Biopsy—Part II

2006 ◽  
Vol 130 (11) ◽  
pp. 1639-1648
Author(s):  
Richard A. Prayson ◽  
B. K. Kleinschmidt-DeMasters
Keyword(s):  
Correct Diagnosis ◽  
Granulomatous Inflammation ◽  
Brain Biopsy ◽  
Thinking Skills ◽  
Flow Chart ◽  
Differential Diagnoses ◽  
Algorithmic Approach ◽  
Flow Diagrams ◽  
Flow Charts ◽  
The Brain

Abstract Context.—The formulation of appropriate differential diagnoses for a slide is essential to the practice of surgical pathology but can be particularly challenging for residents and fellows. Algorithmic flow charts can help the less experienced pathologist to systematically consider all possible choices and eliminate incorrect diagnoses. They can assist pathologists-in-training in developing orderly, sequential, and logical thinking skills when confronting difficult cases. Objective.—To present an algorithmic flow chart as an approach to formulating differential diagnoses for lesions seen in surgical neuropathology. Design.—An algorithmic flow chart to be used in teaching residents. Results.—Algorithms are not intended to be final diagnostic answers on any given case. Algorithms do not substitute for training received from experienced mentors nor do they substitute for comprehensive reading by trainees of reference textbooks. Algorithmic flow diagrams can, however, direct the viewer to the correct spot in reference texts for further in-depth reading once they hone down their diagnostic choices to a smaller number of entities. The best feature of algorithms is that they remind the user to consider all possibilities on each case, even if they can be quickly eliminated from further consideration. Conclusions.—In Part II, we assist the resident in arriving at the correct diagnosis for neuropathologic lesions containing granulomatous inflammation, macrophages, or abnormal blood vessels.

The Student as Consultant

1979 ◽  
Vol 9 (4) ◽  
pp. 311-315
Author(s):  
Steven Zachary Rothmel
Keyword(s):  
Technical Writing ◽  
Learning Experience ◽  
Technical Information ◽  
Writing Teacher ◽  
Realistic Situation ◽  
Technical Report ◽  
Writing Course ◽  
Technical Writer ◽  
Oriented Approach

The technical writing course has the potential to be one of the most valuable and relevant classes that a student takes, but before his rhetorical skills can improve he must overcome his reluctance to write. The formal technical report, the most challenging and the most rewarding assignment, offers the technical writing teacher a unique opportunity to bring his course to life and to enrich each class member's learning experience. The author has developed an approach to the major report that allows the student to assume the role of a consultant in his field while simultaneously permitting him to feel independent and creative. The inexperienced technical writer must create a realistic situation in which someone would require the technical information he wishes to convey. Placing the student in the role of a consultant makes him more aware of his audience and its needs. This problem-oriented approach effectively increases the writer's liberty to choose an appropriate topic and his responsibility to present it in a coherent and professional manner.

Sign in / Sign up

Export Citation Format

Share Document