Study of Houses Model of Translation Quality Assessment on the Short Story and Its Translated Text

House model on comparative ST-TT analysis is leading to the assessment of the quality of the translation highlighting mismatches or errors This analysis is through lexical syntactic and textual means Her analysis also refers to what information is being conveyed and what the relationship is between sender and receiver On the process of comparison ST to TT errors are produced and categorized according to genre and to the situational dimensions of register and genre These dimensional errors are referred to as covertly erroneous errors Also there are overtly erroneous errors which are denotative mismatches or target system errors Then the translation can be categorized into one of two types over translation or covert translation Through the analysis of the translation and the source text it is possible to determine whether the text is translated covertly or overtly and the translator made the write decision in choosing the type of translation in his rendering This paper tends to apply her model on a short story named the Grapes of Wrath by John Stein Beck It is translated by Mohammad Sadegh Shariati This paper applies House s model on this short story to find out whether the translated works is translated covertly or overtl

Visual servoing of an autonomous helicopter in urban areas using feature tracking

We present the design and implementation of a vision-based feature tracking system for an autonomous helicopter. Visual sensing is used for estimating the position and velocity of features in the image plane (urban features like windows) in order to generate velocity references for the flight control. These visual-based references are then combined with GPS-positioning references to navigate towards these features and then track them. We present results from experimental flight trials, performed in two UAV systems and under different conditions that show the feasibility and robustness of our approach

On the Decidability of Reachability in Linear Time-Invariant Systems

We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by boolean combinations of linear inequalities. Decidability of the version of the reachability problem in which control sets are affine subspaces of $\mathbb{R}^n$ is a fundamental result in control theory. Our first result is that reachability is undecidable if the set of controls is a finite union of affine subspaces. We also consider versions of the reachability problem in which (i)~the set of controls consists of a single affine subspace together with the origin and (ii)~the set of controls is a convex polytope. In these two cases we respectively show that the reachability problem is as hard as Skolem's Problem and the Positivity Problem for linear recurrence sequences (whose decidability has been open for several decades). Our main contribution is to show decidability of a version of the reachability problem in which control sets are convex polytopes, under certain spectral assumptions on the transition matrix

Constructive Hybrid Games

Hybrid games are models which combine discrete, continuous, and adversarial dynamics. Game logic enables proving (classical) existence of winning strategies. We introduce constructive differential game logic (CdGL) for hybrid games, where proofs that a player can win the game correspond to computable winning strategies. This is the logical foundation for synthesis of correct control and monitoring code for safety-critical cyber-physical systems. Our contributions include novel static and dynamic semantics as well as soundness and consistency.Comment: 60 pages, preprint, under revie