Miracle-dz/UniFAR-FTUs huggingface dataset:
Promoting socially shared metacognitive regulation in collaborative project-based learning: a framework for the design of structured guidance

ABSTRACT Despite the emergence of collaborative project-based learning in higher education settings, how it can be supported has received little attention. We noted the positive impact of socially shared metacognitive regulation on students’ collaboration processes. The purpose of this study was to present a framework for the design and implementation of socially shared metacognitive regulation supports. We (a) proposed a framework for designing guidance for socially shared metacognitive regulation and (b) implemented the design as collaboration scripts. An empirical study was conducted to validate the framework by examining the effect of collaboration script on 32 students’ interactions in a real setting. Data included 2695 utterances resulting from participants’ team discussions. The results indicated that the collaboration scripts used to support socially shared metacognitive regulation positively influenced participants’ interactions regarding team planning and knowledge construction. The findings provide validation for the suggested framework. Implications for research and practice were also discussed.
GPU accelerated pathfinding

In the past few years the graphics programmable processor (GPU) has evolved into an increasingly convincing computational resource for non graphics applications. The GPU is especially well suited to address problem sets expressed as data parallel computation with the same program executed on many data elements concurrently. In pursuing a scalable navigation planning approach for many thousands of agents in crowded game scenes, developers became more attracted to decomposable movement algorithms that lend to explicit parallelism. Pathfinding is one key computational intelligence action in games that is typified by intense search over sparse graph data structures. This paper describes an efficient GPU implementation of parallel global pathfinding using the CUDA programming environment, and demonstrates GPU performance scale advantage in executing an inherently irregular and divergent algorithm.
A Novel DC-Bus Sensor-less MPPT Technique for Single-Stage PV Grid-Connected Inverters

Single-stage grid connected inverters are considered as an economic, compact and simple topology compared with multi-stage inverters. In photovoltaic (PV) grid connected systems, the major requirement is to achieve maximum output power from the source. Maximum Power Point Tracking (MPPT) techniques require measurements on the DC side of the inverter connected to the PV in order to determine the current operating point on the power characteristics. Typically this is achieved by perturbing the reference output power and observe the change in the PV voltage, current or both. Based on the observation, it could be determined whether the current operating point is beyond or below maximum power. This paper presents an MPPT technique for a single-stage PV grid connected inverter where the MPPT algorithm determines the current operating point at different operating conditions based upon observing the inverter controller action. Such approach eliminates the requirement of sensing elements to be added to the converter which aids the advantages of the single-stage converter. Design of the utilized PV system is derived based on filter parameters, PV panel selection and controller parameters. Using simulation and practical implementation, the performance of the proposed MPPT technique is evaluated for the PV grid connected system.
A Genetic Algorithm for mapping tasks in heterogeneous computing systems

Heterogeneous computing systems require an efficient way of distributing tasks across processing nodes. The tasks have to be mapped to the processors which execute them in the shortest time possible, while keeping the processors at a similar load. Tests have shown that, in most cases, the genetic algorithm produces the best solution among all the mapping heuristics. This paper presents a Genetic Algorithm with a 3-Step Mutation which significantly increases the solution's convergence rate by using a combination of methods to mutate a chromosome. Beside the standard random approach, we implemented a targeted mutation operator which lightens the load of the most occupied processors. We also focused on different fitness functions in order to improve both the makespan and the load balance. The mutation combinations and the fitness functions are then tested to see which ones perform better and in what cases.
Low volume generic steganalysis with improved generalization

Practical Steganalysis needs to be carried blind as the Steganalyzer won't have access to any other data except for the suspicion of a covert channel. The process needs to be carried out universal with a bunch of statistical features as the Steganalyzer needs to identify stego images created with even new steganographic tools. This poses a need for the generalization of the Steganalyzer to be enhanced. The proposed approach improves the generalization of the developed Steganalyzer by training it with a group of statistical features carefully coined to characterize embedding distortions that can disturb different features of an image. The designed Steganalyzer uses mixed blind generic classification for identifying unfamiliar tools i.e., not introduced during training phase.
The Correlation between Infarct Size and the QRS Axis Change after Thrombolytic Therapy in ST Elevation Acute Myocardial Infarction.

OBJECTIVE Electrocardiography (ECG) may be a practical guiding tool for prognostic infarct sizing in ST elevation acute myocardial infarction (STEAMI). In this study, we sought to find a relation between the infarct size and the change in the QRS axis after thrombolytic therapy. MATERIALS AND METHODS Patients with STEAMI who received thrombolytic therapy were selected retrospectively. The mean QRS axes of two ECGs (before and 90 minutes after thrombolytic therapy) were calculated. Creatinine kinase MB (CKMB) was used as the marker of infarct size. RESULTS We did not detect any correlation between infarct size and change in the QRS axis with respect to any myocardial infarction MI localizations (p=0.80). However, in the isolated inferior MI group, there was a good correlation between CKMB and change in the QRS axis (r=-0.52 p=0.049). CONCLUSION The change in the QRS axis is rarely emphasized, providing a practical and promising tool for evaluating both the efficiency of the thrombolytic therapy and prognostic infarct sizing.
Order-Invariance of Two-Variable Logic is Decidable

It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for the finite satisfiability problem for existential second-order logic with two first-order variables (ESO2) on structures with two linear orders and one induced successor. We also show that finite satisfiability is decidable on structures with two successors and one induced linear order. In both cases, so far only decidability for monadic ESO2 has been known. In addition, the finite satisfiability problem for ESO2 on structures with one linear order and its induced successor relation is shown to be decidable in non-deterministic exponential time.
Enhanced partitioned scheduling of Mixed-Criticality Systems on multicore platforms

Mixed Criticality Systems (MCS) have gained increasing interest in the past few years due to their industrial relevance. When mixed-criticality systems are implemented on multicore architectures, several challenges arise such as the efficient partitioning of these systems. In this paper, we address this issue by presenting a novel mixed-criticality partitioning algorithm, the Dual-Partitioned Mixed-Criticality (DPM) algorithm, that allows limited migration of LO-criticality tasks to enhance the efficiency of the partitioning while maintaining many of the advantages of partitioned systems. Experimental results show that DPM consistently outperforms existing mixed-criticality partitioning algorithms, for example, at utilizations of 0.8 or higher, DPM is able to schedule 17% more systems.
Revisiting and Simplifying RDF

RDF, a simple yet expressive data model, is widely recognised as the foundation for the Semantic Web. We revisit the RDF speciﬁca-tion and analyse ﬁve problems: literals are not addressable, blank nodes are not addressable, reiﬁcation is not semantically recognised, language tags are not addressable, and language tags can not be combined. We introduce SiRDF, a simpliﬁed data model with fewer modelling elements that overcomes the mentioned problems, and formally show its semantic equivalence to RDF. Based on the lessons of SiRDF we recommend a restricted usage of RDF that solves the mentioned problems while fully adhering to the original RDF speciﬁcation.
A comparison of query translation methods for English-Japanese cross-language information retrieval (poster abstract)

In this paper we report results of an investigation into EnglishJapanese Cross-Language Information Retrieval (CLIR) comparing a number of query translation methods. Results from experiments using the standard BMIR-J2 Japanese collection suggest that full machine translation (MT) can outperform popular dictionary-based query translation methods and further that in this context MT is largely robust to queries with little linguistic structure.
A Customized Human Fall Detection System Using Omni-Camera Images and Personal Information

This paper proposes a new approach to detect the fall of the elderly. The detection system uses a MapCam (omni-camera) to capture images and performs image processing over the images. The personal information of each individual is considered in the processing task. The MapCam is used to capture 360deg scenes simultaneously and eliminate any blind viewing zone. The personal information is combined into the system and makes it smarter by customizing the system for each individual. With personal information such as height, weight, and electronic health history, we can adjust the detection sensitivity on a case by case basis to reduce unnecessary alarms, and put more attention on the elderly with special diseases or conditions. We perform a simple experiment to verify the feasibility of our approach. The experimental results show that the successful rates of fall detections with and without personal information are 79.8% and 68%, respectively. The Kappa value of the system is 0.798 which is higher than 0.75, showing that we have a reliable system
Mobile technology to support maintenance efficiency — Mobile maintenance in heavy industry

Mobile technologies are now mature enough to face the challenge and requirements of professional use in industry. The exploitation of mobile technologies will keep on expanding, but in heavy industry and maintenance the use of mobile solutions has not yet become popular although the interest towards mobile solutions has risen. This paper presents the mobile maintenance case study where the roles of mobile technology in strengthening the maintenance operations were researched. The aim of the research was to identify benefits of mobile technology in maintenance, to research the development process of professional mobile solutions and to evaluate the potential of new technologies in developing more value added mobile solutions in industrial environment. Research applied Solution Envisioning Approach with Capability Cases in addition to technology adoption perspective. This paper presents the results of the case study relating to industry requirements, driving forces, targets, challenges and problems. In addition to this factors affecting to acceptance and adoption of industrial mobile solutions are discussed. The mobile maintenance case study produced several Capability Cases that support more efficient maintenance by exploiting mobile technologies.
Proving sequential consistency of high-performance shared memories (extended abstract)

Relaxed consistency models such as weak consistency or release consistency may be understood as a contract between programmer and hardware designer, in which the programmer is restricted to some subset of the legal programs, and the shared memory in turn need support sequential consistency for only those programs. This paper develops a framework for proving the correctness of such high-performance shared memories. Previous work states consistency conditions for such memories in terms that reference details of the implementation. A specific base automaton is proposed as an instantiation of those architectural assumptions. A relaxed consistency condition can be understood as a restriction on the actions of this automaton, resulting in a more restricted automaton. This more restricted automaton should appear sequentially consistent to the class of programs for which the relaxed consistency condition is defined. Specific shared memories implementing this condition may be proven correct by showing they implement this restricted automaton. This framework is illustrated by studying the release consistency model for multiprocessor memory systems, which relies on a classification of memory accesses into ordinary and synchronization, such that conflicting ordinary accesses are protected by synchronization. These conditions are formalized as restrictions on the base automaton, which is shown to be sequentially consistent when driven by the class of PL programs. Finally, a specification of the consistency algorithm used by the Stanford DASH machine is shown to implement this release consistent memory. *Supported in part by DARPA contract NOO014-87-K-0828. t Supported in part by DARPA contract NOO014-87-K-0828, and by Texas Instruments. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of tie Association for Computiug Machinery. To copy otherwise, or to republisb, requires a fee and/or specific permission. @ 1991 ACM 089791-438-4/91/0007/0292 $1.50
Antitussive effect of the GABA-agonist baclofen.

BACKGROUND gamma-Aminobutyric acid (GABA) is a central inhibitory neurotransmitter that also exists in peripheral tissues, including the lung. The GABA-agonist baclofen has been shown, in animal studies, to inhibit cough via a central mechanism, but has not been investigated in humans (to our knowledge). STUDY OBJECTIVE To evaluate the antitussive effect of baclofen in normal human subjects. DESIGN Randomized, double-blind, placebo-controlled study. SETTING Academic medical center. PARTICIPANTS Twenty healthy, adult volunteers. INTERVENTIONS Subjects underwent cough challenge with inhaled capsaicin before and after a 14-day course of baclofen, 10 mg three times daily, or placebo. Capsaicin cough threshold (C5) was defined as the concentration of inhaled capsaicin inducing five or more coughs. RESULTS Subjects receiving baclofen (n=10) demonstrated a significant elevation of capsaicin cough threshold compared with placebo subjects (n=10). Mean delta log C5 after treatment was 0.48+/-0.19 (SEM) for the baclofen group, and -0.06+/-0.12 for the placebo group (p=0.024). Six of 10 subjects receiving baclofen, but none of the 10 subjects receiving placebo, demonstrated a fourfold or greater increase in capsaicin cough threshold (p=0.0054). CONCLUSION The antitussive activity of low-dose, oral baclofen demonstrated in this study supports further investigation of this drug, or other GABA-agonists, for a potential therapeutic role in the treatment of pathologic cough.
The epidemiologic transition. A theory of the epidemiology of population change.

Although demography continues to be the most prominent discipline concerned with population dynamics, involvement of other disciplines is highly desirable. The case for a multidisciplinary approach to population theory has been aptly stated by Kurt Mayer: “Any meaningful interpretation of the cause and effects of population changes must … extend beyond formal statistical measurement of the components of change, i.e. fertility, mortality and migration, and draw on the theoretical framework of several other disciplines for assistance (Mayer 1962). ” In noting that the “analysis of the causal determinants and consequences of population change forms the subject matter of population theory,” Mayer inferentially acknowledges the epidemiologic character of population phenomena, for as its etymology indicates, (epi, upon; demos, people; logos, study), epidemiology is the study of what “comes upon” groups of people. More specifically, epidemiology is concerned with the distribution of disease and death, and with their determinants and consequences in population groups. Inasmuch as patterns of health and disease are integral components of population change, epidemiology's reservoir of knowledge about these patterns and their determinants in population groups serves not only as a basis for prediction of population change but also as a source of hypotheses that can be further tested to correct, refine and build population theory. Furthermore, many epidemiologic techniques that have heretofore been limited to the examination of health and disease patterns can be profitably applied as well to the exploration of other mass phenomena, such as fertility control. A theory of epidemiologic transition, sensitive to the formulations of population theorists who have stressed the demographic, biologic, sociologic, economic and psychologic ramifications of transitional processes, was conceived by this author less than four years ago. Recognition of the limitations of demographic transition theory and of the need for comprehensive approaches to population dynamics stimulated the development of this theory (Van Nort and Karon 1955; Micklin 1968).
Genome-Wide Expression Profiling of Soybean Two-Component System Genes in Soybean Root and Shoot Tissues under Dehydration Stress

Two-component systems (TCSs) play vital functions in the adaptation of plants to environmental stresses. To identify soybean TCS genes involved in the regulation of drought stress response, we performed tissue-specific expression profiling of all 83 putative TCS genes in plants subjected to dehydration. Under well-watered conditions, the majority of soybean TCS genes were expressed higher in the root tissues. Additionally, a high variability in transcript abundance was observed for the TCS genes in both roots and shoots. Under dehydration, TCS genes were more responsive in shoots than in roots. Further analysis indicated that 50% more TCS genes were repressed by dehydration than induced. Specifically, 18 genes were induced by 2-fold or more, whereas 33 genes were down-regulated at least 2-fold by dehydration. TCS genes putatively involved in cytokinin and ethylene signallings strongly responded to dehydration, suggesting that crosstalk exists between different hormonal and stress pathways. Our study provides the first glance into the complex regulatory roles of soybean TCSs underlying their functions in response to dehydration. Additionally, these systematic expression analyses identified excellent dehydration-responsive candidate genes to further clarify soybean TCS functions in drought response and to enable the development of improved drought tolerance in transgenic soybeans.
Severity of dry eye syndrome is related to anti-dsDNA autoantibody in systemic lupus erythematosus patients without secondary Sjogren syndrome

Abstract There are as many as one-third of the systemic lupus erythematosus (SLE) patients who suffer from dry eye syndrome. To this date, dry eye syndrome in SLE patients is believed to be caused by secondary Sjogren syndrome (sSS). However, there is increasing evidence for possible independency of dry eye syndrome and sSS in patients suffering from autoimmune diseases. The purpose of this retrospective observational case series was to identify SLE patients without sSS who had dry eye syndrome, examine the correlation of different autoantibodies and dry eye severity, and determine the cause of dry eye in these patients. We included 49 consecutive SLE patients with dry eye who visited our dry eye clinic. In order to rule out sSS, these patients were all negative for anti-Sjogren's-syndrome-related antigen A and B (anti-SSA/SSB) and had no oral symptoms. Each patient's lupus activity was determined by serological tests including antidouble-stranded DNA antibody (anti-dsDNA), complement levels (C3, C4), erythrocyte sedimentation rate (ESR), and antinuclear antibody (ANA). Severity of dry eye syndrome was determined by corneal sensation (KSen), superficial punctuate keratopathy (SPK), Schirmer-I test (Schirmer), and tear film break-up time (TBUT). The autoantibodies and the dry eye parameters in each group were tested using the &khgr;2 test or the Mann–Whitney U test for normally distributed or skewed data, respectively. The anti-dsDNA showed significant correlations with KSen (P < 0.001), SPK (P < 0.001), and Schirmer (P = 0.042) but not TBUT. The C3 showed significant correlations with KSen (P < 0.001), SPK (P < 0.001), and Schirmer (P = 0.014) but not TBUT. No correlations of dry eye parameters were observed between C4, ESR, and ANA. The major finding of this study was that the severity of dry eye syndrome in SLE patients without sSS was strongly correlated with anti-dsDNA and C3 but not with C4, ESR, and ANA.
MMSE estimation of complex-valued discrete Fourier coefficients with generalized gamma priors

We consider DFT based techniques for single-channel speech enhancement. Specifically, we derive minimum mean-square error estimators of clean speech DFT coefficients based on generalized gamma prior probability density functions. Our estimators contain as special cases the well-known Wiener estimator and the more recently derived estimators based on Laplacian and twosided gamma priors. Simulation experiments with speech signals degraded by various additive noise sources verifythat theestimator based on the two-sided gamma prior is close to optimal amongst all the estimators considered in this paper.
Independence of rational points on twists of a given curve

In this paper, we study bounds for the number of rational points on twists $C'$ of a fixed curve $C$ over a number field ${\mathcal K}$, under the condition that the group of ${\mathcal K}$-rational points on the Jacobian $J'$ of $C'$ has rank smaller than the genus of $C'$. The main result is that with some explicitly given finitely many possible exceptions, we have a bound of the form $2r + c$, where $r$ is the rank of $J'({\mathcal K})$ and $c$ is a constant depending on $C$. For the proof, we use a refinement of the method of Chabauty–Coleman: the main new ingredient is to use it for an extension field of ${\mathcal K}_v$, where $v$ is a place of bad reduction for $C'$.