Reviewerly/exHarmony huggingface dataset:
Cloud Computing Data Center Structure Based on Internet of Things and Its Scheduling Mechanism

With the rapid development of new generation information technologies such as cloud computing, Internet of Things and big data, the fourth generation data center based on cloud computing is also growing rapidly. Cloud computing provides users with a flexible, reliable, ultra-large and scalable pool of computing resources. In the cloud computing environment, the Internet transfers information and data to direct transfer services. Since the emergence of cloud computing, through the continuous development of science and technology. Data center is an architecture that integrates network communication, storage and high performance computing. It can provide users with a variety of storage, computing and network services. How to deal with massive data and services, to facilitate users to complete all kinds of business more quickly and with higher experience, has become a major problem in the era of Internet development. This paper designs the cloud computing architecture of the Internet of things data center, hoping to propose a new scheduling mechanism for the intelligent management of the data center.
Tweaking Key-Alternating Feistel Block Ciphers

Tweakable block cipher as a cryptographic primitive has found wide applications in disk encryption, authenticated encryption mode and message authentication code, etc. One popular approach of designing tweakable block ciphers is to tweak the generic constructions of classic block ciphers. This paper focuses on how to build a secure tweakable block cipher from the Key-Alternating Feistel (KAF) structure, a dedicated Feistel structure with round functions of the form $$F_i(k_i\oplus x_i)$$ , where $$k_i$$ is the secret round key and $$F_i$$ is a public random function in the i-th round. We start from the simplest KAF structures that have been published so far, and then incorporate the tweaks to the round key XOR operations by (almost) universal hash functions. Moreover, we limit the number of rounds with the tweak injections for the efficiency concerns of changing the tweak value. Our results are two-fold, depending on the provable security bound: For the birthday-bound security, we present a 4-round minimal construction with two independent round keys, a single round function and two universal hash functions; For the beyond-birthday-bound security, we present a 10-round construction secure up to $$O(\min \{ 2^{2n/3}, \root 4 \of {2^{2n}\epsilon ^{-1}} \})$$ adversarial queries, where n is the output size of the round function and $$\epsilon $$ is the upper bound of the collision probability of the universal hash functions. Our security proofs exploit the hybrid argument combined with the H-coefficient technique.
Comparison of Support Vector Machine Models in the Classification of Susceptibility to Schistosomiasis

Schistosomiasis has become endemic sending millions of people into untimely graves. A lot of contributing efforts in term of research has been made to eradicate or reduce the rate of this dangerous infection. In this research work the concept of Machine Learning as one of the sub-division of Artificial Intelligence, is being used to determine the level of susceptibility of Schistosomiasis. The research made a comparison of the various support vector machine models as useful tools in the Machine Learning to determine the level of susceptibility of Schistosomiasis. The results obtained which include Confusion Matrix (CM), Receiver Operating Character (ROC), and Parallel Coordinate Plot were interpreted in form of accuracy, processing speed and execution time. It was finally concluded that Medium Gaussian is the best of all the six models considered.
Digital Forensics Education Modules for Judicial Officials

As our lives become more dependent on digital technology, cyber crime is increasing in our society. There is now an ever-increasing need to counter cyber crime through digital forensics investigations. With rapid developments in technology such as cloud computing, the Internet of Things, and mobile computing, it is vital to ensure proper training of law enforcement personnel and judges in the theory and practice of digital forensics. In this paper, we describe our methods and approach to create curricula, educational materials, and courses for training law enforcement and judicial personnel in digital forensics. We partnered with legal experts to design a series of modules/courses on digital forensics to educate the actual target demographics. Training materials have been designed to be not only scalable to nationwide law enforcement and judicial professionals, but also amenable to regular updates to respond to rapidly changing attacks and forensic techniques.
Teaching A Real World Software Design Approach Within An Academic Environment

In this paper, we discuss how object-orientation and the industrial standard for software development, "Software Lifecycle Processes, IEEE/EIA 12207.0-1996"can be used to enhance the students' design experience in a 400-level course in a software engineering program.Although every phase of the software development lifecycle is important, we have found that the two lifecycle phases which present the greatest challenges in a classroom environment are the software requirements analysis phase and the software design phase.Practical experience with requirements definition is an important part of the software engineering process, but it is beyond the scope of this paper; we shall focus on the latter phase.Furthermore, we claim that students benefit from first developing proficiency in the software design phase --before they face the major challenges of the software requirements analysis phase.This design proficiency can be developed by employing the industrial evaluation criteria, described in IEEE/EIA 12207, for both the high-level and detailed designs produced by the students.We also recommend that the students work from clear, consistent, and reasonably complete requirements provided by the instructor in the project assignment.It is critical that the students continue beyond the design phase and actually implement, test and document their projects, because some design flaws are not obvious to inexperienced software developers until they attempt to write code based on the flawed design.This paper discusses how we focused on the design phase of software development and encouraged design practices that would be effective for industrial projects, as well as our much smaller academic projects.
Dual Master’s Degree Programs Offer Students Combined Resources Of Separate Universities And Build Working Relationships Between Faculties

Abstract Because different universities have different strengths, students with access to the strengths at two different universities can exploit a combination of resources unavailable at either institution. In this paper, we describe a master’s degree program in which graduate students in engineering take a part of their courses from faculty at the University of the Americas (UDLA) in Puebla, Mexico, and a part of their courses from faculty at Texas Tech University in Lubbock, Texas, USA. When students complete the program, they meet the requirements to receive two master’s degrees in engineering, one from the University of the Americas and one from Texas Tech University. Each student receives not only a separate diploma from each institution, but also a certificate signed by representatives from both institutions in which the institutions certify granting this special dual degree. Faculty members from both institutions supervise each student together. Travel to joint meetings of the supervising faculty for planning the thesis research and for conducting the final oral examination is funded by a grant from industry. The student and the faculty advisors choose which institution will host the oral examination. The same grant provides scholarship support for student participants in the program. Graduates of the program, who have pursued their studies in two countries in two different languages, are uniquely prepared for the practice of engineering today, when more and more opportunities span national borders. Participating faculty build working relationships based on jointly supervising work of mutual interest and, thereby, strengthen ties between the institutions. The first two participants completed this new academic program in August 2000. Appropriately, one student began study at the University of the Americas and then came to Texas Tech University. The other began study at Texas Tech University and then went to the University of the Americas.
Using SWOT Analysis for Defining Strategies of Mobile Learning

After exploring the concept of m-learning, this paper focuses on defining a SWOT analysis of mobile learning with detail discussion of each element. Finding important relationships by matching well know SWOT variables in a systematic fashion is a next step of research where using a algorithm which can provide a help in defining appropriate strategy. The result of our research is a conceptual framework for defining strategies for mobile learning, which will help primarily universities or other educational institutions in estimating their own position and creating the strategy for adopting m-learning into their curriculums which make a valuable contribution for the future research in this area.
Fuzzy Answer Set Programming: From Theory to Practice

In this chapter, we give an introduction to Fuzzy Answer Set Programming (FASP), as well as a description of a state-of-the-art FASP solver and its use in practice. FASP is an extension of Answer Set Programming (ASP), a well known declarative language that allows users to specify combinatorial search and optimization problems in an intuitive way. By combining ASP with fuzzy logic, FASP is capable of expressing continuous optimization problems. In the chapter, we provide a high-level explanation of how ASP is typically used for solving problems, and the role that an extension to FASP can play in applications. We present the syntax and semantics of FASP, and describe how FASP programs are used to encode problems. We subsequently explain how our solver finds the answer sets of a FASP program, and we illustrate the whole workflow using an application for modeling of gene regulatory networks.
Parent’s Use of Strategies to Monitor Children’s Activities Online

Although studies have been conducted on the effectiveness of different types of filtering software, limited knowledge is available on parents' use of strategies to monitor their children's activities online.Thus, identifying understanding parents' use of strategies to monitor children's activities online and the extent in which parents use content filtering software will contribute to the body of knowledge.The purpose of this study is to understand parent's use of strategies to monitor children's activities online and the extent in which they use content filtering software in Gauteng Province, South Africa.The study adopted a Social Cognitive Theory to develop a conceptual framework and identify existing theoretical concepts.The conceptual framework adapted Bandura's (2001) framework to inform data analysis.Data were collected through semi-structured interviews and qualitative, thematic content analysis was used for data analyses.The results of the study indicated that parents do use various strategies to monitor children's activities online and further apply knowledge, experience, and social support as a rationale for using those strategies.The study further revealed that there is a gap between parents, technology industry and government regarding the use of content filtering software.Thus, the study recommends parents, industry and government work together to protecting children online through various strategies and address the concerns regarding the use of content filtering software.Parents need to understand the importance of content filtering software and discuss this with their children to be able to protect them online without restricting access to relevant information.
Message from the ISMAR 2020 Science and Technology Program Chairs and TVCG Guest Editors

In this special issue of IEEE Transactions on Visualization and Computer Graphics (TVCG), we are pleased to present the TVCG papers from the 19th IEEE International Symposium on Mixed and Augmented Reality (ISMAR 2020), which had been originally planned to hold in Recife/Porto de Galinhas, Brazil. In order to preserve the safety and well-being of all participants under the global pandemic of COVID-19, ISMAR 2020 will be held as a virtual conference between November 9 and 13, 2020. ISMAR continues the over twenty year long tradition of IWAR, ISMR, and ISAR, and is undoubtedly the premier conference for Mixed and Augmented Reality in the world.
Statistical-Based Heuristic for Scheduling of Independent Tasks in Cloud Computing

Cloud computing is an emerging and innovative technology that is used for solving large-scale complex problems. It considers as an extension to distributed and parallel computing. Additionally, it enables sharing, organizing and aggregation of computational machines to satisfy the user demands. One of the main goals of the task scheduling is to minimize the makespan (i.e. the overall processing time) and maximize the machine utilization. This paper addresses the problem of how to schedule many independent tasks when using different machines. It introduces two batch mode heuristics algorithms for scheduling independent task in the computational cloud environment, high mean absolute deviation first heuristic and QoS Guided Sufferage-HMADF heuristic. Besides, the paper presented other existing batch mode heuristics such as, Min-Min, Max-Min and Sufferage. The four heuristic modes are simulated and the experimental results are discussed using two performance measures, makespan and machine resource utilization.
How many weights can a cyclic code have ?

Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension and alphabet are given. An application to irreducible cyclic codes is considered. Sharper upper bounds are given for the special cyclic codes (called here strongly cyclic), {whose nonzero codewords have period equal to the length of the code}. Asymptotics are derived on the function $\Gamma(k,q),$ {that is defined as} the largest number of nonzero weights a cyclic code of dimension $k$ over $\F_q$ can have, and an algorithm to compute it is sketched. The nonzero weights in some infinite families of Reed-Muller codes, either binary or $q$-ary, as well as in the $q$-ary Hamming code are determined, two difficult results of independent interest.
Evaluating Graph Database Systems for Biological Data

The graph database system can express the complex relationships in the real world through the simple and intuitive description of “entities” and“relationships”. Now, the graph database system is used to analyze complex relationship between entities, especially, in the scientific research field. For example, the RDF-based graph database system has been used for biological data processing. Many previous works have proved that the graph database system is very suite for biological researchers to store and analyze biological data. In this paper, we evaluate two graph database systems (Apache Jena and gStore) by the biological RDF data set, the biological RDF data set contains 10 millions pieces of data on the types of Uniport, Enzyme, Taxonomy and Gen. And we design five query workloads, which are “1-step”,“2-steps(p1)”, “2-steps(p2)”,“union” and “filtering” and one data load workload. The metrics which we evaluated including user-observed metrics (workload execution time), system metrics (CPU utilization, I/O wait ratio and memory bandwith) and micro-architecture metrics (IPC, cache miss and branch misprediction ratio). The experiment results show that gStore performs better in complex query workloads, and Jena is more suitable for the simple ones.
Implementation of web scraping on github task monitoring system

Evolution of information and technology increasingly sophisticated, also influential in the field of education. One of the implementation of information and technology development in the field of education is e-learning or electronic learning. GitHub social network can be one of the e-learning media in studying software development because GitHub provides access control The number of contributors who commits or change in a repository to make the duration of the calculation process to fill the parameter value that has been determined. Based on the issue, this research aims to build a page capable of integrating information from the GitHub repository page. Integration of information will be made by utilizing web scraping technology. With a web page that integrates information from the GitHub repository page to get repository, collaborators, commits, and issues information, the lecturer does not need to calculate how often the participant contributes to the task.
BOOCH METODOLOJİSİ İLE BAŞARILI NESNEYE YÖNELİK PROJELERİN ÖZELLİKLERİ

Booch deflned iterative and incremental technic for analysis, design and implementation of object oriented systems. He has suggested 2 different ways to construct Micro and Macro applications. Aim of this paper; to determine steps of successful project’s and to present it with micro application.
Findings Annihilator(s) via Fault Injection Attack (FIA) on Boolean Function of Grain v0

In developing stream cipher algorithms, Boolean function is one of vital elements. Attacks on LFSR-based stream cipher is the challenge for the cryptanalyst to get low-degree annihilator(s). In this paper, we proposed Fault Injection Attack (FIA) on Boolean function of Grain v0, which is the original variant of Grain family algorithm. Fault injection attack (FIA) is used on Boolean function of Grain v0 by replacing certain coefficient with value of one (1) which results in the generation of several injected Boolean functions. With these injected Boolean function, we proceed using HAO’s algorithm to find annihilator(s). As a result, we obtained several new annihilator(s) of Grain v0’s Boolean function. This new annihilator(s) will be utilized to launch algebraic attacks upon Grain v0.
Research of LOB Data Compression and Read-Write Efficiency in Oracle Database

Aiming at the problems of huge storage space, low exchange speed and low read-write speed of the current specific oracle database, the read-write speed and exchange speed tests are performed on the compressed and uncompressed Clob and Blob data by three compression algorithms, including Bzip2, Gzip and GzipIO respectively. The read speed test is performed by the direct read, substr read, and substr+threadPool read techniques. The results show that: (1) Blob is superior to Clob in terms of storage, exchange, or read-write speed; (2) For the specific database, Blob+Gzip is the optimal storage structure of the minute and second data. The read-write speed is greatly improved, and the overall capacity of the database is reduced to 7% (or less). The exchange rate of the second data is at least 7.89 times of the present rate, and the station data can be exchanged to the disciplinary center within 2–3 hours (currently 1.5 days); (3) The simplest and most widely used direct read method by software developers has poor database read efficiency, while the substr+threadPool technique shows higher database read efficiency no matter for Clob or Blob, for compressed or uncompressed, which brings a leap-forward improvement in the read speed of LOB data. The results of this paper are of high reference significance to the LOB data storage design and software development.
Abstract: Adversarial Examples as Benchmark for Medical Imaging Neural Networks

Deep learning has been widely adopted as the solution of choice for a plethora of medical imaging applications, due to its state-of-the-art performance and fast deployment. Traditionally, the performance of a deep learning model is evaluated on a test dataset, originating from the same distribution as the training set. This evaluation method provides insight regarding the generalization ability of a model.
Analysing Big Social Graphs Using a List-based Graph Folding Algorithm

In this paper, we explore the ways to represent big social graphs using adjacency lists and edge lists. Furthermore, we describe a list-based algorithm for graph folding that makes possible to analyze conditionally infinite social graphs on resource constrained mobile devices. The steps of the algorithm are (a) to partition, in a certain way, the graph into clusters of different levels, (b) to represent each cluster of the graph as an edge list, and (c) to absorb the current cluster by the cluster of the next level. The proposed algorithm is illustrated by the example of a sparse social graph.
An Iterative Hybrid Agile Methodology for Developing Archiving Systems

With the massive growth of the organizations files, the needs for archiving system become a must.A lot of time is consumed in collecting requirements from the organization to build an archiving system.Sometimes the system does not meet the organization needs.This paper proposes a domain-based requirement engineering system that efficiently and effectively develops different archiving systems based on new suggested technique that merges the two best used agile methodologies: extreme programming (XP) and SCRUM.The technique is tested on a real case study.The results shows that the time and effort consumed during analyzing and designing the archiving systems decreased significantly.The proposed methodology also reduces the system errors that may happen at the early stages of the development of the system.
Designing Method and Algorithm of Semantic Comparison for Detecting Similarities in the Case of Fuzzy Information using Software Engineering and Medical Ontologies*

In this article we will discuss the work of a semantic comparison method, through which the detection of plagiarism is revealed in the fuzzy information, which we have designed an algorithm with a semantic dimension to detect plagiarism in the fuzzy information and detect impersonations such as changing the structure of speech or replacing words with synonyms and limiting technical spelling errors such as not completely writing the end of the word or unofficial and unknown abbreviations, and analyze shows the degree of similarity of the original text, and analyzes the overall evaluation of the degree of similarity of texts from the apparent structures of the text.Experiments have shown that the proposed method with a semantic dimension in the case of fuzzy information is better than sherlock method in terms of file size criterion of 6% if using word synonyms in the file and 1% in case of rewriting the file.As for the standard time taken to examine the files through the acceleration calculation, it is noted that the proposed method for the semantic dimension in the case of fuzzy information is faster in performance than the Sherlock method in the case of the use of synonyms 1.02 times and in the case of rewriting words with a value of 1.01 times in the case of file size 382 words.The results of the experiments show that the average execution time of the proposed algorithm, for finding plagiarism, is less by 3.47% compared with the Sherlock algorithm in the case of the use of synonyms and less by 1.83% compared with the Sherlock algorithm in the case of rewriting words.The algorithm works effectively as the file size increases, the gain ratio is obtained up to 2.73% in the synonym of words and 2.69% in the case of rewriting words.From the results presented in the tables, we conclude that the average error rate of the proposed algorithm is 2% lower than the error rate sherlock algorithm.The complexity of the proposed algorithm is O(m*n).
Moving Forward With the Baton [President's Message]

Presents the President’s message for this issue of the publication.