Sharif Digital Repository

A Mobile Ad hoc NETwork (MANET) is a self-configuring network that is formed automatically by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. In recent years, the use of MANETs has been widespread in many applications, including some mission critical applications, and as such security has become one of the major concerns in MANETs. Due to some unique characteristics of MANETs, prevention methods alone are not sufficient to make them secure; therefore, detection should be added as another defense before an attacker can breach the system. In this thesis, we have expressed some well-known and related intrusion detection systems. Besides we have... 

During recent decades, dramatic advances in Genetics and Molecular Biology, has provided scientists with enormous amounts of molecular genomic information of different living organisms, from DNA sequences to complex 3d structures of proteins. This information is raw data which their analysis can provide better understanding of genome mechanisms, discriminating healthy and tumor cells, predicting disease type, making drugs based on genome information, and many more applications. Here, one important issue is the inevitable use of computer science and statistics to analyze these data; such that according to the vast amount of data, would provide intelligent methods, which yield most accurate... 

Data Stream is a sequence of continuous data which in recent years, its management and processing is widely introduced in different research areas of computer science such as distributed systems. Although clustering single data stream systems have many usages, the emergence of systems and applications that their main equirement is clustering of multiple data stream that increases rapidly and reveals the need for further research in this area.Sources that are generating data stream have limited memory and processing power.On the other hand, we need information about the entire data stream and require that the information sends to a central site to produce the final result of data mining. As a... 

Due to popularity of mobile wireless devices, security of mobile ad hoc networks (MANETs) being more important than before. Traditional key management schemes based on symmetric key cryptography are became ineffective because of dynamic and infrastructureless nature of these networks.Recent studies are mainly based on traditional public key cryptography schemes and ID-based cryptography schemes. On the other hand, Contributory schemes seem suitable for MANETs because of their inherent self-organize property. Key update and Key revocation are the fundamental issues of key management schemes in mobile ad hoc networks. Certificateless public key cryptography, in addition to solve those issues,... 

Energy constraint is the most critical problem in wireless sensor networks (WSNs). To address this issue, clustering has been introduced as an efficient way for data aggregation and routing. However, there also exist some disadvantages associated with the clustering scheme, such as additional overheads during the cluster-head election and cluster formation process. Most available clustering algorithms do not efficiently take into consideration the geographical information of nodes in the cluster-head election. This leads to uneven distribution of cluster-heads and unbalanced cluster sizes, which brings about uneven energy dissipation in clusters. In this research, an Efficient Distributed... 

This thesis is concerned with studying several aspects of the generalized isoperimetric problems on weighted graphs. In this regard, as a generalization of well-known Cheeger constant, we define k-th isoperimetric constant as the minimum of normalized outgoing flow over all k-subpartitions (disjoint subsets) of the vertex set. Also, we investigate basic properties of these parameters and particularly we prove a Federer-Fleming-type theorem. We then introduce a generalized Cheeger conjecture which is a generalization of celebrated Cheeger inequality and relates defined isoperimetric constants to higher eigenvalues of Laplace operator. In order to find a partial proof for this conjecture, we... 

Value-at-Risk (VaR) is the most commontool for risk management. This tool is used to measure market risk and also used as a basis in determining financial standards for international financial institutions. VaR is the maximum loss of the asset portfolio at the specified confidence level and certain time horizon. Many parametric, nonparametric and semi parametric methods have been invented for VaR estimation. Each one of these methods has its advantages and disadvantages and different methods may perform better in differnet situations.When estimating VaR, we can choose one of these methods or we can combine the VaRs estimated by different methods. There are few researches conducted on VaR... 

Water demand forecasting and modeling is very important and needful in water resource planning and management as well as water consumption forecasting. The forecasting helps the managers to design and operate various infrastructures of water supply such as tanks and other distribution equipments. Nowadays, intelligent systems are very efficient and practical tools because of their high ability in forecasting and independency from limitative assumptions in classic methods. In this thesis, one of the newest methods, called support vector regression method, is used to forecast monthly demands of water consumption in Tehran, Iran. To develop the method, data is first preprocessed through... 

Wireless sensor network is composed of a large number of sensor nodes which are densely deployed to monitor the environment and collect information from physical events. There are different modelsfor sending collected data to users; one of them is query-driven models, in which according to user interest and via declarative queries collected data is delivered. Wireless sensor networks are energy constrained; regarding this issue, it is necessary to have an energy efficient design. Data aggregation or in network processing is one existing solution to reduce energy consumption. Data correlation or redundancy is also can be used with this method to save energy even more. In this thesis, an... 

The problem of partitioning vertices of a graph has been studied with different formulations according to their application. In this thesis we try to review some of these formulations and existing algorithms. In addition we try to investigate the correct definition for a specific application in image processing, namely image segmentation. At the end, we propose a new algorithm for partitioning vertices of a weighted graph according to the mentioned application and compare its performance with some similar algorithms  

An ontology is a formal description of a domain by definition a set of concepts and the relationships between those concepts. Ontologies defined by different applications usually describe their domains in different terminologies,even when they cover the same domain. Thus, we need to resolve the semantic heterogeneities problem and align terms in different ontologies. Ontology alignment plays the central role in these areas to identify correspondences among elements of two or more ontologies. It should be noted that,finding an optimize mapping between two ontologies with respect to search space is an NP-hard [6] problem.
In This thesis we focused on large ontologies and alignment among... 

In order to manage a complex system, one way is to divide it into smaller parts. That’s the reason airspace in each country should be divided into sectors. Currently, these sectors have fixed areas and each is controlled by a number of air traffic controllers. However, the traffic crossing these sectors is considerably dynamic, which means the traffic density and its distribution varies seasonally, weakly and even through the 24 hours of a day. Moreover, weather conditions and security and military issues make constraints to some of these sectors. This sometimes results in some high traffic sectors while some others have very low traffic density which causes two main problems. One is that,... 

Transportation problem is one of the most important parts in supply chain management and it offers great potential to reduce costs and improve service quality. So many research efforts, are considering the optimization of the transportation systems and its related aspects. In this thesis, a transportation system according to a real case study, with the aim of minimizing total cost is considered. It is assumed a fleet of vehicles with limited capacity and different fixed and variable costs are shipping different products from a manufacturing plant to their associated nationwide distribution storages. Certain number of storages or depots with deterministic demand is available and each has a... 

Semi-structured documents are a new type of textual documents which has gained a lot of attention nowadays to itself. A specific document modeling for boosting classifiers is needed more than ever which reflects major document specifications. The main goal of this thesis is presenting new adaptive model based on semi-structured documents features. We also aim to use some problem solving approaches such as Statistical approach, Machine Learning and few Algorithmic solutions. In some cases 10% precision optimization can be seen compare to the best approaches available nowadays  

Graph partitioning, or graph clustering, is an essential researa problem in many areas. In this thesis, we focus on the partitioning problem of unweighted undirected graph, that is, graphs for which the weight of all edges is 1. We will investigate spectral methods for solving the graph partitioning and we compare them. In addition to theoretical analysis,We also implement some of spectral algorithms in matlab and apply them on standard graph data sets. Finally, the experimental
results obtained are offering  

In recent years, base station coordination (also known as network MIMO) has been analyzed as a means of handling inter cell interference. In principle, all base stations might share their CSI and data through backhaul links. Unfortunately, the demands on backhaul capacity and computational power scale rapidly with the number of cells, which makes this approach unsuitable for practical systems. And these problems shift the researches to find ways for turning this idea to an idea that can be used in practical systems. One of the major changes to this idea can be dealing with local CSIT that there would be no need to exchanging CSIT among BSs. The other change that can make the idea to a more... 

Intercellular coordination is a technique to mitigate intercell interference. In this technique, base stations of different cells coordinate with each other to send data for all users, so each user is serviced by several base stations. Nowadays, with the increasing use of wireless networks, the design of these networks is very important. Most problems in the design of wireless networks are due to limitations such as: interference, the lack of bandwidth and changes of channel. Using all channels in each cell is a suggested method to use the bandwidths efficiently; however it increases intercell interferences hence a method to control interference is needed. Coping with interference can be... 

In distributed systems, a huge amount of data is dispersed among different nodes; centralization of this data is infeasible due to communication and storage costs. In addition, Databases with high dimensional data objects are becoming more prevalent is many areas. When the dimensionality increases, the volume of the space increases so fast that the available data becomes sparse. This sparsity is problematic from many aspects. In order to obtain a statistically sound and reliable result, the amount of data needed to support the result often grows exponentially with the dimensionality. Also organizing and searching data often relies on detecting areas where objects form groups with similar... 

Recently, data stream has been popular in many contexts like click sequences in web pages, obtained data from sensor networks and satellite data. A data stream is an ordered list of points that should be used once. Clustering of these kinds of data is one of the most difficult issues in data mining. Due to the high amount of data, the traditional clustering algorithms are not suitable for this family of problems. Many data stream clustering algorithms have been proposed in recent years considered the scalability (largeness) of data, but most of them didn’t attend to the following issues. •The quality of clustering can be bad over the time. •Some of the algorithms cannot handle arbitrary... 

In this thesis, we study the following question stating that “how well a tree structure can approximate the clustering structure of a graph”.To do this, we first focus on the DJS algorithm proposed by Daneshgar et.al. and second we consider the minimum distortion tree approximation algorithm proposed by Abraham et.al.We conclude, using some experimental results, that the minimum spanning tree algorithm extracts some geometric aspects of the data set that the Abraham et.al. algorithm can not track