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

IEEE International Conference on Systems, Man and Cybernetics

作者： Hanqian Tu Dongming Xiang Wang Lin Guanjun Liu Department of Computer Science and Technology Zhejiang Sci-Tech University Hangzhou China Department of Computer Science Key laboratory of Embedded System and Service Computing Ministry of Education Shanghai Electronic Transactions and Information Service Collaborative Innovation Center Tongji University Shanghai China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

The Petri-net-based information flow analysis offers an effective approach for detecting information leakage by the concept of non-interference. Although the related studies propose efficient solutions, they lack quantitative evaluation on information leakage. In this paper, we propose a novel method for quantitative evaluation of information security based on stochastic labeled Petri nets (SLPNs) and information flow analysis. Specifically, we introduce four different levels of security metrics, and provide a methodology for evaluating the information security. Furthermore, a case study is presented to show the feasibility of our method.

关键词： Measurement Petri nets Semantics Stochastic processes Information leakage Explosions Complexity theory Cybernetics Business

来源：评论

学校读者我要写书评

暂无评论

Heuristic Elastic Scaling for Kubernetes Heterogeneous Microservices

Heuristic Elastic Scaling for Kubernetes Heterogeneous Micro...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Song Wang Sheng He Yishuang Ning Xiang Gao Zhijun Ding Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Tongji University Shanghai China Kingdee Research Kingdee International Software Group Co. Ltd Shenzhen China Intelligent Computing Facility Innovation Center ZhejiangLab Hangzhou China

ISBN: (数字)9798350365221

ISBN: (纸本)9798350365238

Kubernetes has become the basic platform for building cloud native applications. However, existing horizontal scaling methods based on Kubernetes have problems with resource redundancy. Furthermore, the combined horizontal and vertical scaling based on Kubernetes takes a long time. Regarding the issue above, first, we describe the execution processes of three scaling techniques and compare them in different dimensions; second, we construct a formal elastic scaling model for expansion scenarios, with the goal of minimizing the total cost; and third, we introduce a heuristic expansion algorithm after balancing resource redundancy and execution time as the heuristic information. The experiment results show that the elastic scaling algorithm proposed in this paper achieves better performance than other algorithms.

关键词： Costs Heuristic algorithms Redundancy Buildings Microservice architectures Sensors

来源：评论

学校读者我要写书评

暂无评论

Efficient poisoning attacks and defenses for unlabeled data in DDoS prediction of intelligent transportation systems

引用

Security and Safety 2022年第1期1卷 121-141页

作者： Zhong Li Xianke Wu Changjun Jiang College of Information Science and Technology Donghua University Key Laboratory of the Ministry of Education for Embedded System and Service Computing Department of Computer Science Tongji University Shanghai Network Financial Security Collaborative Innovation Center Tongji University

Nowadays, large numbers of smart sensors(e.g., road-side cameras) which communicate with nearby base stations could launch distributed denial of services(DDoS) attack storms in intelligent transportation systems. DDoS attacks disable the services provided by base stations. Thus in this paper, considering the uneven communication traffic flows and privacy preserving, we give a hidden Markov model-based prediction model by utilizing the multi-step characteristic of DDoS with a federated learning framework to predict whether DDoS attacks will happen on base stations in the future. However, in the federated learning,we need to consider the problem of poisoning attacks due to malicious participants. The poisoning attacks will lead to the intelligent transportation systems paralysis without security protection. Traditional poisoning attacks mainly apply to the classification model with labeled data. In this paper, we propose a reinforcement learning-based poisoning method specifically for poisoning the prediction model with unlabeled data. Besides, previous related defense strategies rely on validation datasets with labeled data in the server. However, it is unrealistic since the local training datasets are not uploaded to the server due to privacy preserving, and our datasets are also unlabeled. Furthermore, we give a validation dataset-free defense strategy based on Dempster–Shafer(D–S) evidence theory avoiding anomaly aggregation to obtain a robust global model for precise DDoS prediction. In our experiments, we simulate 3000 points in combination with DARPA2000 dataset to carry out evaluations. The results indicate that our poisoning method can successfully poison the global prediction model with unlabeled data in a short time. Meanwhile, we compare our proposed defense algorithm with three popularly used defense algorithms. The results show that our defense method has a high accuracy rate of excluding poisoners and can obtain a high attack prediction probability.

关键词： Poisoning attacks Defenses Multi-step DDoS prediction Unlabeled data intelligent transportation systems

来源：评论

学校读者我要写书评

暂无评论

Quantifying OpenMP: Statistical Insights into Usage and Adoption

Quantifying OpenMP: Statistical Insights into Usage and Adop...

引用

IEEE Conference on High Performance Extreme computing (HPEC)

作者： Tal Kadosh Niranjan Hasabnis Timothy Mattson Yuval Pinter Gal Oren Department of Computer Science Ben-Gurion University Israel Israel Atomic Energy Commission Intel Labs United States Scientific Computing Center Nuclear Research Center - Negev Israel Department of Computer Science Technion - Israel Institute of Technology Israel

In high-performance computing (HPC), the demand for efficient parallel programming models has grown dramatically since the end of Dennard Scaling and the subsequent move to multi-core CPUs. OpenMP stands out as a popular choice due to its simplicity and portability, offering a directive-driven approach for shared-memory parallel programming. Despite its wide adoption, however, there is a lack of comprehensive data on the actual usage of OpenMP constructs, hindering unbiased insights into its popularity and evolution. This paper presents a statistical analysis of OpenMP usage and adoption trends based on a novel and extensive database, HPCORPUS, compiled from GitHub repositories containing C, C++, and Fortran code. The results reveal that OpenMP is the dominant parallel programming model, accounting for 45% of all analyzed parallel APIs. Furthermore, it has demonstrated steady and continuous growth in popularity over the past decade. Analyzing specific OpenMP constructs, the study provides in-depth insights into their usage patterns and preferences across the three languages. Notably, we found that while OpenMP has a strong “common core” of constructs in common usage (while the rest of the API is less used), there are new adoption trends as well, such as simd and target directives for accelerated computing and task for irregular parallelism. Overall, this study sheds light on OpenMP's significance in HPC applications and provides valuable data for researchers and practitioners. It showcases OpenMP's versatility, evolving adoption, and relevance in contemporary parallel programming, underlining its continued role in HPC applications and beyond. These statistical insights are essential for making informed decisions about parallelization strategies and provide a foundation for further advancements in parallel programming models and techniques. HPCORPUS, as well as the analysis scripts and raw results, are available at: https://***/Scientific-computing-Lab-NRCN/HP

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantifying OpenMP: Statistical Insights into Usage and Adoption

arXiv

引用

arXiv 2023年

作者： Kadosh, Tal Hasabnis, Niranjan Mattson, Timothy Pinter, Yuval Oren, Gal Department of Computer Science Ben-Gurion University Israel Israel Atomic Energy Commission Intel Labs United States Scientific Computing Center Nuclear Research Center Negev Israel Department of Computer Science Technion - Israel Institute of Technology Israel

In high-performance computing (HPC), the demand for efficient parallel programming models has grown dramatically since the end of Dennard Scaling and the subsequent move to multi-core CPUs. OpenMP stands out as a popular choice due to its simplicity and portability, offering a directive-driven approach for shared-memory parallel programming. Despite its wide adoption, however, there is a lack of comprehensive data on the actual usage of OpenMP constructs, hindering unbiased insights into its popularity and evolution. This paper presents a statistical analysis of OpenMP usage and adoption trends based on a novel and extensive database, HPCORPUS, compiled from GitHub repositories containing C, C++, and Fortran code. The results reveal that OpenMP is the dominant parallel programming model, accounting for 45% of all analyzed parallel APIs. Furthermore, it has demonstrated steady and continuous growth in popularity over the past decade. Analyzing specific OpenMP constructs, the study provides in-depth insights into their usage patterns and preferences across the three languages. Notably, we found that while OpenMP has a strong "common core" of constructs in common usage (while the rest of the API is less used), there are new adoption trends as well, such as simd and target directives for accelerated computing and task for irregular parallelism. Overall, this study sheds light on OpenMP's significance in HPC applications and provides valuable data for researchers and practitioners. It showcases OpenMP's versatility, evolving adoption, and relevance in contemporary parallel programming, underlining its continued role in HPC applications and beyond. These statistical insights are essential for making informed decisions about parallelization strategies and provide a foundation for further advancements in parallel programming models and techniques. HPCORPUS, as well as the analysis scripts and raw results, are available at: https://***/Scientific-computing-Lab-NRCN/HP

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Portability and Scalability of OpenMP Offloading on State-of-the-art Accelerators

arXiv

引用

arXiv 2023年

作者： Fridman, Yehonatan Tamir, Guy Oren, Gal Department of Computer Science Ben-Gurion University of the Negev Israel Department of Physics Nuclear Research Center Negev Israel Scientific Computing Center Nuclear Research Center Negev Israel Intel Corporation United States Department of Computer Science Technion - Israel Institute of Technology

Over the last decade, most of the increase in computing power has been gained by advances in accelerated many-core architectures, mainly in the form of GPGPUs. While accelerators achieve phenomenal performances in various computing tasks, their utilization requires code adaptations and transformations. Thus, OpenMP, the most common standard for multi-threading in scientific computing applications, introduced offloading capabilities between host (CPUs) and accelerators since v4.0, with increasing support in the successive v4.5, v5.0, v5.1, and the latest v5.2 versions. Recently, two state-of-the-art GPUs - the intel Ponte Vecchio Max 1100 and the NVIDIA A100 GPUs - were released to the market, with the oneAPI and NVHPC compilers for offloading, correspondingly. In this work, we present early performance results of OpenMP offloading capabilities to these devices while specifically analyzing the portability of advanced directives (using SOLLVE's OMPVV test suite) and the scalability of the hardware in representative scientific mini-app (the LULESH benchmark). Our results show that the coverage for version 4.5 is nearly complete in both latest NVHPC and oneAPI tools. However, we observed a lack of support in versions 5.0, 5.1, and 5.2, which is particularly noticeable when using NVHPC. From the performance perspective, we found that the PVC1100 and A100 are relatively comparable on the LULESH benchmark. While the A100 is slightly better due to faster memory bandwidth, the PVC1100 reaches the next problem size (4003) scalably due to the larger memory size. The results are available at: https://***/Scientific-computing-Lab-NRCN/Accel-OpenMP-Portability-Scalability. © 2023, CC BY.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

A Money Laundering Structure Detection Method Based on Incremental Transaction Analysis

A Money Laundering Structure Detection Method Based on Incre...

引用

Data science and Information technology (DSIT), International Conference on

作者： Yifei Meng Zhong Li Key Laboratory of Embedded System and Service Computing Ministry of Education National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University Shanghai China College of Information Science and Technology Donghua University Shanghai China

Money laundering is the process of legitimizing dirty money through complex transactions, posing a serious threat to a country’s financial stability and national security. Nowadays, with the prevalence of organized money laundering, launderers prefer to use intricate multi-hop laundering chains to transfer dirty money. Moreover, they engage in normal financial activities to disrupt detection by auditors. In response to these trends and challenges, we propose a novel unsupervised money laundering structure detection framework for the anti-money laundering field, called structure incremental expansion (SIE). Our framework consists of two main modules: 1) Initialization of suspicious structures, which adopts a control-limit based method to identify suspicious accounts exhibiting anomalous transaction behavior. These accounts will serve as the starting points for suspicious structure expansion. 2) Dynamic structure expansion, where we design three dynamic membership functions according to the Financial Action Task Force’s definitions of the three stages of money laundering evolution. Newly-added incremental transactions in the network will be assigned to appropriate expanding suspicious structures. We conduct extensive experiments on simulated and public financial networks. SIE exhibits desirable performance and scalability. We also provide a detailed case study, visualizing a complete money laundering structure detection process, demonstrating our method’s strong interpretability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Virtual Source-Based Particle Swarm Optimizer for Multi-Source Location Using Mobile Swarm Robotics

Virtual Source-Based Particle Swarm Optimizer for Multi-Sour...

引用

第33届中国过程控制会议

作者： JunQi Zhang YuXuan Lin Qi Kang Department of Computer Science and Technology the Key Laboratory of Embedded System and Service ComputingTongji UniversityMinistry of EducationShanghai Electronic Trans actions and Information Service Collaborative Innovation Center IEEE

Source location is an interesting topic in the field of swarm ***-source location is a vital branch of *** with a single-source location problem,the main difficulty for the multi-source location lies in that the number and distribution of sources are *** Swarm Optimizer(PSO) has been widely adopted for the single-source location ***,its performance deteriorates greatly when it faces multiple sources because it is designed to find the single global best solution,not multiple *** handle such a challenge,a virtual source mechanism is proposed to help PSO overcome this *** key idea of the virtual source mechanism is to divide the search area into multiple cells,each of which has a virtual *** virtual source leads the swarm to cover each cell such that particles can cover all cells in a search space before they *** results demonstrate that the virtual source mechanism-based PSO effectively locates multiple sources.

关键词： Particle swarm optimizer virtual source mobile swarm robotics multi-source location

来源：评论

学校读者我要写书评

暂无评论

MPI-RICAL: Data-Driven MPI Distributed Parallelism Assistance with Transformers

arXiv

引用

arXiv 2023年

作者： Schneider, Nadav Kadosh, Tal Hasabnis, Niranjan Mattson, Timothy Pinter, Yuval Oren, Gal Department of Electrical & Computer Engineering Ben-Gurion University Israel Israel Atomic Energy Commission Department of Computer Science Ben-Gurion University Israel Intel Labs United States Scientific Computing Center Nuclear Research Center - Negev Israel Department of Computer Science Technion - Israel Institute of Technology Israel

Computational science has made rapid progress in recent years, leading to ever increasing demand for supercomputing resources. For scientific applications that leverage such resources, Message Passing Interface (MPI) plays a crucial role in enabling distributed memory parallelization across multiple nodes. However, parallelizing MPI code manually, and specifically, performing domain decomposition, is a challenging and error-prone task. In this paper, we address this problem by developing MPI-RICAL, a novel data-driven, programming-assistance tool that assists programmers in writing domain decomposition based distributed memory parallelization code using MPI. Specifically, we leverage Transformer architecture - the invention that led to advancements in the field of natural language processing (NLP) - with a supervised language model to suggest MPI functions and their proper locations in the code on the fly. In addition to the novel model for MPI-based parallel programming, in this paper, we also introduce MPICodeCorpus, the first publicly-available corpus of MPI-based parallel programs that is created by mining more than 15,000 open-source repositories on GitHub. Experimental results demonstrate the effectiveness of MPI-RICAL on both dataset from MPICodeCorpus and more importantly, on a compiled benchmark of MPI-based parallel programs for numerical computations that represent real-world scientific applications. Specifically, MPI-RICAL achieves F1 scores between 0.87-0.91 on these programs, demonstrating its accuracy in suggesting correct MPI functions at appropriate code locations. The source code used in this work, as well as other relevant sources, are available at: https://***/Scientific-computing-Lab-NRCN/MPI-rical. © 2023, CC BY.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Effcient poisoning attacks and defenses for unlabeled data in DDoS prediction of intelligent transportation systems

Security and Safety

引用

Security and Safety 2022年第1期1卷 145-165页

作者： Zhong Li Xianke Wu Changjun Jiang College of Information Science and Technology Donghua UniversityShanghai 201620China Key Laboratory of the Ministry of Education for Embedded System and Service Computing Department of Computer ScienceTongji UniversityShanghai 201804China Shanghai Network Financial Security Collaborative Innovation Center Tongji UniversityShanghai 201804China

Nowadays,large numbers of smart sensors(e.g.,road-side cameras)which com-municate with nearby base stations could launch distributed denial of services(DDoS)attack storms in intelligent transportation *** attacks disable the services provided by base *** in this paper,considering the uneven communication traffic ows and privacy preserving,we give a hidden Markov model-based prediction model by utilizing the multi-step characteristic of DDoS with a federated learning framework to predict whether DDoS attacks will happen on base stations in the ***,in the federated learning,we need to consider the problem of poisoning attacks due to malicious *** poisoning attacks will lead to the intelligent transportation systems paralysis without security *** poisoning attacks mainly apply to the classi cation model with labeled *** this paper,we propose a reinforcement learning-based poisoningmethod speci cally for poisoning the prediction model with unlabeled ***,previous related defense strategies rely on validation datasets with labeled data in the ***,it is unrealistic since the local training datasets are not uploaded to the server due to privacy preserving,and our datasets are also ***,we give a validation dataset-free defense strategy based on Dempster-Shafer(D-S)evidence theory avoiding anomaly aggregation to obtain a robust global model for precise DDoS *** our experiments,we simulate 3000 points in combination with DARPA2000 dataset to carry out *** results indicate that our poisoning method can successfully poison the global prediction model with unlabeled data in a short ***,we compare our proposed defense algorithm with three popularly used defense *** results show that our defense method has a high accuracy rate of excluding poisoners and can obtain a high attack prediction probability.

关键词： Poisoning attacks Defenses Multi-step DDoS prediction Unlabeled data intel-ligent transportation systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：