Reviewerly/exHarmony huggingface dataset:
Flute Art in the Light of the Historical Significance of Methodological Schools and Directions in Music Education: The Past and Present

Professional activity of the flutist encompasses a sizeable repertoire, in terms of its volume and time span, comprising works for the flute solo, as well as with ensemble and orchestra. It presupposes the available deep artistic knowledge, orientation in the subjects of teaching this profession, history and theory of music, harmony, acoustics, psychology, etc. By defining basic priorities in the formation of the performing mastery of the flutist, this article focuses on the progressive provisions of psychophysiological methods. It monitors the historical path and the evolution of this branch via the examination of major publications, professional theses that defined the facets of the entire eras of this direction of instrumental art.Nowadays the results of psychophysiological research in the field of music pedagogy give us a great opportunity to improve practising methods and realize the misunderstandings in the interpretation of concepts, differentiating their meaning and role in the work of a musician. They also combine the properties of content (reason) and expressiveness (consequence) of performing art into a single complex of creative artistic flutist activity. Under anatomical and physiological circumstances the musician’s performing technique, such as fixation of body posture elements and the passivity of hearing, achieving free, natural movements, mainly stereotypical reaction-response to image-stimulus and struggle with variability of technical means acquires an active research character. A contradictory condition for the emergence of reflexes in psychotechnics and search for sound freedom, which previously played an ascertaining role, call for reconsideration under these new conditions. The focus is shifted towards the development of artistic thinking of professional musicians, the acquisition of knowledge and the ability to relate vivid associative impressions with intonational phenomena and processes, as well as the formation of the performing apparatus and mastering the art of interpretation.
The Achievements in Acquiring Kadazandusun Language with Multimedia Assistance through Cooperative Learning and Individual Learning at Lower Secondary Level

This research aims to analyze the achievements of cooperative learning and individual learning based on the usage of multimedia.The quantitative approach is the methodology used for this research.Pre test and post test are used, involving the control group and treatment group.The pre test and post test data are done through percentage calculation.Results of research shows that the teaching and learning process delivered using mutilmedia materials; with a combination of texts, graphics, audio, videos, and animation through cooperative learning are able to improve the understanding of students with different learning abilities from 75% to 97%.In conclusion, cooperative learning; assisted by multimedia elements contributes to the achievement of students compared to individual learning.Using audio visual helps students to understand and master the lessons.In addition, the implication of the research shows that cooperative learning, assisted by multimedia elements consist of leadership practices with social skills, besides practicing respect and responsibility.This is especially highlighted by students with higher level skills, by leading and guiding the group members.This is not the case in individual learning; as the understanding of the delivered information depends completely on the reasoning of the students themselves.
Biased transfer matching for less overlapping degree for unsupervised domain adaptation

Domain adaptation is an important branch of transfer learning. Previous studies have always taken efforts to minimize the optimization goal, but they neglect the relative quality of features or instances. For example, a classic work treats different instances equally in a degree and chooses these i nstances which minimize the optimization function value. This method will discard these instances that make the data distribution in source and target data domain different and will neglect the instances’ relative quality. To reduce interference between instances in the process of domain adaptation, we put forward a novel method of ODA that uses the overlapping degree to measure every feature or instance’s relative quality and implement feature or instance reweighting. At the same time, we have noticed that there are many parameters with values that will influence the effect of the method. Previous studies do not have a reasonable method to determine the parameters’ values. We can use the genetic algorithm to find the balance between marginal distribution adaptation and conditional distribution adaptation to find the best combination of multiple parameters. Experiments we have done verify that the ODA method outperforms by 3.26% compared with the best comparison method. We have found that our method of finding the optimal parameters can yield more accurate results than the original method.
Understanding the Intelligence Failure and Information Sharing in Handling Terrorism among Intelligence Community

Information sharing in intelligence cycle has become a crucial subject in security field.The main objective of this paper is to understand the information sharing and intelligence failure in handling terrorism among the intelligence community.The role of intelligence community is to obtain information, analyses, and process the information for their clients.However, the terrorist attacks still occur resulting from intelligence cycle.Realizing information sharing in intelligence cycle requires efforts from the community.
RANCANG BANGUN SISTEM UJIAN ONLINE BERBASIS WEB DI SMK PEMBANGUNAN KABUPATEN ROKAN HILIR-RIAU

SMK Pembangunan an online examination system is analyzed which is one part of the distance education system through internet technology media. Exams conducted by most educational institutions, therefore, researchers will overcome by designing a web-based online exam system design, to facilitate the community and schools, in the world of education in this case the School is still carried out conventionally. The concept of an online exam that is not related to space and time can be a solution to the constraints that exist in conventional examination methods. This system aims to make it easier for teachers to provide exams and the process of providing effective and efficient examination scores because the assessment process is given directly when students complete the exam. The study was conducted by observing the system directly so that the results of the analysis of the system needs were obtained. As a basis and reference for making an online exam system, literature study is then made to design a system database using DFD and ERD. The implementation of this online exam system is made with facilities including admin, teacher, and students which will produce output values
Feature Selection for Learning-to-Rank using Simulated Annealing

Machine learning is being applied to almost all corners of our society today.The inherent power of large amount of empirical data coupled with smart statistical techniques makes it a perfect choice for almost all prediction tasks of human life.Information retrieval is a discipline that deals with fetching useful information from a large number of documents.Given that today millions, even billions, of digital documents are available, it is no surprise that machine learning can be tailored to this task.The task of learning-to-rank has thus emerged as a wellstudied domain where the system retrieves the relevant documents from a document corpus with respect to a given query.To be successful in this retrieving task, machine learning models need a highly useful set of features.To this end, meta-heuristic optimization algorithms may be utilized.The aim of this work is to investigate the applicability of a notable meta-heuristic algorithm called simulated annealing to select an effective subset of features from the feature pool.To be precise, we apply simulated annealing algorithm on the well-known learning-torank datasets to methodically select the best subset of features.Our empirical results show that the proposed framework achieve gain in accuracy while using a smaller subset of features, thereby reducing training time and increasing effectiveness of learningto-rank algorithms.
Code kept on ice for 1000 years

Microsoft-owned firm to go ahead with work to safeguard commonly used data
Sequence‐Oriented Stochastic Model of RO‐TRNGs for Entropy Evaluation

Ring oscillator-based true random number generators (RO-TRNGs) are widely used to generate unpredictable random numbers for cryptographic systems. Entropy is usually adopted to quantitatively measure the unpredictability of a TRNG. There have been several stochastic models such as the time-oriented and phaseoriented ones built to evaluate the entropy of ElementaryRO-TRNGs with single oscillator. However, these models are not suitable for the TRNGs composed of multiple oscillators (Multiple-RO-TRNGs), which can obtain more randomness and higher throughput. Considering this, we propose a sequence-oriented stochastic model for the entropy evaluation of RO-TRNGs, named the first-order stationary Markov source model. This model is extensible for the Multiple-RO-TRNGs. Based on that, we present a detailed method to determine the entropy of Multiple-ROTRNGs. Our proposed model is verified by experiments. Besides, our method can also be a guide to design ROTRNGs with both high entropy and high throughput.
Clustering via the modified Petford-Welsh algorithm

Detecting meaningful communities has become crucial to advance our knowledge in diverse research areas that deal with datasets which can be naturally represented as networks. By regarding vertex clustering as the opposite problem of vertex colouring, we were able to leverage the Petford-Welsh colouring algorithm to develop a fast, efficient, and highly-scalable decentralised clustering algorithm. Its greatest potential lies in outperforming conventional methods when the community structure is fairly clear-cut.
The Divergent Influence of Social Responsibility on Employee Engagement through the Lens of Marital Status: Evidence from Higher Education Institutions

Purpose – This research paper has two purposes. Firstly, it aims to study the influence of social responsibility on employee engagement in a non-business setting, particularly higher education institutions. Internal Corporate Social Responsibility and Perceived Roles of Ethics and Social Responsibility were used to measure the social responsibility aspect. Secondly, the study further explores the difference between two heterogeneous groups of academics.Design/methodology/approach –A quantitative approach and non-probability judgmental sampling method were used in this research. A self-administered questionnaire containing the respondents’ demographic information and the main constructs of the research framework was distributed among the respondents targeted. Partial least squares structural equation modelling was used to assess the predictability of the model and a multi-group analysis was conducted to examine the differences between the non-married and married academics.Findings – The findings reveal that Perceived Roles of Ethics and Social Responsibility and Internal Corporate Social Responsibility are significantly related to academics’ Employee Engagement. The conclusion is that ethics and social responsibility have a similar influence in a non-business setting, such as a higher education institution. An insignificant result is obtained for the two heterogeneous groups of non-married and married academics. Originality/value – This research paper provides informative insights on the roles of ethics and social responsibility in a non-business setting, i.e., higher education institutions. It also complements the understanding of their insignificant influence on married and non-married academics. This serves as good information for higher education institutions’ administrators for devising alternative means to improve academics’ engagement in the workplace.
Practice-Oriented Technologies in the Educational Process as the Basis for the Economic Development of Society

At present, the world economy is moving to a new level of development.New technologies are developing at an accelerated pace and most production processes are being automated.These variations lead to a rapid change of economic and social order in society.Modern society and economics are on the path to digitalization.The world is entering the era of the digital economy, which dictates its requirements for education and the acquisition of knowledge.The new economy requires specialists of a new type in the labor market.Previously mentioned leads to fundamental changes in the professional and educational sphere.The digital world is a world of rapid change and a wealth of information.New realities require new competencies and skills from specialists.The formation of a set of skills, having mastered that, employees will be able to gain a foothold in one or another activity of the future, being ready for subsequent retraining, comes to the first place when receiving education.In this regard, the educational process is changing from traditional to practiceoriented, which allows you to obtain the necessary set of skills and competencies quickly.In the framework of the study, the team of authors developed and described a mechanism for using practice-oriented technologies in the educational process of the university in order to increase the business competencies of teachers and the quality of education in general.The using of this mechanism in practice in educational institutions will increase the involvement of students into educational process, students will be able meet the modern realities of changing society, the main priority of which is adaptation to rapidly changing working conditions.
A Practice of Choosing Gamification-based Personas

This study contributes our entire research project on museum user experience (UX), and the purpose of the paper is to provide knowledge in practice for choosing Gamification-motivated personas. As the player’s motivation fundamentally drives the outcomes, the Bartle Test of Gamer Psychology reigning from types of players was employed as a persona tool for identifying personas representing distinct intrinsic motivations. Specifically, adhering to the philosophy of user-centric intrinsic motivation, Bartle drew on an extensive range of sources to identify four types of players: achievers, socializers, explorers, and killers (we re-name killers as attackers). By analyzing the gamer psychology, it can be connected the player types to the intrinsic needs in the Self-Determination Theory (SDT). From a methodological point of view, the combination approach of quantitative and qualitative methods with constantly narrowing the scope of candidate can benefit trustworthiness. As a practical study, this paper not only analyzes the principles, but also provides a detailed persona selection procedure.
Beyond DC and MCMC: alternative algorithms and approaches to fitting light curves

The parameter space of binary star light curve models is highly complex and degenerate, thus basic fitting approaches often fail to yield a good (and correct) estimate of the parameter values and their uncertainties.On the other hand, we have an increasingly large number of fitting and sampling algorithms available that can be relatively easily interfaced with open-source eclipsing binary packages, like PHOEBE 2. We showcase several fitting methods, including local and global minimizers, nested sampling and machine learning methods, and evaluate their performance on fitting a light curve model with PHOEBE 2.
Is k Nearest Neighbours Regression Better Than GP?

This work starts from the empirical observation that k nearest neighbours (KNN) consistently outperforms state-of-the-art techniques for regression, including geometric semantic genetic programming (GSGP). However, KNN is a memorization, and not a learning, method, i.e. it evaluates unseen data on the basis of training observations, and not by running a learned model. This paper takes a first step towards the objective of defining a learning method able to equal KNN, by defining a new semantic mutation, called random vectors-based mutation (RVM). GP using RVM, called RVMGP, obtains results that are comparable to KNN, but still needs training data to evaluate unseen instances. A comparative analysis sheds some light on the reason why RVMGP outperforms GSGP, revealing that RVMGP is able to explore the semantic space more uniformly. This finding opens a question for the future: is it possible to define a new genetic operator, that explores the semantic space as uniformly as RVM does, but that still allows us to evaluate unseen instances without using training data?
Two Approaches Toward Graphical Definitions of Knowledge and Wisdom

Two approaches are taken here in an endeavor to discover natural definitions of knowledge and wisdom that are justifiable with respect to both theory and practice, using graph theory: (1) The metrics approach is to produce graphs that force an increase in various graph metrics, whereas (2) the dimensions approach is based on the observation that the graphical representation of aggelia in the DIKW hierarchy seems to increase in dimension with each step up the hierarchy.The dimensions method produces far more cogent definitions than the metrics method, so that is the set of definitions proposed, especially for use in artificial intelligence.
Clustered Iconography: A Resurrected Method for Representing Multidimensional Data

Development of graphical methods for representing data has not kept up with progress in statistical techniques. This article presents a brief history of graphical representations of research findings and makes the case for a revival of methods developed in the early and mid-twentieth century, notably ISOTYPE and Chernoff’s faces. It resurrects and improves a procedure, clustered iconography, which enables the presentation of multidimensional data through which readers engage more effectively with the presentation’s central message by way of an easier understanding of relationships between variables. The proposed technique is especially well adapted to the needs and protocols of open-source research.
Structure Oriented Local Image Feature Description

Abstract In this paper, we proposed a structure oriented descriptor (SOD) for local image feature description. Different from the traditional methods, we explored the structure information via hierarchical strategy and structure coding elements. Firstly, the support region is partitioned into hierarchical sub-regions according to the intensity orders. Secondly, a pre-designed structure coding image is explored to pooling the features according to the hierarchical sub-regions. The final descriptor is a conjunction of the feature of each sub-region. We evaluated the proposed descriptor on the public dataset and compared it with the state-of-the-art works. The experimental results indicate that the proposed descriptor is robust to image appearance change and outperform the state-of-the-art works in most cases.
Route Planning of Intelligent Aircraft under Multiple Constraints

Abstract In the study of multi-constraint route planning, the commonly used methods include genetic algorithm (GA), particle swarm optimization (PSO) etc. However, these algorithms are often too complex in practical applications and often get local optimal solutions when the number of calculations is too small. In this paper, we proposed the tangential progressive correction (TPC) model to solve the problem of route planning, it’s a kind of guided model with the characteristics of simple realization, good results and high calculation speed for planning aircraft route problem. At the end of the paper, we provided the simulation for relevant data.
Capacity-achieving private information retrieval scheme with a smaller sub-packetization

<p style='text-indent:20px;'>Private information retrieval (PIR) allows a user to retrieve one out of <inline-formula><tex-math id="M1">\begin{document}$ M $\end{document}</tex-math></inline-formula> messages from <inline-formula><tex-math id="M2">\begin{document}$ N $\end{document}</tex-math></inline-formula> servers without revealing the identity of the desired message. Every message consists of <inline-formula><tex-math id="M3">\begin{document}$ L $\end{document}</tex-math></inline-formula> symbols (packets) from an additive group and the length <inline-formula><tex-math id="M4">\begin{document}$ L $\end{document}</tex-math></inline-formula> is called the sub-packetization. A PIR scheme with download cost (DC) <inline-formula><tex-math id="M5">\begin{document}$ D/L $\end{document}</tex-math></inline-formula> is implemented by querying <inline-formula><tex-math id="M6">\begin{document}$ D $\end{document}</tex-math></inline-formula> sums of the symbols to servers. We assume that each uncoded server can store up to <inline-formula><tex-math id="M7">\begin{document}$ tLM/N $\end{document}</tex-math></inline-formula> symbols, <inline-formula><tex-math id="M8">\begin{document}$ t\in\{1,2,\cdots,N\} $\end{document}</tex-math></inline-formula>. The minimum DC of storage constrained PIR was determined by Attia <i>et al.</i> in 2018 to be <inline-formula><tex-math id="M9">\begin{document}$ DC_{min} = 1+1/t+1/t^{2}+\cdots+1/t^{M-1} $\end{document}</tex-math></inline-formula>. The capacity of storage constrained PIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired symbols that can be privately retrieved per bit of downloaded symbols. Tandon <i>et al.</i> designed a capacity-achieving PIR scheme with sub-packetization <inline-formula><tex-math id="M10">\begin{document}$ L' = {N\choose t}t^{M} $\end{document}</tex-math></inline-formula> of each message. In this paper, we design a PIR scheme with <inline-formula><tex-math id="M11">\begin{document}$ t $\end{document}</tex-math></inline-formula> times smaller sub-packetization <inline-formula><tex-math id="M12">\begin{document}$ L'/t $\end{document}</tex-math></inline-formula> and with the minimum DC for any parameters <inline-formula><tex-math id="M13">\begin{document}$ N, M, t $\end{document}</tex-math></inline-formula>. We also prove that <inline-formula><tex-math id="M14">\begin{document}$ t^{M-1} $\end{document}</tex-math></inline-formula> is a factor of sub-packetization <inline-formula><tex-math id="M15">\begin{document}$ L $\end{document}</tex-math></inline-formula> for any capacity-achieving PIR scheme from storage constrained servers.