Bayesian estimation based on vague lifetime data

In Classical Bayesian approach, estimation of lifetime data usually is dealing with precise information. However, in real world, some informations about an underlying system might be imprecise and represented in the form of vague quantities. In these situations, we need to generalize classical methods to vague environment for studying and analyzing the systems of interest. In this paper, we propose the Bayesian estimation of failure rate and mean time to failure based on vague set theory in the case of complete and censored data sets. To employ the Bayesian approach, model parameters are assumed to be vague random variables with vague prior distributions. This approach will be used to induce the vague Bayes estimate of failure rate and mean time to failure by introducing and applying a theorem called “Resolution Identity” for vague sets. In order to evaluate the membership degrees of vague Bayesian estimate for these quantities, a computational procedure is investigated. In the proposed method, the original problem is transformed into a nonlinear programming problem which is then divided into eight subproblems to simplifying computations.     

A blur-robust descriptor with applications to face recognition

Understanding the effect of blur is an important problem in unconstrained visual analysis. We address this problem in the context of image-based recognition by a fusion of image-formation models and differential geometric tools. First, we discuss the space spanned by blurred versions of an image and then, under certain assumptions, provide a differential geometric analysis of that space. More specifically, we create a subspace resulting from convolution of an image with a complete set of orthonormal basis functions of a prespecified maximum size (that can represent an arbitrary blur kernel within that size), and show that the corresponding subspaces created from a clean image and its blurred versions are equal under the ideal case of zero noise and some assumptions on the properties of blur kernels. We then study the practical utility of this subspace representation for the problem of direct recognition of blurred faces by viewing the subspaces as points on the Grassmann manifold and present methods to perform recognition for cases where the blur is both homogenous and spatially varying. We empirically analyze the effect of noise, as well as the presence of other facial variations between the gallery and probe images, and provide comparisons with existing approaches on standard data sets.     

RACER: accurate and efficient classification based on rule aggregation approach

Neural Computing and Applications - Rule-based classification is one of the most important topics in the field of data mining due to its wide applications. This article presents a novel rule-based...     

Transmission pricing and recovery of investment costs in the deregulated power system based on optimal circuit prices

Transmission pricing has become a major issue in the discussions about the deregulated electricity markets.Consequently,open access to the transmission system is one of the basic topics to allow competition among participants in the energy market.Transmission costs have an important impact on relative competition among participants in the energy market as well as on short-and long-term economic efficiencies of the whole electricity industry,although they represent only close to 10% of the energy market price.This paper deals with the design and tests of a transmission pricing method based on the optimal circuit prices derived from the economically adapted network(EAN).Prices derived from the EAN have the advantage of being in tune with the maximum revenue allowed to the owner of transmission assets and simplifying the optimal allocation of transmission costs among participants.Beginning from the conceptual design,the proposed method is tested on a three-bus network and on the IEEE 24-bus reliability test system.     

Incremental one-class classifier based on convex–concave hull

Pattern Analysis and Applications - One subject that has been considered less is a binary classification on data streams with concept drifting in which only information of one class (target class)...     

Violence detection in videos using interest frame extraction and 3D convolutional neural network

Multimedia Tools and Applications - With the rapid development of detecting violent behaviors in surveillance cameras, requests on systems that automatically recognize violent events are expanded....     

No-chatter model-free sliding mode control for synchronization of chaotic fractional-order systems with application in image encryption

Multimedia Tools and Applications - Synchronization of different Chaotic dynamical systems is one of the main issues in engineering which has a lot of applications in applied sciences like secure...     

A NEW DISTRIBUTED JOB SCHEDULING ALGORITHM FOR GRID SYSTEMS

Job scheduling is one of the key issues in the design of grid environments. The performance of the grid system severely degrades if a method does not exist to efficiently schedule the user jobs. In this article, a fully distributed, learning automata–based job scheduling algorithm is proposed for grid environments. The proposed method is composed of two types of procedures: in the first, a procedure is run at the grid nodes and in the second, the procedure is run at the schedulers. The proposed algorithm synchronizes the performance of the schedulers by the learning automata that select their actions using the pseudo-random number generators with the same seed. In this method, the grid computational capacity that is allocated to each scheduler is proportional to its workload. To show the efficiency of the proposed method, several simulation experiments were conducted under different grid scenarios. The obtained results show that the proposed algorithm outperforms several well-known methods in terms of makespan, flow time, and load balancing.     

An adaptive learning automata-based ranking function discovery algorithm

Due to the massive amount of heterogeneous information on the web, insufficient and vague user queries, and use of the same query by different users for different aims, the information retrieval process deals with a huge amount of uncertainty and doubt. Under such circumstances, designing an efficient retrieval function and ranking algorithm by which the most relevant results are provided is of the greatest importance. In this paper, a learning automata-based ranking function discovery algorithm in which different sources of information are combined is proposed. In this method, the learning automaton is used to adjust the portion of the final ranking that is assigned to each source of evidence based on the user feedback. All sources of information are first given the same importance. The proportion of a given source increases, if the documents provided by this source are reviewed by the user and decreases otherwise. As the proposed algorithm proceeds, the probability of appearance of each source in the final ranking gets proportional to its relevance to the user queries. Several simulation experiments are conducted on well-known data collections and query types to show the performance of the proposed algorithm. The obtained results demonstrate that the proposed algorithm outperforms several existing methods in terms of precision at position n, mean average precision, and normalized discount cumulative gain.     

Predicting roadheader performance by using artificial neural network

With growing use of roadheaders in the world and its significant role in the successful accomplishment of a tunneling project, it is a necessity to accurately predict performance of this machine in different ground conditions. On the other hand, the existence of some shortcomings in the prediction models has made it necessary to perform more research on the development of the new models. This paper makes an attempt to model the rate of roadheader performance based on the geotechnical and geological site conditions. For achieving the aim, an artificial neural network (ANN), a powerful tool for modeling and recognizing the sophisticated structures involved in data, is employed to model the relationship between the roadheader performance and the parameters influencing the tunneling operations with a high correlation. The database used in modeling is compiled from laboratory studies conducted at Azad University at Science and Research Branch, Tehran, Iran. A model with architecture 4-10-1 trained by back-propagation algorithm is found to be optimum. A multiple variable regression (MVR) analysis is also applied to compare performance of the neural network. The results demonstrate that predictive capability of the ANN model is better than that of the MVR model. It is concluded that roadheader performance could be accurately predicted as a function of unconfined compressive strength, Brazilian tensile strength, rock quality designation, and alpha angle R ² = 0.987. Sensitivity analysis reveals that the most effective parameter on roadheader performance is the unconfined compressive strength.