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

Service Placement and Request Scheduling for Data-Intensive Applications in Edge Clouds

IEEE-ACM TRANSACTIONS ON NETWORKING 2021年第2期29卷 779-792页

作者： Farhadi, Vajiheh Mehmeti, Fidan He, Ting La Porta, Thomas F. Khamfroush, Hana Wang, Shiqiang Chan, Kevin S. Poularakis, Konstantinos Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA Univ Kentucky Dept Comp Sci Lexington KY 40506 USA IBM TJ Watson Ctr Yorktown Hts NY 10598 USA Army Res Lab Adelphi MD 20783 USA Yale Univ Dept Elect Engn New Haven CT 06520 USA

Mobile edge computing provides the opportunity for wireless users to exploit the power of cloud computing without a large communication delay. To serve data-intensive applications (e.g., video analytics, machine learning tasks) from the edge, we need, in addition to computation resources, storage resources for storing server code and data as well as network bandwidth for receiving user-provided data. Moreover, due to time-varying demands, the code and data placement needs to be adjusted over time, which raises concerns of system stability and operation cost. In this paper, we address these issues by proposing a two-time-scale framework that jointly optimizes service (code and data) placement and request scheduling, while considering storage, communication, computation, and budget constraints. First, by analyzing the hardness of various cases, we completely characterize the complexity of our problem. Next, we develop a polynomial-time service placement algorithm by formulating our problem as a set function optimization, which attains a constant-factor approximation under certain conditions. Furthermore, we develop a polynomial-time request scheduling algorithm by computing the maximum flow in a carefully constructed auxiliary graph, which satisfies hard resource constraints and is provably optimal in the special case where requests have homogeneous resource demands. Extensive synthetic and trace-driven simulations show that the proposed algorithms achieve 90% of the optimal performance.

关键词： Processor scheduling Cloud computing Servers Bandwidth Complexity theory Edge computing Computational modeling Mobile edge computing service placement workload scheduling complexity analysis algorithm design

来源：评论

学校读者我要写书评

暂无评论

Pressure Time Dose as a Representation of Intracranial Pressure Burden and Its Dependency on Intracranial Pressure Waveform Morphology at Different Time Intervals

引用

SENSORS 2023年第19期23卷 8051-8051页

作者： Schoenenberg-Tu, Anna-Li Cysarz, Dirk Petzold, Benjamin Bluemel, Carl Benjamin Raak, Christa Fricke, Oliver Edelhaeuser, Friedrich Scharbrodt, Wolfram Gemeinschaftskrankenhaus Herdecke Chair Integrat Neuromed D-58313 Herdecke Germany Witten Herdecke Univ Inst Integrat Med D-58313 Herdecke Germany Witten Herdecke Univ Integrated Curriculum Anthroposoph Med D-58313 Herdecke Germany Witten Herdecke Univ Fac Hlth Dept Human Med D-58455 Witten Germany Klinikum Stuttgart Dept Child & Adolescent Psychiat & Psychotherapy D-70174 Stuttgart Germany

Intracranial pressure (ICP) burden or pressure time dose (PTD) is a valuable clinical indicator for pending intracranial hypertension, mostly based on threshold exceedance. Pulse frequency and waveform morphology (WFM) of the ICP signal contribute to PTD. The temporal resolution of the ICP signal has a great influence on PTD calculation but has not been systematically studied yet. Hence, the temporal resolution of the ICP signal on PTD calculation is investigated. We retrospectively analysed continuous 48 h ICP recordings with high temporal resolution obtained from 94 patients at the intensive care unit who underwent neurosurgery due to an intracranial haemorrhage and received an intracranial pressure probe (43 females, median age: 72 years, range: 23 to 88 years). The cumulative area under the curve above the threshold of 20 mmHg was compared for different temporal resolutions of the ICP signal (beat-to-beat, 1 s, 300 s, 1800 s, 3600 s). Events with prolonged ICP elevation were compared to those with few isolated threshold exceedances. PTD increased for lower temporal resolutions independent of WFM and frequency of threshold exceedance. PTDbeat-to-beat best reflected the impact of frequency of threshold exceedance and WFM. Events that could be distinguished in PTDbeat-to-beat became magnified more than 7-fold in PTD1s and more than 104 times in PTD1h, indicating an overestimation of PTD. PTD calculation should be standardised, and beat-by-beat PTD could serve as an easy-to-grasp indicator for the impact of frequency and WFM of ICP elevations on ICP burden.

关键词： intracranial pressure waveform analysis algorithm design ICP burden pressure time dose area under the curve time intervals

来源：评论

学校读者我要写书评

暂无评论

Computing the k densest subgraphs of a graph

引用

INFORMATION PROCESSING LETTERS 2023年 179卷

作者： Dondi, Riccardo Hermelin, Danny Univ Bergamo Bergamo Italy Ben Gurion Univ Negev Beer Sheva Israel

Computing cohesive subgraphs is a central problem in graph theory. While many formulations of cohesive subgraphs lead to NP-hard problems, finding a densest subgraph can be done in polynomial-time. As such, the densest subgraph model has emerged as the most popular notion of cohesiveness. Recently, the data mining community has started looking into the problem of computing k densest subgraphs in a given graph, rather than one. In this paper we consider a natural variant of the k densest subgraphs problem, where overlap between solution subgraphs is allowed with no constraint. We show that the problem is fixed-parameter tractable with respect to k, and admits a PTAS for constant k. Both these algorithms complement nicely the previously known O (nk) algorithm for the problem. (c) 2022 Elsevier B.V. All rights reserved.

关键词： algorithm design Network mining and analysis Densest subgraph algorithmic aspects of networks algorithms

来源：评论

学校读者我要写书评

暂无评论

Toward Scalable and Robust Indoor Tracking: design, Implementation, and Evaluation

引用

IEEE INTERNET OF THINGS JOURNAL 2020年第2期7卷 1192-1204页

作者： Jin, Feiyu Liu, Kai Zhang, Hao Ng, Joseph Kee-Yin Guo, Songtao Lee, Victor C. S. Son, Sang H. Chongqing Univ Key Lab Dependable Serv Comp Cyber Phys Soc Minist Educ Chongqing 400040 Peoples R China Chongqing Univ Coll Comp Sci Chongqing 400040 Peoples R China Hong Kong Baptist Univ Dept Comp Sci Hong Kong Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Daegu Gyeongbuk Inst Sci & Technol Dept Informat & Commun Engn Daegu 42988 South Korea

Although indoor localization has been studied over a decade, it is still challenging to enable many IoT applications, such as activity tracking and monitoring in smart home and customer navigation and trajectory mining in smart shopping mall, which typically require meter-level localization accuracy in a highly dynamic and large-scale indoor environment. Therefore, this article aims at designing and implementing an adaptive and scalable indoor tracking system in a cost-effective way. First, we propose a zero site-survey overhead (ZSSO) algorithm to enhance the system scalability. It integrates the step information and map constraints to infer user's positions based on the particle filter and supports the auto labeling of scanned Wi-Fi signal for constructing the fingerprint database without the extra site-survey overhead. Further, we propose an iterative-weight-update (IWU) strategy for ZSSO to enhance system robustness and make it more adaptive to the dynamic changing of environments. Specifically, a two-step clustering mechanism is proposed to delete outliers in the fingerprint database and alleviate the mismatch between the auto-tagged coordinates and the corresponding signal features. Then, an iterative fingerprint update mechanism is designed to continuously evaluate the Wi-Fi fingerprint localization results during online tracking, which will further refine the fingerprint database. Finally, we implement the indoor tracking system in real-world environments and conduct a comprehensive performance evaluation. The field testing results conclusively demonstrate the scalability and effectiveness of the proposed algorithms.

关键词： algorithm design indoor localization performance evaluation trajectory tracking Wi-Fi fingerprint

来源：评论

学校读者我要写书评

暂无评论

Scheduled Imaging of Multiple Threat Aircraft Using a Modified Traveling Salesman Problem

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2021年第7期18卷 476-486页

作者： Kang, Changkoo Woolsey, Craig A. Virginia Tech Dept Aerosp & Ocean Engn Blacksburg VA 24061 USA

来源：评论

学校读者我要写书评

暂无评论

On the Existence of EFX Allocations in Multigraphs 25

On the Existence of EFX Allocations in Multigraphs

引用

Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems

作者： Alkmini Sgouritsa Minas Marios Sotiriou Athens University of Economics and Business and Archimedes/Athena RC Athens Greece National and Kapodistrian University of Athens and National Technical University of Athens and Athens University of Economics and Business Athens Greece

ISBN: (纸本)9798400714269

We study the problem of "fairly" dividing indivisible goods to several agents that have valuation set functions over the sets of goods. As fair we consider the allocations that are envy-free up to any good (EFX), i.e., no agent envies any proper subset of the goods given to any other agent. The existence or not of EFX allocations is a major open problem in Fair Division, and there are only positive results for special *** et al.[19] introduced a restriction on the agents' valuations according to a graph structure: the vertices correspond to agents and the edges to goods, and each vertex/agent has zero marginal value (or in other words, they are indifferent) for the edges/goods that are not adjacent to them. The existence of EFX allocations has been shown for simple graphs with general monotone valuations [19], and for multigraphs for restricted additive valuations [28].In this work, we push the state-of-the-art further, and show that the EFX allocations always exists in multigraphs and general monotone valuations if any of the following two conditions hold: either (a) each agent has at most ⌈n/4⌉ -1 neighbors, where n is the total number of agents, or (b) the shortest cycle with non-parallel edges has length at least 6.

关键词： algorithm design

来源：评论

学校读者我要写书评

暂无评论

Dynamic Infection Spread Model Based Group Testing

引用

algorithmS 2023年第1期16卷 25-25页

作者： Arasli, Batuhan Ulukus, Sennur Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA

Group testing idea is an efficient approach to detect prevalence of an infection in the test samples taken from a group of individuals. It is based on the idea of pooling the test samples and performing tests to the mixed samples. This approach results in possible reduction in the required number of tests to identify infections. Classical group testing works consider static settings where the infection statuses of the individuals do not change throughout the testing process. In our paper, we study a dynamic infection spread model, inspired by the discrete time SIR model, where infections are spread via non-isolated infected individuals, while infection keeps spreading over time, a limited capacity testing is performed at each time instance as well. In contrast to the classical, static group testing problem, the objective in our setup is not to find the minimum number of required tests to identify the infection status of every individual in the population, but to control the infection spread by detecting and isolating the infections over time by using the given, limited number of tests. In order to analyze the performance of the proposed algorithms, we focus on the average-case analysis of the number of individuals that remain non-infected throughout the process of controlling the infection. We propose two dynamic algorithms that both use given limited number of tests to identify and isolate the infections over time, while the infection spreads, while the first algorithm is a dynamic randomized individual testing algorithm, in the second algorithm we employ the group testing approach similar to the original work of Dorfman. By considering weak versions of our algorithms, we obtain lower bounds for the performance of our algorithms. Finally, we implement our algorithms and run simulations to gather numerical results and compare our algorithms and theoretical approximation results under different sets of system parameters.

关键词： group testing dynamic group testing algorithm design group testing over time pooled testing

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Energy Optimal Coordinated Planning algorithm Considering New Energy Grid Connection 2

Comprehensive Energy Optimal Coordinated Planning Algorithm ...

引用

2nd International Conference for Information Systems and design (ICID)

作者： Chen, Ke Gu, Hongjie Wang, Jiaqi Zhang, Chengxin Ying, Zhangchi State Grid Zhejiang Elect Power Corp Informat & Telecommun Branch Hangzhou Peoples R China State Grid ZheJiang Mkt Serv Ctr Hangzhou Peoples R China

ISBN: (纸本)9781665420655

In order to solve the problem of large energy consumption caused by premature convergence of comprehensive energy scheduling algorithm, a comprehensive energy optimal coordination planning algorithm considering new energy grid connection is proposed. The power output models of wind power station, photovoltaic power station, cascade hydropower station and thermal power plant are established to determine their power characteristics. Considering the new energy grid connection, construct the joint distribution function, calculate the correlation coefficient between wind power generation and photovoltaic power generation, and establish a comprehensive power generation mode. By setting the objective function and constraints, the comprehensive energy joint control model is constructed, and the optimal coordinated programming algorithm is designed to solve the objective function to meet the load demand of users. The example analysis results show that under the condition of roughly the same solution time, compared with the coordinated planning algorithm based on multi-objective difference and dynamic programming, the algorithm designed in this paper has less energy consumption of thermal power plants and water consumption of cascade hydropower stations, and can realize the optimal operation of the whole power system.

关键词： new energy grid connection comprehensive energy coordinate planning algorithm design optimal coordinatio

来源：评论

学校读者我要写书评

暂无评论

A Survey of Undergraduate Theory of Computing Curricula 2024

A Survey of Undergraduate Theory of Computing Curricula

引用

Proceedings of the 2024 on ACM Virtual Global Computing Education Conference V. 2

作者： Ryan E. Dougherty Tim Randolph Tzu-Yi Chen Jeff Erickson Matthew Ferland Dennis Komm Jonathan Liu Timothy Ng Seth Poulsen Smaranda Sandu Michael Shindler Edward Talmage Thomas Zeume United States Military Academy West Point NY USA Harvey Mudd College Claremont CA USA Pomona College Claremont CA USA University of Illinois Urbana-Champaign Urbana IL USA Dickinson College Carlisle PA USA ETH Zürich Zürich Switzerland University of Chicago Chicago IL USA Utah State University Logan UT USA Wellsley College Wellesley MA USA UC Irvine Irvine CA USA Bucknell University Lewisburg PA USA Ruhr University Bochum Bochum Germany

ISBN: (纸本)9798400706042

Theory of Computing (ToC) is an important aspect of nearly every undergraduate CS curriculum, as it concerns what computation fundamentally means. However, there has been little research into ToC pedagogy, both within the classroom and how it fits within its institutional context. We propose in this working group to create a survey of current ToC pedagogy. Our goals are to create a standard for teaching ToC, find trends, determine under-researched areas, and to build a community among ToC educators.

关键词： algorithm design

来源：评论

学校读者我要写书评

暂无评论

A Bayesian Multi-Armed Bandit algorithm for Dynamic End-to-End Routing in SDN-Based Networks with Piecewise-Stationary Rewards

引用

algorithmS 2023年第5期16卷 233-233页

作者： Santana, Pedro Moura, Jose ISCTE Univ Inst Lisbon ISCTE IUL Av Forcas Armadas P-1649026 Lisbon Portugal ISTAR Informat Sci & Technol & Architecture Res Ct Av Forcas Armadas P-1649026 Lisbon Portugal Inst Telecomunicacoes IT Av Forcas Armadas P-1649026 Lisbon Portugal

To handle the exponential growth of data-intensive network edge services and automatically solve new challenges in routing management, machine learning is steadily being incorporated into software-defined networking solutions. In this line, the article presents the design of a piecewise-stationary Bayesian multi-armed bandit approach for the online optimum end-to-end dynamic routing of data flows in the context of programmable networking systems. This learning-based approach has been analyzed with simulated and emulated data, showing the proposal's ability to sequentially and proactively self-discover the end-to-end routing path with minimal delay among a considerable number of alternatives, even when facing abrupt changes in transmission delay distributions due to both variable congestion levels on path network devices and dynamic delays to transmission links.

关键词： networks routing congestion variable link delay SDN algorithm design multi-armed bandits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：