Sharif Digital Repository

This work, based on the standard unscented Kalman filter (UKF), proposes a modified UKF for highly non-linear stochastic systems, assuming that the associated probability distributions are normal. In the standard UKF with 2n + 1 sample points, the estimated mean and covariance match the true mean and covariance up to the third order, besides, there exists a scaling parameter that plays a crucial role in minimising the fourth-order errors. The proposed method consists of a computationally efficient formulation of the unscented transform that incorporates N - 1, N ≥ 2, constant parameters to scale 2n(N - 1) + 1 sample points such that the 2Nth order errors are minimised. The scaling parameters... 

This study deals with the problem of track-to-track fusion in a sensor network when the correlation terms between the estimates of the agents are unknown. The proposed method offers an upper bound for the optimal minimum variance fusion rule through construction of the correlation terms according to an optimisation scheme. In general, the upper bound filter provides an estimate that is more conservative than the optimal estimate generated by the minimum variance fusion rule, while at the same time is less conservative than one obtained by the widely used covariance intersection method. From the geometrical viewpoint, the upper bound filter results in the inscribed largest volume ellipsoid... 

This work describes an efficient technique to sequentially combine estimates resulting from individual sets of measurements provided by a network of satellites. The prescribed method is especially effective to estimate motion states of an uncooperative space object using range image data. The technique, which is fast and suitable for on-line applications, could also be effective to capture stray objects or those satellites that require periodic servicing. Such missions call for high degree of precision and reliable estimation methods. In fact, the proposed estimation architecture consists of a network of synchronized platforms, i.e., Observer Satellites (OS), each with processing power and... 

In this paper, we consider a special version of the well-known line-simplification problem for simplifying the boundary of a region illuminated by a point light source q, or its visibility polygon VP(q). In this simplification approach, we should take the position of q as an essential factor into account to determine the quality of the resulting simplification. For this purpose, we redefine the known distance- and area-distortion error criteria as the main simplification criteria to take into account the distance between the observer q and the boundary of VP(q). Based on this, we propose algorithms for simplifying VP(q). More precisely, we propose simplification algorithms of O(n2) and... 

Obtaining a reliable reservoir permeability map that is consistent with all available data is of great important for reservoir engineers. However, there is not enough core from existing wells to estimate the reservoir permeability directly but Well log data are more widely available. This study aims to model permeability within the reservoir while there is no enough data. In particular, we use artificial neural networks to estimate permeability using four input logs of sonic, gravity, porosity and neutron logs in six existing wells. In order to eliminate the correlated data, we have done Principal Component Analysis on selected input logs. Collocated cokriging is considered as a valuable... 

In this paper, we propose a method for maintaining the region visible from a moving point observer inside a planar scene. In this method, we check the observer position in discrete time-stamps to detect and apply changes to the visible or illuminated region of a moving point observer q, or VP(q). We efficiently maintain a list C(q) of edges in VP(q) which are subject to change during the motion. In each time-stamp that VP(q) is to be updated, we only refine and redraw the view against the edges of C(q) that indicate the positions of the visibility changes. We build an enriched representation of the visibility graph in a preprocessing step to apply the required updates on C(q) efficiently and... 

In this paper, we consider the problem of computing the visibility of a query point inside polygons with holes. The goal is to perform this computation efficiently per query considering the cost of the preprocessing phase. Our algorithm is based on solutions in [A.L.P. Bose, J.I. Munro, Efficient visibility queries in simple polygons, Computational Geometry: Theory and Applications 23 (3) (2002) 313-335] and [M.T.B. Aronov, L. Guibas, L. Zhang, Visibility queries and maintenance in simple polygons, Discrete and Computational Geometry 27 (4) (2002) 461-483] proposed for simple polygons. In our solution, the preprocessing is done in time O( n3logn) to construct a data structure of size O( n3).... 

In this paper, we consider the problem of computing the visibility of a query point inside polygons with holes. The goal is to perform this computation efficiently per query with more cost in the preprocessing phase. Our algorithm is based on solutions in [13] and [2] proposed for simple polygons. In our solution, the preprocessing is done in time O(n3 log(n)) to construct a data structure of size O(n3). It is then possible to report the visibility polygon of any query point q in time O((1 + h′) log n + |V(q)|), in which n and h are the number of the vertices and holes of the polygon respectively, |V(q)| is the size of the visibility polygon of q, and h′ is an output and preprocessing... 

Fuzzy Control of rowing exercise using Functional Electrical Stimulation (FES) concerns ankle, knee and hip joints. Muscular Modeling for each joint may contain two groups of muscles, namely extension and flexion. In the proposed method, joint controllers provide electrical stimulation pulses to the appropriate muscle group based on the trajectory error and according to a prescribed pattern designed for rowing exercise. Results indicate that the simulated Fuzzy control of desired angles closely match the experimental values for prescribed joints. Moreover, the robustness of the controller in presence of external disturbance is examined and the results show that the tracking of each joint... 

Microgrid (MG) protection is one of the main challenges in proliferation of microgrids. Due to limited fault current feeding of inverter-based distributed generations (DGs), in islanded operation of MG, protection problems become more complicated; and, therefore, conventional protection strategies cannot be applied. Hence, new protection methods that are applicable in islanded and grid-connected modes of operation are necessary. In this paper, a comprehensive digital-relay based protection is introduced for the protection of MGs. The proposed method includes protection of lines, distributed generations, and the point of common coupling. The structure and graphical schematic of the proposed... 

Graph signal processing is an emerging field in which traditional signal processing tools from regular Euclidean domain are adapted for use in irregular domains such as graphs. This paper demonstrates how graph signal processing can be used as an efficient tool to solve an optical resource allocation problem, particularly the routing and wavelength assignment problem, where a reduction of 25% in blocking probability can be achieved compared to the conventional counterpart schemes. © 2024 IEEE  

Measuring the coupling of single neuron's spiking activities to the local field potentials (LFPs) is a method to investigate neuronal synchronization. The most important synchronization measures are phase locking value (PLV), spike field coherence (SFC), pairwise phase consistency (PPC), and spike-triggered correlation matrix synchronization (SCMS). Synchronization is generally quantified using the PLV and SFC. PLV and SFC methods are either biased on the spike rates or the number of trials. To resolve these problems the PPC measure has been introduced. However, there are some shortcomings associated with the PPC measure which is unbiased only for very high spike rates. However evaluating... 

Solar heating and cooling technologies can have a vital role to play in understanding the targets in energy security, economic development, and mitigating climate change. This study aimed to investigate the performance of the combined solar cooling/heating system using a Photovoltaic Thermal collector (PVT) for residential applications. The main advantage of using PVT is the conversion of the maximum amount of solar energy into electricity and thermal energy. In this work, water is used to cool the panel and, consequently, increase the efficiency. The cooling cycle comprises a hybrid ejector-compression refrigeration cycle with two evaporator temperatures. To reduce the effect of the global... 

For a set of n disjoint line segments S in R2, the visibility testing problem (VTP) is to test whether the query point p sees a query segment s∈S. For this configuration, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from any query point p can be computed quickly. In this paper, we solve VTP in expected logarithmic query time using quadratic preprocessing time and space. Moreover, we propose a (1+δ)-approximation algorithm for VCP using at most quadratic preprocessing time and space. The query time of this method is Oε (1/δ 2√n) where Oε (f(n))=O(f(n)nε) and ε>0 is an arbitrary constant number  

Geostatistical methods are grouped in two main divisions: univariate and multivariate. When there is adequate amount of primary data, univariate methods such as kriging and SGS give a good representation of property distribution in the reservoir, but practical difficulties appear when there is no sufficient data. In such a case it is necessary to choose multivariate geostatistical methods in which some covariables are contributed to model the primary variable. Multivariate geostatistics is a broad term that encompasses all geostatistical methods that utilize more than one variable to predict some physical property of the earth. Bivariate geostatistics is obviously the simplest subset of the... 

In this paper, we consider the restricted version of the well-known 2D line simplification problem under area measures and for restricted version. We first propose a unified definition for both of sum-area and difference-area measures that can be used on a general path of n vertices. The optimal simplification runs in O(n 3) under both of these measures. Under sum-area measure and for a realistic input path, we propose an approximation algorithm of O n2 time complexity to find a simplification of the input path, where is the absolute error of this algorithm compared to the optimal solution. Furthermore, for difference-area measure, we present an algorithm that finds the optimal... 

A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose projection on the XY-plane is a triangulation. The visibility graph of a TIN is a graph whose vertices correspond to the vertices of the TIN and there is an edge between two vertices if their corresponding vertices on TIN see each other, i.e. the segment that connects these vertices completely lies above the TIN. Computing the visibility graph of a TIN and its properties have been considered thoroughly in the literature. In this paper, we consider this... 

Due to the limitations of two-dimensional models in mimicking intratumoral drug delivery, three-dimensional tumor spheroid-on-chip models have been considered recently. Even though various models have been proposed in this field, many unknowns still exist about their reliability in imitating in vivo conditions. In addition, most of these models neglect the replication of drug transport from the bloodstream. In the current research, considering the interface of tumor and blood vessels, new designs of microfluidic devices are developed to resemble the in vivo conditions more closely. Then, drug transport in the proposed models is studied numerically using porous media theory under dynamic...