Reviewerly/exHarmony huggingface dataset:
Optimal Discrimination of Two Nonorthogonal States by Continuous Probing and Feedback Operation

Abstract For a quantum system prepared probabilistically on two or more non‐orthogonal states, the observer cannot discriminate the initial preparation perfectly. Kurt Jacobs [ Quantum Inf. Comput . 2007, 7 , 127] introduced a measurement operator that could increase the rate of information obtained using a continuous measurement scheme. However, the better effect happens at the expense of reducing the total information from the quantum system. To address this problem, an optimal operator that could yield the maximal value of mutual information for a long‐time measurement is found. Particularly, it turns out that the error probability is minimized for any measurement moment by measuring the optimal operator. Furthermore, for a given finite measurement time, a measurement scheme to maximize the obtained mutual information is presented. It is shown that while the Jacobs' operator should be used for a short‐time case, for a long‐time limit, the proposed optimal operator should be employed. For a given finite duration, the proposal could determine the optimal measurement operator that maximizes the final value of mutual information.
Frame Rate Up-Conversion for HDR Video Using Dual Exposure Camera

In this paper, we propose a new frame rate up-conversion (FRUC) for HDR video using a dual exposure camera that captures alternating frames with two different exposure levels (short and long). First, optical flows are estimated in the proposed convolutional neural network (CNN)-based motion estimation (ME) analyzing dual-exposed frames. Then, with the estimated true motions and motion occlusion maps, an HDR frame is interpolated while suppressing ghost artifacts caused by HDR fusion. Finally, FRUC is performed by re-using motions and occlusion maps. Experimental results indicate that the proposed method is effective to eliminate ghost artifacts and increase frame rate at the same time.
Blockchain for Transport (BC<sub>4</sub> T), Performance Simulations of Blockchain Network for Emission Monitoring

Vehicles are becoming increasingly connected and are already transmitting substantial amounts of data to the Original Equipment Manufacturers (OEMs) servers. Blockchain (BC) enables the transmission of data with addition security and removes single points of failure, while maintaining data prove-nance, identity ownership and the possibility to retain varying levels of privacy depending on requirements of the applied use-case. This research performs emulations of vehicles interacting with European Member State authorities and the European Commission (EC) BC nodes that are running Hyperlegder Fabric (HLF) and explores whether the technology is could be used for transport applications, building on indicative case studies such as CO2 emissions monitoring and vehicle identity. Due to the specialized nature of the Experimental Platform for Internet Contingency infrastructure, the network topology can be defined allowing for more realistic network conditions to be emulated. The results show that the deployed system is able to meet the requirements both in terms of Transactions Per Second and latency, but the hardware and system parameters need modification in order to scale up to the envisaged number of vehicles in the fleet.
Methodological approach to assessing the productivity of scientific activity of higher school teachers

An integral criterion for evaluating the scientific effectiveness and publication activity of scientists on domestic and international scientometric databases is proposed. The developed criterion was tested in the process of evaluating the scientific activities of teachers of the Faculty of Industrial and Digital Economics and the Faculty of Information Technologies of the Bryansk State Technical University. Examples of calculating the developed integral criterion based on a set of such scientometric indicators as the number of publications, the number of citations, the average number of citations per publication, the number of articles according to the lists of the Higher Attestation Commission, Web of Science and Scopus are given. Conclusions are drawn on the objectification of scientometric indicators for evaluating the publication activity of teachers and researchers and prospects for further research are outlined.
Deep neural networks for moving object classification in video surveillance applications

The moving object classification is a crucial step for several video surveillance applications whatever in the visible or thermal spectra. It still remains an active field of research considering the diversity of challenges related to this topic mainly in the context of an outdoor scene. In order to overcome several intricate situations, many moving objects classification methods have been proposed in the literature. Particular interest is given to the classes “Pedestrian” and “Vehicle”. In this paper, we have proposed a moving object classification approach based on deep learning methods from visible and infrared spectra. Three series of experiments carried on the challenging dataset “CD.net 2014” have proved that the proposed method reach accurate moving objects classification results when compared to methods based on deep learning and handcrafted features.
Research on Anti-Occlusion Correlation Filtering Tracking Algorithm Based on Adaptive Scale

Target tracking has always been an important research direction in the field of computer vision. The target tracking method based on correlation filtering has become a research hotspot in the field of target tracking due to its efficiency and robustness. In recent years, a series of new developments have been made in this research. However, traditional correlation filtering algorithms cannot achieve real-time tracking in complex scenes such as illumination changes, target occlusion, motion deformation, and motion blur due to their single characteristics and insufficient background information. Therefore, a scale-adaptive anti-occlusion correlation filtering tracking algorithm is proposed. First, solve the single feature problem of traditional correlation filters through feature fusion. Secondly, the scale pyramid is introduced to solve the problem of tracking failure caused by scale changes. In this paper, two independent filters are trained, namely the position filter and the scale filter, to locate and scale the target, respectively. Finally, an occlusion judgment strategy is proposed to improve the robustness of the algorithm in view of the tracking drift problem caused by the occlusion of the target. In addition, the problem of insufficient background information in traditional correlation filtering algorithms is improved by adding context-aware background information. The experimental results show that the improved algorithm has a significant improvement in success rate and accuracy compared when with the traditional kernel correlation filter tracking algorithm. When the target has large scale changes or there is occlusion, the improved algorithm can still keep stable tracking.
Image security development using 3D playfair cipher combination and bit shift

Messaging in this modern era is growing really fast because it’s so easy to use. The more development of messaging, the easier it is for third parties to access the contents of the message. Cryptography is needed to learn about how a message remains safe. This research is to develop the security of a message in encoding an image using a combination of 30 Playfair Cipher and Bit Shift. The encryption and decryption process of 30 Playfair Cipher using a pair of three letters (trigram) is followed by shifting the bits up, right, down, and left in the image which is done several iterations repeatedly. The encryption process produces a different cipherimage with a visually plainimage. The decryption process successfully returns the cipherimage to plainimage. Combination of 30 Playfair Cipher and Bit Shift using histogram analysis, NPCR, UACI, and correlation coefficient to see the difference in calculation value between plainimage and cipherimage, and the result of the average values are 455743,6698; 99,51275%; 31,92532%; and 0,054784798. The results showed that the combination of 30 Playfair Cipher and Bit Shift can be used to secure a message.
What Triggers Violation of Information Security Policies

This paper offers a framework for information security professionals to evaluate ISP and understand policy non-adherence. It explores the different types of non-adhering behaviors and the motivations behind them. It goes on to share information about the environmental/organizational climates in which non-compliant behaviors are more or less likely to occur and briefly touches on when users are more likely to commit them. Finally, it suggests a user review process as a critical part of information security policy design and implementation.
Complexity of Critter Crunch

We study the computational complexity of the puzzle game Critter Crunch, where the player has to rearrange Critters on a board in order to eliminate them all. Smaller Critters can be fed to larger Critters, and Critters will explode if they eat too much. Critters come in several different types, sizes, and colors. We prove the NP-hardness of levels that contain Blocker Critters, as well as levels where the player must clear the board in a given number of moves (i.e., “puzzle mode”). We also characterize the complexity of the game, as a function of the number of columns on the board, in two settings: (i) the setting where Critters may have several different colors, but only two possible sizes, and (ii) the setting where Critters come in all three sizes, but with no color variations. In both settings, the game is NP-hard for levels with exactly two columns, and solvable in linear time for levels with only one column or more than two columns.
Unique Generators for Cyclic Codes of Arbitrary Length over <math xmlns="http://www.w3.org/1998/Math/MathML" id="M1"> <msub> <mrow> <mi mathvariant="double-struck">F</mi> </mrow> <mrow> <msup> <mrow> <mi>p</mi> </mrow> <mrow> <mi>m</mi> </mrow> </msup> </mrow> </msub> <mfenced open="[" close="]" separators="|"> <mrow> <mi>u</mi> </mrow> </mfenced> <mo>/</mo> <mrow> <mfenced open="〈" close="〉" separators="|"> <mrow> <msup> <mrow> <mi>u</mi> </mrow> <mrow> <mn>3</mn> </mrow> </msup> </mrow> </…

Cyclic codes play a very important role in the history of coding theory since they have good algebraic structures that can be widely used in coding and decoding. However, generators for repeated-root cyclic codes of arbitrary length over <math xmlns="http://www.w3.org/1998/Math/MathML" id="M2"> <msub> <mrow> <mi mathvariant="double-struck">F</mi> </mrow> <mrow> <msup> <mrow> <mi>p</mi> </mrow> <mrow> <mi>m</mi> </mrow> </msup> </mrow> </msub> <mfenced open="[" close="]" separators="|"> <mrow> <mi>u</mi> </mrow> </mfenced> <mo>/</mo> <mrow> <mfenced open="〈" close="〉" separators="|"> <mrow> <msup> <mrow> <mi>u</mi> </mrow> <mrow> <mi>k</mi> </mrow> </msup> </mrow> </mfenced> </mrow> </math> are not unique in previous works for <math xmlns="http://www.w3.org/1998/Math/MathML" id="M3"> <mi>k</mi> <mo>≥</mo> <mn>3</mn> </math> , and hence it is impossible to determine their dual codes. In this work, we propose unique generators for cyclic codes of arbitrary length over <math xmlns="http://www.w3.org/1998/Math/MathML" id="M4"> <msub> <mrow> <mi mathvariant="double-struck">F</mi> </mrow> <mrow> <msup> <mrow> <mi>p</mi> </mrow> <mrow> <mi>m</mi> </mrow> </msup> </mrow> </msub> <mfenced open="[" close="]" separators="|"> <mrow> <mi>u</mi> </mrow> </mfenced> <mo>/</mo> <mrow> <mfenced open="〈" close="〉" separators="|"> <mrow> <msup> <mrow> <mi>u</mi> </mrow> <mrow> <mn>3</mn> </mrow> </msup> </mrow> </mfenced> </mrow> </math> . As its applications, we derive the numbers of their codewords, as well as generators for their dual codes. Furthermore, we propose necessary and sufficient conditions for their self-dualities.
A study of a nonlinear interaction between a two-mode cavity field and ♢-type four-level with field damping

In this paper, the effects of the field damping and Kerr-like medium on a system of a four-level atom in the [Formula: see text]-type interacting nonlinearly with a two-mode field are studied. Analytical solution of the system of differential equations resulting from the Schrödinger equation is obtained. The effects of detuning parameters, Kerr-like parameter, coupling function and damping rate are discussed for atomic population inversion, the second-order correlation function, Shannon information entropy, and linear entropy. Under justifiable all conditions, extreme entanglement states may appear periodically with the evolution of time. The arrival of the quantum system to a pure state can be controlled by variations of the Kerr medium and the damping parameters. The results also exhibit that the periods of strong and weak entanglement between the parts of the system are achieved during the periods of collapses and revivals of the atomic population inversion. Moreover, the photon distribution changes from non-classical to classical by increasing the damping rate.
New problems for Tennant's definition of harmony

Abstract Steinberger proposes as a counterexample to Tennant's harmony criterion a degenerate quantifier that makes it possible to prove consequences such as for every propositional function and pair of terms. Tennant suggests an answer that, according to Steinberger, is inadequate for the purpose. In this paper, it is shown that Steinberger's counterexample works only within a finitary framework, and that, moreover, it rests on a controversial interpretation of Tennant's criterion . Another deepened interpretation of the same criterion is suggested and defended. It is then proved that this new reading solves Steinberger's counterexample but leads to an unacceptable weakening of the logical system.
Incentive and Playful Strategy for a Participative Model of Learning and Experimenting Blockchain

In this paper, we are interested in the scalability of simulator models of new technologies, such as the blockchain, which present many technical and consensual constraints and challenges. Thus our proposal focuses on an important feature of meta-models of such simulators, namely the management of the incentive to participate in the proposal to make them evolve continuously. This is done through the election of a king based on his significant contributions to the evolution of the model. The introduction of an evolution can be an optimization of the model's performance or the integration of a recent advance in technology. To better illustrate our proposal, we do an implementation of a blockchain simulator with a perspective of optimizing its upgradability and trying to move towards a single simulation platform based on our model that aggregates the learning and experiment of the blockchain while managing the low and high level details.
Design of an IoT Safety Distance Monitoring Device for COVID-19

The COVID-19 pandemic arises in the year 2020 that leads to almost more than 100,000,000 confirmed cases happened in worldwide and yet, the cases are continuing to rise now. One of the common methods that used to prevent the COVID-19 is through keeping the social distancing between each other. However, people do not aware of the importance of applying social distancing rules. A low-cost solution is urgently needed for contact tracing and remind the users to keep the social distancing with the others. An IoT-based safety distance monitoring (ISDM) device is proposed to monitor safety distance, remind people to always stay alert and keep the data of the users that violated the social distancing rules for contact tracing. ISDM is a lightweight wearable wristwatch. Bluetooth Low Energy technique is used to send and receive information such as body temperature and contact tracing information. Fever is the most common symptom of COVID-19 patients. ISDM can operate either online or offline. The health and contact tracing information are stored in a local Micro-SD card storage when offline and data will be uploaded to the cloud server for further analysis once ISDM is connected. The detailed contact tracing information can be used to trace the potential COVID-19 patients with close contact with the COVID-19 patient.
Research on College English Teaching Evaluation System Based on Mobile Terminal

The 21st century is the era of information technology, and the rapid development of information technology has had a huge impact on educational technology. With the popularity of mobile terminals in recent years, the development of mobile learning will promote changes in the way teaching, learning, and assessment are conducted. Traditional teaching evaluation methods focus on summative evaluation, although process evaluation is also involved, although it is limited by time and assessment recording means and does not achieve the purpose of evaluation well. In this study, we conduct a research on the evaluation system of secondary school chemistry classroom teaching based on mobile terminals and construct an evaluation index system of English teaching in colleges and universities based on mobile terminals, hoping to have some practical significance to the reform of teaching evaluation nowadays. The system uses the WeChat applet framework, the WeChat Web developer tool to output and display the front-end interface, and the Model-View-Controller framework development model to complete the invocation of the backend data. The results show that both students and teachers can access the assessment system through the WeChat applet and complete the teaching assessment and view the assessment results.
The Structural Relationship among Proactive Child Care Teacher's Proactive Personality, Psychological Empowerment and Work Engagement

The purpose of this study was to investigate the structural relationship by exploring whether psychological empowerment mediates the relationship between childcare center teachers" proactive personality and work engagement. The participants were 218 teachers working at childcare centers in the Daegu or Gyeongbuk Province. Self-reported questionnaires were used to measure teacher proactive personality, psychological empowerment and work engagement. The collected data were analyzed using Pearson Correlation, Structural Equation Modeling(SEM), Bootstrapping by SPSS Version 21.0 and AMOS Version 20.0. The results of this study were as follows. First, child care teachers" proactive personality had a positive influence on work engagement. Second, child care teachers" psychological empowerment had a positive influence on work engagement. Third, child care teachers" proactive personality had a positive influence on psychological empowerment. Fourth, child care teachers" proactive personality had an indirect effect on work engagement via psychological empowerment. The results mean psychological empowerment had more influence on child care teachers" work engagement than proactive personality. Child care teachers" psychological empowerment was important factor to increase the work engagement.
Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR

An average-case variant of the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> -SUM conjecture asserts that finding <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> numbers that sum to 0 in a list of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$r$</tex> random numbers, each of the order <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$r^{k}$</tex> , cannot be done in much less than <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$r^{\lceil k/2\rceil}$</tex> time. On the other hand, in the dense regime of parameters, where the list contains more numbers and many solutions exist, the complexity of finding one of them can be significantly improved by Wagner's <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> -tree algorithm. Such algorithms for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> -SUM in the dense regime have many applications, notably in cryptanalysis. In this paper, assuming the average-case <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> -SUM conjecture, we prove that known algorithms are essentially optimal for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k=3,4,5$</tex> . For <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k &gt; 5$</tex> , we prove the optimality of the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> -tree algorithm for a limited range of parameters. We also prove similar results for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> -XOR, where the sum is replaced with exclusive or. Our results are obtained by a self-reduction that, given an instance of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> -SUM which has a few solutions, produces from it many instances in the dense regime. We solve each of these instances using the dense <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> -SUM oracle, and hope that a solution to a dense instance also solves the original problem. We deal with potentially malicious oracles (that repeatedly output correlated useless solutions) by an obfuscation process that adds noise to the dense instances. Using discrete Fourier analysis, we show that the obfuscation eliminates correlations among the oracle's solutions, even though its inputs are highly correlated.
Digital identity for development should keep pace with national cybersecurity capacity: Nigeria in focus

Target 16.9 of the United Nations (UN) Sustainable Development Goals (SDGs) is the provision of legal identity for all, including birth registration by 2030. Approximately 1 billion people globally do not have basic ID credentials. To close this gap, governments in developing countries, including Nigeria, with the backing of international agencies like the World Bank, have launched digital identity schemes for residents. These schemes typically include smart cards which are required to access public and private services. The speed of implementation of these projects has come at the expense of a thorough consideration of cybersecurity and privacy. This is set against the backdrop of the rising threat of cybersecurity breaches in the world against targets such as national identity databases. This paper seeks to provide an overview of digital identity in Nigeria and use the Oxford Global Cyber Security Capacity Centre’s Cybersecurity Maturity Model Report 2019 for Nigeria to illustrate how, although progress has been made in key sectors, the implementation of the Nigeria’s digital identity programme has progressed faster than cybersecurity maturity in the country. This increases the risk of cyberattacks and opens both the national identity database and users of the digital identity to security vulnerabilities.