Search

In this paper, we have investigated some of the most recent energy efficient routing protocols for wireless body area networks. This technology has seen advancements in recent times where wireless sensors are injected in the human body to sense and measure body parameters like temperature, heartbeat and glucose level. These tiny wireless sensors gather body data information and send it over a wireless network to the base station. The data measurements are examined by the doctor or physician and the suitable cure is suggested. The whole communication is done through routing protocols in a network environment. Routing protocol consumes energy while helping non-stop communication in a wireless environment. Because of the very tiny size, energy consumption matters a lot. We have focused on the protocols, which provide energy efficiency and improve network lifetime, through put and minimal path loss. We will be discussing some of the most recent energy efficient routing protocols in this paper; later their comparison with an appropriate table is presented. In addition, recent challenges, possible application and perspectives are discussed.

In this paper, we consider certain non-linear scalar Volterra integro-differential equations and Volterra integro-differential systems of first order. We investigate the boundedness, stability, uniformly asymptotic stability, integrability and square integrability of solutions to the scalar equations and the system considered. The technique used to prove the results of the paper is based on the second method of Lyapunov. From the obtained results, we extend and improve some related results that can be found in the literature.

The aim of the paper is to investigate the boundary value problem of the evolution equation Lu = K (x,t) ut - Δu + a (x,t) u = f (x,t). The characteristic property of this type of equations is the failure of the Petrovski’s “A” condition when coefficients are constant [1]. In this case, Cauchy problem is incorrect in the sense of Hadamard. Hence in this paper, the space, guaranteeing the correctness of the boundary value problem in the sense of Hadamard, is selected by adding some additional conditions to the coefficients of the equation.

Nowadays, it is convenient for us to use a search engine to get our needed information. But sometimes it will misunderstand the information because of the different media reports. The Recommender System (RS) is popular to use for every business since it can provide information for users that will attract more revenues for companies. But also, sometimes the system will recommend unneeded information for users. Because of this, this paper provided an architecture of a recommender system that could base on user-oriented preference. This system is called UOP-RS. To make the UOP-RS significantly, this paper focused on movie theatre information and collect the movie database from the IMDb website that provides information related to movies, television programs, home videos, video games, and streaming content that also collects many ratings and reviews from users. This paper also analyzed individual user data to extract the user’s features. Based on user characteristics, movie ratings/scores, and movie results, a UOP-RS model was built. In our experiment, 5000 IMDb movie datasets were used and 5 recommended movies for users. The results show that the system could return results on 3.86 s and has a 14% error on recommended goods when training data as . At the end of this paper concluded that the system could quickly recommend users of the goods which they needed. The proposed system will extend to connect with the Chatbot system that users can make queries faster and easier from their phones in the future.

Tourism plays an important role in Malaysia’s economic development as it can boost business opportunity in its surrounding economic. By apply data mining on tourism data for predicting the area of business opportunity is a good choice. Data mining is the process that takes data as input and produces outputs knowledge. Due to the population of travelling in Asia country has increased in these few years. Many entrepreneurs start their owns business but there are some problems such as wrongly invest in the business fields and bad services quality which affected their business income. The objective of this paper is to use data mining technology to meet the business needs and customer needs of tourism enterprises and find the most effective data mining technology. Besides that, this paper implementation of 4 data mining classification techniques was experimented for extracting important insights from the tourism data set. The aims were to find out the best performing algorithm among the compared on the results to improve the business opportunities in the fields related to tourism. The results of the 4 classifiers correctly classifier the attributes were JRIP (84.09%), Random Tree (83.66%), J48 (85.50%), and REP Tree (82.47%). All the results will be analyzed and discussed in this paper.

Automatic recognition of individuals is very important in modern eras. Biometric techniques have emerged as an answer to the matter of automatic individual recognition. This paper tends to give a technique to detect pupil which is a mixture of easy morphological operations and Hough Transform (HT) is presented in this paper. The circular area of the eye and pupil is divided by the morphological filter as well as the Hough Transform (HT) where the local Iris area has been converted into a rectangular block for the purpose of calculating inconsistencies in the image. This method is implemented and tested on the Chinese Academy of Sciences (CASIA V4) iris image database 249 person and the IIT Delhi (IITD) iris database v1 using MATLAB 2017a. This method has high accuracy in the center and radius finding reaches 97% for 2268 iris on CASIA V4 image and 99.77% for 2240 iris images on IITD, the speed is acceptable compared to the real-time detection speed and stable performance.

Let G be a graph and v be any vertex of G. Then the neighborhood contracted graph Gv of G, with respect to the vertex v, is the graph with vertex set V − N (v), where two vertices u, w ∈ V − N (v) are adjacent in Gv if either w = v and u is adjacent to any vertex of N (v) in G or u, w / ∈ N [v] and u, w are adjacent in G. The properties of the neighborhood contracted graphs are discussed in this paper. The neighborhood contraction in some special class of graphs, the domination in a graph and the neighborhood contracted graphs are discussed in the paper.

In this paper, a numerical procedure called multistage optimal homotopy asymptotic method (MOHAM) is introduced to solve multi-pantograph equations with time delay. It was shown that the MOHAM algorithm rapidly provides accurate convergent approximate solutions of the exact solution using only one term. A comparative study between the proposed method, the homotopy perturbation method (HPM) and the Taylor matrix method are presented. The obtained results revealed that the method is of higher accuracy, effective and easy to use.

Social Networking has dominated the whole world by providing a platform of information dissemination. Usually people share information without knowing its truthfulness. Nowadays Social Networks are used for gaining influence in many fields like in elections, advertisements etc. It is not surprising that social media has become a weapon for manipulating sentiments by spreading disinformation. Propaganda is one of the systematic and deliberate attempts used for influencing people for the political, religious gains. In this research paper, efforts were made to classify Propagandist text from Non-Propagandist text using supervised machine learning algorithms. Data was collected from the news sources from July 2018-August 2018. After annotating the text, feature engineering is performed using techniques like term frequency/inverse document frequency (TF/IDF) and Bag of words (BOW). The relevant features are supplied to support vector machine (SVM) and Multinomial Naïve Bayesian (MNB) classifiers. The fine tuning of SVM is being done by taking kernel Linear, Poly and RBF. SVM showed better results than MNB by having precision of 70%, recall of 76.5%, F1 Score of 69.5% and overall Accuracy of 69.2%.

This paper introduces the Multistep Modified Reduced Differential Transform Method (MMRDTM). It is applied to approximate the solution for Nonlinear Schrodinger Equations (NLSEs) of power law nonlinearity. The proposed method has some advantages. An analytical approximation can be generated in a fast converging series by applying the proposed approach. On top of that, the number of computed terms is also significantly reduced. Compared to the RDTM, the nonlinear term in this method is replaced by related Adomian polynomials prior to the implementation of a multistep approach. As a consequence, only a smaller number of NLSE computed terms are required in the attained approximation. Moreover, the approximation also converges rapidly over a wide time frame. Two examples are provided for showing the ability and advantages of the proposed method to approximate the solution of the power law nonlinearity of NLSEs. For pictorial representation, graphical inputs are included to represent the solution and show the precision as well as the validity of the MMRDTM.

Suicidal ideation is one of the most severe mental health issues faced by people all over the world. There are various risk factors involved that can lead to suicide. The most common & critical risk factors among them are depression, anxiety, social isolation and hopelessness. Early detection of these risk factors can help in preventing or reducing the number of suicides. Online social networking platforms like Twitter, Redditt and Facebook are becoming a new way for the people to express themselves freely without worrying about social stigma. This paper presents a methodology and experimentation using social media as a tool to analyse the suicidal ideation in a better way, thus helping in preventing the chances of being the victim of this unfortunate mental disorder. The data is collected from Twitter, one of the popular Social Networking Sites (SNS). The Tweets are then pre-processed and annotated manually. Finally, various machine learning and ensemble methods are used to automatically distinguish Suicidal and Non-Suicidal tweets. This experimental study will help the researchers to know and understand how SNS are used by the people to express their distress related feelings and emotions. The study further confirmed that it is possible to analyse and differentiate these tweets using human coding and then replicate the accuracy by machine classification. However, the power of prediction for detecting genuine suicidality is not confirmed yet, and this study does not directly communicate and intervene the people having suicidal behaviour.

In this paper, new method have been investigated using evolving algorithms (EA's) to cryptanalysis one of the nonlinear stream cipher cryptosystems which depends on the Linear Feedback Shift Register (LFSR) unit by using cipher text-only attack. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) which are used for attacking one of the nonlinear cryptosystems called "shrinking generator" using different lengths of cipher text and different lengths of combined LFSRs. GA and ACO proved their good performance in finding the initial values of the combined LFSRs. This work can be considered as a warning for a stream cipher designer to avoid the weak points, which may be found in the stream cipher, and may be explored by the cryptanalysts. This work can find the optimal solution for text with minimum lengths of 20 characters and 100 iteration were very enough to find the real initial values of key stream.

Sentiment analysis refers to the task of identifying polarity of positive and negative for particular text that yield an opinion. Arabic language has been expanded dramatically in the last decade especially with the emergence of social websites (e.g. Twitter, Facebook, etc.). Several studies addressed sentiment analysis for Arabic language using various techniques. The most efficient techniques according to the literature were the machine learning due to their capabilities to build a training model. Yet, there is still issues facing the Arabic sentiment analysis using machine learning techniques. Such issues are related to employing robust features that have the ability to discriminate the polarity of sentiments. This paper proposes a hybrid method of linguistic and statistical features along with classification methods for Arabic sentiment analysis. Linguistic features contains stemming and POS tagging, while statistical contains the TF-IDF. A benchmark dataset of Arabic tweets have been used in the experiments. In addition, three classifiers have been utilized including SVM, KNN and ME. Results showed that SVM has outperformed the other classifiers by obtaining an f-score of 72.15%. This indicates the usefulness of using SVM with the proposed hybrid features.

In this paper new methods were presented based on technique of differences which is the difference- based modified jackknifed generalized ridge regression estimator(DMJGR) and difference-based generalized jackknifed ridge regression estimator(DGJR), in estimating the parameters of linear part of the partially linear model. As for the nonlinear part represented by the nonparametric function, it was estimated using Nadaraya Watson smoother. The partially linear model was compared using these proposed methods with other estimators based on differencing technique through the MSE comparison criterion in simulation study.

In this paper, we define the disjunctive sum, difference and Cartesian product of two interval valued neutrosophic sets and study their basic properties. The notions of the (α,β,γ) interval cut set of interval valued neutrosophic sets and the (α,β,γ) strong interval cut set of interval valued neutrosophic sets are put forward. Some related properties have been established with proof, examples and counter examples.

The aim of this paper is to develop the Daftardar-Jafari iterative method (DJM) for a mathematical model that represents the nonlinear thin film flow of a non-Newtonian third-grade fluid on a moving belt with the aim to obtain an approximate solution of high accuracy. When applying the DJM there is no need to resort to any additional techniques such as evaluating Adomian’s polynomials as in the Adomian decomposition method (ADM) or such as using Lagrange multipliers in the variational iteration method (VIM). The accuracy of our results is numerically verified by evaluating the functions of the error remainder and the maximal error remainders. In addition, these results are analyzed by comparing the accuracy of the DJM solutions with those of the fourth order Runge-Kutta method (RKM), ADM and VIM at the same parameter values. All the evaluations have been successfully performed in an iterative way by using the symbolic manipulator Mathematica®.

Let G be a digraph with n vertices, a arcs, c 2 directed closed walks of length 2. Let q1; q2;:::; q n be the eigenvalues of the signless Laplacian matrix of G. The signless Laplacian energy of a digraph G is defined as E SL (G) = $$\sum\limits_{i = 1}^n {\left| {{q_i} - \frac{a}{n}} \right|} $$ . In this paper, some lower and upper bounds are derived for the signless Laplacian energy of digraphs.

Let $\F$ be a field of characteristic different from $2$ and $\V$ be a vector space over $\F$. Let $J: \alpha \to \alpha^J$ be a fixed involutory automorphism on $\F$. In this paper we answer the following question: given an invertible linear map $T: \V \to \V$, when does the vector space $\V$ admit a $T$-invariant non-degenerate $J$-hermitian, resp. $J$-skew-hermitian, form?, Comment: final version, to appear in Indian Journal of Pure and Applied Mathematics

Metaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and without memory (memory-less). The absence of memory in some metaheuristics will lead to the loss of the information gained in previous iterations. The metaheuristics tend to divert from promising areas of solutions search spaces which will lead to non-optimal solutions. This paper aims to review memory usage and its effect on the performance of the main SI-based metaheuristics. Investigation has been performed on SI metaheuristics, memory usage and memory-less metaheuristics, memory characteristics and memory in SI-based metaheuristics. The latest information and references have been further analyzed to extract key information and mapped into respective subsections. A total of 50 references related to memory usage studies from 2003 to 2018 have been investigated and show that the usage of memory is extremely necessary to increase effectiveness of metaheuristics by taking the advantages from their previous successful experiences. Therefore, in advanced metaheuristics, memory is considered as one of the fundamental elements of an efficient metaheuristic. Issues in memory usage have also been highlighted. The results of this review are beneficial to the researchers in developing efficient metaheuristics, by taking into consideration the usage of memory.

To ensure fault tolerance and distributed management, distributed protocols are employed as one of the major architectural concepts underlying the Internet. However, inefficiency, instability and fragility could be potentially overcome with the help of the novel networking architecture called software-defined networking (SDN). The main property of this architecture is the separation of the control and data planes. To reduce congestion and thus improve latency and throughput, there must be homogeneous distribution of the traffic load over the different network paths. This paper presents a smart flow steering agent (SFSA) for data flow routing based on current network conditions. To enhance throughput and minimize latency, the SFSA distributes network traffic to suitable paths, in addition to supervising link and path loads. A scenario with a minimum spanning tree (MST) routing algorithm and another with open shortest path first (OSPF) routing algorithms were employed to assess the SFSA. By comparison, to these two routing algorithms, the suggested SFSA strategy determined a reduction of 2% in packets dropped ratio (PDR), a reduction of 15-45% in end-to-end delay according to the traffic produced, as well as a reduction of 23% in round trip time (RTT). The Mininet emulator and POX controller were employed to conduct the simulation. Another advantage of the SFSA over the MST and OSPF is that its implementation and recovery time do not exhibit fluctuations. The smart flow steering agent will open a new horizon for deploying new smart agents in SDN that enhance network programmability and management.

In this paper two ranking functions are employed to treat the fuzzy multiple objective (FMO) programming model, then using two kinds of membership function, the first one is trapezoidal fuzzy (TF) ordinary membership function, the second one is trapezoidal fuzzy weighted membership function. When the objective function is fuzzy, then should transform and shrinkage the fuzzy model to traditional model, finally solving these models to know which one is better

Support vector machines (SVMs) are supervised learning models that analyze data for classification or regression. For classification, SVM is widely used by selecting an optimal hyperplane that separates two classes. SVM has very good accuracy and extremally robust comparing with some other classification methods such as logistics linear regression, random forest, k-nearest neighbor and naïve model. However, working with large datasets can cause many problems such as time-consuming and inefficient results. In this paper, the SVM has been modified by using a stochastic Gradient descent process. The modified method, stochastic gradient descent SVM (SGD-SVM), checked by using two simulation datasets. Since the classification of different cancer types is important for cancer diagnosis and drug discovery, SGD-SVM is applied for classifying the most common leukemia cancer type dataset. The results that are gotten using SGD-SVM are much accurate than other results of many studies that used the same leukemia datasets.

In this paper we analyze two single server queueing-inventory systems in which items in the inventory have a random common life time. On realization of common life time, all customers in the system are flushed out. Subsequently the inventory reaches its maximum level S through a (positive lead time) replenishment for the next cycle which follows an exponential distribution. Through cancellation of purchases, inventory gets added until their expiry time; where cancellation time follows exponential distribution. Customers arrive according to a Poisson process and service time is exponentially distributed. On arrival if a customer finds the server busy, then he joins a buffer of varying size. If there is no inventory, the arriving customer first try to queue up in a finite waiting room of capacity K. Finding that at full, he joins a pool of infinite capacity with probability γ (0 < γ < 1); else it is lost to the system forever. We discuss two models based on ‘transfer’ of customers from the pool to the waiting room / buffer. In Model 1 when, at a service completion epoch the waiting room size drops to preassigned number L − 1 (1 < L < K) or below, a customer is transferred from pool to waiting room with probability p (0 < p < 1) and positioned as the last among the waiting customers. If at a departure epoch the waiting room turns out to be empty and there is at least one customer in the pool, then the one ahead of all waiting in the pool gets transferred to the waiting room with probability one. We introduce a totally different transfer mechanism in Model 2: when at a service completion epoch, the server turns idle with at least one item in the inventory, the pooled customer is immediately taken for service. At the time of a cancellation if the server is idle with none, one or more customers in the waiting room, then the head of the pooled customer go to the buffer directly for service. Also we assume that no customer joins the system when there is no item in the inventory. Several system performance measures are obtained. A cost function is discussed for each model and some numerical illustrations are presented. Finally a comparison of the two models are made.

International audience; In this paper, we extend the notion of diagonally strictly concave functions and use it to provide a sufficient condition for uniqueness of Nash equilibrium in some concave games. We then provide an alternative proof of the existence and uniqueness of Nash equilibrium for a network resource allocation game arising from the so-called Kelly mechanism by verifying the new sufficient condition. We then establish that the equilibrium resulting from the differential pricing in the Kelly mechanism is related to a normalised Nash equilibrium of a game with coupled strategy space.

In this paper we present approximate solutions of linearized delay differential equations using the matrix Lambert function. The equations arise from a microbial fermentation process in a metabolic system. The delay term appears due to the existence of a rate-limiting step in the fermentation pathway. We find that approximate solutions can be written as a linear combination of the Lambert function solutions in all branches. Simulations are presented for three cases of the ratio of the rate of glucose supply to the maximum reaction rate of the enzyme that experienced delay. The simulations are worked out by taking the principal branch of the matrix Lambert function as the most dominant mode. Our present numerical results show that the zeroth mode approach is quite reliable compared to the results given by classical numerical simulations using the Runge-Kutta method.

In this paper, a system of non nonlinear differential equations with impulse effect at fixed time moments is considered and criteria for retention of uniform eventual stability of its perturbed impulsive differential systems under vanishing perturbations are established. Sufficient conditions are obtained by using piecewise continuous Lyapunov functions. An example is also worked out to illustrate the results. AMS Subject Classification: 34CXX, 34DXX, 34A37, 34K45.

In this paper we study closed range operators on a Hilbert space such that the range is contained in the range of its adjoint. Some results pertaining to these operators and operator matrices are discussed.

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing applied the uniform and the variable interaction strength, however, there is still a lack of work addressing IOR. In this paper, a Jaya algorithm is proposed as an optimization algorithm engine to construct a test list based on IOR in the proposed combinatorial test list generator strategy into a tool called CTJ. The result of applying the Jaya algorithm in input-output based combinatorial testing is acceptable since it produces a nearly optimum number of test cases in a satisfactory time range.

The widespread use of the Internet of things (IoT) in different aspects of an individual’s life like banking, wireless intelligent devices and smartphones has led to new security and performance challenges under restricted resources. The Elliptic Curve Digital Signature Algorithm (ECDSA) is the most suitable choice for the environments due to the smaller size of the encryption key and changeable security related parameters. However, major performance metrics such as area, power, latency and throughput are still customisable and based on the design requirements of the device. The present paper puts forward an enhancement for the throughput performance metric by proposing a more efficient design for the hardware implementation of ECDSA. The design raised the throughput to 0.08207 Mbit/s, leading to an increase of 6.95% from the existing design. It also includes the design and implementation of the Universal Asynchronous Receiver Transmitter (UART) module. The present work is based on a 163-bit key-size over Koblitz curve k-163 and secure hash function SHA-1. A serial module for the underlying modular layer, high-speed architecture of Koblitz point addition and Koblitz point multiplication have been considered in this work, in addition to utilising the carry-save-multiplier, modular adder-subtractor and Extended Euclidean module for ECDSA protocols. All modules are designed using VHDL and implemented on the platform Virtex5 xc5vlx155t-3ff1738. Signature generation requires 0.55360ms, while its validation consumes 1.10947288ms. Thus, the total time required to complete both processes is equal to 1.66ms and the maximum frequency is approximately 83.477MHZ, consuming a power of 99mW with the efficiency approaching 3.39 * 10-6.

In this paper, some estimators of the unknown shape parameter and reliability function of Basic Gompertz distribution (BGD) have been obtained, such as MLE, UMVUE, and MINMSE, in addition to estimating Bayesian estimators under Scale invariant squared error loss function assuming informative prior represented by Gamma distribution and non-informative prior by using Jefferys prior. Using Monte Carlo simulation method, these estimators of the shape parameter and R(t), have been compared based on mean squared errors and integrated mean squared, respectively

Software Defined Network (SDN) is a new technology that separate the ‎control plane from the data plane. SDN provides a choice in automation and ‎programmability faster than traditional network. It supports the ‎Quality of Service (QoS) for video surveillance application. One of most ‎significant issues in video surveillance is how to find the best path for routing the packets ‎between the source (IP cameras) and destination (monitoring center). The ‎video surveillance system requires fast transmission and reliable delivery ‎and high QoS. To improve the QoS and to achieve the optimal path, the ‎SDN architecture is used in this paper. In addition, different routing algorithms are ‎used with different steps. First, we evaluate the video transmission over the SDN with ‎Bellman Ford algorithm. Then, because the limitation of Bellman ford ‎algorithm, the Dijkstra algorithm is used to change the path when a congestion occurs. Furthermore, the Dijkstra algorithm is used with two ‎controllers to reduce the time consumed by the SDN controller. ‎ POX and Pyretic SDN controllers are used such that POX controller is ‎responsible for the network monitoring, while Pyretic controller is responsible for the ‎routing algorithm and path selection. Finally, a modified Dijkstra algorithm is further proposed and evaluated with two ‎controllers to enhance the performance. The results show that the modified Dijkstra algorithm outperformed the other approaches in the aspect of QoS parameters.

A medical- service platform is a mobile application through which patients are provided with doctor’s diagnoses based on information gleaned from medical images. The content of these diagnostic results must not be illegitimately altered during transmission and must be returned to the correct patient. In this paper, we present a solution to these problems using blind, reversible, and fragile watermarking based on authentication of the host image. In our proposed algorithm, the binary version of the Bose_Chaudhuri_Hocquengham (BCH) code for patient medical report (PMR) and binary patient medical image (PMI) after fuzzy exclusive or (F-XoR) are used to produce the patient's unique mark using secret sharing schema (SSS). The patient’s unique mark is used later as a watermark to be embedded into host PMI using blind watermarking-based singular value decomposition (SVD) algorithm. This is a new solution that we also proposed to applying SVD into a blind watermarking image. Our algorithm preserves PMI content authentication during the transmission and PMR ownership to the patient for subsequently transmitting associated diagnosis to the correct patient via a mobile telemedicine application. The performance of experimental results is high compare to previous results, uses recovered watermarks demonstrating promising results in the tamper detection metrics and self-recovery capability, with 30db PSNR, NC value is 0.99.

The paper is concerned with the state and proof of the existence theorem of a unique solution (state vector) of couple nonlinear hyperbolic equations (CNLHEQS) via the Galerkin method (GM) with the Aubin theorem. When the continuous classical boundary control vector (CCBCV) is known, the theorem of existence a CCBOCV with equality and inequality state vector constraints (EIESVC) is stated and proved, the existence theorem of a unique solution of the adjoint couple equations (ADCEQS) associated with the state equations is studied. The Frcéhet derivative derivation of the "Hamiltonian" is obtained. Finally the necessary theorem (necessary conditions "NCs") and the sufficient theorem (sufficient conditions" SCs") for optimality of the state constrained problem are stated and proved.

In this paper, we introduce a new graph parameter called the domination defect of a graph. The domination number γ of a graph G is the minimum number of vertices required to dominate the vertices of G. Due to the minimality of γ, if a set of vertices of G has cardinality less than γ then there are vertices of G that are not dominated by that set. The k-domination defect of G is the minimum number of vertices which are left un-dominated by a subset of γ - k vertices of G. We study different bounds on the k-domination defect of a graph G with respect to the domination number, order, degree sequence, graph homomorphisms and the existence of efficient dominating sets. We also characterize the graphs whose domination defect is 1 and find exact values of the domination defect for some particular classes of graphs.

In this paper we derive a general expression for integer powers of real upper and lower anti-bidiagonal matrices with constant anti-diagonals using Chebyshev polynomials. An explicit formula for the inverse of these matrices is also provided. published

Zernike Moments has been popularly used in many shape-based image retrieval studies due to its powerful shape representation. However its strength and weaknesses have not been clearly highlighted in the previous studies. Thus, its powerful shape representation could not be fully utilized. In this paper, a method to fully capture the shape representation properties of Zernike Moments is implemented and tested on a single object for binary and grey level images. The proposed method works by determining the boundary of the shape object and then resizing the object shape to the boundary of the image. Three case studies were made. Case 1 is the Zernike Moments implementation on the original shape object image. In Case 2, the centroid of the shape object image in Case 1 is relocated to the center of the image. In Case 3, the proposed method first detect the outer boundary of the shape object and then resizing the object to the boundary of the image. Experimental investigations were made by using two benchmark shape image datasets showed that the proposed method in Case 3 had demonstrated to provide the most superior image retrieval performances as compared to both the Case 1 and Case 2. As a conlusion, to fully capture the powerful shape representation properties of the Zernike moment, a shape object should be resized to the boundary of the image.

The evolution of the Internet of things (IoT) led to connect billions of heterogeneous physical devices together to improve the quality of human life by collecting data from their environment. However, there is a need to store huge data in big storage and high computational capabilities. Cloud computing can be used to store big data. The data of IoT devices is transferred using two types of protocols: Message Queuing Telemetry Transport (MQTT) and Hypertext Transfer Protocol (HTTP). This paper aims to make a high performance and more reliable system through efficient use of resources. Thus, load balancing in cloud computing is used to dynamically distribute the workload across nodes to avoid overloading any individual resource, by combining two types of algorithms: dynamic algorithm (adaptive firefly) and static algorithm (weighted round robin). The results show improvement in resource utilization, increased productivity, and reduced response time.

The multi-armed bandit (MAB) problem is a widely studied problem in machine learning literature in the context of online learning. In this article, our focus is on a specific class of problems namely stochastic MAB problems where the rewards are stochastic. In particular, we emphasize stochastic MAB problems with strategic agents. Dealing with strategic agents warrants the use of mechanism design principles in conjunction with online learning, and leads to non-trivial technical challenges. In this paper, we first provide three motivating problems arising from Internet advertising, crowdsourcing, and smart grids. Next, we provide an overview of stochastic MAB problems and key associated learning algorithms including upper confidence bound (UCB) based algorithms. We provide proofs of important results related to regret analysis of the above learning algorithms. Following this, we present mechanism design for stochastic MAB problems. With the classic example of sponsored search auctions as a backdrop, we bring out key insights in important issues such as regret lower bounds, exploration separated mechanisms, designing truthful mechanisms, UCB based mechanisms, and extension to multiple pull MAB problems. Finally we provide a bird's eye view of recent results in the area and present a few issues that require immediate future attention.