Miracle-dz/UniFAR-FTUs huggingface dataset:
Defragmentation of Student’s Thinking Structures in Solving Mathematical Problems based on CRA Framework

Fragmentation of thinking structures is a phenomenon of constructing information in the brain that is inefficient, thus inhibiting the process of solving mathematical problems. Fragmentation of thought structures can be traced through erroneous constructs in solving mathematical problems. To overcome fragmentation, students need to defragment the thinking structures. Defragmentation is the thinking structure rearrangement through the process of checking, repairing, and ascertaining (CRA) in solving mathematical problems. Students defragment the thinking structure under the researcher assistance through the provision of "limited intervention". Limited interventions are conducted by facilitating the occurrence of disequilibrium, cognitive conflicts, and scaffolding. In this study, five types of defragmentation of thinking structures are described: (1) defragmentation scheme knitting to arrange the occurrence fragmentation of meaningless connections, (2) defragmentation of scheme activation to arrange the occurrence fragmentation of false-pseudo construction, (3) defragmentation of connections emertionto arrange the occurrence fragmentation of nothing connection, (4) defragmentation of scheme translation adjustmentto arrange the occurrence fragmentation of translation of thinking structure, and (5) defragmentation of schemeemertion to arrange the occurrence of fragmentation of construction holes. In this study, students were asked to complete the work sheet and spoke out what was being thought (thinkaloud). In addition, students were also interviewed to explore the data that had been collected. The research data used was the result of think aloud (in the form of written data, verbal, and expression) and interview result.
The service bullwhip effect

Purpose This paper sets out to explore whether and how the bullwhip effect, as found in product supply chains, might also manifest itself in services, as well as what policies can be successful for mitigating it. Design/methodology/approach A combination of analytic methods was used—inductive case analysis and analysis of data from two service supply chains in the telecom industry. Findings Empirical evidence from two cases was examined and provides support for the presence of a service bullwhip effect. Quantitative and qualitative case data were used to explore how this effect manifests itself in services, the distinctive drivers of the bullwhip effect in services, and the managerial actions that can either trigger or mitigate these bullwhip effects. Eight propositions are developed. Three types of characteristics that potentially make the bullwhip effect worse in services than in manufacturing are identified: (1) the destabilizing effects of manual rework in otherwise automated service processes, (2) the omission of accurate and timely data on rework volumes upstream in the chain, pointing at future bullwhip effects downstream, and (3) the lack of a supply-chain mindset within the various departments jointly responsible for delivering the service, leading to longer delays in reacting to service bullwhips as they develop over time. Originality/value This paper explores an area that has been well researched in manufacturing, but not in services, and it contributes to both the theory and practice of service supply chains. Research limitations The research is based on two cases within a single industry, limiting generalizability. The propositions developed need testing in a wider set of contexts, including hybrid service and product supply chains. Practical implications The implications of this research can help organizations prevent or reduce the negative impact of planned and unplanned fluctuations in their service supply chains.
From dreams to reality: market forces and changes from occupational intention to occupational choice

ABSTRACT We empirically investigate whether the relationship between the fraction of filled apprenticeships in a particular occupation in the past and the fraction of prospective apprentices having very early intentions to train in this occupation has an impact on the decision to change the intended choice of occupation. We use a unique dataset from Switzerland containing detailed information on students’ early occupational ‘dreams’ (ages 13–14), before they undergo intensive career counselling, and combine it with information on their ultimate choice of occupation at the end of compulsory schooling (ages 15–16). The estimation results show that although the majority of students revise their initial intentions, those students who dreamed of learning an occupation with more training positions filled in previous years than peers interested in learning this occupation have a significantly higher probability of sticking to their initial dream occupation. Conversely, students who wished to train in an overly popular occupation have a higher probability of delaying the transition to upper-secondary education for at least one year, instead of switching to another occupation. In addition, we find on an aggregated level that a favourable situation on the apprenticeship market ultimately increases the premature contract termination rate due to a person-occupation-mismatch.
Compensation Management and Employee Performance in Nigeria

This study examine the effect of compensation management and employee performance in Nigeria organization. The study aim at investigating the influence of performance based compensation, competency-based-compensation and equity based-compensation on employee performance. Relevant conceptual, theoretical and empirical literatures were reviewed. The study was anchored on Human Capital Theory and Expectancy Theory. The study adopt descriptive survey research design. The study was carried out in Anambra State. The population of the study comprises 257 public secondary schools in Anambra State. The sample size for the study consists of 257employees drawn from the population of the study. The sample consists of entire population. The instrument for data collection is a structured questionnaire. The face content validity of the instrument was employee. The instrument was trial-tested on a representative sample of 20 employee randomly selected of Anambra State. In analyzing the data for the null hypotheses, Z-test was be used to test the hypotheses at 0.05 level of significance. Equity based compensation has no negative significance effect on employee performance in Nigeria organization. Competency based compensation has no negative significance effect on employee performance in Nigeria organization. Performance based compensation has no negative significance effect on employee performance in Nigeria organization. Therefore the study conclude that compensation management has significance effect on employee International Journal of Academic Research in Business and Social Sciences Vol. 9 , No. 2, Feb, 2019, E-ISSN: 2 22 2 -6990 © 2019 HRMARS 386 performance in Nigeria organization. The study recommends that every organization should make equity-based compensation as compulsory policy since equity-based compensation are used more extensively in firms for ensuring maximum performance. Every organization should formulate competency-based compensation policy, the only thing standing between the employees and a greater wage is how much they contribute and how well they perform. Management should have Performance-based compensation plans at program at every level of an organization.
Perturbations, Optimization, and Statistics

In nearly all machine learning, decisions must be made given current knowledge. Surprisingly, making what is believed to be the best decision is not always the best strategy, even when learning in a supervised learning setting. An emerging body of work on learning under different rules applies perturbations to decision and learning procedures. These methods provide simple and highly efficient learning rules with improved theoretical guarantees. This book describes perturbation-based methods developed in machine learning to augment novel optimization methods with strong statistical guarantees, offering readers a state-of-the-art overview. Chapters address recent modeling ideas that have arisen within the perturbations framework, including Perturb & MAP, herding, and the use of neural networks to map generic noise to distribution over highly structured data. They describe new learning procedures for perturbation models, including an improved EM algorithm and a learning algorithm that aims to match moments of model samples to moments of data. They discuss understanding the relation of perturbation models to their traditional counterparts, with one chapter showing that the perturbations viewpoint can lead to new algorithms in the traditional setting. And they consider perturbation-based regularization in neural networks, offering a more complete understanding of dropout and studying perturbations in the context of deep neural networks.
ASAP: As Static As Possible memory management

Today, there are various ways to manage the memory of computer programs: garbage collectors of all kinds, reference counters, regions, linear types – each with benefits and drawbacks, each fit for specific settings, each appropriate to different problems, each with their own trade-offs. Despite the plethora of techniques available, system programming (device drivers, networking libraries, cryptography applications, etc.) is still mostly done in C, even though memory management in C is notoriously unsafe. As a result, serious bugs are continuously discovered in system software. In this dissertation, we study memory management strategies with an eye out for fitness to system programming. First, we establish a framework to study memory management strategies. Often perceived as distinct categories, we argue that memory management approaches are actually part of a single design space. To this end, we establish a precise and powerful lexicon to describe memory management strategies of any kind. Using our newly established vocabulary, we further argue that this design space has not been exhaustively explored. We argue that one of the unexplored portion of this space, the static-automatic gap, contributes to the persistence of C in system programming. Second, we develop asap: a new memory management technique that fits in the static-automatic gap. Asap is fully automatic (not even annotations are required) and makes heavy use of static analysis. At compile time it inserts, in the original program, code that deallocates memory blocks as they becomes useless. We then show how asap interacts with various, advanced language features. Specifically, we extend asap to support polymorphism and mutability. Third, we compare asap with existing approaches. One of the points of comparison we use is the behavioural suitability to system programming. We also explore how the ideas from asap can be combined with other memory management strategies. We then show how asap handles programs satisfying the linear or region constraints. Finally, we explore the insights gained whilst developing and studying asap.
Some remarks on history and pre-history of Feynman path integral

One usually refers the concept of Feynman path integral to the work of Norbert Wiener on Brownian motion in the early 1920s. This view is not false and we show in this article that Wiener used the first path integral of the history of physics to describe the Brownian motion. That said, Wiener, as he pointed out, was inspired by the work of some French mathematicians, particularly Gateaux and Levy. Moreover, although Richard Feynman has independently found this notion, we show that in the course of the 1930s, while searching a kind of geometrization of quantum mechanics, another French mathematician, Adolphe Buhl, noticed by the philosopher Gaston Bachelard, had himself been close to forge such a notion. This reminder does not detract from the remarkable discovery of Feynman, which must undeniably be attributed to him. We also show, however, that the difficulties of this notion had to wait many years before being resolved, and it was only recently that the path integral could be rigorously established from a mathematical point of view.
Multipolar Order and Excitations in Rare-Earth Boride Kondo Systems

We review the cubic rare-earth boride series which displays diverse electronic states like localized 4f electron multiplets split by the crystal electric field (CEF), itinerant heavy-fermion quasiparticle bands of the Kondo lattice as well as gapped Kondo insulator or mixed-valent semiconductor states. Fairly exotic states may appear due to the 'hidden' order of multipoles carried by degenerate CEF multiplets, in addition to magnetic order present in many RB6 (R = rare earth) compounds. Most prominent are CeB6 and its La-diluted alloys which exhibit antiferro-quadrupolar and octupolar ordering enabled by the cubic G8 quartet state. The associated collective excitations are multipolar waves with a dispersion characteristic for the underlying order and accessible by inelastic neutron scattering. This localized multipolar-moment picture of R-borides is complemented by the itinerant Kondo-lattice approach. Collective spin exciton modes inside the hybridization gap around symmetry points of the Brillouin zone may appear. This has been observed in heavy-fermion metal CeB6 and in particular in the Kondo insulators YbB12 and SmB6. The latter is also the prime candidate for a strongly correlated topological insulator.
Optimal control of false discovery criteria in the two‐group model

The highly influential two‐group model in testing a large number of statistical hypotheses assumes that the test statistics are drawn independently from a mixture of a high probability null distribution and a low probability alternative. Optimal control of the marginal false discovery rate (mFDR), in the sense that it provides maximal power (expected true discoveries) subject to mFDR control, is known to be achieved by thresholding the local false discovery rate (locFDR), the probability of the hypothesis being null given the set of test statistics, with a fixed threshold. We address the challenge of controlling optimally the popular false discovery rate (FDR) or positive FDR (pFDR) in the general two‐group model, which also allows for dependence between the test statistics. These criteria are less conservative than the mFDR criterion, so they make more rejections in expectation. We derive their optimal multiple testing (OMT) policies, which turn out to be thresholding the locFDR with a threshold that is a function of the entire set of statistics. We develop an efficient algorithm for finding these policies, and use it for problems with thousands of hypotheses. We illustrate these procedures on gene expression studies.
Dynamic inverse problem for special system associated with Jacobi matrices and classical moment problems

We consider the Hamburger, Stieltjes and Hausdorff moment problems, that are problems of the construction of a Borel measure supported on a real line, on a half-line or on an interval $(0,1)$, from a prescribed set of moments. We propose a unified approach to these three problems based on using the auxiliary dynamical system with the discrete time associated with a semi-infinite Jacobi matrix. It is show that the set of moments determines the inverse dynamic data for such a system. Using the ideas of the Boundary Control method for every $N\in \mathbb{N}$ we can recover the spectral measure of a $N\times N$ block of Jacobi matrix, which is a solution to a truncated moment problem. This problem is reduced to the finite-dimensional generalized spectral problem, whose matrices are constructed from moments and are connected with well-known Hankel matrices by simple formulas. Thus the results on existence of solutions to Hamburger, Stieltjes and Hausdorff moment problems are naturally given in terms of these matrices. We also obtain results on uniqueness of the solution of moment problems, where as a main tool we use the Krein-type equations of inverse problem.
Chow groups and pseudoeffective cones of complexity one $T$-varieties

We show that the pseudoeffective cone of $k$-cycles on a complete complexity one $T$-variety is rational polyhedral for any $k$, generated by classes of $T$-invariant subvarieties. When $X$ is also rational, we give a presentation of the Chow groups of $X$ in terms of generators and relations, coming from the combinatorial data defining $X$ as a $T$-variety.
In the Galactic Disk, Stellar [Fe/H] and Age Predict Orbits and Precise [X/Fe]

We explore the structure of the element abundance–age–orbit distribution of the stars in the Milky Way’s low-α disk, by (re-)deriving precise [Fe/H], [X/Fe], and ages, along with orbits, for red clump stars from the apogee survey. There has been a long-standing theoretical expectation and observational evidence that metallicity ([Fe/H]) and age are informative about a star’s orbit, e.g., about its angular momentum and the corresponding mean Galactocentric distance or its vertical motion. Indeed, our analysis of the apogee data confirms that [Fe/H] or age alone can predict the stars’ orbits far less well than a combination of the two. Remarkably, we find and show explicitly that, for known [Fe/H] and age, the other abundances [X/Fe] of Galactic disk stars can be predicted well (on average to 0.02 dex) across a wide range of Galactocentric radii, and therefore provide little additional information, e.g., for predicting their orbit. While the age–abundance space for metal-poor stars and potentially for stars near the Galactic center is rich or complex, for the bulk of the Galaxy’s low-α disk it is simple: [Fe/H] and age contain most information, unless [X/Fe] can be measured to 0.02 or better. Consequently, we do not have the precision with current (and likely near-future) data to assign stars to their individual (coeval) birth clusters, from which the disk is presumably formed. We can, however, place strong constraints on future models of Galactic evolution, chemical enrichment, and mixing.
Functional models for time‐varying random objects

Functional data analysis provides a popular toolbox of functional models for the analysis of samples of random functions that are real valued. In recent years, samples of time‐varying object data such as time‐varying networks that are not in a vector space have been increasingly collected. These data can be viewed as elements of a general metric space that lacks local or global linear structure and therefore common approaches that have been used with great success for the analysis of functional data, such as functional principal component analysis, cannot be applied. We propose metric covariance, a novel association measure for paired object data lying in a metric space (Ω,d) that we use to define a metric autocovariance function for a sample of random Ω‐valued curves, where Ω generally will not have a vector space or manifold structure. The proposed metric autocovariance function is non‐negative definite when the squared semimetric d2 is of negative type. Then the eigenfunctions of the linear operator with the autocovariance function as kernel can be used as building blocks for an object functional principal component analysis for Ω‐valued functional data, including time‐varying probability distributions, covariance matrices and time dynamic networks. Analogues of functional principal components for time‐varying objects are obtained by applying Fréchet means and projections of distance functions of the random object trajectories in the directions of the eigenfunctions, leading to real‐valued Fréchet scores. Using the notion of generalized Fréchet integrals, we construct object functional principal components that lie in the metric space Ω. We establish asymptotic consistency of the sample‐based estimators for the corresponding population targets under mild metric entropy conditions on Ω and continuity of the Ω‐valued random curves. These concepts are illustrated with samples of time‐varying probability distributions for human mortality, time‐varying covariance matrices derived from trading patterns and time‐varying networks that arise from New York taxi trips.
Not All Bugs Are the Same: Understanding, Characterizing, and Classifying the Root Cause of Bugs

Modern version control systems such as Git or SVN include bug tracking mechanisms, through which developers can highlight the presence of bugs through bug reports, i.e., textual descriptions reporting the problem and what are the steps that led to a failure. In past and recent years, the research community deeply investigated methods for easing bug triage, that is, the process of assigning the fixing of a reported bug to the most qualified developer. Nevertheless, only a few studies have reported on how to support developers in the process of understanding the type of a reported bug, which is the first and most time-consuming step to perform before assigning a bug-fix operation. In this paper, we target this problem in two ways: first, we analyze 1,280 bug reports of 119 popular projects belonging to three ecosystems such as Mozilla, Apache, and Eclipse, with the aim of building a taxonomy of the root causes of reported bugs; then, we devise and evaluate an automated classification model able to classify reported bugs according to the defined taxonomy. As a result, we found nine main common root causes of bugs over the considered systems. Moreover, our model achieves high F-Measure and AUC-ROC (64% and 74% on overall, respectively).
Abbreviated Title : The validity and generalisability of MYCaW

Rachel Jolliffe MSc, 1 Penny Brohn Cancer Care, Pill, Bristol, England; BS20 OHH Email: rachel.jolliffe@pennybrohn.org; Tel: +44 1275 370167 Helen Seers PhD 1 Email: helen.seers@pennybrohn.org; Tel: +44 1275 370123 Sarah Jackson PhD 1 Email: sarah.jackson@pennybrohn.org; Tel: +44 1275 370139 Elena Caro MSc, Physical Therapy Department, University of Granada, Avda. del Hospicio, s/n C.P. 18071 Granada, Spain Email: elenacaromoran@gmail.com Laura Weeks PhD, Ottawa Integrative Cancer Centre, 29 Bayswater Ave, Ottawa, ON K1Y 2E5, Canada Email: LWeeks@oicc.ca; Tel: (613) 792-1222 extn 212
A Good Performance OTP Encryption Image based on DCT-DWT Steganography

The security aspect is very important in data transmission. One way to secure data is with steganography and cryptography. Surely research on this should continue to be developed to improve security. In this paper, we proposed a combination of steganographic and cryptographic algorithms for double protection during data transmission. The selected steganographic algorithm is the use of a combination of DCT and DWT domain transformations. Because the Imperceptibility aspect is a very important aspect of steganographic techniques, this aspect needs to be greatly improved. In the proposed method of DCT transformation first, proceed with DWT transformation. From the experimental results obtained better imperceptibility quality, compared with existing methods. To add OTP message security applied algorithm to encrypt the message image, before it is inserted. This is evidenced by experiments conducted on 20 grayscale images measuring 512x512 with performance tests using MSE, PSNR, and NC. Experimental results prove that DCT-DWT-OTP generates PNSR more than 50 dB, and NC of all images is 1.