SPEX: A Generic Framework for Enhancing Neural Social Recommendation

Social Recommender Systems (SRS) have attracted considerable attention since its accompanying service, social networks, helps increase user satisfaction and provides auxiliary information to improve recommendations. However, most existing SRS focus on social influence and ignore another essential social phenomenon, i.e., social homophily. Social homophily, which is the premise of social influence, indicates that people tend to build social relations with similar people and form influence propagation paths. In this article, we propose a generic framework Social PathExplorer (SPEX) to enhance neural SRS. SPEX treats the neural recommendation model as a black box and improves the quality of recommendations by modeling the social recommendation task, the formation of social homophily, and their mutual effect in the manner of multi-task learning. We design a Graph Neural Network based component for influence propagation path prediction to help SPEX capture the rich information conveyed by the formation of social homophily. We further propose an uncertainty based task balancing method to set appropriate task weights for the recommendation task and the path prediction task during the joint optimization. Extensive experiments have validated that SPEX can be easily plugged into various state-of-the-art neural recommendation models and help improve their performance. The source code of our work is available at: https://github.com/XMUDM/SPEX.

Parent grain reconstruction from partially or fully transformed microstructures in MTEX

A versatile generic framework for parent grain reconstruction from fully or partially transformed child microstructures has been integrated into the open-source crystallographic toolbox MTEX. The framework extends traditional parent grain reconstruction, phase transformation and variant analysis to all parent–child crystal symmetry combinations. The inherent versatility of the universally applicable parent grain reconstruction methods and the ability to conduct in-depth variant analysis are showcased via example workflows that can be programmatically modified by users to suit their specific applications. This is highlighted by three applications, namely α′-to-γ reconstruction in a lath martensitic steel, α-to-β reconstruction in a Ti alloy, and a two-step reconstruction from α′ to ɛ to γ in a twinning and transformation-induced plasticity steel. Advanced orientation relationship discovery and analysis options, including variant analysis, are demonstrated via the add-on function library ORTools.

Unifying polar and nematic active matter: Emergence and co-existence of half-integer and full-integer topological defects

The presence and significance of active topological defects is increasingly realised in diverse biological and biomimetic systems. We introduce a continuum model of polar active matter, based on conservation laws and symmetry arguments, that recapitulates both polar and apolar (nematic) features of topological defects in active turbulence. Using numerical simulations of the continuum model, we demonstrate the emergence of both half- and full-integer topological defects in polar active matter. Interestingly, we find that crossover from active turbulence with half- to full-integer defects can emerge with the coexistence region characterized by both defect types. These results put forward a minimal, generic framework for studying topological defect patterns in active matter which is capable of explaining the emergence of half-integer defects in polar systems such as bacteria and cell monolayers, as well as predicting the emergence of coexisting defect states in active matter.

MI3: Machine-initiated Intelligent Interaction for Interactive Classification and Data Reconstruction

In many applications, while machine learning (ML) can be used to derive algorithmic models to aid decision processes, it is often difficult to learn a precise model when the number of similar data points is limited. One example of such applications is data reconstruction from historical visualizations, many of which encode precious data, but their numerical records are lost. On the one hand, there is not enough similar data for training an ML model. On the other hand, manual reconstruction of the data is both tedious and arduous. Hence, a desirable approach is to train an ML model dynamically using interactive classification, and hopefully, after some training, the model can complete the data reconstruction tasks with less human interference. For this approach to be effective, the number of annotated data objects used for training the ML model should be as small as possible, while the number of data objects to be reconstructed automatically should be as large as possible. In this article, we present a novel technique for the machine to initiate intelligent interactions to reduce the user’s interaction cost in interactive classification tasks. The technique of machine-initiated intelligent interaction (MI3) builds on a generic framework featuring active sampling and default labeling. To demonstrate the MI3 approach, we use the well-known cholera map visualization by John Snow as an example, as it features three instances of MI3 pipelines. The experiment has confirmed the merits of the MI3 approach.

Nonmetric ANOVA: a generic framework for analysis of variance on dissimilarity measures

Classic analysis of variance (ANOVA; cA) tests the explanatory power of a partitioning on a set of objects. Nonparametric ANOVA (npA) extends to a case where instead of the object values themselves, their mutual distances are available. While considerably widening the applicability of the cA, the npA does not provide a statistical framework for the cases where the mutual dissimilarity measurements between objects are nonmetric. Based on the central limit theorem (CLT), we introduce nonmetric ANOVA (nmA) as an extension of the cA and npA models where metric properties (identity, symmetry, and subadditivity) are relaxed. Our model allows any dissimilarity measures to be defined between objects where a distinctiveness of a specific partitioning imposed on those are of interest. This derivation accommodates an ANOVA-like framework of judgment, indicative of significant dispersion of the partitioned outputs in nonmetric space. We present a statistic which under the null hypothesis of no differences between the mean of the imposed partitioning, follows an exact F-distribution allowing to obtain the consequential p-value. Three biological examples are provided and the performance of our method in relation to the cA and npA is discussed.

Generic Hardware Private Circuits

With an increasing number of mobile devices and their high accessibility, protecting the implementation of cryptographic functions in the presence of physical adversaries has become more relevant than ever. Over the last decade, a lion’s share of research in this area has been dedicated to developing countermeasures at an algorithmic level. Here, masking has proven to be a promising approach due to the possibility of formally proving the implementation’s security solely based on its algorithmic description by elegantly modeling the circuit behavior. Theoretically verifying the security of masked circuits becomes more and more challenging with increasing circuit complexity. This motivated the introduction of security notions that enable masking of single gates while still guaranteeing the security when the masked gates are composed. Systematic approaches to generate these masked gates – commonly referred to as gadgets – were restricted to very simple gates like 2-input AND gates. Simply substituting such small gates by a secure gadget usually leads to a large overhead in terms of fresh randomness and additional latency (register stages) being introduced to the design.In this work, we address these problems by presenting a generic framework to construct trivially composable and secure hardware gadgets for arbitrary vectorial Boolean functions, enabling the transformation of much larger sub-circuits into gadgets. In particular, we present a design methodology to generate first-order secure masked gadgets which is well-suited for integration into existing Electronic Design Automation (EDA) tools for automated hardware masking as only the Boolean function expression is required. Furthermore, we practically verify our findings by conducting several case studies and show that our methodology outperforms various other masking schemes in terms of introduced latency or fresh randomness – especially for large circuits.