Reviewerly/exHarmony huggingface dataset:
Cryptographic Capability Computing

Capability architectures for memory safety have traditionally required expanding pointers and radically changing microarchitectural structures throughout processors, while only providing superficial hardening. We hence propose Cryptographic Capability Computing (C3) - the first memory safety mechanism that is stateless to avoid requiring extra metadata storage. C3 retains 64-bit pointer sizes providing legacy binary compatibility while imposing minimal touchpoints. Pointers are encrypted to unforgeably (within cryptographic bounds) reference each object. Data is encrypted even in caches and entangled with pointers for both spatial and temporal object-granular protection. Pointers become like unique keys for each allocation. C3 deploys a novel form of prediction for address translation that mitigates performance overheads even when addresses are partially encrypted. Use of a low-latency, low-area cipher from the NIST Lightweight Cryptography project avoids delaying loads by readying a data keystream by the time data is returned from the L1 cache. C3 is compatible with legacy binaries. Simulated performance overhead on SPEC CPU2006 is negligible with no memory overhead, which is a big leap forward compared to the overheads imposed by past memory safety approaches. C3 effectively replaces inefficient metadata with efficient cryptography.
Solver-based gradual type migration

Gradually typed languages allow programmers to mix statically and dynamically typed code, enabling them to incrementally reap the benefits of static typing as they add type annotations to their code. However, this type migration process is typically a manual effort with limited tool support. This paper examines the problem of automated type migration: given a dynamic program, infer additional or improved type annotations. Existing type migration algorithms prioritize different goals, such as maximizing type precision, maintaining compatibility with unmigrated code, and preserving the semantics of the original program. We argue that the type migration problem involves fundamental compromises: optimizing for a single goal often comes at the expense of others. Ideally, a type migration tool would flexibly accommodate a range of user priorities. We present TypeWhich, a new approach to automated type migration for the gradually-typed lambda calculus with some extensions. Unlike prior work, which relies on custom solvers, TypeWhich produces constraints for an off-the-shelf MaxSMT solver. This allows us to easily express objectives, such as minimizing the number of necessary syntactic coercions, and constraining the type of the migration to be compatible with unmigrated code. We present the first comprehensive evaluation of GTLC type migration algorithms, and compare TypeWhich to four other tools from the literature. Our evaluation uses prior benchmarks, and a new set of "challenge problems." Moreover, we design a new evaluation methodology that highlights the subtleties of gradual type migration. In addition, we apply TypeWhich to a suite of benchmarks for Grift, a programming language based on the GTLC. TypeWhich is able to reconstruct all human-written annotations on all but one program.
Defining Smart Glasses: A Rapid Review of State-of-the-Art Perspectives and Future Challenges From a Social Sciences’ Perspective

Abstract Over recent decades smart glasses have gained increased attention in both the research arena and recently also in the consumer market, even though there is not yet a clear definition of what exactly smart glasses entail and underexposed perspectives are not represented. This study used a rapid review to assess the current understanding of smart glasses with the aim of defining them. Searches were performed across six databases, followed-up by a content-based evaluation of title and abstract. A total set of 14 relevant publications was identified to help arrive at a definition and characteristics of smart glasses. As a result, it was observed in both the research literature and in the public domain that many different names are used for smart glasses, and that in some cases there is unclarity about what constitute smart glasses. Therefore, an adapted definition of smart glasses is developed based on the existing original rationale of ubiquitous computing and taking the current state-of-the-art knowledge into account. This article provides an overview of and suggestion for defining smart glasses from a social sciences’ perspective to better inform researchers, developers, designers and companies who are involved in the design, development, research of smart glasses.
Algorithm of Doppler error suppression in frequency-swept interferometry for the dynamic axial clearance measurement of high-speed rotating machinery

To realize accurate dynamic axial clearance measurement in high-speed rotating machinery using basic Frequency-swept interferometry (FSI), a novel algorithm of Doppler error suppression is proposed. In this algorithm, we first extract the incremental phase of the FSI signal by Hilbert transform and use it to construct a virtual clearance variation. Then, using the periodic characteristics of rotor rotation, optimized initial clearance can be obtained. Eventually, the dynamic axial clearance at each sampling point can be recovered with the optimized initial clearance and the Doppler error is greatly suppressed. The feasibility of this method is tested and verified by both simulation and experiment. For a 4 kHz rotation simulating target located at 5 mm away, the experimental results show that the dynamic clearance measurement error is less than 2.057 µm, which meets the measurement accuracy required for most high-speed rotating machinery.
Harmony Search Algorithm and Fuzzy Logic Theory: An Extensive Review from Theory to Applications

In recent years, many researchers have utilized metaheuristic optimization algorithms along with fuzzy logic theory in their studies for various purposes. The harmony search (HS) algorithm is one of the metaheuristic optimization algorithms that is widely employed in different studies along with fuzzy logic (FL) theory. FL theory is a mathematical approach to expressing uncertainty by applying the conceptualization of fuzziness in a system. This review paper presents an extensive review of published papers based on the combination of HS and FL systems. In this regard, the functional characteristics of models obtained from integration of FL and HS have been reported in various articles, and the performance of each study is investigated. The basic concept of the FL approach and its derived models are introduced to familiarize readers with the principal mechanisms of FL models. Moreover, appropriate descriptions of the primary classifications acquired from the coexistence of FL and HS methods for specific purposes are reviewed. The results show that the high efficiency of HS to improve the exploration of FL in achieving the optimal solution on the one hand, and the capability of fuzzy inference systems to provide more flexible and dynamic adaptation of the HS parameters based on human perception on the other hand, can be a powerful combination for solving optimization problems. This review paper is believed to be a useful resource for students, engineers, and professionals.
Power Efficient Design of High-Performance Convolutional Neural Networks Hardware Accelerator on FPGA: A Case Study With GoogLeNet

Convolutional neural networks (CNNs) have dominated image recognition and object detection models in the last few years. They can achieve the highest accuracies with several applications such as automotive and biomedical applications. CNNs are usually implemented by using Graphical Processing Units (GPUs) or generic processors. Although the GPUs are capable of performing the complex computations needed by the CNNs, their power consumption is huge compared to generic processors. Moreover, current generic processors are unable to cope up with the growing CNNs demand for computation performance. Therefore, hardware accelerators are the best choice to provide the required computation performance needed by the CNNs as well as affordable power consumption. Several techniques are adopted in hardware accelerators such as pruning and quantization. In this paper, a low-power dedicated CNN hardware accelerator is proposed based on GoogLeNet CNN as a case study. Weights pruning and quantization are applied to reduce the memory size by 57.6x. Consequently, only FPGA on-chip memory is used for weights and activations storage without using offline DRAMs (Dynamic Random Access Memories). In addition, the proposed hardware accelerator utilizes zero DSP (Digital Signal Processing) units as all multiplications are replaced by shifting operations. The accelerator is developed based on a time-sharing/pipelined architecture, which processes the CNN model layer by layer. The architecture proposes a new data fetching mechanism that increases data reuse. Moreover, the proposed accelerator units are implemented in native RTL (Register Transfer Logic). The accelerator classifies 25.1 frames per second (fps) with 3.92W only, which is more power-efficient than other GoogLeNet implementations on FPGA in the literature. In addition, the proposed accelerator achieves an average classification efficiency of 91%, which is significantly higher than comparable architectures. Furthermore, this accelerator surpasses the popular CPUs such as Intel Core-i7 and GPUs such as GTX 1080Ti in terms of the number of frames processed per Watt.
Enhancing Korean Named Entity Recognition With Linguistic Tokenization Strategies

Tokenization is a significant primary step for the training of the Pre-trained Language Model (PLM), which alleviates the challenging Out-of-Vocabulary problem in the area of Natural Language Processing. As tokenization strategies can change linguistic understanding, it is essential to consider the composition of input features based on the characteristics of the language for model performance. This study answers the question of “Which tokenization strategy enhances the characteristics of the Korean language for the Named Entity Recognition (NER) task based on a language model?” focusing on tokenization, which significantly affects the quality of input features. We present two significant challenges for the NER task with the agglutinative characteristics in the Korean language. Next, we quantitatively and qualitatively analyze the coping process of each tokenization strategy for these challenges. By adopting various linguistic segmentation such as morpheme, syllable and subcharacter, we demonstrate the effectiveness and prove the performance between PLMs based on each tokenization strategy. We validate that the most consistent strategy for the challenges of the Korean language is a syllable based on Sentencepiece.
Federated transfer learning for disaster classification in social computing networks

Social media analytics have played an important role in disaster identification. Recent advances in deep learning (DL) technologies have been applied to design disaster classification models. However, the DL-based models are hindered by insufficient training samples, because data collection and labeling are very expensive and time-consuming. To solve this issue, a privacy-preserving federated transfer learning approach for disaster classification (FedTL) is proposed, which can allow distributed social computing nodes to collaboratively train a comprehensive model. In the FedTL, Paillier homomorphic encryption method is used to protect the social computing nodes’ data privacy. In particular, the transfer learning technology is adopted as a novel application to reduce the computation and communication costs in the federated learning system. The FedTL is verified by a real disaster image dataset collected from social networks. Theoretical analyses and experiment results show that the FedTL is effective, secure, efficient. In addition, the FedTL is highly extensible and can be easily applied in other transfer learning models.
Design and Comparative Evaluation of Visualization Onboarding Methods

Comprehending and exploring large and complex data is becoming increasingly important for a diverse population of users in a wide range of application domains. Visualization has proven to be well-suited in supporting this endeavor by tapping into the power of human visual perception. However, non-experts in the field of visual analysis often have difficulties in correctly reading and interpreting information from novel visualization idioms. Visualization onboarding can support novices in learning how to use new digital technologies. Therefore, we developed an interactive step-by-step guide and applied the method to four visualization techniques—a bar chart, a horizon graph, a change matrix, and a parallel coordinates plot. Results using Amazon Mechanical Turk workers show that there is a need for onboarding, especially for more complex visualization techniques. We further investigated the perception and rating of a scrollytelling and a video tutorial for the most unfamiliar visualization—the parallel coordinates plot. A comparison between the three onboarding methods indicates that participants appreciated the easy-to-understand examples, the precise wording of the onboarding messages in a step-by-step manner, and the introduction of interaction concepts by highlighting the most relevant information over all onboarding methods. The video tutorial supported the introduction of unknown interaction techniques best.
FedSPL: federated self-paced learning for privacy-preserving disease diagnosis

The growing expansion of data availability in medical fields could help improve the performance of machine learning methods. However, with healthcare data, using multi-institutional datasets is challenging due to privacy and security concerns. Therefore, privacy-preserving machine learning methods are required. Thus, we use a federated learning model to train a shared global model, which is a central server that does not contain private data, and all clients maintain the sensitive data in their own institutions. The scattered training data are connected to improve model performance, while preserving data privacy. However, in the federated training procedure, data errors or noise can reduce learning performance. Therefore, we introduce the self-paced learning, which can effectively select high-confidence samples and drop high noisy samples to improve the performances of the training model and reduce the risk of data privacy leakage. We propose the federated self-paced learning (FedSPL), which combines the advantage of federated learning and self-paced learning. The proposed FedSPL model was evaluated on gene expression data distributed across different institutions where the privacy concerns must be considered. The results demonstrate that the proposed FedSPL model is secure, i.e. it does not expose the original record to other parties, and the computational overhead during training is acceptable. Compared with learning methods based on the local data of all parties, the proposed model can significantly improve the predicted F1-score by approximately 4.3%. We believe that the proposed method has the potential to benefit clinicians in gene selections and disease prognosis.
Cross-Modal Sentiment Sensing with Visual-Augmented Representation and Diverse Decision Fusion

The rising use of online media has changed the social customs of the public. Users have become accustomed to sharing daily experiences and publishing personal opinions on social networks. Social data carrying emotion and attitude has provided significant decision support for numerous tasks in sentiment analysis. Conventional methods for sentiment classification only concern textual modality and are vulnerable to the multimodal scenario, while common multimodal approaches only focus on the interactive relationship among modalities without considering unique intra-modal information. A hybrid fusion network is proposed in this paper to capture both inter-modal and intra-modal features. Firstly, in the stage of representation fusion, a multi-head visual attention is proposed to extract accurate semantic and sentimental information from textual contents, with the guidance of visual features. Then, multiple base classifiers are trained to learn independent and diverse discriminative information from different modal representations in the stage of decision fusion. The final decision is determined based on fusing the decision supports from base classifiers via a decision fusion method. To improve the generalization of our hybrid fusion network, a similarity loss is employed to inject decision diversity into the whole model. Empiric results on five multimodal datasets have demonstrated that the proposed model achieves higher accuracy and better generalization capacity for multimodal sentiment analysis.
Devising an individually oriented method for selection of scientific activity subjects for implementing scientific projects based on scientometric analysis

The main factors influencing the choice of individual subjects of the scientific activity or potential partners and executors for scientific and educational projects were analyzed. The specific features of choosing project executors of different categories were indicated. The functional responsibilities of project participants in accordance with the project structure were described. The individually oriented method for choosing subjects of scientific activity as executors of scientific and educational projects was developed, taking into account the productivity of their scientific activities in the past and considering the structure of projects. To determine the merits of the subjects of scientific activity, which are included in the relevant scientific subject spaces, it is necessary to apply the procedure of their productivity assessment. In addition, it is necessary to predict a change in productivity in the future based on retrospective data for this subject. Next, it is required to solve the multi-criteria problem of the choice among the subjects of scientific activity who are quite productive in the opinion of the project manager. The use of the developed method reduces the subjective impact on making a decision regarding the choice of project executors. This is due to the fact that they are chosen by automated calculation of scientometric indicators of subjects, guided only by open sources of information. The individually oriented method for the selection of subjects of scientific activity was verified on the example of the formation of three applications of research projects. As a result, the average percentage of scientists who meet the requirements of project managers for each scientific subject space was about 46.55 %. The percentage of those involved in the project from those who were selected is about 24.07 %. The probability of cooperation is higher among those who have an average H-index.
Review on Confidentiality, Integrity and Availability in Information Security

Information security is very significant needs to be secured due to people relying on networks and communication. Therefore, protecting information is a major challenge with the number of users increases rapidly in recent years. The aim of this article is to review Confidentiality, Integrity and Availability (CIA) in information security. This article focuses on the issues of information security and the requirements of information security. The articles, journals and conference papers are reviewed by researchers were published in 2016-2021. Security issues are analyzed in the recent methodologies. The result of the relationship between CIA in each information security requirement is at a moderate level. It is suggested cybersecurity risk awareness program for society is needed. Therefore, every user could get full advantages in networks and digital platforms.
General Board Game Concepts

Many games often share common ideas or aspects between them, such as their rules, controls, or playing area. However, in the context of General Game Playing (GGP) for board games, this area remains under-explored. We propose to formalise the notion of “game concept”, inspired by terms generally used by game players and designers. Through the Ludii General Game System, we describe concepts for several levels of abstraction, such as the game itself, the moves played, or the states reached. This new GGP feature associated with the ludeme representation of games opens many new lines of research. The creation of a hyper-agent selector, the transfer of AI learning between games, or explaining AI techniques using game terms, can all be facilitated by the use of game concepts. Other applications which can benefit from game concepts are also discussed, such as the generation of plausible reconstructed rules for incomplete ancient games, or the implementation of a board game recommender system.
Dynamic GPU Energy Optimization for Machine Learning Training Workloads

GPUs are widely used to accelerate the training of machine learning workloads. As modern machine learning models become increasingly larger, they require a longer time to train, leading to higher GPU energy consumption. This paper presents GPOEO, an online GPU energy optimization framework for machine learning training workloads. GPOEO dynamically determines the optimal energy configuration by employing novel techniques for online measurement, multi-objective prediction modeling, and search optimization. To characterize the target workload behavior, GPOEO utilizes GPU performance counters. To reduce the performance counter profiling overhead, it uses an analytical model to detect the training iteration change and only collects performance counter data when an iteration shift is detected. GPOEO employs multi-objective models based on gradient boosting and a local search algorithm to find a trade-off between execution time and energy consumption. We evaluate the GPOEO by applying it to 71 machine learning workloads from two AI benchmark suites running on an NVIDIA RTX3080Ti GPU. Compared with the NVIDIA default scheduling strategy, GPOEO delivers a mean energy saving of 16.2% with a modest average execution time increase of 5.1%.
Differentially Private Set Union

We study the basic operation of set union in the global model of differential privacy. In this problem, we are given a universe $U$ of items, possibly of infinite size, and a database $D$ of users. Each user $i$ contributes a subset $W_i \subseteq U$ of items. We want an ($\epsilon$,$\delta$)-differentially private algorithm which outputs a subset $S \subset \cup_i W_i$ such that the size of $S$ is as large as possible. The problem arises in countless real world applications; it is particularly ubiquitous in natural language processing (NLP) applications as vocabulary extraction. For example, discovering words, sentences, $n$-grams etc., from private text data belonging to users is an instance of the set union problem.Known algorithms for this problem proceed by collecting a subset of items from each user, taking the union of such subsets, and disclosing the items whose noisy counts fall above a certain threshold. Crucially, in the above process, the contribution of each individual user is always independent of the items held by other users, resulting in a wasteful aggregation process, where some item counts happen to be way above the threshold. We deviate from the above paradigm by allowing users to contribute their items in a {\em dependent fashion}, guided by a {\em policy}. In this new setting ensuring privacy is significantly delicate. We prove that any policy which has certain {\em contractive} properties would result in a differentially private algorithm. We design two new algorithms for differentially private set union, one using Laplace noise and other Gaussian noise, which use $\ell_1$-contractive and $\ell_2$-contractive policies respectively and provide concrete examples of such policies. Our experiments show that the new algorithms in combination with our policies significantly outperform previously known mechanisms for the problem.