Reviewerly/exHarmony huggingface dataset:
NBLex: emotion prediction in Kannada-English code-switch text using naïve bayes lexicon approach

&lt;span lang="EN-US"&gt;Emotion analysis is a process of identifying the human emotions derived from the various data sources. Emotions can be expressed either in monolingual text or code-switch text. Emotion prediction can be performed through machine learning (ML), or deep learning (DL), or lexicon-based approach. ML and DL approaches are computationally expensive and require training data. Whereas, the lexicon-based approach does not require any training data and it takes very less time to predict the emotions in comparison with ML and DL. In this paper, we proposed a lexicon-based method called non-binding lower extremity exoskeleton (NBLex) to predict the emotions associated with Kannada-English code-switch text that no one has addressed till now. We applied the One-vs-Rest approach to generate the scores for lexicon and also to predict the emotions from the code-switch text. The accuracy of the proposed model NBLex (87.9%) is better than naïve bayes (NB) (85.8%) and bidirectional long short-term memory neural network (BiLSTM) (84.7%) and for true positive rate (TPR), the NBLex (50.6%) is better than NB (37.0%) and BiLSTM (42.2%). From our approach, it is observed that a simple additive model (lexicon approach) can also be an alternative model to predict the emotions in code-switch text.&lt;/span&gt;
Attention correlated appearance and motion feature followed temporal learning for activity recognition

&lt;span lang="EN-US"&gt;Recent advances in deep neural networks have been successfully demonstrated with fairly good accuracy for multi-class activity identification. However, existing methods have limitations in achieving complex spatial-temporal dependencies. In this work, we design two stream fusion attention (2SFA) connected to a temporal bidirectional gated recurrent unit (GRU) one-layer model and classified by prediction voting classifier (PVC) to recognize the action in a video. Particularly in the proposed deep neural network (DNN), we present 2SFA for capturing appearance information from red green blue (RGB) and motion from optical flow, where both streams are correlated by proposed fusion attention (FA) as the input of a temporal network. On the other hand, the temporal network with a bi-directional temporal layer using a GRU single layer is preferred for temporal understanding because it yields practical merits against six topologies of temporal networks in the UCF101 dataset. Meanwhile, the new proposed classifier scheme called PVC employs multiple nearest class mean (NCM) and the SoftMax function to yield multiple features outputted from temporal networks, and then votes their properties for high-performance classifications. The experiments achieve the best average accuracy of 70.8% in HMDB51 and 91.9%, the second best in UCF101 in terms of 2DConvNet for action recognition.&lt;/span&gt;
Efficient and linear static approach for finding the memory leak in C

Code analysis has discovered that memory leaks are common in the C programming language. In the literature, there exist various approaches for statically analyzing and detecting memory leaks. The complexity and diversity of memory leaks make it difficult to find an approach that is both effective and simple. In embedded systems, costly resources like memory become limited as the system’s size diminishes. As a result, memory must be handled effectively and efficiently too. To obtain precise analysis, we propose a novel approach that works in a phase-wise manner. Instead of examining all possible paths for finding memory leaks, we use a program slicing to check for a potential memory leak. We introduce a source-sink flow graph (SSFG) based on source-sink properties of memory allocation-deallocation within the C code. To achieve simplicity in analysis, we also reduce the complexity of analysis in linear time. In addition, we utilize a constraint solver to improve the effectiveness of our approach. To evaluate the approach, we perform manual scanning on various test cases: link list applications, Juliet test cases, and common vulnerabilities and exposures found in 2021. The results show the efficiency of the proposed approach by preparing the SSFG with linear complexity.
Design a cryptosystem using elliptic curves cryptography and Vigenère symmetry key

In this paper describes the basic idea of elliptic curve cryptography (ECC) as well as Vigenère symmetry key. Elliptic curve arithmetic can be used to develop elliptic curve coding schemes, including key exchange, encryption, and digital signature. The main attraction of elliptic curve cryptography compared to Rivest, Shamir, Adleman (RSA) is that it provides equivalent security for a smaller key size, which reduces processing costs. From the theorical basic, we proposed a cryptosystem using elliptic curves and Vigenère cryptography. We proposed and implemented our encryption algorithm in an integrated development environment named visual studio 2019 to design a safe, secure, and effective cryptosystem.
Person identification based on facial biometrics in different lighting conditions

&lt;span lang="EN-US"&gt;Technological development is an inherent feature of this time, that reliance on electronic applications in all daily transactions (business management, banking, financial transfers, health, and other important aspects of life). Identifying and confirming identity is one of the complex challenges. Therefore, relying on biological properties gives reliable results. People can be identified in pictures, films, or real-time using facial recognition technology. A face individual is a unique identifying biological characteristic to authenticate them and prevents permits another person to assume that individual’s identity without their knowledge or consent. This article proposes the identification model by facial individual characteristics, based on the deep neural network (DNN). The proposed method extracts the spatial information available in an image, analysis this information to extract the salient features, and makes the identifying decision based on these features. This model presents successful and promising results, the accuracy achieves by the proposed system reaches 99.5% (+/- 0.16%) and the values of the loss function reach 0.0308 over the Pins Face Recognition dataset to identify 105 subjects.&lt;/span&gt;
Peer-to-peer media streaming with HTML5

&lt;p class="Affiliation"&gt;&lt;span lang="EN-US"&gt;The knowledge of web real-time communication (WebRTC) and how its customers and server operations are defined in this study. However, the world wide web consortium (W3C) and the internet engineering task force (IETF) have not yet approved an absolute signaling protocol or a complete application programming interface (API) protocol to implement WebRTC and control communication planning. WebRTC requires some type of signaling mechanism. With Chrome, Firefox, and Opera, the primary objective is to create and implement a WebRTC video call across two clients (peers) in the real world while employing local area network (LAN) and wide area network (WAN). This study also demonstrated the design of the server (as an intermediary) and graphical user interface (GUI). Additionally, a signaling method for the peer-to-peer browser connection on the Node.js platform has been developed and successfully put into use. This paper will provide an understanding of web development and an ability to understand WebRTC technology. It will also discuss how to create WebRTC signaling mechanisms and build video conferencing, as well as how to increase design quality using quality of experience (QoE) techniques.&lt;/span&gt;&lt;/p&gt;
A secure sharing control framework supporting elastic mobile cloud computing

&lt;span lang="EN-US"&gt;In elastic mobile cloud computing (EMCC), mobile devices migrate some computing tasks to the cloud for execution according to current needs and seamlessly and transparently use cloud resources to enhance their functions. First, based on the summary of existing EMCC schemes, a generic EMCC framework is abstracted; it is pointed out that the migration of sensitive modules in the EMCC program can bring security risks such as privacy leakage and information flow hijacking to EMCC; then, a generic framework of elastic mobile cloud computing that incorporates risk management is designed, which regards security risks as a cost of EMCC and ensures that the use of EMCC is. Finally, it is pointed out that the difficulty of risk management lies in risk quantification and sensitive module labeling. In this regard, risk quantification algorithms are designed, an automatic annotation tool for sensitive modules of Android programs is implemented, and the accuracy of the automatic annotation is demonstrated through experiments.&lt;/span&gt;
Advanced approach for encryption using advanced encryption standard with chaotic map

At present, security is significant for individuals and organizations. All information need security to prevent theft, leakage, alteration. Security must be guaranteed by applying some or combining cryptography algorithms to the information. Encipherment is the method that changes plaintext to a secure form called cipherment. Encipherment includes diverse types, such as symmetric and asymmetric encipherment. This study proposes an improved version of the advanced encryption standard (AES) algorithm called optimized advanced encryption standard (OAES). The OAES algorithm utilizes sine map and random number to generate a new key to enhance the complexity of the generated key. Thereafter, multiplication operation was performed on the original text, thereby creating a random matrix (4×4) before the five stages of the coding cycles. A random substitution-box (S-Box) was utilized instead of a fixed S-Box. Finally, we utilized the eXclusive OR (XOR) operation with digit 255, also with the key that was generated last. This research compared the features of the AES and OAES algorithms, particularly the extent of complexity, key size, and number of rounds. The OAES algorithm can enhance complexity of encryption and decryption by using random values, random S-Box, and chaotic maps, thereby resulting in difficulty guessing the original text.
Comparison of specific segmentation methods used for copy move detection

&lt;p&gt;&lt;span lang="EN-US"&gt;In this digital age, the widespread use of digital images and the availability of image editors have made the credibility of images controversial. To confirm the credibility of digital images many image forgery detection types are arises, copy-move forgery is consisting of transforming any image by duplicating a part of the image, to add or hide existing objects. Several methods have been proposed in the literature to detect copy-move forgery, these methods use the key point-based and block-based to find the duplicated areas. However, the key point-based and block-based have a drawback of the ability to handle the smooth region. In addition, image segmentation plays a vital role in changing the representation of the image in a meaningful form for analysis. Hence, we execute a comparison study for segmentation based on two clustering algorithms (i.e., k-means and super pixel segmentation with density-based spatial clustering of applications with noise (DBSCAN)), the paper compares methods in term of the accuracy of detecting the forgery regions of digital images. K-means shows better performance compared with DBSCAN and with other techniques in the literature.&lt;/span&gt;&lt;/p&gt;
Pengaruh Pembelajaran Berbasis E-learning Terhadap Hasil dan Kemandirian Belajar Siswa Kelas X MAN 3 Aceh Timur

The purpose of the study was how the Effect of E-learning-Based Learning on Learning Outcomes and Independence of Class X MAN 3 East Aceh Students. This research uses quantitative research using experimental research methods. The design used in this study is a one group pretest-posttest design, this design is used for one group of experimental subjects only. The results of the research and evidence show that there is a significant effect between the initial test scores and the final test scores in class X-MIA.1 and X-MIA.2 on mathematical logic material. The results of the post-test evaluation of the experimental class found that the average learning outcomes of 67.50 students' scores had increased in all students, judging from the post-test scores of the experimental class of 53.44, there was a control that increased the effect of e-learning by 26.31%, this shows that there is a significant effect. significant effect on student learning outcomes of MAN 3 East Aceh. The e-learning method in its application makes students more active and creative in terms of obtaining material sources and more independent discussion, while the teacher only directs and guides students. With the e-learning method, students in learning activities will be more flexible and creative in finding solutions to the material discussed. The e-learning method plays a very active role in disseminating material and understanding the material more deeply, so that the selection of this method is one of the appropriate learning methods in the learning process, but this method must be supported by the willingness of students, be serious, and must be accompanied by the basic abilities of students. using internet facilities, in this case the teacher gives directions to visit the blogspot address and the intended email
Isometric Projection with Autoencoder

Abstract Isometric Projection (IsoP) is a linear dimensionality reduction method, which proviedes the best linear approximation to the true isometric embedding of data. However, IsoP and all its variants only consider the one-way mapping from high-dimensional space to low-dimensional space. The projected low-dimensional data may not “represent” the original sample accurately and effectively. In this paper, based on the structure of linear autoencoder, a new IsoP method called IsoP-AE (Isometric projection with autoencoder) has been proposed. In this method, the conventional projection of IsoP is viewed as the encoding stage, and the decoder is used to reconstruct the original high-dimensional data from the projected low-dimensional data. In this way, our algorithm makes the low-dimensional embedding data “represent” the original data more accurately and effectively. Experiment results on Handwritten Alphadigits, COIL-100, Olivetti Research Laboratory (ORL) and Georgia Tech face datasets show that the proposed IsoP-AE approach provides a better representation of the data and achieves much higher recognition accuracy.
Failing with Grace: Learning Neural Network Controllers that are Boundedly Unsafe

In this work, we consider the problem of learning a feed-forward neural network controller to safely steer an arbitrarily shaped planar robot in a compact and obstacle-occluded workspace. Unlike existing methods that depend strongly on the density of data points close to the boundary of the safe state space to train neural network controllers with closed-loop safety guarantees, here we propose an alternative approach that lifts such strong assumptions on the data that are hard to satisfy in practice and instead allows for graceful safety violations, i.e., of a bounded magnitude that can be spatially controlled. To do so, we employ reachability analysis techniques to encapsulate safety constraints in the training process. Specifically, to obtain a computationally efficient over-approximation of the forward reachable set of the closed-loop system, we partition the robot's state space into cells and adaptively subdivide the cells that contain states which may escape the safe set under the trained control law. Then, using the overlap between each cell's forward reachable set and the set of infeasible robot configurations as a measure for safety violations, we introduce appropriate terms into the loss function that penalize this overlap in the training process. As a result, our method can learn a safe vector field for the closed-loop system and, at the same time, provide worst-case bounds on safety violation over the whole configuration space, defined by the overlap between the over-approximation of the forward reachable set of the closed-loop system and the set of unsafe states. Moreover, it can control the tradeoff between computational complexity and tightness of these bounds. Our proposed method is supported by both theoretical results and simulation studies.
Development of a Facial Recognition-based Attendance System using Binary Patterns Histograms Method and Telegram Bot Notification

In carrying out attendance activities, most schools still use the manual attendance method, which utilizes the attendance book as a medium. However, the presence of the manual still causes some problems that arise when using this method. With the aim of this study, a "Facial Recognition-Based Attendance System" was created. This study used the Local Binary Pattern Histogram (LBPH) method to detect and recognize faces. The system is made to recognize the student's face and name, which the attendance system will then carry out along with the student's identity in the form of Name and Absence Number in real time to find out that the student is present in the class. The names that have been diabase can be saved through the XLS format. The result of this study is a facial recognition-based attendance system using the LBPH (Local Binary Pattern Histogram) method. The system is web-based, so users can easily access it through the internet. This research method uses research and development methods. This research stage consists of research and information collection, planning, and product draft development. The results of this study showed the feasibility level of facial recognition-based attendance systems. The eligibility rate obtained showed a score of 78.98%. From these results, this system is worthy of being used as an attendance system.
Multi-scale Feature Imitation for Unsupervised Anomaly Localization

The unsupervised anomaly localization task faces the challenge of missing anomaly sample training, detecting multiple types of anomalies, and dealing with the proportion of the area of multiple anomalies. A separate teacher-student feature imitation network structure and a multi-scale processing strategy combining an image and feature pyramid are proposed to solve these problems. A network module importance search method based on gradient descent optimization is proposed to simplify the network structure. The experimental results show that the proposed algorithm performs better than the feature modeling anomaly localization method on the real industrial product detection dataset in the same period. The multi-scale strategy can effectively improve the effect compared with the benchmark method.
Randomized benchmarking with random quantum circuits

In its many variants, randomized benchmarking (RB) is a broadly used technique for assessing the quality of gate implementations on quantum computers. A detailed theoretical understanding and general guarantees exist for the functioning and interpretation of RB protocols if the gates under scrutiny are drawn uniformly at random from a compact group. In contrast, many practically attractive and scalable RB protocols implement random quantum circuits with local gates randomly drawn from some gate-set. Despite their abundance in practice, for those non-uniform RB protocols, general guarantees for gates from arbitrary compact groups under experimentally plausible assumptions are missing. In this work, we derive such guarantees for a large class of RB protocols for random circuits that we refer to as filtered RB. Prominent examples include linear cross-entropy benchmarking, character benchmarking, Pauli-noise tomography and variants of simultaneous RB. Building upon recent results for random circuits, we show that many relevant filtered RB schemes can be realized with random quantum circuits in linear depth, and we provide explicit small constants for common instances. We further derive general sample complexity bounds for filtered RB. We show filtered RB to be sample-efficient for several relevant groups, including protocols addressing higher-order cross-talk. Our theory for non-uniform filtered RB is, in principle, flexible enough to design new protocols for non-universal and analog quantum simulators.
You Only Need a Good Embeddings Extractor to Fix Spurious Correlations

Spurious correlations in training data often lead to robustness issues since models learn to use them as shortcuts. For example, when predicting whether an object is a cow, a model might learn to rely on its green background, so it would do poorly on a cow on a sandy background. A standard dataset for measuring state-of-the-art on methods mitigating this problem is Waterbirds. The best method (Group Distributionally Robust Optimization - GroupDRO) currently achieves 89\% worst group accuracy and standard training from scratch on raw images only gets 72\%. GroupDRO requires training a model in an end-to-end manner with subgroup labels. In this paper, we show that we can achieve up to 90\% accuracy without using any sub-group information in the training set by simply using embeddings from a large pre-trained vision model extractor and training a linear classifier on top of it. With experiments on a wide range of pre-trained models and pre-training datasets, we show that the capacity of the pre-training model and the size of the pre-training dataset matters. Our experiments reveal that high capacity vision transformers perform better compared to high capacity convolutional neural networks, and larger pre-training dataset leads to better worst-group accuracy on the spurious correlation dataset.
Data Leakage via Access Patterns of Sparse Features in Deep Learning-based Recommendation Systems

Online personalized recommendation services are generally hosted in the cloud where users query the cloud-based model to receive recommended input such as merchandise of interest or news feed. State-of-the-art recommendation models rely on sparse and dense features to represent users' profile information and the items they interact with. Although sparse features account for 99% of the total model size, there was not enough attention paid to the potential information leakage through sparse features. These sparse features are employed to track users' behavior, e.g., their click history, object interactions, etc., potentially carrying each user's private information. Sparse features are represented as learned embedding vectors that are stored in large tables, and personalized recommendation is performed by using a specific user's sparse feature to index through the tables. Even with recently-proposed methods that hides the computation happening in the cloud, an attacker in the cloud may be able to still track the access patterns to the embedding tables. This paper explores the private information that may be learned by tracking a recommendation model's sparse feature access patterns. We first characterize the types of attacks that can be carried out on sparse features in recommendation models in an untrusted cloud, followed by a demonstration of how each of these attacks leads to extracting users' private information or tracking users by their behavior over time.