Your selections:

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

Show More

Show Less

380102 Applied Mathematics
340103 Numerical and Computational Mathematics
110101 Pure Mathematics
110801 Artificial Intelligence and Image Processing
9Global optimization
9Nonsmooth optimization
7Optimisation
6Problem solving
50806 Information Systems
5Cluster analysis
5Optimization
5Subdifferential
4Data mining
4Nonconvex optimization
4Numerical methods
31702 Cognitive Science
3Constrained optimization
3Constraint theory
3DC programming

Show More

Show Less

Format Type

On the non-existence of even degree 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:**2007**Type:**Text , Conference paper**Relation:**Paper presented at 18th International Workshop on Combinatorial Algorithms, IWOCA 2007, Rafferty's Resort, Lake Macquarie, New South Wales : 5th-9th November 2007**Full Text:****Description:**Using eigenvalue analysis, it was shown by Erdos et al. that, with the exception of C4, there are no graphs of diameter 2, maximum degree d and d2 vertices. In this paper, we show that graphs of diameter 2, maximum degree d and d2-1 vertices do not exist for most values of d, when d is even, and we conjecture that they do not exist for any even d greater than 4.**Description:**2003007893

**Authors:**Miller; Mirka , Nguyen, Minh Hoang , Pineda-Villavicencio, Guillermo**Date:**2007**Type:**Text , Conference paper**Relation:**Paper presented at 18th International Workshop on Combinatorial Algorithms, IWOCA 2007, Rafferty's Resort, Lake Macquarie, New South Wales : 5th-9th November 2007**Full Text:****Description:**Using eigenvalue analysis, it was shown by Erdos et al. that, with the exception of C4, there are no graphs of diameter 2, maximum degree d and d2 vertices. In this paper, we show that graphs of diameter 2, maximum degree d and d2-1 vertices do not exist for most values of d, when d is even, and we conjecture that they do not exist for any even d greater than 4.**Description:**2003007893

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

Syntactic characterizations of polynomial time optimization classes

**Authors:**Manyem, Prabhu**Date:**2008**Type:**Journal article**Relation:**Chicago Journal of Theoretical Computer Science Vol. 2008, no. (2008), p.**Full Text:****Reviewed:****Description:**The characterization of important complexity classes by logical descriptions has been an important and prolific area of Descriptive complexity. However, the central focus of the research has been the study of classes like P, NP, L and NL, corresponding to decision problems (e.g. the characterization of NP by Fagin [Fag74] and of P by Gradel [E. 91]). In contrast, optimization problems have received much less attention. Optimization problems corresponding to the NP class have been characterized in terms of logic expressions by Papadimitriou and Yannakakis, Panconesi and Ranjan, Kolaitis and Thakur, Khanna et al, and by Zimand. In this paper, we attempt to characterize the optimization versions of P via expressions in second order logic, many of them using universal Horn formulae with successor relations. These results nicely complement those of Kolaitis and Thakur [KT94] for polynomially bounded NP-optimization problems. The polynomially bounded versions of maximization and minimization problems are treated first, and then the maximization problems in the not necessarily polynomially bounded class.**Description:**2003006662

**Authors:**Manyem, Prabhu**Date:**2008**Type:**Journal article**Relation:**Chicago Journal of Theoretical Computer Science Vol. 2008, no. (2008), p.**Full Text:****Reviewed:****Description:**The characterization of important complexity classes by logical descriptions has been an important and prolific area of Descriptive complexity. However, the central focus of the research has been the study of classes like P, NP, L and NL, corresponding to decision problems (e.g. the characterization of NP by Fagin [Fag74] and of P by Gradel [E. 91]). In contrast, optimization problems have received much less attention. Optimization problems corresponding to the NP class have been characterized in terms of logic expressions by Papadimitriou and Yannakakis, Panconesi and Ranjan, Kolaitis and Thakur, Khanna et al, and by Zimand. In this paper, we attempt to characterize the optimization versions of P via expressions in second order logic, many of them using universal Horn formulae with successor relations. These results nicely complement those of Kolaitis and Thakur [KT94] for polynomially bounded NP-optimization problems. The polynomially bounded versions of maximization and minimization problems are treated first, and then the maximization problems in the not necessarily polynomially bounded class.**Description:**2003006662

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.

An optimization approach to the study of drug-drug interactions

- 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. 201-216**Full Text:****Description:**Drug-drug interaction is one of the important problems of Adverse Drug Reaction (ADR). In this paper we develop an optimization approach for the study of this problem. This approach is based on drug-reaction relationships represented in the form of a vector of weights, which can be defined as a solution to some global optimization problem. Although this approach can be used for solving many ADR problems, we concentrate here only on drug-drug interactions. Based on drug-reaction relationships, we formulate this problem as an optimization problem. The approach is applied to different classes of reactions from the Australian Adverse Drug Reaction Advisory Committee (ADRAC) database.**Description:**2003001384

**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. 201-216**Full Text:****Description:**Drug-drug interaction is one of the important problems of Adverse Drug Reaction (ADR). In this paper we develop an optimization approach for the study of this problem. This approach is based on drug-reaction relationships represented in the form of a vector of weights, which can be defined as a solution to some global optimization problem. Although this approach can be used for solving many ADR problems, we concentrate here only on drug-drug interactions. Based on drug-reaction relationships, we formulate this problem as an optimization problem. The approach is applied to different classes of reactions from the Australian Adverse Drug Reaction Advisory Committee (ADRAC) database.**Description:**2003001384

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

On antimagic labelings of disjoint union of complete s-partite graphs

- Dafik, Miller, Mirka, Ryan, Joe, Baca, Martin

**Authors:**Dafik , Miller, Mirka , Ryan, Joe , Baca, Martin**Date:**2008**Type:**Text , Journal article**Relation:**Journal of combinatorial mathematics and combinatorial computing Vol. 65, no. (May 2008 2008), p. 41-49**Full Text:****Reviewed:****Description:**By an (a, d)-edge-antimagic total labeling of a graph G(V, E) we mean a bijective function f from V(G) u E(G) onto the set. { 1, 2, ... ,ǀV(C)ǀ+IE(G)I} such that the set of all the edge-weights, w(uv) ,.... f(u) + f(uv) + f(v), uv C E (G), is {a, a+ d, a+ 2d, . . . , a + (lE(G)I-1)d}, for two integers a > 0 and d

**Authors:**Dafik , Miller, Mirka , Ryan, Joe , Baca, Martin**Date:**2008**Type:**Text , Journal article**Relation:**Journal of combinatorial mathematics and combinatorial computing Vol. 65, no. (May 2008 2008), p. 41-49**Full Text:****Reviewed:****Description:**By an (a, d)-edge-antimagic total labeling of a graph G(V, E) we mean a bijective function f from V(G) u E(G) onto the set. { 1, 2, ... ,ǀV(C)ǀ+IE(G)I} such that the set of all the edge-weights, w(uv) ,.... f(u) + f(uv) + f(v), uv C E (G), is {a, a+ d, a+ 2d, . . . , a + (lE(G)I-1)d}, for two integers a > 0 and d

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.

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