UML-CI: A reference model for profiling critical infrastructure systems

The study of critical infrastructure systems organization and behavior has drawn great attention in the recent years. This is in part due to their great influence on the ordinary life of every citizen. In this paper, we study critical infrastructures’ characteristics and propose a reference model based on the Unified Modeling Language (UML). This reference model attempts to provide suitable means for the task of modeling an infrastructure system through offering five major metamodels. We introduce each of these metamodels and explain how it is possible to integrate them into a unique representation to characterize various aspects of an infrastructure system. Based on the metamodels of UML-CI, infrastructure system knowledge bases can be built to aid the process of infrastructure system modeling, profiling, and management.     

Multiresolution HVS and statistically based image coding scheme

In this paper a novel multiresolution human visual system and statistically based image coding scheme is presented. It decorrelates the input image into a number of subbands using a lifting based wavelet transform. The codec employs a novel statistical encoding algorithm to code the coefficients in the detail subbands. Perceptual weights are applied to regulate the threshold value of each detail subband that is required in the statistical encoding process. The baseband coefficients are losslessly coded. An extension of the codec to the progressive transmission of images is also developed. To evaluate the performance of the coding scheme, it was applied to a number of test images and its performance with and without perceptual weights is evaluated. The results indicate significant improvement in both subjective and objective quality of the reconstructed images when perceptual weights are employed. The performance of the proposed technique was also compared to JPEG and JPEG2000. The results show that the proposed coding scheme outperforms both coding standards at low compression ratios, while offering satisfactory performance at higher compression ratios.     

Adaptive robust control of uncertain systems with state and input delay

In this paper, adaptive robust control of uncertain systems with multiple time delays in states and input is considered. It is assumed that the parameter uncertainties are time varying norm-bounded whose bounds are unknown but their functional properties are known. To overcome the effect of input delay on the closed loop system stability, new Lyapunov Krasovskii functional will be introduced. It is shown that the proposed adaptive robust controller guarantees globally uniformly exponentially convergence of all system solutions to a ball with any certain convergence rate. Moreover, if there is no disturbance in the system, asymptotic stability of the closed loop system will be established. The proposed design condition is formulated in terms of linear matrix inequality (LMI) which can be easily solved by LMI Toolbox in Matlab. Finally, an illustrative example is included to show the effectiveness of results developed in this paper.     

A domain decomposition strategy for alignment of multiple biological sequences on multiprocessor platforms

Multiple Sequences Alignment (MSA) of biological sequences is a fundamental problem in computational biology due to its critical significance in wide ranging applications including haplotype reconstruction, sequence homology, phylogenetic analysis, and prediction of evolutionary origins. The MSA problem is considered NP-hard and known heuristics for the problem do not scale well with increasing numbers of sequences. On the other hand, with the advent of a new breed of fast sequencing techniques it is now possible to generate thousands of sequences very quickly. For rapid sequence analysis, it is therefore desirable to develop fast MSA algorithms that scale well with an increase in the dataset size. In this paper, we present a novel domain decomposition based technique to solve the MSA problem on multiprocessing platforms. The domain decomposition based technique, in addition to yielding better quality, gives enormous advantages in terms of execution time and memory requirements. The proposed strategy allows one to decrease the time complexity of any known heuristic of O(N)^x$O{\left(N\right)}^x$ complexity by a factor of O(1/p)^x$O{(1/p)}^x$, where N$N$ is the number of sequences, x$x$ depends on the underlying heuristic approach, and p$p$ is the number of processing nodes. In particular, we propose a highly scalable algorithm, Sample-Align-D, for aligning biological sequences using Muscle system as the underlying heuristic. The proposed algorithm has been implemented on a cluster of workstations using the MPI library. Experimental results for different problem sizes are analyzed in terms of quality of alignment, execution time and speed-up.     

Dynamic hybrid automatic repeat request (DHARQ) for WiMAX – Mobile multihop relay using adaptive power control

Wireless multihop network is currently attracting much attention as a new wireless broadband access technology due to numerous benefits. This work proposes a power control scheme for WiMAX multihop relay system. In contrast to existing power control and optimization approaches, our proposed method uses an adaptive Channel Quality Measurement for a relay station to reduce interferences to other mobile station (MS) or relay station (RS) within the same cell and hence increase the number of hops per link and consequently maximize the spatial reuse. The proposed power control is applied to a new dynamic HARQ algorithm for adaptive channel quality enhancement. Simulation results have indicated that the proposed approach achieves superior BER/PER performance enhancement in comparison to previous related works.     

Short-term and long-term memory analysis of learning using 2D and 3D educational contents

ABSTRACT

The effect of 2D and 3D educational content learning on memory has been studied using electroencephalography (EEG) brain signal. A hypothesis is set that the 3D materials are better than the 2D materials for learning and memory recall. To test the hypothesis, we proposed a classification system that will predict true or false recall for short-term memory (STM) and long-term memory (LTM) after learning by either 2D or 3D educational contents. For this purpose, EEG brain signals are recorded during learning and testing; the signals are then analysed in the time domain using different types of features in various frequency bands. The features are then fed into a support vector machine (SVM)-based classifier. The experimental results indicate that the learning and memory recall using 2D and 3D contents do not have significant differences for both the STM and the LTM.     

On the coupled dynamics of small spacecraft and elastic deployable appendages

A thorough investigation of the dynamics of finite-mass satellites with a deployable elastic arm is presented. This work is focused on the interaction between spacecraft rigid body motion and its flexible arm dynamics during the deployment process. The classical Newton–Euler formulation and the Lagrangian approach are applied to the study of the dynamics of spacecraft and its deploying arm. Utilizing a non-Newtonian floating frame to define the arm elastic deformation field, the interactions between the spacecraft and its moving arm have been simulated. Complete equations of motion show that the spacecraft motion induces dynamical stiffness on the arm; in addition, axial and lateral motions of the deploying elastic arm change the spacecraft mass-characteristics and thus influence the spacecraft’s rigid body motions. The overall dynamic behavior is highly dependent on spacecraft mass characteristics in addition to the “arm deployment time (ADT)”. The results of case studies clearly indicate that some assumptions previously applied in appendage dynamic analysis are not conservative and produce erroneous results. This study realistically investigates the dynamics of elastic deploying appendages by considering finite-mass characteristics for small and massy spacecraft. The results reveal that for massive spacecraft the arm’s flexible dynamics is mainly excited through deployment, while for small spacecraft the energy transfers to the arm base and the spacecraft rigid body motion is considerably stimulated. Moreover, this work has further highlighted the effects of ADT in the overall system response. The findings of this work show that the energy distribution between arm’s elastic dynamics and spacecraft rigid body motions is an important factor in the design of any control system to limit unwanted arm-tip motions.     

SimClus: an effective algorithm for clustering with a lower bound on similarity

Clustering algorithms generally accept a parameter k from the user, which determines the number of clusters sought. However, in many application domains, like document categorization, social network clustering, and frequent pattern summarization, the proper value of k is difficult to guess. An alternative clustering formulation that does not require k is to impose a lower bound on the similarity between an object and its corresponding cluster representative. Such a formulation chooses exactly one representative for every cluster and minimizes the representative count. It has many additional benefits. For instance, it supports overlapping clusters in a natural way. Moreover, for every cluster, it selects a representative object, which can be effectively used in summarization or semi-supervised classification task. In this work, we propose an algorithm, SimClus, for clustering with lower bound on similarity. It achieves a O(log n) approximation bound on the number of clusters, whereas for the best previous algorithm the bound can be as poor as O(n). Experiments on real and synthetic data sets show that our algorithm produces more than 40% fewer representative objects, yet offers the same or better clustering quality. We also propose a dynamic variant of the algorithm, which can be effectively used in an on-line setting.     

An optical solution to the 3-SAT problem using wavelength based selectors

In this paper, an optical wavelength-based method to solve a well-known NP-complete problem 3-SAT is provided. In the 3-SAT problem, a formula F in the form of conjunction of some clauses over Boolean variables is given and the question is to find if F is satisfiable or not. The provided method uses exponential number of different wavelengths in a light ray and considers each group of wavelengths as a possible value-assignment for the variables. It then uses optical devices to drop wavelengths not satisfying F from the light ray. At the end, remaining wavelengths indicate satisfiability of the formula. The method provides two ways to arrange the optical devices to select satisfying wavelengths for a given clause: simple clause selectors and combined clause selectors, both requiring exponential preprocessing time. After preprocessing phase, the provided method requires polynomial time and optical devices to solve each problem instance.