Sharif Digital Repository

A statistical algorithm is introduced to improve the false inference of active loci, in the population in which members are admixture. The algorithm uses an advanced clustering algorithm based on a Bayesian approach. The proposed algorithm simultaneously infers the hidden structure of the population. In this regard, the Monte Carlo Markov Chain (MCMC) algorithm has been used to evaluate the posterior probability distribution of the model parameters. The proposed algorithm is implemented in a bundle, and then its performance is widely evaluated in a number of artificial databases. The accuracy of the clustering algorithm is compared with the STRUCTURE method based on certain criterion. © 2019... 

Partial discharge (PD) measurement and identification have great importance to condition monitoring of power transformers. In this paper, a new method for recognition of single and multi-source of PD based on extraction of high level image features has been introduced. A database, involving 365 samples of phase-resolved PD (PRPD) data, is developed by measurement carried out on transformer artificial defect models (having different sizes of defect) under a specific applied voltage, to be used for proposed algorithm validation. In the first step, each set of PRPD data is converted into grayscale images to represent different PD defects. Two 'image feature extraction' methods, the Local Binary... 

Association mapping of genetic diseases has attracted extensive research interest during the recent years. However, most of the methodologies introduced so far suffer from spurious inference of the associated sites due to population inhomogeneities. In this paper, we introduce a statistical framework to compensate for this shortcoming by equipping the current methodologies with a state-of-the-art clustering algorithm being widely used in population genetics applications. The proposed framework jointly infers the disease-associated factors and the hidden population structures. In this regard, a Markov Chain-Monte Carlo (MCMC) procedure has been employed to assess the posterior probability... 

Energy consumption and performance metrics have become critical issues for scheduling parallel task-based applications in high-performance computing systems such as cloud datacenters. The duplication and clustering strategy, as well as Dynamic Voltage Frequency Scaling (DVFS) technique, have separately been concentrated on reducing energy consumption and optimizing performance parameters such as throughput and makespan. In this paper, a dual-phase algorithm called EATSDCD which is an energy efficient time aware has been proposed. The algorithm uses the combination of duplication and clustering strategies to schedule the precedence-constrained task graph on datacenter processors through DVFS.... 

Energy consumption and performance metrics have become critical issues for scheduling parallel task-based applications in high-performance computing systems such as cloud datacenters. The duplication and clustering strategy, as well as Dynamic Voltage Frequency Scaling (DVFS) technique, have separately been concentrated on reducing energy consumption and optimizing performance parameters such as throughput and makespan. In this paper, a dual-phase algorithm called EATSDCD which is an energy efficient time aware has been proposed. The algorithm uses the combination of duplication and clustering strategies to schedule the precedence-constrained task graph on datacenter processors through DVFS.... 

Learning an appropriate distance measure under supervision of side information has become a topic of significant interest within machine learning community. In this paper, we address the problem of metric learning for constrained clustering by considering three important issues: (1) considering importance degree for constraints, (2) preserving the topological structure of data, and (3) preserving some natural distribution properties in the data. This work provides a unified way to handle different issues in constrained clustering by learning an appropriate distance measure. It has modeled the first issue by injecting the importance degree of constraints directly into an objective function.... 

This paper proposes a new approach to study the sensitivity analysis in the network flow problems, in particular, the minimum spanning tree and shortest path problems. In a sensitivity analysis, one looks for the amount of changes in the edges’ weights, number of edges or number of vertices such that the optimal solution, i.e., the minimum spanning tree or shortest path does not change. We introduce a novel approach, and develop associated equations and mathematics. We discuss two illustrative examples to show the applicability of the proposed approach. © International Journal of Industrial Engineering  

The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erdös, Simonovits and Sós. For given graphs G and H the anti-Ramsey number ar(G, H) is defined to be the maximum number k such that there exists an assignment of k colors to the edges of G in which every copy of H in G has at least two edges with the same color. Usually, combinatorists study extremal values of anti-Ramsey numbers for various classes of graphs. There are works on the computational complexity of the problem when H is a star. Along this line of research, we study the complexity of computing the anti-Ramsey number ar(G, Pk), where Pk is a path of length k. First, we observe that when k is... 

The rapid development of scientific fields in this modern era has raised the concern for prospective scholars to find a proper research field to conduct their future studies. Thus, having a vision of future could be helpful to pick the right path for doing research and ensuring that it is worth investing in. In this study, we use article keywords of computer science journals and conferences, assigned by INSPEC controlled indexing, to construct a temporal scientific knowledge network. By observing keyword networks snapshots over time, we can utilize the link prediction methods to foresee the future structures of these networks. We use two different approaches for this link prediction problem.... 

This study presents a novel statistical volume element (SVE) for micromechanical modeling of the white matter structures, with histology-informed randomized distribution of axonal tracts within the extracellular matrix. The model was constructed based on the probability distribution functions obtained from the results of diffusion tensor imaging as well as the histological observations of scanning electron micrograph, at two structures of white matter susceptible to traumatic brain injury, i.e. corpus callosum and corona radiata. A simplistic representative volume element (RVE) with symmetrical arrangement of fully alligned axonal fibers was also created as a reference for comparison. A... 

Sparse representation can be extended to high dimensions and can be used in many applications, including three-dimensional (3D) Inverse synthetic aperture radar (ISAR) imaging. In this study, the high-dimensional sparse representation problem and a recovery method called high-dimensional smoothed least zero-norm (HDSL0) are formulated. In this method, the theory and computation of tensors and approximating L0 norm using Gaussian functions are used for sparse recovery of high-dimensional data. To enhance the performance of HDSL0, modified regularised high-dimensional SL0 (MRe-HDSL0) algorithm, which benefits from the regularised form of SL0 and an additional hard thresholding step, is... 

In this paper, we propose a fuzzification method for clusters produced from a clustering process, based on Active Learning Method (ALM). ALM is a soft computing methodology which is based on a hypothesis claiming that human brain interprets information in pattern-like images. The proposed fuzzification method is applicable to all non-fuzzy clustering algorithms as a post process. The most outstanding advantage of this method is the ability to determine the membership degrees of each data to all clusters based on the density and shape of the clusters. It is worth mentioning that for existing fuzzy clustering algorithms such as FCM the membership degree is usually determined as a function of... 

Density peaks clustering (DPC) is as an efficient clustering algorithm due for using a non-iterative process. However, DPC and most of its improvements suffer from the following shortcomings: (1) highly sensitive to its cutoff distance parameter, (2) ignoring the local structure of data in computing local densities, (3) using a crisp kernel to calculate local densities, and (4) suffering from the cause of chain reaction. To address these issues, in this paper a new method called DPC-DBFN is proposed. The proposed method uses a fuzzy kernel for improving separability of clusters and reducing the impact of outliers. DPC-DBFN uses a density-based kNN graph for labeling backbones. This strategy... 

We study a weighted balanced version of the k-center problem, where each center has a fixed capacity, and each element has an arbitrary demand. The objective is to assign demands of the elements to the centers, so as the total demand assigned to each center does not exceed its capacity, while the maximum distance between centers and their assigned elements is minimized. We present a deterministic O(1)-approximation algorithm for this generalized version of the k-center problem in the distributed setting, where data is partitioned among a number of machines. Our algorithm substantially improves the approximation factor of the current best randomized algorithm available for the problem. We... 

Objective: Joint analysis of multi-subject brain imaging datasets has wide applications in biomedical engineering. In these datasets, some sources belong to all subjects (joint), a subset of subjects (partially-joint), or a single subject (individual). In this paper, this source model is referred to as joint/partially-joint/individual multiple datasets unidimensional (JpJI-MDU), and accordingly, a source extraction method is developed. Method: We present a deflation-based algorithm utilizing higher order cumulants to analyze the JpJI-MDU source model. The algorithm maximizes a cost function which leads to an eigenvalue problem solved with thin-SVD (singular value decomposition)... 

This paper proposes a decentralized algorithm to organize an ad-hoc sensor network into clusters. Each sensor operates independently, monitoring communication among others. Those sensors which have many neighbors that are not already part of a cluster are likely candidates to creating a new cluster by declaring themselves to be a new cluster-head. The Clustering Algorithm via Deadline Timer (CADT) provides a protocol whereby this can be achieved and the process continues until all sensors are part of a cluster. Because of the difficulty of analyses simplified models are used to study and abstract its performance. A simple formula to estimate the number of clusters which will be formed in an... 

Until now, many algorithms have been introduced for finding arbitrary shaped clusters, but none of these algorithms is able to identify all sorts of cluster shapes and structures that are encountered in practice. Furthermore, the time complexity of the existing algorithms is usually high and applying them on large dataseis is time-consuming. In this paper, a novel fast clustering algorithm is proposed. This algorithm distinguishes clusters of different shapes using a twostage clustering approach. In the first stage, the data points are grouped into a relatively large number of fuzzy ellipsoidal sub-clusters. Then, connections between sub-clusters are established according to the Bhatiacharya... 

In this paper, a novel clustering algorithm using an agent-based architecture along with a force-based clustering algorithm is proposed. To this end, a set of simple mobile agents thai have limited processing power is used. These agents communicate in a pairwise manner to exchange their position information. As opposed to the bio-inspired clustering algorithms that need a set of local rules to specify the agent movements, in this paper the agent motions are driven from attractive and repulsive potential fields that are created by the data points and the other agents respectively. Each agent moves according to the resulted force from applying the potential fields and announces its next... 

A new approach, based on Adaptive-Network-based Fuzzy Inference System (ANFIS), is presented for the classification of arthrometric data of normal/ACL-ruptured knees, considering the insufficiency of existing criteria. An ANFIS classifier was developed and tested on a total of 4800 arthrometric data points collected from 40 normal and 40 injured subjects. The system consisted of 5 layers and 8 rules, based on the results of subtractive data clustering, and trained using the hybrid algorithm method. The performance of the system was evaluated in four runs, in the framework of a 4-fold cross validation algorithm. The results indicated a definite correct diagnosis for typical injured and normal... 

Clustering has become an increasingly important task in modern application domains. Targeting useful and relevant information on the World Wide Web is a topical and highly complicated research area. Clustering techniques have been applied to categorize documents on web and extracting knowledge from the web. In this paper we propose novel clustering algorithms based on Harmony Search (HS) optimization method that deals with web document clustering. By modeling clustering as an optimization problem, first, we propose a pure HS based clustering algorithm that finds near global optimal clusters within a reasonable time. Then we hybridize K-means and harmony clustering to achieve better...