Dynamic reconfiguration of telecommunication networks
- Authors: Dzalilov, Zari , Ouveysi, Iradj , Rubinov, Alex
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the Industrial Optimisation 2003 Conference, Perth : 30th October, 2002
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000451
Abstract convexity of positive homogenous functions
- Authors: Rubinov, Alex , Dzalilov, Zari
- Date: 2002
- Type: Text , Journal article
- Relation: Journal of Statistics and Management Systems Vol. 5, no. 1 (2002), p. 1-19
- Full Text:
- Reviewed:
- Description: This paper is a survey of recent results to abstract convexity of positively homogeneous functions, that is, to a representation of such functions as the upper (lower) envelope of sets of fairly simple functions. In particular, we study sup-min and max-min representations of positively homogeneous of degree one functions through linear functions and various kinds of the so-called exhausters.
- Description: C1
- Description: 2003003353
Application of optimisation-based data mining techniques to medical data sets: A comparative analysis
- Authors: Dzalilov, Zari , Bagirov, Adil , Mammadov, Musa
- Date: 2012
- Type: Text , Conference paper
- Relation: IMMM 2102: The Second International Conference on Advances in Information Mining and Management p. 41-46
- Full Text: false
- Reviewed:
- Description: Abstract - Computational methods have become an important tool in the analysis of medical data sets. In this paper, we apply three optimisation-based data mining methods to the following data sets: (i) a cystic fibrosis data set and (ii) a tobacco control data set. Three algorithms used in the analysis of these data sets include: the modified linear least square fit, an optimization based heuristic algorithm for feature selection and an optimization based clustering algorithm. All these methods explore the relationship between features and classes, with the aim of determining contribution of specific features to the class outcome. However, the three algorithms are based on completely different approaches. We apply these methods to solve feature selection and classification problems. We also present comparative analysis of the algorithms using computational results. Results obtained confirm that these algorithms may be effectively applied to the analysis of other (bio)medical data sets
Challenging issues in dynamic reconfiguration of telecommunication networks
- Authors: Dzalilov, Zari , Ouveysi, Iradj
- Date: 2008
- Type: Text , Conference paper
- Relation: Paper presented at Second International Conference: Problems of Cybernetics and Informatics, PCI 2008, Baku, Azerbaijan : 10th-12th September 2008 p. 48-51
- Full Text:
- Description: For the last quarter of a century understanding of the nature of telecommunication network traffic has been considered as an important research topic. Any well-designed recovery strategy has to take into account the different resilience requirements of the single traffic flows in order to avoid excessive usage of bandwidth for standby links. Here we discuss the issues of a reconfiguration procedure in order to perform network recovery in the case of any failure scenario in the telecommunication networks. We explain the complexities arising in the real life application and propose an optimization technique in order to minimize the size of the optimization problem in the process of reconfiguration. Our suggestion to achieve this is to find the minimal sub-graph surrounding the failure region that contains the required unused capacity to perform network recovery task.
- Description: 2003006857