Sharif Digital Repository

We study the following variant of the well-known line-simpli- ficationproblem: we are getting a possibly infinite sequence of points p 0,p1,p2,... in the plane defining a polygonal path, and as wereceive the points we wish to maintain a simplification of the pathseen so far. We study this problem in a streaming setting, where weonly have a limited amount of storage so that we cannot store all thepoints. We analyze the competitive ratio of our algorithms, allowingresource augmentation: we let our algorithm maintain a simplificationwith 2k (internal) points, and compare the error of oursimplification to the error of the optimal simplification with k points. We obtain the algorithms with O(1)... 

The Block method approach to solve EIT problem leads to an exact solution if the measurements are done without error. Non-iterative method is a feasible approach on solving 3D EIT forward problem. However, the effect of the measurement error has not been considered in this method yet. In this article, the 3D model of EIT with block method has been considered. The required equations to solve the forward problem are then generated. To solve the forward problem, non-iterative method has been employed. Effect of the measurement error on forward problem for a 3D model of EIT are generated. It has been shown that for a sample 3D model, measurement error can propagate exponentially. ©2007 IEEE  

Resource-constrained project scheduling problem (RCPSP) is one of the most important problems in the context of project scheduling. Considering a single objective, such as makespan minimization, net present value minimization or cost minimization has been the cornerstone of most studies done so far. At the other hand, taking this problem into account as a multi objective one has not been well studied. In this paper, a bi-objective model of RCPSP is presented. The first objective is makespan to be minimized, and the second one, a recently developed measure, is robustness maximization aimed at floating time maximization to make scheduling more reliable. The problem formed in this way is an... 

This paper presents a new approach to economic dispatch (ED) problem with non-continuous and non-smooth cost functions using a hybrid evolutionary programming (EP) algorithm. In the proposed method the concept of multi-agent (MA) systems and EP are integrated together to form a new multi-agent evolutionary programming (MAEP) approach. In MAEP, an agent represents a candidate solution to the optimization problem in hand, and all agents live together in a global environment. Each agent senses its local environment, competes with its neighbors, and also learns by using its own knowledge. MAEP uses these agent-agent interactions and the evolutionary mechanism of EP to obtain the optimal... 

The problem of designing optimum filter banks for different applications is a popular research subject. It has also been shown that principal component filter banks (PCFB) are the optimum filter bank for many application. Existing methods to design FIR PCFBs are based on designing energy compaction filters. In this work we concentrate on designing FIR PCFB with the same frequency response as the ideal one. The presented approach results in filter banks with a very good approximation of ideal PCFB, as verified by simulations. © 2005 IEEE  

Nowadays "as everywhere in the world", so much attention is drawn to performing safety and HSE management rules in Iran. Considering the long life of oil and it's relevant industries in Iran (since 1908, first oil well in Middle East, Masjid Soleyman), many units with more than 50 years old are still in operation. This situation posed special problems in performing safety and HSE regulations that some of them are communal among these units. This paper reveals the result of industrial projects, collecting numerous technical checklists in such units and author's experiences in recent years in Iran, which is aimed to announce some of these major problems and also present solutions for them  

We study here the algorithmic analysis of systems modeled in terms of availability languages. Our first main result is a positive answer to the emptiness problem: it is decidable whether a given availability language contains a word. The key idea is an inductive construction that replaces availability languages with Parikh-equivalent regular languages. As a second contribution, we solve the intersection problem modulo bounded languages: given availability languages and a bounded language, it is decidable whether the intersection of the former contains a word from the bounded language. We show that the problem is NP-complete. The idea is to reduce to satisfiability of existential Presburger... 

In this paper, a new relation is introduced that simplifies the determination of the Muskhelishvili's potential function in plane contact problems. The relation is Φ (z) = 1 / 2 [p (z) - i q (z)], which is correct for all uncoupled contact problems. The new relation is proved in a mathematical way and utilized to obtain the potential function in several contact problems. A complete agreement has been observed between our results and the potential functions that have been obtained from complicated methods in the past. Utilization of the new relation simplifies the solution of contact problems and analytical calculation of the stress and displacement fields, which may lead to the design of... 

In this paper, an approach for optimal determining reserve capacity in the electricity market is presented. This paper describes a method for setting the optimum value of reserve capacity based on the cost of its provision and the benefit derived from its availability. Reduction of customer outage cost is interpreted as the benefit of reserve capacity. In the proposed method, reserve is procured up to the point where the marginal cost of procuring reserve is equal to the marginal value of this reserve capacity. The proposed method can be formulated as a mixed-integer linear program (MILP) and solved with large-scale commercial solvers. The proposed method is applied to the IEEE reliability... 

In this work we study the problem of whether all trajectories of the system ẋ=y-F(x) and ẏ=-g(x) cross the vertical isocline, which is very important for the existence of periodic solutions and oscillation theory. Sufficient conditions are given for all trajectories to cross the vertical isocline. © 2005 Elsevier Ltd. All rights reserved  

In the touring polygons problem (TPP), for a given sequence (s= P0, P1, ⋯, Pk, t = Pk+1) of polygons in the plane, where s and t are two points, the goal is to find a shortest path that starts from s, visits each of the polygons in order and ends at t. In the constrained version of TPP, there is another sequence (F0, ⋯, Fk) of polygons called fences, and the portion of the path from Pi to Pi+1 must lie inside the fence Fi. TPP is NP-hard for disjoint non-convex polygons, while TPP and constrained TPP are polynomially solvable when the polygons are convex and the fences are simple polygons. In this work, we present the first polynomial time algorithm for solving constrained TPP when the... 

Nowadays, content distribution is of high attention in peer to peer information systems. There are two main problems that could be mentioned in this context. The first problem is how to disseminate fragments of information efficiently and the next is to avoid missing same rare fragments towards end of download. For overcoming these problems, a new mechanism is presented in this paper which uses gossip algorithms on basis of social networks. Our mechanism maintains simplicity of gossip and has low overhead. This mechanism includes two phases for managing traffic and solving bottleneck problem: one for spreading rumors inside the social network and finding network of interests and the other... 

The objective of economic dispatch (ED) problem is minimizing the operating cost and finding the point where the total output of the generations equals the total power that must be delivered. In that point the incremental cost of power generation is also equal for all generators. Considering the presence of uncertainty and inaccuracy in the data, fuzzy set theory is an appropriate method to solve the economic dispatch problems. In this paper, a modified fuzzy economic dispatch is formulated to solve the problem under the competitive electricity market uncertainties. Also, available spinning reserve is optimally allocated to market participants. The formulated optimization problem it then... 

We study graphs whose adjacency matrices have determinant equal to 1 or -1, and characterize certain subclasses of these graphs. Graphs whose adjacency matrices are totally unimodular are also characterized. For bipartite graphs having a unique perfect matching, we provide a formula for the inverse of the corresponding adjacency matrix, and address the problem of when that inverse is diagonally similar to a nonnegative matrix. Special attention is paid to the case that such a graph is unicyclic. © 2006 Elsevier Inc. All rights reserved  

This study presents a motion planning algorithm to generate a feasible periodic solution for a hybrid system describing running by a three-dimensional (3-D), three-link, three-actuator, monopedal robot. In order to obtain a symmetric running gait along a straight line, the hybrid system consists of two stance phases and two flight phases. The motion planning algorithm is developed on the basis of a finite-dimensional optimisation problem with equality and inequality constraints. By extending the concept of hybrid zero dynamics to running, the authors propose a time-invariant control scheme that is employed at two levels to locally exponentially stabilise the generated periodic solution for... 

Cloud manufacturing as an emerging service-oriented manufacturing paradigm integrates and manages geographically distributed manufacturing resources such that complex and highly customized manufacturing tasks can be performed cooperatively. The service composition and optimal selection (SCOS) problem, in which manufacturing cloud services are optimally selected for performing subtasks, is one of the key issues for implementing a cloud manufacturing system. In this paper, we propose a new mixed-integer programming model for solving the SCOS problem with sequential composition structure. Unlike the majority of previous research on the problem, in the proposed model, the transportation between... 

To monitor the quality of a multi-attribute process, some issues arise. One of them being the occurrence of a high number of false alarms (type I error) and the other an increase in the probability of not detecting defects when the process is monitored by a set of independent uni-attribute control charts. In this paper, based upon the artificial neural network capabilities we develop a new methodology to overcome this problem. We design a perceptron neural network to monitor either the proportions of several types of product nonconformities (instead of using several np charts) or the number of different types of defects (instead of using several c charts) in a product. Moreover, while the... 

Growing technology, escalating capability, and increasing complexity in many real world systems demand the applications of multivariate statistical analysis approaches by simulation. In these approaches, generating multivariate random vectors is a crucial part of the system modeling and analyzing. The NORTA algorithm, in which generating the correlation matrices of normal random vectors is the most important task, is one of the most efficient methods in this area. To do this, we need to solve some complicated equations. Many researchers have tried to solve these equations by three general approaches of (1) solving nonlinear equations analytically, (2) solving equations numerically, and (3)... 

Given a terrain and a query point p on or above it, we want to count the number of triangles of terrain that are visible from p. We present an approximation algorithm to solve this problem. We implement the algorithm and then we run it on the real data sets. The experimental results show that our approximation solution is very close to the real solution and compare to the other similar works, the running time of our algorithm is better than their algorithm. The analysis of time complexity of algorithm is also presented. Also, we consider visibility testing problem, where the goal is to test whether p and a given triangle of train are visible or not. We propose an algorithm for this problem... 

For a set of n disjoint line segments S in R2, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from a query point p can be computed quickly. For this configuration, the visibility testing problem (VTP) is to test whether p sees a fixed segment s. These problems can be solved in logarithmic query time by using O(n4) preprocessing time and space. In this paper, we approximately solve this problem using quadratic preprocessing time and space. Our methods are superior to current approximation algorithms in terms of both approximation factor and preprocessing cost. In this paper, we propose a 2-approximation algorithm for the VCP using at...