Your selections:

18Rubinov, Alex
15Bagirov, Adil
9Miller, Mirka
9Wu, Zhiyou
6Ugon, Julien
5Gao, David
5Khandelwal, Manoj
4Mammadov, Musa
4Ryan, Joe
3Bai, Fusheng
3Kelarev, Andrei
3Lin, Yuqing
3Pineda-Villavicencio, Guillermo
3Ting, Kaiming
3Weber, Gerhard-Wilhelm
3Yang, Xiao
3Yearwood, John
2Ahmed, S. T.
2Al Nuaimat, Alia
2Balbuena, Camino

Show More

Show Less

320102 Applied Mathematics
260103 Numerical and Computational Mathematics
110801 Artificial Intelligence and Image Processing
70101 Pure Mathematics
7Global optimization
6Nonsmooth optimization
6Optimisation
6Problem solving
5Optimization
40806 Information Systems
4Cluster analysis
4Data mining
4Numerical methods
31702 Cognitive Science
3Constrained optimization
3Constraint theory
3DC programming
3Global optimisation
3Nonconvex optimization

Show More

Show Less

Hybrid simulated annealing and genetic algorithm for degree/diameter problem

- Tang, Jianmin, Miller, Mirka, Lin, Yuqing

**Authors:**Tang, Jianmin , Miller, Mirka , Lin, Yuqing**Date:**2005**Type:**Text , Conference paper**Relation:**Paper pesented at Sixteenth Australasian Workshop on Combinatorial Algorithms, AWOCA 2005, Ballarat, Victoria : 18th-21st September 2005 p. 321-331**Full Text:**false**Description:**The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This paper deals with directed graphs. General upper bounds, called Moore bounds, exist for the largest possible order of such digraphs of maximum degree d and diameter k. It is known that simulated annealing and genetic algorithm are effective techniques to identify global optimization solutions. This paper describes our attempt to build a Hybrid Simulated Annealing and Genetic Algorithm (HSAGA) that can be used to construct larger digraphs, and displays our preliminary results obtained by HSAGA.**Description:**2003001438

A global optimization method for solving integer systems of equation

- Bai, Fusheng, Wu, Zhiyou, Yang, Y. J., Mammadov, Musa

**Authors:**Bai, Fusheng , Wu, Zhiyou , Yang, Y. J. , Mammadov, Musa**Date:**2007**Type:**Text , Conference paper**Relation:**Paper presented at 7th International Conference on Optimization: Techniques and Applications, ICOTA7, Kobe International Conference Center, Japan : 12th-15th December 2007**Full Text:**false**Description:**2003005717

An auxiliary function method for systems of nonlinear equations

- Wu, Zhiyou, Bai, Fusheng, Mammadov, Musa, Yang, Y. J.

**Authors:**Wu, Zhiyou , Bai, Fusheng , Mammadov, Musa , Yang, Y. J.**Date:**2007**Type:**Text , Conference paper**Relation:**Paper presented at 7th International Conference on Optimization: Techniques and Applications, ICOTA7, Kobe International Conference Center, Japan : 12th-15th December 2007**Full Text:**false**Description:**2003005705

- Khandelwal, Manoj, Marto, Aminaton, Fatemi, Seyed, Ghoroqi, Mahyar, Armaghani, Danial, Singh, Trilok, Tabrizi, Omid

**Authors:**Khandelwal, Manoj , Marto, Aminaton , Fatemi, Seyed , Ghoroqi, Mahyar , Armaghani, Danial , Singh, Trilok , Tabrizi, Omid**Date:**2018**Type:**Text , Journal article**Relation:**Engineering with Computers Vol. 34, no. 2 (2018), p. 307-317**Full Text:**false**Reviewed:****Description:**Shear strength parameters such as cohesion are the most significant rock parameters which can be utilized for initial design of some geotechnical engineering applications. In this study, evaluation and prediction of rock material cohesion is presented using different approaches i.e., simple and multiple regression, artificial neural network (ANN) and genetic algorithm (GA)-ANN. For this purpose, a database including three model inputs i.e., p-wave velocity, uniaxial compressive strength and Brazilian tensile strength and one output which is cohesion of limestone samples was prepared. A meaningful relationship was found for all of the model inputs with suitable performance capacity for prediction of rock cohesion. Additionally, a high level of accuracy (coefficient of determination, R2 of 0.925) was observed developing multiple regression equation. To obtain higher performance capacity, a series of ANN and GA-ANN models were built. As a result, hybrid GA-ANN network provides higher performance for prediction of rock cohesion compared to ANN technique. GA-ANN model results (R2 = 0.976 and 0.967 for train and test) were better compared to ANN model results (R2 = 0.949 and 0.948 for train and test). Therefore, this technique is introduced as a new one in estimating cohesion of limestone samples. © 2017, Springer-Verlag London Ltd., part of Springer Nature.

New constructions of A-magic graphs using labeling matrices

- Sugeng, Kiki Ariyanti, Miller, Mirka

**Authors:**Sugeng, Kiki Ariyanti , Miller, Mirka**Date:**2008**Type:**Text , Journal article**Relation:**Journal of combinatorial mathematics and combinatorial computing Vol. 65, no. (May 2008), p. 147-151**Full Text:**false**Reviewed:**

A feature selection approach for unsupervised classification based on clustering

- Rubinov, Alex, Soukhoroukova, Nadejda, Ugon, Julien

**Authors:**Rubinov, Alex , Soukhoroukova, Nadejda , Ugon, Julien**Date:**2004**Type:**Text , Conference paper**Relation:**Paper presented at Sixth International Conference on Optimization: Techniques and Applications (ICOTA) , University of Ballarat, Ballarat, Victoria : 9th-11th December 2004**Full Text:**false**Description:**Data have been collected for many years in different scientific (industrial, medical) research groups. Very often these groups kept all the the they could collect. It is possible that the data contains a lot of noisy features which do not bring any information, but make the problem more complicated. The additional study of eliminating non-informative and selecting informative features is very important in the area of Data Mining. There are several feature selection methods which were developed for supervised classification. The area of feature selection for unsupervised classification is not so developed. In this paper we present a new feature selection approach for unsupervised classification, based on clustering and nonsmooth optimisation techniques.**Description:**2003004085

- Adly, Samir, Hantoute, Abderrahim, Thera, Michel

**Authors:**Adly, Samir , Hantoute, Abderrahim , Thera, Michel**Date:**2016**Type:**Text , Journal article**Relation:**Mathematical Programming Vol. 157, no. 2 (2016), p. 349-374**Full Text:**false**Reviewed:****Description:**The general theory of Lyapunov stability of first-order differential inclusions in Hilbert spaces has been studied by the authors in the previous paper (Adly et al. in Nonlinear Anal 75(3): 985–1008, 2012). This new contribution focuses on the case when the interior of the domain of the maximally monotone operator governing the given differential inclusion is nonempty; this includes in a natural way the finite-dimensional case. The current setting leads to simplified, more explicit criteria and permits some flexibility in the choice of the generalized subdifferentials. Some consequences of the viability of closed sets are given. Our analysis makes use of standard tools from convex and variational analysis. © 2015, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society.

On the nonexistence of graphs of diameter 2 and defect 2

- Miller, Mirka, Nguyen, Minh Hoang, Pineda-Villavicencio, Guillermo

**Authors:**Miller, Mirka , Nguyen, Minh Hoang , Pineda-Villavicencio, Guillermo**Date:**2009**Type:**Text , Journal article**Relation:**The Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 71, no. (2009), p. 5-20**Full Text:**false**Reviewed:****Description:**In 1960, Hoffman and Singleton investigated the existence of Moore graphs of diameter 2 (graphs of maximum degree d and d² + 1 vertices), and found that such graphs exist only for d = 2; 3; 7 and possibly 57. In 1980, Erdös et al., using eigenvalue analysis, showed that, with the exception of C4, there are no graphs of diameter 2, maximum degree d and d² vertices. In this paper, we show that graphs of diameter 2, maximum degree d and d² - 1 vertices do not exist for most values of d with d ≥ 6, and conjecture that they do not exist for any d ≥ 6.**Description:**2003007893

An Algorithm for BCH Codes extended with finite state automata

**Authors:**Kelarev, Andrei**Date:**2008**Type:**Text , Journal article**Relation:**Fundamenta Informaticae Vol. 84, no. 1 (2008), p. 51-60**Full Text:**false**Reviewed:****Description:**This article develops a combinatorial algorithm for a class of codes extending BCH codes and constructed with ﬁnite state automata. Our algorithm computes the largest number of errors that the extended codes can correct, and ﬁnds a generator for eachoptimal code in this class of extensions. The question of ﬁnding codes with largest possible information rates remains open.

Proceedings of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005)

- Ryan, Joe, Manyem, Prabhu, Sugeng, Kiki Ariyanti, Miller, Mirka

**Authors:**Ryan, Joe , Manyem, Prabhu , Sugeng, Kiki Ariyanti , Miller, Mirka**Date:**2005**Type:**Text , Conference proceedings**Full Text:**false

On graphs of maximum degree 3 and defect 4

- Pineda-Villavicencio, Guillermo, Miller, Mirka

**Authors:**Pineda-Villavicencio, Guillermo , Miller, Mirka**Date:**2008**Type:**Text , Journal article**Relation:**Journal of combinatorial mathematics and combinatorial computing Vol. 65, no. (May 2008), p. 25-31**Full Text:**false**Reviewed:****Description:**It is well known that apart from the Petersen graph there are no Moore graphs of degree 3. As a cubic graph must have an even number of vertices, there are no graphs of maximum degree 3 and

An optimization approach to identifying drugs responsible for adverse drug reactions

- Mammadov, Musa, Banerjee, Arunava

**Authors:**Mammadov, Musa , Banerjee, Arunava**Date:**2005**Type:**Text , Conference paper**Relation:**Paper pesented at Sixteenth Australasian Workshop on Combinatorial Algorithms, AWOCA 2005, Ballarat, Victoria : 18th-21st September 2005 p. 185-200**Full Text:**false**Description:**In this paper we develop an optimization approach for the study of Adverse Drug Reaction (ADR) problems. This approach is based on drug-reaction relationships represented in the form of a vector weights, which can be defined as a solution to some global optimization problem. Although it can be used for solving many ADR problems, we concentrate on the problem of accurate identification of drugs that are responsible for reactions that have occurred. Based on drug-reaction relationships, we formulate this problem as an optimization problem. The approach is applied to Australian Adverse Drug Reaction Advisory Committee (ADRAC) database. We take a comprehensive approach to considering all reaction classes which combines 18 SOC (System Organ Class), as well as the sub-classes of reaction classes Blood, Body, Neurological and Cardiovascular. The numerical experiments provided high accuracy in prediction of suspected drugs reported in ADRAC database.**Description:**2003001383

An algorithm for BCH codes extended with finite state automata

**Authors:**Kelarev, Andrei**Date:**2008**Type:**Text , Journal article**Relation:**Fundamenta Informaticae Vol. 84, no. 1 (2008), p. 51-60**Full Text:**false**Reviewed:****Description:**This articles develops a combinatorial algorithm for a class of codes extending BCH codes and constructed with finite state automata. Ou algorithm computes the largest number of errors that the extended codes can correct, and finds a generator for each optimal code in this class of extensions. The question of finding codes with largest possible information rates remains open.**Description:**C1

Classification on shorter featured and multi-label datasets

**Authors:**Mammadov, Musa**Date:**2007**Type:**Text , Conference paper**Relation:**Paper presented at 7th International Conference on Optimization: Techniques and Applications, ICOTA7, Kobe International Conference Center, Japan : 12th-15th December 2007**Full Text:**false**Description:**2003005711

Application of soft computing to predict blast-induced ground vibration

- Khandelwal, Manoj, Kumar, Lalit, Yellishetty, Mohan

**Authors:**Khandelwal, Manoj , Kumar, Lalit , Yellishetty, Mohan**Date:**2011**Type:**Text , Journal article**Relation:**Engineering with Computers Vol. 27, no. 2 (2011), p. 117-125**Full Text:**false**Reviewed:****Description:**In this study, an attempt has been made to evaluate and predict the blast-induced ground vibration by incorporating explosive charge per delay and distance from the blast face to the monitoring point using artificial neural network (ANN) technique. A three-layer feed-forward back-propagation neural network with 2-5-1 architecture was trained and tested using 130 experimental and monitored blast records from the surface coal mines of Singareni Collieries Company Limited, Kothagudem, Andhra Pradesh, India. Twenty new blast data sets were used for the validation and comparison of the peak particle velocity (PPV) by ANN and conventional vibration predictors. Results were compared based on coefficient of determination and mean absolute error between monitored and predicted values of PPV. © 2009 Springer-Verlag London Limited.

An open problem : (4; g)-cages with odd g <= 5 are tightly connected

- Tang, Jianmin, Balbuena, Camino, Lin, Yuqing, Miller, Mirka

**Authors:**Tang, Jianmin , Balbuena, Camino , Lin, Yuqing , Miller, Mirka**Date:**2007**Type:**Text , Conference paper**Relation:**Paper presented at Thirteenth Computing : The Australasian Theory Symposium, CATS2007, Ballarat, Victoria : January 30th-Febuary 2nd p. 141-144**Full Text:**false**Description:**Interconnection networks form an important area which has received much attention, both in theoretical research and in practice. From theoretical point of view, an interconnection network can be modelled by a graph, where the vertices of the graph represent the nodes of the network and the edges of the graph represent connections between the nodes in the network. Fault tolerance is an important performance feature when designing a network, and the connectivity of the underlying graph is one of the measures of fault tolerance for a network. A graph is connected if there is a path between any two vertices of G. We say that G is t-connected if the deletion of at least t vertices of G is required to disconnect the graph. A graph with minimum degree \delta\ is maximally connected if it is \delta\-connected. A graph is superconnected if its only minimum disconnecting sets are those induced by the neighbors of a vertex; a graph is said to be tightly superconnected if (i) any minimum disconnecting set is the set of neighbors of a single vertex; and (ii) the deletion of a minimum disconnecting set results in a graph with two components (one of which has only one vertex, another component is a connected graph). A (\delta\; g) - cage is a \delta\-regular graph with girth g and with the least possible number of vertices. In this paper we consider the problem of whether or not (4; g)-cages for g >= 5 are tightly superconnected. We present some partial results and the remaining open problems.**Description:**2003005018

Blast-induced ground vibration prediction using support vector machine

**Authors:**Khandelwal, Manoj**Date:**2011**Type:**Text , Journal article**Relation:**Engineering with Computers Vol. 27, no. 3 (2011), p. 193-200**Full Text:**false**Reviewed:****Description:**Ground vibrations induced by blasting are one of the fundamental problems in the mining industry and may cause severe damage to structures and plants nearby. Therefore, a vibration control study plays an important role in the minimization of environmental effects of blasting in mines. In this paper, an attempt has been made to predict the peak particle velocity using support vector machine (SVM) by taking into consideration of maximum charge per delay and distance between blast face to monitoring point. To investigate the suitability of this approach, the predictions by SVM have been compared with conventional vibration predictor equations. Coefficient of determination (CoD) and mean absolute error were taken as a performance measure. © 2010 Springer-Verlag London Limited.

Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems

- Zhou, Xiaojun, Gao, David, Yang, Chunhua

**Authors:**Zhou, Xiaojun , Gao, David , Yang, Chunhua**Date:**2014**Type:**Text , Journal article**Relation:**Applied Mathematics and Computation Vol. 227, no. (2014), p. 246-255**Full Text:**false**Reviewed:****Description:**This paper focuses on implementation of a general canonical primal-dual algorithm for solving a class of fourth-order polynomial minimization problems. A critical issue in the canonical duality theory has been addressed, i.e., in the case that the canonical dual problem has no interior critical point in its feasible space Sa+, a quadratic perturbation method is introduced to recover the global solution through a primal-dual iterative approach, and a gradient-based method is further used to refine the solution. A series of test problems, including the benchmark polynomials and several instances of the sensor network localization problems, have been used to testify the effectiveness of the proposed algorithm. © 2013 Published by Elsevier Inc. All rights reserved.

An algorithm for monotonic global optimization problems

- Rubinov, Alex, Tuy, Hoang, Mays, Heather

**Authors:**Rubinov, Alex , Tuy, Hoang , Mays, Heather**Date:**2001**Type:**Text , Journal article**Relation:**Optimization Vol. 49, no. 3 (2001), p. 205-221**Full Text:**false**Reviewed:****Description:**We propose an algorithm to locate a global maximum of an increasing function subject to an increasing constraint on the cone of vectors with nonnegative coordinates. The algorithm is based on the outer approximation of the feasible set. We establish the convergence of the algorithm and provide a number of numerical experiments. We also discuss the types of constraints and objective functions for which the algorithm is best suited. © 2001 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint.

Are you sure you would like to clear your session, including search history and login status?