2 resultados para Interpreting graphs
em Instituto Politécnico do Porto, Portugal
Resumo:
The paper discusses mental imagery as an important part of information processing performed during interpreting. Mental imagery is examined to see if visual processing used to remember the source text or to facilitate its understanding helps to ‗off-load‘ other cognitive (mainly linguistic) resources in interpreting. The discussion is based on a neurocognitively-oriented depictivist model by Kosslyn (1994). The overview of mental imagery processes and systems is followed by the discussion of imagery used in interpreting. First, imagery development in student interpreters is described on the basis of a note-taking course for would-be consecutive interpreters organized by the author at AMU. The initial part of the course devoted to imagery involves visualizations of geographical, descriptive and narrative texts. The description abounds in authentic examples and presents conclusions for interpreting trainers. Later, imagery as employed by professional interpreters is discussed on the basis of a qualitative survey. General implications of the use of mental imagery for cognitive processing limitations in interpreting are presented in the concluding section.
Resumo:
The problem addressed here originates in the industry of flat glass cutting and wood panel sawing, where smaller items are cut from larger items accordingly to predefined cutting patterns. In this type of industry the smaller pieces that are cut from the patterns are piled around the machine in stacks according to the size of the pieces, which are moved to the warehouse only when all items of the same size have been cut. If the cutting machine can process only one pattern at a time, and the workspace is limited, it is desirable to set the sequence in which the cutting patterns are processed in a way to minimize the maximum number of open stacks around the machine. This problem is known in literature as the minimization of open stacks (MOSP). To find the best sequence of the cutting patterns, we propose an integer programming model, based on interval graphs, that searches for an appropriate edge completion of the given graph of the problem, while defining a suitable coloring of its vertices.