Reviewerly/exHarmony huggingface dataset:
A deep learning-based and adaptive region proposal algorithm for semantic segmentation

Authors:
raw_author_name: Maryam Taghizadeh
raw_affiliation_string: Department of Computer Engineering and Information Technology, Razi University, Kermanshah, Iran
raw_author_name: Abdolah Chalechale
raw_affiliation_string: Department of Computer Engineering and Information Technology, Razi University, Kermanshah, Iran

Abstract: This paper presents an adaptive and new region proposal algorithm for generating high-quality regions. The main aim of this algorithm is to investigate different features in the proposal generation process. This algorithm is based on bottom-up image segmentation and deep learning techniques. Each primary region is represented by features derived from a convolutional neural network (CNN). The adjacent and similar regions are merged based on a new proposed searching algorithm and a distance function in a hierarchical way. Additionally, various hand-crafted texture features are examined for representing each region. These texture features are not being utilized previously in region proposal generation. This method also applied both texture-based and deep learning-based features, contemporaneously. Furthermore, the proposed region proposal algorithm was evaluated on two significant challenging datasets, including VOC2012 and COCO2017. The resulting proposals show more high-quality regions in high overlaps in comparison to previous region proposal algorithms. More importantly, the results verified that the deep learning-based features together with handcrafted texture features are complement and this fusion can overcome the shortcoming of other approaches. Additionally, the proposed region proposal algorithm is employed in weakly supervised semantic segmentation. The new generated proposals are used to create some new labeled masks. These masks are very useful and effective in the training phase of deep learning. This approach is evaluated on VOC2012 and compared with previous region-based and free region-based methods. The results shows the efficacy of the proposed method.
SecureNet: Proactive intellectual property protection and model security defense for DNNs based on backdoor learning

Authors:
raw_author_name: Peihao Li
raw_affiliation_string: Southeast University, Nanjing, 211189, Jiangsu, China
raw_author_name: Jie Huang
raw_affiliation_string: Purple Mountain Laboratories, Nanjing, 210096, Jiangsu, China; Southeast University, Nanjing, 211189, Jiangsu, China
raw_author_name: Huaqing Wu
raw_affiliation_string: University of Calgary, Calgary, T2N 1N4, Alberta, Canada
raw_author_name: Zeping Zhang
raw_affiliation_string: Southeast University, Nanjing, 211189, Jiangsu, China
raw_author_name: Chunyang Qi
raw_affiliation_string: Southeast University, Nanjing, 211189, Jiangsu, China

Abstract: With the widespread application of deep neural networks (DNNs), the risk of privacy breaches against DNN models is constantly on the rise, resulting in an increasing need for intellectual property (IP) protection for such models. Although neural network watermarking techniques are widely used to safeguard the IP of DNNs, they can only achieve passive protection and cannot actively prevent unauthorized users from illicit use or embezzlement of the trained DNN models. Therefore, the development of proactive protection techniques to prevent IP infringement is imperative. To this end, we propose SecureNet, a key-based access license framework for DNN models. The proposed approach involves injecting license keys into the model through backdoor learning, enabling correct model functionality only when the appropriate license key is included in the input. To ensure the reusability of DNN models, we also propose a license key replacement algorithm. In addition, based on SecureNet, we designed defense mechanisms against adversarial attacks and backdoor attacks, respectively. Furthermore, we introduce a fine-grained authorization method that enables flexible granting of model permissions to different users. We have designed four license-key schemes with different privileges, tailored to various scenarios. We evaluated SecureNet on five benchmark datasets including MNIST, Cifar10, Cifar100, FaceScrub, and CelebA, and assessed its performance on six classic DNN models: LeNet-5, VGG16, ResNet18, ResNet101, NFNet-F5, and MobileNetV3. The results demonstrate that our approach outperforms the state-of-the-art model parameter encryption methods by at least 95% in terms of computational efficiency. Additionally, it provides effective defense against adversarial attacks and backdoor attacks without compromising the model’s overall performance.
Tri-stage offline Telugu character recognition system based on fusion of HOG and ULBP

Authors:
raw_author_name: Chandrakala Mukku
raw_affiliation_string: Department of ECE, Anurag University, Hyderabad, Telangana, India; Department of ECE, MGIT, Hyderabad, India
raw_author_name: Miriala Santhosh
raw_affiliation_string: Department of ECE, Anurag University, Hyderabad, Telangana, India

Abstract: The domain of pattern recognition has experienced a notable upsurge in the prevalence of handwritten character recognition, which is a research area that has been widely recognized for decades.However, this task presents significant challenges, especially for Indian languages, due to the vast array of character shapes and curved linear structures they possess. Despite some research having been conducted on Indian languages such as Kannada, Hindi, Tamil Devanagari, and Telugu, among others, the field is still in its nascent stages of development. The nascent phase of handwritten Telugu script presents a promising opportunity for further investigation and exploration. We introduce a Tri-stage Telugu handwritten recognition system that utilizes hyper parameters of k- NN, SVM, and Random Forest based on the fusion of HOG and ULBP features. By implementing a Tri-stage classifier in a sequential manner, the system's recognition accuracy is significantly enhanced.The proposed Tri-stage classifier achieves exceptionally high accuracies on Telugu handwritten character HP datasets.
LPSRGAN: Generative adversarial networks for super-resolution of license plate image

Authors:
raw_author_name: Yuecheng Pan
raw_affiliation_string: School of Automation, Central South University, ChangSha, 410083, China
raw_author_name: Jin Tang
raw_affiliation_string: School of Automation, Central South University, ChangSha, 410083, China
raw_author_name: Tardi Tjahjadi
raw_affiliation_string: School of Engineering, University of Warwick, Coventry, CV47AL, UK

Abstract: This paper proposes a super-resolution algorithm for reconstructing license plate images based on generative adversarial networks (GAN) for improving the recognition rate of low-resolution license plate images. To this end, this paper first designs a new image degradation model, called the n-stage random combination degradation model (n-RCD), which extends the traditional degradation model horizontally and vertically to better simulate the features of low-resolution license plate images in natural scenes. Subsequently, to address the problem that existing GAN models cannot adapt to the complex degradation space in natural scenes, this paper proposes a new network structure called LPSRGAN, which optimizes the SRGAN model from the generator and discriminator to improve its super-resolution capability. In addition, this paper also proposes a perceptual optical character recognitioin (OCR) loss for license plate images, which defines the connectionist temporal classification (CTC) loss of the output of the OCR network with character label values to better preserve the character details and features of the license plate images. Finally, the experiments reported in this paper show that the proposed algorithm improves the recognition rate of the original low-resolution license plate image by 12.48%, and the recognition rate of the reconstructed image reaches 93.90%. Based on this, this paper also tests the algorithm on actual captured data, and the results show that it performs well in natural scenes, demonstrating the algorithm has broad application prospects.
IDaPS – Improved data-locality aware data placement strategy based on Markov clustering to enhance MapReduce performance on Hadoop

Authors:
raw_author_name: S. Vengadeswaran
raw_affiliation_string: Department of Computer Science and Engineering, Indian Institute of Information Technology Kottayam, Pala, Kerala, 686635, India
raw_author_name: S.R. Balasundaram
raw_affiliation_string: Department of Computer Applications, National Institute of Technology Tiruchirappalli, Tamil Nadu, 620015, India

Abstract: The execution of Map-Reduce applications on the Hadoop cluster poses significant challenges due to the non-consideration of data locality, i.e., assigning tasks to compute nodes where input data sets are located. Due to such non-consideration, high data transfer overheads are caused. Further, it increases latency, which may arise if input data needs to be transferred across the network, thereby significantly increasing execution time. To address this issue, an Improved DAta Placement Strategy IDaPS based on the intra-dependency among the data is proposed. IDaPS re-organizes the default data layouts in HDFS to ensure higher degree of parallelism. The efficiency of IDaPS is demonstrated in Hadoop clusters (10 and 15 nodes) by executing Hadoop Benchmark performance tests viz. WordCount, Grep on Project-Gutenberg book dataset (50GB) and Least Square Linear Regression (LSLR) on weather dataset (10.67GB). The results were compared with state-of-the-art algorithms viz. Hadoop Default Data Placement (HDDP), Load-Balancer and literary work RENDA. The results demonstrate that IDaPS significantly reduces execution time by 28.2% and 38.4% in 10-node and 15-node clusters while executing WordCount, and 35% and 38.1% in 10-node and 15-node clusters for Grep. Similarly, for LSLR, it reduces execution time by 32.7%.
Quantum Clustering with k-Means: a Hybrid Approach

Authors:
raw_author_name: Alessandro Berti
raw_affiliation_string: Department of Computer Science, University of Pisa, Largo B. Pontecorvo, Pisa, 56127, Italy
raw_author_name: Anna Bernasconi
raw_affiliation_string: Department of Computer Science, University of Pisa, Largo B. Pontecorvo, Pisa, 56127, Italy
raw_author_name: Gianna M. Del Corso
raw_affiliation_string: Department of Computer Science, University of Pisa, Largo B. Pontecorvo, Pisa, 56127, Italy
raw_author_name: Riccardo Guidotti
raw_affiliation_string: Department of Computer Science, University of Pisa, Largo B. Pontecorvo, Pisa, 56127, Italy

Abstract: Quantum computing, based on quantum theory, holds great promise as an advanced computational paradigm for achieving fast computations. Quantum algorithms are expected to surpass their classical counterparts in terms of computational complexity for certain tasks, including machine learning. In this paper, we design, implement, and evaluate three hybrid quantum k-Means algorithms, exploiting different degrees of parallelism. Indeed, each algorithm incrementally leverages quantum parallelism to reduce the complexity of the cluster assignment step up to a constant cost. In particular, we exploit quantum phenomena to speed up the computation of distances. The core idea is that the computation of distances between records and centroids can be executed simultaneously, thus saving time, especially for big datasets. We show that our hybrid quantum k-Means algorithms are theoretically faster than the classical algorithm, while experiments suggest that it is possible to obtain comparable clustering results.
Deep Learning-Based Approaches for Abusive Content Detection and Classification for Multi-class Online User-Generated Data

Authors:
raw_author_name: Simrat Kaur
raw_affiliation_string: University Institute of Engineering and Technology, Panjab University, Chandigarh 160014, India
raw_author_name: Sarbjeet Singh
raw_affiliation_string: University Institute of Engineering and Technology, Panjab University, Chandigarh 160014, India
raw_author_name: Sakshi Kaushal
raw_affiliation_string: University Institute of Engineering and Technology, Panjab University, Chandigarh 160014, India

Abstract: With the rapid growth of social media culture, the use of offensive or hateful language has surged, which necessitates the development of effective abusive language detection models for online platforms. This paper focuses on developing a multi-class classification model to identify different types of offensive language. The input data is taken in the form of labeled tweets and is classified into offensive language detection, offensive language categorization, and offensive language target identification. The data undergoes pre-processing, which removes NaN value and punctuation, as well as performs tokenization followed by the generation of a word cloud to assess data quality. Further, the tf-idf technique is used for the selection of features. In the case of classifiers, multiple deep learning techniques, namely, bidirectional gated recurrent unit, multi-dense long short-term memory, bidirectional long short-term memory, gated recurrent unit, and long short-term memory, are applied where it has been found that all the models, except long short-term memory, achieved a high accuracy of 99.9% for offensive language target identification. Bidirectional LSTM and multi-dense LSTM obtained the lowest loss and RMSE values of 0.01 and 0.1, respectively. This research provides valuable insights and contributes to the development of effective abusive language detection methods to promote a safe and respectful online environment. The insights gained can aid platform administrators in efficiently moderating content and taking appropriate actions against offensive language.
Strictly Frequentist Imprecise Probability

Authors:
raw_author_name: Robert C. Williamson
raw_affiliation_string: Department of Computer Science, University of Tübingen, and Tübingen AI Center, Germany

Abstract: Strict frequentism defines probability as the limiting relative frequency in an infinite sequence. What if the limit does not exist? We present a broader theory, which is applicable also to data that exhibit diverging relative frequencies. In doing so, we develop a close connection with the theory of imprecise probability: the cluster points of relative frequencies yield a coherent upper prevision. We show that a natural frequentist definition of conditional probability recovers the generalized Bayes rule. Finally, we prove constructively that, for a finite set of elementary events, there exists a sequence for which the cluster points of relative frequencies coincide with a prespecified set which demonstrates the naturalness, and arguably completeness, of our theory.
A privacy-preserving key transmission protocol to distribute QRNG keys using zk-SNARKs

Authors:
raw_author_name: Carlos Dafonte
raw_affiliation_string: CITIC, Universidade da Coruña, A Coruña, Spain
raw_author_name: Manuel Fernández-Veiga
raw_affiliation_string: atlanTTic, Universidade de Vigo, Vigo, Spain
raw_author_name: Ana Fernández Vilas
raw_affiliation_string: atlanTTic, Universidade de Vigo, Vigo, Spain
raw_author_name: Francisco J. Nóvoa
raw_affiliation_string: CITIC, Universidade da Coruña, A Coruña, Spain

Abstract: High-entropy random numbers are an essential part of cryptography, and Quantum Random Number Generators (QRNG) are an emergent technology that can provide high-quality keys for cryptographic algorithms but unfortunately are currently difficult to access. Existing Entropy-as-a-Service solutions require users to trust the central authority distributing the key material, which is not desirable in a high-privacy environment. In this paper, we present a novel key transmission protocol that allows users to obtain cryptographic material generated by a QRNG in such a way that the server is unable to identify which user is receiving each key. This is achieved with the inclusion of Zero Knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARK), a cryptographic primitive that allow users to prove knowledge of some value without needing to reveal it. The security analysis of the protocol proves that it satisfies the properties of Anonymity, Unforgeability and Confidentiality, as defined in this document. We also provide an implementation of the protocol demonstrating its functionality and performance, using NFC as the transmission channel for the QRNG key.
Human Face Reconstruction using Divine Proportions and Gestalt for Occluded Video Face Recovery in Forensic Analysis using Deep Learning

Authors:
raw_author_name: None Dr. S. Prema

Abstract: Forensic video analysis has been used in diverse kind of high-profile cases, global discrepancies, and conflict zones. It is a three-phase process of scientific examination, comparison, and evaluation of video in legal matters. Human face reconstruction using deep learning for occluded video face recovery to aid in forensic analysis is the main objective of this paper. Forensic facial reconstruction is a combination of both scientific methods and artistic skill. In this paper, we introduce a method to reconstruct human faces occluded due to short noise innight-time video clips. A skull database is created with unique skull models with varying shapes, forms and proportions. Human body mathematical model biometric using golden ratio algorithm is proposed and used to find the occluded face proportions. Closure principle of gestalt theory of visual perception is used to fill in the missing parts of a face design and to create a whole face image using gan. The proposed model is found to have 50% lesser reduced Median error rate and 20% reduced Stdev than PrNet and 10% lower Mean error rate than 3Dddfav2.
‘What a funny looking video’: Using allegorical representations of technological change to reflect on future digital communication and design challenges

Authors:
raw_author_name: Yaron Meron
raw_affiliation_string: University of Sydney, Australia

Abstract: This paper presents a reflective examination of challenges to design and communication from the current digital revolution, using the prism of a 1980s television advertisement for the Yellow Pages. Originating at the same time as the height of the desktop publishing revolution, the advert illuminates a transitional period in the evolution of digital technology and media communications, marked by changing user practices and experiences. The advert’s storyline follows a young man’s quest to convert an old cine film (of his father) to videotape for his mother’s birthday, in the process showcasing the impending shift from analogue to digital technologies and encapsulating the multifaceted implications and transitional challenges of the period. The hybrid setting of technologies, alongside the tensions, confusion and ambiguities of different stakeholders metaphorically symbolises and can be contrasted alongside, the challenges impacting the design, media and communications industry of the period and can inform reflection on contemporary challenges. Engaging with the narrative, the Yellow Pages advert is used as a creative device which functions as a cultural, historical, narrative lens with which to contrast against contemporary (and future) transitional challenges within the digital revolution.
Graph Convolutional Network with Syntactic Dependency for Aspect-Based Sentiment Analysis

Authors:
raw_author_name: Fan Zhang
raw_author_name: Wenbin Zheng
raw_author_name: Yujie Yang

Abstract: Abstract Aspect-based sentiment analysis (ABSA) aims to mine the sentiment tendencies expressed by specific aspect terms. The studies of ABSA mainly focus on the attention-based approaches and the graph neural network approaches based on dependency trees. However, the attention-based methods usually face difficulties in capturing long-distance syntactic dependencies. Additionally, existing approaches using graph neural networks have not made sufficient exploit the syntactic dependencies among aspects and opinions. In this paper, we propose a novel Syntactic Dependency Graph Convolutional Network (SD-GCN) model for ABSA. We employ the Biaffine Attention to model the sentence syntactic dependencies and build syntactic dependency graphs from aspects and emotional words. This allows our SD-GCN to learn both the semantic relationships of aspects and the overall semantic meaning. According to these graphs, the long-distance syntactic dependency relationships are captured by GCNs, which facilitates SD-GCN to capture the syntactic dependencies between aspects and viewpoints more comprehensively, and consequently yields enhanced aspect features. We conduct extensive experiments on four aspect-level sentiment datasets. The experimental results show that our SD-GCN outperforms other methodologies. Moreover, ablation experiments and visualization of attention further substantiate the effectiveness of SD-GCN.
Potential Applications of Explainable Artificial Intelligence to Actuarial Problems

Authors:
raw_author_name: Catalina Lozano-Murcia
raw_affiliation_string: Department Information Systems and Technologies, University of Castilla La Mancha, Paseo de la Universidad, 4, 13071 Ciudad Real, Spain; Department of Mathematics, Escuela Colombiana de Ingeniería Julio Garavito, Bogotá 111166, Colombia
raw_author_name: Francisco P. Romero
raw_affiliation_string: Department Information Systems and Technologies, University of Castilla La Mancha, Paseo de la Universidad, 4, 13071 Ciudad Real, Spain
raw_author_name: Jesus Serrano-Guerrero
raw_affiliation_string: Department Information Systems and Technologies, University of Castilla La Mancha, Paseo de la Universidad, 4, 13071 Ciudad Real, Spain
raw_author_name: Jose A. Olivas
raw_affiliation_string: Department Information Systems and Technologies, University of Castilla La Mancha, Paseo de la Universidad, 4, 13071 Ciudad Real, Spain

Abstract: Explainable artificial intelligence (XAI) is a group of techniques and evaluations that allows users to understand artificial intelligence knowledge and increase the reliability of the results produced using artificial intelligence. XAI can assist actuaries in achieving better estimations and decisions. This study reviews the current literature to summarize XAI in common actuarial problems. We proposed a research process based on understanding the type of AI used in actuarial practice in the financial industry and insurance pricing and then researched XAI implementation. This study systematically reviews the literature on the need for implementation options and the current use of explanatory artificial intelligence (XAI) techniques for actuarial problems. The study begins with a contextual introduction outlining the use of artificial intelligence techniques and their potential limitations, followed by the definition of the search equations used in the research process, the analysis of the results, and the identification of the main potential fields for exploitation in actuarial problems, as well as pointers for potential future work in this area.