Reviewerly/exHarmony huggingface dataset:
Pengembangan Media Kadobudi (Kartu Domino Budaya Indonesia) pada Materi Kebudayaan Indonesia Siswa Kelas IV Sekolah Dasar

The objectives achieved in this study are to find1) the feasibility of Kadobudi media in social studies learning content on Indonesian cultural diversity in class IV students. 2) the practicality of Kadobudi media in social studies learning content on Indonesian cultural diversity in grade IV students. 3) the effectiveness of Kadobudi media on social studies learning content on Indonesian cultural diversity in grade IV students. This study uses research and development R&amp;D methods using the ADDIE model, there are 5 namely analysis, design, development, implementation, and evaluation. The subjects of this study were fourth grade students at SDN Mojoroto 4, Kediri City. The research data collection instruments were observation and interviews. The research was carried out using data analysis techniques in the form of media and material validation questionnaires, posttest questions, teacher and student response questionnaires. The results of this study are (1) The results of this study indicate that the Kadobudi media is declared valid, it can be proven by the validation results of media experts obtaining a score of 85.4%, on the validation results of IPS material experts obtaining a score of 96%. So, the average percentage score obtained from media and material experts is 90.7% with very valid criteria. (2) The results of this study indicate that the Kadobudi media is stated to be practical, it can be proven by the results of the teacher's response questionnaire obtaining a score of 93.8%, on the results of the student response questionnaire obtaining a score of 95%. So, the average percentage score obtained from the teacher and student response questionnaire is 94.4% with very practical criteria. (3) The results of this study indicate that the Kadobudi media is declared effective, it can be proven by the results of the posttest scores obtaining an average score of 86.25% by obtaining 90% mastery of classical learning included in the very effective criteria. Based on the conclusions of the results of this study, it can be stated that the Kadobudi learning media is declared valid, practical and effective.
English Spelling of the Glottal Stop and Voiced Pharyngeal Fricative in Arabic Personal Names by Educated Arabs on Facebook

A sample of 560 Arab Facebook users consisting of students, faculty, schoolteachers, and other professionals with different proficiency levels in English was selected. The study analyzed how Arabic personal names on Facebook to find out how names with the glottal stop (hamza) [ʔ] and/or voiced pharyngeal fricative [ʕ] in initial, medial and final positions, with different Arabic short and long vowels before and after them are spelled; whether there are variations in their spelling; causes of spelling variations, and the spelling strategies used. Results showed that 63% of the names have an initial hamza; 10% have a medial hamza; 24% have a final hamza. 65% have one variant and 29% have two variants. Names with the highest occurrences are Eman (26); Ibrahim (18); Alaa &amp; Ismail (17) each; and Asma (16). In some names there is a cluster of 2-3 vowels (Waeel, Ismaiel, Ismaeel, Ismaeil, Doaa Duaa). The voiced pharyngeal fricative [ʕ] in all names was substituted by a vowel as this phoneme/grapheme does not exist in English. Thus both [ʔ] and [ʕ] are represented by vowels and pronounced the same in English. 64.5% have an initial [ʕ], 30% have a medial [ʕ] and 5% have a final [ʕ]. 85% of the names with [ʕ] have one variant and 13.5% have two variants. اسماعيل has the highest number of variants (Esmail/Ismail, Ismael, Esmaiel/Ismaeil, Ismaeel) because [ʕ] ع is preceded and followed by long vowels. Some names with final [ʔ] and [ʕ] and followed by a long vowel were spelled with a single -a or double -aa. In Asma, Wafa, Haifa and Sana, [ʕ] was deleted because the spelling matches how the name is pronounced in the local dialect. In Abduh, Amro Enayah Waed, transferred the Arabic spelling system was transferred to English. [ʕ] was deleted is some names (Menem, Yakoub, Gomma) and the vowel was retained to facilitate pronunciation. An apostrophe was added in Ro’aa, Asma’a to split the vowel cluster. The study gives recommendations to help EFL students spell names with phonemes/graphemes that do not exist in English accurately and to help English speakers pronounce the English version correctly.
The Obstacles of Using Augmented Reality to Students with Communication Disorders in the Elementary School Level from the Perspective of their Teachers in Medina

The present study aimed to identify the obstacles that hinder the use of augmented reality with students with communication disorders in the elementary stage from the perspective of their teachers in Medina. Accordingly, a questionnaire consisting of (47) items has been constructed that measures the most important obstacles that hinder the use of augmented reality in the therapeutic sessions for students with communication disorders. The two researchers builded descriptive survey instrument, the questionnaire applied to a simple random sample consisting of (133) teachers of communication disorders (male &amp; female), to identify the main obstacles from their perspective according to a number of variables: (academic qualification, years of experience, gender). The outcomes indicated that the most influential obstacles are as follows: Obstacles related to male and female teachers came in the first place, followed by technical and material obstacles in second place, followed by obstacles for female students, while obstacles related to administration came in the last order, and the results showed that there were no statistically significant differences at a significant level of (α ≤0.05) between responses study sample individuals towards assessing the obstacles to using augmented reality with students with communication disorders at the elementary level according to the educational qualification variable (bachelor, postgraduate), years of experience variable (1-5, 6-10, 11 and more), and the gender variable (male-female).
AN EXAMINATION OF CLOUD CRYPTOGRAPHY

One of the key components of information security is cloud cryptography.It uses various encoding and covert writing techniques in an effort to keep our data safe and secure on the cloud.To maintain the integrity of the knowledge, we often employ both public and private keys while encrypting and decrypting data in cloud cryptography.The market is uneasy about cloud computing because of the way that it controls data security and anonymity.To help the experts in cloud cryptography understand this parameter, we will explore it together throughout this work.We addressed numerous surveys on cloud cryptography in this study.
Cantilever plate mid-span patch method for dynamically testing the in-plane Poisson's ratio of oriented strand board

A cantilever plate span-to-span patch method was proposed and demonstrated for dynamic testing of OSB Poisson’s ratio with high testing accuracy, simplicity, ease of implementation, and effectiveness. It is based on the patch method with zero transverse stress equal to the cantilever plate. Its effectiveness was verified by the four-point bending method and the patch strain gauge method with zero transverse stress. The simulation and theoretical analysis showed that the relative errors of OSB longitudinal and transverse Poisson’s ratios dynamically tested by the span-in patch method and the patch method with zero transverse stress were within ±3.8%. The OSB longitudinal and transverse Poisson’s ratios dynamically tested by the span-in patch method were in good agreement with those tested by the four-point bending method. Thus, the method is applicable to the cantilever plates with l/b= 5 to 6, b/h = 4 to 10, and l/b = 4, b/h = 7 to 10 for cantilevered plates, etc.
A Pose Estimation Algorithm for Multimodal Data Fusion

In response to the problem that the previous pose detection systems are not effective under conditions such as severe occlusion or uneven illumination, this paper focuses on the multimodal information fusion pose estimation problem. The main work is to design a multimodal data fusion pose estimation algorithm for the problem of pose estimation in complex scenes such as low-texture targets and poor lighting conditions. The network takes images and point clouds as input and extracts local color and spatial features of the target object using the improved DenseNet and PointNet++ networks, which are combined with a microscopic bit-pose iterative network to achieve end-to-end bit-pose estimation. Excellent detection accuracy was obtained on two benchmark datasets of LineMOD (97.8%) and YCB-Video (95.3%) for pose estimation. The algorithm is able to obtain accurate poses of target objects from complex scenes, providing accurate, real-time and robust relative poses for object tracking in motion and wave compensation.
Sound and video examples – issue 28 (1)

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Survey on Relational Database Watermarking Employing Evolutionary Methods

Ownership control, integrity, and tamper-proofing of relational data are essential concerns that must be addressed as the communication (network) system grows. Over the past several years, a plethora of potential solutions has been proposed to address these issues (including cryptography, steganography, digital signatures, watermarks, and many others). Digital watermarking (comparatively new) is a technology that aids in the resolution of issues such as data theft, authenticity, and copyright claims. This paper’s primary contributions are as follows: 1) Examine evolutionary algorithm-based watermarking in relational databases that provide optimize data encoding space in search space which provides high robustness and imperceptibility. 2) Examine contemporary database watermarking strategies based on evolutionary algorithms for high embedding capacity and watermark bit insertion. 3) Malicious agent tracing through cluster-based (mainly fuzzy c-mean clustering algorithm or based on a hash function) or multiple watermarking approaches over shared or collaborative networks. This article focuses on watermarking numeric relational databases for authentication and integrity. Also provide a brief overview of the development of relational database watermarking and emergence, its characteristics and application, and the popular research methods currently in use. In addition, gist on various possible attacks. At last, this paper suggests directions for further research in these areas. Researchers can use the findings of this study to build secure watermarking methods for databases.
TO THE 90th ANNIVERSARY OF DMITRY SEMENOVICH ISHCHENKO'S BIRTH: MEMORIES OF THE SCIENTIST

Summary. The authors of this article presented their memories of their teacher, and later a colleague – Dmitry Semenovich Ishchenko, who could have turned 90 on November 23, 2022. He was born in Odessa, on Staroportofrankovskaya street, and was a student and post-graduate student of the Russian Department, the Faculty of Philology of Odessa I. I. Mechnikov State University (now Odessa I. I. Mechnikov National University). After defending his dissertation, he worked at the Tiraspol State Pedagogical Institute (now Pridnestrovian Taras Shevchenko State University), headed the Department of the Russian language there; for several years he taught Russian at the University of Delhi, and in the 1970s he returned to alma-mater and worked until the end of his life (January 19, 2013) as an Associate Professor, Professor of the Department of Russian language, headed it from 1993 to 2010. From 2001 to the end of his life, D. S. Ishchenko was the editor-in-chief of the scientific and theoretical journal "Mova", paying a lot of attention not only to scientific, educational, organizational, but also to editorial work. Each of the co-authors covers different aspects of Dmitry Semenovich Ishchenko's life and professional activities.
A Framework of Formative Assessment Strategies in Online Learning

The education system has effectively transformed from physical to online and hybrid education due to COVID-19. Several educational institutions were forced to divert all assessments’ strategies to online platforms for the safety of all members including students and staff. Assessments are considered as a significant component in the process of improving education all over the world. Formative assessments help teachers to enhance students’ learning skills and develop their academic progress, Nowadays, for educational accountability, countries, schools, and teachers are evaluated based on students’ progress results in various assessments. Therefore, the purpose of the current chapter is to create a theoretical framework that guides educators with theories and models to reinforce the educational strategies and to implement the online formative assessment in Distance Learning towards enhancing students’ academic results. The provided framework is guided by the perspectives of Vygotsky’s social constructivist theory, constructive alignment theory, and depth of knowledge model. This framework including its theories and model will help teachers to classify students and have clear ideas regarding the needed strategies for them. Additionally, the framework will align the analysis of the used standards, objectives, curriculum, and assessments all together in a way that suits students’ academic requirements.
Taxonomy of Shilling Attack Detection Techniques in Recommender System

Collaborative filtering recommender systems (CFRSs) are widely employed in several applications because of their satisfying performance in the customized recommendation. Recent studies show that CFRSs are at risk of shilling attacks due to injection of some shilling profiles by the associate resister into a system. The genuineness of the rated recommendations as well as users’ trustworthiness are getting seriously affected due to the injection of malicious users within the recommendation system. Over the last few decades, numerous studies have been conducted to survey shilling attack detection schemes and study recommendation algorithms and different profile injection attack techniques. In this chapter, the profile injection attack methods, collaborative filtering in recommender systems and shilling attack detection schemes have been discussed. The shilling attack detection technique basically works on the two parameters, namely, rating parameter and rating and time interval parameter. Based on the working parameters, the shilling attack detection techniques have been classified. They have also been classified based on their output. A brief discussion on each and every scheme has also been presented. The techniques have been analyzed based on their advantages and disadvantages.
Machine Learning and Data Analysis Based Breast Cancer Classification

The precise classification of breast cancer significantly affects the further diagnosis of the cancer patient. Usual methods of testing and classifying of the cancer cells in the laboratory takes a long time. Laboratory work is so complicated and needs the expertise of highly qualified doctors. Instead, machine learning algorithms can be used on the data of cancer patients to classify breast cancer in relatively lesser time. The data are usually obtained from the images of the cancer cells. This way of classifying cancer provides more reliable results and saves a lot of time and money. This current study examines the cancer patient data obtained from images, preprocessing of the data, training of different machine learning models, and choosing of the best-trained model for the classification of breast cancer. The current study helps not only in identifying the best machine learning model to classify breast cancer but also to formulate a process of diagnosing breast cancer based on the preprocessed data obtained from the raw images of breast cancer.
The XR World is Yours!

Rayyan Mughal reflects on the latest recommendations surrounding privacy in AR, VR and XR
Stop Guessing

Now developers will be able look inside RTOS firmware by using visual tracing.
SUPPORTING INTELLIGENCE AT THE EDGE

Intensive edge-AI compute comes with significant challenges, however a solution in the form of adaptive computing is at hand, as REHAN TAHIR and EHAB MOHSEN explain
Securing Our Critical Infrastructure

In our connected world cyber-security is deemed critical, especially when hackers are now targeting our infrastructure.
How Technology is Driving the Edtech Revolution

How are schools and teaching professionals using technology to enhance students' engagement and motivation?
Multi-Touch Screen Display

TANVAS UNVEILS PROGRAMMABLE EFFECTS AND TEXTURES FOR AUTOMOTIVE DISPLAYS.
The New Frontier in Creativity

How technology, from VR and AI to technology tools, is helping to drive new forms of creativity in the world of the arts.
Innovative Quantum Chip

NEW CHIP BUILT BY UCPH PHYSICISTS RESOLVES QUANTUM CHALLENGE
Spurring Innovation

While innovation is booming in machine learning companies need to be aware of the importance of effective patent protection, as Karl Barnfather and Harry Strange explain
Touch Sound Localisation Technology

KAIST team develop sound-based touch input technology for smart tables and mirrors.
The Mission Critical Edge

The transformational power of high performance and edge computing on mission critical applications is profound
The New Face of Policing

At a time when criminals are becoming more sophisticated how are the police using technology to respond?
Efficient resilient functions

An n-bit boolean function is resilient to coalitions of size q if no fixed set of q bits is likely to influence the value of the function when the other n — q bits are chosen uniformly at random, even though the function is nearly balanced. We construct explicit functions resilient to coalitions of size q = n/(log n)O(log log n) = n1-o(1) computable by linear-size circuits and linear-time algorithms. We also obtain a tight size-depth tradeoff for computing such resilient functions.Constructions such as ours were not available even non-explicitly. It was known that functions resilient to coalitions of size q = n0.63… can be computed by linear-size circuits [BL85], and functions resilient to coalitions of size q = Θ(n/ log2 n) can be computed by quadratic-size circuits [AL93].One component of our proofs is a new composition theorem for resilient functions.* This paper subsumes an unpublished work by Meka. PI and EV are partially supported by NSF grant CCF-2114116.
Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance

We consider the problem of obtaining approximation algorithms for standard edit distance and Dyck edit distance that are simple, deterministic and fast, but whose approximation factor may be high. For the standard edit distance of two strings, we introduce a class of simple and fast algorithms called basic single pass algorithms. Saha (2014) gave a randomized algorithm in this class that achieves an O(d) approximation on inputs x,y whose edit distance is O(d). In this paper, we (1) present a deterministic algorithm in this class that achieves similar performance and (2) prove that no algorithm (even randomized) in this class can give a better approximation factor. For the Dyck edit distance problem, Saha gave a randomized reduction from Dyck edit distance to standard two string edit distance at a cost of a O(log d) factor where d is the Dyck edit distance. We give a deterministic reduction whose description and proof are very simple.
Query Complexity of Inversion Minimization on Trees

We consider the following computational problem: Given a rooted tree and a ranking of its leaves, what is the minimum number of inversions of the leaves that can be attained by ordering the tree? This variation of the well-known problem of counting inversions in arrays originated in mathematical psychology. It has the evaluation of the Mann-Whitney statistic for detecting differences between distributions as a special case.We study the complexity of the problem in the comparison-query model, the standard model for problems like sorting, selection, and heap construction. The complexity depends heavily on the shape of the tree: for trees of unit depth, the problem is trivial; for many other shapes, we establish lower bounds close to the strongest known in the model, namely the lower bound of log2(n!) for sorting n items. For trees with n leaves we show, in increasing order of closeness to the sorting lower bound:(a) log2((α(1 — α)n)!) — O(log n) queries are needed whenever the tree has a subtree that contains a fraction α of the leaves. This implies a lower bound of for trees of degree k.(b) log2(n!) — O(log n) queries are needed in case the tree is binary.(c) log2(n!) — O(k log k) queries are needed for certain classes of trees of degree k, including perfect trees with even k.The lower bounds are obtained by developing two novel techniques for a generic problem Π in the comparison-query model and applying them to inversion minimization on trees. Both techniques can be described in terms of the Cayley graph of the symmetric group with adjacent-rank transpositions as the generating set, or equivalently, in terms of the edge graph of the permutahedron, the polytope spanned by all permutations of the vector (1, 2,…, n). Consider the subgraph consisting of the edges between vertices with the same value under Π. We show that the size of any decision tree for Π must be at least:(i) the number of connected components of this subgraph, and(ii) the factorial of the average degree of the complementary subgraph, divided by n.Lower bounds on query complexity then follow by taking the base-2 logarithm. Technique (i) represents a discrete analog of a classical technique in algebraic complexity and allows us to establish (c) and a tight lower bound for counting cross inversions, as well as unify several of the known lower bounds in the comparison-query model. Technique (ii) represents an analog of sensitivity arguments in Boolean complexity and allows us to establish (a) and (b).Along the way to proving (b), we derive a tight upper bound on the maximum probability of the distribution of cross inversions, which is the distribution of the Mann-Whitney statistic in the case of the null hypothesis. Up to normalization the probabilities alternately appear in the literature as the coefficients of polynomials formed by the Gaussian binomial coefficients, also known as Gaussian polynomials.
On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions

Let G be a linear algebraic group acting on the vector space V. Given v, v' ∈ V, the orbit closure intersection problem asks to decide if the orbit closures of v and v' under G intersect. Due to connections with polynomial identity testing, the orbit closure intersection problems for the conjugation and left-right actions on matrix tuples received considerable attention in computational complexity and computational invariant theory, as seen in the works of Forbes-Shpilka (RANDOM 2013), Allen-Zhu-Garg-Li-Oliveira-Wigderson (STOC 2018), and Derksen-Makam (Algebra & Number Theory 2020). In this paper, we present new algorithms for the orbit closure problem for the conjugation and left-right actions on matrix tuples. The main novel feature is that in the case of intersecting orbit closures, our algorithm outputs cosets of one-parameter subgroups that drive the matrix tuples to a tuple in the intersection of the orbit closures.