Reviewerly/exHarmony huggingface dataset:
A prognostic model for overall survival of patients with early-stage non-small cell lung cancer: a multicentre, retrospective study

Intratumoural heterogeneity has been previously shown to be related to clonal evolution and genetic instability and associated with tumour progression. Phenotypically, it is reflected in the diversity of appearance and morphology within cell populations. Computer-extracted features relating to tumour cellular diversity on routine tissue images might correlate with outcome. This study investigated the prognostic ability of computer-extracted features of tumour cellular diversity (CellDiv) from haematoxylin and eosin (H&E)-stained histology images of non-small cell lung carcinomas (NSCLCs).In this multicentre, retrospective study, we included 1057 patients with early-stage NSCLC with corresponding diagnostic histology slides and overall survival information from four different centres. CellDiv features quantifying local cellular morphological diversity from H&E-stained histology images were extracted from the tumour epithelium region. A Cox proportional hazards model based on CellDiv was used to construct risk scores for lung adenocarcinoma (LUAD; 270 patients) and lung squamous cell carcinoma (LUSC; 216 patients) separately using data from two of the cohorts, and was validated in the two remaining independent cohorts (comprising 236 patients with LUAD and 335 patients with LUSC). We used multivariable Cox regression analysis to examine the predictive ability of CellDiv features for 5-year overall survival, controlling for the effects of clinical and pathological parameters. We did a gene set enrichment and Gene Ontology analysis on 405 patients to identify associations with differentially expressed biological pathways implicated in lung cancer pathogenesis.For prognosis of patients with early-stage LUSC, the CellDiv LUSC model included 11 discriminative CellDiv features, whereas for patients with early-stage LUAD, the model included 23 features. In the independent validation cohorts, patients predicted to be at a higher risk by the univariable CellDiv model had significantly worse 5-year overall survival (hazard ratio 1·48 [95% CI 1·06-2·08]; p=0·022 for The Cancer Genome Atlas [TCGA] LUSC group, 2·24 [1·04-4·80]; p=0·039 for the University of Bern LUSC group, and 1·62 [1·15-2·30]; p=0·0058 for the TCGA LUAD group). The identified CellDiv features were also found to be strongly associated with apoptotic signalling and cell differentiation pathways.CellDiv features were strongly prognostic of 5-year overall survival in patients with early-stage NSCLC and also associated with apoptotic signalling and cell differentiation pathways. The CellDiv-based risk stratification model could potentially help to determine which patients with early-stage NSCLC might receive added benefit from adjuvant therapy.National Institue of Health and US Department of Defense.
Validation of Acute Myocardial Infarction and Heart Failure Diagnoses in Hospitalized Patients With the Nationwide Claim-Based JROAD-DPC Database

Background:Big data systems such as diagnosis procedure combination (DPC) datasets have recently been used for research purposes. However, there have been few validation studies to determine the accuracy of diagnoses. The aim of this study was to validate and evaluate 2 diagnoses, namely acute myocardial infarction (AMI) and heart failure (HF), using International Classification of Diseases, 10th revision (ICD-10) codes in the Japanese Registry Of All cardiac and vascular Disease (JROAD)-DPC database.
Light-weight federated learning-based anomaly detection for time-series data in industrial control systems

With the emergence of the Industrial Internet of Things (IIoT), potential threats to smart manufacturing systems are increasingly becoming challenging, causing severe damage to production operations and vital industrial assets, even sensitive information. Hence, detecting irregularities for time-series data in industrial control systems that should operate continually is critical, ensuring security and minimizing maintenance costs. In this study, with the hybrid design of Federated learning, Autoencoder, Transformer, and Fourier mixing sublayer, we propose a robust distributed anomaly detection architecture that works more accurately than several most recent anomaly detection solutions within the ICS contexts, whilst being fast learning in minute time scale. This distributed architecture is also proven to achieve lightweight, consume little CPU and memory usage, have low communication costs in terms of bandwidth consumption, which makes it feasible to be deployed on top of edge devices with limited computing capacity.
YOLOv7-RAR for Urban Vehicle Detection

Aiming at the problems of high missed detection rates of the YOLOv7 algorithm for vehicle detection on urban roads, weak perception of small targets in perspective, and insufficient feature extraction, the YOLOv7-RAR recognition algorithm is proposed. The algorithm is improved from the following three directions based on YOLOv7. Firstly, in view of the insufficient nonlinear feature fusion of the original backbone network, the Res3Unit structure is used to reconstruct the backbone network of YOLOv7 to improve the ability of the network model architecture to obtain more nonlinear features. Secondly, in view of the problem that there are many interference backgrounds in urban roads and that the original network is weak in positioning targets such as vehicles, a plug-and-play hybrid attention mechanism module, ACmix, is added after the SPPCSPC layer of the backbone network to enhance the network’s attention to vehicles and reduce the interference of other targets. Finally, aiming at the problem that the receptive field of the original network Narrows, with the deepening of the network model, leads to a high miss rate of small targets, the Gaussian receptive field scheme used in the RFLA (Gaussian-receptive-field-based label assignment) module is used at the connection between the feature fusion area and the detection head to improve the receptive field of the network model for small objects in the image. Combining the three improvement measures, the first letter of the name of each improvement measure is selected, and the improved algorithm is named the YOLOv7-RAR algorithm. Experiments show that on urban roads with crowded vehicles and different weather patterns, the average detection accuracy of the YOLOv7-RAR algorithm reaches 95.1%, which is 2.4% higher than that of the original algorithm; the AP50:90 performance is 12.6% higher than that of the original algorithm. The running speed of the YOLOv7-RAR algorithm reaches 96 FPS, which meets the real-time requirements of vehicle detection; hence, the algorithm can be better applied to vehicle detection.
Connecting Subspace Learning and Extreme Learning Machine in Speech Emotion Recognition

Speech emotion recognition (SER) is a powerful tool for endowing computers with the capacity to process information about the affective states of users in human-machine interactions. Recent research has shown the effectiveness of graph embedding-based subspace learning and extreme learning machine applied to SER, but there are still various drawbacks in these two techniques that limit their application. Regarding subspace learning, the change from linearity to nonlinearity is usually achieved through kernelization, whereas extreme learning machines only take label information into consideration at the output layer. In order to overcome these drawbacks, this paper leverages extreme learning machines for dimensionality reduction and proposes a novel framework to combine spectral regression-based subspace learning and extreme learning machines. The proposed framework contains three stages-data mapping, graph decomposition, and regression. At the data mapping stage, various mapping strategies provide different views of the samples. At the graph decomposition stage, specifically designed embedding graphs provide a possibility to better represent the structure of data through generating virtual coordinates. Finally, at the regression stage, dimension-reduced mappings are achieved by connecting the virtual coordinates and data mapping. Using this framework, we propose several novel dimensionality reduction algorithms, apply them to SER tasks, and compare their performance to relevant state-of-the-art methods. Our results on several paralinguistic corpora show that our proposed techniques lead to significant improvements.
Zeno: Distributed stochastic gradient descent with suspicion-based fault-tolerance

We present Zeno, a technique to make distributed machine learning, particularly Stochastic Gradient Descent (SGD), tolerant to an arbitrary number of faulty workers. Zeno generalizes previous results that assumed a majority of non-faulty nodes; we need assume only one non-faulty worker. Our key idea is to suspect workers that are potentially defective. Since this is likely to lead to false positives, we use a ranking-based preference mechanism. We prove the convergence of SGD for non-convex problems under these scenarios. Experimental results show that Zeno outperforms existing approaches.
Ten Years of the Postdigital in the 52group: Reflections and Developments 2009–2019

This paper traces ten years of development of the concept of the postdigital in the works of six scholars (Richard Hall, Ian Truelove, David White, Mark Childs, David Cormier, and Lawrie Phipps) acting under the collective pseudonym the 52group. The first part of the paper reproduces the 52group's manifesto entitled 'Preparing for the postdigital era'. The second part of the paper reproduces 2015 responses to 'Preparing for the postdigital era' published on group members' blogs and websites. The third part of the paper brings together group members' responses written in 2019 for the purpose of this article. The conclusion analyses these developments and situates them within recent developments in postdigital thinking. The article provides deep insights into the nature of our postdigital reality and offers two main contributions. First, the article offers some intellectual ancestry for postdigital theory and practice. Second, the article offers a unique insight into the evolution of feelings of people who have thought deeply about our postdigital era. With these contributions, the article offers a much-needed historical view to the postdigital and situates current postdigital thought into wider philosophical, social, and educational contexts.
Jointly Extracting and Compressing Documents with Summary State Representations

Afonso Mendes, Shashi Narayan, Sebastião Miranda, Zita Marinho, André F. T. Martins, Shay B. Cohen. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). 2019.
Multi-scale Cell Instance Segmentation with Keypoint Graph Based Bounding Boxes

Most existing methods handle cell instance segmentation problems directly without relying on additional detection boxes. These methods generally fails to separate touching cells due to the lack of global understanding of the objects. In contrast, box-based instance segmentation solves this problem by combining object detection with segmentation. However, existing methods typically utilize anchor box-based detectors, which would lead to inferior instance segmentation performance due to the class imbalance issue. In this paper, we propose a new box-based cell instance segmentation method. In particular, we first detect the five pre-defined points of a cell via keypoints detection. Then we group these points according to a keypoint graph and subsequently extract the bounding box for each cell. Finally, cell segmentation is performed on feature maps within the bounding boxes. We validate our method on two cell datasets with distinct object shapes, and empirically demonstrate the superiority of our method compared to other instance segmentation techniques. Code is available at: https://github.com/yijingru/KG_Instance_Segmentation .
Probabilistic verification of fairness properties via concentration

As machine learning systems are increasingly used to make real world legal and financial decisions, it is of paramount importance that we develop algorithms to verify that these systems do not discriminate against minorities. We design a scalable algorithm for verifying fairness specifications. Our algorithm obtains strong correctness guarantees based on adaptive concentration inequalities; such inequalities enable our algorithm to adaptively take samples until it has enough data to make a decision. We implement our algorithm in a tool called VeriFair, and show that it scales to large machine learning models, including a deep recurrent neural network that is more than five orders of magnitude larger than the largest previously-verified neural network. While our technique only gives probabilistic guarantees due to the use of random samples, we show that we can choose the probability of error to be extremely small.
Special Issue “On Defining Artificial Intelligence”—Commentaries and Author’s Response

All commentaries were accepted after peer-review.If the reader was expecting a consensus around defining AI, we are afraid we have to disappoint them.We have received many kinds of responses: commentators that don't agree with Pei Wang's definition and provide their own, those that don't consider we need new definitions at all, those that agree with Wang's but still provide a new definition of AI, as well as those that additionally prefer to comment about other topics they feel are also important.A very colored spectrum around defining the most important concept of the AI field!
Privacy preservation in e-health cloud: taxonomy, privacy requirements, feasibility analysis, and opportunities

Electronic health records (EHRs) are increasingly employed to maintain, store and share varied types of patient data. The data can also be utilized for various research purposes, such as clinical trials or epidemic control strategies. With the increasing cost and scarcity of healthcare services, healthcare organizations feel at ease in outsourcing these services to cloud-based EHRs. That serves as pay-as-you-go (PAYG) “e-health cloud” models to aid the healthcare organizations handling with existing and imminent demands yet restricting their costs. Technologies can host some risks; hence the privacy of information in these systems is of utmost importance. Regardless of its increased effectiveness and growing eagerness in its adoption, not much care is being employed to the privacy issues that might arise. Privacy preservation need to be reviewed about the changing privacy rules and legislations regarding sensitive personal data. Our work aims at answering three major questions: firstly, how privacy models and privacy techniques correlate with each other, secondly, how we can fix the privacy-utility-trade off by using different combinations of privacy models and privacy techniques and lastly, what are the most relevant privacy techniques that can be adapted to achieve privacy of EHR on cloud.
Neural monocular 3D human motion capture with physical awareness

We present a new trainable system for physically plausible markerless 3D human motion capture, which achieves state-of-the-art results in a broad range of challenging scenarios. Unlike most neural methods for human motion capture, our approach, which we dub "physionical", is aware of physical and environmental constraints. It combines in a fully-differentiable way several key innovations, i.e. , 1) a proportional-derivative controller, with gains predicted by a neural network, that reduces delays even in the presence of fast motions, 2) an explicit rigid body dynamics model and 3) a novel optimisation layer that prevents physically implausible foot-floor penetration as a hard constraint. The inputs to our system are 2D joint keypoints, which are canonicalised in a novel way so as to reduce the dependency on intrinsic camera parameters---both at train and test time. This enables more accurate global translation estimation without generalisability loss. Our model can be finetuned only with 2D annotations when the 3D annotations are not available. It produces smooth and physically-principled 3D motions in an interactive frame rate in a wide variety of challenging scenes, including newly recorded ones. Its advantages are especially noticeable on in-the-wild sequences that significantly differ from common 3D pose estimation benchmarks such as Human 3.6M and MPI-INF-3DHP. Qualitative results are provided in the supplementary video.
Deep learning for the internet of things: Potential benefits and use-cases

The massive number of sensors deployed in the Internet of Things (IoT) produce gigantic amounts of data for facilitating a wide range of applications. Deep Learning (DL) would undoubtedly play a role in generating valuable inferences from this massive volume of data and hence will assist in creating smarter IoT. In this regard, exploring the potential of DL for IoT data analytics becomes highly crucial. This paper begins with a concise discussion on the Deep Neural Network (DNN) and its different architectures. The potential benefits that DL will bring to the IoT are also discussed. Then, a detailed review of DL-driven IoT use-cases is presented. Moreover, this paper formulates a DL-based model for Human Activity Recognition (HAR). It carries out a performance comparison of the proposed model with other machine learning techniques to delineate the superiority of the DL model over other techniques. Apart from enlightening the potential of DL in IoT applications, this paper will serve as an impetus to encourage advanced research in the realm of DL-driven IoT applications.
A Multiple Layer U-Net, U<sup>n</sup>-Net, for Liver and Liver Tumor Segmentation in CT

Medical image segmentation is one of the crucial tasks in diagnosis as well as pre-surgery. Recently, deep learning has significantly contributed to improving the efficiency of medical image extraction. The U-Net network has been a favored network model, which has been used as a platform architecture, for medical image segmentation. For the success of these studies, most of these models were primarily focused on the changing of the interconnection between the nodes in the network, and changing the structure of the convolution units. This would result in the ignorance of the output features of convolution units in the nodes. In this study, a U <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> -Net, an n-fold network architecture, was proposed based on the traditional U-Net. In the U <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> -Net model, the output features of the convolution units are taken as the skip connection. Therefore, the U <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> -Net network exploits the output features of the convolution units in the nodes. In this study, we investigated a U <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> -Net and a U <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> -Net for segmentation of the liver and liver tumors. Besides, dilated convolution (DC) and dense structure were also used in the nodes of our networks. The efficiency of our models was evaluated on two public datasets: LiTS and 3DIRCADb. The Dice's Similarity Coefficient (DSC) of our proposed models achieved 96.38% for liver segmentation and 73.69% for tumor segmentation on the LiTS dataset. For the 3DIRCADb dataset, the results achieved 96.45% in DSC for the liver segmentation and 73.34% for the tumor segmentation. The experimental results show that our proposed networks achieved better results than the recent networks. And it is convinced that our network would be useful for practical deployments.
Review and analysis of blockchain projects in supply chain management

Supply chains have become increasingly complex, making it difficult to ensure transparency throughout the whole supply chain. In this context, first approaches came up, adopting the immutable, decentralised, and secure characteristics of the blockchain technology to increase the transparency, security, authenticity, and auditability of assets in supply chains. This paper investigates recent publications combining the blockchain technology and supply chain management and classifies them regarding the complexity to be mapped on the blockchain. As a result, the increase of supply chain transparency is identified as the main objective of recent blockchain projects in supply chain management. Thereby, most of the recent publications deal with simple supply chains and products. The few approaches dealing with complex parts only map sub-areas of supply chains. Currently no example exists which has the aim of increasing the transparency of complex manufacturing supply chains, and which enables the mapping of complex assembly processes, an efficient auditability of all assets, and an implementation of dynamic adjustments.
On Nonconvex Optimization for Machine Learning

Gradient descent (GD) and stochastic gradient descent (SGD) are the workhorses of large-scale machine learning. While classical theory focused on analyzing the performance of these methods in convex optimization problems, the most notable successes in machine learning have involved nonconvex optimization, and a gap has arisen between theory and practice. Indeed, traditional analyses of GD and SGD show that both algorithms converge to stationary points efficiently. But these analyses do not take into account the possibility of converging to saddle points. More recent theory has shown that GD and SGD can avoid saddle points, but the dependence on dimension in these analyses is polynomial. For modern machine learning, where the dimension can be in the millions, such dependence would be catastrophic. We analyze perturbed versions of GD and SGD and show that they are truly efficient—their dimension dependence is only polylogarithmic. Indeed, these algorithms converge to second-order stationary points in essentially the same time as they take to converge to classical first-order stationary points.
Blockchain-Based Model for Expanding IoT Device Data Security

Healthcare institutions around the world become an organised and user-centred structures. Managing vast volumes of data, such as IoT device data or medical records of each person, however, contributes to an increase in human resources and security threats. To solve these challenges, healthcare IoT increases the quality of patient care and lowers costs by efficiently allocating medical services. Via blockchain technology, we have a safety mechanism for healthcare data through creating the SHA256 hash algorithm of each data such that every modification or alteration of data confirmed with improved simulation results that due to blockchain methodology give the security. Our proposed algorithm based on SHA256 hash algorithm to every block which are verified by every node, data cannot be altered by nefarious source. In this research work, we proposed a blockchain-based model with consensus protocol and SHA256 hash algorithm related to the priorities of the verifiability, suitability, extensiveness, uniqueness, sturdiness, and coercion resistance.