for Journals by Title or ISSN
for Articles by Keywords
help

Publisher: Springer-Verlag (Total: 2350 journals)

 A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Showing 1 - 200 of 2350 Journals sorted alphabetically
3D Printing in Medicine     Open Access  
3D Research     Hybrid Journal   (Followers: 21, SJR: 0.222, CiteScore: 1)
4OR: A Quarterly J. of Operations Research     Hybrid Journal   (Followers: 10, SJR: 0.825, CiteScore: 1)
AAPS J.     Hybrid Journal   (Followers: 22, SJR: 1.118, CiteScore: 4)
AAPS PharmSciTech     Hybrid Journal   (Followers: 7, SJR: 0.752, CiteScore: 3)
Abdominal Imaging     Hybrid Journal   (Followers: 14, SJR: 0.866, CiteScore: 2)
Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg     Hybrid Journal   (Followers: 4, SJR: 0.439, CiteScore: 0)
Academic Psychiatry     Full-text available via subscription   (Followers: 23, SJR: 0.53, CiteScore: 1)
Academic Questions     Hybrid Journal   (Followers: 8, SJR: 0.106, CiteScore: 0)
Accreditation and Quality Assurance: J. for Quality, Comparability and Reliability in Chemical Measurement     Hybrid Journal   (Followers: 26, SJR: 0.316, CiteScore: 1)
Acoustical Physics     Hybrid Journal   (Followers: 11, SJR: 0.359, CiteScore: 1)
Acoustics Australia     Hybrid Journal   (SJR: 0.232, CiteScore: 1)
Acta Analytica     Hybrid Journal   (Followers: 7, SJR: 0.367, CiteScore: 0)
Acta Applicandae Mathematicae     Hybrid Journal   (Followers: 1, SJR: 0.675, CiteScore: 1)
Acta Biotheoretica     Hybrid Journal   (Followers: 4, SJR: 0.284, CiteScore: 1)
Acta Diabetologica     Hybrid Journal   (Followers: 17, SJR: 1.587, CiteScore: 3)
Acta Endoscopica     Hybrid Journal   (Followers: 1)
acta ethologica     Hybrid Journal   (Followers: 4, SJR: 0.769, CiteScore: 1)
Acta Geochimica     Hybrid Journal   (Followers: 6, SJR: 0.24, CiteScore: 1)
Acta Geodaetica et Geophysica     Hybrid Journal   (Followers: 2, SJR: 0.305, CiteScore: 1)
Acta Geotechnica     Hybrid Journal   (Followers: 7, SJR: 1.588, CiteScore: 3)
Acta Informatica     Hybrid Journal   (Followers: 5, SJR: 0.517, CiteScore: 1)
Acta Mathematica     Hybrid Journal   (Followers: 12, SJR: 7.066, CiteScore: 3)
Acta Mathematica Hungarica     Hybrid Journal   (Followers: 2, SJR: 0.452, CiteScore: 1)
Acta Mathematica Sinica, English Series     Hybrid Journal   (Followers: 6, SJR: 0.379, CiteScore: 1)
Acta Mathematica Vietnamica     Hybrid Journal   (SJR: 0.27, CiteScore: 0)
Acta Mathematicae Applicatae Sinica, English Series     Hybrid Journal   (SJR: 0.208, CiteScore: 0)
Acta Mechanica     Hybrid Journal   (Followers: 21, SJR: 1.04, CiteScore: 2)
Acta Mechanica Sinica     Hybrid Journal   (Followers: 5, SJR: 0.607, CiteScore: 2)
Acta Metallurgica Sinica (English Letters)     Hybrid Journal   (Followers: 7, SJR: 0.576, CiteScore: 2)
Acta Meteorologica Sinica     Hybrid Journal   (Followers: 3, SJR: 0.638, CiteScore: 1)
Acta Neurochirurgica     Hybrid Journal   (Followers: 6, SJR: 0.822, CiteScore: 2)
Acta Neurologica Belgica     Hybrid Journal   (Followers: 1, SJR: 0.376, CiteScore: 1)
Acta Neuropathologica     Hybrid Journal   (Followers: 5, SJR: 7.589, CiteScore: 12)
Acta Oceanologica Sinica     Hybrid Journal   (Followers: 3, SJR: 0.334, CiteScore: 1)
Acta Parasitologica     Hybrid Journal   (Followers: 10, SJR: 0.641, CiteScore: 1)
Acta Physiologiae Plantarum     Hybrid Journal   (Followers: 2, SJR: 0.574, CiteScore: 2)
Acta Politica     Hybrid Journal   (Followers: 14, SJR: 0.605, CiteScore: 1)
Activitas Nervosa Superior     Hybrid Journal   (SJR: 0.147, CiteScore: 0)
adhäsion KLEBEN & DICHTEN     Hybrid Journal   (Followers: 6, SJR: 0.103, CiteScore: 0)
ADHD Attention Deficit and Hyperactivity Disorders     Hybrid Journal   (Followers: 23, SJR: 0.72, CiteScore: 2)
Adhesion Adhesives & Sealants     Hybrid Journal   (Followers: 9)
Administration and Policy in Mental Health and Mental Health Services Research     Partially Free   (Followers: 16, SJR: 1.005, CiteScore: 2)
Adsorption     Hybrid Journal   (Followers: 4, SJR: 0.703, CiteScore: 2)
Advances in Applied Clifford Algebras     Hybrid Journal   (Followers: 4, SJR: 0.698, CiteScore: 1)
Advances in Atmospheric Sciences     Hybrid Journal   (Followers: 37, SJR: 0.956, CiteScore: 2)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 19, SJR: 0.812, CiteScore: 1)
Advances in Contraception     Hybrid Journal   (Followers: 3)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 51, SJR: 1.09, CiteScore: 1)
Advances in Gerontology     Partially Free   (Followers: 8, SJR: 0.144, CiteScore: 0)
Advances in Health Sciences Education     Hybrid Journal   (Followers: 28, SJR: 1.64, CiteScore: 2)
Advances in Manufacturing     Hybrid Journal   (Followers: 3, SJR: 0.475, CiteScore: 2)
Advances in Polymer Science     Hybrid Journal   (Followers: 43, SJR: 1.04, CiteScore: 3)
Advances in Therapy     Hybrid Journal   (Followers: 5, SJR: 1.075, CiteScore: 3)
Aegean Review of the Law of the Sea and Maritime Law     Hybrid Journal   (Followers: 6)
Aequationes Mathematicae     Hybrid Journal   (Followers: 2, SJR: 0.517, CiteScore: 1)
Aerobiologia     Hybrid Journal   (Followers: 3, SJR: 0.673, CiteScore: 2)
Aesthetic Plastic Surgery     Hybrid Journal   (Followers: 9, SJR: 0.825, CiteScore: 1)
African Archaeological Review     Hybrid Journal   (Followers: 16, SJR: 0.862, CiteScore: 1)
Afrika Matematika     Hybrid Journal   (Followers: 1, SJR: 0.235, CiteScore: 0)
AGE     Hybrid Journal   (Followers: 7)
Ageing Intl.     Hybrid Journal   (Followers: 7, SJR: 0.39, CiteScore: 1)
Aggiornamenti CIO     Hybrid Journal   (Followers: 1)
Aging Clinical and Experimental Research     Hybrid Journal   (Followers: 3, SJR: 0.67, CiteScore: 2)
Agricultural Research     Hybrid Journal   (Followers: 4, SJR: 0.276, CiteScore: 1)
Agriculture and Human Values     Hybrid Journal   (Followers: 14, SJR: 1.173, CiteScore: 3)
Agroforestry Systems     Hybrid Journal   (Followers: 19, SJR: 0.663, CiteScore: 1)
Agronomy for Sustainable Development     Hybrid Journal   (Followers: 12, SJR: 1.864, CiteScore: 6)
AI & Society     Hybrid Journal   (Followers: 8, SJR: 0.227, CiteScore: 1)
AIDS and Behavior     Hybrid Journal   (Followers: 14, SJR: 1.792, CiteScore: 3)
Air Quality, Atmosphere & Health     Hybrid Journal   (Followers: 4, SJR: 0.862, CiteScore: 3)
Akupunktur & Aurikulomedizin     Full-text available via subscription   (Followers: 1)
Algebra and Logic     Hybrid Journal   (Followers: 5, SJR: 0.531, CiteScore: 0)
Algebra Universalis     Hybrid Journal   (Followers: 2, SJR: 0.583, CiteScore: 1)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1, SJR: 1.095, CiteScore: 1)
Algorithmica     Hybrid Journal   (Followers: 9, SJR: 0.56, CiteScore: 1)
Allergo J.     Full-text available via subscription   (Followers: 1, SJR: 0.234, CiteScore: 0)
Allergo J. Intl.     Hybrid Journal   (Followers: 2)
Alpine Botany     Hybrid Journal   (Followers: 5, SJR: 1.11, CiteScore: 3)
ALTEX : Alternatives to Animal Experimentation     Open Access   (Followers: 3)
AMBIO     Hybrid Journal   (Followers: 11, SJR: 1.569, CiteScore: 4)
American J. of Cardiovascular Drugs     Hybrid Journal   (Followers: 16, SJR: 0.951, CiteScore: 3)
American J. of Community Psychology     Hybrid Journal   (Followers: 28, SJR: 1.329, CiteScore: 2)
American J. of Criminal Justice     Hybrid Journal   (Followers: 8, SJR: 0.772, CiteScore: 1)
American J. of Cultural Sociology     Hybrid Journal   (Followers: 15, SJR: 0.46, CiteScore: 1)
American J. of Dance Therapy     Hybrid Journal   (Followers: 4, SJR: 0.181, CiteScore: 0)
American J. of Potato Research     Hybrid Journal   (Followers: 2, SJR: 0.611, CiteScore: 1)
American J. of Psychoanalysis     Hybrid Journal   (Followers: 21, SJR: 0.314, CiteScore: 0)
American Sociologist     Hybrid Journal   (Followers: 12, SJR: 0.35, CiteScore: 0)
Amino Acids     Hybrid Journal   (Followers: 8, SJR: 1.135, CiteScore: 3)
AMS Review     Partially Free   (Followers: 4)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 7, SJR: 0.211, CiteScore: 1)
Analysis and Mathematical Physics     Hybrid Journal   (Followers: 5, SJR: 0.536, CiteScore: 1)
Analysis in Theory and Applications     Hybrid Journal   (Followers: 1)
Analysis of Verbal Behavior     Hybrid Journal   (Followers: 5)
Analytical and Bioanalytical Chemistry     Hybrid Journal   (Followers: 32, SJR: 0.978, CiteScore: 3)
Anatomical Science Intl.     Hybrid Journal   (Followers: 2, SJR: 0.367, CiteScore: 1)
Angewandte Schmerztherapie und Palliativmedizin     Hybrid Journal  
Angiogenesis     Hybrid Journal   (Followers: 3, SJR: 2.177, CiteScore: 5)
Animal Cognition     Hybrid Journal   (Followers: 19, SJR: 1.389, CiteScore: 3)
Annales françaises de médecine d'urgence     Hybrid Journal   (Followers: 1, SJR: 0.192, CiteScore: 0)
Annales Henri Poincaré     Hybrid Journal   (Followers: 3, SJR: 1.097, CiteScore: 2)
Annales mathématiques du Québec     Hybrid Journal   (Followers: 4, SJR: 0.438, CiteScore: 0)
Annali dell'Universita di Ferrara     Hybrid Journal   (SJR: 0.429, CiteScore: 0)
Annali di Matematica Pura ed Applicata     Hybrid Journal   (Followers: 1, SJR: 1.197, CiteScore: 1)
Annals of Biomedical Engineering     Hybrid Journal   (Followers: 18, SJR: 1.042, CiteScore: 3)
Annals of Combinatorics     Hybrid Journal   (Followers: 4, SJR: 0.932, CiteScore: 1)
Annals of Data Science     Hybrid Journal   (Followers: 11)
Annals of Dyslexia     Hybrid Journal   (Followers: 10, SJR: 0.85, CiteScore: 2)
Annals of Finance     Hybrid Journal   (Followers: 30, SJR: 0.579, CiteScore: 1)
Annals of Forest Science     Hybrid Journal   (Followers: 7, SJR: 0.986, CiteScore: 2)
Annals of Global Analysis and Geometry     Hybrid Journal   (Followers: 1, SJR: 1.228, CiteScore: 1)
Annals of Hematology     Hybrid Journal   (Followers: 16, SJR: 1.043, CiteScore: 2)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 12, SJR: 0.413, CiteScore: 1)
Annals of Microbiology     Hybrid Journal   (Followers: 10, SJR: 0.479, CiteScore: 2)
Annals of Nuclear Medicine     Hybrid Journal   (Followers: 4, SJR: 0.687, CiteScore: 2)
Annals of Operations Research     Hybrid Journal   (Followers: 10, SJR: 0.943, CiteScore: 2)
Annals of Ophthalmology     Hybrid Journal   (Followers: 11)
Annals of Regional Science     Hybrid Journal   (Followers: 7, SJR: 0.614, CiteScore: 1)
Annals of Software Engineering     Hybrid Journal   (Followers: 13)
Annals of Solid and Structural Mechanics     Hybrid Journal   (Followers: 9, SJR: 0.239, CiteScore: 1)
Annals of Surgical Oncology     Hybrid Journal   (Followers: 14, SJR: 1.986, CiteScore: 4)
Annals of Telecommunications     Hybrid Journal   (Followers: 9, SJR: 0.223, CiteScore: 1)
Annals of the Institute of Statistical Mathematics     Hybrid Journal   (Followers: 1, SJR: 1.495, CiteScore: 1)
Antonie van Leeuwenhoek     Hybrid Journal   (Followers: 5, SJR: 0.834, CiteScore: 2)
Apidologie     Hybrid Journal   (Followers: 4, SJR: 1.22, CiteScore: 3)
APOPTOSIS     Hybrid Journal   (Followers: 8, SJR: 1.424, CiteScore: 4)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2, SJR: 0.294, CiteScore: 1)
Applications of Mathematics     Hybrid Journal   (Followers: 2, SJR: 0.602, CiteScore: 1)
Applied Biochemistry and Biotechnology     Hybrid Journal   (Followers: 43, SJR: 0.571, CiteScore: 2)
Applied Biochemistry and Microbiology     Hybrid Journal   (Followers: 17, SJR: 0.21, CiteScore: 1)
Applied Cancer Research     Open Access  
Applied Categorical Structures     Hybrid Journal   (Followers: 2, SJR: 0.49, CiteScore: 0)
Applied Composite Materials     Hybrid Journal   (Followers: 49, SJR: 0.58, CiteScore: 2)
Applied Entomology and Zoology     Partially Free   (Followers: 3, SJR: 0.422, CiteScore: 1)
Applied Geomatics     Hybrid Journal   (Followers: 3, SJR: 0.733, CiteScore: 3)
Applied Geophysics     Hybrid Journal   (Followers: 8, SJR: 0.488, CiteScore: 1)
Applied Intelligence     Hybrid Journal   (Followers: 12, SJR: 0.6, CiteScore: 2)
Applied Magnetic Resonance     Hybrid Journal   (Followers: 4, SJR: 0.319, CiteScore: 1)
Applied Mathematics & Optimization     Hybrid Journal   (Followers: 6, SJR: 0.886, CiteScore: 1)
Applied Mathematics - A J. of Chinese Universities     Hybrid Journal   (SJR: 0.17, CiteScore: 0)
Applied Mathematics and Mechanics     Hybrid Journal   (Followers: 5, SJR: 0.461, CiteScore: 1)
Applied Microbiology and Biotechnology     Hybrid Journal   (Followers: 63, SJR: 1.182, CiteScore: 4)
Applied Physics A     Hybrid Journal   (Followers: 9, SJR: 0.481, CiteScore: 2)
Applied Physics B: Lasers and Optics     Hybrid Journal   (Followers: 24, SJR: 0.74, CiteScore: 2)
Applied Psychophysiology and Biofeedback     Hybrid Journal   (Followers: 8, SJR: 0.519, CiteScore: 2)
Applied Research in Quality of Life     Hybrid Journal   (Followers: 12, SJR: 0.316, CiteScore: 1)
Applied Solar Energy     Hybrid Journal   (Followers: 18, SJR: 0.225, CiteScore: 0)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 4, SJR: 0.542, CiteScore: 1)
Aquaculture Intl.     Hybrid Journal   (Followers: 22, SJR: 0.591, CiteScore: 2)
Aquarium Sciences and Conservation     Hybrid Journal   (Followers: 1)
Aquatic Ecology     Hybrid Journal   (Followers: 33, SJR: 0.656, CiteScore: 2)
Aquatic Geochemistry     Hybrid Journal   (Followers: 4, SJR: 0.591, CiteScore: 1)
Aquatic Sciences     Hybrid Journal   (Followers: 13, SJR: 1.109, CiteScore: 3)
Arabian J. for Science and Engineering     Hybrid Journal   (Followers: 5, SJR: 0.303, CiteScore: 1)
Arabian J. of Geosciences     Hybrid Journal   (Followers: 2, SJR: 0.319, CiteScore: 1)
Archaeological and Anthropological Sciences     Hybrid Journal   (Followers: 20, SJR: 1.052, CiteScore: 2)
Archaeologies     Hybrid Journal   (Followers: 12, SJR: 0.224, CiteScore: 0)
Archiv der Mathematik     Hybrid Journal   (Followers: 1, SJR: 0.725, CiteScore: 1)
Archival Science     Hybrid Journal   (Followers: 59, SJR: 0.745, CiteScore: 2)
Archive for History of Exact Sciences     Hybrid Journal   (Followers: 8, SJR: 0.186, CiteScore: 1)
Archive for Mathematical Logic     Hybrid Journal   (Followers: 2, SJR: 0.909, CiteScore: 1)
Archive for Rational Mechanics and Analysis     Hybrid Journal   (SJR: 3.93, CiteScore: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 5, SJR: 0.79, CiteScore: 2)
Archives and Museum Informatics     Hybrid Journal   (Followers: 145, SJR: 0.101, CiteScore: 0)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 5, SJR: 1.41, CiteScore: 5)
Archives of Dermatological Research     Hybrid Journal   (Followers: 7, SJR: 1.006, CiteScore: 2)
Archives of Environmental Contamination and Toxicology     Hybrid Journal   (Followers: 14, SJR: 0.773, CiteScore: 2)
Archives of Gynecology and Obstetrics     Hybrid Journal   (Followers: 16, SJR: 0.956, CiteScore: 2)
Archives of Microbiology     Hybrid Journal   (Followers: 8, SJR: 0.644, CiteScore: 2)
Archives of Orthopaedic and Trauma Surgery     Hybrid Journal   (Followers: 8, SJR: 1.146, CiteScore: 2)
Archives of Osteoporosis     Hybrid Journal   (Followers: 2, SJR: 0.71, CiteScore: 2)
Archives of Sexual Behavior     Hybrid Journal   (Followers: 10, SJR: 1.493, CiteScore: 3)
Archives of Toxicology     Hybrid Journal   (Followers: 17, SJR: 1.541, CiteScore: 5)
Archives of Virology     Hybrid Journal   (Followers: 5, SJR: 0.973, CiteScore: 2)
Archives of Women's Mental Health     Hybrid Journal   (Followers: 14, SJR: 1.274, CiteScore: 3)
Archivio di Ortopedia e Reumatologia     Hybrid Journal  
Archivum Immunologiae et Therapiae Experimentalis     Hybrid Journal   (Followers: 2, SJR: 0.946, CiteScore: 3)
ArgoSpine News & J.     Hybrid Journal  
Argumentation     Hybrid Journal   (Followers: 5, SJR: 0.349, CiteScore: 1)
Arid Ecosystems     Hybrid Journal   (Followers: 2, SJR: 0.2, CiteScore: 0)
Arkiv för Matematik     Hybrid Journal   (Followers: 1, SJR: 0.766, CiteScore: 1)
Arnold Mathematical J.     Hybrid Journal   (Followers: 1, SJR: 0.355, CiteScore: 0)
Arthropod-Plant Interactions     Hybrid Journal   (Followers: 2, SJR: 0.839, CiteScore: 2)
Arthroskopie     Hybrid Journal   (Followers: 1, SJR: 0.131, CiteScore: 0)
Artificial Intelligence and Law     Hybrid Journal   (Followers: 11, SJR: 0.937, CiteScore: 2)
Artificial Intelligence Review     Hybrid Journal   (Followers: 14, SJR: 0.833, CiteScore: 4)
Artificial Life and Robotics     Hybrid Journal   (Followers: 9, SJR: 0.226, CiteScore: 0)
Asia Europe J.     Hybrid Journal   (Followers: 5, SJR: 0.504, CiteScore: 1)
Asia Pacific Education Review     Hybrid Journal   (Followers: 12, SJR: 0.479, CiteScore: 1)
Asia Pacific J. of Management     Hybrid Journal   (Followers: 16, SJR: 1.185, CiteScore: 2)
Asia-Pacific Education Researcher     Hybrid Journal   (Followers: 12, SJR: 0.353, CiteScore: 1)
Asia-Pacific Financial Markets     Hybrid Journal   (Followers: 2, SJR: 0.187, CiteScore: 0)
Asia-Pacific J. of Atmospheric Sciences     Hybrid Journal   (Followers: 19, SJR: 0.855, CiteScore: 1)
Asian Business & Management     Hybrid Journal   (Followers: 9, SJR: 0.378, CiteScore: 1)
Asian J. of Business Ethics     Hybrid Journal   (Followers: 9)
Asian J. of Criminology     Hybrid Journal   (Followers: 5, SJR: 0.543, CiteScore: 1)
AStA Advances in Statistical Analysis     Hybrid Journal   (Followers: 2, SJR: 0.548, CiteScore: 1)
AStA Wirtschafts- und Sozialstatistisches Archiv     Hybrid Journal   (Followers: 5, SJR: 0.183, CiteScore: 0)
ästhetische dermatologie & kosmetologie     Full-text available via subscription  

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Journal Cover
Applied Intelligence
Journal Prestige (SJR): 0.6
Citation Impact (citeScore): 2
Number of Followers: 12  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 1573-7497 - ISSN (Online) 0924-669X
Published by Springer-Verlag Homepage  [2350 journals]
  • Modified Cuckoo Optimization Algorithm (MCOA) to solve Precedence
           Constrained Sequencing Problem (PCSP)
    • Authors: Mansoureh Maadi; Mohammad Javidnia; Rohollah Ramezani
      Pages: 1407 - 1422
      Abstract: In recent years, new meta-heuristic algorithms have been developed to solve optimization problems. Recently-introduced Cuckoo Optimization Algorithm (COA) has proven its excellent performance to solve different optimization problems. Precedence Constrained Sequencing Problem (PCSP) is related to locating the optimal sequence with the shortest traveling time among all feasible sequences. The problem is motivated by applications in networks, scheduling, project management, logistics, assembly flow and routing. Regarding numerous practical applications of PCSP, it can be asserted that PCSP is a useful tool for a variety of industrial planning and scheduling problems. However it can also be seen that the most approaches may not solve various types of PCSPs and in related papers considering definite conditions, a model is determined and solved. In this paper a new approach is presented for solving various types of PCSPs based on COA. Since COA at first was introduced to solve continuous optimization problems, in order to demonstrate the application of COA to find the optimal sequence of the PCSP, some proposed schemes have been applied in this paper with modifications in operators of the basic COA. In fact due to the discrete nature and characteristics of the PCSP, the basic COA should be modified to solve PSCPs. To evaluate the performance of the proposed algorithm, at first, an applied single machine scheduling problem from the literature that can be formulated as a PCSP and has optimal solution is described and solved. Then, several PCSP instances with different sizes from the literature that do not have optimal solutions are solved and results are compared to the algorithms of the literature. Computational results show that the proposed algorithm has better performance compared to presented well-known meta-heuristic algorithms presented to solve various types of PCSPs so far.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1022-0
      Issue No: Vol. 48, No. 6 (2018)
       
  • An effective operations permutation-based discrete harmony search approach
           for the flexible job shop scheduling problem with makespan criterion
    • Authors: Mehdi Gaham; Brahim Bouzouia; Nouara Achour
      Pages: 1423 - 1441
      Abstract: The Flexible Job Shop Scheduling Problem (FJSSP) represents a challenging applicative problem for metaheuristic algorithms because it imposes the development of innovative domain-dependent search operators that have to deal both with its combined discrete and permutation nature. Emerging as an effective approach for the resolution of a broad spectrum of hard optimization problems, some few discrete declinations of the Harmony Search (HS) algorithm have been recently proposed for tackling the FJSSP. Recent advances include an investigation of an innovative and promising permutation-based proposal. Accordingly, this paper proposes an Effective Operations Permutation-based Discrete Harmony Search (EOP-DHS) approach for FJSSP with Makespan criterion. The approach adopts an integrated two-part “affectation-sequencing” representation of the solution harmony and a dedicated improvisation operator particularly adapted to the integer-valued and operations permutation-based used coding scheme. Besides, a Modified Intelligent Mutation (MIM) operator is integrated to the adopted framework in order to enhance its overall search ability. Mainly, by balancing maximum machine workload during the overall search process, MIM operator allows essentially maintaining and enhancing the reciprocal equilibrium of diversification and intensification abilities of the proposed EOP-DHS algorithm. Conducted numerical experimentations on 188 benchmarking instances validate the proposal comparatively to a representative set of previously deployed metaheuristic approaches to FJSSP with Makespan criterion. Furthermore, main contribution of the paper is extended with an experimental procedure proving the effectiveness of the adopted permutation-based HS scheme for the resolution of combinatorial optimization problems. Hard benchmarking instances of the classical Job Shop Scheduling Problem (JSSP) are thus considered for exemplification.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-0993-1
      Issue No: Vol. 48, No. 6 (2018)
       
  • Semantic schema modeling for genetic programming using clustering of
           building blocks
    • Authors: Zahra Zojaji; Mohammad Mehdi Ebadzadeh
      Pages: 1442 - 1460
      Abstract: Semantic schema theory is a theoretical model used to describe the behavior of evolutionary algorithms. It partitions the search space to schemata, defined in semantic level, and studies their distribution during the evolution. Semantic schema theory has definite advantages over popular syntactic schema theories, for which the reliability and usefulness are criticized. Integrating semantic awareness in genetic programming (GP) in recent years sheds new light also on schema theory investigations. This paper extends the recent work in semantic schema theory of GP by utilizing information based clustering. To this end, we first define the notion of semantics for a tree based on the mutual information between its output vector and the target and introduce semantic building blocks to facilitate the modeling of semantic schema. Then, we propose information based clustering to cluster the building blocks. Trees are then represented in terms of the active occurrence of building block clusters and schema instances are characterized by an instantiation function over this representation. Finally, the expected number of schema samples is predicted by the suggested theory. In order to evaluate the suggested schema, several experiments were conducted and the generalization, diversity preserving capability and efficiency of the schema were investigated. The results are encouraging and remarkably promising compared with the existing semantic schema.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1052-7
      Issue No: Vol. 48, No. 6 (2018)
       
  • Parallel reduced multi-class contour preserving classification
    • Authors: Piyabute Fuangkhon
      Pages: 1461 - 1490
      Abstract: Multi-class contour preserving classification is a contour conservancy technique that synthesizes two types of vectors; fundamental multi-class outpost vectors (FMCOVs) and additional multi-class outpost vectors (AMCOVs), at the judging border between classes of data to improve the classification accuracy of the feed-forward neural network. However, the number of both new vectors is tremendous, resulting in a significantly prolonged training time. Reduced multi-class contour preserving classification provides three practical methods to lessen the number of FMCOVs and AMCOVs. Nevertheless, the three reduced multi-class outpost vector methods are serial and therefore have limited applicability on modern machines with multiple CPU cores or processors. This paper presents the methodologies and the frameworks of the three parallel reduced multi-class outpost vector methods that can effectively utilize thread-level parallelism and process-level parallelism to (1) substantially lessen the number of FMCOVs and AMCOVs, (2) efficiently increase the speedups in execution times to be proportional to the number of available CPU cores or processors, and (3) significantly increase the classification performance (accuracy, precision, recall, and F1 score) of the feed-forward neural network. The experiments carried out on the balanced and imbalanced real-world multi-class data sets downloaded from the UCI machine learning repository confirmed the reduction performance, the speedups, and the classification performance aforementioned.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1049-2
      Issue No: Vol. 48, No. 6 (2018)
       
  • Efficient method for updating class association rules in dynamic datasets
           with record deletion
    • Authors: Loan T. T. Nguyen; Ngoc-Thanh Nguyen; Bay Vo; Hung Son Nguyen
      Pages: 1491 - 1505
      Abstract: Association rule mining is an important topic in data mining. The problem is to discover all (or almost all) associations among items in the transaction database that satisfy some user-specified constraints. Usually, the constraints are related to minimal support and minimal confidence. Class association rules (CARs) are a special type of association rules that can be applied for classification problem. Previous research showed that classification based on association rules has higher accuracy than can be achieved with an inductive learning algorithm or C4.5. As such, many methods have been proposed for mining CARs, although these use batch processing. However, datasets are often changed, with records added or/and deleted, and consequently updating CARs is a challenging problem. This paper proposes an efficient method for updating CARs when records are deleted. First, we use an MECR-tree to store nodes for the original dataset. The information in the nodes of this tree are updated based on the deleted records. Second, the concept of pre-large itemsets is used to avoid rescanning the original dataset. Finally, we propose an algorithm to efficiently update and generate CARs. We also analyze the time complexity to show the efficiency of our proposed algorithm. The experimental results show that the proposed method outperforms mining CARs from the dataset after record deletion.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1023-z
      Issue No: Vol. 48, No. 6 (2018)
       
  • A new distance between BPAs based on the power-set-distribution pignistic
           probability function
    • Authors: Jingwei Zhu; Xiaodan Wang; Yafei Song
      Pages: 1506 - 1518
      Abstract: In Dempster-Shafer evidence theory, the pignistic probability function is used to transform the basic probability assignment (BPA) into pignistic probabilities. Since the transformation is from the power set of the frame of discernment to the set itself, it may cause some information loss. The distance between betting commitments is constructed on the basis of the pignistic probability function and is used to measure the dissimilarity between two BPAs. However, it is a pseudo-metric and it may bring unreasonable results in some cases. To solve such problem, we propose a power-set-distribution (PSD) pignistic probability function based on the new explanation of the non-singleton focal elements in the BPA. The new function is directly operated on the power set, so it takes more information contained in the BPA than the pignistic probability function does. Based on the new function, the distance between PSD betting commitments which can better measure the dissimilarity between two BPAs is also proposed, and the proof that it is a metric is provided. In order to demonstrate the performance of the new distance, numerical examples are given to compare it with three existing dissimilarity measures. Moreover, its applications in combining the conflicting BPAs are also presented through two examples.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1018-9
      Issue No: Vol. 48, No. 6 (2018)
       
  • Enhancing e-learning systems with personalized recommendation based on
           collaborative tagging techniques
    • Authors: Aleksandra Klašnja-Milićević; Mirjana Ivanović; Boban Vesin; Zoran Budimac
      Pages: 1519 - 1535
      Abstract: Personalization of the e-learning systems according to the learner’s needs and knowledge level presents the key element in a learning process. E-learning systems with personalized recommendations should adapt the learning experience according to the goals of the individual learner. Aiming to facilitate personalization of a learning content, various kinds of techniques can be applied. Collaborative and social tagging techniques could be useful for enhancing recommendation of learning resources. In this paper, we analyze the suitability of different techniques for applying tag-based recommendations in e-learning environments. The most appropriate model ranking, based on tensor factorization technique, has been modified to gain the most efficient recommendation results. We propose reducing tag space with clustering technique based on learning style model, in order to improve execution time and decrease memory requirements, while preserving the quality of the recommendations. Such reduced model for providing tag-based recommendations has been used and evaluated in a programming tutoring system.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1051-8
      Issue No: Vol. 48, No. 6 (2018)
       
  • An entropy-based distance measure for analyzing and detecting metamorphic
           malware
    • Authors: Esmaeel Radkani; Sattar Hashemi; Alireza Keshavarz-Haddad; Maryam Amir Haeri
      Pages: 1536 - 1546
      Abstract: Metamorphic malware is a kind of malware which evades signature-based anti-viruses by changing its internal structure in each infection. This paper, firstly, introduces a new measure of distance between two computer programs called program dissimilarity measure based on entropy (PDME). Then, it suggests a measure for the degree of metamorphism, based on the suggested distance measure. The distance measure is defined based on the Entropy of the two malware programs. Moreover, the paper shows that the distance measure can be used for classifying metamorphic malware via K-Nearest Neighbors (KNN) method. The method is evaluated by four metamorphic malware families. The results demonstrate that the measure can indicate the degree of metamorphism efficiently, and the KNN classification method using PDME can classify the metamorphic malware with a high precision.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1045-6
      Issue No: Vol. 48, No. 6 (2018)
       
  • One-class naïve Bayes with duration feature ranking for accurate user
           authentication using keystroke dynamics
    • Authors: Jiacang Ho; Dae-Ki Kang
      Pages: 1547 - 1564
      Abstract: Biometric-based approaches, including keystroke dynamics on keyboards, mice, and mobile devices, have incorporated machine learning algorithms to learn users’ typing behavior for authentication systems. Among the machine learning algorithms, one-class naïve Bayes (ONENB) has been shown to be effective when it is applied to anomaly tests; however, there have been few studies on applying the ONENB algorithm to keystroke dynamics-based authentication. We applied the ONENB algorithm to calculate the likelihood of attributes in keystroke dynamics data. Additionally, we propose the speed inspection in typing skills (SITS) algorithm designed from the observation that every person has a different typing speed on specific keys. These specific characteristics, also known as the keystroke’s index order, can be used as essential patterns for authentication systems to distinguish between a genuine user and imposter. To further evaluate the effectiveness of the SITS algorithm and examine the quality of each attribute type (e.g., dwell time and flight time), we investigated the influence of attribute types on the keystroke’s index order. From the experimental results of the proposed algorithms and their combination, we observed that the shortest/longest time attributes and separation of the attributes are useful for enhancing the performance of the proposed algorithms.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1020-2
      Issue No: Vol. 48, No. 6 (2018)
       
  • Independent travel recommendation algorithm based on analytical hierarchy
           process and simulated annealing for professional tourist
    • Authors: Qingyi Pan; Xiaoying Wang
      Pages: 1565 - 1581
      Abstract: Independent travelers, especially professional independent travelers, tend to plan their trip schedules according to their interests, preferred hotels, landmarks they wish to visit, budgets, time availability and various other factors. Hence, travel schedule planning is valuable for satisfying the unique needs of each traveler. In this paper, we propose an algorithm for independent travel recommendation, consisting of three steps. Firstly, landmarks in the destination are selected under the specific constraints, which is modeled as a 0-1 knapsack problem. Then, the landmarks will be evaluated comprehensively using AHP (Analytic Hierarchy Process) model, and the greedy simulated annealing algorithm is adopted to select the best landmarks with high evaluation scores. Next, with AHP-decision model, a most reasonable free line to the tourist destination is selected from multiple candidates. Lastly, the path planning among the landmarks is abstracted as a TSP (Travelling Sales Problem) problem, and the simulated annealing algorithm based on roulette wheel selection is adopted to solve it. Through simulation experiments, by comparing with package tour from the aspects of landmark selection, valid sightseeing time ratio, valid sightseeing consumption ratio and the tourist satisfaction, the proposed algorithm is evaluated and analyzed. Simulation results illustrate the feasibility and rationality of our approach, which can be used as an effective reference deciding individualized travel schedules and trip planning.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1014-0
      Issue No: Vol. 48, No. 6 (2018)
       
  • A modified artificial bee colony approach for the 0-1 knapsack problem
    • Authors: Jie Cao; Baoqun Yin; Xiaonong Lu; Yu Kang; Xin Chen
      Pages: 1582 - 1595
      Abstract: The 0-1 knapsack problem (KP01) is one of the classical NP-hard problems in operation research and has a number of engineering applications. In this paper, the BABC-DE (binary artificial bee colony algorithm with differential evolution), a modified artificial bee colony algorithm, is proposed to solve KP01. In BABC-DE, a new binary searching operator which comprehensively considers the memory and neighbour information is designed in the employed bee phase, and the mutation and crossover operations of differential evolution are adopted in the onlooker bee phase. In order to make the searching solution feasible, a repair operator based on greedy strategy is employed. Experimental results on different dimensional KP01s verify the efficiency of the proposed method, and it gets superior performance compared with other five metaheuristic algorithms.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1025-x
      Issue No: Vol. 48, No. 6 (2018)
       
  • APS 9: an improved adaptive population-based simplex method for real-world
           engineering optimization problems
    • Authors: Mahamed G. H. Omran; Maurice Clerc
      Pages: 1596 - 1608
      Abstract: The adaptive population-based simplex (APS) algorithm is a recently-proposed optimization method for solving continuous optimization problems. In this paper, a new variant of APS, referred to as APS 9, is proposed to solve engineering optimization problems. APS 9 still follows the main structure of APS where three strategies (i.e., reflection, contraction and local search) can be used to improve the population of solutions. However, the three strategies have been significantly modified and the rules for applying them have been revised. A stagnation detection mechanism and duplicates removal step have been added. The proposed method is compared with the winners of the IEEE CEC 2005 and CEC 2011 competitions on the 22 CEC 2011 problems. The results show the superiority of APS 9 compared to the other two methods. Moreover, APS 9 has been compared with two recent optimization methods on the same test bed. The limitations of the CEC 2011 competition are also discussed and new rules that are more engineering-friendly are proposed.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1015-z
      Issue No: Vol. 48, No. 6 (2018)
       
  • Image steganalysis using improved particle swarm optimization based
           feature selection
    • Authors: Ali Adeli; Ali Broumandnia
      Pages: 1609 - 1622
      Abstract: Image steganalysis is the task of discovering the hidden message in a multimedia file in which the steganalysis technique highly depends on the feature elements of the image. Since there is a possibility for a feature vector to contain redundant elements, processing of redundant elements can be harmful in terms of long computation cost and large storage space. This paper proposes a new feature selection approach based on Adaptive inertia weight-based Particle Swarm Optimization (APSO) for the image steganalysis where the inertia weight of PSO is adaptively adjusted using the swarm diameter, average distance of particles around the center and average speed of particles towards the center. Also, the proposed APSO is used with the novel measure of Area Under the receiver operating characteristics Curve (AUC) as the fitness function to enhance the performance of identification of stego-images from the cover images in steganalysis problem. Due to appropriate convergence rate and the regulated search step of APSO, it is able to select the most significant and influential feature elements and so, the performance of steganalysis will be improved. Experimental results of the proposed method on Breaking Out Steganography System (BOSS) benchmark proves the superiority of the proposed method compared to the similar approaches in image steganalysis in terms of detection of stego-image, running time, and diversity measure.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-0989-x
      Issue No: Vol. 48, No. 6 (2018)
       
  • AmbISPDM
    • Authors: George Hatzivasilis; Ioannis Papaefstathiou; Dimitris Plexousakis; Charalampos Manifavas; Nikos Papadakis
      Pages: 1623 - 1643
      Abstract: The need to manage embedded systems, brought forward by the wider adoption of pervasive computing, is particularly vital in the context of secure and safety-critical applications. Technology infiltrates in ordinary things, hitching intelligence and materializing smart systems. Each of these individual entities monitors a specific set of parameters and deduces a constrained local view of the surrounding environment. Many distributed devices exchange information in order to infer the real system state and achieve a consistent global view. However, conflicts may arise due to the integration of deficit pieces of local knowledge. Robust and efficient conflict resolution is essential, especial in cases of emergency where the system must contribute with timely and accurate data to the overall crisis management operation. In this paper, we present AmbISPDM – a formal framework for the management of embedded systems with a coherent conflict resolution mechanism. The process is implemented as a software agent’s reasoning behaviour and applied in the multi-agent domain. As a proof of concept, a smart university campus setting is deployed, with agents controlling embedded devices to assist living conditions in normal operation and the evacuation planning in case of fire.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1030-0
      Issue No: Vol. 48, No. 6 (2018)
       
  • An adaptive sampling strategy for Kriging metamodel based on Delaunay
           triangulation and TOPSIS
    • Authors: Ping Jiang; Yahui Zhang; Qi Zhou; Xinyu Shao; Jiexiang Hu; Leshi Shu
      Pages: 1644 - 1656
      Abstract: Metamodels have been widely used in engineering design and optimization. Sampling method plays an important role in the constructing of metamodels. This paper proposes an adaptive sampling strategy for Kriging metamodel based on Delaunay triangulation and TOPSIS (KMDT). In the proposed KMDT, Delaunay triangulation is employed to partition the design space according to current sample points. The area of each partitioned triangle is used to indicate the degree of dispersion of sample points, and the prediction error of Kriging metamodel at each triangle’s centroid is used to represent the local error of each triangle region. By calculating the weight of the area and prediction error for each triangle region using the entropy method and TOPSIS, the degree of dispersion of sample points and local errors of metamodel are taken into consideration to make a trade-off between global exploration and local exploitation during the sequential sampling process. As a demonstration, the proposed approach is compared to other three sampling methods using several numerical cases and the modeling of the aerodynamic coefficient for a three-dimensional aircraft. The result reveals that the proposed approach provides more accurate metamodel at the same simulation cost, which is very important in metamodel-based engineering design problems.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-017-1031-z
      Issue No: Vol. 48, No. 6 (2018)
       
  • GMMA: GPU-based multiobjective memetic algorithms for vehicle routing
           problem with route balancing
    • Authors: Zizhen Zhang; Yuyan Sun; Hong Xie; Yi Teng; Jiahai Wang
      Abstract: A multiobjective optimization problem called a vehicle routing problem with route balancing (VRPRB) is studied. VRPRB extends traditional VRPs by considering two objectives simultaneously. The first objective is the minimization of the total traveling cost and the second one tries to ensure the balance among multiple routes. Different from another commonly used balancing objective, namely, the minimization of the difference between the maximal and minimal route cost, the objective we introduce is the minimization of the maximal route cost. Such setting can effectively avoid the occurrence of distorted solutions. In order to find Pareto-optimal solutions of VRPRB, we develop a multiobjective memetic algorithm (MMA), which integrates a problem-specific local search procedure into a multiobjective evolutionary algorithm. The MMA is further enhanced by using parallel computations on GPU devices. A simple version and a revised version of GPU-based MMAs are proposed and implemented on the CUDA platform. All the algorithms are tested on the benchmark instances to demonstrate their efficacy and effectiveness. Furthermore, the performances of CPU-based and GPU-based algorithms are analyzed.
      PubDate: 2018-06-05
      DOI: 10.1007/s10489-018-1210-6
       
  • Deep learning-based personality recognition from text posts of online
           social networks
    • Authors: Di Xue; Lifa Wu; Zheng Hong; Shize Guo; Liang Gao; Zhiyong Wu; Xiaofeng Zhong; Jianshan Sun
      Abstract: Personality is an important psychological construct accounting for individual differences in people. Computational personality recognition from online social networks is gaining increased research attention in recent years. However, the majority of existing methodologies mainly focused on human-designed shallow statistical features and didn’t make full use of the rich semantic information in user-generated texts, while those texts are exactly the most direct way for people to translate their internal thoughts and emotions into a form that others can understand. This paper proposes a deep learning-based approach for personality recognition from text posts of online social network users. We first utilize a hierarchical deep neural network composed of our newly designed AttRCNN structure and a variant of the Inception structure to learn the deep semantic features of each user’s text posts. Then we concatenate the deep semantic features with the statistical linguistic features obtained directly from the text posts, and feed them into traditional regression algorithms to predict the real-valued Big Five personality scores. Experimental results show that the deep semantic feature vectors learned from our proposed neural network are more effective than the other four kinds of non-trivial baseline features; the approach that utilizes the concatenation of our deep semantic features and the statistical linguistic features as the input of the gradient boosting regression algorithm achieves the lowest average prediction error among all the approaches tested by us.
      PubDate: 2018-06-05
      DOI: 10.1007/s10489-018-1212-4
       
  • Entropy based fuzzy least squares twin support vector machine for class
           imbalance learning
    • Authors: Deepak Gupta; Bharat Richhariya
      Abstract: In classification problems, the data samples belonging to different classes have different number of samples. Sometimes, the imbalance in the number of samples of each class is very high and the interest is to classify the samples belonging to the minority class. Support vector machine (SVM) is one of the widely used techniques for classification problems which have been applied for solving this problem by using fuzzy based approach. In this paper, motivated by the work of Fan et al. (Knowledge-Based Systems 115: 87–99 2017), we have proposed two efficient variants of entropy based fuzzy SVM (EFSVM). By considering the fuzzy membership value for each sample, we have proposed an entropy based fuzzy least squares support vector machine (EFLSSVM-CIL) and entropy based fuzzy least squares twin support vector machine (EFLSTWSVM-CIL) for class imbalanced datasets where fuzzy membership values are assigned based on entropy values of samples. It solves a system of linear equations as compared to the quadratic programming problem (QPP) as in EFSVM. The least square versions of the entropy based SVM are faster than EFSVM and give higher generalization performance which shows its applicability and efficiency. Experiments are performed on various real world class imbalanced datasets and compared the results of proposed methods with new fuzzy twin support vector machine for pattern classification (NFTWSVM), entropy based fuzzy support vector machine (EFSVM), fuzzy twin support vector machine (FTWSVM) and twin support vector machine (TWSVM) which clearly illustrate the superiority of the proposed EFLSTWSVM-CIL.
      PubDate: 2018-06-02
      DOI: 10.1007/s10489-018-1204-4
       
  • A novel cuckoo search algorithm with multiple update rules
    • Authors: Jiatang Cheng; Lei Wang; Qiaoyong Jiang; Yan Xiong
      Abstract: In this paper, we propose a novel cuckoo search algorithm with multiple update rules, referred to as a hybrid CS algorithm (HCS). In the presented approach, to overcome the mutual interference among dimensions and enhance the local search capability, two different one-dimensional update rules are integrated into CS framework for acquiring the candidate solutions. Moreover, using the characteristic of occasionally long jumps in Levy distribution, the proper selection between the one-dimensional update rules and Levy flight random walk is achieved by setting a limit value, so as to further enhance the exploration ability. The performance of the presented algorithm is then extensively investigated on 49 benchmark test functions including 11 common instances, 10 instances introduced in CEC 2005, and 28 instances presented in CEC 2013. The experimental results indicate that HCS algorithm is better than other CS variants in terms of solution accuracy and robustness, and it also outperforms the seven state-of-the-art intelligent algorithms.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-018-1198-y
       
  • A novel adaptive learning algorithm for low-dimensional feature space
           using memristor-crossbar implementation and on-chip training
    • Authors: Sajad Haghzad Klidbary; Saeed Bagheri Shouraki
      Abstract: Proposing an efficient algorithm with an appropriate hardware implementation has always been an interesting and a rather challenging field of research in Artificial Intelligence (AI). Fuzzy logic is one of the techniques that can be used for accurate and high-speed modeling as well as controlling complex and nonlinear systems. The “defuzzification” process during the test phase as well as the repetitive processes in order to find the optimal parameters during the training phase, lead to some serious limitations in real-time applications and hardware implementation of these algorithms. The proposed algorithm employs Ink Drop Spread (IDS) concept to mimic the functionality of human brain. In this algorithm, learning is based on the distance between training data and the “learning plane”. Unlike previous algorithms, the new one does not need to partition nor the input space neither the calculation of IDS plane features. Besides, the output is obtained without using the optimization methods. The proposed algorithm is a numerical foundation that does not encounter a processing problem and lack of memory in dealing with different datasets consisting of a large number of samples. This algorithm can be efficiently implemented on memristor crossbar/CMOS hardware platform in terms of area and speed. This hardware has the ability to learn and adapt to the environment regardless of a host system (on-chip learning capability). Finally, to verify the performance of the proposed algorithm, it has been compared to ALM, RBF and PNN algorithms which have a similar functionality.
      PubDate: 2018-06-01
      DOI: 10.1007/s10489-018-1202-6
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 54.224.85.115
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-