Improving the schedulability of soft real-time open dynamic systems: The inheritor is actually a debtor

This paper presents the Clearing Fund Protocol, a three layered protocol designed to schedule soft real-time sets of precedence related tasks with shared resources. These sets are processed in an open dynamic environment. Open because new applications may enter the system at any time and dynamic because the schedulability is tested on-line as tasks request admission. Top-down, the three layers are the Clearing Fund, the Bandwidth Inheritance and two versions of the Constant Bandwidth Server algorithms. Bandwidth Inheritance applies a priority inheritance mechanism to the Constant Bandwidth Server. However, a serious drawback is its unfairness. In fact, a task executing in a server can potentially steal the bandwidth of another server without paying any penalty. The main idea of the Clearing Fund Algorithm is to keep track of processor-time debts contracted by lower priority tasks that block higher priority ones and are executed in the higher priority servers by having inherited the higher priority. The proposed algorithm reduces the undesirable effects of those priority inversions because the blocked task can finish its execution in its own server or in the server of the blocking task, whichever has the nearest deadline. If demanded, debts are paid back in that way. Inheritors are therefore debtors. Moreover, at certain instants in time, all existing debts may be waived and the servers are reset making a clear restart of the system. The Clearing Fund Protocol showed definite better performances when evaluated by simulations against Bandwidth Inheritance, the protocol it tries to improve.     

Boosting text segmentation via progressive classification

A novel approach for reconciling tuples stored as free text into an existing attribute schema is proposed. The basic idea is to subject the available text to progressive classification, i.e., a multi-stage classification scheme where, at each intermediate stage, a classifier is learnt that analyzes the textual fragments not reconciled at the end of the previous steps. Classification is accomplished by an ad hoc exploitation of traditional association mining algorithms, and is supported by a data transformation scheme which takes advantage of domain-specific dictionaries/ontologies. A key feature is the capability of progressively enriching the available ontology with the results of the previous stages of classification, thus significantly improving the overall classification accuracy. An extensive experimental evaluation shows the effectiveness of our approach.     

Real-Time Global Illumination for VR Applications

Real-time global illumination in VR systems enhances scene realism by incorporating soft shadows, reflections of objects in the scene, and color bleeding. The Virtual Light Field (VLF) method enables real-time global illumination rendering in VR. The VLF has been integrated with the Extreme VR system for real-time GPU-based rendering in a Cave Automatic Virtual Environment.     

Using visual and text features for direct marketing on multimedia messaging services domain

Traditionally, direct marketing companies have relied on pre-testing to select the best offers to send to their audience. Companies systematically dispatch the offers under consideration to a limited sample of potential buyers, rank them with respect to their performance and, based on this ranking, decide which offers to send to the wider population. Though this pre-testing process is simple and widely used, recently the industry has been under increased pressure to further optimize learning, in particular when facing severe time and learning space constraints. The main contribution of the present work is to demonstrate that direct marketing firms can exploit the information on visual content to optimize the learning phase. This paper proposes a two-phase learning strategy based on a cascade of regression methods that takes advantage of the visual and text features to improve and accelerate the learning process. Experiments in the domain of a commercial Multimedia Messaging Service (MMS) show the effectiveness of the proposed methods and a significant improvement over traditional learning techniques. The proposed approach can be used in any multimedia direct marketing domain in which offers comprise both a visual and text component.

A multimodal semantic location service for intelligent environments: an application for Smart Hospitals

This paper presents semantic models, mechanisms and a service to locate mobile entities in Smart and Intelligent Environments. The key feature of the service is the semantic integration of different positioning systems that not only enables the environment to handle transparently such physical positioning systems, but also to reason on location information coming from different systems and to combine it to obtain higher context information. Indeed, the service relies on the use of ontologies and rules to define a uniform, unambiguous and well-defined model for the location information, independently of the particular positioning system. Moreover, the location service performs logic and reasoning mechanisms to provide both physical and semantic locations of mobile objects and to infer the finest granularity in the case when a mobile object is located by more than one positioning system. Finally, we present an application of the proposed approach to the case of a Smart Hospital.     

System for measuring the coordinates of tire surfaces in transient conditions when rolling over obstacles: description of the system and performance analysis

This paper describes the development of a system for measuring surface coordinates (commonly known as "shape measurements") which is able to give the temporal evolution of the position of the tire sidewall in transient conditions (such as during braking, when there are potholes or when the road surface is uneven) which may or may not be reproducible. The system is based on the well-known technique of projecting and observing structured light using a digital camera with an optical axis which is slanted with respect to the axis of the projector. The transient nature of the phenomenon has led to the development of specific innovative solutions as regards image processing algorithms. This paper briefly describes the components which make up the measuring system and presents the results of the measurements carried out on the drum bench. It then analyses the performance of the measuring system and the sources of uncertainty which led to the development of the system for a specific dynamic application: impact with an obstacle (cleat test). The measuring system guaranteed a measurement uncertainty of 0.28 mm along the Z axis (the axial direction of the tire) with a measurement range of 250(X) x 80(Y) x 25(Z) mm(3), with the tire rolling at a speed of up to 30 km/h.     

Stabilizability of switched linear systems does not imply the existence of convex Lyapunov functions

Counterexamples are given which show that a linear switched system (with controlled switching) that can be stabilized by means of a suitable switching law does not necessarily admit a convex Lyapunov function. Both continuous- and discrete-time cases are considered. This fact contributes in focusing the difficulties encountered so far in the theory of stabilization of switched system. In particular the result is in contrast with the case of uncontrolled switching in which it is known that if a system is stable under arbitrary switching then admits a polyhedral norm as a Lyapunov function.     

A model of checkpoint behavior for applications that have I/O

Due to the increase and complexity of computer systems, reducing the overhead of fault tolerance techniques has become important in recent years. One technique in fault tolerance is checkpointing, which saves a snapshot with the information that has been computed up to a specific moment, suspending the execution of the application, consuming I/O resources and network bandwidth. Characterizing the files that are generated when performing the checkpoint of a parallel application is useful to determine the resources consumed and their impact on the I/O system. It is also important to characterize the application that performs checkpoints, and one of these characteristics is whether the application does I/O. In this paper, we present a model of checkpoint behavior for parallel applications that performs I/O; this depends on the application and on other factors such as the number of processes, the mapping of processes and the type of I/O used. These characteristics will also influence scalability, the resources consumed and their impact on the IO system. Our model describes the behavior of the checkpoint size based on the characteristics of the system and the type (or model) of I/O used, such as the number I/O aggregator processes, the buffering size utilized by the two-phase I/O optimization technique and components of collective file I/O operations. The BT benchmark and FLASH I/O are analyzed under different configurations of aggregator processes and buffer size to explain our approach. The model can be useful when selecting what type of checkpoint configuration is more appropriate according to the applications’ characteristics and resources available. Thus, the user will be able to know how much storage space the checkpoint consumes and how much the application consumes, in order to establish policies that help improve the distribution of resources.

     

Simplified analytical models for compressed concrete columns confined by FRP and FRCM system

In order to consider the response of concrete columns confined by FRP and FRCM system, proper models have to be formulated. In this context the present paper shows a generalized criterion for the determination of the increase in strength, in ductility and in dissipated energy for varying corner radius ratio of the cross section and fiber volumetric ratio. The procedure is based on the best fitting of several experimental data and unlike the usual empirical approaches available in the literature, the proposed technique relates the confinement effectiveness to a single parameter representative of the relative stiffness between the original concrete core and the reinforcement system. Furthermore, the proposed analytical models overcomes the limit of many empirical or semi-empirical models given in the literature that are applicable only to specific cases. A comparison with same available models confirm the reliability of the proposed procedure.     

Ethyl oleate ozonide as an epoxidation tool of C60 and C70 fullerenes

When dissolved in ethyl oleate secondary ozonide, both C₆₀ and C₇₀ fullerenes undergo a series of epoxidation reactions. The pseudofirst-order kinetic rate constants of this process were determined spectrophotometrically at various temperatures and the activation energy for C₆₀ epoxidation through ethyl oleate ozonide was found at 25.9 kcal/mol. Furthermore, C₆₀ was found more reactive than C₇₀ with the ozonide. The kinetics rate constants of C₆₀ epoxidation with ethyl oleate ozonide were compared with the C₆₀ photo-oxidation and auto-oxidation determined in pure ethyl oleate. The epoxidation of fullerenes starts from the homolysis of the peroxide group of the 1,2,4-trioxolane ring of ethyl oleate secondary ozonide. Thus, it is suggested that fullerenes have a potential as decomposition agents of secondary ozonides in some technological applications.