Bootstrapping the Local Periodogram of Locally Stationary Processes

Abstract. Locally stationary processes are non‐stationary stochastic processes the second‐order structure of which varies smoothly over time. In this paper, we develop a method to bootstrap the local periodogram of a locally stationary process. Our method generates pseudo local periodogram ordinates by combining a parametric time and non‐parametric frequency domain bootstrap approach. We first fit locally a time varying autoregressive model so as to capture the essential characteristics of the underlying process. A locally calculated non‐parametric correction in the frequency domain is then used so as to improve upon the locally parametric autoregressive fit. As an application, we investigate theoretically the asymptotic properties of the bootstrap method proposed applied to the class of local spectral means, local ratio statistics and local spectral density estimators. Some simulations demonstrate the ability of our method to give accurate estimates of the quantities of interest in finite sample situations and an application to a real‐life data‐set is presented.     

Developing hybrid intelligent tutoring and hypertext systems

Abstract

The objective of this paper is to present an alternative paradigm to the traditional Knowledge Based Expert Systems Paradigm for developing a full-scale Intelligent Tutoring System that has dominated for years Intelligent Tutoring Systems development. This alternative paradigm which integrates Minsky's Frames with hypertext has been successfully deployed so far in the development of PEDRO, an Intelligent Tutoring System for foreign language learning, SONATA, an Intelligent Tutoring System for music theory learning and INTUITION, an Intelligent Tutoring System for Gaming-Simulation.     

From MPEG-7 user interaction tools to hanging basket models: bridging the gap

The content–user gap is the difference between the limited range of content-relevant preferences that may be expressed using the MPEG-7 user interaction tools and the much wider range of metadata that may be represented using the MPEG-7 content tools. One approach for closing this gap is to make the user and content metadata isomorphic by using the existing MPEG-7 content tools to represent user (as well as content) metadata (Agius and Angelides 2006, 2007). Subsequently, user preferences may be specified for all content, without omission. Since there is a wealth of user preference and history metadata within the MPEG-7 user interaction tools that can usefully complement these specific content preferences, in this paper we develop a method by which all user and content metadata may be bridged.

Salient feature and reliable classifier selection for facial expression classification

A novel facial expression classification (FEC) method is presented and evaluated. The classification process is decomposed into multiple two-class classification problems, a choice that is analytically justified, and unique sets of features are extracted for each classification problem. Specifically, for each two-class problem, an iterative feature selection process that utilizes a class separability measure is employed to create salient feature vectors (SFVs), where each SFV is composed of a selected feature subset. Subsequently, two-class discriminant analysis is applied on the SFVs to produce salient discriminant hyper-planes (SDHs), which are used to train the corresponding two-class classifiers. To properly integrate the two-class classification results and produce the FEC decision, a computationally efficient and fast classification scheme is developed. During each step of this scheme, the most reliable classifier is identified and utilized, thus, a more accurate final classification decision is produced. The JAFFE and the MMI databases are used to evaluate the performance of the proposed salient-feature-and-reliable-classifier selection (SFRCS) methodology. Classification rates of 96.71% and 93.61% are achieved under the leave-one-sample-out evaluation strategy, and 85.92% under the leave-one-subject-out evaluation strategy.     

Accelerated collection of sensor data by mobility-enabled topology ranks

We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Motivated by relevant applications, we focus on dynamic sensory mobility and heterogeneous sensor placement. Our approach basically suggests to exploit the sensor motion to adaptively propagate information based on local conditions (such as high placement concentrations), so that the sink gradually “learns” the network and accordingly optimizes its motion. Compared to relevant solutions in the state of the art (such as the blind random walk, biased walks, and even optimized deterministic sink mobility), our method significantly reduces latency (the improvement ranges from 40% for uniform placements, to 800% for heterogeneous ones), while also improving the success rate and keeping the energy dissipation at very satisfactory levels.     

Facets of the Fully Mixed Nash Equilibrium Conjecture

In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE\mathsf{FMNE} Conjecture, in selfish routing for the special case of n identical users over two (identical) parallel links. We introduce a new measure of Social Cost, defined as the expectation of the square of the maximum congestion on a link; we call it Quadratic Maximum Social Cost. A Nash equilibrium is a stable state where no user can improve her (expected) latency by switching her mixed strategy; a worst-case Nash equilibrium is one that maximizes Quadratic Maximum Social Cost. In the fully mixed Nash equilibrium, all mixed strategies achieve full support.     

An empirical examination of the sustainability of social bookmarking websites

Given the continuous growth of social bookmarking sites, we investigated the reasons behind their sustainability as online social structures. Bookmarking sites offer users the option to post and tag web resources privately or to make them publicly available to other users of the sites. A prevalence of private tagging would threaten the sustainability of the social aspects at these sites. Using activity data from a sample of 1,000 users of Simpy, a popular social bookmarking site, we found that the majority of users contribute most of their tagged resources to the public repository, despite the option to keep them private. We also found that in social bookmarking sites there is a minority of extremely prolific contributors who are responsible for a large portion of public tagged resources. Finally, we found that new users make larger proportions of their contributions public than existing users and that there is a larger number of regular contributors to the site than irregular ones. All of these findings are consistent with the mechanisms predicted by a theoretical model of sustainable online social structures.