Reviewerly/exHarmony huggingface dataset:
A Modified Particle Swarm Optimization With a Smart Particle for Inverse Problems in Electromagnetic Devices

Particle swarm optimization (PSO) is a swarm intelligence-based metaheuristic algorithm inspired by the natural behavior of birds flocking or fish schooling.The PSO's main advantages are its ease of implementation and a small number of fine-tuning parameters.However, the major drawbacks of an existing PSO are its premature convergence and the lack of a balance of exploration and exploitation searches in the search space.To address the aforementioned problems, a new concept known as a smart particle swarm optimization (SPSO) process is introduced and implemented.The smart particle that leads the swarm in the proposed concept has eidetic memory behavior.The smart particle mainly works under the principles of a convergence factor (CF) technique, which integrates the memorization of particles positions, comparison, and leader declaration for the best optimal solution.Additionally, CF uses a particle position vector instead of a particle fitness or mutation to increase the exploration capability in the search space.The TEAM Workshop Problem 22, a super conducting magnetic energy storage (SMES) system; and some well-known benchmark optimization test functions are numerically solved to verify the efficacy of the proposed SPSO.The SPSO finds a better optimal solution than the other tested algorithms, particularly in the initial computational evaluation of the generation according to numerical experiments and case study analysis.
Neural algorithmic reasoning

We present neural algorithmic reasoning—the art of building neural networks that are able to execute algorithmic computation—and provide our opinion on its transformative potential for running classical algorithms on inputs previously considered inaccessible to them.
Development of a Josephson junction based single photon microwave detector for axion detection experiments

Abstract Josephson junctions, in appropriate configurations, can be excellent candidates for detection of single photons in the microwave frequency band. Such possibility has been recently addressed in the framework of galactic axion detection. Here are reported recent developments in the modelling and simulation of dynamic behaviour of a Josephson junction single microwave photon detector. For a Josephson junction to be enough sensitive, small critical currents and operating temperatures of the order of ten of mK are necessary. Thermal and quantum tunnelling out of the zero-voltage state can also mask the detection process. Axion detection would require dark count rates in the order of 0.001 Hz. It is, therefore, is of paramount importance to identify proper device fabrication parameters and junction operation point.
Asymmetric metric learning for knowledge transfer

Knowledge transfer from large teacher models to smaller student models has recently been studied for metric learning, focusing on fine-grained classification. In this work, focusing on instance-level image retrieval, we study an asymmetric testing task, where the database is represented by the teacher and queries by the student. Inspired by this task, we introduce asymmetric metric learning, a novel paradigm of using asymmetric representations at training. This acts as a simple combination of knowledge transfer with the original metric learning task. We systematically evaluate different teacher and student models, metric learning and knowledge transfer loss functions on the new asymmetric testing as well as the standard symmetric testing task, where database and queries are represented by the same model. We find that plain regression is surprisingly effective compared to more complex knowledge transfer mechanisms, working best in asymmetric testing. Interestingly, our asymmetric metric learning approach works best in symmetric testing, allowing the student to even outperform the teacher.
Convergence of a Reconstructed Density Matrix to a Pure State Using the Maximal Entropy Approach

Impressive progress has been made in the past decade in the study of technological applications of varied types of quantum systems. With industry giants like IBM laying down their roadmap for scalable quantum devices with more than 1000-qubits by the end of 2023, efficient validation techniques are also being developed for testing quantum processing on these devices. The characterization of a quantum state is done by experimental measurements through the process called quantum state tomography (QST) which scales exponentially with the size of the system. However, QST performed using incomplete measurements is aptly suited for characterizing these quantum technologies especially with the current nature of noisy intermediate-scale quantum (NISQ) devices where not all mean measurements are available with high fidelity. We, hereby, propose an alternative approach to QST for the complete reconstruction of the density matrix of a quantum system in a pure state for any number of qubits by applying the maximal entropy formalism on the pairwise combinations of the known mean measurements. This approach provides the best estimate of the target state when we know the complete set of observables which is the case of convergence of the reconstructed density matrix to a pure state. Our goal is to provide a practical inference of a quantum system in a pure state that can find its applications in the field of quantum error mitigation on a real quantum computer that we intend to investigate further.
Gobra: Modular Specification and Verification of Go Programs

Abstract Go is an increasingly-popular systems programming language targeting, especially, concurrent and distributed systems. Go differentiates itself from other imperative languages by offering structural subtyping and lightweight concurrency through goroutines with message-passing communication. This combination of features poses interesting challenges for static verification, most prominently the combination of a mutable heap and advanced concurrency primitives. We present Gobra, a modular, deductive program verifier for Go that proves memory safety, crash safety, data-race freedom, and user-provided specifications. Gobra is based on separation logic and supports a large subset of Go. Its implementation translates an annotated Go program into the Viper intermediate verification language and uses an existing SMT-based verification backend to compute and discharge proof obligations.
Sentiment Analysis on Bengali Facebook Comments To Predict Fan's Emotions Towards a Celebrity

In this present era, sentiment analysis is considered as one of the most rapidly growing fields of computer science study. It is a text mining technique which is automated and determines the emotion of a text. A text can be divided into many emotions using sentiment analysis. Since there are some studies on emotion analysis in the Bangla language, it is regarded as a key research area in the field of analyzing Bangla language. This paper works with five different emotions and those are Happy, Sad, Angry, Surprise and Excited. Apart from these emotions our paper also deals with two categories, such as Abusive and Religious. We proposed a method of machine learning technique which is the SVM algorithm to extract these five individual emotions from Bangla text.
Supervised and unsupervised learning using a fully-plastic all-optical unit of artificial intelligence based on solitonic waveguides

Abstract The software implementations of neuronal systems have shown great effectiveness, even if the natural hardware separation between the processing and memory areas in computers slows down the analysis capacity. To overcome these limitations, new hardware configurations are moving towards neuromorphic models, capable of unifying the processing/memory dichotomy. Recently, integrated photonic X-junctions formed by waveguides written by spatial solitons have shown the ability to perform supervised learning. The solitonic technology, compared to the traditional one, offers the advantage of realizing plastic circuitry, a typical characteristic of biological neural networks. This work extensively studies both supervised and unsupervised learning of photonic soliton X-junctions. By exploiting the plasticity of the nonlinear refractive index at the base of the soliton formation, X-junctions can readdress their behaviours forwarding data to different outputs. In this article, we will extend the state-of-the-art: starting from supervised learning, for which all possible cases are now investigated, a material sensitive to the transported signals will be introduced to allow the junction to carry out unsupervised learning. In this way, the junction autonomously recognises the transported signals without the external intervention of the operator. Learning and memory now physically coincide in fact, learning means that the junction slowly switches based on the information sent; any further unknown information sent will find the junction in the modified state which corresponds to the learned information and will be recognised as well (reasoning based on comparison with stored information).
Adversarial Examples in Physical World

Although deep neural networks (DNNs) have already made fairly high achievements and a very wide range of impact, their vulnerability attracts lots of interest of researchers towards related studies about artificial intelligence (AI) safety and robustness this year. A series of works reveals that the current DNNs are always misled by elaborately designed adversarial examples. And unfortunately, this peculiarity also affects real-world AI applications and places them at potential risk. we are more interested in physical attacks due to their implementability in the real world. The study of physical attacks can effectively promote the application of AI techniques, which is of great significance to the security development of AI.
Boosting the oversampling methods based on differential evolution strategies for imbalanced learning

The class imbalance problem is a challenging problem in the data mining area. To overcome the low classification performance related to imbalanced datasets, sampling strategies are used for balancing the datasets. Oversampling is a technique that increases the minority class samples in various proportions. In this work, these 16 different DE strategies are used for oversampling the imbalanced datasets for better classification. The main aim of this work is to determine the best strategy in terms of Area Under the receiver operating characteristic (ROC) Curve (AUC) and Geometric Mean (G-Mean) metrics. 44 imbalanced datasets are used in experiments. Support Vector Machines (SVM), k-Nearest Neighbor (kNN), and Decision Tree (DT) are used as a classifier in the experiments. The best results are produced by 6th Debohid Strategy (DSt6), 1th Debohid Strategy (DSt1), and 3th Debohid Strategy (DSt3) by using kNN, DT, and SVM classifiers, respectively. The obtained results outperform the 9 state-of-the-art oversampling methods in terms of AUC and G-Mean metrics
Cyber Bullying Detection on Social Media using Machine Learning

Usage of internet and social media backgrounds tends in the use of sending, receiving and posting of negative, harmful, false or mean content about another individual which thus means Cyberbullying. Bullying over social media also works the same as threatening, calumny, and chastising the individual. Cyberbullying has led to a severe increase in mental health problems, especially among the young generation. It has resulted in lower self-esteem, increased suicidal ideation. Unless some measure against cyberbullying is taken, self-esteem and mental health issues will affect an entire generation of young adults. Many of the traditional machine learning models have been implemented in the past for the automatic detection of cyberbullying on social media. But these models have not considered all the necessary features that can be used to identify or classify a statement or post as bullying. In this paper, we proposed a model based on various features that should be considered while detecting cyberbullying and implement a few features with the help of a bidirectional deep learning model called BERT.
Diagnostic Performance of Artificial Intelligence-Based Computer-Aided Diagnosis for Breast Microcalcification on Mammography

The present study evaluated the diagnostic performance of artificial intelligence-based computer-aided diagnosis (AI-CAD) compared to that of dedicated breast radiologists in characterizing suspicious microcalcification on mammography. We retrospectively analyzed 435 unilateral mammographies from 420 patients (286 benign; 149 malignant) undergoing biopsy for suspicious microcalcification from June 2003 to November 2019. Commercial AI-CAD was applied to the mammography images, and malignancy scores were calculated. Diagnostic performance was compared between radiologists and AI-CAD using the area under the receiving operator characteristics curve (AUC). The AUCs of radiologists and AI-CAD were not significantly different (0.722 vs. 0.745, p = 0.393). The AUCs of the adjusted category were 0.726, 0.744, and 0.756 with cutoffs of 2%, 10%, and 38.03% for AI-CAD, respectively, which were all significantly higher than those for radiologists alone (all p &lt; 0.05). None of the 27 cases downgraded to category 3 with a cutoff of 2% were confirmed as malignant on pathological analysis, suggesting that unnecessary biopsies could be avoided. Our findings suggest that the diagnostic performance of AI-CAD in characterizing suspicious microcalcification on mammography was similar to that of the radiologists, indicating that it may aid in making clinical decisions regarding the treatment of breast microcalcification.
Winning the NIST Contest: A scalable and general approach to differentially private synthetic data

We propose a general approach for differentially private synthetic data generation, that consists of three steps: (1) select a collection of low-dimensional marginals, (2) measure those marginals with a noise addition mechanism, and (3) generate synthetic data that preserves the measured marginals well. Central to this approach is Private-PGM, a post-processing method that is used to estimate a high-dimensional data distribution from noisy measurements of its marginals. We present two mechanisms, NIST-MST and MST, that are instances of this general approach. NIST-MST was the winning mechanism in the 2018 NIST differential privacy synthetic data competition, and MST is a new mechanism that can work in more general settings, while still performing comparably to NIST-MST. We believe our general approach should be of broad interest, and can be adopted in future mechanisms for synthetic data generation.
An online optimization strategy for a fluid catalytic cracking process using a case-based reasoning method based on big data technology

Rigorous mechanistic models of refining processes are often too complex, which results in long modeling times, low model computational efficiencies, and poor convergence, limiting the application of mechanistic-model-based process optimization and advanced control in complex refining production processes. To address this problem and take advantage of big data technology, this study used case-based reasoning (CBR) for process optimization. The proposed method makes full use of previous process cases and reuses previous process cases to solve production optimization problems. The proposed process optimization method was applied to an actual fluid catalytic cracking maximizing iso-paraffins (MIP) production process for industrial validation. The results showed that the CBR method can be used to obtain optimization results under different optimization objectives, with a solution time not exceeding 1 s. The CBR method based on big data technology proposed in this study provides a feasible solution for fluid catalytic cracking to achieve online process optimization.
An empirical study of Q&amp;A websites for game developers

The game development industry is growing, and training new developers in game development-specific abilities is essential to satisfying its need for skilled game developers. These developers require effective learning resources to acquire the information they need and improve their game development skills. Question and Answer (Q&A) websites stand out as some of the most used online learning resources in software development. Many studies have investigated how Q&A websites help software developers become more experienced. However, no studies have explored Q&A websites aimed at game development, and there is little information about how game developers use and interact with these websites. In this paper, we study four Q&A communities by analyzing game development data we collected from their websites and the 347 responses received on a survey we ran with game developers. We observe that the communities have declined over the past few years and identify factors that correlate to these changes. Using a Latent Dirichlet Allocation (LDA) model, we characterize the topics discussed in the communities. We also analyze how topics differ across communities and identify the most discussed topics. Furthermore, we find that survey respondents have a mostly negative view of the communities and tended to stop using the websites once they became more experienced. Finally, we provide recommendations on where game developers should post their questions, which can help mitigate the websites’ declines and improve their effectiveness.
Depth Estimation From Monocular Images And Sparse Radar Using Deep Ordinal Regression Network

We integrate sparse radar data into a monocular depth estimation model and introduce a novel preprocessing method for reducing the sparseness and limited field of view provided by radar. We explore the intrinsic error of different radar modalities and show our proposed method results in more data points with reduced error. We further propose a novel method for estimating dense depth maps from monocular 2D images and sparse radar measurements using deep learning based on the deep ordinal regression network by Fu et al. Radar data are integrated by first converting the sparse 2D points to a height-extended 3D measurement and then including it into the network using a late fusion approach. Experiments are conducted on the nuScenes dataset. Our experiments demonstrate state-of-the-art performance in both day and night scenes.
Deep RNN-based network traffic classification scheme in edge computing system

This paper proposes a deep recurrent neural network (RNN)-based traffic classification scheme (deep RNN-TCS) for classifying applications from traffic patterns in a hybrid edge computing and cloud computing architecture.We can also classify traffic from a cloud server, but there will be a time delay when packets transfer to the server. Therefore, the traffic classification is possible almost in realtime when it performed on edge computing nodes. However, training takes a lot of time and needs a lot of computing resources to learn traffic patterns. Therefore, it is efficient to perform training on cloud server and to perform serving on edge computing node. Here, a cloud server collects and stores output labels corresponding to the application packets. Then, it trains those data and generates inferred functions. An edge computation node receives the inferred functions and executes classification. Compared to deep packet inspection (DPI), which requires the periodic verification of existing signatures and updated application information (e.g., versions adding new features), the proposed scheme can classify the applications in an automated manner. Also, deep learning can automatically make classifiers for traffic classification when there is enough data. Specifically, input features and output labels are defined for classification as traffic packets and target applications, respectively, which are created as two-dimensional images. As our training data, traffic packets measured at Universitat Politecnica de Catalunya Barcelonatech were utilized. Accordingly, the proposed deep RNN-TCS is implemented using a deep long short-term memory system. Through extensive simulation-based experiments, it is verified that the proposed deep RNN-TCS achieves almost 5% improvement in accuracy (96% accuracy) while operating 500 times faster (elapsed time) compared to the conventional scheme.
Opportunities and Challenges of Smartglass-Assisted Interactive Telementoring

The widespread adoption of wearables, extended reality, and metaverses has accelerated the diverse configurations of remote collaboration and telementoring systems. This paper explores the opportunities and challenges of interactive telementoring, especially for wearers of smartglasses. In particular, recent relevant studies are reviewed to derive the needs and trends of telementoring technology. Based on this analysis, we define what can be integrated into smartglass-enabled interactive telementoring. To further illustrate this type of special use case for telementoring, we present five illustrative and descriptive scenarios. We expect our specialized use case to support various telementoring applications beyond medical and surgical telementoring, while harmoniously fostering cooperation using the smart devices of mentors and mentees at different scales for collocated, distributed, and remote collaboration.
Lucas-Kanade Reloaded: End-to-End Super-Resolution from Raw Image Bursts

This presentation addresses the problem of reconstructing a high-resolution image from multiple lower-resolution snapshots captured from slightly different viewpoints in space and time. Key challenges for solving this problem include (i) aligning the input pictures with sub-pixel accuracy, (ii) handling raw (noisy) images for maximal faithfulness to native camera data, and (iii) designing/learning an image prior (regularizer) well suited to the task. We address these three challenges with a hybrid algorithm building on the insight from Wronski et al. that aliasing is an ally in this setting, with parameters that can be learned end to end, while retaining the interpretability of classical approaches to inverse problems. The effectiveness of our approach is demonstrated on synthetic and real image bursts, setting a new state of the art on several benchmarks and delivering excellent qualitative results on real raw bursts captured by smartphones and prosumer cameras.
On minimizing cost in legal document review workflows

Technology-assisted review (TAR) refers to human-in-the-loop machine learning workflows for document review in legal discovery and other high recall review tasks. Attorneys and legal technologists have debated whether review should be a single iterative process (one-phase TAR workflows) or whether model training and review should be separate (two-phase TAR workflows), with implications for the choice of active learning algorithm. The relative cost of manual labeling for different purposes (training vs. review) and of different documents (positive vs. negative examples) is a key and neglected factor in this debate. Using a novel cost dynamics analysis, we show analytically and empirically that these relative costs strongly impact whether a one-phase or two-phase workflow minimizes cost. We also show how category prevalence, classification task difficulty, and collection size impact the optimal choice not only of workflow type, but of active learning method and stopping point.