Reviewerly/exHarmony huggingface dataset:
Automatic Generation of Semantically Annotated Collocation Corpus

Word Sense Disambiguation (WSD) is a crucial initial step in automatic semantic analysis. It involves selecting the correct sense of an ambiguous word in a given context, which can be challenging even for human annotators. Supervised machine learning models require large datasets with semantic annotation to be effective. However, manual sense labeling can be a costly, labor-intensive, and time-consuming task. Therefore, it is crucial to develop and test automatic and semi-automatic methods of semantic annotation. Information about semantically related words, such as synonyms, hypernyms, hyponyms, and collocations in which the word appears, can be used for these purposes. In this article, we describe our approach to generating a semantically annotated collocation corpus for the Russian language. Our goal was to create a resource that could be used to improve the accuracy of WSD models for Russian. This article outlines the process of generating a semantically annotated collocation corpus for Russian and the principles used to select collocations. To disambiguate words within collocations, semantically related words defined based on RuWordNet are utilized. The same thesaurus is also used as the source of sense inventories. The methods described in the paper yield an F1-score of 80% and help to add approximately 23% of collocations with at least one ambiguous word to the corpus. Automatically generated collocation corpuses with semantic annotation can simplify the preparation of datasets for developing and testing WSD models. These corpuses can also serve as a valuable source of information for knowledge-based WSD models.
Near-Optimal Private Information Retrieval with Preprocessing

In Private Information Retrieval (PIR), a client wishes to access an index i from a public n-bit database without revealing any information about i. Recently, a series of works starting with the seminal paper of Corrigan-Gibbs and Kogan (EUROCRYPT 2020) considered PIR with client preprocessing and no additional server storage. In this setting, we now have protocols that achieve $$\widetilde{O}(\sqrt{n})$$ (amortized) server time and $$\widetilde{O}(1)$$ (amortized) bandwidth in the two-server model (Shi et al., CRYPTO 2021) as well as $$\widetilde{O}(\sqrt{n})$$ server time and $$\widetilde{O}(\sqrt{n})$$ bandwidth in the single-server model (Corrigan-Gibbs et al., EUROCRYPT 2022). Given existing lower bounds, a single-server PIR scheme with $$\widetilde{O}(\sqrt{n})$$ (amortized) server time and $$\widetilde{O}(1)$$ (amortized) bandwidth is still feasible, however, to date, no known protocol achieves such complexities. In this paper we fill this gap by constructing the first single-server PIR scheme with $$\widetilde{O}(\sqrt{n})$$ (amortized) server time and $$\widetilde{O}(1)$$ (amortized) bandwidth. Our scheme achieves near-optimal (optimal up to polylogarithmic factors) asymptotics in every relevant dimension. Central to our approach is a new cryptographic primitive that we call an adaptable pseudorandom set: With an adaptable pseudorandom set, one can represent a large pseudorandom set with a succinct fixed-size key k, and can both add to and remove from the set a constant number of elements by manipulating the key k, while maintaining its concise description as well as its pseudorandomness (under a certain security definition).
Implementasi Monero Mining Pada Raspberry Pi 4 Model B

In the world of cryptocurrency, Monero is one of the cryptocurrencies that was created in 2014. Monero uses CryptoNight as a proof-of-work algorithm to get cryptocurrency coins. The proof-of-work algorithm requires miners to have tools with large computing power so they are competing to buy tools with large computing power, but there is a problem with the electricity generated is also large. The Raspberry Pi was tested as an alternative cryptocurrency mining tool that has economic value. In this study, we implemented the Raspberry Pi 4 Model B to calculate how much computing power was generated and how to mine using this tool. The design of this system makes the tool made quite compact and efficient which helps the convoluted mining process. The rising trend of cryptocurrencies has resulted in an increasing demand for economical mining tools. The Raspberry Pi crypto mining system helps provide an economical and energy efficient tool.
CASE: A New Frontier in Public-Key Authenticated Encryption

We introduce a new cryptographic primitive, called Completely Anonymous Signed Encryption (CASE). CASE is a public-key authenticated encryption primitive, that offers anonymity for senders as well as receivers. A “case-packet” should appear, without a (decryption) key for opening it, to be a blackbox that reveals no information at all about its contents. To decase a case-packet fully–so that the message is retrieved and authenticated–a verification key is also required. Defining security for this primitive is subtle. We present a relatively simple Chosen Objects Attack (COA) security definition. Validating this definition, we show that it implies a comprehensive indistinguishability-preservation definition in the real-ideal paradigm. To obtain the latter definition, we extend the Cryptographic Agents framework of [2, 3] to allow maliciously created objects. We also provide a novel and practical construction for COA-secure CASE under standard assumptions in public-key cryptography, and in the standard model. We believe CASE can be a staple in future cryptographic libraries, thanks to its robust security guarantees and efficient instantiations based on standard assumptions.
Proactive Secret Sharing with Constant Communication

This paper presents the first protocols for Proactive Secret Sharing (PSS) that only require constant (in the number of parties, n) communication per party per epoch. By harnessing the power of expander graphs, we are able to obtain strong guarantees about the security of the system. We present the following PSS protocols: Additionally, we discuss how secure channels, whose existence is usually assumed by PSS protocols, are challenging to create in the mobile adversary setting, and we present a method to instantiate them from a weaker assumption.
Design, development, and evaluation of a Java-centric software solution for advanced enterprise financial reporting

This research delves into the intricacies of crafting an advanced software solution, with Java at its core, aimed at improving financial reporting for modern enterprises. Through a systematic approach encompassing design, development, and evaluation phases, the study emphasizes the unparalleled capabilities of Java in ensuring scalability, user experience, data integrity, and security. The outcome reveals a Java-driven software that not only meets contemporary reporting demands but also showcases potential for future integrations and innovations in the dynamic financial landscape.
On Secure Computation of Solitary Output Functionalities with and Without Broadcast

Solitary output secure computation models scenarios, where a single entity wishes to compute a function over an input that is distributed among several mutually distrusting parties. The computation should guarantee some security properties, such as correctness, privacy, and guaranteed output delivery. Full security captures all these properties together. This setting is becoming very important, as it is relevant to many real-world scenarios, such as service providers wishing to learn some statistics on the private data of their users. In this paper, we study full security for solitary output three-party functionalities in the point-to-point model (without broadcast) assuming at most a single party is corrupted. We give a characterization of the set of three-party Boolean functionalities and functionalities with up to three possible outputs (over a polynomial-size domain) that are computable with full security in the point-to-point model against a single corrupted party. We also characterize the set of three-party functionalities (over a polynomial-size domain) where the output receiving party has no input. Using this characterization, we identify the set of parameters that allow certain functionalities related to private set intersection to be securely computable in this model. Our characterization in particular implies that, even in the solitary output setting, without broadcast not many “interesting” three-party functionalities can be computed with full security. Our main technical contribution is a reinterpretation of the hexagon argument due to Fischer et al. [Distributed Computing ’86]. While the original argument relies on the agreement property (i.e., all parties output the same value) to construct an attack, we extend the argument to the solitary output setting, where there is no agreement. Furthermore, using our techniques, we were also able to advance our understanding of the set of solitary output three-party functionalities that can be computed with full security, assuming broadcast but where two parties may be corrupted. Specifically, we extend the set of such functionalities that were known to be computable, due to Halevi et al. [TCC ’19].
Memory Checking for Parallel RAMs

When outsourcing a database to an untrusted remote server, one might want to verify the integrity of contents while accessing it. To solve this, Blum et al. [FOCS ‘91] propose the notion of memory checking. Memory checking allows a user to run a RAM program on a remote server, with the ability to verify integrity of the storage with small local storage. In this work, we define and initiate the formal study of memory checking for Parallel RAMs (PRAMs). The parallel RAM model is very expressive and captures many modern architectures such as multi-core architectures and cloud clusters. When multiple clients run a PRAM algorithm on a shared remote server, it is possible that there are concurrency issues that cause inconsistencies. Therefore, integrity verification is even more desirable property in this setting. Assuming only the existence of one-way functions, we construct an online memory checker (one that reports faults as soon as they occur) for PRAMs with $$O(\log N)$$ simulation overhead in both work and depth. In addition, we construct an offline memory checker (one that reports faults only after a long sequence of operations) with amortized O(1) simulation overhead in both work and depth. Our constructions match the best known simulation overhead of the memory checkers in the RAM settings. As an application of our parallel memory checking constructions, we additionally construct the first maliciously secure oblivious parallel RAM (OPRAM) with polylogarithmic overhead.
Factors Affecting Digital Transformation in Logistic Firms

Purpose- The main purpose of this study is to analyse the factor affecting DT in Indian logistic firms.&#x0D; Design/methodology/approach- Present study collects quantitative by distributing the questionnaire to the participant. In addition proposed hypothesis was tested using PLS-algorithm along with bootstrapping method.&#x0D; Findings- Findings confirm that OC, LOR positively influence DT and RTC, EE and CTI does not influence DT.&#x0D; Research limitations/implications- Results discussed in this paper will help firms manager and policy maker to adopt DT in digital economy.&#x0D; Originality/value- No prior study empirically investigates the influence of OC, LOR, RTC, EE and CTI on DT..
Security with Functional Re-encryption from CPA

The notion of functional re-encryption security (funcCPA) for public-key encryption schemes was recently introduced by Akavia et al. (TCC’22), in the context of homomorphic encryption. This notion lies in between CPA security and CCA security: we give the attacker a functional re-encryption oracle instead of the decryption oracle of CCA security. This oracle takes a ciphertext $$\textsf{ct}$$ and a function f, and returns fresh encryption of the output of f applied to the decryption of $$\textsf{ct}$$ ; in symbols, $$\textsf{ct}'=\textrm{Enc}(f(\textrm{Dec}(\textsf{ct})))$$ . More generally, we even allow for a multi-input version, where the oracle takes an arbitrary number of ciphertexts $$\textsf{ct}_1,\ldots \textsf{ct}_\ell $$ and outputs $$\textsf{ct}' = \textrm{Enc}(f(\textrm{Dec}(\textsf{ct}_1), \ldots , \textrm{Dec}(\textsf{ct}_\ell )))$$ . In this work we observe that funcCPA security may have applications beyond homomorphic encryption, and set out to study its properties. As our main contribution, we prove that funcCPA is “closer to CPA than to CCA”; that is, funcCPA secure encryption can be constructed in a black-box manner from CPA-secure encryption. We stress that, prior to our work, this was not known even for basic re-encryption queries corresponding to the identity function f. At the core of our result is a new technique, showing how to handle adaptive functional re-encryption queries using tools previously developed in the context of non-malleable encryption, which roughly corresponds to a single non-adaptive parallel decryption query.
A Multi-Strategy Integrated Optimized Salp Swarm Algorithm and Its Application for Engineering Problems.

Salp Swarm Algorithm has the advantages of few adjustment parameters and easy implementation, which has been applied in many fields, such as data mining, image processing, and engineering calculation. However, this algorithm is easy to fall into local optimization and sometimes the accuracy of optimization is not high. To solve the above problems in SSA, this paper proposes an orthogonal opposition-based adaptive slap swarm algorithm OOASSA. First, an orthogonal opposition learning strategy was introduced when updating the leader position to enhance the adequacy of global search and improve the algorithm's ability to get out of the local extreme value. Then, it was introduced adaptive inertia weight when updating the follower position and introduced an adaptive adjustment strategy in the ratio of a leader-follower number to ensure that the algorithm had a good global development ability in the early stage of iteration. Good local exploration ability in late iteration. In this paper, 10 test functions and 3 engineering optimization problems in CEC2017 are used for simulation experiments, and the proposed algorithm's global exploration, local mining, and local optimization capabilities are significantly better than many of the most advanced SSA variants.
A Word Difficulty Classification Research Based on K-Means Method

Wordle is a globally popular game and many researchers have conducted research on its game mechanics. However, few studies have explored the influence of attributes on the difficulty of the word. Therefore, this paper uses K-means algorithm to classify word difficulty based on certain word attributes. In the paper, the main attributes character repeat times, the presence of "th" or "er", the initial letter (s/c/a/t), and the final letter (e/y/r/t) that affect word difficulty are selected, and a comparison is made regarding the number of difficulty categories, and the most appropriate number of categories is three. Finally, it has been validated by Spearman that this method possesses strong reliability.
Application Analysis of Security Technology in Computer Software Development

At present, citizens benefit from the facilities provided by information network technology in all aspects of daily life. However, the particularity of the computer network environment also causes many unfavorable factors in the application of network technology. If these negative factors are not restricted, they will have a direct impact on the development of information technology industry. Therefore, creating a good business environment for this network has become a key issue in the field of computer software development. Facts have proved that computer security not only affects the economic development of enterprises, but also affects the security of information provided to users. In order to cope with these shortcomings, designers have developed many computer security tools to solve the problems of computer network operation caused by security risks.
Prediction of Wordle Puzzles Based on Neural Networks and K-Means Improved Models

Wordle is an online word puzzle game that gained viral popularity in January 2022. The goal is to guess a hidden five letter word. In order to study the distribution of the reported results and the difficulty of the words, based on BP neural network theory, combined with the advantages of Genetic Algorithm in Stability and speed, a neural network prediction model is constructed and the model can be used to predict the percentage distribution of the number of player guesses for a given word on a given number of days. In addition, a Canopy-Kmeans-based word difficulty classification model was further developed. It can be combined with the previous neural network model to determine whether the difficulty of guessing a given word is easy, normal or hard.
Revolutionizing Motorcycle Spare Part Sales at Bengkel Stel Velg Budyo with an Android-Based App

The sales transactions of motorcycle spare parts in the service process are a very important part, especially in recording transaction data and available spare parts stock. Transactions at Bengkel Stel Velg Budyo are still manually recorded on paper. To improve the performance of Bengkel Stel Velg Budyo, a motorcycle spare parts sales application system is needed to help the workshop simplify sales transactions based on Android. The end result of the design and development of the motorcycle spare parts sales application is to design an application used to manage the transaction process as well as manage the stock of motorcycle spare parts at Bengkel Stel Velg Budyo so that transactions can be done effectively and efficiently.&#x0D; Highlights:&#x0D; 1. Manual recording of transactions on paper is a current issue at Bengkel Stel Velg Budyo&#x0D; 2. An Android-based application system is needed to improve the workshop's performance&#x0D; 3. The designed application aims to simplify sales transactions and manage motorcycle spare parts stock for effective and efficient transactions.
Revolutionary Scholarship Award Accuracy in Vocational High Schools with Decision Support Systems

The aim of this research is to investigate the determination of scholarships at SMK Nasional Mojosari and to facilitate teachers in providing scholarships to deserving and high-achieving students, while also testing the quality of the system. The author uses the Waterfall method to build the system, which is a systematic and sequential approach that begins with analyzing, designing, coding, and testing the system. To analyze the system, several stages of data collection, problem formulation, user requirements, and concept analysis are required. The application design stage uses the CRISP_DM data mining model, and the testing stage uses the PIECES method. The accuracy of the Decision Tree classification for scholarships was determined using a confusion matrix, and the testing results showed an accuracy rate of 72.77% using RapidMiner. From these results, it can be concluded that the Decision Support System developed and tested is effective for processing and calculating data.&#x0D; Highlights:&#x0D; 1. The current process of determining scholarship recipients at SMK Nasional Mojosari is manual and time-consuming, which highlights the need for a more efficient and accurate system.&#x0D; 2. The author uses the Waterfall method, a systematic and sequential approach, to build a Decision Support System that facilitates the process of providing scholarships to deserving and high-achieving students while also testing the quality of the system.&#x0D; 3. The testing results showed an accuracy rate of 72.77% using RapidMiner, indicating that the Decision Support System is effective for processing and calculating data, and can help teachers make informed decisions about scholarship recipients.
Revolutionizing Sales and Trading: Sino Aquarium Upgrades to Computerized System for Better Performance

In today's information age, various types of businesses, especially those in sales and trading, are highly competitive. Therefore, every company strives to improve its performance in various ways, including creating an information system to manage its business. Such a system can connect all departments involved in managing the business, making it easier and more organized to perform tasks with great detail. Sino Aquarium, a store selling ornamental fish, still uses a manual system and wants to switch to a computerized system. Computers are expected to meet the store's needs as a highly productive tool for managing data quickly, accurately, and efficiently. Therefore, Sino Aquarium, which operates in a highly trading-dependent field, needs a computer as a tool to manage data and obtain necessary information quickly, accurately, and precisely.&#x0D; Highlights: &#x0D; 1. In today's highly competitive business environment, companies strive to improve their performance through various means, including implementing information systems.&#x0D; 2. Implementing an information system can connect different departments involved in managing the business, resulting in better organization and task performance.&#x0D; 3. Sino Aquarium recognizes the importance of a computerized system to manage data accurately and efficiently, considering its highly trading-dependent field.
Revolutionizing Basic Computer and Networking Education: An Android-Based E-Module Study at Vocational High School

A new subject added to the 2013 curriculum in computer engineering and networking prompted teachers to search for engaging teaching materials. This study aimed to develop an Android-based e-module for the basic computer and networking subject in the X grade of SMK Ar-Roudhoh and assess its suitability. Research and Development method using the ADDIE model was employed, with data collected through observation, questionnaires, and validation tests by media and subject matter expert teachers. An interactive Android-based e-module was developed and met the validity criteria. The media expert validator gave a score of 81.25%, and the subject matter expert validator gave a score of 80%, both in the acceptable category with revisions. The e-module is suitable as a teaching material for the basic computer and networking subject.&#x0D; Highlights:&#x0D; 1. The study aimed to develop an Android-based e-module for the basic computer and networking subject in the X grade of SMK Ar-Roudhoh and assess its suitability.&#x0D; 2. Research and Development method using the ADDIE model was employed, with data collected through observation, questionnaires, and validation tests by media and subject matter expert teachers.&#x0D; 3. The interactive Android-based e-module was developed and met the validity criteria. The e-module is suitable as a teaching material for the basic computer and networking subject.