Reviewerly/exHarmony huggingface dataset:
News recommendations based on collaborative topic modeling and collaborative filtering with generative adversarial networks

Purpose Online news websites provide huge amounts of timely news, bringing the challenge of recommending personalized news articles. Generative adversarial networks (GAN) based on collaborative filtering (CFGAN) can achieve effective recommendation quality. However, CFGAN ignores item contents, which contain more latent preference features than just user ratings. It is important to consider both ratings and item contents in making preference predictions. This study aims to improve news recommendation by proposing a GAN-based news recommendation model considering both ratings (implicit feedback) and the latent features of news content. Design/methodology/approach The collaborative topic modeling (CTM) can improve user preference prediction by combining matrix factorization (MF) with latent topics of item content derived from latent topic modeling. This study proposes a novel hybrid news recommendation model, Hybrid-CFGAN, which modifies the architecture of the CFGAN model with enhanced preference learning from the CTM. The proposed Hybrid-CFGAN model contains parallel neural networks – original rating-based preference learning and CTM-based preference learning, which consider both ratings and news content with user preferences derived from the CTM model. A tunable parameter is used to adjust the weights of the two preference learnings, while concatenating the preference outputs of the two parallel neural networks. Findings This study uses the dataset collected from an online news website, NiusNews, to conduct an experimental evaluation. The results show that the proposed Hybrid-CFGAN model can achieve better performance than the state-of-the-art GAN-based recommendation methods. The proposed novel Hybrid-CFGAN model can enhance existing GAN-based recommendation and increase the performance of preference predictions on textual content such as news articles. Originality/value As the existing CFGAN model does not consider content information and solely relies on history logs, it may not be effective in recommending news articles. Our proposed Hybrid-CFGAN model modified the architecture of the CFGAN generator by adding a parallel neural network to gain the relevant information from news content and user preferences derived from the CTM model. The novel idea of adjusting the preference learning from two parallel neural networks – original rating-based preference learning and CTM-based preference learning – contributes to improve the recommendation quality of the proposed model by considering both ratings and latent preferences derived from item contents. The proposed novel recommendation model can improve news recommendation, thereby increasing the commercial value of news media platforms.
Veracious Interpolated Measure of Angle and Length for Underwater Motion Blurred Images

The quality of the underwater image is impairing with the atmospheric conditions. In this, one of the most significant issues in recent days is due to the motion blur induced by the imaging device or by the movement of the object in underwater image quality degradation. The various parameters of the blurred image must be identified to fix the effect of blurring in post-imaging. Therefore, spectrum-based parameter estimation method is proposed. Initially, to estimate the point spread function (PSF), the angle and the length is measured from image spectrum using radon transform. Then, for the accurate estimation of PSF, Optimized Polynomial Lagrange Interpolation (OPLI) is proposed. The data were collected and analyzed in various natural and structured water bodies in Chennai without affecting the real environment. It is observed that for the underwater images collected, the proposed OPLI approach outperforms compared to few existing traditional estimation methods like cepstral, hough, and radon. Then this veracious interpolated measure of angle and length (VIMAL) is restored using modified Lucy algorithm and is evaluated which results in high performance than the existing classical state-of-the-art methods.
Design of vehicle positioning system based on artificial intelligence cloud computing technology

Abstract With the continuous progress of society, people's living consumption needs are also constantly changing. The traditional vehicle positioning technology can no longer meet the new positioning needs of travelers, so a more accurate positioning system is urgently needed. This paper aims to study a more accurate positioning system and proposes a vehicle positioning system based on radio frequency identification (RFID). After comparing several common positioning methods, the use of LANDMARC positioning algorithm makes the vehicle positioning more accurate. This paper has effectively integrated advanced computer and artificial intelligence technology and applies it to control and management and finally established a comprehensive traffic positioning system that can effectively alleviate traffic congestion, reduce traffic accidents and quickly deal with traffic emergencies. The experimental results have shown that when the vehicle runs at a speed of 40 km/h and the communication rate is 860 kpbs, the average positioning accuracy of the improved algorithm is doubled compared with the traditional algorithm, and the error is reduced by nearly one. Therefore, compared with the traditional positioning system and artificial intelligence, the RFID vehicle positioning system under cloud computing has more accurate positioning information and more timely and convenient services.
Cyber Incivility

Cyber incivility has a detrimental effect on individuals as well as on the organization. In line with the COR theory, the research projected a mediation model in which stress would mediate the association between cyber incivility and job satisfaction. The study focused on IT professionals from the software engineering domain, which includes technical engineers and engineering managers. The outcome specified job stress as a mediator between cyber incivility and job satisfaction. To enhance satisfaction and reduce job stress, managers need to build an incivility-free environment. The sender should be cautious with the tone of the messages. Since an individual on the receiving side generally does not report incivility done by superiors, HR managers should encourage employees to provide feedback to their immediate boss. The implications would help the IT industry in reducing stress and job dissatisfaction and contribute to the limited body of research.
Unbiased feature position alignment for human pose estimation

Multi-scale feature fusion is a commonly-used module in existing deep-learning models, and feature misalignment occurs in the process of feature fusion. The spatial misalignment hinders the learning of semantic representation with multi-scale levels, but which has not received much attention. This misalignment problem is caused by the feature position shift after using the convolution and interpolation operation in feature fusion. To solve the misalignment problem, this paper formulates the shift error mathematically and proposes a plug-and-play unbiased feature position alignment strategy to align convolution with interpolation. As a model-agnostic approach, unbiased feature position alignment can boost the performance of different models without introducing extra parameters. Furthermore, the unbiased feature position alignment is applied to build an unbiased human pose estimation method. Experimental results have demonstrated the effectiveness of the proposed unbiased pose model in comparison to the state-of-the-arts, especially in the low-resolution field. The codes are shared at https://github.com/WangChen100/Unbiased-Feature-Position-Alignment-for-Human-Pose-Estimation.
Pixel-Coordinate-Induced Human Pose High-Precision Estimation Method

Accurately estimating human pose is crucial for providing feedback during exercises or musical performances, but the complex and flexible nature of human joints makes it challenging. Additionally, traditional methods often neglect pixel coordinates, which are naturally present in high-resolution images of the human body. To address this issue, we propose a novel human pose estimation method that directly incorporates pixel coordinates. Our method adds a coordinate channel to the convolution process and embeds pixel coordinates into the feature map, while also using coordinate attention to capture position- and structure-sensitive features. We further reduce the network parameters and computational cost by using small-scale convolution kernels and a smooth activation function in residual blocks. We evaluate our model on the MPII Human Pose and COCO Keypoint Detection datasets and demonstrate improved accuracy, highlighting the importance of directly incorporating coordinate location information in position-sensitive tasks.
Local Cluster-Aware Attention for Non-Euclidean Structure Data

Meaningful representation of large-scale non-Euclidean structured data, especially in complex domains like network security and IoT system, is one of the critical problems of contemporary machine learning and deep learning. Many successful cases of graph-based models and algorithms deal with non-Euclidean structured data. However, It is often undesirable to derive node representations by walking through the complete topology of a system or network (graph) when it has a very big or complicated structure. An important issue is using neighborhood knowledge to deduce the symmetric network’s topology or graph. The traditional approach to solving the graph representation learning issue is surveyed from machine learning and deep learning perspectives. Second, include local neighborhood data encoded to the attention mechanism to define node solidarity and enhance node capture and interactions. The performance of the proposed model is then assessed for transduction and induction tasks that include downstream node categorization. The attention model taking clustering into account has successfully equaled or reached the state-of-the-art performance of several well-established node classification benchmarks and does not depend on previous knowledge of the complete network structure, according to experiments. Following a summary of the research, we discuss problems and difficulties that must be addressed for developing future graph signal processing algorithms and graph deep learning models, such as graph embeddings’ interpretability and adversarial resilience. At the same time, it has a very positive impact on network security and artificial intelligence security.
PMSSC: Parallelizable multi-subset based self-expressive model for subspace clustering

Abstract Subspace clustering methods which embrace a self-expressive model that represents each data point as a linear combination of other data points in the dataset provide powerful unsupervised learning techniques. However, when dealing with large datasets, representation of each data point by referring to all data points via a dictionary suffers from high computational complexity. To alleviate this issue, we introduce a parallelizable multi-subset based self-expressive model (PMS) which represents each data point by combining multiple subsets, with each consisting of only a small proportion of the samples. The adoption of PMS in subspace clustering (PMSSC) leads to computational advantages because the optimization problems decomposed over each subset are small, and can be solved efficiently in parallel. Furthermore, PMSSC is able to combine multiple self-expressive coefficient vectors obtained from subsets, which contributes to an improvement in self-expressiveness. Extensive experiments on synthetic and real-world datasets show the efficiency and effectiveness of our approach in comparison to other methods.
A lightweight backdoor defense framework based on image inpainting

Deep neural networks (DNNs) have been shown to be vulnerable to backdoor attacks during training. Most of the existing backdoor defense methods are designed for specific types of backdoor attacks, and the work of detecting backdoors and mitigating backdoors is mostly separate. Currently, few general and complete defense frameworks have been developed. In this paper, we propose a lightweight, general, and complete defense framework against three main types of backdoor attacks. It can efficiently detect poisoned images and remove trigger patterns on poisoned images without costly retraining of the backdoor model. First, we use the feature difference between clean samples and poisoned samples in the middle layer of the model to distinguish them. Then, we remove the backdoor using image inpainting algorithm to remove the backdoor triggering pattern on the poisoned samples. We deploy three of the most popular backdoor attacks on three datasets to test the effectiveness of our defenses. Extensive experimental results show that our method can effectively defend against various backdoor attacks with a relatively small cost. In particular, we reduce the attack success rate of the more stealthy clean-label poisoning attack from 94.9% to 0.02% with little impact on the classification accuracy of the inpainted images.
A selection-pattern-aware recommendation model with colored-motif attention network

Heterogeneous information networks (HIN) based models are now widely used to fuse auxiliary information for personalized recommendation. However, existing works mainly focus on capturing high-order connections between heterogeneous nodes through predefined pattern (such as meta-path, etc.), which depends on relevant domain knowledge and ignores the statistical characteristics of the substructures in HIN. How to capture meaningful personalized behavior patterns, especially the selection patterns (i.e. how a user select an item), and incorporate them into the preference model is still a challenge in the research of HIN-based recommendation. Therefore, in this paper, a specifically-designed Colored-Motif Attention Network (CMoAN) is proposed to deal with this problem. In the proposed CMoAN, colored motif are used as the elemental building blocks to represent context-based selection patterns, and then by constructing a motif-based adjacency matrix to capture higher-order semantic association between nodes in HIN. Besides, an attentive graph neural network is designed to efficiently model the semantics and high-order relations information. Extensive experiments on three real-world datasets demonstrate that CMoAN consistently outperforms state-of-the-art methods. Furthermore, experimental results also verify the effectiveness of using colored motif for capturing users’selection patterns.
Time Series Data Preparation for Failure Prediction in Smart Water Taps (SWT)

Smart water tap (SWT) time series model development for failure prediction requires acquiring data on the variables of interest to researchers, planners, engineers and decision makers. Thus, the data are expected to be ‘noiseless’ (i.e., without discrepancies such as missing data, data redundancy and data duplication) raw inputs for modelling and forecasting tasks. However, historical datasets acquired from the SWTs contain data discrepancies that require preparation before applying the dataset to develop a failure prediction model. This paper presents a combination of the generative adversarial network (GAN) and the bidirectional gated recurrent unit (BiGRU) techniques for missing data imputation. The GAN aids in training the SWT data trend and distribution, enabling the imputed data to be closely similar to the historical dataset. On the other hand, the BiGRU was adopted to save computational time by combining the model’s cell state and hidden state during data imputation. After data imputation there were outliers, and the exponential smoothing method was used to balance the data. The result shows that this method can be applied in time series systems to correct missing values in a dataset, thereby mitigating data noise that can lead to a biased failure prediction model. Furthermore, when evaluated using different sets of historical SWT data, the method proved reliable for missing data imputation and achieved better training time than the traditional data imputation method.
A More General Quantum Credit Risk Analysis Framework

Credit risk analysis (CRA) quantum algorithms aim at providing a quadratic speedup over classical analogous methods. Despite this, experts in the business domain have identified significant limitations in the existing approaches. Thus, we proposed a new variant of the CRA quantum algorithm to address these limitations. In particular, we improved the risk model for each asset in a portfolio by enabling it to consider multiple systemic risk factors, resulting in a more realistic and complex model for each asset's default probability. Additionally, we increased the flexibility of the loss-given-default input by removing the constraint of using only integer values, enabling the use of real data from the financial sector to establish fair benchmarking protocols. Furthermore, all proposed enhancements were tested both through classical simulation of quantum hardware and, for this new version of our work, also using QPUs from IBM Quantum Experience in order to provide a baseline for future research. Our proposed variant of the CRA quantum algorithm addresses the significant limitations of the current approach and highlights an increased cost in terms of circuit depth and width. In addition, it provides a path to a substantially more realistic software solution. Indeed, as quantum technology progresses, the proposed improvements will enable meaningful scales and useful results for the financial sector.
A Self-Supervised Tree-Structured Framework for Fine-Grained Classification

In computer vision, fine-grained classification has become an important issue in recognizing objects with slight visual differences. Usually, it is challenging to generate good performance when solving fine-grained classification problems using traditional convolutional neural networks. To improve the accuracy and training time of convolutional neural networks in solving fine-grained classification problems, this paper proposes a tree-structured framework by eliminating the effect of differences between clusters. The contributions of the proposed method include the following three aspects: (1) a self-supervised method that automatically creates a classification tree, eliminating the need for manual labeling; (2) a machine-learning matcher which determines the cluster to which an item belongs, minimizing the impact of inter-cluster variations on classification; and (3) a pruning criterion which filters the tree-structured classifier, retaining only the models with superior classification performance. The experimental evaluation of the proposed tree-structured framework demonstrates its effectiveness in reducing training time and improving the accuracy of fine-grained classification across various datasets in comparison with conventional convolutional neural network models. Specifically, for the CUB 200 2011, FGVC aircraft, and Stanford car datasets, the proposed method achieves a reduction in training time of 32.91%, 35.87%, and 14.48%, and improves the accuracy of fine-grained classification by 1.17%, 2.01%, and 0.59%, respectively.
Biconvex Clustering

Convex clustering has recently garnered increasing interest due to its attractive theoretical and computational properties, but its merits become limited in the face of high-dimensional data. In such settings, pairwise affinity terms that rely on k-nearest neighbors become poorly specified and Euclidean measures of fit provide weaker discriminating power. To surmount these issues, we propose to modify the convex clustering objective so that feature weights are optimized jointly with the centroids. The resulting problem becomes biconvex, and as such remains well-behaved statistically and algorithmically. In particular, we derive a fast algorithm with closed form updates and convergence guarantees, and establish finite-sample bounds on its prediction error. Under interpretable regularity conditions, the error bound analysis implies consistency of the proposed estimator. Biconvex clustering performs feature selection throughout the clustering task: as the learned weights change the effective feature representation, pairwise affinities can be updated adaptively across iterations rather than precomputed within a dubious feature space. We validate the contributions on real and simulated data, showing that our method effectively addresses the challenges of dimensionality while reducing dependence on carefully tuned heuristics typical of existing approaches. Supplementary materials for this article are available online.
Using Group Work for Improving the First Year Non-English Major Students Speaking Skill at Dong Nai Technology University

This article aims to offer solutions to improve speaking skills for English majors at Dong Nai Technology University through the application of group work activities. The main research method of the paper is the survey method. The corpus was collected from 50 first-year non-English major students at Dong Nai Technology University. Research results show that group activities have been used quite often in speaking lessons, however, the effectiveness is not high due to a number of influencing factors such as learners' interests, and desires, The teacher's strategies have not met the students' expectations. Since then, the article proposes some solutions to improve the learning of speaking skills for non-English major students through group work at Dong Nai University.
Traceability Management of Socio-Cyber-Physical Systems Involving Goal and SysML Models

Socio-cyber-physical systems (SCPSs) have emerged as networked heterogeneous systems that incorporate social components (e.g., business processes and social networks) along with physical (e.g., Internet-of-Things devices) and software components. Model-driven techniques for building SCPSs need actor and goal models to capture social concerns, whereas system issues are often addressed with the Systems Modeling Language (SysML). Comprehensive traceability between these types of models is essential to support consistency and completeness checks, change management, and impact analysis. However, traceability management between these complementary views is not well supported across SysML tools, particularly when models evolve because SysML does not provide sophisticated out-of-the-box goal modeling capabilities. In our previous work, we proposed a model-based framework, called CGS4Adaptation, that supports basic traceability by importing goal and SysML models into a leading third-party requirement-management system, namely IBM Rational DOORS. In this paper, we present the framework’s traceability management method and its use for automated consistency and completeness checks. Traceability management also includes implicit link detection, thereby, improving the quality of traceability links while better aligning designs with requirements. The method is evaluated using an adaptive SCPS case study involving an IoT-based smart home. The results suggest that the tool-supported method is effective and useful in supporting the traceability management process involving complex goal and SysML models in one environment while saving development time and effort.