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

IEEE Asian Hardware-Oriented Security and Trust (AsianHOST)

作者： Pengfei Qiu Qiang Gao Dongsheng Wang Yongqiang Lyu Chang Liu Xiaoyong Li Chunlu Wang Gang Qu Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Tsinghua University Beijing China Department of Computer Science and Technology Beijing National Research Center for Information Science and Technology Tsinghua University Beijing China Ministry of Education Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Beijing China Department of Electrical and Computer Engineering Institute for Systems Research University of Maryland Maryland USA

ISBN: (纸本)9781665461153

The processor's Performance Monitor Unit (PMU) allows the recording of architectural and microarchitectural events for profiling purposes. In this study, we reveal a security issue caused by the fact that current PMU implementations are capable of recording some events that happened during transient executions. We propose the PMU -Spill attack, a new kind of attack that enables attackers to maliciously leak the secret data in transient executions. We demonstrate on real hardware that PMU -Spill attack can leak the secret data stored in Intel Software Guard Extensions (SGX). In addition, we perform a thorough study to reveal all the vulnerable PMU counters and find that 20 of them can be used to achieve PMU -Spill attack. Our experiments suggest that the throughput of PMU -Spill attack is up to 575.3 bytes per second (Bps) with an average error rate of 1.89% when leaking the SGX-protected secret data.

关键词： Side-channel attacks Throughput Phasor measurement units Hardware Software Recording Security

来源：评论

学校读者我要写书评

暂无评论

Implicit Multi-Scale Swin Transformer Network for Image Denoising

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Zhang, Qi Ding, Yuwei Zhang, Weiqi Zhu, Yian Zhang, Bob Lin, Jerry Chun-Wei Harbin Institute of Technology at Weihai School of Economics and Management Weihai China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China Northwestern Polytechnical University School of Computer Science Xi’an China Northwestern Polytechnical University Yangtze River Delta Research Institute Taicang China University of Macau PAMI Research Group Department of Computer and Information Science Taipa China Department of Distributed Systems and IT Devices Electrical Engineering and Mathematical Sciences Silesian university of technology Poland

Image denoising has been used in various edge computing scenarios such as consumer electronics to improve the image quality and user experience. Existing image denoising methods based on Convolutional Neural Networks (CNNs) and vision Transformers achieve good performance by empirically utilizing residual neural network (ResNet) as basic component. However, ResNet lacks interpretability in network design and also long-term memory of features, potentially restricting the performance of denoising networks. In this paper, we propose an Implicit Multi-scale Swin Transformer Network (IMSNet) for image denoising, which introduces the implicit Euler scheme from the feature memory perspective. Specifically, densely connected implicit feature extraction blocks (IFEBs) are designed to learn the residual mapping between noisy and clean images. The IFEB reformulates the initial skip connection of ResNet based on the implicit Euler discretization, providing both network interpretability and long-term memory. In IFEB, the multi-scale swin Transformer block (MSB) is designed as the implicit layer to capture spatial details and non-local contextual information at different scales. Additionally, a cross-layer feature fusion block (CLFF) is proposed to further improve feature reuse capabilities. Compared to existing denoising networks, the extensive experiments demonstrate the superior performance of our IMSNet in various image denoising tasks, and the flexibility in the practical applications with proposed light model on resource-restricted platforms such as consumer electronic devices. © 1975-2011 IEEE.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

Confidential token-based license management

arXiv

引用

arXiv 2021年

作者： Engelmann, Felix Speichert, Jan Philip God, Ralf Kargl, Frank Bösch, Christoph Department of Computer Science Aarhus University Aarhus Denmark Institute of Aircraft Cabin Systems TUHH - Hamburg University of Technology Hamburg Germany Institute of Distributed Systems Ulm University Ulm Germany

In a global economy with many competitive participants, licensing and tracking of 3D printed parts is desirable if not mandatory for many use-cases. We investigate a blockchain-based approach, as blockchains provide many attractive features, like decentralized architecture and high security assurances. An often neglected aspect of the product life-cycle management is the confidentiality of transactions to hide valuable business information from competitors. To solve the combined problem of trust and confidentiality, we present a confidential licensing and tracking system which works on any publicly verifiable, token-based blockchain that supports tokens of different types representing licenses or attributes of parts. Together with the secure integration of a unique eID in each part, our system provides an efficient, immutable and authenticated transaction log scalable to thousands of transactions per second. With our confidential Token-Based License Management system (cTLM), large industries such as automotive or aviation can license and trace all parts confidentially. Copyright © 2021, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of IP over cost-optimized optical multilayer networks with SRLGs 9

Performance evaluation of IP over cost-optimized optical mul...

引用

9. ITG-Fachtagung Photonische Netze - 9th ITG Conference on Photonic Networks

作者： Duelli, Michael Hartmann, Matthias Menth, Michael Hülsermann, Ralf Düser, Michael University of Wuerzburg Institute of Computer Science Department of Distributed Systems Am Hubland Würzburg97074 Germany T-Systems Enterprise Services GmbH Goslarer Ufer 35 Berlin10589 Germany

ISBN: (纸本)9783800730971

The design of optical transport and IP networks is investigated with respect to the effect on overall network performance when the two aspects are combined in the same network architecture. The focus is on the identification of advantages in the joint design of IP and transport networks, as well as on the shortcomings and network bottlenecks which may result from sub-optimal design. The impact of different IP routing strategies (shortest path, equal-cost multipath) on the network utilization is quantified, and potential sources for overload in the IP domain are determined. Simulations were carried out to systematically assess technical metrics like link utilization and economic parameters such as cost for a 50-node transport network with line rates up to 40 Gbit/s. The impact of fiber cuts was taken into account, leading to multiple logical IP links to fail simultaneously, i.e. shared risk link groups (SRLGs), and triggering massive IP rerouting. Applying the results allows to identify bottlenecks in the design, and to devise mechanisms which allow cost-optimal network design of future IP and optical transport networks. © 2020 ITG-Fachtagung.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

$$\mathcal {C}$$ o$$\mathcal {M}$$ erger: A Customizable Online Tool for Building a Consistent Quality-Assured Merged Ontology 17th

$$\mathcal {C}$$ o$$\mathcal {M}$$ erger: A Customizable Onl...

引用

17th Extended Semantic Web Conference, ESWC 2020

作者： Babalou, Samira Grygorova, Elena König-Ries, Birgitta Heinz-Nixdorf Chair for Distributed Information Systems Institute for Computer Science Friedrich Schiller University Jena Jena Germany Michael-Stifel-Center for Data-Driven and Simulation Science Jena Germany

ISBN: (纸本)9783030623265

Merging ontologies enables the reusability and interoperability of existing knowledge. With growing numbers of relevant ontologies in any given domain, there is a strong need for an automatic, scalable multi-ontology merging tool. We introduce erger, which covers four key aspects of the ontology merging field: compatibility checking of the user-selected Generic Merge Requirements (GMR)s, merging multiple ontologies with adjustable GMRs, quality assessment of the merged ontology, and inconsistency handling of the *** is freely accessible through a live portal and the source code is publicly distributed. © 2020, Springer Nature Switzerland AG.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Modern Computing: Vision and Challenges

arXiv

引用

arXiv 2024年

作者： Gill, Sukhpal Singh Wu, Huaming Patros, Panos Ottaviani, Carlo Arora, Priyansh Pujol, Victor Casamayor Haunschild, David Parlikad, Ajith Kumar Cetinkaya, Oktay Lutfiyya, Hanan Stankovski, Vlado Li, Ruidong Ding, Yuemin Qadir, Junaid Abraham, Ajith Ghosh, Soumya K. Song, Houbing Herbert Sakellariou, Rizos Rana, Omer Rodrigues, Joel J.P.C. Kanhere, Salil S. Dustdar, Schahram Uhlig, Steve Ramamohanarao, Kotagiri Buyya, Rajkumar School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom Center for Applied Mathematics Tianjin University Tianjin China Raygun Performance Monitoring Wellington New Zealand Department of Computer Science York Centre for Quantum Technologies University of York York United Kingdom Microsoft Schiphol Netherlands Distributed Systems Group Vienna University of Technology Vienna Austria Detecon International GmbH Munich Germany Institute for Manufacturing Department of Engineering University of Cambridge Cambridge United Kingdom Department of Engineering Science University of Oxford Oxford United Kingdom Department of Computer Science University of Western Ontario London Canada Faculty of Computer and Information Science University of Ljubljana Ljubljana Slovenia Institute of Science and Engineering Kanazawa University Japan Tecnun School of Engineering University of Navarra Spain Department of Computer Science and Engineering College of Engineering Qatar University Doha Qatar Bennett University Greater Noida India Machine Intelligence Research Labs AuburnWA United States Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Baltimore United States Department of Computer Science University of Manchester Oxford Road Manchester United Kingdom School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Department of Computer Science College of Computer and Information Sciences King Saud University Riyadh Saudi Arabia COPELABS Lusófona University Lisbon Portugal Sydney Australia The University of Melbourne Victoria Australia Laboratory School of Computing and Information Systems The University of Melbourne Australia

Over the past six decades, the computing systems field has experienced significant transformations, profoundly impacting society with transformational developments, such as the Internet and the commodification of computing. Underpinned by technological advancements, computer systems, far from being static, have been continuously evolving and adapting to cover multifaceted societal niches. This has led to new paradigms such as cloud, fog, edge computing, and the Internet of Things (IoT), which offer fresh economic and creative opportunities. Nevertheless, this rapid change poses complex research challenges, especially in maximizing potential and enhancing functionality. As such, to maintain an economical level of performance that meets ever-tighter requirements, one must understand the drivers of new model emergence and expansion, and how contemporary challenges differ from past ones. To that end, this article investigates and assesses the factors influencing the evolution of computing systems, covering established systems and architectures as well as newer developments, such as serverless computing, quantum computing, and on-device AI on edge devices. Trends emerge when one traces technological trajectory, which includes the rapid obsolescence of frameworks due to business and technical constraints, a move towards specialized systems and models, and varying approaches to centralized and decentralized control. This comprehensive review of modern computing systems looks ahead to the future of research in the field, highlighting key challenges and emerging trends, and underscoring their importance in cost-effectively driving technological progress. © 2024, CC BY.

关键词： Obsolescence

来源：评论

学校读者我要写书评

暂无评论

PreMatch: A Prediction-based Scheduler for Dataflow Asynchronous Processing on the Computing Continuum 25

PreMatch: A Prediction-based Scheduler for Dataflow Asynchro...

引用

Proceedings of the 40th ACM/SIGAPP Symposium on Applied Computing

作者： Narges Mehran Zahra Najafabadi Samani Samira Afzal Radu Prodan Frank Pallas Peter Dorfinger Intelligent Connectivity Group Salzburg Research Forschungsgesellschaft mbH Salzburg Salzburg Austria Faculty of Digital and Analytical Sciences Paris Lodron University of Salzburg Salzburg Salzburg Austria Distributed and Parallel Systems Group University of Innsbruck Innsbruck Tyrol Austria Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Enschede Overijssel Netherlands Institute of Information Technology Alpen-Adria-University of Klagenfurt Klagenfurt Carinthia Austria

ISBN: (纸本)9798400706295

The popularity of asynchronous data exchange patterns has recently increased, as evidenced by 23% of the communication between microservices in an Alibaba trace analysis. Such workloads necessitate methods for reducing dataflow processing and completion time by forecasting the future requirements of their microservices and (re-)scheduling them. Therefore, we investigate a prediction-based scheduling method of asynchronous dataflow processing applications by considering the stochastic changes due to dynamic user requirements. We present a microservice scaling and scheduling method named PreMatch combining a machine learning (ML) prediction strategy based on gradient boosting with ranking and game theory matching scheduling principles. Firstly, PreMatch predicts the number of microservice replicas, and then, the ranking method orders the microservice replicas and devices based on microservice and transmission times. Thereafter, the PreMatch schedules microservice replicas requiring dataflow processing on computing devices. Experimental analysis of the PreMatch method shows lower completion times on average 13% compared to a related prediction-based scheduling method.

关键词： microservice

来源：评论

学校读者我要写书评

暂无评论

Two Algorithms for Designing Control over Centerof-Mass Motion of a Moving Object with Incomplete Description 2

Two Algorithms for Designing Control over Centerof-Mass Moti...

引用

2nd International Conference on Control systems, Mathematical Modeling, Automation and Energy Efficiency, SUMMA 2020

作者： Kolesnikova, S.I. Paraev, Yu. I. Tsvetnitskaya, S.A. St.Petersburg State University of Aerospae Instrumentation Institute of Computational Systems and Programming St. Petersburg Russia National Research Tomsk State University Institute of Applied Mathematics and Computer Science Tomsk Russia

ISBN: (纸本)9781728188409

The methods of nonlinear adaptation based on an analytical design of aggregated regulators and modal control are discussed for solving the problem of nonlinear control over a robotic arm operating under the conditions of nonrandom noise. A comparative analysis of control is performed under different types of noise variables. It is shown that both control systems are adaptive and robust, while their transient process quality characteristics differ. The results of numerical modeling support the method of nonlinear adaptation as far as the value of overshoot is concerned in the case of nonrandom noise and evidence in favor of the method of modal control identifying the noise for off-design conditions (random high level noise). © 2020 IEEE.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Prediction of the final size for COVID-19 epidemic using machine learning:A case study of Egypt

引用

Infectious Disease Modelling 2020年第1期5卷 622-634页

作者： Lamiaa A.Amar Ashraf A.Taha Marwa Y.Mohamed Networks and Distributed Systems Department Informatics Research InstituteCity of Scientific Research and Technological ApplicationsSRTA-CITYEgypt Multimedia and Computer Graphics Department Informatics Research InstituteCity of Scientific Research and Technological ApplicationsSRTA-CITYEgypt Department of Mathematics and Computer Science Faculty of ScienceAlexandria UniversityEgypt

COVID-19 is spreading within the sort of an enormous epidemic for the *** epidemic infects a lot of individuals in *** World Health Organization states that COVID-19 could be spread from one person to another at a very fast speed through contact and respiratory *** these days,Egypt and all countries worldwide should rise to an effective step to investigate this disease and eliminate the effects of this *** this paper displayed,the real database of COVID-19 for Egypt has been analysed from February 15,2020,to June 15,2020,and predicted with the number of patients that will be infected with COVID-19,and estimated the epidemic final *** regression analysis models have been applied for data analysis of COVID-19 of *** this study,we’ve been applied seven regression analysis-based models that are exponential polynomial,quadratic,thirddegree,fourth-degree,fifth-degree,sixth-degree,and logit growth respectively for the COVID-19 ***,the exponential,fourth-degree,fifth-degree,and sixth-degree polynomial regression models are excellent models specially fourth-degree model that will help the government preparing their procedures for one *** addition,we have applied the well-known logit growth regression model and we obtained the following epidemiological insights:Firstly,the epidemic peak could possibly reach at 22-June 2020 and final time of epidemic at 8-September ***,the final total size for cases 1.6676Et05 *** action from government of interevent over a relatively long interval is necessary to minimize the final epidemic size.

关键词： COVID-19 Regression analysis model Epidemic model

来源：评论

学校读者我要写书评

暂无评论

Theoretically Guaranteed Online Workload Dispatching for Deadline-Aware Multi-Server Jobs

arXiv

引用

arXiv 2021年

作者： Zhao, Hailiang Deng, Shuiguang Yin, Jianwei Dustdar, Schahram Zomaya, Albert Y. School of Computer Science and Technology Wuhan University of Technology Wuhan China The Massachusetts Institute of Technology United States China The Distributed Systems Group The Tu Wien Austria The Centre for Distributed and High-Performance Computing The University of Sydney Australia

Multi-server jobs are imperative in modern computing clusters. A multi-server job has multiple task components and each of the task components is responsible for processing a specific size of workloads. Efficient online workload dispatching is crucial but challenging to co-located heterogeneous multi-server jobs. The dispatching policy should decide (i) where to launch each task component instance of the arrived jobs and (ii) the size of workloads that each task component processes. Existing policies are explicit and effective when facing service locality and resource contention in both offline and online settings. However, when adding the deadline-aware constraint, the theoretical superiority of these policies could not be guaranteed. To fill the theoretical gap, in this paper, we design an α-competitive online workload dispatching policy for deadline-aware multi-server jobs based on the spatio-temporal resource mesh model. We formulate the problem as a social welfare maximization program and solve it online with several well designed pseudo functions. The social welfare is formulated as the sum of the utilities of jobs and the utility of the computing cluster. The proposed policy is rigorously proved to be α-competitive for some α ≥ 2. We also validate the theoretical superiority of it with simulations and the results show that it distinctly outperforms two handcrafted baseline policies on the social welfare. © 2021, CC BY-NC-ND.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：