Reviewerly/exHarmony huggingface dataset:
A test of the science of what is possible by the poor

This chapter reports on a test of entrepreneurial discovery by the poor, which is really a test of what is possible, based on the same principles of informational economics, which have been elucidated in the previous chapters. Specifically, it demonstrates how the poor can be trained to use specific information to find discoveries at a rate that is twenty-five times more effective than the extant prescription to stay alert. Also, this chapter operationalizes training protocols for employing constrained, systematic search. It concludes by discussing the special entanglements of the poor that hold them back as they try to escape poverty. Finally, the lack of trust of those from outside the local community necessitated the building of bridges to study participants. In fact, bridge-building becomes an integral part of public policy that can be most effectively employed by cultivating relationships with the local community.
Results and Discussion Based on the Case

In this chapter, first, the dataset of ‘High-Learning‘ is taken as an example to describe how to identify the BIC value, and how to interpret the values of three HMMs measures (Initial probability vector π, Transition probability matrix, A, and Output probability matrix, B) based on the real interaction practice. Second, the results of four research questions are reported. Then, it ends up with the discussions of the four research questions.
Universal Quantum Computing with Spin Waves: Three Methods

Holographic spin-wave excitations in atoms are commonly used to build high-performance quantum memories. Here we show three methods that enable not just storage, but universal quantum computing, with atomic spin waves.
High Brightness programmable source of frequency-bin qubits.

A high brightness silicon integrated source of entangled frequency-bins is presented. We experimentally demonstrate programmable emission of both computational basis states and Bell states.
Administering an antidote to Schrödinger’s cat

We present a technique that steers the measured state of a quantum superposition to a determined outcome by using feedback on the interference of two long, identical photons produced using 87 Rb atoms in cavities.
Indistinguishable Photons with High Efficiency from a Quantum Emitter Strongly Coupled to a Plasmonic Nanostructure

We theoretically investigate the degree of indistinguishability of photons produced by a solid state quantum emitter coupled to a plasmonic nanostructure and find a high degree of indistinguishability combined with very high emission efficiency.
A Prototype for Ultimate Secure Transmission and Analysis of Smart Grid Data on the Wire

We present a prototype hybrid quantum/classical networking testbed utilizing MDI-QKD-generated keys for encrypting power grid data, while also performing in-network data analysis using post-quantum cryptography to share the key with the analysis node.
Schemes for Nonclassical Light Generation with a Single Multilevel Atom in a Cavity

Raman transitions between atomic sublevels in a continuously-driven, single-atom cavity QED system are explored for the generation of a variety of quantum states of the output light field.
Atom-Nanophotonic network node with integrated telecom interface

We propose neutral atoms coupled to telecom nanophotonic cavities as quantum network nodes. Our novel protocol for generating atom-telecom photon entanglement enables a scalable network architecture featuring identical qubits and direct telecom operation.
Technical Foundations: Computer Systems

The following chapters introduce the technological basis of business informatics, computer systems and computer networks. The focus of the third chapter is on the components and processing system of a computer. The IT developments are listed in chronological order and different types of computers as well as their related key components and their performance indicators are introduced.
Graded Monads and Behavioural Equivalence Games

The framework of graded semantics uses graded monads to capture behavioural equivalences of varying granularity, for example as found in the linear-time / branching-time spectrum, over general system types. We describe a generic Spoiler-Duplicator game for graded semantics that is extracted from the given graded monad, and may be seen as playing out an equational proof; instances include standard pebble games for simulation and bisimulation as well as games for trace-like equivalences and coalgebraic behavioural equivalence. Considerations on an infinite variant of such games lead to a novel notion of infinite-depth graded semantics. Under reasonable restrictions, the infinite-depth graded semantics associated to a given graded equivalence can be characterized in terms of a determinization construction for coalgebras under the equivalence at hand.
IDENTIFICATION AND STRUCTURING OF GAME DESIGN DOCUMENT ITEMS AND THEIR EVALUATION USING PEER REVIEW AND PROOF OF CONCEPT FROM MARIO FRANCHISE GAMES

Present the identification and structuring of GDD items from the analysis of articles resulting from a systematic literature review (RSL), as well as their evaluation and validation using peer review with an expert in the field and proof of concept applied to games of Mario franchise Focuses on the process of defining and structuring documents for the game design stage by making a Game Design Document (GDD) Projects often do not document their design stage through GDD or do not know what design resources should be used Evaluation of the proposal by an expert in the field through peer review.Subsequently, the proposal was evaluated using a proof of concept.Final product a set of structured GDD items that can be used in the future as a basis for making GDDs.Application of scientific evaluation techniques.Definition of GDD items from their groupings.
A Study on Smart Technology Utilization Plans in Construction Sites in Preparation for the Serious Accidents Punishment Act

This study proposed a plan to easily handle the work of safety management officer at construction sites by effectively performing safety management work at construction sites using smart technology in preparation for the Serious Accidents Punishment Act. As a result of analyzing the research trends of the Serious Accidents Punishment Act, it can be summarized into network analysis studies such as problems and improvement directions, countermeasures from subcontractors and small and medium-sized construction companies, site size, etc. The relationship between the detailed process of the construction site and smart technology, which is the core of this study, was found in the order of earthwork, steelwork, roof work, reinforced concrete work, window work, drainpipe metal work, civil work, and stone work. This means that when smart technology is applied, the response to serious accidents factors is relatively highly related, so it can be effectively managed. The definitive weight of smart technology for the detailed construction process was determined as the top items: earthworks, steelworks, roof works, 65%, reinforced concrete works 20%, window works 10%, drainpipe works 3%, and stone works 2%. Based on this, it can be prepared by applying the degree of input of smart technology to the detailed schedule of construction sites in order to increase the practical use of smart technology in preparation for the Severe Accidents Punishment Act.
The Impact and Potential of Block chain Applications Based on IoT

The Block chain is a course of action of recording information to such an extent that makes it irritating or hard to alter, slash, or swindle the system. In blockchain decentralized amend the proceedings that could be used to indicate, join up also send wide scope of agreement to various social affairs in association. The scope of block chain applications stretches out to open and public administrations including wellbeing, financial, automotive, Internet of Things (IoT) and risk management. This paper presents a thorough outline on blockchain innovation. Lately, block chain innovation has become extremely stylish and infiltrated various areas, generally because of the crypto currencies determination of rotator for the particular sort of suspension needs some fundamental information.
High-dimensional photonic entanglement using linear optics

Encoding qudits into photons can provide improvements to quantum communication and computation tasks. Here, we present new schemes for generating high-dimensional photonic entanglement and show how to construct cluster states for universal qudit quantum computation.
Modelling Quantum Photonics with a Transmon of the IBM Quantum Computer

We demonstrate a new methodology of modelling phenomena of quantum photonics using the analogy in the evolution of quantum states of a single photon and a transmon, superconducting charge device of the IBM computer.
Fundamental Limits in Mutiparameter Quantum Metrology

We derive fundamental bounds on the maximal achievable precision in multiparameter noisy quantum channel estimation, as well as show operationally meaningful Heisenberg scaling precision limits for the multiple phase interferometry in the absence of noise.
Accelerating SLIDE: Exploiting Sparsity on Accelerator Architectures

A significant trend in machine learning is sparsifying the training of neural networks to reduce the amount of computation required. Algorithms like Sub-LInear Deep learning Engine (SLIDE) [2] use locality-sensitive hashing (LSH) to create sparsity. These sparse training algorithms were originally developed on multi-threaded multicore CPUs. However, they are not well-studied and optimized for accelerator platforms such as GPUs and reconfigurable dataflow architectures (RDAs). In this paper, we study the different variants of the SLIDE algorithm and investigate accuracy-performance tradeoffs on CPU, GPU, and RDAs. The implementation targeting RDA outperforms the GPU by 7.5×. The performance on a limited-memory RDA is improved further by proposing a smart caching algorithm, which is 2 × faster than the baseline RDA. Furthermore, we are able to achieve another 2 × performance by putting all of the weights on-chip using an RDA with enough memory. We believe our work will pave the road for the future development of both algorithm and hardware architecture for sparse training.
CORtEX 2022 Invited Speaker 2: Brain-like machine learning using BCPNN

The BCPNN (Bayesian Confidence Propagation Neural Network) model was developed from the early associative memory brain models and by further abstracting from what is known about the human brain. It basically features a recurrently connected modular network layer with sparse activity and local computation in signal processing as well as in its Bayesian Hebbian synaptic plasticity. Recent addition of an unsupervised mechanism for structural plasticity has enabled generation of efficient hidden representations with sparse and decorrelated structure. Extensive testing on several standard machine learning (ML) benchmarks, has demonstrated that its classification performance is on par with a standard multi-layer perceptron using error backpropagation learning and that it outperforms other biologically inspired ML methods. The latest component added is recurrence on top of the hidden layer, which augments this network with attractor dynamics, ability to extract prototype patterns and to classify with high performance distorted test patterns. When tested on MNIST it does not quite reach top performance on clean test patterns but outperforms other widely used multi-layer ML approaches on distorted ones. This kind of brain-like approach to machine learning and artificial intelligence can be further enhanced by incorporation of additional computationally relevant features of the biological brain.
APDCM 2022 Keynote Talk: Solving QUBOs on Digital and Quantum Computers

Combinatorial Optimization searches for an optimum object in a finite but usually vast collection of objects. This can be used for many practical purposes, like efficient allocation of limited resources, network planning, and hundreds of other applications in almost all fields, e.g., finance, production, scheduling, and inventory control. However, many combinatorial optimization problems are known to be NP-hard, which is often translated simplistically as “intractable.” It is regularly claimed that quantum computers will bring breakthrough progress in solving such challenging combinatorial optimization problems relevant in practice. In particular, Quadratic Unconstraint Binary Optimization (QUBO) problems are said to be the model of choice for use in (adiabatic) quantum systems. We explain some of the meaning and implications, review the state of affairs, and give some computational results to underpin our conclusions.
A Locality-aware Cooperative Distributed Memory Caching for Parallel Data Analytic Applications

Memory caching has long been used to fill up the performance gap between processor and disk for reducing the data access time of data-intensive computations. Previous studies on caching mostly focus on optimizing the hit rate of a single machine. But in this paper, we argue that the caching decision of a distributed memory system should be performed in a cooperative manner for the parallel data analytic applications, which are commonly used by emerging technologies, such as Big Data and AI (Artificial Intelligence), to perform data mining and sophisticated analytics on larger data volume in a shorter time. A parallel data analytic job consists of multiple parallel tasks. Hence, the completion time of a job is bounded by its slowest task, meaning that the job cannot benefit from caching until all inputs of its tasks are cached. To address the problem, we proposed a cooperative caching design that periodically rearranges the cache placement among nodes according to the data access pattern while taking the task dependency and network locality into account. Our approach is evaluated by a trace-driven simulator using both synthetic workload and real-world traces. The results show that we can reduce the average completion times up to 33% compared to a non-collaborative caching polices and 25% compared to other start-of-the-art collaborative caching policies.
Performance Evaluation of a Supercomputer Based on AMD Rome and Intel Cascade Lake Processors

We present a performance evaluation comparing a cluster of nodes based on the AMD EPYC 7742, a 64-core processor code-named Rome, to one based on the Intel Xeon Gold 6248, a 20-core processor code-named Cascade Lake. The Rome-based nodes have higher memory bandwidth, larger caches, more memory controllers, more cores, and support PCIe Gen4 with more lanes than the Cascade Lake nodes. We critically evaluate these new features with four industry-standard benchmarks (STREAM, HPL, HPCG, and HPCC) and 11 production scientific and engineering applications representing many disciplines: aerospace, aero engineering, climate, material designing, computational chemistry, condensed matter, life sciences, and oceanography. The performance gain of Rome over Cascade Lake on single-node runs of 9 applications ranges from 1.37-3.08x, with a geometric mean of 2.23; comparing 2016-rank runs, a Cascade Lake core has 1.08-1.39x the performance of a Rome core. The Cascade nodes result in a more balanced system, but the Rome nodes provide better per-node application performance.
Quantifying Composable Data Center Utilization

Composable data centers have been a strong topic of research interest, with potential benefits including higher resource utilization, faster and independent refresh cycles, flex-ible/optimum resource allocation and better capital and oper-ational costs. In this paper we use a discrete event simulation model to provide a quantitative assessment of the utilization ben-efits for a composable system versus conventional. We consider a simple multi-server loss queue situation as well as two more realistic scenarios: a mixed memory size demand and a mixed ratio CPU-GPU demand. In all these scenarios, composable systems can provide many tens of percent utilization advantage over more conventional hardware deployments. We also explore the impact of size of the composable resource pool on utilization.
Incremental Nonlinear Dynamic Inversion with Sparse Online Gaussian Processes Adaptation for Partially Unknown Systems

Sensor-based Incremental control is a recently developed family of techniques with a reduced dependency on a plant model. This approach uses measurements or estimates of current state derivatives and actuator states to linearize the dynamics with respect to the previous time moment. However, in such a formulation, the control system is sensitive to the quality of measurements or estimations. The presence of uncertainties caused by unforeseen malfunctions in measurement and/or actuation systems could provoke drastic performance degradation. The paper proposes a sensor-based Incremental Nonlinear Dynamic Inversion (INDI) control algorithm augmented with Budgeted Sparse Online Gaussian Processes Adaptation for the compensation of unknown system behaviour. INDI performs quite efficiently under design conditions. Meanwhile, GP-based direct adaptation provides not only long-term dependency learning but also noise signal filtering. The efficiency of the proposed approach is demonstrated with a longitudinal motion of a missile.
Learners' Perception of Non-face-to-face Dance Practice Classes at Colleges due to COVID-19

Objectives This study was to explore the improvement direction for the effective implementation of dance courses by analyzing the current situation of online dance practical courses at colleges and the experiences of students due to COVID-19. The purpose of this study is to help provide high-quality lectures to students, and furthermore, to promote the stabilization and activation of non-face-to-face dance education.&#x0D; Methods In this study, an online survey was conducted on 121 college students who took online dance practical courses in the second semester of 2021 at 5 colleges across the country to explore the average online dance practical courses at domestic colleges. The questionnaire consisted of 7 closed-type questions in multiple-choice format and 3 open-ended questions in subjective format using the Naver form for a total of 10 questions.&#x0D; Results First, the most preferred platform for learners is ‘real-time class’ through ‘Zoom’. Second, ‘good points of the experience of non-face-to-face dance practice classes are ‘freedom of learning and evaluation’, ‘new learning methods and improved participation’, ‘corona prevention’, and ‘difficult points of non-face-to-face dance practice classes’ ‘Difficulty in learning’, ‘environmental difficulties’, and ‘dissatisfaction with non-face-to-face classes’ are the upper categories. As ‘points to be supplemented in non-face-to-face dance practice classes’, ‘supplementation of class format’, ‘study method complementation of instructors’, ‘environmental improvement’, and ‘satisfaction with current status’ were found.&#x0D; Conclusions As a result of this study, ‘real-time class through zoom’ is the most appropriate form and method of ‘non-face-to-face dance practice class’, and the autonomy of the curriculum should be emphasized. In addition, instructors must establish a feedback system and prepare and improve the digital environment for teaching, both in schools, teachers, and learners. It is necessary to have insight into the current situation of college non-face-to-face dance practice classes and the experiences of learners.&#x0D; &#x0D;
A study on nursery participation in England

Objectives The purpose of this study is to find out the current practice and organizational culture of early childhood education in England and to draw up possible implications for Korean early child education through the case of England, where I had experience nursery training.&#x0D; Methods This study was conducted at C. nursery in England for six months from September 2018 to February 2019 to explore how the national curriculum was implemented. Data was collected from the researcher’s journal and observation logs, manager’s teachers’ interviews, questionnaires, photos, and documentary materials. They were categorised and analysed based on the open coding method.&#x0D; Results The result showed that early childhood education in England focused on the following: ‘basic education at the beginning of life to prepare for the key stage’, ‘free play and strict basic life guidance of young children’, ‘interaction between infants through friendly touch’, ‘indoor play space without boundaries, free play that gives off all the energy in the garden’, ‘observation record evaluation based on manual’, ‘teacher qualifications and status divided into grades’, and ‘teacher who wants to grow enen though the work is hard’.&#x0D; Conclusions Although there are cultural differences from Korea, England operates around play within the framework of the national curriculum by unifying early childhood education and childcare, and is generally very similar to Korean daycare centers.&#x0D; &#x0D;
Differences in perceptions of kindergarten teachers and daycare center teachers on the implementation of play in the 2019 revised Nuri curriculum

Objectives In this study, the difference in perception between kindergarten and daycare center teachers on the play execution of the 2019 revised Nuri curriculum was examined.&#x0D; Methods To this end, 241 online surveys were conducted for infant teachers in Seoul and Gyeonggi-do, and a total of 206 copies were analyzed for 103 kindergarten teachers and 103 daycare center teachers. In order to find out the difference in perception of play execution between kindergarten and daycare center teachers, the survey was revised and supplemented by referring to the play execution data of 2019 revised Nuri curriculum.&#x0D; Results As a result of examining the perception of kindergarten teachers and daycare center teachers on the play execution of the 2019 revised Nuri curriculum, the higher the educational background and the more experienced they were, the higher the perception of play execution by daycare center teachers than kindergarten teachers.&#x0D; Conclusions For the internalization of the 2019 revised Nuri curriculum and stable settlement of early childhood education sites, it is expected to be used as basic data to determine the training method, training time, and research direction according to the career of early childhood teachers&#x0D; &#x0D;
An Exploratory Design for the National Curriculum for Competency-Based Creative Experiential Activities

Objectives This study explores the components of the national-level curriculum and proposes a new national-level curriculum design plan for competency-based creative experiential activities.&#x0D; Methods The 2015 revised creative experiential activities were analyzed by investigating contents and through the extraction of competency-based activities goals and academic standards. In addition, Delphi surveys were conducted on experts in creative experiential activities and competency education to understand the feasibility of designing a distinct competency-based curriculum.&#x0D; Results The plan for designing a new and innovative competency-based format is as follows; The presentation of three competencies: personal growth, social relations, and creative innovations. Detailed competencies of individual growth presented self-management, self-directedness, willingness to grow; detailed competencies of social relationships presented communication, collaboration, empathy, citizenship, and creative innovation. In addition, a total of 23 achievement standards were given in conjunction with competency-based creative experiential activities, presenting general goals and clear competence goals.&#x0D; Conclusions This study is significant in that it first conferred a competency-based creative experiential activities curriculum and clarified the nature of creative experiential activities by shifting the creative experiential activities curriculum from area-based to competency-based.&#x0D; &#x0D;