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

arXiv 2024年

作者： Manupriya, Piyushi Jawanpuria, Pratik Gurumoorthy, Karthik S. Jagarlapudi, SakethaNath Mishra, Bamdev Department of Computer Science and Engineering IIT Hyderabad India Microsoft India Walmart Global Tech India

Unbalanced optimal transport (UOT) has recently gained much attention due to its flexible framework for handling un-normalized measures and its robustness properties. In this work, we explore learning (structured) sparse transport plans in the UOT setting, i.e., transport plans have an upper bound on the number of non-sparse entries in each column (structured sparse pattern) or in the whole plan (general sparse pattern). We propose novel sparsity-constrained UOT formulations building on the recently explored maximum mean discrepancy based UOT. We show that the proposed optimization problem is equivalent to the maximization of a weakly submodular function over a uniform matroid or a partition matroid. We develop efficient gradient-based discrete greedy algorithms and provide the corresponding theoretical guarantees. Empirically, we observe that our proposed greedy algorithms select a diverse support set and we illustrate the efficacy of the proposed approach in various applications. © 2024, CC BY.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

EIT image regularization by a new Multi-Objective Simulated Annealing Algorithm

EIT image regularization by a new Multi-Objective Simulated ...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society

作者： Thiago Castro Martins Marcos Sales Guerra Tsuzuki Escola Politécnica da Universidade de S?o Paulo Brazil. Computational Geometry Laboratory

ISBN: (纸本)9781424492695

Multi-Objective optimization can be used to produce regularized Electrical Impedance Tomography (EIT) images where the weight of the regularization term is not known a priori. This paper proposes a novel Multi-Objective optimization algorithm based on Simulated Annealing tailored for EIT image reconstruction. Images are reconstructed from experimental data and compared with images from other Multi and Single Objective optimization methods. A significant performance enhancement from traditional techniques can be inferred from the results.

关键词： EIT regularization term results EIT images optimization algorithms enhancing performance simulated annealing optimization methods

来源：评论

学校读者我要写书评

暂无评论

In-situ re-calibration of implanted pressure sensors

In-situ re-calibration of implanted pressure sensors

引用

IEEE Sensors

作者： Dixon Leung Simon Malpas Daniel McCormick David Budgett Auckland Bioengineering Institute University of Auckland Auckland

ISBN: (纸本)9781509010134

Feasibility of the novel utilization of a pressure switch mechanism for re-calibrating drifted implanted pressure sensors in-situ is demonstrated. We have designed and characterized the pressure response of a system, which can quantify the offset of a sensor after it has been implanted. The benchtop device is constructed of a 25 pm thick titanium diaphragm with 10 mm working diameter. An optimization algorithm detected a characteristic change in the pressure response produced by the activation of a pressure switch. The repeatability of detection across three sensors is within ±0.23 mmHg over 8 pressurization cycles.

关键词： pressure sensor calibration implantable intracranial pressure hydrocephalus long term drift Pressure Sensor Device Component Implants and Prostheses pressure respond Intracranial Pressure Hydrocephalus Calibration Sensors optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Binary sequence design for transmit diversity MIMO radar

Binary sequence design for transmit diversity MIMO radar

引用

IET International Radar Conference 2015

作者： Haiqing Wang Xiaohua Zhu Jindong Zhang College of Electronic Engineering and Optical Technology Nanjing University of Science and Technology Jiangsu China 210094 College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Jiangsu China 210094

ISBN: (纸本)9781510822023

Orthogonal binary sequences play an important role in Multiple-input multiple-output (MIMO) radar. However, mainly due to mathematical difficulties, the synthesis problem of multiple binary sequences with low auto and cross correlation sidelobes is still an open problem. In this paper, mismatched filter, which basically aims at reducing the sidelobe levels at the pulse compression output, is exploited and multiple binary sequences and mismatched filters are optimized by joint synthesis algorithms (JSA), based on an alternating direction method. JSA for minimizing the integrated sidelobe level (ISL) and peak sidelobe level (PSL) metrics are proposed, and the corresponding computation complexities are analyzed. Simulation results show the effectiveness of our proposed algorithms.

关键词： Binary sequence design MIMO radar optimization algorithm MIMO radar optimization algorithms binary sequences side lobe level JOB SAFETY ANALYSIS sidelobe diversity reception

来源：评论

学校读者我要写书评

暂无评论

The Fragility of Optimized Bandit algorithms

arXiv

引用

arXiv 2021年

作者： Fan, Lin Glynn, Peter W. Kellogg School of Management Northwestern University EvanstonIL60208 United States Department of Management Science and Engineering Stanford University StanfordCA94305 United States

Much of the literature on optimal design of bandit algorithms is based on minimization of expected regret. It is well known that algorithms that are optimal over certain exponential families can achieve expected regret that grows logarithmically in the number of trials, at a rate specified by the Lai-Robbins lower bound. In this paper, we show that when one uses such optimized algorithms, the resulting regret distribution necessarily has a very heavy tail, specifically, that of a truncated Cauchy distribution. Furthermore, for p > 1, the p’th moment of the regret distribution grows much faster than poly-logarithmically, in particular as a power of the total number of trials. We show that optimized UCB algorithms are also fragile in an additional sense, namely when the problem is even slightly mis-specified, the regret can grow much faster than the conventional theory suggests. Our arguments are based on standard change-of-measure ideas, and indicate that the most likely way that regret becomes larger than expected is when the optimal arm returns below-average rewards in the first few arm plays, thereby causing the algorithm to believe that the arm is sub-optimal. To alleviate the fragility issues exposed, we show that UCB algorithms can be modified so as to ensure a desired degree of robustness to mis-specification. In doing so, we also show a sharp trade-off between the amount of UCB exploration and the heaviness of the resulting regret distribution tail. Copyright © 2021, The Authors. All rights reserved.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimized 2-Approximation of Treewidth

arXiv

引用

arXiv 2024年

作者： Belbasi, Mahdi Fürer, Martin Kumar, Medha Pennsylvania State University United States

This paper presents a linear FPT algorithm to find a tree decomposition with a 2-approximation of the treewidth with a significantly smaller exponential dependence on the treewidth in the running time than previously ... 详细信息

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

SIMULATION-BASED, OPTIMIZED SCHEDULING OF LIMITED BAR-BENDERS OVER MULTIPLE BUILDING SITES 08

SIMULATION-BASED, OPTIMIZED SCHEDULING OF LIMITED BAR-BENDER...

引用

Winter Simulation Conference (WSC 2008)

作者： Hoi-Ching Lam Ming Lu Hong Kong Polytechnic University Hong Kong China

ISBN: (纸本)9781424427086

In the construction industry, a specialist subcontractor manages a taskforce of single-skilled laborers to work on multiple construction sites, aiming to minimize the total cost and stay profitable and competitive. This paper presents a simulation-based approach to assist the subcontractor in scheduling the application of limited laborer resources to handle jobs over multiple concurring sites. Factoring in technological constraints, repetitive building cycles, alternative method options, and the limited quantity of skilled laborers, we resort to computer power (including simulation and optimization algorithms resulting from recent research) in search of the best combination of construction methods at individual sites along with the optimum size of labor force, aimed to find the least cost for completing the jobs at all sites. A case study of bar-bender scheduling over three sites by use of an in-house computer tool results in the optimum method combinations, the optimum crew size, and the optimum resource schedule.

关键词： Construction methods Buildings Labor Force Laborers optimization algorithms Construction Industry Total Costs Optimum multiple construction sites crew size jobs LIMITED QUANTITY

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL ONLINE CYBERBULLYING DETECTION

OPTIMAL ONLINE CYBERBULLYING DETECTION

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Daphney-Stavroula Zois Angeliki Kapodistria Mengfan Yao Charalampos Chelmis Electrical and Computer Engineering Department Department of Computer Science University at Albany SUNY Albany NY USA

ISBN: (纸本)9781538646595

Cyberbullying has emerged as a serious societal and public health problem that demands accurate methods for the detection of cyberbullying instances in an effort to mitigate the consequences. While techniques to automatically detect cyberbullying incidents have been developed, the scalability and timeliness of existing cyberbullying detection approaches have largely been ignored. We address this gap by formulating cyberbullying detection as a sequential hypothesis testing problem. Based on this formulation, we propose a novel algorithm designed to reduce the time to raise a cyberbullying alert by drastically reducing the number of feature evaluations necessary for a decision to be made. We demonstrate the effectiveness of our approach using a real-world dataset from Twitter, one of the top five networks with the highest percentage of users reporting cyberbullying instances. We show that our approach is highly scalable while not sacrificing accuracy for scalability.

关键词： cyber harassment social media optimization algorithm selection process classification Cyberbullying Social Media Process selection optimization algorithms Scalability

来源：评论

学校读者我要写书评

暂无评论

Norm Approximation for Imperfect Monitors 14

Norm Approximation for Imperfect Monitors

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Natasha Alechina Mehdi Dastani Brian Logan School of Computer Science University of Nottingham Department of Information and Computing Sciences Universiteit Utrecht

ISBN: (纸本)9781634391313

In this paper, we consider the runtime monitoring of norms with imperfect monitors. A monitor is imperfect for a norm if it has insufficient observational capabilities to determine if a given execution trace of a multi-agent system complies with or violates the norm. One approach to the problem of imperfect monitors is to enhance the observational capabilities of the normative organisation. However this may be costly or in some cases impossible. Instead we show how to synthesise an approximation of an 'ideal' norm that can be perfectly monitored given a monitor, and which is optimal in the sense that any other approximation would fail to detect at least as many violations of the ideal norm. We give a logical analysis of (im)perfect monitors. We state the computational complexity of the norm approximation problem, and give an optimal algorithm for generating optimal approximations of norms given a monitor.

关键词： Norms Monitoring MONITOR Imperfect approximation optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Optical Tomography based on a nonlinear model that handles multiple scattering

Optical Tomography based on a nonlinear model that handles m...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Morteza Hasani Shoreh Alexandre Goy JooWon Lim Ulugbek Kamilov Michael Unser Demetri Psaltis Optics Laboratory Ecole Polytechnique Federale de Lausanne (EPFL) Switzerland Mitsubishi Electronic Research Laboratories (MERL) Cambridge MA 02139 USA Biomedical Imaging Group Ecole Polytechnique Federale de Lausanne (EPFL) Switzerland Optics Laboratory Ecole Polytechnique Federale de Lausanne (EPFL Switzerland

ISBN: (纸本)9781509041183

Learning Tomography (LT) is a nonlinear optimization algorithm for computationally imaging three-dimensional (3D) distribution of the refractive index in semi-transparent samples. Since the energy function in LT is generally non-convex, the solution it obtains is not guaranteed to be globally optimal. In this paper, we describe linear and nonlinear tomographic reconstruction methods and compare them numerically. We present a review of the LT and, in addition, we investigate the influence of the initialization and exemplify the effect of regularization on the convergence of the algorithm. In particular, we show that both are essential for high-quality imaging in strongly scattering scenarios.

关键词： Optical tomography digital holography multiple scattering computational imaging nonlinear optimization Optical Tomography digital holography MULTIPLE SCATTERING Level Trigger Nonlinear Models optimization algorithms Reconstruction algorithm Handles initialization broadcasting Scattering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：