Reviewerly/exHarmony huggingface dataset:
ESADSA: Enhanced Self-adaptive Dynamic Software Architecture

With the advent of new technologies and the trend in integration of related business, the software development has become very complex. However, complex systems are realized due to distributed computing technologies like Web services. With machine-to-machine (M2 M) interaction, human intervention is greatly reduced in distributed applications. Nevertheless, there is need for continuous changes in complex software systems. Manual incorporation of changes is both time consuming and tedious task. The self-adaptive features of software can cater to the needs of ad hoc demands pertaining to changes. Therefore, it is desirable to have a self-adaptive software architecture for distributed systems to adapt to changes automatically without traditional reengineering process involved in software update. The existing solutions do have limitations in self-adaptation and need human intervention. Rainbow is one of the examples for self-adaptive dynamic software architecture. However, it does not have knowledge mining and quality of software analysis for further improvements. It is essential to have such enhancements in the wake of self-adaptive systems of enterprises producing huge amount of data related to operations, service quality and other information required for analysing the architecture. We proposed a self-adaptive dynamic software architecture named enhanced self-adaptive dynamic software architecture (ESADSA) which is influenced by Rainbow. It incorporates modules such as QoS analyser and knowledge miner with two data mining algorithms for enhancing capabilities of the architecture. ESADSA decouples self-adaptation from target system by preserving cohesion of target system with loosely coupled interaction. A real-time case study is considered for proof of the concept. The experimental results revealed significant improvements in dynamic self-adaptation of the proposed architecture.
Greedy Queens on an Infinite Chessboard

In 1848, chess master Max Bezzel proposed a problem of placing 8 queens on a standard 8 × 8 chessboard so that no two queens can attack each other [3]. Soon after this, Carl Gauss extended the prob...
Vascular Cross-Section Extraction Algorithm Based on Centerline

Vascular cross-section is an important basis for computer-assisted diagnosis of vascular diseases. In this study, a new algorithm of calculating cross-sectional area of blood vessels was proposed. The algorithm first extracts centerline of the blood vessel from the image through thinning algorithm, and obtains neighborhood coordinates of each point on the centerline. The principal component analysis is employed on and the blood vessel cross-section is achieved via coordinating transformation with the tangent vector. Experiments were performed with the real data and simulated data, and the results demonstrate that the proposed method can efficiently detect stenosis of blood vessels with high accuracy, and achieve 2.06% deviation from the simulated ring model.
Natural Gas Customer Persona and Intelligent Assessment Research Based on K-Means Method

In this research project, we proposed a novel customer persona algorithm based on unsupervised clustering algorithms with additional important indicators for scoring within each class. This algorithm is tailored for the PetroChina Southwest Oil and Gasfield Company, using datasets sample from their sales information systems. Comparing to the previous methods, the proposed scoring mechanism is significant more subjective, only requiring business preference information for ranking indicators selection. This also allow better flexibility, being able to configuring different scoring mode based on preference or macroeconomic situation. By using this system, new business implementation customized to different category of user may be developed.
Scene based camera pose estimation in Manhattan worlds

This paper presents a principle for scene-related camera calibration in Manhattan worlds. The proposed estimation of extrinsic camera parameters from vanishing points represents a useful alternative to the traditional target-based calibration methods, especially in large urban or industrial environments. We analyse the effects of errors in the calculation of camera poses and derive general restrictions for the use of our approach. In addition, we present methods for calculating the position and orientation of several cameras to a world coordinate system and discuss the effect of imprecise or incorrectly calculated vanishing points. Our approach was evaluated with real images of a prototype for human-robot collaboration installed at ZBS e.V. The results were compared with a perspective n-Point (PnP) method.
A Framework on Enterprise-Grade Smart Contract Using Blockchain

Blockchain technology is very trending and promising. It can revolutionize the traditional way of manipulation of data in many industries. There are industries which blockchain can disrupt: banking, cyber security, smart contract, insurance, cloud storage, government, healthcare, media streaming. The decentralized approach of blockchain using peer-to-peer system to verify the correct record of the ledger, which builds a trust in the system. A system can be compiled and made to get adopted with the concept of smart contract. The aim of the work is to develop a system that is flexible enough to get implemented in the industries like finance, cyber security, data storage, buying and selling of properties, healthcare, etc. This will use a one-way encryption method known as SHA-256. A block with the 256-character code bind with the other metadata of the block will be termed as a smart contract for the item.
Research on Two-Dimensional Bar Coding Technology of Pdf417

This paper mainly introduces the structure and encoding principle of PDF417 two-dimensional barcode, and gives encoding algorithms such as data code-word encoding, error correction code-word encoding and symbol code-word encoding. Finally, the barcode pictures are generated through experiments.
Truncated Query of Phonetic Search for Al Qur’an

This study examines how to look for a verse of the Quran or a clipped verse in the Qur'an and ranks search results correctly. Because the Qur'an consists of 30 juz, 114 letters and 6236 verses, then if you search for a particular verse then a Quranic verse search system is needed. At present, there is already a verse search system for the Quran, but the search results ranking process still has a number of errors in highlighting the verses that are searched for, the similarity scores that are less precise and have not been good at handling clipped or incomplete verses. When conducting a search that needs to remember a verse from the Koran, one can remember the whole verse of the Quran but there are also some cases that cannot remember a verse completely or cut off. For example, a complete verse search query zalikal kitabu la raiba fihi the result will be different from the clipped verse query like this zalikal kitabu fihi. Because some truncated characters will be ignored by the system and can reduce the value of similarity. This shows that the existing system does not provide good accuracy in string matching. With this research, it will overcome the LCS search problem which ignores previously unreadable characters. Using the LCS method of query search for all data so as to produce candidate results, then research the neglected character of the candidate results to find similarities between neglected characters and one of the candidates previously obtained. So, improve ranking in the lafzi and increase the ability of the lafzi to search for clauses that are clipped or incomplete.
Privacy Protection Workflow Publishing Under Differential Privacy

The workflow has been widely used in data quality assessment, error data location and other fields. As data sharing deepens, so does the need to share data lineages. The topology of the lineage workflow contains private information that includes the data generation process, that is, the privacy of the lineage workflow structure, which directly exposes the structure privacy leakage of the lineage workflow. There are the following deficiencies in the privacy protection methods of the lineage workflow structure: (1) The privacy protection method based on the restricted release has a weak theoretical foundation and can only qualitatively measure the privacy protection effect of the lineage workflow structure; (2) Focusing on the maintenance of the local mapping relationship of modules, the maintenance of the key path of the lineage workflow is weak. Aiming at the above problems, this paper proposes a privacy protection method PPWP-DP for the lineage workflow structure, which satisfies the differential privacy. Key path and key path priority concepts are introduced. On this basis, the θ-project projection algorithm is proposed to reduce the degree of the lineage workflow. At the same time, according to the user's preference for key path priority, the maintenance of high priority key path reachability is achieved. The concept of oi-sequence is introduced to extract the structure characteristics of the lineage workflow, and add Laplacian noise to the oi-sequence to satisfy the differential privacy constraint. Adjust the global sensitivity of the oi-sequence after noise addition by the θ-project algorithm to reduce the Laplacian noise scale. Finally, the perturbed oi-sequence is used to reconstruct the lineage workflow for publication, which realizes the workflow privacy security and the maintenance of key path accessibility. Theoretical analysis and experiments verify the effectiveness of the proposed algorithm.
Pervasive System Overview

Communication has been improved, and services have been enriched with the help of revolutionary smart objects and computing environment that assist the users to make daily tasks much easier. The vision of pervasive system imposes on the creating of an environment that has communication and computing capabilities with seamless integration of human interventions. Looking at the users’ requirements and required services during several scenarios, the pervasive system is an essential and effective solution that needs to discuss. Personalization and context-based services are the need of an hour. This chapter starts with the vision of pervasive system and many emerging trends. The chapter continues to discuss how the pervasive systems not only benefit the users but also businesses. The next part of this chapter focuses on the basic technical building blocks. The issues and challenges of the pervasive system are presented in this chapter. The overall overview of this book is discussed in the last part of this chapter.
Quantum dynamics of measurements in terms of inter-qubit distances with a collective damping

We examine the influence of inter-qubit distances and reservoir temperature on the dynamics of the parameter estimation for the qubit systems considering the interaction of dipole-dipole and collective damping effect. We find that the dynamical behaviour and preservation of the parameter estimation-precision is greatly dependent on the qubits distances and the temperature of the reservoir. Moreover, we study the effect of the qubits-distance and temperature of the reservoir on the dynamics of the fidelity and squeezing entropy for atomic systems. The obtained results show how the considered physical model in the quantum measurement theory can be useful to describe and implement realistic experiments with optimal conditions.
Transferring Java Comments Based on Program Static Analysis

In the process of software development and maintenance, code comments can help developers reduce the time of reading source code, and thus improve their work efficiency. For large Java software projects, comments tend to appear in front of the main program entry or method definition. Readers need to search and read other source files containing the comments, which is very inconvenient. For this purpose, based on program static analysis technique, this paper has realized the process of automatically transferring comments in source code to their corresponding methods' callers. This method first processes the source code using the program static analysis tool, which identifies the method call and the variable Define-Use and other dependency relations and confirms the comment-transferring paths; then extracts the text information in the comments that are in front of method definitions. Finally, it completes the extraction and transferring of comments in Java projects. The average precision of the experiment with 14 open source Java projects is 82.76%.
A Study on Energy Efficient Resource Allocation for Cloud Data Center

Cloud computing paradigm has become an inherent component of modern IT industry. It provide various features such as reliability, pay-per-use, scalability, free-from-maintenance and many more. Services offered by cloud service providers are categorized as - software, platform, or infrastructure as a service. Also, ownership of the underlying hardware could be private, public or hybrid in nature. All these combination of services lead to enormous amount of effort needed to manage the underlying hardware resources at cloud data centers. Resource scheduling, resource allocation, load balancing, and VM management are the terms which are being used interchangeably in recent research articles. There is a need for clarifying the difference between each of above related-terms. This paper presents a holistic view of core components of cloud computing, energy consuming factors in data center, performance measuring metrics, and resource allocation taxonomy. The resource allocation taxonomy further illustrates load balancing across data centers, resource scheduling in a host, and task scheduling in a virtual machine. This paper presents a study on energy efficient resource allocation for cloud data center.
Exploring dimensional constructs of digital literacy skills for higher education

Peer reviewed article published in the Library Philosophy and Practice electronic journal published by the University Libraries of the University of Nebraska--Lincoln, Lincoln, Nebraska, USA, 2019.
Quantum Tavis–Cummings Model

Abstract This chapter extends the algebraic Bethe ansatz to the quantum Tavis–Cummings model, an N atom generalization of the Jaynes–Cummings model to describe the strong interaction between light and quantum matter. In the case of the quantum Tavis–Cum- mings model there is no underlying vertex model to suggest the constituent building blocks of the algebraic Bethe ansatz approach, e.g.like the L-matrix or ultimately the transfer matrix. The algebraic Bethe ansatz is then first applied to the Tavis–Cummings Hamiltonian with an added Stark term using a conjecture for the transfer matrix. The original Tavis–Cummings model and its algebraic Bethe ansatz are obtained in the limit of vanishing Stark term, which requires considerable care.
Connecting Fixpoints of Computations with Strict Progress

We study the semantics of recursion for computations that make strict progress. The underlying unified computation model has an abstract notion of progress, which instantiates in ways such as longer traces, passing of real time, or counting the number of steps. Recursion is given by least fixpoints in a unified approximation order. Other time-based models define the semantics of recursion by greatest fixpoints in the implication order. We give sufficient criteria for when least fixpoints in the approximation order coincide with greatest fixpoints in the implication order.
Shifted Chebyshev Wavelets and Shifted Legendre Wavelets—Preliminaries

Wavelet analysis, as a relatively new and emerging area in applied mathematical research, has received considerable attention in dealing with partial differential equations and fractional partial differential equations (FPDEs).
A Particle Swarm Optimization based on many-objective for Multiple Knapsack Problem

Aiming at the intractable problem of many constraints of Multiple Knapsack Problem, a method of transforming many constraints into many objectives and using Particle Swarm Optimization algorithm to search optimal solution is proposed in this paper. A loose Pareto dominance method is adopted to reduce the conflict issue caused by the increase of the number of objectives. In order to search for the optimal solutions, we take the degree of crowding and the distance between individuals in the population and the ideal point as two criteria to find the global best of the population. And a mutation operator is designed to avoid the algorithm falling into local optimum. Experimental results show that the proposed algorithm can obtaining more high quality solutions.
An Online Comment Assistant for a Better Comment Experience

In this study, we examined online news comment activities that are used as a key means of public opinion and interaction in modern society. We extracted keywords in comments using big data and sorted them according to frequency. Through this process, a chatbot was designed to check the ranking and contents of comments based on keywords represent the most important issues in the comment population and search for classified comments according to keywords before users read the news. Through experiments using this chatbot, we compared and analyzed the nature of the comments in the existing comment system and the characteristics of the system experience. Results shows that the chatbot designed in this study can provide more information than existing comment presentation systems, search for comments by type, and check more information than articles. In addition, assessing the nature of the existing comments reduced the number of sensational, non-slang-oriented comments.
FORMATION OF THE BASICS OF INFORMATION SECURITY OF PRIMARY SCHOOLCHILDREN IN EXTRACURRICULAR ACTIVITIES

In the modern world with the active development of information technologies, a new kind of dangers that threaten society appears — these are information threats or cyber threats. Primary schoolchildren are most exposed to informational threats, as they already have rich experience in using Internet resources, but still do not have the skills to use the Internet safely. The article discusses the methodological issues of forming the basics of information security of younger students in the teaching of a specialized course, implemented in the framework of extracurricular activities.
MOTIVATIONAL ASPECTS OF INFORMATICS OLYMPIADS FOR SCHOOLCHILDREN AND STUDENTS OF YOUNGER COURSES

The article discusses the tasks of the Informatics Olympiad held at the Voronezh State Pedagogical University. The tasks are given with the comments regarding the components checked by these tasks.
Formal Hardware Verification of InfoSec Primitives

Information Security (InfoSec) plays a major role in the modern real time applications. This paper proposes equivalence check based efficient formal hardware verification schemes for various InfoSec primitives such as 128-bit Advanced Encryption Scheme (AES), Bose-Chaudhuri-Hocquenghem (BCH) encoder, and m-bit GF(p) exponentiator (where p = log <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> m). The verification of 128-bit AES is done with Artix-7 FPGA using Xilinx Vivado. The verification of BCH encoder and GF(p) exponentiator are done with 45nm CMOS technology using Cadence. The synthesis results show that the proposed hardwaresoftware co-design based 128-bit AES formal hardware verification does not compromise the resource utilization as compared with various existing designs. Similarly, the proposed formal hardware verification of BCH encoder with generator polynomial length 64 and 16-bit GF(p) exponentiator do not compromise the delay as compared with various existing techniques.
Intelligent Water Cup Based on STM32

Water cups are essential for our everyday life. But for ordinary water cups, people can't know the water temperature and water volume in the cup, and they can't know exactly whether they drink enough water every day. Also, they can't be reminded to drink water when they are busy. Therefore, this paper designs a multi-functional intelligent water cup system based on STM32, which aims to make people develop good drinking habits. In this system, the microcontroller can control the temperature sensor and the pressure sensor to measure water temperature and water volume in real time. The water temperature error does not exceed ±0.5°C. The user can set the water temperature and drinking time in advance on the LCD by touching the key to remind the user to drink water by a voice module. Also, by means of Bluetooth module, the user can obtain information such as water temperature and water volume through the mobile phone APP. The lithium battery built into the cup can power the microcontroller and each module. This system can successfully realize the function after debugging, and can well solve people's drinking water problem. Compared with the ordinary water cup, the system has high cost performance and has broad prospects.
Integrity-Protected Micro-Hypervisor on x86 and ARM Hardware Virtualized Platforms

We analyze the feasibility of constructing an integrity-protected micro-hypervisor on contemporary x86 and ARM hardware that includes virtualization support, observing that without the fundamental property of micro-hypervisor integrity, no additional properties (e.g., secrecy, information-flow, etc.) can be achieved. Based on our analysis, we describe a set of necessary rules that must be followed by micro-hypervisor developers and users to maintain micro-hypervisor integrity.
A New Spark Based K-Means Clustering with Data Removing Strategy

Clustering is an important technique in machine learning, which has been used to organize data into groups of similar data points called also clusters. In fact, conventional clustering methods are not suitable when dealing with large scale data. This is explained by the high computational cost of these methods which require unrealistic time to build the grouping. We propose in this work a new Spark based K-means Clustering with Data Removing Strategy referred to as (SKMDRS). The proposed method is based on data removing strategy which aims to reduce the computational time, by removing at each iteration data points that are unlikely to change the clusters to which they belong thereafter. In addition, the clustering process is distributed through Spark framework in order to enhance the scalability. Conducted experiments show the efficiency of the proposed method compared to existing ones.
A framework of biometric recognition and personalized mobile application to establish a dynamic connection with the ATM to enable secure transaction

This project report is submitted in partial fulfilment of the requirements for the degree of Master of Engineering in Computer Science and Engineering, 2019.