Inferring Users’ Social Roles with a Multi-Level Graph Neural Network Model

Users of social networks have a variety of social statuses and roles. For example, the users of Weibo include celebrities, government officials, and social organizations. At the same time, these users may be senior managers, middle managers, or workers in companies. Previous studies on this topic have mainly focused on using the categorical, textual and topological data of a social network to predict users’ social statuses and roles. However, this cannot fully reflect the overall characteristics of users’ social statuses and roles in a social network. In this paper, we consider what social network structures reflect users’ social statuses and roles since social networks are designed to connect people. Taking an Enron email dataset as an example, we analyzed a preprocessing mechanism used for social network datasets that can extract users’ dynamic behavior features. We further designed a novel social network representation learning algorithm in order to infer users’ social statuses and roles in social networks through the use of an attention and gate mechanism on users’ neighbors. The extensive experimental results gained from four publicly available datasets indicate that our solution achieves an average accuracy improvement of 2% compared with GraphSAGE-Mean, which is the best applicable inductive representation learning method.     

SAMLDroid: A Static Taint Analysis and Machine Learning Combined High-Accuracy Method for Identifying Android Apps with Location Privacy Leakage Risks

Insecure applications (apps) are increasingly used to steal users’ location information for illegal purposes, which has aroused great concern in recent years. Although the existing methods, i.e., static and dynamic taint analysis, have shown great merit for identifying such apps, which mainly rely on statically analyzing source code or dynamically monitoring the location data flow, identification accuracy is still under research, since the analysis results contain a certain false positive or true negative rate. In order to improve the accuracy and reduce the misjudging rate in the process of vetting suspicious apps, this paper proposes SAMLDroid, a combined method of static code analysis and machine learning for identifying Android apps with location privacy leakage, which can effectively improve the identification rate compared with existing methods. SAMLDroid first uses static analysis to scrutinize source code to investigate apps with location acquiring intentions. Then it exploits a well-trained classifier and integrates an app’s multiple features to dynamically analyze the pattern and deliver the final verdict about the app’s property. Finally, it is proved by conducting experiments, that the accuracy rate of SAMLDroid is up to 98.4%, which is nearly 20% higher than Apparecium.     

A Novel Method for Colorectal Cancer Screening Based on Circulating Tumor Cells and Machine Learning

Colorectal cancer is one of the most common types of cancer, and it can have a high mortality rate if left untreated or undiagnosed. The fact that CRC becomes symptomatic at advanced stages highlights the importance of early screening. The reference screening method for CRC is colonoscopy, an invasive, time-consuming procedure that requires sedation or anesthesia and is recommended from a certain age and above. The aim of this study was to build a machine learning classifier that can distinguish cancer from non-cancer samples. For this, circulating tumor cells were enumerated using flow cytometry. Their numbers were used as a training set for building an optimized SVM classifier that was subsequently used on a blind set. The SVM classifier’s accuracy on the blind samples was found to be 90.0%, sensitivity was 80.0%, specificity was 100.0%, precision was 100.0% and AUC was 0.98. Finally, in order to test the generalizability of our method, we also compared the performances of different classifiers developed by various machine learning models, using over-sampling datasets generated by the SMOTE algorithm. The results showed that SVM achieved the best performances according to the validation accuracy metric. Overall, our results demonstrate that CTCs enumerated by flow cytometry can provide significant information, which can be used in machine learning algorithms to successfully discriminate between healthy and colorectal cancer patients. The clinical significance of this method could be the development of a simple, fast, non-invasive cancer screening tool based on blood CTC enumeration by flow cytometry and machine learning algorithms.     

Two-Party Privacy-Preserving Set Intersection with FHE

A two-party private set intersection allows two parties, the client and the server, to compute an intersection over their private sets, without revealing any information beyond the intersecting elements. We present a novel private set intersection protocol based on Shuhong Gao’s fully homomorphic encryption scheme and prove the security of the protocol in the semi-honest model. We also present a variant of the protocol which is a completely novel construction for computing the intersection based on Bloom filter and fully homomorphic encryption, and the protocol’s complexity is independent of the set size of the client. The security of the protocols relies on the learning with errors and ring learning with error problems. Furthermore, in the cloud with malicious adversaries, the computation of the private set intersection can be outsourced to the cloud service provider without revealing any private information.     

Earth’s Complexity Is Non-Computable: The Limits of Scaling Laws,Nonlinearity and Chaos

Current physics commonly qualifies the Earth system as ‘complex’ because it includes numerous different processes operating over a large range of spatial scales, often modelled as exhibiting non-linear chaotic response dynamics and power scaling laws. This characterization is based on the fundamental assumption that the Earth’s complexity could, in principle, be modeled by (surrogated by) a numerical algorithm if enough computing power were granted. Yet, similar numerical algorithms also surrogate different systems having the same processes and dynamics, such as Mars or Jupiter, although being qualitatively different from the Earth system. Here, we argue that understanding the Earth as a complex system requires a consideration of the Gaia hypothesis: the Earth is a complex system because it instantiates life—and therefore an autopoietic, metabolic-repair (M,R) organization—at a planetary scale. This implies that the Earth’s complexity has formal equivalence to a self-referential system that inherently is non-algorithmic and, therefore, cannot be surrogated and simulated in a Turing machine. We discuss the consequences of this, with reference to in-silico climate models, tipping points, planetary boundaries, and planetary feedback loops as units of adaptive evolution and selection.     

High-Dimensional Separability for One- and Few-Shot Learning

This work is driven by a practical question: corrections of Artificial Intelligence (AI) errors. These corrections should be quick and non-iterative. To solve this problem without modification of a legacy AI system, we propose special ‘external’ devices, correctors. Elementary correctors consist of two parts, a classifier that separates the situations with high risk of error from the situations in which the legacy AI system works well and a new decision that should be recommended for situations with potential errors. Input signals for the correctors can be the inputs of the legacy AI system, its internal signals, and outputs. If the intrinsic dimensionality of data is high enough then the classifiers for correction of small number of errors can be very simple. According to the blessing of dimensionality effects, even simple and robust Fisher’s discriminants can be used for one-shot learning of AI correctors. Stochastic separation theorems provide the mathematical basis for this one-short learning. However, as the number of correctors needed grows, the cluster structure of data becomes important and a new family of stochastic separation theorems is required. We refuse the classical hypothesis of the regularity of the data distribution and assume that the data can have a rich fine-grained structure with many clusters and corresponding peaks in the probability density. New stochastic separation theorems for data with fine-grained structure are formulated and proved. On the basis of these theorems, the multi-correctors for granular data are proposed. The advantages of the multi-corrector technology were demonstrated by examples of correcting errors and learning new classes of objects by a deep convolutional neural network on the CIFAR-10 dataset. The key problems of the non-classical high-dimensional data analysis are reviewed together with the basic preprocessing steps including the correlation transformation, supervised Principal Component Analysis (PCA), semi-supervised PCA, transfer component analysis, and new domain adaptation PCA.     

Wigner’s Friend Scenarios and the Internal Consistency of Standard Quantum Mechanics

Wigner’s friend scenarios involve an Observer, or Observers, measuring a Friend, or Friends, who themselves make quantum measurements. In recent discussions, it has been suggested that quantum mechanics may not always be able to provide a consistent account of a situation involving two Observers and two Friends. We investigate this problem by invoking the basic rules of quantum mechanics as outlined by Feynman in the well-known “Feynman Lectures on Physics”. We show here that these “Feynman rules” constrain the a priori assumptions which can be made in generalised Wigner’s friend scenarios, because the existence of the probabilities of interest ultimately depends on the availability of physical evidence (material records) of the system’s past. With these constraints obeyed, a non-ambiguous and consistent account of all measurement outcomes is obtained for all agents, taking part in various Wigner’s Friend scenarios.     

The effect of carrier concentration in the semiconductor on the voltage-current characteristics of Schottky barrier diodes at low temperatures

We report the results of a study of voltage-current characteristics of gallium arsenide metal-semiconductor Schottky barrier structures, in which palladium and W-Ni alloy were electrochemically deposited in SiO₂ windows to form the barrier. It is demonstrated that the voltage-current characteristics are significantly distorted at low temperatures. The observed behavior of the voltage-current characteristics at low temperatures —the appearance of excess current and the increase in the ideality factor with carrier concentration in the excess current regime —is explained by a model in which peripheral mechanical stresses in the contacts lower the potential barrier height on the periphery of the contacts.Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No, 10, pp. 87–93, October, 1986.     

Getting Ahead of the Arms Race: Hothousing the Coevolution of VirusTotal with a Packer

Malware detection is in a coevolutionary arms race where the attackers and defenders are constantly seeking advantage. This arms race is asymmetric: detection is harder and more expensive than evasion. White hats must be conservative to avoid false positives when searching for malicious behaviour. We seek to redress this imbalance. Most of the time, black hats need only make incremental changes to evade them. On occasion, white hats make a disruptive move and find a new technique that forces black hats to work harder. Examples include system calls, signatures and machine learning. We present a method, called Hothouse, that combines simulation and search to accelerate the white hat’s ability to counter the black hat’s incremental moves, thereby forcing black hats to perform disruptive moves more often. To realise Hothouse, we evolve EEE, an entropy-based polymorphic packer for Windows executables. Playing the role of a black hat, EEE uses evolutionary computation to disrupt the creation of malware signatures. We enter EEE into the detection arms race with VirusTotal, the most prominent cloud service for running anti-virus tools on software. During our 6 month study, we continually improved EEE in response to VirusTotal, eventually learning a packer that produces packed malware whose evasiveness goes from an initial 51.8% median to 19.6%. We report both how well VirusTotal learns to detect EEE-packed binaries and how well VirusTotal forgets in order to reduce false positives. VirusTotal’s tools learn and forget fast, actually in about 3 days. We also show where VirusTotal focuses its detection efforts, by analysing EEE’s variants.     

Generalized Ising Model on a Scale-Free Network: An Interplay of Power Laws

We consider a recently introduced generalization of the Ising model in which individual spin strength can vary. The model is intended for analysis of ordering in systems comprising agents which, although matching in their binarity (i.e., maintaining the iconic Ising features of ‘+’ or ‘−’, ‘up’ or ‘down’, ‘yes’ or ‘no’), differ in their strength. To investigate the interplay between variable properties of nodes and interactions between them, we study the model on a complex network where both the spin strength and degree distributions are governed by power laws. We show that in the annealed network approximation, thermodynamic functions of the model are self-averaging and we obtain an exact solution for the partition function. This allows us derive the leading temperature and field dependencies of thermodynamic functions, their critical behavior, and logarithmic corrections at the interface of different phases. We find the delicate interplay of the two power laws leads to new universality classes.     

The Information Conveyed in a SPAC′s Offering

The popularity of SPACs (Special Purpose Acquisition Companies) has grown dramatically in recent years as a substitute for the traditional IPO (Initial Public Offer). We modeled the average annual return for SPAC investors and found that this financial tool produced an annual return of 17.3%. We then constructed an information model that examined a SPAC′s excess returns during the 60 days after a potential merger or acquisition had been announced. We found that the announcement had a major impact on the SPAC’s share price over the 60 days, delivering on average 0.69% daily excess returns over the IPO portfolio and 31.6% cumulative excess returns for the entire period. Relative to IPOs, the cumulative excess returns of SPACs rose dramatically in the next few days after the potential merger or acquisition announcement until the 26th day. They then declined but rose again until the 48th day after the announcement. Finally, the SPAC’s structure reduced the investors’ risk. Thus, if investors buy a SPAC stock immediately after a potential merger or acquisition has been announced and hold it for 48 days, they can reap substantial short-term returns.     

Early Prediction of Physical Performance in Elite Soccer Matches—A Machine Learning Approach to Support Substitutions

Substitution is an essential tool for a coach to influence the match. Factors like the injury of a player, required tactical changes, or underperformance of a player initiates substitutions. This study aims to predict the physical performance of individual players in an early phase of the match to provide additional information to the coach for his decision on substitutions. Tracking data of individual players, except for goalkeepers, from 302 elite soccer matches of the Dutch ‘Eredivisie’ 2018–2019 season were used to enable the prediction of the individual physical performance. The players’ physical performance is expressed in the variables distance covered, distance in speed category, and energy expenditure in power category. The individualized normalized variables were used to build machine learning models that predict whether players will achieve 100%, 95%, or 90% of their average physical performance in a match. The tree-based algorithms Random Forest and Decision Tree were applied to build the models. A simple Naïve Bayes algorithm was used as the baseline model to support the superiority of the tree-based algorithms. The machine learning technique Random Forest combined with the variable energy expenditure in the power category was the most precise. The combination of Random Forest and energy expenditure in the power category resulted in precision in predicting performance and underperformance after 15 min in a match, and the values were 0.91, 0.88, and 0.92 for the thresholds 100%, 95%, and 90%, respectively. To conclude, it is possible to predict the physical performance of individual players in an early phase of the match. These findings offer opportunities to support coaches in making more informed decisions on player substitutions in elite soccer.     

Computational Abstraction

Representation and abstraction are two of the fundamental concepts of computer science. Together they enable “high-level” programming: without abstraction programming would be tied to machine code; without a machine representation, it would be a pure mathematical exercise. Representation begins with an abstract structure and seeks to find a more concrete one. Abstraction does the reverse: it starts with concrete structures and abstracts away. While formal accounts of representation are easy to find, abstraction is a different matter. In this paper, we provide an analysis of data abstraction based upon some contemporary work in the philosophy of mathematics. The paper contains a mathematical account of how Frege’s approach to abstraction may be interpreted, modified, extended and imported into type theory. We argue that representation and abstraction, while mathematical siblings, are philosophically quite different. A case of special interest concerns the abstract/physical interface which houses both the physical representation of abstract structures and the abstraction of physical systems.     

Beyond the Limits of Shannon’s Information in Quantum Key Distribution

We present a new post-processing method for Quantum Key Distribution (QKD) that raises cubically the secret key rate in the number of double matching detection events. In Shannon’s communication model, information is prepared at Alice’s side, and it is then intended to pass it over a noisy channel. In our approach, secret bits do not rely in Alice’s transmitted quantum bits but in Bob’s basis measurement choices. Therefore, measured bits are publicly revealed, while bases selections remain secret. Our method implements sifting, reconciliation, and amplification in a unique process, and it just requires a round iteration; no redundancy bits are sent, and there is no limit in the correctable error percentage. Moreover, this method can be implemented as a post-processing software into QKD technologies already in use.     

Investigation on Identifying Implicit Learning Event from EEG Signal Using Multiscale Entropy and Artificial Bee Colony

The way people learn will play an essential role in the sustainable development of the educational system for the future. Utilizing technology in the age of information and incorporating it into how people learn can produce better learners. Implicit learning is a type of learning of the underlying rules without consciously seeking or understanding the rules; it is commonly seen in small children while learning how to speak their native language without learning grammar. This research aims to introduce a processing system that can systematically identify the relationship between implicit learning events and their Encephalogram (EEG) signal characteristics. This study converted the EEG signal from participants while performing cognitive task experiments into Multiscale Entropy (MSE) data. Using MSE data from different frequency bands and channels as features, the system explored a wide range of classifiers and observed their performance to see how they classified the features related to participants’ performance. The Artificial Bee Colony (ABC) method was used for feature selection to improve the process to make the system more efficient. The results showed that the system could correctly identify the differences between participants’ performance using MSE data and the ABC method with 95% confidence.     

Implications of Local Friendliness Violation for Quantum Causality

We provide a new formulation of the Local Friendliness no-go theorem of Bong et al. [Nat. Phys. 16, 1199 (2020)] from fundamental causal principles, providing another perspective on how it puts strictly stronger bounds on quantum reality than Bell’s theorem. In particular, quantum causal models have been proposed as a way to maintain a peaceful coexistence between quantum mechanics and relativistic causality while respecting Leibniz’s methodological principle. This works for Bell’s theorem but does not work for the Local Friendliness no-go theorem, which considers an extended Wigner’s Friend scenario. More radical conceptual renewal is required; we suggest that cleaving to Leibniz’s principle requires extending relativity to events themselves.     

An ESR Framework for the Study of Consciousness

I will argue that, in an interdisciplinary study of consciousness, epistemic structural realism (ESR) can offer a feasible philosophical background for the study of consciousness and its associated neurophysiological phenomena in neuroscience and cognitive science while also taking into account the mathematical structures involved in this type of research. Applying the ESR principles also to the study of the neurophysiological phenomena associated with free will (or rather conscious free choice) and with various alterations of consciousness (AOCs) generated by various pathologies such as epilepsy would add explanatory value to the matter. This interdisciplinary approach would be in tune with Quine’s well known idea that philosophy is not simple conceptual analysis but is continuous with science and actually represents an abstract branch of the empirical research. The ESR could thus resonate with scientific models of consciousness such as the global neuronal workspace model (inspired by the global workspace theory—GWT) and the integrated information theory (IIT) model. While structural realism has already been employed in physics or biology, its application as a meta-theory contextualising and relating various scientific findings on consciousness is new indeed. Out of the two variants: ontic structural realism (OSR) and epistemic structural realism (ESR), the latter can be considered more suitable for the study of consciousness and its associated neurophysiological phenomena because it removes the pressure of the still unanswered ‘What is consciousness?’ ontological question and allows us to concentrate instead on the ‘What can we know about consciousness?’ epistemological question.     

Personalized Image Classification by Semantic Embedding and Active Learning

Currently, deep learning has shown state-of-the-art performance in image classification with pre-defined taxonomy. However, in a more real-world scenario, different users usually have different classification intents given an image collection. To satisfactorily personalize the requirement, we propose an interactive image classification system with an offline representation learning stage and an online classification stage. During the offline stage, we learn a deep model to extract the feature with higher flexibility and scalability for different users’ preferences. Instead of training the model only with the inter-class discrimination, we also encode the similarity between the semantic-embedding vectors of the category labels into the model. This makes the extracted feature adapt to multiple taxonomies with different granularities. During the online session, an annotation task iteratively alternates with a high-throughput verification task. When performing the verification task, the users are only required to indicate the incorrect prediction without giving the exact category label. For each iteration, our system chooses the images to be annotated or verified based on interactive efficiency optimization. To provide a high interactive rate, a unified active learning algorithm is used to search the optimal annotation and verification set by minimizing the expected time cost. After interactive annotation and verification, the new classified images are used to train a customized classifier online, which reflects the user-adaptive intent of categorization. The learned classifier is then used for subsequent annotation and verification tasks. Experimental results under several public image datasets show that our method outperforms existing methods.     

Structural statistical properties of knotted proteins

The composition and residue--residue interactions of knotted proteins, compared with those of other proteins, can provide considerable insight into the driver of the knots in proteins. In this paper, we calculate the probabilities of 20 amino acids in 273 knotted entries from the Protein Data Bank (PDB). The collection of 273 entries contains all knotted structures in the PDB, and it is not a subset. With an appropriate value of R_c, the numbers of all residue--residue contacts are counted in all 273 knotted structures. To make an accurate comparison, we count up to 9000 other entries from the PDB as well, and these entries spread over all sorts. In knotted structures, Leu occupies a maximal proportion of 9.62% among all 20 amino acids, and Leu, Phe, Trp, Gly, His, Gln, Asp, Lys and Pro may all play a more important role. Also, we analyse the effects of amino acid residues on the long-range contacts. We observe a larger average number of long-range contacts in the knotted structures than that in other ones, implying their important role in achieving the knots. Accordingly, the average number of short-range contacts becomes small when the structure becomes knotted because it depends mainly on the short-haul sequence of amino acids to form the short-range contact. In addition, the shape distribution of knotted proteins and the contrast with the other proteins are also presented. A comparison shows that the knots may make structures more globular because the average shape factor is 0.059 for the knotted proteins, which is only about 1/3 of the average shape factor for the other proteins.     

Data-Driven Model Reduction for Stochastic Burgers Equations

We present a class of efficient parametric closure models for 1D stochastic Burgers equations. Casting it as statistical learning of the flow map, we derive the parametric form by representing the unresolved high wavenumber Fourier modes as functionals of the resolved variable’s trajectory. The reduced models are nonlinear autoregression (NAR) time series models, with coefficients estimated from data by least squares. The NAR models can accurately reproduce the energy spectrum, the invariant densities, and the autocorrelations. Taking advantage of the simplicity of the NAR models, we investigate maximal space-time reduction. Reduction in space dimension is unlimited, and NAR models with two Fourier modes can perform well. The NAR model’s stability limits time reduction, with a maximal time step smaller than that of the K-mode Galerkin system. We report a potential criterion for optimal space-time reduction: the NAR models achieve minimal relative error in the energy spectrum at the time step, where the K-mode Galerkin system’s mean Courant–Friedrichs–Lewy (CFL) number agrees with that of the full model.