Reviewerly/exHarmony huggingface dataset:
Can Virtual Samples Solve Small Sample Size Problem of KISSME in Pedestrian Re-Identification of Smart Transportation?

This work investigates whether virtual samples can solve the small sample size (S <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> ) problem of Keep-It-Simple-and-Straightforward Metric Learning (KISSME) in Pedestrian re-identification (Re-ID). Re-ID is a very challenging and important problem in the field of multi-camera surveillance in smart transportation. Among many hand-crafted ways (not deeply-learned ones) to solve it, KISSME has received great attention. Although it has achieved convincing performance in some applications, it encounters an S <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> problem in calculating various classes of covariance matrices whose eigenvalues become too small. Such small eigenvalues cause an instability issue when computing the inverse of covariance matrices, thus resulting in poor Re-ID performance. If we can increase the number of samples, then an S <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> problem is alleviated or eliminated. This work makes a hypothesis that virtual samples can do so, and proposes a new algorithm to generate them. It adopts a Genetic Algorithm to generate virtual features (corresponding to virtual samples) based on the dimension-reduced sample features, which eliminates the process of re-extracting features of newly generated virtual samples and save time. It can clearly increase the magnitude of otherwise small eigenvalues, helps one perform the accurate estimation of the inverse of various covariance matrices and finally alleviates the S <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> problem. Experimental results based on a commonly-used database confirm that the proposed method can significantly improve the matching rate of pedestrian Re-ID, which fully shows that virtual samples are indeed effective for alleviating the S <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> problem in pedestrian Re-ID.
An End-to-End Calibration Method for Welding Robot Laser Vision Systems With Deep Reinforcement Learning

Structured light calibration and robot hand-eye calibration are two of the most crucial parts in welding robot laser vision systems. The main aspect of this calibration is accuracy. To reduce the impact of errors in the calibration process and improve the accuracy, an end-to-end calibration method for laser vision systems based on deep reinforcement learning is proposed. The proposed method involves two dual learning tasks: a pixel-to-point module and a point-to-wrist transformation. The pixel-to-point module predicts the locations of the feature points in the welding image, while the point-to-wrist transformation establishes an accurate conversion relationship from the pixel frame to the wrist frame of the robot. Point-to-wrist transformation consists of two major components: “actor” and “critic.” The “actor” model aims to infer the coordinates of the feature points in the wrist frame of the robot. In offline training, the “critic” model is introduced to guide the learning process of the “actor” model by maintaining the geometric consistency between the image coordinate and the robot coordinate. According to experimental results from the welding robot with continuous motion and changing poses, the proposed method significantly reduces the impact of errors in the calibration process and establishes a more accurate conversion relationship.
Augmented reality-assisted rod bending in spinal surgery

In complex deformity cases, surgeons may be confronted with difficulties in shaping and reducing rods into pedicle screw heads, which may result in forceful reduction maneuvers, potential screw loosening or pull-out, and longer surgery time. This study sought to evaluate the benefit of holographic rods as assistive equipment for manual rod bending.
Feature Selection via Mutual Information: New Theoretical Insights

Mutual information has been successfully adopted in filter feature-selection methods to assess both the relevancy of a subset of features in predicting the target variable and the redundancy with respect to other variables. However, existing algorithms are mostly heuristic and do not offer any guarantee on the proposed solution. In this paper, we provide novel theoretical results showing that conditional mutual information naturally arises when bounding the ideal regression/classification errors achieved by different subsets of features. Leveraging on these insights, we propose a novel stopping condition for backward and forward greedy methods which ensures that the ideal prediction error using the selected feature subset remains bounded by a user-specified threshold. We provide numerical simulations to support our theoretical claims and compare to common heuristic methods.
Attention-Based Dual-Scale CNN In-Loop Filter for Versatile Video Coding

As the upcoming video coding standard, Versatile Video Coding (i.e., VVC) achieves up to 30% Bjøntegaard delta bit-rate (BD-rate) reduction compared with High Efficiency Video Coding (H.265/HEVC).To eliminate or alleviate different kinds of compression artifacts like blocking, ringing, blurring and contouring effects, three in-loop filters, i.e. de-blocking filter (DBF), sample adaptive offset (SAO) and adaptive loop filter (ALF), have been involved in VVC.Recently, Convolutional Neural Network (CNN) has attracted tremendous attention and shows great potential in many tasks in image processing.In this work, we design a CNN-based in-loop filter as an integrated single-model solution which is adaptive to almost any scenarios in video coding.An architecture named as ADCNN (i.e., Attention based Dual-scale CNN) with an attention based processing block is proposed to reduce artifacts of I frames and B frames, which take advantage of informative priors such as the quantization parameter (QP) and partitioning information.Different from existing CNN-based filtering methods, which are mainly designed for the luma component and may need to train different models for different QPs, the proposed filter is adapted to different QPs and different frame types, and all the components (i.e., both luma and chroma) are processed simultaneously with feature exchange and fusion between components for information supplementary.Experimental results show that the proposed ADCNN filter can achieve 6.54%, 13.27%, 15.72% BD-rate savings for Y, U, V respectively under the all intra configuration and 2.81%, 7.86%, 8.60% BD-rate savings under the random access configuration.It can be used to replace all the conventional in-loop filters and also outperforms them without increase in encoding time.
Integrating Privacy Enhancing Techniques into Blockchains Using Sidechains

Blockchains are turning into decentralized computing platforms and are getting worldwide recognition for their unique advantages. There is an emerging trend beyond payments that blockchains could enable a new breed of decentralized applications, and serve as the foundation for Internet's security infrastructure. The immutable nature of the blockchain makes it a winner on security and transparency; it is nearly inconceivable for ledgers to be altered in a way not instantly clear to every single user involved. However, most blockchains fall short in privacy aspects, particularly in data protection. Garlic Routing and Onion Routing are two of major Privacy Enhancing Techniques (PETs) which are popular for anonymization and security. Garlic Routing is a methodology using by I2P Anonymous Network to hide the identity of sender and receiver of data packets by bundling multiple messages into a layered encryption structure. The Onion Routing attempts to provide low-latency Internet-based connections that resist traffic analysis, deanonymization attack, eavesdropping, and other attacks both by outsiders (e.g. Internet routers) and insiders (Onion Routing servers themselves). As there are a few controversies over the rate of resistance of these two techniques to privacy attacks, we propose a PET-Enabled Sidechain (PETES) as a new privacy enhancing technique by integrating Garlic Routing and Onion Routing into a Garlic Onion Routing (GOR) framework suitable to the structure of blockchains. The preliminary proposed GOR aims to improve the privacy of transactions in blockchains via PETES structure.
Deep Embedding Learning With Discriminative Sampling Policy

Deep embedding learning aims to learn a distance metric for effective similarity measurement, which has achieved promising performance in various tasks. As the vast majority of training samples produce gradients with magnitudes close to zero, hard example mining is usually employed to improve the effectiveness and efficiency of the training procedure. However, most existing sampling methods are designed by hand, which ignores the dependence between examples and suffer from exhaustive searching. In this paper, we propose a deep embedding with discriminative sampling policy (DE-DSP) learning framework by simultaneously training two models: a deep sampler network that learns effective sampling strategies, and a feature embedding that maps samples to the feature space. Rather than exhaustively calculating the hardness of all the examples for mining through forward-propagation, the deep sampler network exploits the strong prior of relations among samples to learn discriminative sampling policy in an more efficient manner. Experimental results demonstrate faster convergence and stronger discriminative power of our DE-DSP framework under different embedding objectives.
End-to-End Learning of Decision Trees and Forests

Abstract Conventional decision trees have a number of favorable properties, including a small computational footprint, interpretability, and the ability to learn from little training data. However, they lack a key quality that has helped fuel the deep learning revolution: that of being end-to-end trainable. Kontschieder et al. (ICCV, 2015) have addressed this deficit, but at the cost of losing a main attractive trait of decision trees: the fact that each sample is routed along a small subset of tree nodes only. We here present an end-to-end learning scheme for deterministic decision trees and decision forests. Thanks to a new model and expectation–maximization training scheme, the trees are fully probabilistic at train time, but after an annealing process become deterministic at test time. In experiments we explore the effect of annealing visually and quantitatively, and find that our method performs on par or superior to standard learning algorithms for oblique decision trees and forests. We further demonstrate on image datasets that our approach can learn more complex split functions than common oblique ones, and facilitates interpretability through spatial regularization.
ElementRank: Ranking Java Software Classes and Packages using a Multilayer Complex Network-Based Approach

Software comprehension is an important part of software maintenance. To understand a piece of large and complex software, the first problem to be solved is where to start the understanding process. Choosing to start the comprehension process from the important software elements has proven to be a practical way. Research on complex networks opens new opportunities for identifying important elements, and many approaches have been proposed. However, the software networks that existing approaches use neglect the multilayer nature of software systems. That is, nodes in the network can have different types of relationships at the same time, and each type of relationship forms a specific layer. Worse still, they mainly focus on identifying important classes, and little work has been done on quantifying package importance. In this paper, we propose an ElementRank approach to provide a ranked list of classes (or packages) for maintainers to start the comprehension process. The top-ranked classes (or packages) can be seen as the starting points for the software comprehension process at the class (or package) level. First, we introduce two kinds of multilayer software networks to describe the topological structure of software at the class level and package level, respectively. Second, we propose a weighted PageRank algorithm to calculate the weighted PageRank value of classes (or packages) in each layer of the corresponding multilayer software network. Then, we use AHP (Analytic Hierarchy Process) to weigh each layer in the corresponding multilayer software network, and further aggregate the weighted PageRank value to obtain the global weighted PageRank value for each class (or package). Finally, all the classes (or packages) are ranked according to their global weighted PageRank values in a descending order, and the top-ranked classes (or packages) can serve as the starting points for the software comprehension process at the class (or package) level. ElementRank is validated theoretically using the widely accepted Weyuker’s criteria. Theoretical results show that the global weighted PageRank value for classes (or packages) satisfies most of Weyuker’s properties. Furthermore, ElementRank is evaluated empirically using a set of twelve open source software systems. Through a set of experiments, we show the rank correlation between the results of ElementRank and that of the approaches in the related work, and the benefits of ElementRank are also illustrated in comparison with other approaches in the related work. Empirical results also show that ElementRank can be applied to large software systems.
Knowledge-guided Pairwise Reconstruction Network for Weakly Supervised Referring Expression Grounding

Weakly supervised referring expression grounding (REG) aims at localizing the referential entity in an image according to linguistic query, where the mapping between the image region (proposal) and the query is unknown in the training stage. In referring expressions, people usually describe a target entity in terms of its relationship with other contextual entities as well as visual attributes. However, previous weakly supervised REG methods rarely pay attention to the relationship between the entities. In this paper, we propose a knowledge-guided pairwise reconstruction network (KPRN), which models the relationship between the target entity (subject) and contextual entity (object) as well as grounds these two entities. Specifically, we first design a knowledge extraction module to guide the proposal selection of subject and object. The prior knowledge is obtained in a specific form of semantic similarities between each proposal and the subject/object. Second, guided by such knowledge, we design the subject and object attention module to construct the subject-object proposal pairs. The subject attention excludes the unrelated proposals from the candidate proposals. The object attention selects the most suitable proposal as the contextual proposal. Third, we introduce a pairwise attention and an adaptive weighting scheme to learn the correspondence between these proposal pairs and the query. Finally, a pairwise reconstruction module is used to measure the grounding for weakly supervised learning. Extensive experiments on four large-scale datasets show our method outperforms existing state-of-the-art methods by a large margin.
SQL Injection Detection for Web Applications Based on Elastic-Pooling CNN

An enterprise's data can be one of its most important assets and often critical to the firm's development and survival. SQL injection attack is ranked first in the top ten risks to network applications by the Open Web Application Security Project (OWASP). Its harmfulness, universality, and severe situation are self-evident. This paper presents a method of SQL injection detection based on Elastic-Pooling CNN (EP-CNN) and compares it with traditional detection methods. This method can output a fixed two-dimensional matrix without truncating data and effectively detects the SQL injection of web applications. Based on the irregular matching characteristics, it can identify new attacks and is harder to bypass.
Comparing Player Experience in Video Games Played in Virtual Reality or on Desktop Displays

Scientific knowledge of the differences between video games played in virtual reality and on desktop displays in terms of player experience is still limited. Therefore, this study aimed to explore differences in immersion, flow, positive emotions, and psychological needs (i.e., challenge, competence, and tension/annoyance) between a video game played in virtual reality and on a desktop display. Thirty young adults played a racing game in virtual reality (Driveclub VR) and desktop (Driveclub) conditions. The Game Experience Questionnaire was used to assess player experience. The results showed that (a) performance on the game was the same in virtual reality and desktop condition; (b) the video game played in virtual reality was able to elicit more intense positive emotions; (c) the sense of immersion and flow was greater in virtual reality as opposed to the desktop condition; and (d) the fulfillment of psychological needs was independent of the display modality.
EvalNorm: Estimating Batch Normalization Statistics for Evaluation

Batch normalization (BN) has been very effective for deep learning and is widely used. However, when training with small minibatches, models using BN exhibit a significant degradation in performance. In this paper we study this peculiar behavior of BN to gain a better understanding of the problem, and identify a cause. We propose `EvalNorm' to address the issue by estimating corrected normalization statistics to use for BN during evaluation. EvalNorm supports online estimation of the corrected statistics while the model is being trained, and does not affect the training scheme of the model. As a result, EvalNorm can also be used with existing pre-trained models allowing them to benefit from our method. EvalNorm yields large gains for models trained with smaller batches. Our experiments show that EvalNorm performs 6.18% (absolute) better than vanilla BN for a batchsize of 2 on ImageNet validation set and from 1.5 to 7.0 points (absolute) gain on the COCO object detection benchmark across a variety of setups.
Resource Allocation and Consensus on Edge Blockchain in Pervasive Edge Computing Environments

Edge devices with sensing, storage, and communication resources are penetrating our daily lives. These resources make it possible for edge devices to conduct data transactions (e.g., micro-payments, micro-access control). The blockchain technology can be used to ensure transaction unmodifiable and undeniable. In this paper, we propose a blockchain system that adapts to the limitations of edge devices. The new blockchain system can fairly and efficiently allocate storage resources on edge devices, which makes it scalable. We find the optimal peer nodes for transaction data storage in the blockchain, and propose a recent block storage allocation scheme for quick retrieval of missing blocks. The proposed blockchain system can also reach mining consensus with low energy consumption in edge devices with a new Proof of Stake mechanism. Extensive simulations show that our proposed blockchain system works efficiently in edge environments. On average, the new system uses 15% less time and consumes 64% less battery power when compared with traditional blockchain systems.
Partitioning Attacks on Bitcoin: Colliding Space, Time, and Logic

Bitcoin is the leading example of a blockchain application that facilitates peer-to-peer transactions without the need for a trusted intermediary. This paper considers possible attacks related to the decentralized network architecture of Bitcoin. We perform a data driven study of Bitcoin and present possible attacks based on spatial and temporal characteristics of its network. Towards that, we revisit the prior work, dedicated to the study of centralization of Bitcoin nodes over the Internet, through a fine-grained analysis of network distribution, and highlight the increasing centralization of the Bitcoin network over time. As a result, we show that Bitcoin is vulnerable to spatial, temporal, spatio-temporal, and logical partitioning attacks with an increased attack feasibility due to network dynamics. We verify our observations by simulating attack scenarios and the implications of each attack on the Bitcoin . We conclude with suggested countermeasures.
Scoot: A Perceptual Metric for Facial Sketches

While it is trivial for humans to quickly assess the perceptual similarity between two images, the underlying mechanism are thought to be quite complex. Despite this, the most widely adopted perceptual metrics today, such as SSIM and FSIM, are simple, shallow functions, and fail to consider many factors of human perception. Recently, the facial modeling community has observed that the inclusion of both structure and texture has a significant positive benefit for face sketch synthesis (FSS). But how perceptual are these so-called “perceptual features”? Which elements are critical for their success? In this paper, we design a perceptual metric, called Structure Co-Occurrence Texture (Scoot), which simultaneously considers the block-level spatial structure and co-occurrence texture statistics. To test the quality of metrics, we propose three novel meta-measures based on various reliable properties. Extensive experiments verify that our Scoot metric exceeds the performance of prior work. Besides, we built the first largest scale (152k judgments) human-perception-based sketch database that can evaluate how well a metric consistent with human perception. Our results suggest that “spatial structure” and “co-occurrence texture” are two generally applicable perceptual features in face sketch synthesis.
A Framework Proposal for Blockchain-Based Scientific Publishing Using Shared Governance

Scientific research activity is reaching a staggering growth rate, introducing new and compounding existing challenges regarding the quality of peer-review, rise of predatory journals, and larger issues involving academic integrity and fraud stemming from the increased pressure to publish. Blockchain, a distributed ledger technology, is well-suited to address some of the challenges specific to scientific publishing. Companies including ARTiFACTS, Pluto, Orvium, and ScienceMatters-EUREKA, along with academic researchers, are exploring blockchain-based solutions to facilitate research data provenance and workflows, optimize the peer-review process, introduce better incentives, and even create new research journals and platforms utilizing blockchain. Building upon a review of these efforts, we propose a governance framework for scientific publishing based on a consortium blockchain model to create a more efficient means of navigating the publishing process. At the center of this framework is a model that adopts shared governance and validated inclusion via a Democratic Autonomous Organization (DAO). A DAO is an entity wherein the organizational rules are implemented and executed via smart contracts. The DAO will be comprised of participants of validated individuals and organizations who are publishers, editors, peer-reviewers, and citizen scientists to manage and oversee the framework. The framework also maps specifically to the publication workflow of submitting, handling, peer-review, and final editorial decision-making for scientific manuscripts. The goal of this framework is to increase transparency of scientific publishing, create a "pedigree" of a manuscript's research life cycle, and democratize the publication process while maintaining the accepted workflow common to scientific publishing by journals.