Sharif Digital Repository

In this paper, we consider the problem of computing the visibility polygon (VP) of a query point q (or VP(q)) in a scene consisting of some obstacles with total complexity of n. We show that the combinatorial representation of VP(q) can be computed in logarithmic time by preprocessing the scene in O( n4logn) time and using O( n4) space. We can also report the actual VP(q) in additional O(|VP(q)|) time. As a main result of this paper, we will prove that we can have a tradeoff between the query time and the preprocessing time/space. In other words, we will show that using O(m) space, we can obtain O( n2log(m/n)/m) query time, where m is a parameter satisfying n2≤m≤ n4. For example, when m= n3,... 

KMnO4 oxidation combined with polyelectrolyte (K530CF) flocculation was investigated to mitigate membrane fouling in a membrane bioreactor. The optimum dosages of chemical additives in order to enhance the removal of soluble microbial products (SMPs) were determined. This method was able to reduce the concentration of COD in the effluent to 57.1% and 51.1% lower than those in the experiments in the absence of chemical flocculants and in the presence of polyelectrolyte, respectively. NH3-N removal was improved by combining KMnO4 and K530CF. When KMnO4 was used along with polyelectrolyte, the zeta potential was neutralized to a greater extent which resulted in an improvement in the... 

This paper introduces a stochastic scheduling problem. In this problem a directed acyclic graphs (DAG) represents the precedence relations among m tasks that n workers are scheduled to execute. The question is to find a schedule Σ such that if tasks are assigned to workers according to Σ, the expected time needed to execute all the tasks is minimized. The time needed to execute task t by worker w is a random variable expressed by a negative exponential distribution with parameter λ wt and each task can be executed by more than one worker at a time. In this paper, we will prove that the problem in its general form is NP-hard, but when the DAG width is constant, we will show that the optimum... 

Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of computing VP for any query point efficiently, with some additional preprocessing phase. The scene consists of a set of obstacles, of total complexity O(n). We show for a query point q, VP(q) can be computed in logarithmic time using O(n 4) space and O(n 4 logn) preprocessing time. Furthermore to decrease space usage and preprocessing time, we make a tradeoff between space usage and query time; so by spending O(m) space, we can achieve O(n 2 log √ m/n)/√ m)query time, where n 2≤m≤n 4. These results are also applied to... 

In this research, formation of aluminide/silicide diffusion coatings on γ -TiAl[Ti-48Al-2Nb-2Cr (at.%)] alloy using gasphase diffusion pack cementation process has been investigated. The application of powder mixtures with various chemical compositions in the pack cementation process performed at 1000°C for 6 hours in order to achieve simultaneous diffusion of Al and Si, showed that the composition of the powder mixture could have a significant effect on the structure and thickness of the aluminide/silicide coatings. The identification and analysis of aluminide/silicide microstructures formed as a result of simultaneous diffusion of Al and Si, which was comprehensively and qualitatively done... 

This paper considers the problem of computing the weak visibility polygon (WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon P. We present an algorithm that preprocesses P and creates a data structure from which WVP(pq) is efficiently reported in an output sensitive manner. Our algorithm needs O(n2log n) time and O(n2) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(|WVP(pq)|+log2 n+κlog2 (nκ)), where κ is an input and output sensitive parameter of at most |WVP(pq)|. We improve the preprocessing time and space of current results for this problem [11,6] at the expense of more query time  

In this paper we study combinatorial segment visibility, and show how to compute and maintain it as the observer moves in the plane. There are n non-overlapping convex objects in the plane, and we have a segment observer among them. We first consider static case of the problem, in which the observer and objects are static, and then we study dynamic case of the problem, in which the observer can move among obstacles. ©2009 IEEE  

In this paper we define topological segment visibility, and show how to compute and maintain it as the observer moves in the plane. There are n non-intersecting line segment objects in the plane, and we have a segment observer among them. As the topological visibility of a line segment has not been studied before, we first consider static case of the problem, in which the observer and objects are static, and then we study dynamic case of the problem, in which the observer can move among obstacles  

In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or WVP(pq)) inside a given polygon P. Our first algorithm runs in simple polygons and needs O(n3 log n) time and O(n3) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log n + |WVP(pq)|).. We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with h ≥ 1 pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs O(n2 log n) time and O(n2) space in the preprocessing phase and WVP(pq) in query time of O(nh’ log n + k), in which h’ is an output sensitive parameter... 

In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or (Formula presented.)) inside a given polygon (Formula presented.). Our first algorithm runs in simple polygons and needs (Formula presented.) time and (Formula presented.) space in the preprocessing phase to report (Formula presented.) of any query line segment pq in time (Formula presented.). We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with (Formula presented.) pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs (Formula presented.) time and (Formula presented.) space in the... 

Societies today have come closer together as a result of the development of communication technologies and the greater ease with which business is transacted. Consequently, technological tools and devices are being transferred from industrial societies to other countries at dazzling speeds the transfer of technology to non-industrialized societies with their own histories, civilizations, and backgrounds has led to the emergence of cultural issues and conflicts that are specific to the modern period and that had not existed prior to this period. In this article, we have reviewed the ideas of Don Ihde, a leading contemporary philosopher who has done much work in the field of the philosophy of... 

Many important problems in Computational Geometry needs to perform some kind of angle processing. The Polar Diagram [4] is a locus approach for problems processing angles. Using this structure as preprocessing, one can eliminate exhaustive searches to find objects with smallest angle. Handling data in change is a significant concept in Computer Science. One of the design and analysis tools used in the modeling of moving geometric objects is the kinetic data structure (or KDS) framework Kinetic Data Structure is a framework for maintaining a certain attribute of a set of objects while moving in a continuous manner. In this paper, we use the notion of kinetic data structure to model the... 

In this paper, two models are developed to predict liquid pressure drop and velocity profile in the wicks of concentric annular heat pipes. A steady-state incompressible laminar flow is modeled in the wicks based on velocity and pressure mean values by the extended Darcy-Brinkman model. The corresponding one- and two-dimensional governing equations are solved analytically and numerically, respectively, in the range of low to moderate radial Reynolds numbers. It has been found that there is a difference, about 12% in the worse case, between the total pressure drops of the two models. Whereas, the predicted total pressure drop by the one-dimensional model and that of the Darcy model are in... 

In the present study criterion for local thermal equilibrium assumption is studied. It concerns with the fluid flow and heat transfer between two parallel plates filled with a saturated porous medium under non-equilibrium condition. A two-equation model is utilized to represent the fluid and solid energy transport. Numerical Finite Volume Method has been developed for solving coupled energy equations and the Non-Darcian effects are considered for description of momentum equation. The effects of suitable non dimensional parameters as Peclet number and conductivity ratio has been studied thoroughly. A suitable non dimensional equation proposed in wide range of Peclet number and conductivity... 

In the present study criterion for local thermal equilibrium assumption is studied. It concerns with the fluid flow and heat transfer between two parallel plates filled with a saturated porous medium under non-equilibrium condition. A two-equation model is utilized to represent the fluid and solid energy transport. Numerical Finite Volume Method has been developed for solving coupled energy equations and the Non-Darcian effects are considered for description of momentum equation. The effects of suitable non dimensional parameters as Peclet number and conductivity ratio has been studied thoroughly. A suitable non dimensional equation proposed in wide range of Peclet number and conductivity... 

A detailed description of a concentric annular heat pipe (CAHP) operation is presented in low to moderate temperature ranges (50-200°C). The steady-state response of a CAHP to various heat fluxes in the evaporator and condenser sections are discussed. Two-dimensional mathematical modeling of the fluid flow and heat transfer in the annular vapor space and the wicks are described. The fundamental aspects and limitations of the operation of a CAHP are also discussed. Previously used numerical and experimental approaches for the analysis of the CAHPs and some related concepts are reviewed. The Navier-Stokes and similar equations are recommended for the simulation of fluid flow and heat transfer...