Reviewerly/exHarmony huggingface dataset:
Two-way Recommendation System for Supervisor Selection using Historical Data and Skyband-view Queries

Completing the final project on time is one indicator of success in university. Unfortunately, many students have not been able to complete their studies on time. One of the factors that influence this is the failure in choosing the right supervisor. This study aims to create a recommendation system that can help students choose suitable supervisors. Unlike other studies, this research builds a two-way recommendation system that takes into account the preferences of students and supervisors. The previous study used the skyline views query concept to recommend dominant objects. However, the skyline view query concept has a major limitation: only skyline objects will be recommended to the user. Thus, students who are not skyline objects may not get a supervisor's recommendation, and vice versa. In this research, we use the concept of a skyband view query to overcome the limitation of the skyline view query. In addition to answering eight important queries from both parties, students and supervisors, the skyband view query concept is also able to overcome the shortcomings in previous research. Historical data from alumni is used to construct students' and supervisors' interests. This research succeeded in expanding the choice of research topics given in previous studies, as well as increasing the number of recommended supervisors and students.
The Impact of Virtual Reality in Education: A Comprehensive Research Study

In recent years, virtual reality (VR) technologies have made significant advancements and are now being explored for their potential applications in various fields, including education. This exciting development has sparked a growing interest in investigating the use of VR technologies to enhance learning experiences. VR offers a unique opportunity to create immersive and interactive environments that can transport students to places they may never have the chance to visit otherwise. By simulating real-world scenarios, VR can provide students with hands-on experiences and facilitate active learning. From exploring historical landmarks to conducting complex scientific experiments, the possibilities are endless. This research paper aims to investigate the use of VR technologies in the field of education, exploring their potential benefits, challenges, and implications. Through a comprehensive literature review and analysis, this study provides insights into the current state of VR in education, its applications, and its impact on learning outcomes. One of the key advantages of using VR in education is its ability to engage students on a deeper level. Traditional teaching methods often struggle to capture and maintain students’ attention, but VR has the potential to captivate learners by making education more interactive and enjoyable. The findings reveal that VR technologies have the potential to enhance student engagement, facilitate immersive learning experiences, and improve knowledge retention. However, challenges such as cost, accessibility, and technological limitations must be addressed to ensure widespread adoption and integration of VR in educational settings. Furthermore, By creating an environment where students can actively participate in their learning process, VR helps foster curiosity, critical thinking, and problem-solving skills.. The research concludes by highlighting the future prospects of VR in education and suggesting areas for further research.
Self-Supervised Network Distillation for Exploration

Reinforcement learning is currently applicable across a range of domains, including robotics, gaming, and natural language processing. However, the approach faces difficulties in environments with sparse rewards. Random network distillation (RND) is a good intrinsic reward solution to this problem. Nevertheless, the RND method’s effectiveness hinges on excellent initialization, and the reliance on random features somewhat constrains the agent’s exploration capabilities. This paper proposes a self-supervised network distillation (SSND) exploration method, addressing the drawbacks of RND’s reliance on initializing random networks while enhancing the agent’s exploration capability in sparse reward environments. The method uses distillation error as intrinsic rewards, with the target network trained using self-supervised learning. During the training of the predictor network, we noticed fluctuations in both loss values and intrinsic rewards, which have a detrimental impact on the performance of the intelligent agent. To resolve this issue, we introduce batch normalization layers to the target network, which helps mitigate intrinsic reward anomalies stemming from the target network’s instability. Experiments show that the self-supervised network distillation is better than RND in terms of exploration speed and performance.
Three-layer quantum image encryption algorithm based on 6D hyperchaos

In order to further improve the security and efficiency of quantum image encryption, a three-layer encryption scheme for quantum color images based on 6D hyperchaos is proposed for the improved quantum representation model. The sequences generated by the 6D hyperchaotic system are applied to each layer of image encryption as keys. First, the quantum Fibonacci matrix is used to scramble the pixel value positions of the image to achieve the spatial scrambling of the quantum image; then, the position exchange of red, green, and blue channels and the bit-level cycle shift of pixel value are carried out alternately to realize the bit-level scrambling of quantum images; Finally, the XOR operation is performed on the quantum image whose position has been scrambled to realize the bit-level diffusion of the quantum image and obtain the final encrypted image. Simulation results show that the encryption algorithm is highly sensitive to the initial key, and the pixel values of the encrypted image are evenly distributed. In addition, quantum circuits are designed to implement the image encryption steps of each layer.
Spatial Acumen in the Digital Age: The Transformative Power of STEM-Enriched Mobile Textbooks in Geography

Integrating technology into learning has become a pivotal necessity in the digital age. This underscores the imperative for educators, serving as facilitators, to organize and implement digital technology within instructional processes adeptly. Central to this application is educators’ perceptions of the utilization of mobile digital textbooks. Crucially, this study, rooted in a qualitative research design, sought to elucidate teachers’ perceptions regarding the employment of the Mobile Digital Textbook, integrated with a STEM approach, to enhance students’ spatial thinking and Higher-Order Thinking Skills (HOTS). Data collection was meticulously executed through semi-structured interviews involving fifteen geography educators from eight East Java, Indonesia, secondary institutions. With the aid of NVIVO software, the data were systematically organized and categorized based on pre-established criteria. The findings revealed a predominantly positive perception among the fifteen participants towards using the Mobile Digital Textbook with the STEM approach in fostering students’ spatial thinking and HOTS. The implications of this research underscore the significance of continuous training and support for educators in assimilating digital technology, particularly mobile digital textbooks, to elevate instructional quality and cultivate students’ advanced cognitive abilities.
CYBERSECURITY AND PRIVACY TRUST IN DIGITAL DATA: NAVIGATING THE DIGITAL TRUST LANDSCAPE

In our investigation of the complex forces influencing trust in the digital age, "Cybersecurity and Privacy Trust in Digital Data: Navigating the Digital Trust Landscape," In order to understand how cybersecurity and privacy work together to promote digital trust, this chapter looks deeply into both topics. This chapter explores the complex world of digital trust, including technology that protect privacy and transparent communication tactics. Real-world examples highlight the difficulties businesses confront in juggling security, privacy, and consumer confidence in the face of changing cyberthreats. This chapter offers a thorough framework for creating and upholding digital trust by carefully exploring how cybersecurity measures and privacy protection interact. Readers learn how to create strong security frameworks, improve user privacy, and promote unflinching confidence in online interactions. This chapter provides as a roadmap for navigating the terrain of digital trust, enabling people and organizations to understand the intricacies of the digital world and providing secure, private, and reliable digital environments for all stakeholders.
COMPUTER MODELS IN PHYSICS AS A MEANS OF FORMING UNIVERSAL COMPETENCIES

This article deals with the formation of meta-subject universal educational actions in schoolchildren when using a computer and natural physical experiment in the learning process. The main possibilities of educational computer models are described, which represent the creation of a special software and didactic environment that allows students to actively interact with the objects under study and acquire data regarding the results of this interaction, which is important for the formation of meta-subject universal educational activities.
Yuz: Improving Performance of Cluster-Based Services by Near-L4 Session-Persistent Load Balancing

Large-scale services are deployed in data centers using clusters of servers, and load balancers (LB) are responsible for distributing requests for a service among its servers. Layer-4 (L4) LBs process requests faster than Layer-7 (L7) ones, but they cannot provide session-persistent load balancing, and therefore, they direct connections of an application-level session to different servers. On the other side, L7 LBs can direct all requests of an application-level session to the same server, but they have a very limited capacity because they act as a reverse-proxy and process requests at the application layer. We present “Yuz”, a stateless session-persistent load balancer that does not act as a reverse-proxy. Yuz works near layer 4, and it makes use of TLS session data instead of processing incoming requests at the application level. Our evaluations show that the request rate that can be handled by cluster-based services equipped with Yuz is twice as high as when the clusters use the best existing load balancers. Yuz also significantly reduces the average and tail of the clusters’ response time. Moreover, while each of the existing session-persistent LBs works only for a specific application, Yuz provides an application-independent session-persistent load balancing.
Network Architecture Design toward Convergence of Mobile Applications and Networks

The mobile communication networks are faced with gigantic challenges to meet the diversified and challenging service requirements. A tight coordination or even convergence of applications and mobile communication networks is highly motivated for the optimization of the end-to-end quality of service and quality of experience (QoE). In this paper, a multi-domain (e.g. application layer, transport layer, core network and radio access network) coordination scheme is first presented. Toward convergence of mobile applications and networks, a network architecture with a cross-domain coordination center (CDCC) is further proposed, which utilizes information from all the domains to optimize the end-to-end service. The benefits of the CDCC enabled base station scheduling are further investigated via simulations. A new QoE-oriented fairness index is also proposed, which is capable of ensuring better fairness when different services are scheduled. Future research directions and their standardization impacts are finally identified. Toward optimized end-to-end service provision, a paradigm shift to converged applications and mobile communication networks is indispensable in the future network architecture design.
Oman Royal Speeches Corpus: Compilation and Analysis

For many years, researchers have directed their attention primarily toward developing written corpora, with the consequence that spoken corpora have consistently remained rare compared to written ones. The laborious transcription and annotation tasks make creating and maintaining spoken corpora a challenging endeavor. This project aims to build a transcribed corpus of Oman Royal Speeches and make it available online through a custom-made concordance tool. The study also aims to test the corpus for fundamental corpus-based lexical, stylistic, and discourse-analytical implementations. Compiling the Oman Royal Speeches Corpus is meant to fill a gap by contributing to the development of Arabic spoken language corpora and make available a research tool that can facilitate corpus-based research, uses, and applications in various areas of investigation. The corpus-building process underwent a five-stage process, including data capture, data processing, concordance tool development, testing and evaluation, and online deployment. With 98,511 tokens, the resultant corpus represents a searchable archive of Royal Speeches with a built-in online concordance tool that allows multiple search types and Keyword-in-Context query result display. The corpus has been tested for various corpus-analytic uses and has been found to provide significant findings in these areas. Thus, it has the potential to function as a reliable and authentic record and source of information for researchers and specialists in various fields, as well as a research tool allowing for various applications and analyses in language-related topics.
Automating Collision Attacks on RIPEMD-160

As an ISO/IEC standard, the hash function RIPEMD-160 has been used to generate the Bitcoin address with SHA-256. However, due to the complex doublebranch structure of RIPEMD-160, the best collision attack only reaches 36 out of 80 steps of RIPEMD-160, and the best semi-free-start (SFS) collision attack only reaches 40 steps. To improve the 36-step collision attack proposed at EUROCRYPT 2023, we explored the possibility of using different message differences to increase the number of attacked steps, and we finally identified one choice allowing a 40-step collision attack. To find the corresponding 40-step differential characteristic, we re-implement the MILP-based method to search for signed differential characteristics with SAT/SMT. As a result, we can find a colliding message pair for 40-step RIPEMD-160 in practical time, which significantly improves the best collision attack on RIPEMD-160. For the best SFS collision attack published at ToSC 2019, we observe that the bottleneck is the probability of the right-branch differential characteristics as they are fully uncontrolled in the message modification. To address this issue, we utilize our SAT/SMT-based tool to search for high-probability differential characteristics for the right branch. Consequently, we can mount successful SFS collision attacks on 41, 42 and 43 steps of RIPEMD-160, thus significantly improving the SFS collision attacks. In addition, we also searched for a 44-step differential characteristic, but the differential probability is too low to allow a meaningful SFS collision attack.
Co-Design of a Public Space and the Implementation: Atakent (Car) Park

Citizen Design Science is a new co-design strategy for urban and architectural systems that improves the planning, design, management, and renewal of cities, urban habitats, and architectural structures, using active design tools through citizens' observation, experience, and local knowledge. The aim of this study is to describe how Atakent Parking Area is transformed into a public space design and implementation through both digital and analog active design tools in the co-design process that includes citizens' spatial experiences, needs, and desires through the method of citizen design science. The objective indicators and subjective perception applied in the study were combined in the co-design process to implement an urban design project. The experimental collaborative urban design process is realized on a democratic platform based on the tendencies and expectations of the participants. Two conceptual urban design projects were prepared with design science data including citizens' wishes, needs, and suggestions about the area, and participating citizens were asked to vote for the project democratically in the urban space. The selected conceptual design project was transformed into an implementation project in the urban area.
Cascading Four Round LRW1 is Beyond Birthday Bound Secure

In CRYPTO’02, Liskov et al. introduced the concept of a tweakable block cipher, a novel symmetric key primitive with promising applications. They put forth two constructions for designing such tweakable block ciphers from conventional block ciphers: LRW1 and LRW2. While subsequent efforts extended LRW2 to achieve security beyond the birthday bound (e.g., cascaded LRW2 in CRYPTO’12 by Landecker et al.), the extension of LRW1 remained unexplored until Bao et al.’s work in EUROCRYPT’20 that considered cascaded LRW1, a one-round extension of LRW1 - entailing masking the LRW1 output with the given tweak and re-encrypting it with the same block cipher. They showed that CLRW1 offers security up to 22n/3 queries. However, this result was challenged by Khairallah’s recent birthday bound distinguishing attack on cascaded LRW1, effectively refuting the security claim of Bao et al. Consequently, a pertinent research question emerges: How many rounds of cascaded LRW1 are required to obtain security beyond the birthday bound? This paper addresses this question by establishing that cascading LRW1 for four rounds suffices to ensure security beyond the birthday bound. Specifically, we demonstrate that 4 rounds of CLRW1 guarantees security for up to 23n/4 queries. Our security analysis is based from recent advancements in the mirror theory technique for tweakable random permutations, operating within the framework of the Expectation Method.
On Large Tweaks in Tweakable Even-Mansour with Linear Tweak and Key Mixing

In this paper, we provide the first analysis of the Iterated Tweakable Even-Mansour cipher with linear tweak and key (or tweakey) mixing, henceforth referred as TEML, for an arbitrary tweak(ey) size kn for all k ≥ 1, and arbitrary number of rounds r ≥ 2. Note that TEML captures the high-level design paradigm of most of the existing tweakable block ciphers (TBCs), including SKINNY, Deoxys, TweGIFT, TweAES etc. from a provable security point of view. At ASIACRYPT 2015, Cogliati and Seurin initiated the study of TEML by showing that 4-round TEML with a 2n-bit uniform at random key, and n-bit tweak is secure up to 22n/3 queries. In this work, we extend this line of research in two directions. First, we propose a necessary and sufficient class of linear tweakey schedules to absorb mn-bit tweak(ey) material in a minimal number of rounds, for all m ≥ 1. Second, we give a rigorous provable security treatment for r-round TEML, for all r ≥ 2. In particular, we first show that the 2r-round TEML with a (2r + 1)n-bit key, αn-bit tweak, and a special class of tweakey schedule is IND-CCA secure up to O(2r−α/r n) queries. Our proof crucially relies on the use of the coupling technique to upper-bound the statistical distance of the outputs of TEML cipher from the uniform distribution. Our main echnical contribution is a novel approach for computing the probability of failure in coupling, which could be of independent interest for deriving tighter bounds in coupling-based security proofs. Next, we shift our focus to the chosen-key setting, and show that (r + 3)-round TEML, with rn bits of tweakey material and a special class of tweakey schedule, offers some form of resistance to chosen-key attacks. We prove this by showing that r + 3 rounds of TEML are both necessary and sufficient for sequential indifferentiability. As a consequence of our results, we provide a sound provable security footing for the TWEAKEY framework, a high level design rationale of popular TBC.
Improved Fast Correlation Attacks on the Sosemanuk Stream Cipher

In this paper, we present a new algorithm for fast correlation attacks on stream ciphers with improved cryptanalysis results on the Sosemanuk stream cipher, one of the 7 finalists in the eSTREAM project in 2008. The new algorithm exploits the direct sum construction of covering codes in decoding phase which approximates the random vectors to a nearest codeword in a linear code. The new strategy provides large flexibility for the adversary and could reduce the time/memory/data complexities significantly. As a case study, we carefully revisit Sosemanuk and demonstrate a state recovery attack with a time complexity of 2134.8, which is 220 times faster than achievable before by the same kind of attack and is the fastest one among all known attacks so far. Our result indicates an inefficiency in longer keys than 135 bits and depicts that the security margin of Sosemanuk is around 28 for the 128-bit security for the first time.
Integral Cryptanalysis Using Algebraic Transition Matrices

In this work we introduce algebraic transition matrices as the basis for a new approach to integral cryptanalysis that unifies monomial trails (Hu et al., Asiacrypt 2020) and parity sets (Boura and Canteaut, Crypto 2016). Algebraic transition matrices allow for the computation of the algebraic normal form of a primitive based on the algebraic normal forms of its components by means of wellunderstood operations from linear algebra. The theory of algebraic transition matrices leads to better insight into the relation between integral properties of F and F−1. In addition, we show that the link between invariants and eigenvectors of correlation matrices (Beyne, Asiacrypt 2018) carries over to algebraic transition matrices. Finally, algebraic transition matrices suggest a generalized definition of integral properties that subsumes previous notions such as extended division properties (Lambin, Derbez and Fouque, DCC 2020). On the practical side, a new algorithm is described to search for these generalized properties and applied to Present, resulting in new properties. The algorithm can be instantiated with any existing automated search method for integral cryptanalysis.
Multidimensional Linear Cryptanalysis of Feistel Ciphers

This paper presents new generic attacks on Feistel ciphers that incorporate the key addition at the input of the non-invertible round function only. This feature leads to a specific vulnerability that can be exploited using multidimensional linear cryptanalysis. More specifically, our approach involves using key-independent linear trails so that the distribution of a combination of the plaintext and ciphertext can be computed. This makes it possible to use the likelihood-ratio test as opposed to the χ2 test. We provide theoretical estimates of the cost of our generic attacks and verify these experimentally by applying the attacks to CAST-128 and LOKI91. The theoretical and experimental findings demonstrate that the proposed attacks lead to significant reductions in data-complexity in several interesting cases.