scholarly journals Dynamic programming for re-mapping noisy fixations in translation tasks

2013 ◽  
Vol 6 (2) ◽  
Author(s):  
Michael Carl

Eyetrackers which allow for free head movements are in many cases imprecise to the extent that reading patterns become heavily distorted. The poor usability and interpretability of these gaze patterns is corroborated by a "naïve" fixation-to-symbol mapping, which often wrongly maps the possibly drifted center of the observed fixation onto the symbol directly below it. In this paper I extend this naïve fixation-to-symbol mapping by introducing background knowledge about the translation task. In a first step, the sequence of fixation-to-symbol mappings is extended into a lattice of several possible fixated symbols, including those on the line above and below the naïve fixation mapping. In a second step a dynamic programming algorithm applies a number of heuristics to find the best path through the lattice, based on the probable distance in characters, in words and in pixels between successive fixations and the symbol locations, so as to smooth the gazing path according to the background gazing model. A qualitative and quantitative evaluation shows that the algorithm increases the accuracy of the re-mapped symbol sequence.

Author(s):  
A. Meghdari ◽  
H. Sayyaadi

Abstract An optimization technique based on the well known Dynamic Programming Algorithm is applied to the motion control trajectories and path planning of multi-jointed fingers in dextrous hand designs. A three fingered hand with each finger containing four degrees of freedom is considered for analysis. After generating the kinematics and dynamics equations of such a hand, optimum values of the joints torques and velocities are computed such that the finger-tips of the hand are moved through their prescribed trajectories with the least time or/and energy to reach the object being grasped. Finally, optimal as well as feasible solutions for the multi-jointed fingers are identified and the results are presented.


Author(s):  
Jiashen Li ◽  
◽  
Yun Pan ◽  

The improvement of chip integration leads to the increase of power density of system chips, which leads to the overheating of system chips. When dispatching the power density of system chips, some working modules are selectively closed to avoid all modules on the chip being turned on at the same time and to solve the problem of overheating. Taking 2D grid-on-chip network as the research object, an optimal scheduling algorithm of system-on-chip power density based on network-on-chip (NoC) is proposed. Under the constraints of thermal design power (TDP) and system, dynamic programming algorithm is used to solve the optimal application set throughput allocation from bottom to top by dynamic programming for the number and frequency level of each application configuration processor under the given application set of network-on-chip. On this basis, the simulated annealing algorithm is used to complete the application mapping aiming at heat dissipation effect and communication delay. The open and closed processor layout is determined. After obtaining the layout results, the TDP is adjusted. The maximum TDP constraint is iteratively searched according to the feedback loop of the system over-hot spots, and the power density scheduling performance of the system chip is maximized under this constraint, so as to ensure the system core. At the same time, chip throughput can effectively solve the problem of chip overheating. The experimental results show that the proposed algorithm increases the system chip throughput by about 11%, improves the system throughput loss, and achieves a balance between the system chip power consumption and scheduling time.


Sign in / Sign up

Export Citation Format

Share Document