Reviewerly/exHarmony huggingface dataset:
Neighborhood Attention Transformer

We present Neighborhood Attention (NA), the first efficient and scalable sliding window attention mechanism for vision. NA is a pixel-wise operation, localizing self attention (SA) to the nearest neighboring pixels, and therefore enjoys a linear time and space complexity compared to the quadratic complexity of SA. The sliding window pattern allows NA's receptive field to grow without needing extra pixel shifts, and preserves translational equivariance, unlike Swin Transformer's Window Self Attention (WSA). We develop NATTEN (Neighborhood Attention Extension), a Python package with efficient C++ and CUDA kernels, which allows NA to run up to 40% faster than Swin's WSA while using up to 25% less memory. We further present Neighborhood Attention Transformer (NAT), a new hierarchical transformer design based on NA that boosts image classification and downstream vision performance. Experimental results on NAT are competitive; NAT-Tiny reaches 83.2% top-1 accuracy on ImageNet, 51.4% mAP on MSCOCO and 48.4% mIoU on ADE20K, which is 1.9% ImageNet accuracy, 1.0% COCO mAP, and 2.6% ADE20K mIoU improvement over a Swin model with similar size. To support more research based on sliding window attention, we open source our project and release our checkpoints.
Giving State to the Stateless: Augmenting Trustworthy Computation with Ledgers

In this work we investigate new computational properties that can be achieved by combining stateless trusted devices with public ledgers.We consider a hybrid paradigm in which a client-side device (such as a co-processor or trusted enclave) performs secure computation, while interacting with a public ledger via a possibly malicious host computer.We explore both the constructive and potentially destructive implications of such systems.We first show that this combination allows for the construction of stateful interactive functionalities (including general computation) even when the device has no persistent storage; this allows us to build sophisticated applications using inexpensive trusted hardware or even pure cryptographic obfuscation techniques.We further show how to use this paradigm to achieve censorship-resistant communication with a network, even when network communications are mediated by a potentially malicious host.Finally we describe a number of practical applications that can be achieved today.These include the synchronization of private smart contracts; rate limited mandatory logging; strong encrypted backups from weak passwords; enforcing fairness in multi-party computation; and destructive applications such as autonomous ransomware, which allows for payments without an online party.
Beyond Tandem Analysis: Joint Dimension Reduction and Clustering in <i>R</i>

We present the R package clustrd which implements a class of methods that combine dimension reduction and clustering of continuous or categorical data.In particular, for continuous data, the package contains implementations of factorial K-means and reduced K-means; both methods combine principal component analysis with K-means clustering.For categorical data, the package provides MCA K-means, i-FCB and cluster correspondence analysis, which combine multiple correspondence analysis with K-means.Two examples on real data sets are provided to illustrate the usage of the main functions.
Why is Multimedia Quality of Experience Assessment a Challenging Problem?

Quality of experience (QoE) assessment occupies a key role in various multimedia networks and applications. Recently, large efforts have been devoted to devise objective QoE metrics that correlate with perceived subjective measurements. Despite recent progress, limited success has been attained. In this paper, we provide some insights on why QoE assessment is so difficult by presenting few major issues as well as a general summary of quality/QoE formation and conception including human auditory and vision systems. Also, potential future research directions are described to discern the path forward. This is an academic and perspective article, which is hoped to complement existing studies and prompt interdisciplinary research.
KE-GAN: Knowledge Embedded Generative Adversarial Networks for Semi-Supervised Scene Parsing

In recent years, scene parsing has captured increasing attention in computer vision. Previous works have demonstrated promising performance in this task. However, they mainly utilize holistic features, whilst neglecting the rich semantic knowledge and inter-object relationships in the scene. In addition, these methods usually require a large number of pixel-level annotations, which is too expensive in practice. In this paper, we propose a novel Knowledge Embedded Generative Adversarial Networks, dubbed as KE-GAN, to tackle the challenging problem in a semi-supervised fashion. KE-GAN captures semantic consistencies of different categories by devising a Knowledge Graph from the large-scale text corpus. In addition to readily-available unlabeled data, we generate synthetic images to unveil rich structural information underlying the images. Moreover, a pyramid architecture is incorporated into the discriminator to acquire multi-scale contextual information for better parsing results. Extensive experimental results on four standard benchmarks demonstrate that KE-GAN is capable of improving semantic consistencies and learning better representations for scene parsing, resulting in the state-of-the-art performance.
MimicGAN: Robust Projection onto Image Manifolds with Corruption Mimicking

In the past few years, Generative Adversarial Networks (GANs) have dramatically advanced our ability to represent and parameterize high-dimensional, non-linear image manifolds. As a result, they have been widely adopted across a variety of applications, ranging from challenging inverse problems like image completion, to problems such as anomaly detection and adversarial defense. A recurring theme in many of these applications is the notion of projecting an image observation onto the manifold that is inferred by the generator. In this context, Projected Gradient Descent (PGD) has been the most popular approach, which essentially optimizes for a latent vector that minimizes the discrepancy between a generated image and the given observation. However, PGD is a brittle optimization technique that fails to identify the right projection (or latent vector) when the observation is corrupted, or perturbed even by a small amount. Such corruptions are common in the real world, for example images in the wild come with unknown crops, rotations, missing pixels, or other kinds of non-linear distributional shifts which break current encoding methods, rendering downstream applications unusable. To address this, we propose corruption mimicking—a new robust projection technique, that utilizes a surrogate network to approximate the unknown corruption directly at test time, without the need for additional supervision or data augmentation. The proposed method is significantly more robust than PGD and other competing methods under a wide variety of corruptions, thereby enabling a more effective use of GANs in real-world applications. More importantly, we show that our approach produces state-of-the-art performance in several GAN-based applications—anomaly detection, domain adaptation, and adversarial defense, that benefit from an accurate projection.
Efficiently sampling functions from Gaussian process posteriors

Gaussian processes are the gold standard for many real-world modeling problems, especially in cases where a model's success hinges upon its ability to faithfully represent predictive uncertainty. These problems typically exist as parts of larger frameworks, wherein quantities of interest are ultimately defined by integrating over posterior distributions. These quantities are frequently intractable, motivating the use of Monte Carlo methods. Despite substantial progress in scaling up Gaussian processes to large training sets, methods for accurately generating draws from their posterior distributions still scale cubically in the number of test locations. We identify a decomposition of Gaussian processes that naturally lends itself to scalable sampling by separating out the prior from the data. Building off of this factorization, we propose an easy-to-use and general-purpose approach for fast posterior sampling, which seamlessly pairs with sparse approximations to afford scalability both during training and at test time. In a series of experiments designed to test competing sampling schemes' statistical properties and practical ramifications, we demonstrate how decoupled sample paths accurately represent Gaussian process posteriors at a fraction of the usual cost.
Deep Fuzzy Cognitive Maps for Interpretable Multivariate Time Series Prediction

The fuzzy cognitive map (FCM) is a powerful model for system state prediction and interpretable knowledge representation. Recent years have witnessed the tremendous efforts devoted to enhancing the basic FCM, such as introducing temporal factors, uncertainty or fuzzy rules to improve interpretation, and introducing fuzzy neural networks or wavelets to improve time series prediction. But how to achieve high-precision yet interpretable prediction in cross-domain real-life applications remains a great challenge. In this article, we propose a novel FCM extension called deep FCM (DFCM) for multivariate time series forecasting, in order to take both the advantage of FCM in interpretation and the advantage of deep neural networks in prediction. Specifically, to improve the predictive power, DFCM leverages a fully connected neural network to model connections (relationships) among concepts in a system, and a recurrent neural network to model unknown exogenous factors that have influences on system dynamics. Moreover, to foster model interpretability encumbered by the embedded deep structures, a partial derivative-based approach is proposed to measure the connection strengths between concepts in DFCM. An alternate function gradient descent algorithm is then proposed for parameter inference. The effectiveness of DFCM is validated over four publicly available datasets with the presence of seven baselines. DFCM indeed provides an important clue to building interpretable predictors for real-life applications.
Plug&amp;Play Fiber‐Coupled 73 kHz Single‐Photon Source Operating in the Telecom O‐Band

A user-friendly fibre-coupled single-photon source operating at telecom wavelengths is a key component of photonic quantum networks providing long-haul ultra-secure data exchange. To take full advantage of quantum-mechanical data protection and to maximize the transmission rate and distance, a true quantum source providing single-photons on demand is highly desirable. We tackle this great challenge by developing a ready to use semiconductor quantum dot (QD)-based device that launches single photons at a wavelength of 1.3 um directly into a single-mode optical fibre. In our approach the QD is deterministically integrated into a nanophotonic structure to ensure efficient on-chip coupling into a fibre. The whole arrangement is integrated into a 19" compatible housing to enable stand-alone operation by cooling via a compact Stirling cryocooler. The realized source delivers single photons with multiphoton events probability as low as 0.15 and single-photon emission rate up to 73 kHz into a standard telecom single-mode fibre.
Secure Data Access Control With Fair Accountability in Smart Grid Data Sharing: An Edge Blockchain Approach

Nowadays, the advance of smart grid technology has fostered the development of microgrids, which can efficiently control and manage the distributed energy resources (DERs). In smart grid, IoT devices generate huge amounts of data, which are collected and shared among DERs, microgrids, and the main grid. To protect the shared data, it is necessary to implement the secure and efficient data access control. Ciphertext policy attribute-based encryption (CP-ABE) is a promising solution for the distributed system. However, lightweight IoT devices with limited computing capability cannot handle the computationally intensive ABE algorithms. To overcome this constraint, the decryption phase of CP-ABE is usually outsourced to the cloud, but this is inefficient and not safe enough in the distributed environment. In this article, we propose an edge blockchain empowered secure data access control scheme with fair accountability for the smart grid. The computation workloads of end user devices are outsourced to the edge nodes in a consortium blockchain system We adopt an on-chain/off-chain approach to ensure the flexible data sharing. Additionally, we adopt the threshold secret sharing scheme to establish a distributed authority. The security analysis and performance evaluation are conducted to prove the security and efficiency of our scheme. We use the Raspberry Pi to simulate lightweight IoT devices in the Hyperledger fabric platform to prove the usability of our scheme.
Binary Spring Search Algorithm for Solving Various Optimization Problems

One of the most powerful tools for solving optimization problems is optimization algorithms (inspired by nature) based on populations. These algorithms provide a solution to a problem by randomly searching in the search space. The design’s central idea is derived from various natural phenomena, the behavior and living conditions of living organisms, laws of physics, etc. A new population-based optimization algorithm called the Binary Spring Search Algorithm (BSSA) is introduced to solve optimization problems. BSSA is an algorithm based on a simulation of the famous Hooke’s law (physics) for the traditional weights and springs system. In this proposal, the population comprises weights that are connected by unique springs. The mathematical modeling of the proposed algorithm is presented to be used to achieve solutions to optimization problems. The results were thoroughly validated in different unimodal and multimodal functions; additionally, the BSSA was compared with high-performance algorithms: binary grasshopper optimization algorithm, binary dragonfly algorithm, binary bat algorithm, binary gravitational search algorithm, binary particle swarm optimization, and binary genetic algorithm. The results show the superiority of the BSSA. The results of the Friedman test corroborate that the BSSA is more competitive.
Financing Growth through Remittances and Foreign Direct Investment: Evidences from Balkan Countries

The ultimate goal of central banks, worldwide, is to promote the foundations for sustainable economic growth. In the case of developing economies, in particular, such objective requires time, huge efforts, attention, and plenty of resources in order to be accomplished to the fullest degree. This paper thoroughly investigates key factors affecting Balkan countries’ economic development (as measured by gross domestic product (GDP) growth), focusing especially on the impact of remittances. The analysis was done over an 18-year time interval (2000–2017) and builds on 144 observations. The data figures were retrieved from the World Bank database while two dummies were created to test the impact of the last financial crisis (2008–2012). Econometric tools were employed to carry out a broad analysis on the interdependencies that exist and, in particular, to determine the role of remittance income on growth. The vector auto regressive model was estimated using EViews software, and was used to come up with relevant insights. Empirical findings suggest the following: population growth, remittances, and labor force participation are insignificant factors for sustainable growth. On the other hand, previous levels of GDP, trade, and foreign direct investments (FDIs) appear to be relevant for the predictor. This research provides up-to-date conclusions, which can be considered during the decision-making process of central banks, as well as by government policymakers.
Deduplication with Attribute Based Encryption in E-Health Care Systems

Attribute Based Encryption (ABE) algorithm is the one of the most familiar one in cloud computing environment. While with the influence of data Deduplication technique is more effective to secure any kind of data bases. The existing system of this paper is based on Health Care Systems. In this system, large amount of data bases can be stored and retrieved day by day. So the problem arises in privacy module and storage module. Because in recent period, data’s structure in health care system can be stored heavily. So it is vulnerable to Bruce force attack. In this paper, the proposed system is overcome the drawback of privacy and storage problem in Health care systems. Attribute based encryption with data Deduplication is the best way to avoid the privacy problems.
Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development

In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives the scientific community towards the definition of new and better-performing heuristics and results in an increased interest in this research field. Nevertheless, new studies have been focused on developing new algorithms without providing consolidation of the existing knowledge. Furthermore, the absence of rigor and formalism to classify, design, and develop combinatorial optimization problems and metaheuristics represents a challenge to the field’s progress. This study discusses the main concepts and challenges in this area and proposes a formalism to classify, design, and code combinatorial optimization problems and metaheuristics. We believe these contributions may support the progress of the field and increase the maturity of metaheuristics as problem solvers analogous to other machine learning algorithms.
Predicting fault slip via transfer learning

Data-driven machine-learning for predicting instantaneous and future fault-slip in laboratory experiments has recently progressed markedly, primarily due to large training data sets. In Earth however, earthquake interevent times range from 10's-100's of years and geophysical data typically exist for only a portion of an earthquake cycle. Sparse data presents a serious challenge to training machine learning models for predicting fault slip in Earth. Here we describe a transfer learning approach using numerical simulations to train a convolutional encoder-decoder that predicts fault-slip behavior in laboratory experiments. The model learns a mapping between acoustic emission and fault friction histories from numerical simulations, and generalizes to produce accurate predictions of laboratory fault friction. Notably, the predictions improve by further training the model latent space using only a portion of data from a single laboratory earthquake-cycle. The transfer learning results elucidate the potential of using models trained on numerical simulations and fine-tuned with small geophysical data sets for potential applications to faults in Earth.
Semantic network analysis (SemNA): A tutorial on preprocessing, estimating, and analyzing semantic networks.

To date, the application of semantic network methodologies to study cognitive processes in psychological phenomena has been limited in scope. One barrier to broader application is the lack of resources for researchers unfamiliar with the approach. Another barrier, for both the unfamiliar and knowledgeable researcher, is the tedious and laborious preprocessing of semantic data. We aim to minimize these barriers by offering a comprehensive semantic network analysis pipeline (preprocessing, estimating, and analyzing networks), and an associated R tutorial that uses a suite of R packages to accommodate the pipeline. Two of these packages, SemNetDictionaries and SemNetCleaner, promote an efficient, reproducible, and transparent approach to preprocessing linguistic data. The third package, SemNeT, provides methods and measures for estimating and statistically comparing semantic networks via a point-and-click graphical user interface. Using real-world data, we present a start-to-finish pipeline from raw data to semantic network analysis results. This article aims to provide resources for researchers, both the unfamiliar and knowledgeable, that reduce some of the barriers for conducting semantic network analysis. (PsycInfo Database Record (c) 2023 APA, all rights reserved).
A systematic review of federated learning applications for biomedical data

Federated learning (FL) allows multiple institutions to collaboratively develop a machine learning algorithm without sharing their data. Organizations instead share model parameters only, allowing them to benefit from a model built with a larger dataset while maintaining the privacy of their own data. We conducted a systematic review to evaluate the current state of FL in healthcare and discuss the limitations and promise of this technology.We conducted a literature search using PRISMA guidelines. At least two reviewers assessed each study for eligibility and extracted a predetermined set of data. The quality of each study was determined using the TRIPOD guideline and PROBAST tool.13 studies were included in the full systematic review. Most were in the field of oncology (6 of 13; 46.1%), followed by radiology (5 of 13; 38.5%). The majority evaluated imaging results, performed a binary classification prediction task via offline learning (n = 12; 92.3%), and used a centralized topology, aggregation server workflow (n = 10; 76.9%). Most studies were compliant with the major reporting requirements of the TRIPOD guidelines. In all, 6 of 13 (46.2%) of studies were judged at high risk of bias using the PROBAST tool and only 5 studies used publicly available data.Federated learning is a growing field in machine learning with many promising uses in healthcare. Few studies have been published to date. Our evaluation found that investigators can do more to address the risk of bias and increase transparency by adding steps for data homogeneity or sharing required metadata and code.
Circle Search Algorithm: A Geometry-Based Metaheuristic Optimization Algorithm

This paper presents a novel metaheuristic optimization algorithm inspired by the geometrical features of circles, called the circle search algorithm (CSA). The circle is the most well-known geometric object, with various features including diameter, center, perimeter, and tangent lines. The ratio between the radius and the tangent line segment is the orthogonal function of the angle opposite to the orthogonal radius. This angle plays an important role in the exploration and exploitation behavior of the CSA. To evaluate the robustness of the CSA in comparison to other algorithms, many independent experiments employing 23 famous functions and 3 real engineering problems were carried out. The statistical results revealed that the CSA succeeded in achieving the minimum fitness values for 21 out of the tested 23 functions, and the p-value was less than 0.05. The results evidence that the CSA converged to the minimum results faster than the comparative algorithms. Furthermore, high-dimensional functions were used to assess the CSA’s robustness, with statistical results revealing that the CSA is robust to high-dimensional problems. As a result, the proposed CSA is a promising algorithm that can be used to easily handle a wide range of optimization problems.