Reviewerly/exHarmony huggingface dataset:
The Allocation Scheme of Software Development Budget with Minimal Conflict Attributes

During the process of software development, a significant challenge revolves around accurately estimating the associated costs. The primary goal of project managers is to ensure the delivery of a highly trustworthiness product that aligns with the designated budgetary constraints. Nonetheless, the trustworthiness of software hinges upon a range of distinct attributes. When implementing a budget allocation scheme to enhance these attributes, conflicts among them may arise. Thus, it becomes imperative to select an appropriate allocation scheme that effectively mitigates conflict-associated costs. In this paper, we will define the conflict costs and establish costs estimation models. The difficulty coefficient constraint for improving attributes is established. Subsequently, we will analyze the relative importance weights of these attributes. Drawing upon the conflict costs, importance weights, and difficulty coefficient constraint, we present an algorithm to determine an appropriate budget allocation scheme, which can minimize conflict-associated costs. Finally, we provide an illustrative example that demonstrates the practicability of our proposed algorithm. This research offers valuable insights to software managers, aiding them in the reasonable allocation of budgetary resources, thereby maximizing overall benefits.
Association Analysis

We have learned that correlation measures the linear association strength between two numerical variables. While correlation study requires the two variables to be numeric and only measures the linear relationship, association analysis has no such restriction. Association analysis measures the strength of co-occurrence between two or more variables. It is an effective data mining technique for cross-selling, and it also has applications in biomedical research such as gene network study.
A Machine Learning Approach for the Identification of Learners' Misconceptions in Algebraic Problem-Solving

Misconceptions play a significant role in the learning process as they reflect an inaccurate understanding of a particular concept. Error diagnosis can help teachers and intelligent learning environments determine the most appropriate type of student assistance. Previously, misconceptions were identified using rule-based expert systems (bug libraries) and clustering algorithms. Bug libraries demand extensive work from developers to identify all potential misconceptions and code rules for each one in advance. Additionally, these solutions cannot detect misconceptions for which rules were not explicitly programmed. Clustering-based solutions overcome these drawbacks by automatically identifying misconceptions based on students' most common errors. To effectively and efficiently identify misconceptions, clustering solutions must have a suitable representation of the problem and its steps, and employ machine learning algorithms capable of discerning patterns from them. This paper proposes a solution that utilizes expression trees to represent algebraic problem-solving steps and the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm to identify misconceptions by clustering similar errors in a database containing 1064 steps from 112 students. This database was collected from an intelligent learning system designed to assist in solving first-degree equations. In our final solution, a Natural Language Processing tokenizer was employed to represent each term numerically, which identified 178 homogeneous clusters with minimal noise and few outliers.
Correction to “Board-Game-Based Online Methodology Improves Student Learning and Sense of Well-Being during the COVID-19 Pandemic”

ADVERTISEMENT RETURN TO ISSUEPREVAddition/CorrectionNEXTORIGINAL ARTICLEThis notice is a correctionCorrection to “Board-Game-Based Online Methodology Improves Student Learning and Sense of Well-Being during the COVID-19 Pandemic”Caterina G. C. Marques Netto*Caterina G. C. Marques NettoMore by Caterina G. C. Marques Nettohttps://orcid.org/0000-0002-3285-4129Cite this: J. Chem. Educ. 2023, 100, 10, 4161Publication Date (Web):September 29, 2023Publication History Published online29 September 2023Published inissue 10 October 2023https://doi.org/10.1021/acs.jchemed.3c00917Copyright © 2023 American Chemical Society and Division of Chemical Education, Inc.Request reuse permissions This publication is free to access through this site. Learn MoreArticle Views185Altmetric-Citations-LEARN ABOUT THESE METRICSArticle Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.Citations are the number of other articles citing this article, calculated by Crossref and updated daily. Find more information about Crossref citation counts.The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information on the Altmetric Attention Score and how the score is calculated. Share Add toView InAdd Full Text with ReferenceAdd Description ExportRISCitationCitation and abstractCitation and referencesMore Options Share onFacebookTwitterWechatLinked InReddit PDF (763 KB) Get e-Alertsclose Get e-Alerts
RDM+PM Checklist: Towards a Measure of Your Institution’s Preparedness for the Effective Planning of Research Data Management

A review at our institution and a number of other Australian universities was conducted to identify an optimal institutional-wide approach to Research Data Management (RDM). We found, with a few notable exceptions, a lack of clear policies and processes across institutes and no harmonisation in the approaches taken. We identified limited methods in place to cater for the development of Research Data Management Plans (RDMPs) across different disciplines, project types and no identifiable business intelligence (BI) for auditing or oversight. When interviewed, many researchers were not aware of their institution&rsquo;s RDM policy, whilst others did not understand how it was relevant to their research. It was also discovered that primary materials (PM), which are often directly linked to the effective management of research data, were not well covered. Additionally, it was unclear in understanding who was the data custodian responsible for overall oversight, and there was a lack of clear guidance on the roles and responsibilities of researchers and their supervisors. These findings indicate that institutions are at risk in terms of meeting regulatory requirements and managing data effectively and safely. In this paper, we outline an alternative approach focusing on RDM &lsquo;Planning&rsquo; rather than on RDMPs themselves. We developed simple-to-understand guidance for researchers on the redeveloped RDM policy, which was implemented via an online &lsquo;RDM+PM Checklist&rsquo; tool that guides researchers and students. Moreover, as it is a structured tool, it provides real-time business intelligence that can be used to measure how compliant the organisation is and ideally identify opportunities for continuous improvement.
Self-Expressive Network-Based Subspace Clustering for Deep Embedding

Existing deep subspace clustering algorithms are difficult to scale to large-scale data. There are two reasons: Firstly, the existing subspace clustering algorithms almost all need to find the self-expressive coefficient matrix whose size is proportional to the square of the data set size at once. Secondly, spectral clustering needs to solve the eigenvector of the affinity matrix. These two points make the computational complexity of clustering very high when the data scale is large. This paper proposes Self-Expressive Network-Based Deep Embedded Subspace Clustering (SE-DESC), a subspace clustering method that can be applied to large-scale single-view and multi-view data. Using the idea of siamese networks, we design a self-expressive network to calculate the self-expressive coefficient between two data points, reducing the parameter amount of the self-expressive model to a constant. It can effectively avoid computational complexity. Then, we use a deeply embedded network to learn an embedding for each data point to map the data into the spectral space, avoiding the high computational complexity of spectral clustering. Extensive experiments demonstrate that SE-DESC improves the clustering performance on large-scale data compared to state-of-the-art methods.
POINE2: Improving Poincaré Embeddings for Hierarchy-Aware Complex Query Reasoning over Knowledge Graphs

Reasoning complex logical queries on incomplete and massive knowledge graphs (KGs) remains a significant challenge. The prevailing method for this problem is query embedding, which embeds KG units (i.e., entities and relations) and complex queries into low-dimensional space. Recent developments in the field show that embedding queries as geometric shapes is a viable means for modeling entity set and logical relationships between them. Despite being promising, current geometric-based methods face challenges in capturing hierarchical structures of complex queries, which leaves considerable room for improvement. This paper presents POINE2, a geometric-based query embedding framework based on hyperbolic geometry to handle complex queries on knowledge graphs. POINE2 maps entities and queries as geometric shapes on a Cartesian product space of Poincaré ball spaces. To capture the hierarchical structures of complex queries, we use the Poincaré radius to represent the different levels of the hierarchy, and we use the aperture of the shape to indicate semantic differences at the same level of the hierarchy. Additionally, POINE2 offers a flexible and expressive definition of logical operations. Experimental results show that POINE2 outperforms existing salient geometric-based embedding methods and significantly improves these methods on evaluation datasets.
Efficient Information Modulation Network for Image Super-Resolution

Recent researches have shown that the success of Transformers comes from their macro-level framework and advanced components, not just their self-attention (SA) mechanism. Comparable results can be obtained by replacing SA with spatial pooling, shifting, MLP, fourier transform and constant matrix, all of which have spatial information encoding capability like SA. In light of these findings, this work focuses on combining efficient spatial information encoding technology with superior macro architectures in Transformers. We rethink spatial convolution to achieve more efficient encoding of spatial features and dynamic modulation value representations by convolutional modulation techniques. The large-kernel convolution and Hadamard product are utilizated in the proposed Multi-orders Long-range convolutional modulation (MOLRCM) layer to imitate the implementation of SA. Moreover, MOLRCM layer also achieve long-range correlations and self-adaptation behavior, similar to SA, with linear complexity. On the other hand, we also address the sub-optimality of vanilla feed-forward networks (FFN) by introducing spatial awareness and locality, improving feature diversity, and regulating information flow between layers in the proposed Spatial Awareness Dynamic Feature Flow Modulation (SADFFM) layer. Experiment results show that our proposed efficient information modulation network (EIMN) performs better both quantitatively and qualitatively. Codes and supplementary materials link: https://github.com/liux520/EIMN.
Multilingual Lexical Simplification via Paraphrase Generation

Lexical simplification (LS) methods based on pretrained language models have made remarkable progress, generating potential substitutes for a complex word through analysis of its contextual surroundings. However, these methods require separate pretrained models for different languages and disregard the preservation of sentence meaning. In this paper, we propose a novel multilingual LS method via paraphrase generation, as paraphrases provide diversity in word selection while preserving the sentence’s meaning. We regard paraphrasing as a zero-shot translation task within multilingual neural machine translation that supports hundreds of languages. After feeding the input sentence into the encoder of paraphrase modeling, we generate the substitutes based on a novel decoding strategy that concentrates solely on the lexical variations of the complex word. Experimental results demonstrate that our approach surpasses BERT-based methods and zero-shot GPT3-based method significantly on English, Spanish, and Portuguese.
Deep Ensemble Robustness by Adaptive Sampling in Dropout-Based Simultaneous Training

Recent studies show that an ensemble of deep networks can have better adversarial robustness by increasing the deep feature learning diversity of base models to limit the adversarial transferability. However, existing schemes mostly rely on a second-order method for gradient regularization which usually involves a heavy computation overhead. In this paper, we propose a simple yet effective method which eliminates the use of a second-order optimization and significantly reduces the computation complexity of regularized simultaneous training of deep ensemble networks. For the first time, we show analytically that stochastic regularization by the proposed approach can promote both model smoothness and feature diversity of representation learning in the deep space. We also show that the proposed method is able to achieve a better gain of certified robustness. This is due to the effect of a prioritized feature selection enabled by an adaptive and continuous sampling of neuron activation among the base networks. Experimental results show that our method can improve adversarial robustness significantly comparing with the existing ensemble models on several image benchmark datasets. The ensemble performance can be further boosted by complementing the stochastic regularization approach with other defense paradigms such as adversarial training.
DeepDiscord: Dual Contrastive Coding for Transferable Time Series Anomaly Detection

Time series anomaly detection has attracted extensive research attention owing to its real-world applications. Existing deep learning based anomaly detectors usually require a separate training phase for each dataset. However, the long training time restricts their practicality in the industry use. To address this limitation, we propose a novel deep learning based discord search method named DeepDiscord, which is a multi-scale anomaly detector capable of directly examining unseen datasets after pre-training. To the best of our knowledge, our study is the first to introduce contrastive learning in the discord search, in order to provide a flexible and effective similarity measure for various kinds of data. We innovatively divide the data into two categories according to their roles in discord search, and combine dual learning with contrastive learning, which improves the efficiency and efficacy of discord search. Furthermore, a novel pretext task is proposed based on our dual contrastive learning setting. We evaluate DeepDiscord comprehensively on five anomaly detection benchmarks. Experimental results show that DeepDiscord achieves the state-of-the-art results on the four out of five benchmarks.
Effective and Efficient Community Search with Graph Embeddings

Given a graph G and a query node q, community search (CS) seeks a cohesive subgraph from G that contains q. CS has gained much research interests recently. In the database research community, researchers aim to find the most cohesive subgraph satisfying a specific community model (e.g., k-core or k-truss) via graph traversal. These works obtain good precision, however suffering from the low efficiency issue. In the AI research community, a new thought of using the deep learning model to support CS without relying on graph traversal emerges. Supervised end-to-end models using GCN are presented, which perform efficiently, but leave a large room for precision improvement. None of them can achieve a good balance between the efficiency and effectiveness. This motivates our solution: First, we present an offline community-injected graph embedding method to preserve the community’s cohesiveness features into the learned node representations. Second, we resort to a proximity graph (PG) built from node representations, to quickly return the community online. Moreover, we develop a self-augmented method based on KL divergence to further optimize node representations. Extensive experiments on seven real-world graphs show our solution’s superiority on effectiveness (at least 39.3% improvement) and efficiency (one to two orders of magnitude faster).
Multi-Domain Learning from Insufficient Annotations

Multi-domain learning (MDL) refers to simultaneously constructing a model or a set of models on datasets collected from different domains. Conventional approaches emphasize domain-shared information extraction and domain-private information preservation, following the shared-private framework (SP models), which offers significant advantages over single-domain learning. However, the limited availability of annotated data in each domain considerably hinders the effectiveness of conventional supervised MDL approaches in real-world applications. In this paper, we introduce a novel method called multi-domain contrastive learning (MDCL) to alleviate the impact of insufficient annotations by capturing both semantic and structural information from both labeled and unlabeled data. Specifically, MDCL comprises two modules: inter-domain semantic alignment and intra-domain contrast. The former aims to align annotated instances of the same semantic category from distinct domains within a shared hidden space, while the latter focuses on learning a cluster structure of unlabeled instances in a private hidden space for each domain. MDCL is readily compatible with many SP models, requiring no additional model parameters and allowing for end-to-end training. Experimental results across five textual and image multi-domain datasets demonstrate that MDCL brings noticeable improvement over various SP models. Furthermore, MDCL can further be employed in multi-domain active learning (MDAL) to achieve a superior initialization, eventually leading to better overall performance.
Extracting and Exploiting Bounds of Numeric Variables for Optimal Linear Numeric Planning

In numeric AI planning, a state is represented by propositions and numeric variables, actions change the values of numeric variables in addition to adding and deleting propositions, and goals and preconditions of actions may include conditions over numeric variables. While domains of numeric variables are rational numbers in general, upper and lower bounds on variables affected only by constant increase and decrease can sometimes be determined and exploited by a heuristic function. In this paper, we generalize the existing method to variables that are changed by linear effects. We exploit the extracted bounds to improve the numeric LM-cut heuristic, a state-of-the-art admissible heuristic for linear numeric planning. Empirical evaluation shows that our method improves the performance of LM-cut in multiple domains. The proposed method can also detect unsolvability of some numeric tasks in polynomial time.
On Solution Discovery via Reconfiguration

The dynamics of real-world applications and systems require efficient methods for improving infeasible solutions or restoring corrupted ones by making modifications to the current state of a system in a restricted way. We propose a new framework of solution discovery via reconfiguration for constructing a feasible solution for a given problem by executing a sequence of small modifications starting from a given state. Our framework integrates different aspects of classical local search, reoptimization, and combinatorial reconfiguration. We exemplify our framework on a multitude of fundamental combinatorial problems, namely VERTEX COVER, INDEPENDENT SET, DOMINATING SET, and COLORING. We study the classical as well as the parameterized complexity of the solution discovery variants of those problems and explore the boundary between tractable and intractable instances.
Scaling-Up LAO* in FOND Planning: An Ablation Study

The use of multi-queue heuristic search and tie-breaking strategies has shown to be very effective for satisficing planning in the Classical Planning setting. However, to the best of our knowledge, the use of such techniques has never been studied and employed in heuristic search algorithms for Fully Observable Non-Deterministic (FOND) Planning. In this paper, we adapt existing satisficing techniques for scaling-up an AND/OR heuristic search algorithm for FOND Planning. Namely, we employ multi-queue heuristic search, dead-end detection, and tie-breaking strategies in LAO* for improving the extraction of strong-cyclic policies. We assess the efficiency of our techniques in LAO* through an extensive ablation study over two different FOND Planning benchmarks. Empirical results show that our techniques improve the performance of LAO* in terms of coverage, expanded nodes, and planning time compared to a well-known planner based on vanilla LAO*. Indeed, the best configuration of our techniques is competitive with the current state-of-the-art in FOND Planning.
VMBRL3: A Simple Visual Model-Based Reinforcement Learning Framework for Continuous Control

Unsupervised pre-training has demonstrated its potential for accurately constructing world models in visual model-based reinforcement learning (MBRL). However, such MBRL approaches exhibit limited generalizability, thereby limiting their practicality in diverse scenarios. These methods produce models that are restricted to the specific task they were trained on, and are not easily adaptable to other tasks. In this work, we introduce a powerful unsupervised pre-training reinforcement learning (RL) framework called VMBRL3, which improves the generalization ability of visual MBRL. VMBRL3 employs task-agnostic videos to pre-train both the autoencoder and world model without access to actions or rewards information. The fine-tuned world model can then be applied to a range of downstream reinforcement learning tasks, allowing for rapid adaptation to diverse environments and facilitating policy learning. We demonstrate that our framework significantly improves generalization ability in a variety of manipulation and locomotion tasks. Furthermore, VMBRL3 doubles the sample efficiency and overall performance compared to previous visual methods of MBRL.
Effect of Trataka &amp; Neti Kriya on Efractive Errors Among Youth: A Systematic Review

Eyes are like the windows for visualization to the world. In present scenario, due to the various reasons, massive population in whole world is lacking visual efficiency that causes refractive errors anomaly. In modern medical sciences, conventional treatments are present for refractive errors but these are not enough. So, hereis a vigorous need to find other therapies to overcome this worldwide problem (RR). Yoga has that potency to overcome such problems. This ability of yogic practices has written into traditional yogic texts also. To decode and find them, different researches are happened. The aim of this research paper is to reviewing different research studies on the context of the effect of yogic practices (Trataka and NetiKriya) on refractive errors among youth.