Keynote Speakers
Dr. A. Fazel Famili

Data Scientist and Data Analytics Consultant
University of Ottawa

Biography: Dr. A. Fazel Famili is a Data Scientist and a Data Analytics Consultant working in various domains such as Engineering and Life Sciences. He worked as a Research Scientist and Group Leader at the National Research Council of Canada in Ottawa, Canada from 1984-2015. Prior to joining NRC, he worked in industry for 3 years. His interests include data mining, pattern recognition, machine learning, bioinformatics, and knowledge discovery from on-line or historical data. He has lectured in a number of Research Institutes in Canada, Europe, Far East, South Africa and South/Central America. Dr. Famili is founding Editor-in-Chief of the IDA Journal (Intelligent Data Analysis, a refereed scientific journal, established in 1996), published bi-monthly. He is also affiliated with the University of Ottawa, Canada. He has edited two books, published over 50 articles in data mining and Artificial Intelligence and has a US data mining patent.

Speech Title: Searching for patterns in real-world data: From problem understanding to validation
Abstract: Our advancements and achievements in information science and technology over the last 10-20 years, have been the prime motivation for various industries to accumulate huge amounts of data from all levels of their operation. This has resulted in creating large databases for which much of the useful insights are sometimes hidden and untapped. Many attempts have been made in the last 10-20 years to apply systematic methodologies in order to build knowledge discovery and management applications. More...
Prof. Sheng-Lung Peng

Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien 974, Taiwan

Biography: Sheng-Lung Peng is a full Professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Taiwan. He received the BS degree in Mathematics from National Tsing Hua University, and the MS and PhD degrees in Computer Science and Information Engineering from the National Chung Cheng University and National Tsing Hua University, Taiwan, respectively. His research interests are in designing and analyzing algorithms for Bioinformatics, Combinatorics, Data Mining, and Networks. More...

Speech Title: On the Maximally Balanced Connected Partition of Graphs
Abstract: Partitioning, related to clustering, is a classical topic in data mining. With the emerging of social networks, big data, and cloud computing, graph partitioning becomes an important research topic. A well-studied problem is defined as follows. Given a graph G = (V, E) and a positive k, the balanced k-partition problem on G is to partition V into k subsets V1,…, Vk such that every |Vi| is near n/k and the number of edges adjacent to different Vi is as small as possible. A trivial application is for cloud storage and load balancing while considering graph data. More...
Prof. Hari Mohan Srivastava

Professor Emeritus
Department of Mathematics and Statistics
University of Victoria

Biography: H. M. Srivastava (Hari Mohan Srivastava) has held the position of Professor Emeritus in the Department of Mathematics and Statistics at the University of Victoria in Canada since 2006, having joined the faculty there in 1969, first as an Associate Professor (1969–1974) and then as a Full Professor (1974– 2006). He began his university-level teaching career right after having received his M.Sc. degree in 1959 at the age of 19 years from the University of Allahabad in India. More...

Speech Title: Leonhard Euler, Christian Goldbach and the Zeta Function
Abstract: The main object of this lecture is to present an overview of some recent developments involving the Riemann Zeta function ζ(s), the Hurwitz (or generalized) Zeta function ζ(s,a), and the Hurwitz-Lerch Zeta function Φ(z,s,a), which have their roots in the works of the great eighteenth-century Swiss mathematician, Leonhard Euler (17071783) and the Russian mathematician, Christian Goldbach (1690-1764). We aim at considering the problems associated with the evaluations and representations of ζ(s) when s ∈N\{1}, N being the set of natural numbers, with emphasis upon several interesting classes of rapidly convergent series representations for ζ(2n+1) (n ∈N). Symbolic and numerical computations using Mathematica (Version 4.0) for Linux will also be provided for supporting their computational usefulness.