Search

The concept of topological Fano resonance, characterized by an ultrasharp asymmetric line shape, is a promising candidate for robust sensing applications due to its sensitivity to external parameters and immunity to structural disorder. In this study, the vacancy-induced topological Fano resonance in a nanoribbon made up of a hexagonal lattice with armchair sides is examined by introducing several on-site vacancies, which are deliberately created at regular distances, along a zigzag chain that stretches across the width of the ribbon. The presence of the on-site vacancies can create localized energy states within the electronic band structure, leading to the formation of an impurity band, which can result in Fano resonance phenomena by forming a conductivity channel between the edge modes on both armchair sides of the ribbon. Consequently, an ultracompact tunable on-chip integrated topological Fano resonance derived from the graphene-based nanomechanical phononic crystals is proposed. The Fano resonance arises from the interference between topologically protected even and odd edge modes at the interface between trivial and nontrivial insulators in a nanoribbon structure governed by the Kane-Mele model describing the quantum spin Hall effect in hexagonal lattices. The simulation of the topological Fano resonance is performed analytically using the Lippmann-Schwinger scattering formulation. One of the advantages of the present study is that the related calculations are carried out analytically, and in addition to the simplicity and directness, it reproduces the results obtained from the Landauer-B\"{u}ttiker formulation very well both quantitatively and qualitatively. The findings open up possibilities for the design of highly sensitive and accurate robust sensors for detecting extremely tiny forces, masses, and spatial positions.

Large Language Models (LLMs) have demonstrated extraordinary capabilities and contributed to multiple fields, such as generating and summarizing text, language translation, and question-answering. Nowadays, LLM is becoming a very popular tool in computerized language processing tasks, with the capability to analyze complicated linguistic patterns and provide relevant and appropriate responses depending on the context. While offering significant advantages, these models are also vulnerable to security and privacy attacks, such as jailbreaking attacks, data poisoning attacks, and Personally Identifiable Information (PII) leakage attacks. This survey provides a thorough review of the security and privacy challenges of LLMs for both training data and users, along with the application-based risks in various domains, such as transportation, education, and healthcare. We assess the extent of LLM vulnerabilities, investigate emerging security and privacy attacks for LLMs, and review the potential defense mechanisms. Additionally, the survey outlines existing research gaps in this domain and highlights future research directions.

A novel method has been devised to compute the Local Integrals of Motion (LIOMs) for a one-dimensional many-body localized system. In this approach, a class of optimal unitary transformations is deduced in a tensor-network formalism to diagonalize the Hamiltonian of the specified system. To construct the tensor network, we utilize the eigenstates of the subsystems Hamiltonian to attain the desired unitary transformations. Subsequently, we optimize the eigenstates and acquire appropriate unitary localized operators that will represent the LIOMs tensor network. The efficiency of the method was assessed and found to be both fast and almost accurate. In framework of the introduced tensor-network representation, we examine how the entanglement spreads along the considered many-body localized system and evaluate the outcomes of the approximations employed in this approach. The important and interesting result is that in the proposed tensor network approximation, if the length of the blocks is greater than the length of localization, then the entropy growth will be linear in terms of the logarithmic time. Also, it has been demonstrated that, the entanglement can be calculated by only considering two blocks next to each other, if the Hamiltonian has been diagonalized using the unitary transformation made by the provided tensor-network representation.

Federated learning (FL) is gaining increasing popularity in the medical domain for analyzing medical images, which is considered an effective technique to safeguard sensitive patient data and comply with privacy regulations. However, several recent studies have revealed that the default settings of FL may leak private training data under privacy attacks. Thus, it is still unclear whether and to what extent such privacy risks of FL exist in the medical domain, and if so, "how to mitigate such risks?". In this paper, first, we propose a holistic framework for Medical data Privacy risk analysis and mitigation in Federated Learning (MedPFL) to analyze privacy risks and develop effective mitigation strategies in FL for protecting private medical data. Second, we demonstrate the substantial privacy risks of using FL to process medical images, where adversaries can easily perform privacy attacks to reconstruct private medical images accurately. Third, we show that the defense approach of adding random noises may not always work effectively to protect medical images against privacy attacks in FL, which poses unique and pressing challenges associated with medical data for privacy protection., Comment: V1

Federated Learning (FL) has gained widespread popularity in recent years due to the fast booming of advanced machine learning and artificial intelligence along with emerging security and privacy threats. FL enables efficient model generation from local data storage of the edge devices without revealing the sensitive data to any entities. While this paradigm partly mitigates the privacy issues of users' sensitive data, the performance of the FL process can be threatened and reached a bottleneck due to the growing cyber threats and privacy violation techniques. To expedite the proliferation of FL process, the integration of blockchain for FL environments has drawn prolific attention from the people of academia and industry. Blockchain has the potential to prevent security and privacy threats with its decentralization, immutability, consensus, and transparency characteristic. However, if the blockchain mechanism requires costly computational resources, then the resource-constrained FL clients cannot be involved in the training. Considering that, this survey focuses on reviewing the challenges, solutions, and future directions for the successful deployment of blockchain in resource-constrained FL environments. We comprehensively review variant blockchain mechanisms that are suitable for FL process and discuss their trade-offs for a limited resource budget. Further, we extensively analyze the cyber threats that could be observed in a resource-constrained FL environment, and how blockchain can play a key role to block those cyber attacks. To this end, we highlight some potential solutions towards the coupling of blockchain and federated learning that can offer high levels of reliability, data privacy, and distributed computing performance.

The emergent integrability in a many-body localized (MBL) system can be well characterized by the existence of the complete set of local integrals of motion (LIOMs). Such exactly conserved and exponentially localized operators are often understood as quasiparticle operators which can be expanded in terms of single-particle operators dressed with different numbers of particle-hole pairs. Here, we consider a one-dimensional XXZ spin-$\frac12$ Heisenberg chain in the presence of a random field and try to quantify the corrections needed to be considered in the picture of quasiparticles associated with LIOMs due to the presence of particle-hole excitations. To this end, we explicitly present the multibody expansion of LIOM creation operators of the system in the MBL regime. We analytically obtain the coefficients of this expansion and discuss the effect of higher-order corrections associated with different numbers of particle-hole excitations. Our analysis shows that depending on the localization length of the system, there exist a regime in which the contributions that come from higher-order terms can break down the effective one-particle description of the LIOMs and such quasiparticles become essentially many-body-like.

Understanding 3D point cloud models for learning purposes has become an imperative challenge for real-world identification such as autonomous driving systems. A wide variety of solutions using deep learning have been proposed for point cloud segmentation, object detection, and classification. These methods, however, often require a considerable number of model parameters and are computationally expensive. We study a semantic dimension of given 3D data points and propose an efficient method called Meta-Semantic Learning (Meta-SeL). Meta-SeL is an integrated framework that leverages two input 3D local points (input 3D models and part-segmentation labels), providing a time and cost-efficient, and precise projection model for a number of 3D recognition tasks. The results indicate that Meta-SeL yields competitive performance in comparison with other complex state-of-the-art work. Moreover, being random shuffle invariant, Meta-SeL is resilient to translation as well as jittering noise., Comment: The 6th International Conference on Applied Cognitive Computing

Many-body localization (MBL) is a novel prototype of ergodicity breaking due to the emergence of local integrals of motion (LIOMs) in a disordered interacting quantum system. To better understand the role played by the existence of such macroscopically LIOMs, we explore and study some of their structural properties across the MBL transition. We first, consider a one-dimensional XXZ spin chain in a disordered magnetic field and introduce and implement a non-perturbative, fast, and accurate method of constructing LIOMs. In contrast to already existing methods, our scheme allows obtaining LIOMs not only in the deep MBL phase but rather, near the transition point too. Then, we take the matrix representation of LIOM operators as an adjacency matrix of a directed graph whose elements describe the connectivity of ordered eigenbasis in the Hilbert-space. Our cluster size analysis for this graph shows that the MBL transition coincides with a percolation transition in the Hilbert-space. By performing finite-size scaling, we compare the critical disorder and correlation exponent $\nu$ both in the presence and absence of interaction. Finally, we also discuss how the distribution of diagonal elements of LIOM operators in a typical cluster signals the transition.

We theoretically investigate the thermoelectric properties of zigzag bilayer phosphorene nanoribbons (ZBPNR). We first, draw an analogy between the extended Su-Schrieffer-Heeger (SSH) ladder and ZBPNR edge states and obtain their corresponding band structure and wave functions analytically. Then, by applying the energy filtering method, we show that the electric power and thermoelectric efficiency of the ZBPNRs can be improved remarkably in the presence of mid-gap edge states. We also argue how to engineer the edge modes to further optimize thermoelectric power and efficiency of the system by applying periodic point potentials at the boundaries.

In the past 30 years, scientists have searched nature, including animals and insects, and biology in order to discover, understand, and model solutions for solving large-scale science challenges. The study of bionics reveals that how the biological structures, functions found in nature have improved our modern technologies. In this study, we present our discovery of evolutionary and nature-inspired algorithms applications in Data Science and Data Analytics in three main topics of pre-processing, supervised algorithms, and unsupervised algorithms. Among all applications, in this study, we aim to investigate four optimization algorithms that have been performed using the evolutionary and nature-inspired algorithms within data science and analytics. Feature selection optimization in pre-processing section, Hyper-parameter tuning optimization, and knowledge discovery optimization in supervised algorithms, and clustering optimization in the unsupervised algorithms.

Hyperparameter tuning in machine learning algorithms is a computationally challenging task due to the large-scale nature of the problem. In order to develop an efficient strategy for hyper-parameter tuning, one promising solution is to use swarm intelligence algorithms. Artificial Bee Colony (ABC) optimization lends itself as a promising and efficient optimization algorithm for this purpose. However, in some cases, ABC can suffer from a slow convergence rate or execution time due to the poor initial population of solutions and expensive objective functions. To address these concerns, a novel algorithm, OptABC, is proposed to help ABC algorithm in faster convergence toward a near-optimum solution. OptABC integrates artificial bee colony algorithm, K-Means clustering, greedy algorithm, and opposition-based learning strategy for tuning the hyper-parameters of different machine learning models. OptABC employs these techniques in an attempt to diversify the initial population, and hence enhance the convergence ability without significantly decreasing the accuracy. In order to validate the performance of the proposed method, we compare the results with previous state-of-the-art approaches. Experimental results demonstrate the effectiveness of the OptABC compared to existing approaches in the literature., Comment: 8 pages

The explosion of advancements in artificial intelligence, sensor technologies, and wireless communication activates ubiquitous sensing through distributed sensors. These sensors are various domains of networks that lead us to smart systems in healthcare, transportation, environment, and other relevant branches/networks. Having collaborative interaction among the smart systems connects end-user devices to each other which enables achieving a new integrated entity called Smart Cities. The goal of this study is to provide a comprehensive survey of data analytics in smart cities. In this paper, we aim to focus on one of the smart cities important branches, namely Smart Mobility, and its positive ample impact on the smart cities decision-making process. Intelligent decision-making systems in smart mobility offer many advantages such as saving energy, relaying city traffic, and more importantly, reducing air pollution by offering real-time useful information and imperative knowledge. Making a decision in smart cities in time is challenging due to various and high dimensional factors and parameters, which are not frequently collected. In this paper, we first address current challenges in smart cities and provide an overview of potential solutions to these challenges. Then, we offer a framework of these solutions, called universal smart cities decision making, with three main sections of data capturing, data analysis, and decision making to optimize the smart mobility within smart cities. With this framework, we elaborate on fundamental concepts of big data, machine learning, and deep leaning algorithms that have been applied to smart cities and discuss the role of these algorithms in decision making for smart mobility in smart cities., Comment: 12 pages, 2 figures

Machine learning techniques lend themselves as promising decision-making and analytic tools in a wide range of applications. Different ML algorithms have various hyper-parameters. In order to tailor an ML model towards a specific application, a large number of hyper-parameters should be tuned. Tuning the hyper-parameters directly affects the performance (accuracy and run-time). However, for large-scale search spaces, efficiently exploring the ample number of combinations of hyper-parameters is computationally challenging. Existing automated hyper-parameter tuning techniques suffer from high time complexity. In this paper, we propose HyP-ABC, an automatic innovative hybrid hyper-parameter optimization algorithm using the modified artificial bee colony approach, to measure the classification accuracy of three ML algorithms, namely random forest, extreme gradient boosting, and support vector machine. Compared to the state-of-the-art techniques, HyP-ABC is more efficient and has a limited number of parameters to be tuned, making it worthwhile for real-world hyper-parameter optimization problems. We further compare our proposed HyP-ABC algorithm with state-of-the-art techniques. In order to ensure the robustness of the proposed method, the algorithm takes a wide range of feasible hyper-parameter values, and is tested using a real-world educational dataset., Comment: 6 figures, 2 tables

A smart city can be seen as a framework, comprised of Information and Communication Technologies (ICT). An intelligent network of connected devices that collect data with their sensors and transmit them using cloud technologies in order to communicate with other assets in the ecosystem plays a pivotal role in this framework. Maximizing the quality of life of citizens, making better use of resources, cutting costs, and improving sustainability are the ultimate goals that a smart city is after. Hence, data collected from connected devices will continuously get thoroughly analyzed to gain better insights into the services that are being offered across the city; with this goal in mind that they can be used to make the whole system more efficient. Robots and physical machines are inseparable parts of a smart city. Embodied AI is the field of study that takes a deeper look into these and explores how they can fit into real-world environments. It focuses on learning through interaction with the surrounding environment, as opposed to Internet AI which tries to learn from static datasets. Embodied AI aims to train an agent that can See (Computer Vision), Talk (NLP), Navigate and Interact with its environment (Reinforcement Learning), and Reason (General Intelligence), all at the same time. Autonomous driving cars and personal companions are some of the examples that benefit from Embodied AI nowadays. In this paper, we attempt to do a concise review of this field. We will go through its definitions, its characteristics, and its current achievements along with different algorithms, approaches, and solutions that are being used in different components of it (e.g. Vision, NLP, RL). We will then explore all the available simulators and 3D interactable databases that will make the research in this area feasible. Finally, we will address its challenges and identify its potentials for future research., Comment: Cyberphysical Smart Cities Infrastructures: Optimal Operation and Intelligent Decision Making 2021

Medical Imaging is one of the growing fields in the world of computer vision. In this study, we aim to address the Diabetic Retinopathy (DR) problem as one of the open challenges in medical imaging. In this research, we propose a new lesion detection architecture, comprising of two sub-modules, which is an optimal solution to detect and find not only the type of lesions caused by DR, their corresponding bounding boxes, and their masks; but also the severity level of the overall case. Aside from traditional accuracy, we also use two popular evaluation criteria to evaluate the outputs of our models, which are intersection over union (IOU) and mean average precision (mAP). We hypothesize that this new solution enables specialists to detect lesions with high confidence and estimate the severity of the damage with high accuracy., Comment: The 7th International Conference on Health Informatics & Medical Systems (HIMS'21: July 26-29, 2021, USA)

Optimal Transport (OT) theory has seen an increasing amount of attention from the computer science community due to its potency and relevance in modeling and machine learning. It introduces means that serve as powerful ways to compare probability distributions with each other, as well as producing optimal mappings to minimize cost functions. In this survey, we present a brief introduction and history, a survey of previous work and propose directions of future study. We will begin by looking at the history of optimal transport and introducing the founders of this field. We then give a brief glance into the algorithms related to OT. Then, we will follow up with a mathematical formulation and the prerequisites to understand OT. These include Kantorovich duality, entropic regularization, KL Divergence, and Wassertein barycenters. Since OT is a computationally expensive problem, we then introduce the entropy-regularized version of computing optimal mappings, which allowed OT problems to become applicable in a wide range of machine learning problems. In fact, the methods generated from OT theory are competitive with the current state-of-the-art methods. We follow this up by breaking down research papers that focus on image processing, graph learning, neural architecture search, document representation, and domain adaptation. We close the paper with a small section on future research. Of the recommendations presented, three main problems are fundamental to allow OT to become widely applicable but rely strongly on its mathematical formulation and thus are hardest to answer. Since OT is a novel method, there is plenty of space for new research, and with more and more competitive methods (either on an accuracy level or computational speed level) being created, the future of applied optimal transport is bright as it has become pervasive in machine learning.

Machine learning is a powerful method for modeling in different fields such as education. Its capability to accurately predict students' success makes it an ideal tool for decision-making tasks related to higher education. The accuracy of machine learning models depends on selecting the proper hyper-parameters. However, it is not an easy task because it requires time and expertise to tune the hyper-parameters to fit the machine learning model. In this paper, we examine the effectiveness of automated hyper-parameter tuning techniques to the realm of students' success. Therefore, we develop two automated Hyper-Parameter Optimization methods, namely grid search and random search, to assess and improve a previous study's performance. The experiment results show that applying random search and grid search on machine learning algorithms improves accuracy. We empirically show automated methods' superiority on real-world educational data (MIDFIELD) for tuning HPs of conventional machine learning classifiers. This work emphasizes the effectiveness of automated hyper-parameter optimization while applying machine learning in the education field to aid faculties, directors', or non-expert users' decisions to improve students' success., Comment: 10 pages, 3 figure, 1 table

Armchair phosphorene nanoribbons (APNRs) are known to be semiconductors with an indirect bandgap. Here, we propose to introduce new states in the gap of APNRs by creating a periodic structure of vacancies (antidots). Based on the tight-binding model, we show that a periodic array of vacancies or nanopores leads to the formation of an impurity band inside the gap region. We first present an analytical expression for the dispersion relation of an impurity band induced by hybridization of bound states associated with each single vacancy defect. Then, we increase the size of vacancy defects to include a bunch of atoms and theoretically investigate the effect of nanopores size and their spacing on electronic band structure, carrier transmission function, and thermoelectric properties. Our analysis of the power generation rate and thermoelectric efficiency of these structures reveals that an ANPR can be used as a superb thermoelectric power generation module.

Smartphones, autonomous vehicles, and the Internet-of-things (IoT) devices are considered the primary data source for a distributed network. Due to a revolutionary breakthrough in internet availability and continuous improvement of the IoT devices capabilities, it is desirable to store data locally and perform computation at the edge, as opposed to share all local information with a centralized computation agent. A recently proposed Machine Learning (ML) algorithm called Federated Learning (FL) paves the path towards preserving data privacy, performing distributed learning, and reducing communication overhead in large-scale machine learning (ML) problems. This paper proposes an FL model by monitoring client activities and leveraging available local computing resources, particularly for resource-constrained IoT devices (e.g., mobile robots), to accelerate the learning process. We assign a trust score to each FL client, which is updated based on the client's activities. We consider a distributed mobile robot as an FL client with resource limitations either in memory, bandwidth, processor, or battery life. We consider such mobile robots as FL clients to understand their resource-constrained behavior in a real-world setting. We consider an FL client to be untrustworthy if the client infuses incorrect models or repeatedly gives slow responses during the FL process. After disregarding the ineffective and unreliable client, we perform local training on the selected FL clients. To further reduce the straggler issue, we enable an asynchronous FL mechanism by performing aggregation on the FL server without waiting for a long period to receive a particular client's response.

Malware detection has become a challenging task due to the increase in the number of malware families. Universal malware detection algorithms that can detect all the malware families are needed to make the whole process feasible. However, the more universal an algorithm is, the higher number of feature dimensions it needs to work with, and that inevitably causes the emerging problem of Curse of Dimensionality (CoD). Besides, it is also difficult to make this solution work due to the real-time behavior of malware analysis. In this paper, we address this problem and aim to propose a feature selection based malware detection algorithm using an evolutionary algorithm that is referred to as Artificial Bee Colony (ABC). The proposed algorithm enables researchers to decrease the feature dimension and as a result, boost the process of malware detection. The experimental results reveal that the proposed method outperforms the state-of-the-art.

DRDr II is a hybrid of machine learning and deep learning worlds. It builds on the successes of its antecedent, namely, DRDr, that was trained to detect, locate, and create segmentation masks for two types of lesions (exudates and microaneurysms) that can be found in the eyes of the Diabetic Retinopathy (DR) patients; and uses the entire model as a solid feature extractor in the core of its pipeline to detect the severity level of the DR cases. We employ a big dataset with over 35 thousand fundus images collected from around the globe and after 2 phases of preprocessing alongside feature extraction, we succeed in predicting the correct severity levels with over 92% accuracy., Comment: The 2020 International Conference on Computational Science and Computational Intelligence (CSCI'2020)

Risk and response communication of public agencies through social media played a significant role in the emergence and spread of novel Coronavirus (COVID-19) and such interactions were echoed in other information outlets. This study collected time-sensitive online social media data and analyzed such communication patterns from public health (WHO, CDC), emergency (FEMA), and transportation (FDOT) agencies using data-driven methods. The scope of the work includes a detailed understanding of how agencies communicate risk information through social media during a pandemic and influence community response (i.e. timing of lockdown, timing of reopening) and disease outbreak indicators (i.e. number of confirmed cases, number of deaths). The data includes Twitter interactions from different agencies (2.15K tweets per agency on average) and crowdsourced data (i.e. Worldometer) on COVID-19 cases and deaths were observed between February 21, 2020 and June 06, 2020. Several machine learning techniques such as (i.e. topic mining and sentiment ratings over time) are applied here to identify the dynamics of emergent topics during this unprecedented time. Temporal infographics of the results captured the agency-levels variations over time in circulating information about the importance of face covering, home quarantine, social distancing and contact tracing. In addition, agencies showed differences in their discussions about community transmission, lack of personal protective equipment, testing and medical supplies, use of tobacco, vaccine, mental health issues, hospitalization, hurricane season, airports, construction work among others. Findings could support more efficient transfer of risk and response information as communities shift to new normal as well as in future pandemics.

In this paper, we present a new Marshall-Olkin exponential shock model. The new construction method gives the proposed model further ability to allocate the common joint shock on each of the components, making it suitable for application in fields like reliability and credit risk. The given model has a singular part and supports both positive and negative dependence structure. Main dependence properties of the model is given and an analysis of stress-strength is presented. After a performance analysis on the estimator of parameters, a real data is studied. Finally, we give the multivariate version of the proposed model and its main properties.

Nowadays, devices are equipped with advanced sensors with higher processing/computing capabilities. Further, widespread Internet availability enables communication among sensing devices. As a result, vast amounts of data are generated on edge devices to drive Internet-of-Things (IoT), crowdsourcing, and other emerging technologies. The collected extensive data can be pre-processed, scaled, classified, and finally, used for predicting future events using machine learning (ML) methods. In traditional ML approaches, data is sent to and processed in a central server, which encounters communication overhead, processing delay, privacy leakage, and security issues. To overcome these challenges, each client can be trained locally based on its available data and by learning from the global model. This decentralized learning structure is referred to as Federated Learning (FL). However, in large-scale networks, there may be clients with varying computational resource capabilities. This may lead to implementation and scalability challenges for FL techniques. In this paper, we first introduce some recently implemented real-life applications of FL. We then emphasize on the core challenges of implementing the FL algorithms from the perspective of resource limitations (e.g., memory, bandwidth, and energy budget) of client clients. We finally discuss open issues associated with FL and highlight future directions in the FL area concerning resource-constrained devices.

Learning to learn plays a pivotal role in meta-learning (MTL) to obtain an optimal learning model. In this paper, we investigate mage recognition for unseen categories of a given dataset with limited training information. We deploy a zero-shot learning (ZSL) algorithm to achieve this goal. We also explore the effect of parameter tuning on performance of semantic auto-encoder (SAE). We further address the parameter tuning problem for meta-learning, especially focusing on zero-shot learning. By combining different embedded parameters, we improved the accuracy of tuned-SAE. Advantages and disadvantages of parameter tuning and its application in image classification are also explored., Comment: 6 pages, 2 algorithms, 3 figures

In this paper we propose a class of weighted rank correlation coefficients extending the Spearman's rho. The proposed class constructed by giving suitable weights to the distance between two sets of ranks to place more emphasis on items having low rankings than those have high rankings or vice versa. The asymptotic distribution of the proposed measures and properties of the parameters estimated by them are studied through the associated copula. A simulation study is performed to compare the performance of the proposed statistics for testing independence using asymptotic relative efficiency calculations.

This paper reintroduces the notion of resilience in the context of recent issues originated from climate change triggered events including severe hurricanes and wildfires. A recent example is PG&E's forced power outage to contain wildfire risk which led to widespread power disruption. This paper focuses on answering two questions: who is responsible for resilience? and how to quantify the monetary value of resilience? To this end, we first provide preliminary definitions of resilience for power systems. We then investigate the role of natural hazards, especially wildfire, on power system resilience. Finally, we will propose a decentralized strategy for a resilient management system using distributed storage and demand response resources. Our proposed high fidelity model provides utilities, operators, and policymakers with a clearer picture for strategic decision making and preventive decisions.

The existence of robust chiral edge states in a finite topologically nontrivial chern insulator is a consequence of the bulk-boundary correspondence. In this paper, we present a theoretical framework based on lattice Green's function to study the scattering of such chiral edge electrons by a single localized impurity. To this end, in the first step, we consider the standard topological Haldane model on a honeycomb lattice with strip geometry. We obtain analytical expressions for the wave functions and their corresponding energy dispersion of the low-energy chiral states localized at the edge of the ribbon. Then, we employ the $T$-matrix Lippmann-Schwinger approach to explicitly show the robustness of chiral edge states against the impurity scattering. This backscattering-free process has an interesting property that the transmitted wave function acquires an additional phase factor. Although this additional phase factor does not affect quantum transport through the chiral channel it can carry quantum information. As an example of such quantum information transport, we investigate the entanglement of two magnetic impurities in a chern insulator through the dissipation-less scattering of chiral electrons.

In [1, 2], we have explored the theoretical aspects of feature extraction optimization processes for solving largescale problems and overcoming machine learning limitations. Majority of optimization algorithms that have been introduced in [1, 2] guarantee the optimal performance of supervised learning, given offline and discrete data, to deal with curse of dimensionality (CoD) problem. These algorithms, however, are not tailored for solving emerging learning problems. One of the important issues caused by online data is lack of sufficient samples per class. Further, traditional machine learning algorithms cannot achieve accurate training based on limited distributed data, as data has proliferated and dispersed significantly. Machine learning employs a strict model or embedded engine to train and predict which still fails to learn unseen classes and sufficiently use online data. In this chapter, we introduce these challenges elaborately. We further investigate Meta-Learning (MTL) algorithm, and their application and promises to solve the emerging problems by answering how autonomous agents can learn to learn?., Comment: 17 pages, 9 figures. arXiv admin note: text overlap with arXiv:1902.08438 by other authors

In [1], we have explored the theoretical aspects of feature selection and evolutionary algorithms. In this chapter, we focus on optimization algorithms for enhancing data analytic process, i.e., we propose to explore applications of nature-inspired algorithms in data science. Feature selection optimization is a hybrid approach leveraging feature selection techniques and evolutionary algorithms process to optimize the selected features. Prior works solve this problem iteratively to converge to an optimal feature subset. Feature selection optimization is a non-specific domain approach. Data scientists mainly attempt to find an advanced way to analyze data n with high computational efficiency and low time complexity, leading to efficient data analytics. Thus, by increasing generated/measured/sensed data from various sources, analysis, manipulation and illustration of data grow exponentially. Due to the large scale data sets, Curse of dimensionality (CoD) is one of the NP-hard problems in data science. Hence, several efforts have been focused on leveraging evolutionary algorithms (EAs) to address the complex issues in large scale data analytics problems. Dimension reduction, together with EAs, lends itself to solve CoD and solve complex problems, in terms of time complexity, efficiently. In this chapter, we first provide a brief overview of previous studies that focused on solving CoD using feature extraction optimization process. We then discuss practical examples of research studies are successfully tackled some application domains, such as image processing, sentiment analysis, network traffics / anomalies analysis, credit score analysis and other benchmark functions/data sets analysis., Comment: 18 pages, 5 figures

A large number of engineering, science and computational problems have yet to be solved in a computationally efficient way. One of the emerging challenges is how evolving technologies grow towards autonomy and intelligent decision making. This leads to collection of large amounts of data from various sensing and measurement technologies, e.g., cameras, smart phones, health sensors, smart electricity meters, and environment sensors. Hence, it is imperative to develop efficient algorithms for generation, analysis, classification, and illustration of data. Meanwhile, data is structured purposefully through different representations, such as large-scale networks and graphs. We focus on data science as a crucial area, specifically focusing on a curse of dimensionality (CoD) which is due to the large amount of generated/sensed/collected data. This motivates researchers to think about optimization and to apply nature-inspired algorithms, such as evolutionary algorithms (EAs) to solve optimization problems. Although these algorithms look un-deterministic, they are robust enough to reach an optimal solution. Researchers do not adopt evolutionary algorithms unless they face a problem which is suffering from placement in local optimal solution, rather than global optimal solution. In this chapter, we first develop a clear and formal definition of the CoD problem, next we focus on feature extraction techniques and categories, then we provide a general overview of meta-heuristic algorithms, its terminology, and desirable properties of evolutionary algorithms., Comment: 40 pages, 6 figures

Steganography algorithms facilitate communication between a source and a destination in a secret manner. This is done by embedding messages/text/data into images without impacting the appearance of the resultant images/videos. Steganalysis is the science of determining if an image has secret messages embedded/hidden in it. Because there are numerous steganography algorithms, and since each one of them requires a different type of steganalysis, the steganalysis process is extremely challenging. Thus, researchers aim to develop one universal steganalysis to detect all known and unknown steganography algorithms, ideally in real-time. Universal steganalysis extracts a large number of features to distinguish stego images from cover images. However, the increase in features leads to the problem of the curse of dimensionality (CoD), which is considered to be an NP-hard problem. This COD problem additionally makes real-time steganalysis hard. A large number of features generates large datasets for which machine learning cannot generate an optimal model. Generating a machine learning based model also takes a long time which makes real-time processing appear impossible in any optimization for time-intensive fields such as visual computing. Possible solutions for CoD are deep learning and evolutionary algorithms that overcome the machine learning limitations. In this study, we investigate previously developed evolutionary algorithms for boosting real-time image processing and argue that they provide the most promising solutions for the CoD problem., Comment: 8 pages,5 figures

Let T be a tilting module.In this paper, some relative Gorenstein projective and Gortenstein injective modules are studied., Comment: 14 Pages. arXiv admin note: text overlap with arXiv:1903.07144

This paper considers a family of distributions constructed by a stochastic mixture of the order statistics of a sample of size two. Various properties of the proposed model are studied. We apply the model to extend the exponential and symmetric Laplace distributions. An extension to the bivariate case is considered.

Let $T$ be a tilting module. In this paper, Gorenstein $\pi[T]$-projective modules are introduced and some of their basic properties are studied. Moreover, some characterizations of rings over which all modules are Gorenstein $\pi[T]$-projective are given. For instance, on the $T$-cocoherent rings, it is proved that the Gorenstein $\pi[T]$-projectivity of all $R$-modules is equivalent to the $\pi[T]$-projectivity of $\sigma[T]$-injective as a module., Comment: 12 pages

Accurate topology information is critical for effective operation of power distribution networks. Line outages change the operational topology of a distribution network. Hence, outage detection is an important task. Power distribution networks are operated as radial trees and are recently adopting the integration of advanced sensors to monitor the network in real time. In this paper, a dynamic-programming-based minimum cost sensor placement solution is proposed for outage identifiability. We propose a novel formulation of the sensor placement as a cost optimization problem involving binary placement decisions, and then provide an algorithm based on dynamic programming to solve it in polynomial time. The advantage of the proposed placement strategy is that it incorporates various types of sensors, is independent of time varying load statistics, has a polynomial execution time and is cost effective. Numerical results illustrating the proposed sensor placement solution are presented for multiple feeder models including standard IEEE test feeders., Comment: arXiv admin note: text overlap with arXiv:1901.11104