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:
There is a lack of ontology in the study and explication of innovation. Does this matter? It matters because ‘innovation’ has become an important word in the 21st Century, reflecting all that is modern, progressive and exciting in a complex world. This is reflected in every phase of daily existence in modern capitalist economies. Firms are urged to be innovative to gain or sustain a ‘competitive edge’, consultants advertise their strategic advice as the essence of innovation, local communities’ survival depend on the capacity building that comes from innovation, schools are exalted to have innovation in their curriculum, universities promote themselves as leaders in innovation. Politicians respond to the need for supporting all the above through policies for enhancing such innovation in the nation.
Description:
There is a lack of ontology in the study and explication of innovation. Does this matter? It matters because ‘innovation’ has become an important word in the 21st Century, reflecting all that is modern, progressive and exciting in a complex world. This is reflected in every phase of daily existence in modern capitalist economies. Firms are urged to be innovative to gain or sustain a ‘competitive edge’, consultants advertise their strategic advice as the essence of innovation, local communities’ survival depend on the capacity building that comes from innovation, schools are exalted to have innovation in their curriculum, universities promote themselves as leaders in innovation. Politicians respond to the need for supporting all the above through policies for enhancing such innovation in the nation.
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:
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:
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:
Several clustering methods based on optimisation have been developed recently. One of them is based on minimisation of the cluster function. This function is nonsmooth, nonconvex and extremely multi extremal. Minimisation of such functions is a challenging task. This process can be also very time consuming, especially if the dimension of the corresponding optimisation problem and the size of the dataset are large. In this paper we propose an approach which allows one to run programs in parallel using several CPUs simultaneously. We discuss several possible ways for design parallel implementations for the program and present results of numerical experiments.
Description:
We consider the NP Hard problem of online Bin Packing while requiring that larger (or longer) items be placed below smaller (or shorter) items --- we call such a version the {LIB} version of problems. Bin sizes can be uniform or variable. We provide analytical upper bounds as well as experimental results on the asymptotic approximation ratio for the first fit algorithm.
Description:
We consider the NP Hard problem of online Bin Packing while requiring that larger (or longer) items be placed below smaller (or shorter) items --- we call such a version the {LIB} version of problems. Bin sizes can be uniform or variable. We provide analytical upper bounds as well as experimental results on the asymptotic approximation ratio for the first fit algorithm.
Description:
The purpose of the paper is to develop and study new techniques for global optimization based on dynamical systems approach. This approach uses the notion of relationship between variables which describes influences of the changes of the variables to each other. A numerical algorithm for global optimization is introduced.