Sharif Digital Repository

We study the problem of maximizing constrained non-monotone submodular functions and provide approximation algorithms that improve existing algorithms in terms of either the approximation factor or simplicity. Different constraints that we study are exact cardinality and multiple knapsack constraints for which we achieve (0.25-)-factor algorithms. We also show, as our main contribution, how to use the continuous greedy process for non-monotone functions and, as a result, obtain a 0.13-factor approximation algorithm for maximization over any solvable down-monotone polytope  

Servo drive systems require a fast dynamic response for position control applications. Conventional cascade control structure has sluggish response due to bandwidth limitations on speed and current control loop. To achieve a fast output response, model reference adaptive control methods can be used to remove the dynamics of inner control loops. In this paper, feed-forward signals are generated using model predictive control which is combined with the conventional cascade structure. Using this approach, a fast transient response and satisfactory tracking ability can be achieved. The proposed control configuration is verified by the simulation results  

This paper presents how can teach complicated problems in electrical engineering subjects (electrical machines) by using simulators such as MATLAB/SIMULINK. Simulation of direct vector control of induction machine (IM) drive on the rotor flux direction with composite model flux observer can improve electrical machine teaching-learning procedure for graduated and under graduated levels. In the indirect vector control of IM, current reference values are used for estimation angle of the rotor flux space vector (ARFSV), however using current reference values instead of current real values can decrease accuracy of ARFSV. In the direct vector control, current real values (current feedback)... 

Social norms are a core concept in social sciences and play a critical role in regulating a society's behavior. Organizations and even governmental bodies use this social component to tackle varying challenges in the society, as it is a less costly alternative to establishing new laws and regulations. Social networks are an important and effective infrastructure in which social norms can evolve. Therefore, there is a need for theoretical models for studying the spread of social norms in social networks. In this paper, by using the intrinsic properties of norms, we redefine and tune the Rescorla-Wagner conditioning model in order to obtain an effective model for the spread of social norms. We... 

One of the main questions in cloud computing environments is how to efficiently distribute user requests or Virtual Machines (VMs) based on their resource needs over time. This question is also an important one when dealing with a cloud federation environment where rational cloud service providers are collaborating together by sharing customer requests. By considering intrinsic aspects of the cloud computing model one can propose request distribution methods that play on the strengths of this computing paradigm. In this paper we look at statistical multiplexing and server consolidation as such a strength and examine the use of the coefficient of variation and other related statistical... 

One of the main questions in cloud computing environments is how to efficiently distribute user requests or Virtual Machines (VMs) based on their resource needs over time. This question is also an important one when dealing with a cloud federation environment where rational cloud service providers are collaborating together by sharing customer requests. By considering intrinsic aspects of the cloud computing model one can propose request distribution methods that play on the strengths of this computing paradigm. In this paper we look at statistical multiplexing and server consolidation as such a strength and examine the use of the coefficient of variation and other related statistical... 

Community Question-Answering websites, such as StackOverflow and Quora, expect users to follow specific guidelines in order to maintain content quality. These systems mainly rely on community reports for assessing contents, which has serious problems, such as the slow handling of violations, the loss of normal and experienced users' time, the low quality of some reports, and discouraging feedback to new users. Therefore, with the overall goal of providing solutions for automating moderation actions in QA websites, we aim to provide a model to predict 20 quality or subjective aspects of questions in QA websites. To this end, we used data gathered by the CrowdSource team at Google Research in... 

With thousands of new questions posted every day on popular Q&A websites, there is a need for automated and accurate software solutions to replace manual moderation. In this paper, we address the critical drawbacks of crowdsourcing moderation actions in Q&A communities and demonstrate the ability to automate moderation using the latest machine learning models. From a technical point, we propose a multi-view approach that generates three distinct feature groups that examine a question from three different perspectives: 1) question-related features extracted using a BERT-based regression model; 2) context-related features extracted using a named-entity-recognition model; and 3) general lexical... 

We propose a novel hybrid learning approach to gain situation awareness in smart environments by introducing a new situation identifier that combines an expert system and a machine learning approach. Traditionally, expert systems and machine learning approaches have been widely used independently to detect ongoing situations as the main functionality in smart environments in various domains. Expert systems lack the functionality to adapt the system to each user and are expensive to design based on each setting. On the other hand, machine learning approaches fail in the challenge of cold start and making explainable decisions. Using both of these approaches enables the system to use user's... 

Assume that we are given a set of points some of which are black and the rest are white. The goal is to find a set of convex polygons with maximum total area that cover all white points and exclude all black points. We study the problem on three different settings (based on overlapping between different convex polygons): (1) In case convex polygons are permitted to have common area, we present a polynomial algorithm. (2) In case convex polygons are not allowed to have common area but are allowed to have common vertices, we prove the NP-hardness of the problem and propose an algorithm whose output is at least (Formula presented.). (3) Finally, in case convex polygons are not allowed to have... 

The increment of using fossil fuels has caused many perilous environmental problems such as acid precipitation, global climate change and air pollution. More than 50% of the energy that is used in the world is wasted as heat. Recovering the wasted heat could increase the system efficiency and lead to lower fuel consumption and CO2 production. Organic Rankine cycle (ORC) which is a reliable technology to efficiently convert low and medium temperature heat sources into electricity, has been known as a promising solution to recover the waste heat. There are numerous studies about ORC technology in a wide range of application and condition. The main objective of this paper is to presents a... 

On-demand resource provisioning and elasticity are two of the main characteristics of the cloud computing paradigm. As a result, the load on a cloud service provider (CSP) is not fixed and almost always a number of its physical resources are not used, called spare resources. As the CSPs typically don't want to be overprovisioned at any time, they procure physical resources in accordance to a pessimistic forecast of their loads and this leads to a large amount of spare resources most of the time. Some CSPs rent their spare resources with a lower price called the spot price, which varies over time with respect to the market or the internal state of the CSP. In this paper, we assume the spot... 

With the widespread access of people to the Internet and the increasing usage of social networks in all nations, social networks have become a new source to study cultural similarities and differences. We identified major issues in traditional methods of data collection in cross-cultural studies: Difficulty in access to people from many nations, limited number of samples, negative effects of translation, positive self-enhancement illusion, and a few unreported problems. These issues are either causing difficulty to perform a cross-cultural study or have negative impacts on the validity of the final results. In this paper, we propose a framework that aims to calculate cultural distance among... 

Modeling is one of the major research areas in social network analysis whose goal is to study networks structure and its evolution. Motivated by the intuition that members in social networks behave selfishly, network creation games have been introduced for modeling social networks. In this paper, our aim is to measure how much the output graphs of a given network creation game are compatible with a social network. We first show that the precise measurement is not possible in polynomial time. Then we propose a method for its approximation; finally, we show the usability of our method by conducting experiments on real network data  

We consider a class of optimization problems called movement minimization on euclidean plane. Given a set of nodes on the plane, the aim is to achieve some spe- cific property by minimum movement of the nodes. We consider two specific properties, namely the connectiv- ity (Con) and realization of a given topology (Topol). By minimum movement, we mean either the sum of all movements (Sum) or the maximum movement (Max). We obtain several approximation algorithms and some hardness results for these four problems. We obtain an O(m)-factor approximation for ConMax and ConSum and an O( p m=OPT)-factor approximation for Con- Max. We also extend some known result on graphical grounds in [1, 2] and... 

We study a classical problem in communication and wireless networks called Finding White Space Regions. In this problem, we are given a set of antennas (points) some of which are noisy (black) and the rest are working fine (white). The goal is to find a set of convex hulls with maximum total area that cover all white points and exclude all black points. In other words, these convex hulls make it safe for white antennas to communicate with each other without any interference with black antennas. We study the problem on three different settings (based on overlapping between different convex hulls) and find hardness results and good approximation algorithms  

In this paper, we consider the following problem: given an undirected graph G=(V,E) and an integer k, find I⊆V2 with |I|≤k in such a way that G'=(V,E∪I) has the maximum number of triangles (a cycle of length 3). We first prove that this problem is NP-hard and then give an approximation algorithm for it  

Spectrum sensing is the basic step in cognitive radio networks. Its accuracy directly affects spectrum utilization. In this paper we propose a new method for blind cooperative spectrum sensing using spatial information. We model our sensing matrix as a graph, taking advantage of signal and spatial correlation of antennas. We prove that the general settings of the problem are hard to approximate. Taking spatial information into account, we propose a new scheme to find white space subregions. Cognitive radio users residing in the region may be able to transmit, but must keep their transmission power to the extent that no interference is caused to primary receivers out of the region  

Assume that we are given a set of points some of which are black and the rest are white. The goal is to find a set of convex polygons with maximum total area that cover all white points and exclude all black points. We study the problem on three different settings (based on overlapping between different convex polygons): (1) In case convex polygons are permitted to have common area, we present a polynomial algorithm. (2) In case convex polygons are not allowed to have common area but are allowed to have common vertices, we prove the NP-hardness of the problem and propose an algorithm whose output is at least (OPTlog(2n/OPT)+2log(n))1/4. (3) Finally, in case convex polygons are not allowed to... 

We consider a class of optimization problems called movement minimization on euclidean plane. Given a set of m nodes on the plane, the aim is to achieve some specific property by minimum movement of the nodes. We consider two specific properties, namely the connectivity (Con) and realization of a given topology (Topol). By minimum movement, we mean either the sum of all movements (Sum) or the maximum movement (Max). We obtain several approximation algorithms and some hardness results for these four problems. We obtain an O(m) -factor approximation for ConMax and ConSum and extend some known result on graphical grounds and obtain inapproximability results on the geometrical grounds. For the...