An atypical case of trigeminal trophic syndrome: a legal medicine perspective in medical responsibility

BACKGROUND: Trigeminal trophic syndrome is a rare complication of peripheral or central damage to the trigeminal nerve characterized by anesthesia, paresthesia and a secondary persistent facial ulceration. METHODS: We describe the case of a 40-year-old woman with previous history of Le Fort I osteotomy for a class III malocclusion who developed trigeminal trophic syndrome. Atypically, the cutaneous symptoms appeared bilaterally and 8 years after surgery. RESULTS: Differential diagnosis was based on clinical history, tissue biopsy and serologic evaluation. Atypical findings could be linked to the surgical burdens of Le Fort I osteotomy, a procedure characterized by a bilateral incision on the maxillofacial bones with a reasonable probability of causing a bilateral injury of the peripheral branches of the trigeminal nerve. CONCLUSION: Although the long delay between trigeminal trophic syndrome onset and surgery and the absence of adequate medical evidence cannot confirm a link with previous surgery in this case, the increasing number of maxillofacial surgery cases suggests that this complication may be more frequent in the next decades, and thus, involved specialists should be aware of this condition as a possible complication of maxillofacial surgery procedures

A protocol for programmable smart cards

This paper presents an open protocol for interoperability across multi-vendor programmable smart cards. It allows exposition of on-card storage and cryptographic services to host applications in a unified, card-independent way. Its design, inspired by the standardization of on-card Java language and cryptographic API, has been kept as generic and modular as possible. The protocol security model has been designed with the aim of allowing multiple applications to use the services exposed by the same card, with either a cooperative or a no-interference approach, depending on application requirements. With respect to existing protocols for smart card interoperability, defining sophisticated card services intended to be hard-coded into the device hardware, this protocol is intended to be implemented in software on programmable smart cards

Minimizing stack and communication memory usage in real-time embedded applications

In the development of real-time embedded applications, especially those on systems-on-chip, an efficient use of RAM memory is as important as the effective scheduling of the computation resources. The protection of communication and state variables accessed by concurrent tasks must provide real-time schedulability guarantees while using the least amount of memory. Several schemes, including preemption thresholds, have been developed to improve schedulability and save stack space by selectively disabling preemption. However, the design synthesis problem is still open. In this article, we target the assignment of the scheduling parameters to minimize memory usage for systems of practical interest, including designs compliant with automotive standards. We propose algorithms either proven optimal or shown to improve on randomized optimization methods like simulated annealing.</jats:p

Beyond the Weakly Hard Model: Measuring the Performance Cost of Deadline Misses (Artifact)

This document provides a brief description of the artifact material related to the paper "Beyond the Weakly Hard Model: Measuring the Performance Cost of Deadline Misses". The code provided in the artifact implements the algorithms presented in the paper and all the experimental tests

Verifying Data Secure Flow in AUTOSAR Models by Static Analysis

This paper presents a method to check data secure flow in security annotated AUTOSAR models. The approach is based on information flow analysis and abstract interpretation. The analysis computes the lowest security level of data sent on a communication, according to the annotations in the model and the code of runnables. An abstract interpreter executes runnables on abstract domains that abstract from real values and consider only data dependency levels. Data secure flow is verified if data sent on a communication always satisfy the security annotation in the model. The work has been developed in the EU project Safure, where modeling extensions to AUTOSAR have been proposed to improve security in automotive communications

Verifying data secure flow in AUTOSAR models

This paper presents an approach for enhancing the design phase of AUTOSAR models when security annotations are required. The approach is based on information flow analysis and abstract interpretation. The analysis evaluates the correctness of the model by assessing if the flow of data is secure with respect to causal data dependencies within the model. To find these dependencies an exhaustive search through the model would be required. Abstract interpretation is used as a trade-off between the precision and complexity of the analysis. The approach also provides annotated models without oversizing the set of annotations

Beyond the Weakly Hard Model: Measuring the Performance Cost of Deadline Misses

Most works in schedulability analysis theory are based on the assumption that constraints on the performance of the application can be expressed by a very limited set of timing constraints (often simply hard deadlines) on a task model. This model is insufficient to represent a large number of systems in which deadlines can be missed, or in which late task responses affect the performance, but not the correctness of the application. For systems with a possible temporary overload, models like the m-K deadline have been proposed in the past. However, the m-K model has several limitations since it does not consider the state of the system and is largely unaware of the way in which the performance is affected by deadline misses (except for critical failures). In this paper, we present a state-based representation of the evolution of a system with respect to each deadline hit or miss event. Our representation is much more general (while hopefully concise enough) to represent the evolution in time of the performance of time-sensitive systems with possible time overloads. We provide the theoretical foundations for our model and also show an application to a simple system to give examples of the state representations and their use