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

Toxicity in the Decentralized Web and the Potential for Model Sharing 22

Toxicity in the Decentralized Web and the Potential for Mode...

2022 acm SIGMETRICS/IFIP PERFORMANCE Joint International Conference on measurement and Modeling of Computer systems, SIGMETRICS/PERFORMANCE 2022

作者： Bin Zia, Haris Raman, Aravindh Castro, Ignacio Hassan Anaobi, Ishaku De Cristofaro, Emiliano Sastry, Nishanth Tyson, Gareth Queen Mary University of London London United Kingdom Telefonica Research Barcelona Spain University College London London United Kingdom University of Surrey Surrey United Kingdom Hong Kong University of Science & Technology Hong Kong Hong Kong

ISBN: (纸本)9781450391412

The "Decentralised Web"(DW) is an evolving concept, which encompasses technologies aimed at providing greater transparency and openness on the web. The DW relies on independent servers (aka instances) that mesh together in a peer-to-peer fashion to deliver a range of services (e.g. micro-blogs, image sharing, video streaming). However, toxic content moderation in this decentralised context is challenging. This is because there is no central entity that can define toxicity, nor a large central pool of data that can be used to build universal classifiers. It is therefore unsurprising that there have been several high-profile cases of the DW being misused to coordinate and disseminate harmful material. Using a dataset of 9.9M posts from 117K users on Pleroma (a popular DW microblogging service), we quantify the presence of toxic content. We find that toxic content is prevalent and spreads rapidly between instances. We show that automating per-instance content moderation is challenging due to the lack of sufficient training data available and the effort required in labelling. We therefore propose and evaluate ModPair, a model sharing system that effectively detects toxic content, gaining an average per-instance macro-F1 score 0.89. © 2022 Owner/Author.

关键词： decentralised web toxicity analysis content moderation pleroma

来源：评论

学校读者我要写书评

暂无评论

Sequential Task Flow Runtime Model Improvements and Limitations 12

Sequential Task Flow Runtime Model Improvements and Limitati...

引用

12th IEEE/acm International Workshop on Runtime and Operating systems for Supercomputers, ROSS 2022

作者： Pei, Yu Bosilca, George Dongarra, Jack University of Tennessee Innovative Computing Laboratory United States

ISBN: (纸本)9781665475662

The sequential task flow (STF) model is the main-stream approach for interacting with task-based runtime systems, with StarPU and the Dynamic task discovery (DTD) in PaRSEC being two implementations of this model. Compared with other approaches of submitting tasks into a runtime system, STF has interesting advantages centered around an easy-to-use API, that allows users to expressed algorithms as a sequence of tasks (much like in OpenMP), while allowing the runtime to automatically identify and analyze the task dependencies and scheduling. In this paper, we focus on the DTD interface in PaRSEC, highlight some of its lesser known limitations and implemented two optimization techniques for DTD: support for user level graph trimming, and a new API for broadcast read-only data to remote tasks. We then analyze the benefits and limitations of these optimizations with benchmarks as well as on two common matrix factorization kernels Cholesky and QR, on two different systems Shaheen II from KAUST and Fugaku from RIKEN. We point out some potential for further improvements, and provided valuable insights into the strength and weakness of STF model. hoping to guide the future developments of task-based runtime systems. © 2022 IEEE.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Design Exploration and Scalability analysis of a CMOS-Integrated, Polymorphic, Nanophotonic Arithmetic-Logic Unit 21

Design Exploration and Scalability Analysis of a CMOS-Integr...

引用

19th acm Conference on Embedded Networked Sensor systems, SenSys 2021

作者： Karempudi, Venkata Sai Praneeth Datta, Shreyan Thakkar, Ishan G University of Kentucky Kentucky Lexington United States National Institute of Technology Durgapur India

ISBN: (纸本)9781450390972

Over the past two decades, the clock speed, and hence, the singlecore performance of microprocessors has already stagnated. Following this, the recent faltering of Moore's law due to the CMOS fabrication technology reaching its unavoidable physical limit has presaged daunting challenges for designing power-efficient and ultrafast microprocessors. To overcome these challenges, vigorous efforts have been made to develop new more-than-Moore technologies and architectures for computing. Among these, nanophotonic integrated circuits based computing architectures have shown revolutionary potential. Among recent demonstrations of nanophotonic circuits for computing, a polymorphic, nanophotonic ALU (PoN-ALU) carries a notable importance since it has shown very high flexibility, high speed, and low power consumption for computing. In this paper, we carry out a design space exploration of this PoN-ALU to derive new design guidelines that can help scale the speed and energy efficiency of PoNALU even further. © 2021 acm.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

Evaluating ISO C++ Parallel Algorithms on Heterogeneous HPC systems 13

Evaluating ISO C++ Parallel Algorithms on Heterogeneous HPC ...

引用

13th IEEE/acm International Workshop on Performance Modeling, Benchmarking and Simulation of High Performance Computer systems, PMBS 2022

作者： Lin, Wei-Chen Deakin, Tom McIntosh-Smith, Simon University of Bristol Department of Computer Science Bristol United Kingdom

ISBN: (纸本)9781665451857

Recent revisions to the ISO C++ standard have added specifications for parallel algorithms. These additions cover common use-cases, including sequence traversal, reduction, and even sorting, many of which are highly applicable in HPC, and thus represent a potential for increased performance and *** study evaluates the state of the art for implementing heterogeneous HPC applications using the latest built-in ISO C++17 parallel algorithms. We implement C++17 ports of representative HPC mini-apps that cover both compute-bound and memory bandwidth-bound applications. We then conduct benchmarks on CPUs and GPUs, comparing our ports to other widely-available parallel programming models, such as OpenMP, CUDA, and ***, we show that C++17 parallel algorithms are able to achieve competitive performance across multiple mini-apps on many platforms, with some notable exceptions. We also discuss several key topics, including portability, and describe workarounds for a number of remaining issues, including index-based traversal and accelerator device/memory management. © 2022 IEEE.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Federated Learning Aggregation based on Weight Distribution analysis

Federated Learning Aggregation based on Weight Distribution ...

引用

2023 IEEE International Conference on Imaging systems and Techniques, IST 2023

作者： Chatzikonstantinou, Christos Konstantinidis, Dimitrios Dimitropoulos, Kosmas Daras, Petros Centre for Research and Technology Hellas Visual Computing Lab Information Technologies Institute Greece

ISBN: (纸本)9798350330830

Federated learning has recently been proposed as a solution to the problem of using private or sensitive data for training a central deep model, without exchanging the local data. In federated learning, local models are trained on the client side using the available data, while a server is responsible for aggregating the weights of these models into a global model. However, the traditional weight averaging approach does not take into consideration the importance of the different weights for the performance of a model. To this end, this work proposes a novel federated learning weight aggregation method that estimates the statistical distance of each client's parameters from the Gaussianity, and weighs the contribution of each client to the global model accordingly so that the most significant information is retained and enhanced. To create an accurate global model, a complex weighted averaging of the parameters of clients' models at the layer level is performed, considering as low quality the parameters following the Gaussian distribution. The proposed method can be employed to both convolutional and linear layers and it is based on the notion that parameters following a Gaussian distribution do not significantly affect the output of a model. Experiments with different network architectures and a comparison with a plethora of state-of-the-art approaches on three well-known image classification datasets demonstrate the superiority of the proposed method for federated learning weight aggregation. © 2023 IEEE.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Fundamentals of Physical computing: Determining Key Concepts in Embedded systems and Hardware/Software Co-Design 21

Fundamentals of Physical Computing: Determining Key Concepts...

引用

16th Workshop on Primary and Secondary computing Education (WiPSCE)

作者： Przybylla, Mareen Grillenberger, Andreas Schwyz Univ Teacher Educ Goldau Switzerland Free Univ Berlin Berlin Germany

ISBN: (纸本)9781450385718

Studies have shown that teachers find it difficult to prepare contents in the area of embedded systems and hardware/software co-design for school students. The goal of this paper is to support them by obtaining a clearly structured representation of the key concepts from this area in order to be able to derive concrete competence goals based on them later on. We apply a method for identifying the key concepts of a subject area within computer science, which has already been tested in the field of data management, to embedded systems and the related hardware/software co-design. Here, we present the procedure (literature selection, content analysis, concept clustering, and structuring) and the results of this process.

关键词： physical computing embedded systems hardware/software codesign K-12 education key concepts

来源：评论

学校读者我要写书评

暂无评论

The First 5G-LTE Comparative Study in Extreme Mobility

引用

proceedings of the acm on measurement and analysis of computing systems 2022年第1期6卷 1–22页

作者： Pan, Yueyang Li, Ruihan Xu, Chenren Peking Univ 5 Yiheyuan Rd Beijing 100871 Peoples R China

5G claims to support mobility up to 500 km/h according to the 3GPP standard. However, its field performance under high-speed scenes remains in mystery. In this paper, we conduct the first large-scale measurement campaign on a high-speed railway route operating at the maximum speed of 350 km/h, with full coverage of LTE and 5G (NSA and SA) along the track. Our study consumed 1788.8 GiB of cellular data in six months, covering the three major carriers in China and the recent standardized QUIC protocol. Based on our dataset, we reveal the key characteristics of 5G and LTE in extreme mobility in terms of throughput, RTT, loss rate, signal quality, and physical resource utilization. We further develop a taxonomy of handovers in both LTE and 5G and carry out the link-layer latency breakdown analysis. Our study pinpoints the deficiencies in the user equipment, radio access network, and core network which hinder seamless connectivity and better utilization of 5G's high bandwidth. Our findings highlight the directions of the next step in the 5G evolution.

关键词： measurement Extreme Mobility 5G High-speed Rail Handover

来源：评论

学校读者我要写书评

暂无评论

On the Skolem Problem and the Skolem Conjecture 22

On the Skolem Problem and the Skolem Conjecture

引用

37th Annual acm/IEEE Symposium on Logic in Computer Science, LICS 2022

作者： Lipton, Richard J. Luca, Florian Nieuwveld, Joris Ouaknine, Joël Purser, David Worrell, James Department of Computer Science Georgia Institute of Technology United States School of Mathematics University of the Witwatersrand South Africa Max Planck Institute for Software Systems Germany Department of Computer Science University of Oxford United Kingdom

ISBN: (纸本)9781450393515

It is a longstanding open problem whether there is an algorithm to decide the Skolem Problem for linear recurrence sequences (LRS) over the integers, namely whether a given such sequence un n8=0 has a zero term (i.e., whether un = 0 for some n). A major breakthrough in the early 1980s established decidability for LRS of order 4 or less, i.e., for LRS in which every new term depends linearly on the previous four (or fewer) terms. The Skolem Problem for LRS of order 5 or more, in particular, remains a major open challenge to this day. Our main contributions in this paper are as follows: First, we show that the Skolem Problem is decidable for reversible LRS of order 7 or less. (An integer LRS (un)n8=0 is reversible if its unique extension to a bi-infnite LRS (un)n8=-8 also takes exclusively integer values;a typical example is the classical Fibonacci sequence, whose bi-infnite extension is (. . . , 5, -3, 2, -1, 1, 0, 1, 1, 2, 3, 5, . . .) Second, assuming the Skolem Conjecture (a central hypothesis in Diophantine analysis, also known as the Exponential Local-Global Principle), we show that the Skolem Problem for LRS of order 5 is decidable, and exhibit a concrete procedure for solving it. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

Non-linear Programming for the Network Calculus analysis of FIFO Feedforward Networks 25

Non-linear Programming for the Network Calculus Analysis of ...

引用

2025 International Conference on Performance Engineering-ICPE-Annual

作者： Herll, Lukas Bondorf, Steffen Ruhr Univ Bochum Bochum Germany

ISBN: (纸本)9798400710735

System designs for bounded communication latencies often employ a rather basic concept at their core: First-In First-Out (FIFO) queueing. Network Calculus (NC) can compute delay bounds for the end-to-end communication of data flows crossing potentially large feedforward networks of such First-In First-Out (FIFO) systems. analysis complexity stems from the need to keep track of the interactions between flows when they compete for resources, i.e., multiplex in shared queues. Network Calculus (NC) has an elegant solution to this: an open, so-called First-In First-Out (FIFO) parameter is introduced every time a (worst-case) First-In First-Out (FIFO) interaction occurs in the analysis. At the end of the analysis stands a (min,plus)-algebraic term with interdependent First-In First-Out (FIFO) parameters. We aim at finding an optimal setting for all open parameters. When employing standard optimization techniques, we cannot work with a parameterized (min,plus)-algebraic term directly. Thus, we show how to derive a minimum size (plus,times)-algebraic term that we can use with Non-Linear Program (NLP) solvers efficiently. Additionally, we show how to differentiate this term to open our approach to gradient-based Non-Linear Program (NLP) algorithms. In numerical evaluations, we show that our approach outperforms the complexity/accuracy tradeoff of existing heuristics to set the First-In First-Out (FIFO) parameters. With a slight increase of analysis runtime, we reduce the gap to the optimal setting by a factor of 4.4, to 0.15% on average.

关键词： Delay bounds network calculus FIFO systems LUDB

来源：评论

学校读者我要写书评

暂无评论

Who Are Querying For Me? Egress measurement For Open DNS Resolvers 26

Who Are Querying For Me? Egress Measurement For Open DNS Res...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Luo, Meng Xin, Liling Yao, Yepeng Jiang, Zhengwei Wang, Qiuyun Shi, Wenchang Institute of Information Engineering Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences School of Cyber Security Beijing China Renmin University of China School of Information Beijing China

ISBN: (纸本)9798350331684

The dependencies and centralization in DNS infrastructure increase the risk of single-point failure and the scope of collateral damage. In the DNS recursive resolution, dependencies between different resolvers also exist due to situations such as forwarding. Currently, research on dependencies in recursive resolution is still insufficient. In this work, we take a deep insight into the recursive resolution implemented by open resolvers to investigate their dependencies, including the concentration of dependencies, and the influence of 3rd-party providers. We find that most open resolvers in the wild are dependent on a small number of egress resolvers to communicate with the authoritative name servers. 90% of the open resolvers are influenced by 8.41% of the egress resolvers. Besides, egress resolvers from 3rd-party providers are able to influence more than 44% of the open resolvers. The concentration makes a large amount of DNS traffic concentrated in a small number of egress resolvers/providers, which will reduce the redundancy of DNS and threaten user privacy. © 2023 IEEE.

关键词： Centralization analysis Dependency measurement Domain Name System Open Resolver

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：