today, the women from the half of the civil society population and from the perspective of security in the urban society, they are vulnerable social groups that their security is threatened in different ways. this study seeks to examine the factors affecting social security of women living in two neighborhoods in vanak and sarasiab. research theoretical model is composed (inspired by the views ...

attachment to the neighborhood represents a positive mental feeling toward the residential place that links associated with residential location and causing the residents’ commitment to habitat and their desire to maintain a relationship with it over the time and at different stages of life. present research examines neighborhood attachment and the effect of personal networks and modern communi...

A number of information extraction (IE) projects such as NELL and TextRunner seek to build a usable knowledge base from the rapidly growing amount of information on the web. However, these solutions use heuristic approaches to reasoning rather than sound probabilistic inference. In this paper, we present a method based on Markov logic for cleaning an automatically extracted knowledge base using...

Case-based reasoning (CBR) has been shown to be of considerable utility in a spam-filtering task. In the course of this study, we propose that the non-random skewed distribution of the cases in a case base is crucial, especially in the context of a classification task like spam filtering. In this paper, we propose approaches to improve the performance of a CBR spam filter by making use of the n...

In second and third generation cellular networks the rollout of base stations needs to be conscientiously prepared, because their radio configuration should match with the coverage provided by existing cells in their neighborhood. The detailed radio planning for every new cell requires considerable human resources and time. This paper proposes a framework for 3G Long Term Evolution (LTE) that c...

Given a collection C of partitions of a base set S, the NP-hard Consensus Clustering problem asks for a partition of S which has a total Mirkin distance of at most t to the partitions in C, where t is a nonnegative integer. We present a parameterized algorithm for Consensus Clustering with running time O(4.24 ·k+ |C| · |S|), where k := t/|C| is the average Mirkin distance of the solution partit...

This paper introduces a new and effective algorithm for learning kernels in a Multi-Task Learning (MTL) setting. Although, we consider a MTL scenario here, our approach can be easily applied to standard single task learning, as well. As shown by our empirical results, our algorithm consistently outperforms the traditional kernel learning algorithms such as uniform combination solution, convex c...

In parallel processing systems, a fundamental consideration is the maximization of system performance through task mapping. A good allocation strategy may improve resource utilization and increase signi cantly the throughput of the system. We demonstrate how to map the tasks among the processors to meet performance criteria, such as minimizing execution time or communication delays. We review t...

In the Evidential Probability (EP) (Kyburg and Teng 2001) framework, interval-valued probabilities are assigned to events given a knowledge base containing statements about logical relationships of classes of objects as well as statements about relative frequencies pertaining to some of those classes. We are interested in the robustness of this inference with respect to perturbations in the giv...