LEARN MORE ABOUT The International Conference on Engineering & MIS 2019

News:

1- The conference Venue: Satpayev street 2 ,   L.N. Gumilyov Eurasian National University (location in this attachment

2. Lunch Break: Shaherezada Restaurant: Magzhan Zhumabayev Avenue, 8
http://shaherezada.kz/ (location in attachment 1 and attachment 2)

3- Please click here to visit the onference Schedule (Last Updated_21 May_2019).
4- 
Click here to visit the suggested hotels
5- The conference Proceedings will be indexed in ACM

The 5th International Conference on Engineering & MIS 2019 and will take place in L.N.Gumilyov Eurasian National University - Main Campus, Astana, Kazakhstan, 06-08 June, 2019. The 5th ICEMIS 2019 is co-sponsored by L.N.Gumilyov Eurasian National University.

 

The conference has the focus on the frontier topics in the theoretical and applied engineering and MIS subjects. The ICEMIS conference serves as good platforms for our members and the entire engineering and MIS community to meet with each other and to exchange ideas. ICEMIS 2017 Conference was held at the Roses Beach Hotel, Monastir, Tunisia and its acceptace rate was 0.38. ICEMIS 2017 is available in the IEEE Xplore (visit the following link http://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&queryText=icemis%202017). Note that the ICEMIS 2016 Conference was held at the Ibn Zohr University in Agadir, Morocco. The IEEE ICEMIS 2016 is  available in the IEEE Xplore Digital Library (visit the following link http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7725027). Note that the Acceptance rate of ICEMIS 2016 was 40%. In addition, the ACM ICEMIS 2015 Conference was held at the İstanbul Kemerburgaz University in Istanbul, Turkey. The ACM ICEMIS 2015 is available at the ACM Digital Library (visit the following link: http://dl.acm.org/citation.cfm?id=2832987&CFID=735444636&CFTOKEN=91296695). Note that the Acceptance rate of ICEMIS 2015 was 38%.

 

All submitted papers will be under peer review and accepted papers will be published in the conference proceeding. 

 

The ICEMIS is composed of the following 18 tracks - Topics of interest include, but are not limited to, the following:

Bioinformatics & Biology: Biomedicine, epidemiology, & agriculture, Computer-aided drug design, Databases & database integration, Evolution and phylogenetics, Metabolomics, Ontologies,Pathways, Networks, and systems,Proteomics, Sequence analysis, Simulation & system dynamics, Structural bioinformatics, Text mining, Transcriptomics, Microarray Data Analysis, Micro RNA and RNAi, Biomedical Applications, Therapeutic Applications of Computational Biology, Computational Drug Discovery, Evolution and Phylogenetics, Sequence Motifs, Alignments, and families, Functional Genomics, Promoter Analysis and Discovery, Recognition of Regulatory Elements, Comparative Genomics and Annotation, Genetic Variation, Development Control, Future Trends of Bioinformatics, and any topic related to Biology. 

Chemical Engineering & Petrol Engineering: Analytical Chemistry, Advanced materials processing, Biochemical and bio-molecular engineering, Bioengineering and biomedical engineering, Biological and Medicinal, Chemistry, Biotechnology, Catalysis, Chemical Education, Chemical engineering education, Chemical reaction engineering, Chemical engineering equipment design and process design, Economics and Business Management, Environment, Inorganic Chemistry, Macromolecular Science and Engineering, Materials Chemistry, Organic Chemistry, Physical, Theoretical and Computational Chemistry, Process Safety Management, Rubber, Surface Science, Systems and Control, Green Chemistry Forum and any topic related to this track.

Electrical Engineering and Communications Systems:Communications Theory: Coding theory and techniques, Fading channels, Multiplexing, Adaptive modelling, Filtering techniques, Noise reduction, Transmission diversity, Demodulation, Synchronization, Queuing Theory, Modulation, Network Management, Communications Protocols, Wireless Networks, Location-based Services and Positioning, Next Generation Internet, Network Applications & Services, any topic related to this track. 

Educational in ICT: E-learning, Distance Education, Educational Technology, Virtual education and others.

Robotics: Programming, Software, Hardware, Applications, Tools, Systems and Technologies.

Web Technologies: Social Networks, Programming Languages, Semantics, Web Semantic, Mobile Applications, Mobile Engineering, web applications developments and others.

Health Advances and Technologies

Machine Learning

Modeling, & Simulation

Engineering Projects Management  

Computing & Applications: OS, Databases, Cloud Computing, Soft Computing, Genetic Programming, Genetic Algorithm, Swarm Intelligence, Machine Learning, Pattern Recognition, Fuzzy Systems, Fuzzy Logic, Neural network, Machine Learning, Multi-Agent Systems, Neural Genetic Systems, Neural Fuzzy Systems, Pattern Recognition, Time Series Analysis, Forecasting, Reinforcement Learning, tatistical Data Analysis, Complex Systems, Evolutionary Systems, Applications of soft computing to: Control problems, sensor fusion, manufacturing, testing and diagnostics, semiconductor processing, modeling of complex systems, approximate reasoning, optimization, management science, decision analysis, information systems, economics, financial systems, business applications, forecasting, reliability, cost-benefit analysis, risk assessments, medical applications, forensic applications, automotive applications, robotics, automation, etc. New developments in soft computing: Development of applications or approaches combining fuzzy logic, neural networks, evolutionary computation, expert systems, etc.Soft computing software, Hardware implementations of soft computing.

Signal Processing Engineering 

Renewable Energy 

Management Information Systems (MIS): e-Commerce vs. e-Business, Building an e-Business, e-Gov, Designing a web site, elements of a web site, evaluation and usability, Web site design: Site plan, strategies and designs, E-commerce Web Site Design: Strategies and Model, Payments, CRM, B2B e-Commerce,  KPMG presentation aother topics related in IS.

Applied Mathematics & Statistics 

Smart Cities

Multimedia Tools and Applications

 

Meet Our Speakers
team-1
Professor of Computer Science and Engineering
team-1
Profesor de la Escuela de Ciencias Técnicas e Ingeniería (UDIMA), Spain
 
Visitors
23634
SCHEDULE

  • 06 Jun
    Day 1
  • 07 Jun
    Day 2
09:45 - 10:30 Prof. Chang-Biau Yang
The Longest Common Subsequence Problem and Its Variants in Genome Rearrangement

Given two sequences (strings) A and B of characters, the longest common subsequence (LCS) problem is to find a longest sequence which is a subsequence of both A and B. For example, suppose A=accgt and B=tagct. Then, the LCS of A and B is agt or act, with length 3. The LCS problem was originated in the early 1970s for measuring the similarity of two biological sequences, such as DNA and proteins. In addition to the application of biological sequences, the LCS algorithm can be widely applied, such as speech recognition, data search, file comparison, and plagiarism detection. The “diff” command (file difference comparison) in Unix OS and the recent file comparison software “Compare it” are two examples based on LCS.

The LCS problem has been studied extensively since 1970s. Until now, more than 100 papers were published for discussing the problem. Many algorithms have been designed for solving the problem. The simplest way for solving it is to apply the dynamic programming approach, with O(mn) time, where |A|=m and |B|=n. Among the LCS algorithms, the diagonal method proposed by Nakatsu et al. is very efficient for similar sequences with O(L(m-L)) time, where L denotes the LCS length. In this talk, we shall present some of the LCS algorithms, and then compare their execution efficiency.

There are many variations of the LCS problem. Some of them are listed as followed.

(1) Merged LCS: The LCS of one sequence and two-interleaving-sequence is calculated.(2) Block edit distance: The operations of block copy and block deletion are involved. (3) Constrained LCS: In addition to the two given sequences A and B, one extra constrained sequence C is also given. The constrained LCS problem can be divided into four categories: In the answer, (a)C is included as a subsequence; (b) C is not included in as a subsequence; (c) C is included as a substring; (d) C is not included as a substring.(4) Run-length encoded LCS: The input sequences are encoded in the run-length format.(5) Genome rearrangement: Inversions, reversals and transpositions are involved.

When the operations in genome rearrangement are allowed to be overlapping, the problem has been proved to be NP-hard. If the operations are restricted to be non-overlapping, the problem becomes solvable in polynomial time. In this talk, we introduce a new variant of genome rearrangement, which allows classical operations (insertion, deletion and replacement) and non-overlapping inversions. The time complexity of our algorithm is O(m2n) in the worst case and O(mn) in the average case.

11:30 - 12:00 Dr. Juan Alfonso Lara Torralbo
Educational Data Mining: past contributions, present findings and future opportunities

Educational Data Mining is a discipline in charge of studying the application of Data Mining techniques to information generated in educational environments. That information can be analyzed in order to solve many different problems related to educational issues, such as predicting students' performance. In this presentation, Prof. Lara will give a general introduction to Educational Data Mining topic and will highlight the differences with Learning Analytics. Then, he will make a summary of some of his most relevant contributions to this area. He will also comment some of the preliminar results recently obtained in his research and, finally, he will present some interesting challenges that Educational Data Mining community will have to face in coming years

09:30 - 10:15 Dr. Gulmira Bekmanova
Methods for analyzing polarity of the Kazakh texts related to the threats
register

REGISTRATION NOTES

  • Rates include: attendance to all sessions and conferences, Proceedings (Soft Copy), conference materials, Coffee Breaks and Daily Lunch.
  • Please note that if you do not attend the conference for any reason, the Soft Copy of the Conference Proceedings will be sent to your mail address upon request.
  • The student rates apply to full time students only (Declaration of University stating full time status must be sent by email with the registration form – otherwise it won’t be considered).
  • Also the students will compete on the Best Student Paper. The Winner will receive an Winning Certificate.
  • Author presenting more than one paper – 350$ per extra paper. 
  • The Accompany person should register and pay 150$
  • The following rates apply to the number of pages of final submissions:

 

Pages /regular price

Extra pages

***

Full Paper

6

up to 4

Short Paper

4

up to 1

Doctoral Consortium

5

up to 1

Reflection Paper

4

up to 1

Poster/Demonstration

3

up to 1

*** The price of extra pages is  45$ per extra page.

GET YOUR TICKETS

HURRY UP!!

All submitted papers will be under peer review and accepted papers will be published in the conference proceeding. The abstracts will be indexed and available at major academic databases.

  • 00
    Days
  • 00
    Hours
  • 00
    Mins
  • 00
    Secs
Sponsors
  • IARES
  • ACM
  • L.N.Gumilyov Eurasian National University