nils-herrmann/clean_scirepeval huggingface dataset:
FINITE DIMENSIONAL REPRESENTATIONS OF W-ALGEBRAS

W -algebras of finite type are certain finitely generated associative algebras closely related to universal enveloping algebras of semisimple Lie algebras. In this paper we prove a conjecture of Premet that gives an almost complete classification of finite dimensional irreducible modules for W -algebras. Also we get some partial results towards a conjecture by Ginzburg on their finite dimensional bimodules.
Tunneling Field-Effect Transistors (TFETs) With Subthreshold Swing (SS) Less Than 60 mV/dec

We have demonstrated a 70-nm n-channel tunneling field-effect transistor (TFET) which has a subthreshold swing (SS) of 52.8 mV/dec at room temperature. It is the first experimental result that shows a sub-60-mV/dec SS in the silicon-based TFETs. Based on simulation results, the gate oxide and silicon-on-insulator layer thicknesses were scaled down to 2 and 70 nm, respectively. However, the ON/ OFF current ratio of the TFET was still lower than that of the MOSFET. In order to increase the on current further, the following approaches can be considered: reduction of effective gate oxide thickness, increase in the steepness of the gradient of the source to channel doping profile, and utilization of a lower bandgap channel material
Towards Time-Sensitive Truth Discovery in Social Sensing Applications

This paper develops a new principled framework for exploiting time-sensitive information to improve the truth discovery accuracy in social sensing applications. This work is motivated by the emergence of social sensing as a new paradigm of collecting observations about the physical environment from humans or devices on their behalf. These observations maybe true or false, and hence are viewed as binary claims. A fundamental problem in social sensing applications lies in ascertaining the correctness of claims and the reliability of data sources. We refer to this problem as truth discovery. Time is a critical dimension that needs to be carefully exploited in the truth discovery solutions. In this paper, we develop a new time-sensitive truth discovery scheme that explicitly incorporates the source responsiveness and the claim lifespan into a rigorous analytical framework. The new truth discovery scheme solves a maximum likelihood estimation problem to determine both the claim correctness and the source reliability. We compare our time-sensitive scheme with the state-of-the-art baselines through an extensive simulation study and a real world case study. The evaluation results showed that our new scheme outperforms all compared baselines and significantly improves the truth discovery accuracy in social sensing applications.
Click “Like” to Change Your Behavior: A Mixed Methods Study of College Students’ Exposure to and Engagement With Facebook Content Designed for Weight Loss

Overweight or obesity is prevalent among college students and many gain weight during this time. Traditional face-to-face weight loss interventions have not worked well in this population. Facebook is an attractive tool for delivering weight loss interventions for college students because of its popularity, potential to deliver strategies found in successful weight loss interventions, and ability to support ongoing adaptation of intervention content.



The objective of this study was to describe participant exposure to a Facebook page designed to deliver content to overweight/obese college students in a weight loss randomized controlled trial (N=404) and examine participant engagement with behavior change campaigns for weight loss delivered via Facebook.



The basis of the intervention campaign model were 5 self-regulatory techniques: intention formation, action planning, feedback, goal review, and self-monitoring. Participants were encouraged to engage their existing social network to meet their weight loss goals. A health coach moderated the page and modified content based on usage patterns and user feedback. Quantitative analyses were conducted at the Facebook post- and participant-level of analysis. Participant engagement was quantified by Facebook post type (eg, status update) and interaction (eg, like) and stratified by weight loss campaign (sequenced vs nonsequenced). A subset of participants were interviewed to evaluate the presence of passive online engagement or "lurking."



The health coach posted 1816 unique messages to the study's Facebook page over 21 months, averaging 3.45 posts per day (SD 1.96, range 1-13). In all, 72.96% (1325/1816) of the posts were interacted with at least once (eg, liked). Of these, approximately 24.75% (328/1325) had 1-2 interactions, 23.39% (310/1325) had 3-5 interactions, 25.13% (333/1325) had 6-8 interactions, and 41 posts had 20 or more interactions (3.09%, 41/1325). There was significant variability among quantifiable (ie, visible) engagement. Of 199 participants in the final intervention sample, 32 (16.1%) were highly active users and 62 (31.2%) never visibly engaged with the intervention on Facebook. Polls were the most popular type of post followed by photos, with 97.5% (79/81) and 80.3% (386/481) interacted with at least once. Participants visibly engaged less with posts over time (partial r=-.33; P<.001). Approximately 40% of the participants interviewed (12/29, 41%) reported passively engaging with the Facebook posts by reading but not visibly interacting with them.



Facebook can be used to remotely deliver weight loss intervention content to college students with the help of a health coach who can iteratively tailor content and interact with participants. However, visible engagement with the study's Facebook page was highly variable and declined over time. Whether the level of observed engagement is meaningful in terms of influencing changes in weight behaviors and outcomes will be evaluated at the completion of the overall study.
A wearable haptic game controller

This paper outlines the development of a wearable game controller incorporating vibrotacticle haptic feedback that provides a low cost, versatile and intuitive interface for controlling digital games. The device differs from many traditional haptic feedback implementation in that it combines vibrotactile based haptic feedback with gesture based input, thus becoming a two way conduit between the user and the virtual environment. The device is intended to challenge what is considered an “interface” and draws on work in the area of Actor-Network theory to purposefully blur the boundary between man and machine. This allows for a more immersive experience, so rather than making the user feel like they are controlling an aircraft the intuitive interface allows the user to become the aircraft that is controlled by the movements of the user's hand. This device invites playful action and thrill. It bridges new territory on portable and low cost solutions for haptic controllers in a gaming context.
Hierarchical Reinforcement Learning with Deep Nested Agents

Deep hierarchical reinforcement learning has gained a lot of attention in recent years due to its ability to produce state-of-the-art results in challenging environments where non-hierarchical frameworks fail to learn useful policies. However, as problem domains become more complex, deep hierarchical reinforcement learning can become inefficient, leading to longer convergence times and poor performance. We introduce the Deep Nested Agent framework, which is a variant of deep hierarchical reinforcement learning where information from the main agent is propagated to the low level nested agent by incorporating this information into the nested agent’s state. We demonstrate the effectiveness and performance of the Deep Nested Agent framework by applying it to three scenarios in Minecraft with comparisons to a deep non-hierarchical single agent framework, as well as, a deep hierarchical framework.
Robust kernel Isomap

Isomap is one of widely-used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional scaling). In this paper we pay our attention to two critical issues that were not considered in Isomap, such as: (1) generalization property (projection property); (2) topological stability. Then we present a robust kernel Isomap method, armed with such two properties. We present a method which relates the Isomap to Mercer kernel machines, so that the generalization property naturally emerges, through kernel principal component analysis. For topological stability, we investigate the network flow in a graph, providing a method for eliminating critical outliers. The useful behavior of the robust kernel Isomap is confirmed through numerical experiments with several data sets.
The Inverse Mean Curvature Flow and the Riemannian Penrose Inequality

LetM be an asymptotically flat 3-manifold of nonnegative scalar curvature. The Riemannian Penrose Inequality states that the area of an outermost minimal surface N in M is bounded by the ADM mass m according to the formula |N | ≤ 16πm2. We develop a theory of weak solutions of the inverse mean curvature flow, and employ it to prove this inequality for each connected component of N using Geroch’s monotonicity formula for the ADM mass. Our method also proves positivity of Bartnik’s gravitational capacity by computing a positive lower bound for the mass purely in terms of local geometry. 0.  In this paper we develop the theory of weak solutions for the inverse mean curvature flow of hypersurfaces in a Riemannian manifold, and apply it to prove the Riemannian Penrose Inequality for a connected horizon, to wit: the total mass of an asymptotically flat 3-manifold of nonnegative scalar curvature is bounded below in terms of the area of each smooth, compact, connected, “outermost” minimal surface in the 3-manifold. A minimal surface is called outermost if it is not separated from infinity by any other compact minimal surface. The result was announced in . The first author acknowledges the support of Sonderforschungsbereich 382, Tübingen. The second author acknowledges the support of an NSF Postdoctoral Fellowship, NSF Grants DMS-9626405 and DMS-9708261, a Sloan Foundation Fellowship, and the Max-Planck-Institut for Mathematics in the Sciences, Leipzig.  May 15, 1998.
Ontology Matching Approaches for eRecruitment

Ontology researches have been carried out in many diverse research areas in the past decade for numerous purposes especially in the eRecruitment domain. In this article, we would like to take a closer look on the current work of such domain of ontologies such as eRecruitment. Ontology application for e-Recruitment is becoming an important task for matching job postings and applicants semantically in a Semantic web technology using ontology and ontology matching techniques. Most of the reviewed papers used currently (existing) available widespread standards and classifications to build human resource ontology that provide a way of semantic representation for positions offered and candidates to fulfil, some of other researches have been done created their own HR ontologies to build recruitment prototype. We have reviewed number of articles and identified few purposes for which ontology matching
Topology-independent 3D garment fitting for virtual clothing

]Using computer-aided design system to design an elegant 3D garment for a virtual human is often tedious and labor-intensive. Moreover, the garment is usually designed for a reference human model and generally not fitted to other individuals, which largely reduces the reusability of existing 3D garments. In this paper, we introduce proxy mesh to fit 3D garment to another human model whose topology or shape is different from the garment’s reference human model. Firstly, a proxy mesh is generated for the reference human model and the specified human model respectively. Secondly, the garment is parameterized based on the proxy mesh of the reference model and an independent dataset is obtained. Thirdly, the dataset is decoded to the proxy mesh of the other human model and a roughly fitted garment is gained. Lastly, local shape constrains are enforced to the fitted garment and garment-body penetrations are resolved to get a well fitted garment. Our approach is efficient, simple to implement and is potential to be applied to existing applications such as virtual try-on and virtual clothing design.
Energy Optimization for Cellular-Connected Multi-UAV Mobile Edge Computing Systems with Multi-Access Schemes

In this paper, a cellular-connected unmanned aerial vehicle (UAV) mobile edge computing system is studied where several UAVs are associated to a terrestrial base station (TBS) for computation offloading. To compute the large amount of data bits, a part of computation task is migrated to TBS and the other part is locally handled at UAVs. Our goal is to minimize the total energy consumption of all UAVs by jointly adjusting the bit allocation, power allocation, resource partitioning as well as UAV trajectory under TBS’s energy budget. For deeply comprehending the impact of multi-UAV access strategy on the system performance, four access schemes in the uplink transmission is considered, i.e., time division multiple access, orthogonal frequency division multiple access, one-by-one access and non-orthogonal multiple access. The involved problems under different access schemes are all formulated in non-convex forms, which are difficult to be tackled optimally. To solve this class of problem, the successive convex approximation technique is employed to obtain the suboptimal solutions. The numerical results show that the proposed scheme save significant energy consumption compared with the benchmark schemes.
Whole genome comparative analysis of four Georgian grape cultivars

Grapevine is the one of the most important fruit species in the world. Comparative genome sequencing of grape cultivars is very important for the interpretation of the grape genome and understanding its evolution. The genomes of four Georgian grape cultivars—Chkhaveri, Saperavi, Meskhetian green, and Rkatsiteli, belonging to different haplogroups, were resequenced. The shotgun genomic libraries of grape cultivars were sequenced on an Illumina HiSeq. Pinot Noir nuclear, mitochondrial, and chloroplast DNA were used as reference. Mitochondrial DNA of Chkhaveri closely matches that of the reference Pinot noir mitochondrial DNA, with the exception of 16 SNPs found in the Chkhaveri mitochondrial DNA. The number of SNPs in mitochondrial DNA from Saperavi, Meskhetian green, and Rkatsiteli was 764, 702, and 822, respectively. Nuclear DNA differs from the reference by 1,800,675 nt in Chkhaveri, 1,063,063 nt in Meskhetian green, 2,174,995 in Saperavi, and 5,011,513 in Rkatsiteli. Unlike mtDNA Pinot noir, chromosomal DNA is closer to the Meskhetian green than to other cultivars. Substantial differences in the number of SNPs in mitochondrial and nuclear DNA of Chkhaveri and Pinot noir cultivars are explained by backcrossing or introgression of their wild predecessors before or during the process of domestication. Annotation of chromosomal DNA of Georgian grape cultivars by MEGANTE, a web-based annotation system, shows 66,745 predicted genes (Chkhaveri—17,409; Saperavi—17,021; Meskhetian green—18,355; and Rkatsiteli—13,960). Among them, 106 predicted genes and 43 pseudogenes of terpene synthase genes were found in chromosomes 12, 18 random (18R), and 19. Four novel TPS genes not present in reference Pinot noir DNA were detected. Two of them—germacrene A synthase (Chromosome 18R) and (−) germacrene D synthase (Chromosome 19) can be identified as putatively full-length proteins. This work performs the first attempt of the comparative whole genome analysis of different haplogroups of Vitis vinifera cultivars. Based on complete nuclear and mitochondrial DNA sequence analysis, hypothetical phylogeny scheme of formation of grape cultivars is presented.
Toward Adaptive VR Simulators Combining Visual, Haptic, and Brain-Computer Interfaces

The next generation of VR simulators could take into account a novel input: the user's mental state, as measured with electrodes and a brain-computer interface. One illustration of this promising path is a project that adapted a guidance system's force feedback to the user's mental workload in real time. A first application of this approach is a medical training simulator that provides virtual assistance that adapts to the trainee's mental activity. Such results pave the way to VR systems that will automatically reconfigure and adapt to their users' mental states and cognitive processes.
A GPU-based WFST Decoder with Exact Lattice Generation

We describe initial work on an extension of the Kaldi toolkit that supports weighted finite-state transducer (WFST) decoding on Graphics Processing Units (GPUs). We implement token recombination as an atomic GPU operation in order to fully parallelize the Viterbi beam search, and propose a dynamic load balancing strategy for more efficient token passing scheduling among GPU threads. We also redesign the exact lattice generation and lattice pruning algorithms for better utilization of the GPUs. Experiments on the Switchboard corpus show that the proposed method achieves identical 1-best results and lattice quality in recognition and confidence measure tasks, while running 3 to 15 times faster than the single process Kaldi decoder. The above results are reported on different GPU architectures. Additionally we obtain a 46-fold speedup with sequence parallelism and multi-process service (MPS) in GPU.
Leaching of halogen-free and brominated flame retardants from polymers-Influence of leaching parameters Submitted to Journal of Hazardous Materials

The ban and restrictions on some of the brominated flame retardants (BFRs) has led to an increase in use and production of alternatives such as halogenated free flame retardants (HFFRs). Limited information is available on the occurrence and fate of inorganic HFFRs. Inorganic HFFRs such as aluminum polyphosphinate (AlPi), melamine polyphosphate (MPP) and zincstannate (ZS), dissociate into ions in the environment and are difficult to trace back. Therefore, we studied the leachability of HFFRs from manufactured polymeric FR combinations in comparison with BFRs. Both HFFRs and BFRs leach from the polymers and may end up in the environment. Particle size, pH, porosity (adding synergist), surface structure, impact strength and strength of break are determining factors in the leaching behaviour of the FRs. Many of these parameters are related to the polymer type, which is the main parameter determining leaching behaviour. Differences in leaching behaviour between HFFRs and BFRs have been observed for the polymers polyamide (PA), polybutylene terephthalate (PBT) and epoxy resins (EPR). These polymer showed also the highest leaching properties. Almost no FRs leached from high impact polystyrene (HIPS)/polyphenylene ether (PPE/HIPS) and polycarbonate/acrylonitrile butadiene styrene (PC/ABS polymers). Therefore, no differences between HFFRs and BFRs were observed. This study contributes to a better understanding of the fate of inorganic HFFRs from polymers. In addition, it provides relevant information for reduction of the leaching of FRs from polymers.
High-Dimensional Data Analysis : The Curses and Blessings of Dimensionality

The coming century is surely the century of data. A combination of blind faith and serious purpose makes our society invest massively in the collection and processing of data of all kinds, on scales unimaginable until recently. Hyperspectral Imagery, Internet Portals, Financial tick-by-tick data, and DNA Microarrays are just a few of the betterknown sources, feeding data in torrential streams into scientific and business databases worldwide. In traditional statistical data analysis, we think of observations of instances of particular phenomena (e.g. instance ↔ human being), these observations being a vector of values we measured on several variables (e.g. blood pressure, weight, height, ...). In traditional statistical methodology, we assumed many observations and a few, wellchosen variables. The trend today is towards more observations but even more so, to radically larger numbers of variables – voracious, automatic, systematic collection of hyper-informative detail about each observed instance. We are seeing examples where the observations gathered on individual instances are curves, or spectra, or images, or even movies, so that a single observation has dimensions in the thousands or billions, while there are only tens or hundreds of instances available for study. Classical methods are simply not designed to cope with this kind of explosive growth of dimensionality of the observation vector. We can say with complete confidence that in the coming century, high-dimensional data analysis will be a very significant activity, and completely new methods of high-dimensional data analysis will be developed; we just don’t know what they are yet. Mathematicians are ideally prepared for appreciating the abstract issues involved in finding patterns in such high-dimensional data. Two of the most influential principles in the coming century will be principles originally discovered and cultivated by mathematicians: the blessings of dimensionality and the curse of dimensionality. The curse of dimensionality is a phrase used by several subfields in the mathematical sciences; I use it here to refer to the apparent intractability of systematically searching through a high-dimensional space, the apparent intractability of accurately approximating a general high-dimensional function, the apparent intractability of integrating a high-dimensional function. The blessings of dimensionality are less widely noted, but they include the concentration of measure phenomenon (so-called in the geometry of Banach spaces), which means that certain random fluctuations are very well controlled in high dimensions and the success of asymptotic methods, used widely in mathematical statistics and statistical physics, which suggest that statements about very high-dimensional settings may be made where moderate dimensions would be too complicated. There is a large body of interesting work going on in the mathematical sciences, both to attack the curse of dimensionality in specific ways, and to extend the benefits