检索结果-内蒙古大学图书馆

2024 IEEE International Conference on Autonomic Computing and Self-Organizing Systems, ACSOS 2024

作者： Nabavinejad, Seyed Morteza Reda, Sherief Guo, Tian Worcester Polytechnic Institute Computer Science Department WorcesterMA United States Brown University School of Engineering ProvidenceRI United States

ISBN: (纸本)9798350363876

It is a common practice to co-locate several jobs, such as DNN inference ones, on a single machine to improve resource utilization, energy efficiency, and overall performance. However, individual job performance might degrade when these jobs compete for shared resources. This degradation can in particular affect latency-sensitive jobs bound by Service Level Agreements (SLA), and result in SLA violations. To tackle this issue and mitigate the impact of interference on latency, we design a system called FairCIM. For certain applications such as image classification, various DNNs with varying accuracy and computational complexity are proposed. Upon detection of SLA violations, FairCIM dynamically switches between those DNNs to maintain the latency in the presence of co-location interference. To ensure fairness, FairCIM selects the jobs for DNN switching based on their resource utilization. We conduct experiments using diverse DNNs, datasets, and hardware platforms to evaluate the FairCIM effectiveness. Compared to another approach that uses a resource exchange mechanism, FairCIM's flexibility achieved by DNN switching substantially reduces SLA violations and improves the effective accuracy by up to 244%. © 2024 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Graph Coordinates and Conventional Neural Networks - An Alternative for Graph Neural Networks

Graph Coordinates and Conventional Neural Networks - An Alte...

引用

2023 IEEE International Conference on Big data, Bigdata 2023

作者： Qin, Zheyi Paffenroth, Randy Jayasumana, Anura P. Colorado State University Electrical and Computer Engineering Fort Collins United States Worcester Polytechnic Institute Department of Data Science Program WorcesterMA United States

ISBN: (纸本)9798350324457

Graph-based data present unique challenges and opportunities for machine learning. Graph Neural Networks (GNNs), and especially those algorithms that capture graph topology through message passing for neighborhood aggregation, have been a leading solution. However, these networks often require substantial computational resources and may not optimally leverage the information contained in the graph's topology, particularly for large-scale or complex *** propose Topology Coordinate Neural Network (TCNN) and Directional Virtual Coordinate Neural Network (DVCNN) as novel and efficient alternatives to message passing GNNs, that directly leverage the graph's topology, sidestepping the computational challenges presented by competing algorithms. Our proposed methods can be viewed as a reprise of classic techniques for graph embedding for neural network feature engineering, but they are novel in that our embedding techniques leverage ideas in Graph Coordinates (GC) that are lacking in current *** results, benchmarked against the Open Graph Benchmark Leaderboard, demonstrate that TCNN and DVCNN achieve competitive or superior performance to message passing GNNs. For similar levels of accuracy and ROC-AUC, TCNN and DVCNN need far fewer trainable parameters than contenders of the OGBN Leaderboard. The proposed TCNN architecture requires fewer parameters than any neural network method currently listed in the OGBN Leaderboard for both OGBN-Proteins and OGBN-Products datasets. Conversely, our methods achieve higher performance for a similar number of trainable parameters. These results hold across diverse datasets and edge features, underscoring the robustness and generalizability of our methods. By providing an efficient and effective alternative to message passing GNNs, our work expands the toolbox of techniques for graph-based machine learning. A significantly lower number of tunable parameters for a given evaluation metric makes TCNN and DVCNN especiall

关键词： graph analytics graph coordinate graph embedding green AI network embedding

来源：评论

学校读者我要写书评

暂无评论

-Uniform mixing in discrete quantum walks

引用

Journal of Algebraic Combinatorics 2025年第4期61卷 1-35页

作者： Zhan, Hanmeng Computer Science Department Worcester Polytechnic Institute Massachusetts USA

We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of this phenomenon on regular non-bipartite graphs in terms of their adjacency eigenvalues and eigenprojections. Using theory from association schemes, we show this phenomenon happens on a strongly regular graph X if and only if X or $${\hspace{1.111pt}\overline{\hspace{-1.111pt}X}}$$ has parameters $$(4m^2, 2m^2\pm m, m^2\pm m, m^2\pm m)$$ where $$m\ge 2$$ .

关键词：

来源：评论

学校读者我要写书评

暂无评论

DeepScreen: Boosting Depression Screening Performance with an Auxiliary Task

DeepScreen: Boosting Depression Screening Performance with a...

引用

IEEE International Conference on Big data

作者： Ricardo Flores Avantika Shrestha Elke A. Rundensteiner Data Science Worcester Polytechnic Institute Worcester MA USA Computer Science/Data Science Worcester Polytechnic Institute Worcester MA USA

Depression is a prevalent mental health condition with severe impacts on physical and social health. It is costly and difficult to detect, requiring substantial time from trained mental professionals. To alleviate this burden, recent research explores the diagnostic capabilities of deep learning models trained on modalities extracted from videos of clinical interviews for depression screening. However, training deep learning models is challenging because in the mental health domain datasets contain a small number of patients. To address this challenge, we propose DeepScreen, a recurrent deep-learning architecture for depression screening whose performance is boosted by deploying a self-supervised auxiliary task for selective missing value imputation. DeepScreen leverages a multi-task architecture with a bidirectional recurrent deep learning model and a self-attention mechanism, jointly optimizing the supervised depression and the self-supervised auxiliary task. Our first study assesses the capability of the auxiliary task training of DeepScreen under different correlation levels and masking sub-sequence sizes of multi-variate time series. Found to be effective, our second study evaluates DeepScreen on 15 data sets composed of real-world temporal facial landmark features extracted from responses to different clinical interview questions. The results achieved across all 15 datasets demonstrate that the imputation task boosts the depression prediction metrics significantly. Specifically, DeepScreen improves the F1 score for one of the datasets by 57%. Further, our best-performing model achieves an F1 score of 0.85. This work provides valuable insights into improving deep learning driven mental screening applications by leveraging auxiliary tasks such as imputation for learning a better representation even from small datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PFAS Incineration: Known Unknowns, Reaction Simulation, and ML to Predict Product Properties

PFAS Incineration: Known Unknowns, Reaction Simulation, and ...

引用

2023 IEEE MIT Undergraduate Research Technology Conference, URTC 2023

作者： Soiffer, Duncan Pyorre, Tuomas Kenney, David Teixeira, Andrew Worcester Polytechnic Institute Department of Computer Science and Mathematical Sciences WorcesterMA United States Worcester Polytechnic Institute Department of Robotics Engineering WorcesterMA United States Worcester Polytechnic Institute Department of Chemical Engineering WorcesterMA United States

ISBN: (纸本)9798350308600

Per- and polyfluoroalkyl substances (PFAS) are a group of chemicals used for their impressive stability, a property which has also led them to be found polluting virtually every sector of the environment-including our own bodies. Presently, our ability to destroy PFAS is limited largely to incineration, whose products and side effects are poorly understood. Research on PFAS incineration is constrained by high experimental costs and difficulty in accurately measuring reaction products. This presents an opportunity for computer simulation and machine learning to provide valuable assistance. In this study, three kinds of thermal PFAS decomposition are simulated. Further, to broaden physical understanding of PFAS incineration products, a recent in-house machine learning model for predicting the octanol-water partition coefficient (LogP) of chemicals is improved and applied to simulation results. A decrease in LogP is observed in all treatments, with the most dramatic effect (-2 average LogP) observed in oxidative pyrolysis. © 2023 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

5DGWO-GAN:A Novel Five-Dimensional Gray Wolf Optimizer for Generative Adversarial Network-Enabled Intrusion Detection in IoT Systems

引用

computers, Materials & Continua 2025年第1期82卷 881-911页

作者： Sarvenaz Sadat Khatami Mehrdad Shoeibi Anita Ershadi Oskouei Diego Martín Maral Keramat Dashliboroun Department of Data Science Engineering University of HoustonHoustonTX 77204USA The WPI Business School Worcester Polytechnic InstituteWorcesterMA 01609USA School of Systems and Enterprises Stevens Institute of TechnologyHobokenNJ 07030USA Department of Computer Science Escuela de Ingeniería Informática de SegoviaUniversidad de ValladolidSegovia40005Spain Ernest G.Welch School of Art&Design Georgia State UniversityAtlantaGA 30303USA

The Internet of Things(IoT)is integral to modern infrastructure,enabling connectivity among a wide range of devices from home automation to industrial control *** the exponential increase in data generated by these interconnected devices,robust anomaly detection mechanisms are *** detection in this dynamic environment necessitates methods that can accurately distinguish between normal and anomalous behavior by learning intricate *** paper presents a novel approach utilizing generative adversarial networks(GANs)for anomaly detection in IoT ***,optimizing GANs involves tuning hyper-parameters such as learning rate,batch size,and optimization algorithms,which can be challenging due to the non-convex nature of GAN loss *** address this,we propose a five-dimensional Gray wolf optimizer(5DGWO)to optimize GAN *** 5DGWO introduces two new types of wolves:gamma(γ)for improved exploitation and convergence,and theta(θ)for enhanced exploration and escaping local *** proposed system framework comprises four key stages:1)preprocessing,2)generative model training,3)autoencoder(AE)training,and 4)predictive model *** generative models are utilized to assist the AE training,and the final predictive models(including convolutional neural network(CNN),deep belief network(DBN),recurrent neural network(RNN),random forest(RF),and extreme gradient boosting(XGBoost))are trained using the generated data and AE-encoded *** evaluated the system on three benchmark datasets:NSL-KDD,UNSW-NB15,and *** conducted on diverse IoT datasets show that our method outperforms existing anomaly detection strategies and significantly reduces false *** 5DGWO-GAN-CNNAE exhibits superior performance in various metrics,including accuracy,recall,precision,root mean square error(RMSE),and convergence *** proposed 5DGWO-GAN-CNNAE achieved the lowest RMSE values across the NSL-KDD,UNSW-NB15,and

关键词： Internet of things intrusion detection generative adversarial networks five-dimensional binary gray wolf optimizer deep learning

来源：评论

学校读者我要写书评

暂无评论

Hidden or Inferred: Fair Learning-To-Rank with Unknown Demographics

arXiv

引用

arXiv 2024年

作者： Olulana, Oluseun Cachel, Kathleen Murai, Fabricio Rundensteiner, Elke Data Science Program Worcester Polytechnic Institute WorcesterMA United States Computer Science Department Worcester Polytechnic Institute WorcesterMA United States

As learning-to-rank models are increasingly deployed for decision-making in areas with profound life implications, the FairML community has been developing fair learning-to-rank (LTR) models. These models rely on the availability of sensitive demographic features such as race or sex. However, in practice, regulatory obstacles and privacy concerns protect this data from collection and use. As a result, practitioners may either need to promote fairness despite the absence of these features or turn to demographic inference tools to attempt to infer them. Given that these tools are fallible, this paper aims to further understand how errors in demographic inference impact the fairness performance of popular fair LTR strategies. In which cases would it be better to keep such demographic attributes hidden from models versus infer them? We examine a spectrum of fair LTR strategies ranging from fair LTR with and without demographic features hidden versus inferred to fairness-unaware LTR followed by fair re-ranking. We conduct a controlled empirical investigation modeling different levels of inference errors by systematically perturbing the inferred sensitive attribute. We also perform three case studies with real-world datasets and popular open-source inference methods. Our findings reveal that as inference noise grows, LTR-based methods that incorporate fairness considerations into the learning process may increase bias. In contrast, fair re-ranking strategies are more robust to inference errors. All source code, data, and experimental artifacts of our experimental study are available here: https://***/sewen007/*** © 2024, CC BY-NC-ND.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

An Ensemble-Based Weight-Learning Framework and Algorithm for Imputing Missing Values on High-Dimension Low-Sample Size datasets 23

An Ensemble-Based Weight-Learning Framework and Algorithm fo...

引用

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on data science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Ngan, Chun-Kit Yang, Boyuan Worcester Polytechnic Institute Data Science Program WorcesterMA United States

ISBN: (纸本)9781665494571

High-Dimension, Low-Sample Size (HDLSS) datasets are the datasets that their sample sizes are much smaller than the number of feature dimensions. In spite of that, HDLSS datasets appear in many domains and organizations, including social work, medical fields, international travels, and chemical industry. As many HDLSS datasets are very difficult to be collected, their missing values raise many issues and reduce reliability on the datasets to solve a domain and an organizational problem. To address the issues of the missing values in HDLSS datasets, we propose an Ensemble-Based Weight-Learning (EBWF) framework. Given HDLSS datasets and available Machine Learning (ML) classifiers, the EBWF framework is an automated pipeline that can generate the best imputed dataset. To support the EBWF framework, we develop a novel Record Probability Weight Learning (RPWL) imputation algorithm that combines the data record probability calculation from each ML classifier and weight learning computations among all the ML classifiers to impute the missing values in the dataset. To show the effectiveness of our approach, we conduct an experimental case study and evaluation on a survey dataset, i.e., 212 international travelers in Houston for assessing sexual risk-taking behaviors, as a pilot study, where Houston is a critical transit point frequented by international visitors. Based upon the travelers' survey data, where the survey records' missing rate is in the range of 10% to 70%, and the imputed dataset generated by our approach, we show that the classification performance delivered by our framework and algorithm outperform the other baseline approaches'. © 2021 IEEE.

关键词： Chemical industry Machine learning algorithms Pipelines Organizations Machine learning Probability Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

MDNN:Predicting Student Engagement via Gaze Direction and Facial Expression in Collaborative Learning

引用

computer Modeling in Engineering & sciences 2023年第7期136卷 381-401页

作者： Yi Chen Jin Zhou Qianting Gao Jing Gao Wei Zhang School of Computer Science Central China Normal UniversityWuhan430079China Computer Science School of ScienceRensselaer Polytechnic InstituteTroy12180USA National Engineering Laboratory of Educational Big Data Application Technology Central China Normal UniversityWuhan430079China

Prediction of students’engagement in aCollaborative Learning setting is essential to improve the quality of *** learning is a strategy of learning through groups or *** cooperative learning behavior occurs,each student in the group should participate in teaching *** showed that students who are actively involved in a class gain *** behavior and facial expression are important nonverbal indicators to reveal engagement in collaborative learning *** studies require the wearing of sensor devices or eye tracker devices,which have cost barriers and technical interference for daily teaching *** this paper,student engagement is automatically analyzed based on computer *** tackle the problem of engagement in collaborative learning using a multi-modal deep neural network(MDNN).We combined facial expression and gaze direction as two individual components of MDNN to predict engagement levels in collaborative learning *** multi-modal solution was evaluated in a real collaborative *** results show that the model can accurately predict students’performance in the collaborative learning environment.

关键词： Engagement facial expression deep network gaze

来源：评论

学校读者我要写书评

暂无评论

Conditioned Cycles in Sparse data Domains: Applications to Electromagnetics

Conditioned Cycles in Sparse Data Domains: Applications to E...

引用

International Conference on Machine Learning and Applications (ICMLA)

作者： Maria Barger Randy Paffenroth Harsh Pathak Data Science Worcester Polytechnic Institute Worcester MA USA Mathematics Computer Science and Data Science Worcester Polytechnic Institute Worcester MA USA

Training neural networks is difficult with small datasets, yet small training data sets are commonly found with machine learning problems in the physical sciences. Prediction accuracy within such sparse data domains can be improved by the utilization of conditioning, inspired by classical statistics, and cycles, similar to those of CycleGANs. In this paper, we propose the addition of “oracle“ conditioning, where the true condition value is provided during training (but not during testing), to improve final prediction accuracy in sparse data domains. For example, in over-water electromagnetic (EM) source localization, the range of the emitter can be thought of as a “condition“ on the generation of a received EM signal. Oracle conditioning utilizes an encoder-decoder framework where the conditioning of the decoder is not contingent on the output of an encoder's prediction (e.g, predicting the range from a received EM signal). While our primary application involves source localization for EM signals, this paper is intended to inspire a general approach toward neural network training for problems in the physical sciences with similar characteristics. Our multi-component loss function is intended to serve as a general method for small data problems which can benefit from the addition of cycles and oracle conditioning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：