Reviewerly/exHarmony huggingface dataset:
TCStream: Large-Scale Graph Triangle-Counting on a single Machine using GPUs

In this paper, we build a TC-Stream, a high-performance graph processing system specific for a triangle counting algorithm on graph data with up to tens of billions of edges, which significantly exceeds the device memory capacity of Graphics Processing Units (GPUs). The triangle counting problem is a broad research topic in data mining and social network analysis in the graph processing field. As the scale of the graph data grows, a portion of the graph data must be loaded iteratively. To solve the above problem, we propose TC-Stream. It focuses on three issues: 1) For power-law graphs, because the amount of tasks of each vertex or edge is inconsistent, it is bound to cause different demands of computing and memory resources for different task types. We propose a parallel vertex approach and the reordering of vertices for graph data that can be placed in the GPU device memory to ensure the maximum workload balancing; 2) A binary-search-based set intersection method is designed to achieve the maximum parallelism in GPU; 3) For the graph data that exceeds the GPU device memory capacity, we develop a novel vertical partition algorithm to guarantee the independent computing on each partition so that the three computation processes, i.e., the computation on GPU, the data transmission between main memory of CPU and SSD, and the communication between the CPU and the GPU can be perfectly overlapped. Extensive experiments conducted on large-scale datasets showed that the TC-stream running on a single Tesla V100 GPU performs 2.4 6 and 1.8 4.4 faster than the state-of-the-art single-machine in-memory triangle counting system and GPU-based triangle counting system, respectively, and achieves 2.4faster than the state-of-the-art out-of-core distributed system PDTL running on an 8-node cluster when processing the graph data with 42.5 billion edges.
A Knowledge Distillation Ensemble Framework for Predicting Short- and Long-Term Hospitalization Outcomes From Electronic Health Records Data

The ability to perform accurate prognosis is crucial for proactive clinical decision making, informed resource management and personalised care. Existing outcome prediction models suffer from a low recall of infrequent positive outcomes. We present a highly-scalable and robust machine learning framework to automatically predict adversity represented by mortality and ICU admission and readmission from time-series of vital signs and laboratory results obtained within the first 24 hours of hospital admission. The stacked ensemble platform comprises two components: a) an unsupervised LSTM Autoencoder that learns an optimal representation of the time-series, using it to differentiate the less frequent patterns which conclude with an adverse event from the majority patterns that do not, and b) a gradient boosting model, which relies on the constructed representation to refine prediction by incorporating static features. The model is used to assess a patient's risk of adversity and provides visual justifications of its prediction. Results of three case studies show that the model outperforms existing platforms in ICU and general ward settings, achieving average Precision-Recall Areas Under the Curve (PR-AUCs) of 0.891 (95% CI: 0.878-0.939) for mortality and 0.908 (95% CI: 0.870-0.935) in predicting ICU admission and readmission.
Homography-Based Visual Servoing for Underactuated VTOL UAVs Tracking a 6-DOF Moving Ship

This paper develops a novel homography-based visual servo control method for the vertical take-off and landing (VTOL) unmanned aerial vehicle (UAV) tracking the trajectory of a 6 degrees of freedom (6-DOF) moving ship. Different from the classical homography-based visual servoing which is only suitable for the trajectory tracking of a planar moving target, an extended homography-based visual servoing framework is proposed to track the trajectory of a 6-DOF moving target regardless of its time-varying rotational motion. Taking entries in the homography matrix as feedback, the visual dynamics of UAV is established and decoupled into a translational motion sub-dynamics and an attitude sub-dynamics based on the hierarchical control strategy. In the translational motion subsystem, the robust controller is designed by embedding the nonlinear differentiator, the adaptive method, and a smooth saturation model in the backstepping control scheme. The saturation model is introduced to generate the constrained control inputs to ensure the nonsingular attitude extraction and help the visual points remain in the camera’s field of view (FoV) simultaneously. In the attitude subsystem, a robust state-constrained control method is proposed by utilizing a robust control barrier function (RCBF), the quadratic programming (QP) and a saturation model to guarantee the visibility, where RCBF can accommodate unknown dynamics. The theoretical analysis demonstrates the asymptotic stability of the closed-loop system. Simulations are carried out to further validate the controller performance.
A Description of the Jadescript Type System

Jadescript is an agent-oriented programming language that benefits from JADE, the popular framework to develop multi-agent systems in Java. The major goal behind the introduction of Jadescript is to simplify the implementation of real-world multi-agent systems by devising a language with specific linguistic constructs for agent-oriented abstractions. However, Jadescript needs to be coherent and consistent across its several features to effectively achieve its goals. This paper discusses some of the most relevant decisions taken during the design of Jadescript by means of an informal description of its type system. The discussed type system includes ordinary types, as found in many other programming languages, but it also includes a few types that are needed to adequately support relevant agent-oriented abstractions.
A DApp Architecture for Personal Lending on Blockchain

A DApp is a software interacting with it through transactions, user communications, store activity, executing smart contracts, and Ethereum-based on the Blockchain. Many banks or financial institution systems were applying this technology to support customer needs, i.e., in the lending system. When proposing a loan from a bank or other financial institution, it’s generally secured or unsecured. A secured loan offers some form of collateral in return and possibly borrow without any collateral to back the loan (unsecured loan). It all depends on the lender’s requirements. The borrowers can pay installments on time or equal to the guarantees provided. The excellent borrowers’ candidate is very influential in lending activities to minimize financial losses and damage their reputation. Most borrowers are rejected because they are unable to pay back the loan. In this paper, we propose a DApp lending architecture design. The architectural design has been adapted to meet borrowers’ and lenders’ requirements, easy to access and use, simple way for the transaction. We present the advantages of DApp lending architecture is customizable with stakeholders’ needs (Borrowers and Lenders side).
2D-2FA: A New Dimension in Two-Factor Authentication

We propose a two-factor authentication (2FA) mechanism called 2D-2FA to address security and usability issues in existing methods. 2D-2FA has three distinguishing features: First, after a user enters a username and password on a login terminal, a unique identifier is displayed to her. She inputs the same identifier on her registered 2FA device, which ensures appropriate engagement in the authentication process. Second, a one-time PIN is computed on the device and automatically transferred to the server. Thus, the PIN can have very high entropy, making guessing attacks infeasible. Third, the identifier is also incorporated into the PIN computation, which renders concurrent attacks ineffective. Third-party services such as push-notification providers and 2FA service providers, do not need to be trusted for the security of the system. The choice of identifiers depends on the device form factor and the context. Users could choose to draw patterns, capture QR codes, etc.
Multiparty Dual Learning

The performance of machine learning algorithms heavily relies on the availability of a large amount of training data. However, in reality, data usually reside in distributed parties such as different institutions and may not be directly gathered and integrated due to various data policy constraints. As a result, some parties may suffer from insufficient data available for training machine learning models. In this article, we propose a multiparty dual learning (MPDL) framework to alleviate the problem of limited data with poor quality in an isolated party. Since the knowledge-sharing processes for multiple parties always emerge in dual forms, we show that dual learning is naturally suitable to handle the challenge of missing data, and explicitly exploits the probabilistic correlation and structural relationship between dual tasks to regularize the training process. We introduce a feature-oriented differential privacy with mathematical proof, in order to avoid possible privacy leakage of raw features in the dual inference process. The approach requires minimal modifications to the existing multiparty learning structure, and each party can build flexible and powerful models separately, whose accuracy is no less than nondistributed self-learning approaches. The MPDL framework achieves significant improvement compared with state-of-the-art multiparty learning methods, as we demonstrated through simulations on real-world datasets.
A Machine Learning Approach to Detection of Critical Alerts from Imbalanced Multi-Appliance Threat Alert Logs

The extraordinary number of alerts generated by network intrusion detection systems (NIDS) can desensitize security analysts tasked with incident response. Security information and event management systems (SIEMs) perform some rudimentary automation but cannot replicate the decision-making process of a skilled analyst. Machine learning and artificial intelligence (AI) can detect patterns in data with appropriate training. In practice, the majority of the alert data comprises false alerts, and true alerts form only a small proportion. Consequently, a naive engine that classifies all security alerts into the majority class can yield a superficial high accuracy close to 100%. Without any correction for the class imbalance, the false alerts will dominate algorithmic predictions resulting in poor generalization performance. We propose a machine-learning approach to address the class imbalance problem in multi-appliance security alert data and automate the security alert analysis process performed in security operations centers (SOCs). We first used the neighborhood cleaning rule (NCR) to identify and remove ambiguous, noisy, and redundant false alerts. Then, we applied the support vector machine synthetic minority oversampling technique (SVMSMOTE) to generate synthetic training true alerts. Finally, we fit and evaluated the decision tree and random forest classifiers. In the experiments, using alert data from eight security appliances, we demonstrated that the proposed method can significantly reduce the need for manual auditing, decreasing the number of uninspected alerts and achieving a performance of 99.524% in recall.
Cloud Cryptography: Security Aspect

The intension of cloud computing is to provide a dependable, secure, robust, long-lasting, and scalable infrastructure for hosting Internet application services. modest and only adds resources when demand for the service grows The goal of this article is to describe the basis and service model of cloud computing, as well as the security problems associated with cloud computing. Cloud computing is a new type of service that reorders diverse resources and delivers them to users based on their demands; it also plays a significant part in future generation 5G services and mobile networks, as well as Cyber-Physical and social computing. Data in the cloud minimizes the strain on users' storage and offers them with quick access, which is why it has become one of the most essential cloud services.
Synthetic Aperture Radar Image Despeckling Based on Multi-Weighted Sparse Coding

Synthetic aperture radar (SAR) images are inherently degraded by speckle noise caused by coherent imaging, which may affect the performance of the subsequent image analysis task. To resolve this problem, this article proposes an integrated SAR image despeckling model based on dictionary learning and multi-weighted sparse coding. First, the dictionary is trained by groups composed of similar image patches, which have the same structural features. An effective orthogonal dictionary with high sparse representation ability is realized by introducing a properly tight frame. Furthermore, the data-fidelity term and regularization terms are constrained by weighting factors. The weighted sparse representation model not only fully utilizes the interblock relevance but also reflects the importance of various structural groups in despeckling processing. The proposed model is implemented with fast and effective solving steps that simultaneously perform orthogonal dictionary learning, weight parameter updating, sparse coding, and image reconstruction. The solving steps are designed using the alternative minimization method. Finally, the speckles are further suppressed by iterative regularization methods. In a comparison study with existing methods, our method demonstrated state-of-the-art performance in suppressing speckle noise and protecting the image texture details.
Contrastive Graph Representations for Logical Formulas Embedding

Currently, the non-transparent computing process of deep learning has become a significant reason hindering its further development. The Neural-Symbolic (NS) system formed by integrating logic rules into neural networks has attracted increasing attention owing to its direct interpretability. Embedding symbolic logical formulas into a low-dimensional continuous space provides an effective way for the NS system. However, current studies are all constrained by the modeling ability for its syntactic structure and fail to preserve the intrinsic semantics in embeddings, which causes poor performance on downstream reasoning tasks. To this end, this paper proposes a novel method of <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Con</b> trastive <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">G</b> raph <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</b> epresentations (ConGR) for logical formulas embedding. First, to improve the modeling ability for the syntactic structure, ConGR introduces a densely connected graph convolutional network (GCN) with an attention mechanism to process syntax parsing graphs of formulas. In this way, discriminative local and global embeddings of formulas are obtained at the syntax level. Second, the contrastive instances (positive or negative) for each anchor formula are generated by the transformation under the guidance of logical properties. To preserve semantic information, two types of contrast, global-local and global-global, are carried out to refine formula embeddings. Extensive experiments demonstrate that ConGR obtains superior performance against state-of-the-art baselines on entailment checking and premise selection datasets.
Adaptive DRL-Based Task Scheduling for Energy-Efficient Cloud Computing

Intelligent task scheduling solutions are highly demanded in the operation of complex cloud data centers so that resources can be utilized in an energy-efficient way while still ensuring various requirements of users. However, the energy problem of task scheduling in cloud environment becomes more challenging with the ever-increasing number of users as well as the constant and unpredictable change of workloads. In this research, we propose an Adaptive Deep Reinforcement Learning-based (ADRL) task scheduling framework for energy-efficient cloud computing. We first present a Change Detection algorithm to detect whether the workload has changed greatly. On this basis, we built an Automatic Generation network to adjust the discount factor of Deep Reinforcement Learning (DRL) dynamically according to the changing workload, which enables faster and more accurate learning. We finally introduce the adaptive DRL to learn the optimal policy of dispatching arriving user requests with the reward aiming to minimize task response time and maximize resource utilization. Simulated experiments have confirmed that the proposed scheduling scheme performs well on accelerating learning convergence and promoting allocation accuracy, thus it is very effective in reducing the average response time of tasks and increasing the CPU utilization rate of resources, which eventually makes the cloud system more energy efficient.
The Integrated List of Agile Practices - A Tertiary Study

Context: Companies adapt agile methods, practices or artifacts for their use in practice since more than two decades. This adaptions result in a wide variety of described agile practices. For instance, the Agile Alliance lists 75 different practices in its Agile Glossary. This situation may lead to misunderstandings, as agile practices with similar names can be interpreted and used differently. Objective: This paper synthesize an integrated list of agile practices, both from primary and secondary sources. Method: We performed a tertiary study to identify existing overviews and lists of agile practices in the literature. We identified 876 studies, of which 37 were included. Results: The results of our paper show that certain agile practices are listed and used more often in existing studies. Our integrated list of agile practices comprises 38 entries structured in five categories. Conclusion: The high number of agile practices and thus, the wide variety increased steadily over the past decades due to the adaption of agile methods. Based on our findings, we present a comprehensive overview of agile practices. The research community benefits from our integrated list of agile practices as a potential basis for future research. Also, practitioners benefit from our findings, as the structured overview of agile practices provides the opportunity to select or adapt practices for their specific needs.
Piezoelectric and Machine Learning Based Keystroke Dynamics for Highly Secure User Authentication

Cyber security is of significance in today’s e-commerce applications. In this article, we present a piezoelectric touch sensing supported keystroke dynamics based identity authentication technique, for providing a secure access manner to smartphones. Here, the polyvinylidene fluoride (PVDF) based piezoelectric touch panel can learn detailed force touch habits of users. With a support vector machine (SVM) algorithm, our proposed frequency domain features experimentally demonstrate a better authentication accuracy of 98.3%, compared to the traditional time domain features. The work showcases a feasible method of combining functional materials and artificial intelligence (AI) for satisfying highly secure requirements.
POS-Trends Dynamic-Aware Model for Video Caption

Video caption aims to generate descriptive sentences about the video, and the most critical problem is how to achieve accurate word prediction with standardized and coherent syntax structure, which requires the model to thoroughly understand video content and precisely map them into corresponding sentence components. Many existing methods usually fuse different video features into a single visual feature for generating sentences. However, they ignore the word dataset prior information in the annotations (such as Part-Of-Speech) and they also ignore the association between sentence components and types of visual features. To solve these problems, we propose a POS-trends dynamic-aware model (PDA) to fully exploit the word dataset prior information in the captions to predict POS tag, so as to assist generating captions. We propose a POS feature extraction (PFE) module to use different filters to extract different POS-trends features, predict POS tags and fuse visual features. Furthermore, we propose a visual-dynamic-aware (VDA) module to dynamically adjust the mapping way of words and supplement the visual information into the local features. The fusion features provide directional visual information to generate correct words, and the predicted POS tags to guide the decoding process to generate a more standardized and coherent syntax structure. A large number of experiments based on MSVD, MSR-VTT and VATEX demonstrated that our method outperforms the state-of-the-art methods in BLEU-4, ROUGE-L, METEOR, CIDEr. Code can be available at: <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/WangLanxiao/PDA-for-video-caption</uri> .
Toward Greater Integration: Fellows Perspectives on Cognitive Science

Cognitive science is a multidisciplinary field. Whereas debates on whether this is beneficial continue to spring up, this multidisciplinarity comes with at least one obvious challenge, namely, safeguarding an increasing integration across its subfields. The new and open-ended topic preluded here attempts to address this challenge by pursuing a multilayered agenda: to introduce the Fellows of the Cognitive Science Society and earn them the recognition and profile they deserve; to furnish a platform for reflection on cognitive science from a bird's eye view; and to present role models for younger generations. To achieve these goals, this topic provides all Fellows with an opportunity to showcase their scientific work, to outline what they consider to be its major contributions to cognitive science, and to elaborate on their visions for greater integration of the field.
Cost-Efficient and Quality-of-Experience-Aware Player Request Scheduling and Rendering Server Allocation for Edge-Computing-Assisted Multiplayer Cloud Gaming

Prompted by the remarkable progress in both cloud computing and GPU virtualization, cloud gaming has been attracting more and more attention in the gaming industry. With the cloud gaming model, players do not need to download or install the game on local devices, and constantly upgrade their devices. Despite these advantages, cloud gaming faces several challenges for its success, including long response delay, poor game fairness, and high operational cost. To this end, this article proposes an edge computing-assisted multiplayer cloud gaming system named ECACG to improve multiplayer cloud gaming experiences and operating costs by offloading the game rendering task to the nearby edge server. Based on the ECACG, two decision processes are completed. One is player request scheduling and the other is rendering server allocation. The decision problem is formulated into a constrained multiobjective optimization model. A novel hybrid algorithm based on deep reinforcement learning and heuristic strategy is developed to solve the optimization problem. The effectiveness of the proposed ECACG is evaluated by simulation experiments based on the real-world parameters. The simulation results show that compared with the existing schemes, the proposed ECACG can achieve lower rental costs and better fairness, while providing the good-enough response delay for players.