Yusef Reazaee; Mohammad Reza Mobasheri
Abstract
Due to the effect of aerosols present in the atmosphere on the satellite images, the study of the effect of local aerosols distribution on the satellite images is important. On the other hand, the study shows that the effect of aerosols on the greenhouse gases and consequently on climate is also undeniable ...
Read More
Due to the effect of aerosols present in the atmosphere on the satellite images, the study of the effect of local aerosols distribution on the satellite images is important. On the other hand, the study shows that the effect of aerosols on the greenhouse gases and consequently on climate is also undeniable and as a result, this puts more emphasize on the necessity of this study. Lack of information about modality of distribution of the aerosols in the atmosphere, brings uncertainties in the extraction of decent information from satellite images. Different methods of aerosol retrieval over the ocean have been deployed using AVHRR/NOAA image products. Over the continent, however due to the fact that the surface albedo is generally unknown and varies with time and wavelength, nothing much has so far been done and what is done is for desert dusts only. Some retrieval algorithms are developed based on the assumption of low reflectance of vegetation canopies in the blue and red portion of the electromagnetic spectra. Also few algorithms have been developed for multi-temporal studies based on constant surface reflectance. Application of all of these algorithms is tedious and very time consuming. On the other hand we need to extract decent information on a real time basis and this arises the need for an algorithm that can be performed as fast as possible and this was the objective of this study. The algorithm used for aerosol detection in this study is innovated using a combination of aerosol information model and optical thickness parameter calculated using visible and IR bands. In this study using Optical Thickness which is a measure of the amount of aerosols in the atmosphere, a fast method for relative correction of the satellite images is presented. In this method, surface reflectance in MIR is calculated from which, dark pixels are determined. Using surface reflectance of these dark pixels in red and blue, optical thicknesses are estimated. Finally using these calculated optical thicknesses, the effects of atmospheric aerosols has been removed from satellite imageries. The results show that in visible bands of MODIS where the effect of aerosols are more serious, the computed optical thickness can be used to estimate the effect of aerosols and help to eliminate its effects from images.
Soda Dehkhoda; Hoseein Memarian; Abolfazl Mihan Rad
Roozbeh Shad; Mohammad Sa'di Mesgari
Abstract
Nowadays, geospatial information systems (GIS) are widely used to solve different spatial problems based on various types of fundamental data: spatial, temporal, attribute and topological relations. Topological relations are the most important part of GIS which distinguish it from the other kinds of ...
Read More
Nowadays, geospatial information systems (GIS) are widely used to solve different spatial problems based on various types of fundamental data: spatial, temporal, attribute and topological relations. Topological relations are the most important part of GIS which distinguish it from the other kinds of information technologies. One of the important mechanisms for representing topological relations between spatial objects is spatial topology. These mechanisms help users to model spatial analysis on the objects simply and efficiently. Topological relations which used for the analysis are influenced by uncertain resources such as: inaccuracy and error of measurements, vagueness to describe information, incompleteness, inconsistency and impreciseness. Then, the fuzzy set theory as an ideal tool can help to handle these uncertain resources in the topological relations. Our methodology relies on the 3D fuzzy 9-intersection, which is a generalization of the crisp 9-intersection of Egenhofer and co-workers. The similarity between the 3D fuzzy and the crisp 9-intersection enables the decision variables, to be derived. The decision variable includes a semantic part and a quantifier. Since determination of the decision variable depends on the definition of the boundary of the fuzzy regions, we try to present a useful method for computing fuzzy boundaries. For this purpose each point of a Fuzzy region has partial membership degree to Interior, Boundary and Exterior set of a region. In order to derive the topological relations between fuzzy spatial objects, the 9-intersection approach is updated into the 3*3-intersection approach in the crisp fuzzy topological space. The topological relations between simple fuzzy regions can be identified based on the topological invariants in the intersections of the matrices. With respect to this, we try to check and complete our information about how we can define 3D fuzzy topological relations between spatial objects and propose an efficient method for simulating relationships and extracting decision variables. This subject is applied for the application of "determining risk areas of Kuwait oil well air pollutions plumes on the southwestern forest areas of Iran". For this purpose, decision variables are extracted based on 3D fuzzy topological relations between air pollution plumes and a forest area, then, reasoned using defined proper rules in the knowledge base part of a spatial reasoning system. When smoke plumes move toward a forest area: data extractor extracts the smokes fuzzy areas form remote sensing satellite images, and topological simulator computes the strength and type of topological relationships and sends the extracted information to a designed knowledge based system. The final results show 20% improvement in reasoning results by adding inclusion index and 3D topological rations to the knowledge part of designed system.
Mahmoud Saffarzadeh; Vahid Abolhassan Nejad; Amin Mirza Boroujerdian
Abstract
One of the most important and effective factors in prioritizing high accident prone segments of roads for pedestrians is accident cause which up to now has been neglected in current methods. Since accidents are not additives due to various reasons, prioritizing these segments without considering the ...
Read More
One of the most important and effective factors in prioritizing high accident prone segments of roads for pedestrians is accident cause which up to now has been neglected in current methods. Since accidents are not additives due to various reasons, prioritizing these segments without considering the accident cause makes the selection of high accident prone segments inaccurate. In this paper, by introducing the "Cause prioritizing model", a new model was developed in order to rank high accident prone segments for pedestrians with regard to accident cause in rural roads. In this method, by taking the accident frequency, accident severity and accident cause parameters are accounted and using one of the Multi Attribute Decision Making methods, the mentioned segments are prioritized. Using the model developed in this research will increase the accuracy and utility of high accident prone segments prioritizing process for pedestrians to a great extent.
Reza Kazemi; Seyyed Esma'eel Mahmoudi Larimi
Abstract
Control Systems such as Anti Lock Brake Systems (ABS) and Traction Control Systems (TCS) are vastly used in most vehicles as to enhance the safety of the systems. These systems have many virtues on controlling the dynamics of vehicles, but they only control the longitudinal dynamics of the vehicle directly ...
Read More
Control Systems such as Anti Lock Brake Systems (ABS) and Traction Control Systems (TCS) are vastly used in most vehicles as to enhance the safety of the systems. These systems have many virtues on controlling the dynamics of vehicles, but they only control the longitudinal dynamics of the vehicle directly and the lateral dynamics of vehicle is not controlled because they do not receive any feedback from the lateral dynamics parameters. Therefore they cannot recognize the critical situations. In the preceding essay, by implementing the rotational velocity sensors and lateral accelerometers in addition to the ABS sensors, a developed control system is designed in which lateral motion is controlled in addition to the longitudinal motion. In order to derive the control laws and measuring system's indefinite parameters, a 7-DOF model was used. The designed control system has two layers, which the upper layer is based on PID and the lower layer was designed upon the Sliding Mode Control (SMC). For measuring parameters, the least square with exponential forgetting was used. In order to verify the control system a 14-DOF model with a nonlinear tire model was used.
Morteza Ahmadi; Behrouz Samandari
Mohammad Tavakkoli Bina; Mehdi Sirjani; Danyal Ahmadi
Abstract
Upgrading the voltage level of a transmission line is named as one solution to increase the transmitted power. This paper introduces the results of a research project in which the upgrade of Saravan-Sooran double circuit transmission system from 63 kV to 230 kV is studied. In this context, the towers ...
Read More
Upgrading the voltage level of a transmission line is named as one solution to increase the transmitted power. This paper introduces the results of a research project in which the upgrade of Saravan-Sooran double circuit transmission system from 63 kV to 230 kV is studied. In this context, the towers remain in their current locations, where the new structure of towers and insulators as well as the conductors are presented using the weather condition in Sistan-Baloochestan province. Four designs are presented as alternatives of the available design, considering the economical analysis of the transmission system. The finalized chosen design satisfies significant savings for the system, while providing both right-of-way and required standards.
Sa'eed Jalili; Ali Akbar Sadri
Abstract
Nowadays, the automated text classification has witnessed special importance due to the increasing availability of documents in digital form and ensuing need to organize them. Although this problem is in the Information Retrieval (IR) field, the dominant approach is based on machine learning techniques. ...
Read More
Nowadays, the automated text classification has witnessed special importance due to the increasing availability of documents in digital form and ensuing need to organize them. Although this problem is in the Information Retrieval (IR) field, the dominant approach is based on machine learning techniques. Approaches based on classifier committees have shown a better performance than the others. In this research, in addition to study text classification techniques and classification committees, two ideas in this field are proposed.
The first idea, is proposed based on Bagging committees. According to this idea, first, a training set by one of clustering techniques automatically is divided into several clusters based on class similarity (or dissimilarity). So for documents of every cluster, a classifier is trained and put in the committee as a member. In this approach the members of committee are created by the same technique. In our experiments for this idea, Naïve Bayesian, Rocchio and SVM learning techniques are used.
In the second idea, the creation of two layered committee is discussed. Based on this idea, one committee can be created that its members are itself a committee. Members of subcommittees are creating based on the first idea. This idea is based on the fact that if Naïve Bayesian committee acts better than Naïve Bayesian classifier and so, a committee out of these committees will improve the performance of classification.
Evaluation of the first idea showed that the improvement in performance based on precision and recall in Naïve Bayesian committee is exceeded the other committees (respectively 12 and 5.1 percent). Evaluation of the second idea showed that the improvement in performance in the second type of committee (based on the second idea) is more than that in the first type of committee (based on the first idea). Most improvement of performance in the second type of committee is referred to the Rocchio’s committee (based on precision and recall 3.8 and 18.8 percent, respectively).
Paria Afsharchi; Ali Asghar Mirghasemi
Abstract
Tailings dams, due to methods and materials used in their construction are vulnerable structures to earthquake. In many cases storage of water over tailings is required to prevent aerial pollution or reduction in water consumption by the means of a recycling system, therefore failure of these kinds of ...
Read More
Tailings dams, due to methods and materials used in their construction are vulnerable structures to earthquake. In many cases storage of water over tailings is required to prevent aerial pollution or reduction in water consumption by the means of a recycling system, therefore failure of these kinds of dams not only induce affects similar to conventional water dams, but also may lead to irreversible damage to their surrounding environment due to toxic content of tailings. Sarcheshmeh Tailings dam, a rockfill dam with an inclined clay core, is 70 m height and necessity for increasing reservoir capacity has led to dam upgrading to a minimum level of 90 m; using downstream method. Different options have been studied in order to get the safest and most economical alternative. Vulnerability of dam site to earthquake has considerably affected the design issue. This paper represents the results of dynamic and pseudo-static analyses of this tailings dam. Dynamic analysis is carried out using the finite difference code FLAC (Fast Lagrangian Analysis of Continua, ITASCA).This code is able to take into account pore water pressure generation during construction and earthquake. Different acceleration time history records and soil models are used and results have been compared.
Babak Poursartip; Vahid Lotfi
Mehdi Abadi; Sa'eed Jalili
Abstract
In this paper, we propose an approach for automatic generation of novel intrusion signatures. This approach can be used in the signature-based Network Intrusion Detection Systems (NIDSs) and for the automation of the process of intrusion detection in these systems. In the proposed approach, first, by ...
Read More
In this paper, we propose an approach for automatic generation of novel intrusion signatures. This approach can be used in the signature-based Network Intrusion Detection Systems (NIDSs) and for the automation of the process of intrusion detection in these systems. In the proposed approach, first, by using several one-class classifiers, the profile of the normal network traffic is established. Then, in the detection phase, any traffic that does not match with the known intrusion signatures and deviates from the established normal profile is detected as a novel intrusion. Using an inductive learning method, the signature of this novel intrusion is generated and the signature database is automatically updated. We evaluate our approach by performing experiments on the dataset provided by the DARPA Intrusion Detection Evaluation Program. The results of experiments show that our proposed approach can be successfully used for automatic generation of novel intrusion signatures.
Maghsoud Amiri; Komeyl Eshraghi; Hadi Kioumarsi; Reza Rashidi; Majid Reza Haji Abed Na'eeni
Ahmad Azari; Mojtaba Shariati Niasar; Mahmoud Alborzi; Afshin Bakhtiari
P. Jeyanthi; A. Maheswari
Zeinab Saeidi; Mohammad Farshi
Abstract
\vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $\pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $\epsilon >0$. We show how to preprocess $\pi$ and $\epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, ...
Read More
\vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $\pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $\epsilon >0$. We show how to preprocess $\pi$ and $\epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $\pi$ whose Fr{\'e}chet and Hausdorff distance to the horizontal query segment $Q$ is at most some threshold value $\epsilon$. We present a data structure for this query that needs $\mathcal{O}(n\log{}n)$ preprocessing time, $\mathcal{O}(n)$ space, and $\mathcal{O}(\log{} n)$ query time. & & \vspace{0.2cm}
Mohammad Kazem Besharati Givi; Mehdi Ghasemi; Seyyed Mahmoud Mousavi Mashhadi
Abstract
In this paper a special sandwich panel with a sinusoidal core under distributed load on upper and lower plates has been studied. By drawing free body diagrams, and using energy method and Castagiliano theory the forces and moments involved in the core has been determined. Then, the stresses, normal and ...
Read More
In this paper a special sandwich panel with a sinusoidal core under distributed load on upper and lower plates has been studied. By drawing free body diagrams, and using energy method and Castagiliano theory the forces and moments involved in the core has been determined. Then, the stresses, normal and horizontal displacements due to above forces and moments are calculated. In order to ensure the accuracy of the analysis, the results obtained are verified by using ANSYS software. Finally, by use of displacement as a constraint for sandwich panel, optimization is carried out for this problem by genetic algorithm and MOEA toolbox in MATLAB environment. The results obtained from optimization and other analysis show a very good agreement.
Amin Ghodousian; Sara Falahatkar
Abstract
In this paper, a type of fuzzy system is firstly investigated whereby the feasible region is defined by the fuzzy relational equalities and the geometric mean as fuzzy composition. Some related basic and theoretical properties of such fuzzy relational equations are derived and the feasible region is ...
Read More
In this paper, a type of fuzzy system is firstly investigated whereby the feasible region is defined by the fuzzy relational equalities and the geometric mean as fuzzy composition. Some related basic and theoretical properties of such fuzzy relational equations are derived and the feasible region is completely determined. Also, it is proved that the feasible solutions set can be stated by one maximum solution and a finite number of minimal solutions. Moreover, a comparison is made between this region and fuzzy relational equations defined by the product t-norm. Finally, an example is described to illustrate the differences of these two FRE systems.
Sarah Minion; Christian Barrientos
Abstract
A graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ E(G)} consists of n integers. Inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: ...
Read More
A graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ E(G)} consists of n integers. Inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of G and K2 , and the disjoint union of G and Pm, where G is a special type of graceful graph named - graph. Moreover, the majority of the graceful labelings obtained here correspond to the most restrictive kind, they are -labelings. These labelings are in the core of this research area due to the fact that they can be used to create other types of graph labelings, almost independently of the nature of these labelings.
R. Vasuki; S. Arockiaraj; P. Sugirtha
Abstract
Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)\cup E(G)$ to $\{0, \pm 1, \pm2, \dots, \pm (\frac{p+q-1}{2})\}$ when $p+q$ is odd and from $V(G)\cup E(G)$ to $\{\pm 1, \pm 2, \dots, \pm (\frac{p+q}{2})\}$ ...
Read More
Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)\cup E(G)$ to $\{0, \pm 1, \pm2, \dots, \pm (\frac{p+q-1}{2})\}$ when $p+q$ is odd and from $V(G)\cup E(G)$ to $\{\pm 1, \pm 2, \dots, \pm (\frac{p+q}{2})\}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {\it super pair sum graph}. Here we study about the super pair sum labeling of some standard graphs.
Amin Ghodousian; shahrzad oveisi
Abstract
In this paper, a linear optimization problem is investigated whose constraints are defined with fuzzy relational inequality. These constraints are formed as the intersection of two inequality fuzzy systems and Schweizer-Sklar family of t-norms. Schweizer-Sklar family of t-norms is a parametric family ...
Read More
In this paper, a linear optimization problem is investigated whose constraints are defined with fuzzy relational inequality. These constraints are formed as the intersection of two inequality fuzzy systems and Schweizer-Sklar family of t-norms. Schweizer-Sklar family of t-norms is a parametric family of continuous t-norms, which covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. Firstly, we investigate the resolution of the feasible region of the problem and studysome theoretical results. A necessary and sufficient condition and three other necessary conditions are derived for determining the feasibility. Moreover, in order to simplify the problem, some procedures are presented. It is proved that the optimal solution of the problem is always resulted from the unique maximum solution and a minimal solution of the feasible region. A method is proposed to generate random feasible max-Schweizer-Sklar fuzzy relational inequalities and an algorithm is presented to solve the problem. Finally, an example is described to illustrate these algorithms.
Marzieh Eskandari; Zeinab Hassani
Abstract
Prediction of heart disease is very important because it is one of the causes of death around the world. Moreover, heart disease prediction in the early stage plays a main role in the treatment and recovery disease and reduces costs of diagnosis disease and side effects it. Machine learning algorithms ...
Read More
Prediction of heart disease is very important because it is one of the causes of death around the world. Moreover, heart disease prediction in the early stage plays a main role in the treatment and recovery disease and reduces costs of diagnosis disease and side effects it. Machine learning algorithms are able to identify an effective pattern for diagnosis and treatment of the disease and identify effective factors in the disease. this paper is investigated a new hybrid algorithm of Whale Optimization and Dragonfly algorithm using a machine learning algorithm. the hybrid algorithm employs a Support Vector Machine algorithm for effective Prediction of heart disease. Proposed method is evaluated by Cleveland standard heart disease dataset. The experimental result indicates that the SVM accuracy of 88.89 $\%$ and nine features are selected in this respect.
R. Ponraj; K. Annathurai; R. Kala
Abstract
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)\rightarrow \{1,2,...,p\}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)\geq ...
Read More
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)\rightarrow \{1,2,...,p\}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)\geq f(v)$ or $f(v)\geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $\left| e_{f}(0) - e_f(1) \right|\leq 1$ where $e_{f}(0)$ and $e_{f}(1)$ respectively denote the number of edges labelled with even integers and odd integers. A graph $G$ with a remainder cordial labeling is called a remainder cordial graph. We investigate the remainder cordial behavior of path, cycle, star, bistar, crown, comb, wheel, complete bipartite $K_{2,n}$ graph. Finally we propose a conjecture on complete graph $K_{n}$.
R. Jamunarani; P. Jeyanthi; T. Noiri
Abstract
Avila and Molina [1] introduced the notion of generalized weak structures which naturally generalize minimal structures, generalized topologies and weak structures and the structures α (g),π(g),σ(g) and β (g). This work is a further investigation of generalized weak structures due ...
Read More
Avila and Molina [1] introduced the notion of generalized weak structures which naturally generalize minimal structures, generalized topologies and weak structures and the structures α (g),π(g),σ(g) and β (g). This work is a further investigation of generalized weak structures due to Avila and Molina. Further we introduce the structures ro(g) and rc(g) and study the properties of the structures ro(g), rc(g), and also further properties of α (g),π(g),σ(g) and β (g) due to [1].
P. Jeyanthi; A. Maheswari; M. Vijayalakshmi
Abstract
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A ...
Read More
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the induced edge labels are 1, 2, 3, . . . , q. In this paper, we prove that DA(Tn)⊙K1, DA(Tn)⊙2K1(DA(Tn) denote double alternate triangular snake) and DA(Qn) ⊙ K1, DA(Qn) ⊙ 2K1(DA(Qn) denote double alternate quadrilateral snake) are vertex equitable graphs.
Mohsen Arab; Mahdieh Hasheminezhad
Abstract
Community detection has a wide variety of applications in different fields such as data mining, social network analysis and so on. Label Propagation Algorithm (LPA) is a simple and fast community detection algorithm, but it has low accuracy. There have been presented some advanced versions ...
Read More
Community detection has a wide variety of applications in different fields such as data mining, social network analysis and so on. Label Propagation Algorithm (LPA) is a simple and fast community detection algorithm, but it has low accuracy. There have been presented some advanced versions of LPA in recent years such as CenLP and WILPAS. In this paper, we present improved versions of CenLP and WILPAS methods called CenLP+ and WILPAS+ respectively. Experiments and benchmarks demonstrate that while CenLP+ is as fast as CenLP, it outperforms CenLP on both synthetic and real-world networks. Moreover, while accuracy of WILPAS+ on synthetic networks comparable with that of WILPAS, on real-world networks, WILPAS+ excels WILPAS. In addition, whereas both presented methods CenLP+ and WILPAS+ show high accuracy on synthetic networks, on real-world networks they outperform remarkably all other tested label propagation based algorithms for community detection. Therefore, since CenLP+ and WILPAS+ are both fast and accurate, specially on real-world networks, they can efficiently reveal community structures of mega-scale social networks.
