An Error-Localization, Validation and Optimization Tool for Embedded Code Augmentation: an Architecture Oriented Approach

Embedded systems are usually designed for a single or a specified set of tasks. This specificity means the system design as well as its hardware/software development can be highly optimized. Embedded software must meet the requirements such as high reliability operation on resource-constrained platforms, real time constraints and rapid development. This necessitates the adoption of static machine codes analysis tools running on a host machine for the validation and optimization of embedded system codes, which can help meet all of these goals. This could significantly augment the software quality and is still a challenging field.Embedded systems are usually designed for a single or a specified set of tasks. This specificity means the system design as well as its hardware/software development can be highly optimized. Embedded software must meet the requirements such as high reliability operation on resource-constrained platforms, real time constraints and rapid development. This necessitates the adoption of static machine codes analysis tools running on a host machine for the validation and optimization of embedded system codes, which can help meet all of these goals. This could significantly augment the software quality and is still a challenging field.Embedded systems are usually designed for a single or a specified set of tasks. This specificity means the system design as well as its hardware/software development can be highly optimized. Embedded software must meet the requirements such as high reliability operation on resource-constrained platforms, real time constraints and rapid development. This necessitates the adoption of static machine codes analysis tools running on a host machine for the validation and optimization of embedded system codes, which can help meet all of these goals. This could significantly augment the software quality and is still a challenging field.Embedded systems are usually designed for a single or a specified set of tasks. This specificity means the system design as well as its hardware/software development can be highly optimized. Embedded software must meet the requirements such as high reliability operation on resource-constrained platforms, real time constraints and rapid development. This necessitates the adoption of static machine codes analysis tools running on a host machine for the validation and optimization of embedded system codes, which can help meet all of these goals. This could significantly augment the software quality and is still a challenging field.This dissertation contributes to an architecture oriented code validation, error localization and optimization technique assisting the embedded system designer in software debugging, to make it more effective at early detection of software bugs that are otherwise hard to detect, using the static analysis of machine codes. The focus of this work is to develop methods that automatically localize faults as well as optimize the code and thus improve the debugging process as well as quality of the code.Validation is done with the help of rules of inferences formulated for the target processor. The rules govern the occurrence of illegitimate/out of place instructions and code sequences for executing the computational and integrated peripheral functions. The stipulated rules are encoded in propositional logic formulae and their compliance is tested individually in all possible execution paths of the application programs. An incorrect sequence of machine code pattern is identified using slicing techniques on the control flow graph generated from the machine code.An algorithm to assist the compiler to eliminate the redundant bank switching codes and decide on optimum data allocation to banked memory resulting in minimum number of bank switching codes in embedded system software is proposed. A relation matrix and a state transition diagram formed for the active memory bank state transition corresponding to each bank selection instruction is used for the detection of redundant codes. Instances of code redundancy based on the stipulated rules for the target processor are identified.This validation and optimization tool can be integrated to the system development environment. It is a novel approach independent of compiler/assembler, applicable to a wide range of processors once appropriate rules are formulated. Program states are identified mainly with machine code pattern, which drastically reduces the state space creation contributing to an improved state-of-the-art model checking. Though the technique described is general, the implementation is architecture oriented, and hence the feasibility study is conducted on PIC16F87X microcontrollers. The proposed tool will be very useful in steering novices towards correct use of difficult microcontroller features in developing embedded systems.

Analysis of the alveolar recruitment maneuvers applied at seven intensive care units

Introduction: During the past years, alveolar recruitment maneuvers (RM) have produced growing interest due to their beneficial potential in pulmonary protection, and have been introduced in clinical practice. Objective: To describe and analyze the knowledge of MR and its application at seven intensive care units in the city of Cali, Colombia. Methods and materials: Descriptive Cross-Sectional Study with an intentional sample of 64 professionals working in seven intensive care units and who apply MR. The self-completed survey was made up of thirteen questions, and the application period was two months. Results: Out of 64 professionals surveyed, 77.8% of them follow a protocol guide; 54.7% employes during RM the ideal Positive end-expiratory pressure (PEEP), which maintains a saturation > 90% and a PaO2 > 60 mmHg; 42.1% tolerates airway pressures between 35 and 50 cmH2O; 48.4% perform RM with a progressive increase of the PEEP and a low tidal volume. Conclusions: Regarding the knowledge related to RM, heterogeneity was found in the answers. There is currently no consensus about which is the most effective and secure way to implement an MR. This study can be the starting point to create awareness towards the revision of knowledge, capacities and abilities that are required to perform RM.

Vertex splitting and connectivity augmentation in hypergraphs

We consider problems of splitting and connectivity augmentation in hypergraphs. In a hypergraph G = (V +s, E), to split two edges su, sv, is to replace them with a single edge uv. We are interested in doing this in such a way as to preserve a defined level of connectivity in V . The splitting technique is often used as a way of adding new edges into a graph or hypergraph, so as to augment the connectivity to some prescribed level. We begin by providing a short history of work done in this area. Then several preliminary results are given in a general form so that they may be used to tackle several problems. We then analyse the hypergraphs G = (V + s, E) for which there is no split preserving the local-edge-connectivity present in V. We provide two structural theorems, one of which implies a slight extension to Mader’s classical splitting theorem. We also provide a characterisation of the hypergraphs for which there is no such “good” split and a splitting result concerned with a specialisation of the local-connectivity function. We then use our splitting results to provide an upper bound on the smallest number of size-two edges we must add to any given hypergraph to ensure that in the resulting hypergraph we have λ(x, y) ≥ r(x, y) for all x, y in V, where r is an integer valued, symmetric requirement function on V*V. This is the so called “local-edge-connectivity augmentation problem” for hypergraphs. We also provide an extension to a Theorem of Szigeti, about augmenting to satisfy a requirement r, but using hyperedges. Next, in a result born of collaborative work with Zoltán Király from Budapest, we show that the local-connectivity augmentation problem is NP-complete for hypergraphs. Lastly we concern ourselves with an augmentation problem that includes a locational constraint. The premise is that we are given a hypergraph H = (V,E) with a bipartition P = {P1, P2} of V and asked to augment it with size-two edges, so that the result is k-edge-connected, and has no new edge contained in some P(i). We consider the splitting technique and describe the obstacles that prevent us forming “good” splits. From this we deduce results about which hypergraphs have a complete Pk-split. This leads to a minimax result on the optimal number of edges required and a polynomial algorithm to provide an optimal augmentation.

Asymptotic gravity wave drag expressions for non-hydrostatic rotating flow over a ridge

Asymptotic expressions are derived for the mountain wave drag in flow with constant wind and static stability over a ridge when both rotation and non-hydrostatic effects are important. These expressions, which are much more manageable than the corresponding exact drag expressions (when these do exist) are found to provide accurate approximations to the drag, even when non-hydrostatic and rotation effects are strong, despite having been developed for cases where these effects are weak. The derived expressions are compared with approximations to the drag found previously, and their asymptotic behaviour in various limits is studied.

Linear criteria for gravity-wave breaking in resonant stratified flow over a ridge

Using linear theory, it is shown that, in resonant flow over a 2D mountain ridge, such as exists when a layer of uniform wind is topped by an environmental critical level, the conditions for internal gravity-wave breaking are different from those determined in previous studies for non-resonant flows. For Richardson numbers in the shear layer not exceeding 2.25, two zones of flow overturning exist, respectively below and downstream and above and upstream of the expected locations. Flow overturning occurs for values of the dimensionless height of the ridge smaller than those required for a uniform wind profile. These results may have implications for the physical understanding of high-drag states.

The effect of wind shear and curvature on the gravity wave drag produced by a ridge

The analytical model proposed by Teixeira, Miranda, and Valente is modified to calculate the gravity wave drag exerted by a stratified flow over a 2D mountain ridge. The drag is found to be more strongly affected by the vertical variation of the background velocity than for an axisymmetric mountain. In the hydrostatic approximation, the corrections to the drag due to this effect do not depend on the detailed shape of the ridge as long as this is exactly 2D. Besides the drag, all the perturbed quantities of the flow at the surface, including the pressure, may be calculated analytically.

On the development of strong ridge episodes over the eastern North Atlantic

The occurrence of strong and persistent mid-latitude anticyclonic ridges over the Eastern North Atlantic is a major contributor to the occurrence of severe winter droughts over Western Iberia. We analyze the development of strong and persistent ridge episodes within 40–50°N; 40°W–5°E, which are defined as 300 hPa geopotential height anomalies above 50 gpm that persist for at least 10 consecutive days. Results suggest that the generation and maintenance of these episodes, with positive stratospheric geopotential anomalies over the North American continent and the adjacent North Pacific, are associated with an intensified polar jet. Such positive anomalies tend to detach from the main stratospheric anomaly and propagate eastwards and downwards as Rossby tropospheric waves. Furthermore, the Eastern North Atlantic ridge is generated and repeatedly reinforced until the stratospheric anomaly dissipates. Results also show evidence for waves breaking anticyclonically during the episodes, which is dynamically coherent with their persistency and quasi-stationarity.

Methods of sensory augmentation through electro-tactile stimulation of the tongue

This paper details an investigation into sensory substitution by means of direct electrical stimulation of the tongue for the purpose of information input to the human brain. In particular, a device has been constructed and a series of trials have been performed in order to demonstrate the efficacy and performance of an electro-tactile array mounted onto the tongue surface for the purpose of sensory augmentation. Tests have shown that by using a low resolution array a computer-human feedback loop can be successfully implemented by humans in order to complete tasks such as object tracking, surface shape identification and shape recognition with no training or prior experience with the device. Comparisons of this technique have been made with visual alternatives and these show that the tongue based tactile array can match such methods in convenience and accuracy in performing simple tasks.

TESSA - Toolkit for experimentation with multimodal sensory substitution and augmentation

TESSA is a toolkit for experimenting with sensory augmentation. It includes hardware and software to facilitate rapid prototyping of interfaces that can enhance one sense using information gathered from another sense. The toolkit contains a range of sensors (e.g. ultrasonics, temperature sensors) and actuators (e.g. tactors or stereo sound), designed modularly so that inputs and outputs can be easily swapped in and out and customized using TESSA’s graphical user interface (GUI), with “real time” feedback. The system runs on a Raspberry Pi with a built-in touchscreen, providing a compact and portable form that is amenable for field trials. At CHI Interactivity, the audience will have the opportunity to experience sensory augmentation effects using this system, and design their own sensory augmentation interfaces.