Investigation of isolated thunderstorms lightning activity over eastern Mediterranean using Meteosat rapid scan infrared imagery

An analysis of selected spatiotemporal characteristics of isolated thunderstorms in relation to cloud-to-ground (CG) lightning over part of the eastern Mediterranean is performed. The purpose of the study is twofold: to better understand and improve the basic knowledge of the physical mechanisms of the phenomenon and to offer new means of nowcasting the lightning activity in such thunderstorms. Meteosat Second Generation (MSG) Rapid Scan Service (RSS) infrared imagery which offers the option of tracking the examined storms with a time frequency of 5 minutes is one of the two utilized datasets, the other being ZEUS very low frequency (VLF) lightning detection system’s CG discharge data. It was shown that a cloud top temperature of about ?20°C is required for the onset of lightning activity. A rapid drop of the cloud-top temperature of about 11°C in 5 minutes on average is observed a few minutes before or during lightning initiation. The maximization of the activity is usually quite close to the overall minimum cloud-top temperature of the cell. A temperature increase of 3.5°C from this overall minimum can mark the end of the activity, which is also associated to the time evolution of the cell’s horizontal extent. In fact, after the cell’s horizontal area stops to increase and/or starts to gradually diminish, CG lightning activity is expected to stop.     

A Framework for Providing User Level Quality of Service Guarantees in Multi-Class Rate Adaptive Systems

The problem of channel sharing by rate adaptive streams belonging to various classes is considered. Rate adaptation provides the opportunity for accepting more connections by adapting the bandwidth of connections that are already in the system. However, bandwidth adaptation must be employed in a careful manner in order to ensure that (a) bandwidth is allocated to various classes in a fair manner (system perspective) and (b) bandwidth adaptation does not affect adversely the perceived user quality of the connection (user quality). The system perspective aspect has been studied earlier. This paper focuses on the equally important user perspective. It is proposed to quantify user Quality of Service (QoS) through measures capturing short and long-term bandwidth fluctuations that can be implemented with the mechanisms of traffic regulators, widely used in networking for the purpose of controlling the traffic entering or exiting a network node. Furthermore, it is indicated how to integrate the user perspective metrics with the optimal algorithms for system performance metrics developed earlier by the authors. Simulation results illustrate the effectiveness of the proposed framework.

The <Emphasis Type="Italic">B</Emphasis><Superscript><Emphasis Type="Italic">dual</Emphasis></Superscript>-Tree: indexing moving objects by space filling curves in the dual space

Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the B ^x -tree (the state-of-the-art), which consists of multiple B ⁺-trees indexing the 1D values transformed from the (multi-dimensional) moving objects based on a space filling curve (Hilbert, in particular). This curve, however, does not consider object velocities, and as a result, query processing with a B ^x -tree retrieves a large number of false hits, which seriously compromises its efficiency. It is natural to wonder “can we obtain better performance by capturing also the velocity information, using a Hilbert curve of a higher dimensionality?”. This paper provides a positive answer by developing the B ^dual -tree, a novel spatiotemporal access method leveraging pure relational methodology. We show, with theoretical evidence, that the B ^dual -tree indeed outperforms the B ^x -tree in most circum- stances. Furthermore, our technique can effectively answer progressive spatiotemporal queries, which are poorly supported by B ^x -trees.     

Three-dimensional face recognition in the presence of facial expressions: an annotated deformable model approach

In this paper, we present the computational tools and a hardware prototype for 3D face recognition. Full automation is provided through the use of advanced multistage alignment algorithms, resilience to facial expressions by employing a deformable model framework, and invariance to 3D capture devices through suitable preprocessing steps. In addition, scalability in both time and space is achieved by converting 3D facial scans into compact metadata. We present our results on the largest known, and now publicly available, face recognition grand challenge 3D facial database consisting of several thousand scans. To the best of our knowledge, this is the highest performance reported on the FRGC v2 database for the 3D modality     

: towards the modeling, design, control and execution of ETL processes

Extraction-Transformation-loading (ETL) tools are pieces of software responsible for the extraction of data from several sources, their cleansing, customization and insertion into a data warehouse. Literature and personal experience have guided us to conclude that the problems concerning the ETL tools are primarily problems of complexity, usability and price. To deal with these problems we provide a uniform metamodel for ETL processes, covering the aspects of data warehouse architecture, activity modeling, contingency treatment and quality management. The ETL tool we have developed, namely , is capable of modeling and executing practical ETL scenarios by providing explicit primitives for the capturing of common tasks. provides three ways to describe an ETL scenario: a graphical point-and-click front end and two declarative languages: XADL (an XML variant), which is more verbose and easy to read and SADL (an SQL-like language) which has a quite compact syntax and is, thus, easier for authoring.     

Intelligent Network Provisioning for Dynamically Downloadable Applications in Beyond 3G Mobile Networks

Mobile communications beyond 3G will integrate different (but complementary) access technologies into a common platform to deliver value-added services and multimedia content in an optimum way. However, the numerous possible configurations of mobile networks complicated the dynamic deployment of mobile applications. Therefore, research is intensely seeking a service provisioning framework that is technology-independent, supports multiple wireless network technologies, and can interwork high-level service management tasks to network management operations. This paper presents an open value chain paradigm, a model for downloadable applications and a mediating platform for service provisioning in beyond 3G mobile settings. Furthermore, we introduce mechanisms that support a coupled interaction between service deployment and network configuration operations, focusing on the dynamic provisioning of QoS state to data path devices according to the requirements of dynamically downloadable mobile value-added services (VAS).

On exploiting static and dynamically mined metadata for exploratory web searching

Most Web Search Engines (WSEs) are appropriate for focalized search, i.e., they make the assumption that users can accurately describe their information need using a small sequence of terms. However, as several user studies have shown, a high percentage of search tasks are exploratory, and focalized search very commonly leads to inadequate interactions and poor results. This paper proposes exploiting static and dynamically mined metadata for enriching web searching with exploration services. Online results clustering, which is a mining task of dynamic nature since it is based on query-dependent snippets, is useful for providing users with overviews of the top results and thus allowing them to restrict their focus to the desired parts. On the other hand, the various static metadata that are available to a search engine (e.g., domain, language, date, and filetype) are commonly exploited only through the advanced (form-based) search facilities that some WSEs offer (and users rarely use). We propose an approach that combines both kinds of metadata by adopting the interaction paradigm of dynamic taxonomies and faceted exploration, which allows the users to restrict their focus gradually using both static and dynamically derived metadata. Special focus is given on the design and analysis of incremental algorithms for speeding up the exploration process. The experimental evaluation over a real WSE shows that this combination results to an effective, flexible, and efficient exploration experience. Finally, we report the results of a user study indicating that this direction is promising in terms of user preference, satisfaction, and effort.     

The ramification problem in temporal databases: an approach with conflicting constraints

In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they rely on the assumption that fluents persist, and because actions have effects on the next situation only. In this paper we provide a solution to the ramification problem based on an extension of the situation calculus and the work of McCain and Turner. More specifically, we study the case where there are conflicting effects of an action, a particularly complex problem. Also we present a tool which implements the proposed solution.     

Text binarization in color documents

This article presents a new method for the binarization of color document images. Initially, the colors of the document image are reduced to a small number using a new color reduction technique. Specifically, this technique estimates the dominant colors and then assigns the original image colors to them in order that the background and text components to become uniform. Each dominant color defines a color plane in which the connected components (CCs) are extracted. Next, in each color plane a CC filtering procedure is applied which is followed by a grouping procedure. At the end of this stage, blocks of CCs are constructed which are next redefined by obtaining the direction of connection (DOC) property for each CC. Using the DOC property, the blocks of CCs are classified as text or nontext. The identified text blocks are binarized properly using suitable binarization techniques, considering the rest of the pixels as background. The final result is a binary image which contains always black characters in white background independently of the original colors of each text block. The proposed document binarization approach can also be used for binarization of noisy color (or gray‐scale) document images. Several experiments that confirm the effectiveness of the proposed technique are presented. © 2007 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 16, 262–274, 2006