Adaptive simulation of two dimensional hyperbolic problems by Collocated Discrete Least Squares Meshless method

An adaptive refinement technique is presented in this paper and used in conjunction with the Collocated Discrete Least Squares Meshless (CDLSM) method for the effective simulation of two-dimensional shocked hyperbolic problems. The CDLSM method is based on minimizing the least squares functional calculated at collocation points chosen on the problem domain and its boundaries. The functional is defined as the weighted sum of the squared residuals of the differential equation and its boundary conditions. A Moving Least Squares (MLS) method is used here to construct the meshless shape functions. An error estimator based on the value of functional at nodal points used to discretize the problem domain and its boundaries is developed and used to predict the areas of poor solutions. A node moving strategy is then used to refine the predicted zones of poor solutions before the problem is resolved on the refined distribution of nodes. The proposed methodology is applied to some two dimensional hyperbolic benchmark problems and the results are presented and compared to the exact solutions. The results clearly show the capabilities of the proposed method for the effective and efficient solution of hyperbolic problems of shocked and high gradient solutions.     

Hamshahri: A standard Persian text collection

The Persian language is one of the dominant languages in the Middle East, so there are significant amount of Persian documents available on the Web. Due to the different nature of the Persian language compared to the other languages such as English, the design of information retrieval systems in Persian requires special considerations. However, there are relatively few studies on retrieval of Persian documents in the literature and one of the main reasons is the lack of a standard test collection. In this paper, we introduce a standard Persian text collection, named Hamshahri, which is built from a large number of newspaper articles according to TREC specifications. Furthermore, statistical information about documents, queries and their relevance judgments are presented in this paper. We believe that this collection is the largest Persian text collection, so far.     

On Density-Based Data Streams Clustering Algorithms: A Survey简

Clustering data streams has drawn lots of attention in the last few years due to their ever-growing presence. Data streams put additional challenges on clustering such as limited time and memory and one pass clustering. Furthermore, discovering clusters with arbitrary shapes is very important in data stream applications. Data streams are infinite and evolving over time, and we do not have any knowledge about the number of clusters. In a data stream environment due to various factors, some noise appears occasionally. Density-based method is a remarkable class in clustering data streams, which has the ability to discover arbitrary shape clusters and to detect noise. Furthermore, it does not need the nmnber of clusters in advance. Due to data stream characteristics, the traditional density-based clustering is not applicable. Recently, a lot of density-based clustering algorithms are extended for data streams. The main idea in these algorithms is using density- based methods in the clustering process and at the same time overcoming the constraints, which are put out by data streanFs nature. The purpose of this paper is to shed light on some algorithms in the literature on density-based clustering over data streams. We not only summarize the main density-based clustering algorithms on data streams, discuss their uniqueness and limitations, but also explain how they address the challenges in clustering data streams. Moreover, we investigate the evaluation metrics used in validating cluster quality and measuring algorithms＇ performance. It is hoped that this survey will serve as a steppingstone for researchers studying data streams clustering, particularly density-based algorithms.     

Natural killer or T-lymphocyte cells: Which is the best immune therapeutic agent for cancer? An optimal control approach

Therapeutic vaccines are being developed as a promising new approach to treatment for cancer patients. There are still many unanswered questions about which kind of therapeutic vaccines are the best for the cancer treatments? In this paper we consider a mathematical model, in the form of a system of ordinary differential equations (ODE), this system is an example from a class of mathematical models for immunotherapy of the tumor that were derived from a biologically validated model by Lisette G. de Pillis. The problem how to schedule a variable amount of which vaccines to achieve a maximum reduction in the primary cancer volume is consider as an optimal control problem and it is shown that optimal control is quadratic with 0 denoting a trajectory corresponding to no treatment and 1 a trajectory with treatment at maximum dose along that all therapeutics are being exhausted. The ODE system dynamics characterized by locating equilibrium points and stability properties are determined by using appropriate Lyapunov functions. Especially we attend a parametric sensitivity analysis, which indicates the dependency of the optimal solution with respect to disturbances in model parameters.     

Cyclic preference scheduling of nurses using a Lagrangian-based heuristic

This paper addresses the problem of developing cyclic schedules for nurses while taking into account the quality of individual rosters. In this context, quality is gauged by the absence of certain undesirable shift patterns. The problem is formulated as an integer program (IP) and then decomposed using Lagrangian relaxation. Two approaches were explored, the first based on the relaxation of the preference constraints and the second based on the relaxation of the demand constraints. A theoretical examination of the first approach indicated that it was not likely to yield good bounds. The second approach showed more promise and was subsequently used to develop a solution methodology that combined subgradient optimization, the bundle method, heuristics, and variable fixing. After the Lagrangian dual problem was solved, though, there was no obvious way to perform branch and bound when a duality gap existed between the lower bound and the best objective function value provided by an IP-based feasibility heuristic. This led to the introduction of a variable fixing scheme to speed convergence. The full algorithm was tested on data provided by a medium-size U.S. hospital. Computational results showed that in most cases, problem instances with up to 100 nurses and 20 rotational profiles could be solved to near-optimality in less than 20 min.     

A non-reference image fusion metric based on mutual information of image features

The widespread usage of image fusion causes an increase in the importance of assessing the performance of different fusion algorithms. The problem of introducing a suitable quality measure for image fusion lies in the difficulty of defining an ideal fused image. In this paper, we propose a non-reference objective image fusion metric based on mutual information which calculates the amount of information conducted from the source images to the fused image. The considered information is represented by image features like gradients or edges, which are often in the form of two-dimensional signals. In this paper, a method of estimating the joint probability distribution from marginal distributions is also presented which is employed in calculation of mutual information. The proposed method is compared with the most popular existing algorithms. Various experiments, performed on several databases, certify the efficiency of our proposed method which is more consistent with the subjective criteria.     

Hyper-chaotic Feeded GA (HFGA): a reversible optimization technique for robust and sensitive image encryption

In recent years, due to their straightforward structure and efficiency, the chaos-based cryptographic algorithms have become a good candidate for image encryption. However, they still suffer from many weaknesses, such as insensitivity to the plain image, weak key streams, small key space, non-resistance to some attacks and failure to meet some security criteria. For this purpose in this paper, a novel hybrid image encryption algorithm named Hyper-chaotic Feeded GA (HFGA) is proposed to fill the gaps in two stages; initial encryption by using a hyper-chaotic system, and then outputs reinforcement by employing a customized Genetic Algorithm (GA). By applying an innovative technique, called gene-labelling, the proposed algorithm not only optimizes the preliminary encrypted images in terms of security criteria but also allows the legal receiver to easily and securely decrypt the optimized cipher image. In fact, in the first stage, besides unpredictable random sequences generated by a hyper-chaotic system, a new sensitive diffusion function is proposed which makes the algorithm resistant to differential attacks. In the second stage, the generated cipher images, which are labeled in a special way, will be used as the initial population of a GA which enhances randomness of the cipher images. The results of several experiments and statistical analysis show that the proposed image encryption scheme provides an efficient and secure way for fast image encrypting as well as providing robustness against some well-known statistical attacks.     

Experimental Test of a Two-Stage Kalman Filter for Actuator Fault Detection and Diagnosis of an Unmanned Quadrotor Helicopter

This paper addresses the problem of Faut Detection and Diagnosis (FDD) of a quadrotor helicopter system in the presence of actuator faults. To this end a Two-Stage Kalman Filter (TSKF) is used to simultaneously estimate and isolate possible faults in each actuator. The faults are modelled as losses in control effectiveness of rotors. Three fault scenarios are investigated: loss of control effectiveness in one single actuator, simultaneous loss of control effectiveness in all motors, and loss of control effectiveness in three motors with different magnitudes. The developed FDD algorithm is evaluated through experimental application to an unmanned quadrotor helicopter testbed available at the Department of Mechanical and Industrial Engineering of Concordia University, called Qball-X4. The obtained results show the effectiveness of the proposed FDD method.