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

A Truthful Randomized Mechanism for Heterogeneous Resource Allocation With Multi-Minded in Mobile Edge Computing

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2024年第5期21卷 5677-5690页

作者： Liu, Xi Li, Weidong Qujing Normal Univ Sch Informat Engn Key Lab Intelligent Sensor & Syst Design Qujing 655001 Peoples R China Yunnan Univ Sch Math & Stat Kunming 650504 Peoples R China

In the context of mobile edge computing (MEC), it can be quite challenging to provide and allocate multiple resources from heterogeneous MEC servers for remote execution of tasks of mobile devices (MDs). However, obtaining more resources for tasks can save time and effort, and MDs are willing to pay higher prices for more resources. Motivated by these challenges, this study addresses the problem of heterogeneous resource allocation with multi-minded (HRAM) in MEC. Unlike other studies that have focused on MDs with single-minded demands, this study considers the multi-attribute demands of MDs. It considers cases where an MD declares multiple demands, each with a different bid attached to it. This multi-minded approach gives MDs more flexibility and control over the resources they receive, leading to increased satisfaction and better outcomes. However, MDs are self-interested and can misreport their preferences, which results in a low utilization rate of heterogeneous resources. Therefore, we have formulated this problem in an auction-based setting, and our objective is to allocate heterogeneous resources of heterogeneous MEC servers to maximize social welfare, which is the sum of MDs' valuations. We demonstrate that the HRAM problem is NP-hard, proposing a randomized mechanism consisting of a second-price auction and a fixed-price auction. This study claims that the proposed randomized mechanism is universally truthful and that the MDs have no desire to misreport their demands. Additionally, we analyze the randomized mechanism's time complexity and approximation ratio and present the experimental results to support our claim. We demonstrate that the randomized mechanism performs excellently in different environments, benefiting MDs and edge cloud providers.

关键词： Servers Task analysis Resource management Cost accounting Approximation algorithms Computational modeling Multitasking Mobile edge computing truthfulness resource allocation multi-minded algorithm design

来源：评论

学校读者我要写书评

暂无评论

Use of smartphones as optical metrology tools for surface wear detection

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2021年第1-2期114卷 231-240页

作者： Diamanti, Eleftheria Iriarte, Eneko Oblak, Eva Dominguez-Meister, Santiago Ibanez, Inigo Braceras, Inigo Berger, Andreas CIC NanoGUNE Tolosa Hiribidea 76 Donostia San Sebastian 20018 Spain Tecnalia Res & Innovat Mikeletegi Pasealekua 2 Donostia San Sebastian 20009 Spain

Proper wear level information and early wear detection are crucial goals in many engineering applications and industrial components in order to improve efficiency and reduce production, maintenance, or replacements costs. Furthermore, this should ideally be achieved with a user-friendly, low-cost, and easy to implement methodology for wear level monitoring and detection. In this work, we present the design of a new approach to accomplish early wear detection that is implemented by means of a stand-alone smartphone device and application providing real-time online metrology. The online monitoring is done by means of optical measurements and image processing based on the advanced smartphone vision system technology currently available in commercial devices. The developed mobile App works in continuous mode without interrupting the wear process. Specifically, it traces surface changes and monitors the progression of wear enabling just-in-time warning alarms for "significant wear" and "critical wear" detection. We demonstrate that critical wear of a surface prior to fatal rupture can be detected, which is the main objective in many industrial applications.

关键词： algorithm design Wear recognition algorithm Image processing Smartphone vision system Online wear data engineering User-friendly portable tribology testing

来源：评论

学校读者我要写书评

暂无评论

Speed scaling problems with memory/cache consideration

引用

JOURNAL OF SCHEDULING 2018年第6期21卷 633-646页

作者： Wu, Weiwei Li, Minming Wang, Kai Huang, He Chen, Enhong Southeast Univ Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China Univ Sci & Technol China Sch Comp Sci Hefei Anhui Peoples R China

Speed scaling problems consider energy- efficient job scheduling in processors by adjusting the speed to reduce energy consumption, where power consumption is a convex function of speed ( usually, P( s) = sa, a = 2, 3). In this work, we study speed scaling problems considering memory/ cache. Each job needs some time for memory operation when it is fetched from memory, and needs less time if fetched from the cache. The objective is to minimize energy consumption while satisfying the time constraints of the jobs. Two models are investigated, the non- cache model and the with- cache model. The non- cache model is a variant of the ideal model, where each job i needs a fixed ci time for its memory operation;the with- cache model further considers the cache, a memory device with much faster access time but limited space. The uniform with- cache model is a special case of the with- cache model in which all ci values are the same. We provide an O( n3) time algorithm and an improved O( n2 log n) time algorithm to compute the optimal solution in the non- cache model. For the with- cache model, we prove that it is NP- complete to compute the optimal solution. For the uniform with- cache model with agreeable jobs ( later- released jobs do not have earlier deadlines), we derive an O( n4) time algorithm to compute the optimal schedule, while for the general case we propose a ( 2a g g- 1) a/ 2- approximation algorithm in a resource augmentation setting in which the memory operation time can accelerate by at most g times.

关键词： Speed scaling Energy efficiency Scheduling Memory operation time DVS algorithm design

来源：评论

学校读者我要写书评

暂无评论

An Adjoint-Based Hybrid Computational Method for Crosswell Seismic Inversion

引用

COMPUTING IN SCIENCE & ENGINEERING 2014年第6期16卷 60-67页

作者： Cao, Danping Liao, Wenyuan China Univ Petr Sch Geosci Huadong Peoples R China Univ Calgary Calgary AB T2N 1N4 Canada

Here, a cascade-like hybrid tomography technology is proposed to solve the crosswell seismic inversion problem. This new method combines several widely used tomography technologies, implemented in a sequence starting with the Radon-transform-based back-projection method, then the Linear Iterative Reconstruction method, next the nonlinear Gradient-based Eikonal Equation Tomography method, and finally full waveform inversion.

关键词： Radon transforms conjugate gradient methods geophysical techniques geophysics computing nonlinear equations seismology FWI Radon-transform-based back-projection method adjoint-based hybrid computational method cascade-like hybrid tomography technology crosswell seismic inversion problem full-waveform inversion linear iterative reconstruction method nonlinear-gradient-based Eikonal equation tomography method ray tomography methods selective internal radiation therapy velocity model reconstruction waveform tomography Computational modeling Iterative methods Mathematical model Numerical models Seismic measurements Subspace constraints Tomography FWI GEET LIR algorithm design back projection inverse problem numerical algorithm ray tomography scientific computing waveform tomography

来源：评论

学校读者我要写书评

暂无评论

Solving SAT by algorithm Transform of Wu's Method

引用

Journal of Computer Science & Technology 1999年第5期14卷 468-480页

作者：贺思敏张钹 Department of Computer Science and Technology National Key Laboratory of Intelligent Technology and Systems Tsinghua University Beijing P.R. China

Recently algorithms for solving propositional satisfiability problem,or SAT, have aroused great illterest, and more attention has been paid to trans-formation problem solving. The commonly used transformation is representationtransform, but since its ifltermediate computing procedure is a black box from theviewpoint of the original problem, this aPproach has many limitations. In this paper, a new approach called algorithm transform is proposed and applied to solvingSAT by Wu's method, a general algorithm for solving polynomial equations. By es-tablishing the correspondellce between the primitive operation in Wu's method andclause resolution in SAT, it is shown that Wu's method, when used for solving SAT,is primarily a restricted clause resolution procedure. While Wu's method illtroduceselltirely new concepts, e.g. characteristic set of clauses, to resolution procedure, thecomplexity result of resolution procedure suggests an exponential lower bound toWu's method for solving general polynomial equations. Moreover, this algorithmtransform can help achieve a more efficiellt imp1ementation of Wu's method since itcan avoid the complex manipulation of polynomials and can make the best use ofdomain specific knowledge.

关键词： algorithm design satisfiability problem Wu's method automated reasoning

来源：评论

学校读者我要写书评

暂无评论

Energy-aware allocation for delay-sensitive multitask in mobile edge computing

引用

JOURNAL OF SUPERCOMPUTING 2022年第15期78卷 16621-16646页

作者： Liu, Xi Liu, Jun Wu, Hong Qujing Normal Univ Sch Informat Engn Qujing 655000 Peoples R China Qujing Normal Univ Inst Appl Math Qujing 655000 Peoples R China

With lower network latency and powerful hardware, mobile edge computing (MEC) is effective for computation-intensive and delay-sensitive tasks. The rising energy and low-latency demands of mobile applications for MEC pose challenges to task allocation. In this work, we consider computation offloading in MEC that is composed of a set of mobile devices, each with multiple tasks to offload to a nearby MEC server, with both single and multiple access points (APs). With multiple APs deployed, each mobile device can directly communicate with one or more APs, and their tasks can offload to different MEC servers that are within direct communication range. By considering binary computation offloading mode and limited subchannels, we formulate the multitask allocation problem as an integer programming problem, with the objective of minimizing the total energy consumption of all mobile devices while meeting deadline requirements. To solve this complicated problem, we propose efficient algorithms for single and multiple APs, and analyze related properties, including the approximation ratio and complexity. Experiments show that the algorithm can find high-quality solutions in a short time.

关键词： Mobile edge computing Computation offloading Resource allocation Energy consumption algorithm design

来源：评论

学校读者我要写书评

暂无评论

A new cooperative framework for parallel trajectory-based metaheuristics

引用

APPLIED SOFT COMPUTING 2018年 65卷 374-386页

作者： Shi, Jialong Zhang, Qingfu Xi An Jiao Tong Univ Sch Math & Stat Xian Shaanxi Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China City Univ Hong Kong Shenzhen Res Inst Shenzhen Peoples R China

In this paper, we propose the Parallel Elite Biased framework (PEB framework) for parallel trajectory-based metaheuristics. In the PEB framework, multiple search processes are executed concurrently. During the search, each process sends its best found solutions to its neighboring processes and uses the received solutions to guide its search. Using the PEB framework, we design a parallel variant of Guided Local Search (GLS) called PEBGLS. Extensive experiments have been conducted on the Tianhe-2 supercomputer to study the performance of PEBGLS on the Traveling Salesman Problem (TSP). The experimental results show that PEBGLS is a competitive parallel metaheuristic for the TSP, which confirms that the PEB framework is useful for designing parallel trajectory-based metaheuristics. (c) 2018 Elsevier B.V. All rights reserved.

关键词： Combinatorial optimization Parallel metaheuristics algorithm design Guided Local Search

来源：评论

学校读者我要写书评

暂无评论

Stability in barter exchange markets

引用

AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2019年第5期33卷 518-539页

作者： Gupta, Sushmita Panolan, Fahad Saurabh, Saket Zehavi, Meirav HBNI Natl Inst Sci Educ & Res Jatni India Univ Bergen Dept Informat Bergen Norway HBNI Inst Math Sci Chennai Tamil Nadu India Ben Gurion Univ Negev Beer Sheva Israel

The notion of stability is the foundation of several classic problems in economics and computer science that arise in a wide-variety of real-world situations, including Stable Marriage, Stable Roommate, Hospital Resident and Group Activity Selection. We study this notion in the context of barter exchange markets. The input of our problem of interest consists of a set of people offering goods/services, with each person subjectively assigning values to a subset of goods/services offered by other people. The goal is to find a stable transaction, a set of cycles that is stable in the following sense: there does not exist a cycle such that every person participating in that cycle prefers to his current "status". For example, consider a market where families are seeking vacation rentals and offering their own homes for the same. Each family wishes to acquire a vacation home in exchange of its own home without any monetary exchange. We study such a market by analyzing a stable transaction of houses involving cycles of fixed length. The underlying rationale is that an entire trade/exchange fails if any of the participating agents cancels the agreement;as a result, shorter (trading) cycles are desirable. We show that given a transaction, it can be verified whether or not it is stable in polynomial time, and that the problem of finding a stable transaction is NP-hard even if each person desires only a small number of other goods/services. Having established these results, we study the problem of finding a stable transaction in the framework of parameterized algorithms.

关键词： algorithm design Stability Barter exchange FPT W[1]-hard

来源：评论

学校读者我要写书评

暂无评论

Real-time optical flow processing on embedded GPU: an hardware-aware algorithm to implementation strategy

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2022年第2期19卷 317-329页

作者： Seznec, Mickael Gac, Nicolas Orieux, Francois Naik, Alvin Sashala Thales Res & Technol Palaiseau France Univ Paris Saclay Lab Signaux & Syst Cent Supelec CNRS Gif Sur Yvette France

Determining the optical flow of a video is a compute-intensive task essential for computer vision. For achieving this processing in real time, the whole algorithm deployment chain must be thought of for efficiency first. The development is usually divided into two parts: first, designing an algorithm that meets precision constraints, then, implementing and optimizing its execution on the targeted platform. We argue that unifying those operations enhances performance on the embedded processor. This paper is based on an industrial use case of computer vision. The objective is to determine dense optical flow in real time on an embedded GPU platform: the Nvidia AGX Xavier. The CLG (combined local-global) optical flow method, initially chosen, is analyzed to understand the convergence speed of its underlying optimization problem. The Jacobi solver is selected for implementation because of its parallel nature. The whole multi-level processing is then ported to the GPU, using several specific optimization strategies. In particular, we analyze the impact of fusing the solver's iterations with the roofline model. As a result, with a 30 W power budget, our implementation runs at 60FPS, on 640 x 512 images, with a four-level processing. Hopefully, this example should provide feedback on the issues that arise when trying to port a method to a parallel platform and serve for further implementations of computer vision algorithms on specialized hardware.

关键词： algorithm design Optical flow GPU optimization Linear solvers Image processing

来源：评论

学校读者我要写书评

暂无评论

ON TUNING THE BOYER-MOORE-HORSPOOL STRING SEARCHING algorithm

引用

SOFTWARE-PRACTICE & EXPERIENCE 1994年第4期24卷 435-436页

作者： SMITH, PD Department of Computer Science California State University Northridge CA 91330 U.S.A.

Experiments suggest that recently reported improvements to the Boyer-Moore-Horspool string searching algorithm may be due to compiler effects rather than to properties of the language being searched.

关键词： algorithm design BOYER-MOORE STRING SEARCHING

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：