Reviewerly/exHarmony huggingface dataset:
Digital Information Transparency for Cyber Security: Critical Points in Social Media Trends

In the last decade, the initiative to arrange information in organizational stage has been emerged through the cyberspace. The issue like untrusted or questionable side is undeniable among the current situation. Attempts to expand the excessive engagement to take a trusted orientation for digital information were made in enabling to build the innovative circumstance of social interaction in a new normal life. The requirement to have an experience in digital age should come up with considering the way to utilize the advancement of technology in a proper way. This paper aims to examine the extent of trusted information to enable the individual to have the right information in order to ensure the clarified source with a critical inquiry. Literature analysis was conducted using keywords of information transparency, digital interaction and cyber security from peer-reviewed journals and books. The finding reveals that the strategic approach to achieve the digital information transparency for cyber security is proposed into three phases. Those include building digital information ethics management for safe cyberspace; enhancing digital ethics for virtual communication skills; and expanding digital ethics in information quality for safe cyber space. This paper is supposed to give a critical insight into managing the digital information amongst the users in driving their pathway to ensure the cyber security along with the online activities.
Automating governance: Blockchain delivered governance for business networks

This conceptual article seeks to integrate blockchain into current theory on the governance of inter-organizational exchanges within business networks. It posits that a blockchain governance structure comprised of administrative, platform, and application level mechanisms represents a significant new antecedent and causal factor determining the extent of the need for the traditional contractual and relational mechanisms of governance. Further, that blockchain delivered governance can perform the functions of transaction coordination and safeguarding which are required in order to substitute for those traditional mechanisms of governance. A discussion points the way towards empirical verification of the framework created, and towards avenues for further theoretical research, and examines the implications of blockchain delivered governance for practitioners. In developing this framework, this article also seeks to make a contribution by placing attention on the need for the building of theory applying to blockchain, and for quantitative measurement of the effects of blockchain on organizations and business networks. This article concludes that the emergence of blockchain technology now provides the means by which automation of the specification, validation, and enforcement of private ordering between exchange participants can be achieved, and that this should stimulate a reevaluation of existing theories of inter-organizational governance.
JigsawGAN: Auxiliary Learning for Solving Jigsaw Puzzles With Generative Adversarial Networks

The paper proposes a solution based on Generative Adversarial Network (GAN) for solving jigsaw puzzles. The problem assumes that an image is divided into equal square pieces, and asks to recover the image according to information provided by the pieces. Conventional jigsaw puzzle solvers often determine the relationships based on the boundaries of pieces, which ignore the important semantic information. In this paper, we propose JigsawGAN, a GAN-based auxiliary learning method for solving jigsaw puzzles with unpaired images (with no prior knowledge of the initial images). We design a multi-task pipeline that includes, (1) a classification branch to classify jigsaw permutations, and (2) a GAN branch to recover features to images in correct orders. The classification branch is constrained by the pseudo-labels generated according to the shuffled pieces. The GAN branch concentrates on the image semantic information, where the generator produces the natural images to fool the discriminator, while the discriminator distinguishes whether a given image belongs to the synthesized or the real target domain. These two branches are connected by a flow-based warp module that is applied to warp features to correct the order according to the classification results. The proposed method can solve jigsaw puzzles more efficiently by utilizing both semantic information and boundary information simultaneously. Qualitative and quantitative comparisons against several representative jigsaw puzzle solvers demonstrate the superiority of our method.
Consortium Blockchain-Based Computation Offloading Using Mobile Edge Platoon Cloud in Internet of Vehicles

The rapid advancement of intelligent vehicles is deemed crucial to the emergence of diverse compute-intensive applications of assisted driving, which consist of automatic driving, speed recognition, hybrid sensing data fusion, etc. Nevertheless, resources-constraint vehicles with high mobility cannot always meet the computing and communication demands when the above applications occur. Additionally, considering the expensive and inflexible deployment of edge servers, offloading application tasks to “Edge” in the vehicular networks is not always working well. To effectively mitigate the above issues, the complicated application tasks are motivated to offload to the vehicle platoon, where the vehicles travel synchronously in a string with small headway. Benefiting from the stable connectivity, adjustable mobility, and reasonable charge, the task vehicle would like to process the task by leveraging the idle resources of each platoon member (PM). To make more effective use of the resources on the mobile edge platoon cloud (MEPC), we investigate the resource allocation strategy based on the task vehicle’s service pricing strategy in this work. We first formulate the interactions between MEPC and task vehicle as a Stackelberg game to study the joint utility maximization of the MEPC and task vehicle. Then the Stackelberg Equilibrium (SE) for the proposed game is characterized and proved. The proposed algorithm Hook-Jeeves-based Stackelberg game (HJSG) can reach the SE. Finally, we introduce the consortium blockchain to ensure the security and privacy of service transactions. The entire system helps enhance task processing efficiency, protect transaction data, and improve service experience. Experimental results over numerical simulation based on practical scenarios demonstrate that compared with Multi-round Stackelberg Game (MRSG), uniform pricing, and the local computation strategy, the proposed HJSG algorithm can attain less execution time and faster convergence performance.
A Feature-Enriched Deep Convolutional Neural Network for JPEG Image Compression Artifacts Reduction and its Applications

The amount of multimedia data, such as images and videos, has been increasing rapidly with the development of various imaging devices and the Internet, bringing more stress and challenges to information storage and transmission. The redundancy in images can be reduced to decrease data size via lossy compression, such as the most widely used standard Joint Photographic Experts Group (JPEG). However, the decompressed images generally suffer from various artifacts (e.g., blocking, banding, ringing, and blurring) due to the loss of information, especially at high compression ratios. This article presents a feature-enriched deep convolutional neural network for compression artifacts reduction (FeCarNet, for short). Taking the dense network as the backbone, FeCarNet enriches features to gain valuable information via introducing multi-scale dilated convolutions, along with the efficient 1 ×1 convolution for lowering both parameter complexity and computation cost. Meanwhile, to make full use of different levels of features in FeCarNet, a fusion block that consists of attention-based channel recalibration and dimension reduction is developed for local and global feature fusion. Furthermore, short and long residual connections both in the feature and pixel domains are combined to build a multi-level residual structure, thereby benefiting the network training and performance. In addition, aiming at reducing computation complexity further, pixel-shuffle-based image downsampling and upsampling layers are, respectively, arranged at the head and tail of the FeCarNet, which also enlarges the receptive field of the whole network. Experimental results show the superiority of FeCarNet over state-of-the-art compression artifacts reduction approaches in terms of both restoration capacity and model complexity. The applications of FeCarNet on several computer vision tasks, including image deblurring, edge detection, image segmentation, and object detection, demonstrate the effectiveness of FeCarNet further.
A novel Sequence-Aware personalized recommendation system based on multidimensional information

Due to the rapid growth of the information overload issue, recommender systems have become necessary and are implemented in numerous facets of human life, including the tourism industry. Today, technological advancements have significantly altered our travels, and these advancements promise even more interactive and exciting experiences in the future. Nowadays, planning and arranging a customized trip well in advance is ideal, as the process can be challenging and time-consuming. This paper proposes a hybrid approach that leverages multidimensional data to enhance personalized trip recommendations while addressing several shortcomings of existing recommender systems, such as their inability to account for dynamic user preferences and diverse contexts. To this end, the proposed method, considering the data sparsity issue, employs a clustering algorithm to reduce the time complexity of discovering Points of Interest (POIs). This approach utilizes user demographic information to address the cold start issue while improving the collaborative filtering (CF) paradigm through an asymmetric schema. Furthermore, this study exploits the context vector model and the Term-Frequency-Inverse-Document-Frequency (TF-IDF) algorithm to present a novel method for quantifying context similarity. Moreover, the method retrieves and ranks a list of candidate routes optimized by applying personalized POIs to sequential travel patterns. Finally, the experimental results demonstrate the superiority of the approach in terms of Precision, Recall, RMSE, MAP, F-Score, and nDCG compared to previous works based on Flickr and STS datasets.
Revisiting Neuron Coverage Metrics and Quality of Deep Neural Networks

Deep neural networks (DNN) have been widely applied in modern life, including critical domains like autonomous driving, making it essential to ensure the reliability and robustness of DNN-powered systems. As an analogy to code coverage metrics for testing conventional software, researchers have proposed neuron coverage metrics and coverage-driven methods to generate DNN test cases. However, Yan et al. doubt the usefulness of existing coverage criteria in DNN testing. They show that a coverage-driven method is less effective than a gradient-based method in terms of both uncovering defects and improving model robustness. In this paper, we conduct a replication study of the work by Yan et al. and extend the experiments for deeper analysis. A larger model and a dataset of higher resolution images are included to examine the generalizability of the results. We also extend the experiments with more test case generation techniques and adjust the process of improving model robustness to be closer to the practical life cycle of DNN development. Our experiment results confirm the conclusion from Yan et al. that coverage-driven methods are less effective than gradient-based methods. Yan et al. find that using gradient-based methods to retrain cannot repair defects uncovered by coverage-driven methods. They attribute this to the fact that the two types of methods use different perturbation strategies: gradient-based methods perform differentiable transformations while coverage-driven methods can perform additional non-differentiable transformations. We test several hypotheses and further show that even coverage-driven methods are constrained only to perform differentiable transformations, the uncovered defects still cannot be repaired by adversarial training with gradient-based methods. Thus, defensive strategies for coverage-driven methods should be further studied.
Context-Sensitive Mental Model Aggregation in a Second-Order Adaptive Network Model for Organisational Learning

Organisational learning processes often exploit developed individual mental models in order to obtain shared mental models for the organisation by some form of unification or aggregation. The focus in this paper is on this aggregation process, which may depend on a number of contextual factors. It is shown how a second-order adaptive network model for organisation learning can be used to model this process of aggregation of individual mental models in a context-dependent manner.
Breast Cancer Classification From Histopathological Images Using Resolution Adaptive Network

A histopathological analysis performed by pathologists plays a key role in the diagnosis of breast cancer. A novel approach based on an image processing technique is proposed to help pathologists efficiently produce accurate diagnoses, that is composed of two modules, namely, anomaly detection with a support vector machine (ADSVM) method and a resolution adaptive network (RANet) model. The ADSVM method screens mislabeled patches to improve the training performance of the RANet model. In the RANet model, subnetworks with variable resolutions and depths are utilized to classify images according to the classification difficulty. This adaptive mechanism potentially increases the computational efficiency and prediction accuracy. The proposed RANet-ADSVM approach is evaluated using two public datasets: the BreaKHis and BACH 2018 datasets. Binary and multiclass classifications of patient and image levels at different magnification factors are conducted on the BreaKHis dataset. The best accuracies of 98.83% and 99.14% are obtained for the binary classification at <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$200\times $ </tex-math></inline-formula> magnification at the patient and image levels, respectively. For the BACH 2018 dataset, binary and multiclass classifications on patch and image levels are performed. Experimental results show that the best accuracies for multiclass and binary classifications at the image level are 97.75% and 99.25%, respectively. Additionally, comparative experiments are performed and indicated that the proposed approach achieves significant improvements in both the classification accuracy and computational efficiency. Compared with similar networks (ResNet and DenseNet), the computational time is reduced by approximately 50%.
A Differentially Private Federated Learning Model against Poisoning Attacks in Edge Computing

Federated learning is increasingly popular, as it allows us to circumvent challenges due to data islands, by training a global model using data from one or more data owners/sources. However, in edge computing, resource-constrained end devices are vulnerable to be compromised and abused to facilitate poisoning attacks. Privacy-preserving is another important property to consider when dealing with sensitive user data on end devices. Most existing approaches only consider either defending against poisoning attacks or supporting privacy, but not both properties simultaneously. In this paper, we propose a differentially private federated learning model against poisoning attacks, designed for edge computing deployment. First, we design a weight-based algorithm to perform anomaly detection on the parameters uploaded by end devices in edge nodes, which improves detection rate using only small-size validation datasets and minimizes the communication cost. Then, differential privacy technology is leveraged to protect the privacy of both data and model in an edge computing setting. We also evaluate and compare the detection performance in the presence of random and customized malicious end devices with the state-of-the-art, in terms of attack resiliency, communication and computation costs. Experimental results demonstrate that our scheme can achieve an optimal tradeoff between security, efficiency and accuracy.
MetaKG: Meta-Learning on Knowledge Graph for Cold-Start Recommendation

A knowledge graph (KG) consists of a set of interconnected typed entities and their attributes. Recently, KGs are popularly used as the auxiliary information to enable more accurate, explainable, and diverse user preference recommendations. Specifically, existing KG-based recommendation methods target modeling high-order relations/dependencies from long connectivity user-item interactions hidden in KG. However, most of them ignore the cold-start problems (i.e., user cold-start and item cold-start) of recommendation analytics, which restricts their performance in scenarios when involving new users or new items. Inspired by the success of meta-learning on scarce training samples, we propose a novel meta-learning based framework called MetaKG, which encompasses a collaborative-aware meta learner and a knowledge-aware meta learner, to capture meta users' preference and entities' knowledge for cold-start recommendations. The collaborative-aware meta learner aims to locally aggregate user preferences for each user preference learning task. In contrast, the knowledge-aware meta learner is to globally generalize knowledge representation across different user preference learning tasks. Guided by two meta learners, MetaKG can effectively capture the high-order collaborative relations and semantic representations, which could be easily adapted to cold-start scenarios. Besides, we devise a novel adaptive task scheduler which can adaptively select the informative tasks for meta learning in order to prevent the model from being corrupted by noisy tasks. Extensive experiments on various cold-start scenarios using three real data sets demonstrate that our presented MetaKG outperforms all the existing state-of-the-art competitors in terms of effectiveness, efficiency, and scalability.
SPARQ-SGD: Event-Triggered and Compressed Communication in Decentralized Optimization

In this article, we propose and analyze SParsified Action Regulated Quantized–Stochastic Gradient Descent (SPARQ-SGD), a communication-efficient algorithm for decentralized training of large-scale machine learning models over a graph with <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> nodes, where communication efficiency is achieved using <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">compressed</i> exchange of local model parameters among neighboring nodes, which is <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">triggered</i> only when an <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">event</i> (a locally computable condition) is satisfied. Specifically, in SPARQ-SGD, each node takes a fixed number of local gradient steps and then checks if the model parameters have significantly changed compared to its last update; only when the change is beyond a certain threshold (specified by a design criterion), it compresses its local model parameters using both quantization and sparsification and communicates them to its neighbors. We prove that SPARQ-SGD converges as <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$O(\frac{1}{nT})$</tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$O(\frac{1}{\sqrt{nT}})$</tex-math></inline-formula> in the strongly convex and nonconvex settings, respectively, matching the convergence rates of plain decentralized SGD. This demonstrates that we get communication efficiency achieved by aggressive compression, local iterations, and event-triggered communication essentially for <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">free</i> . We evaluate SPARQ-SGD over real datasets to demonstrate significant amount of savings in communication over the state-of-the-art while achieving similar performance.
Defining user spectra to classify Ethereum users based on their behavior

Abstract Purpose In this paper, we define the concept of user spectrum and adopt it to classify Ethereum users based on their behavior. Design/methodology/approach Given a time period, our approach associates each user with a spectrum showing the trend of some behavioral features obtained from a social network-based representation of Ethereum. Each class of users has its own spectrum, obtained by averaging the spectra of its users. In order to evaluate the similarity between the spectrum of a class and the one of a user, we propose a tailored similarity measure obtained by adapting to this context some general measures provided in the past. Finally, we test our approach on a dataset of Ethereum transactions. Findings We define a social network-based model to represent Ethereum. We also define a spectrum for a user and a class of users (i.e., token contract, exchange, bancor and uniswap), consisting of suitable multivariate time series. Furthermore, we propose an approach to classify new users. The core of this approach is a metric capable of measuring the similarity degree between the spectrum of a user and the one of a class of users. This metric is obtained by adapting the Eros distance (i.e., Extended Frobenius Norm) to this scenario. Originality/value This paper introduces the concept of spectrum of a user and a class of users, which is new for blockchains. Differently from past models, which represented user behavior by means of univariate time series, the user spectrum here proposed exploits multivariate time series. Moreover, this paper shows that the original Eros distance does not return satisfactory results when applied to user and class spectra, and proposes a modified version of it, tailored to the reference scenario, which reaches a very high accuracy. Finally, it adopts spectra and the modified Eros distance to classify Ethereum users based on their past behavior. Currently, no multi-class automatic classification approach tailored to Ethereum exists yet, albeit some single-class ones have been recently proposed. Therefore, the only way to classify users in Ethereum are online services (e.g., Etherscan), where users are classified after a request from them. However, the fraction of users thus classified is low. To address this issue, we present an automatic approach for a multi-class classification of Ethereum users based on their past behavior.