Speakers for 2019 to be announced soon......
Prof. Dr. Kamal Zuhairi Zamli
Universiti Malaysia Pahang, Malaysia
DEAN OF THE FACULTY OF COMPUTER SYSTEMS & SOFTWARE ENGINEERING (FSKKP)
Biography: Kamal Z Zamli obtained his degree in the field of Electrical Engineering from Worcester Polytechnic Institute, USA in 1992. He then pursued his MSc (Real-Time Software Engineering) from Universiti Teknologi Malaysia in 2000 and PhD from Software Engineering from University of Newcastle upon Tyne, UK in 2003. He has written nearly 350 papers in journals and conferences worldwide mainly in the area of (combinatorial t-way) Software Testing as well as Search based Software Engineering. He is the runner up for the Q-Merit Award conferred by the Malaysian Software Testing Board (MSTB, 2011) based on his contribution to the field of Software Testing in Malaysia.
Speech Title: Advances in Meta and Hyper-Heuristic Algorithms: Implications for Solving Search based Software Engineering Problems
Abstract: Solving complex optimization problems can be painstakingly difficult endeavor considering multiple and conflicting design goals. A growing trend in utilizing meta-heuristic algorithms to solve these problems has been observed as they have shown considerable success in dealing with tradeoffs between conflicting design goals. Many meta-heuristic algorithms have been developed in the past 25 years. Most of these algorithms do have merits, but they require tuning of their specified control parameters. For example, Genetic Algorithm require substantial tuning for population size, mutation and cross over rate. The same issue also appears in the case of Particle Swarm Optimization which relies on population size, inertia weight, social and cognitive parameters as parameters. In similar manner, Harmony Search requires tuning of harmony size, harmony memory consideration rate, and pitch adjustment. As for Ant Colony, the calibration of evaporation rate, pheromone influence, and heuristic influence are essential. In many cases, improper tuning for all of these specific parameters undesirably increases computational efforts as well as yields sub-optimal solutions. As a result, many researchers have advocated the adoption of parameter free meta-heuristic algorithms (e.g. Teaching Learning based Optimization, Symbiotic Optimization Search, and Sine Cosine Algorithm). While avoiding any parameter controls can alleviate the tuning issues, parameter free meta-heuristic algorithms often suffer from not being able to effectively control exploration (i.e. explore new possible solution area within the search space boundaries) and exploitation (i.e. learn from the surrounding knowledge of the search neighborhood). Addressing these issues, the hybrid meta-heuristics algorithms based on the hyper-heuristics will be introduced to enhance the generality of meta-heuristic algorithms as well as allow adaptive control as far as exploration and exploitation are concerned based on the current state of the searching process. In doing so, the application of hyper-heuristic for search based software engineering problems will also be outlined.
Prof. Dr. Vitaliy Mezhuyev
Universiti Malaysia Pahang, Malaysia
Biography: Vitaliy Mezhuyev received BS and MS degrees in physics and informatics from Berdyansk State Pedagogical University (BSPU), Ukraine, in 1997. In 2002, he received a PhD in Physics Instruction from Kiev National Pedagogical University and, in 2012, a ScD in Information Technologies from Odessa National Technical University, Ukraine. From 2004 until 2014, he was Head of the Department of Informatics and Software Engineering at BSPU, Ukraine. Now he is Professor at Faculty of Computer Systems and Software Engineering in University Malaysia Pahang, Head of the Software Engineering Research Group.
During his carrier, Vitaliy Mezhuyev participated in the multiple international scientific and industrial projects, devoted to formal modelling, design and development of advanced software systems as network-centric real-time operating system; IDE for the automation of development of parallel real-time applications; tools for specification, verification and validation of software products; visual environment for metamaterials modelling and others.
His current research interests include formal methods, metamodeling, safety modelling and verification of hybrid software systems, and the design of cyber-physical systems.
Speech title: Metamodelling Approach for Modelling Domains with Different Mathematical Structure
Abstract: The methodology of Domain Specific Mathematical Modelling (DSMM), which implementation aims to overcome the shortcomings of an existing methodology of Domain-Specific Modelling is proposed. An additional level of the metamodelling architecture is introduced, which allows us to take into account the mathematical structure of the modelled domains, and to use mathematical operations for the development of new effective methods for solving domain-specific problems. The concepts of the metamodel, metamodelling, levels of the metamodelling architecture and the formal semantics of the DSMM metamodels are defined. Examples of DSMM application for the development of metamodels and their use for the domains modelling are discussed
Prof. Masahiro Fujita
The University of Tokyo, Japan
Biography: Masahiro Fujita received his Ph.D. in Information Engineering from the University of Tokyo in 1985 on his work on model checking of hardware designs by using logic programming languages. In 1985, he joined Fujitsu as a researcher and started to work on hardware automatic synthesis as well as formal verification methods and tools, including enhancements of BDD/SATbased techniques. From 1993 to 2000, he was director at Fujitsu Laboratories of America and headed a hardware formal verification group developing a formal verifier for real-life designs having more than several million gates. The developed tool has been used in production internally at Fujitsu and externally as well. Since March 2000, he has been a professor at VLSI Design and Education Center of the University of Tokyo. He has done innovative work in the areas of hardware verification, synthesis, testing, and software verification-mostly targeting embedded software and web-based programs. He has been involved in a Japanese governmental research project for dependable system designs and has developed a formal verifier for C programs that could be used for both hardware and embedded software designs. The tool is now under evaluation jointly with industry under governmental support. He has authored and co-authored 10 books, and has more than 200 publications. He has been involved as program and steering committee member in many prestigious conferences on CAD, VLSI designs, software engineering, and more. His current research interests include synthesis and verification in SoC (System on Chip), hardware/software co-designs targeting embedded systems, digital/analog co-designs, and formal analysis, verification, and synthesis of web-based programs and embedded programs.
Speech Title: Mobile super computing and big data analysis with non-volatile memory technology
Abstract: For the last ten years or so, there have been lots of proposals and developments in realizing super computer performance by hardware implementations of computing algorithms. Thanks to the recent developments of large and dense FPGAs (Field Programmable Gate Arrays) and automatic compilers for them, software programs can be almost automatically compiled into FPGA circuits, which realizes high performance comparable to the general purpose super computers. For larger computing, such as big data analysis for societies, however, compilers for FPGA may not work well especially if the size becomes greater than single FPGA chip designs. In this talk, we discuss techniques by which large problems can be automatically decomposed into the ones for single chips. The decomposition problem is defined as Quantified Boolean Formula (QBF) problem and solved by repeatedly applying SAT solvers. The decomposed ones are automatically compiled into FPGA with non-volatile memory technology so that super computer performance can be realized in mobile environments.