Mathematics for Vast Digital Resources

海量数字资源的数学

基本信息

  • 批准号:
    EP/I017127/1
  • 负责人:
  • 金额:
    $ 65.88万
  • 依托单位:
  • 依托单位国家:
    英国
  • 项目类别:
    Research Grant
  • 财政年份:
    2011
  • 资助国家:
    英国
  • 起止时间:
    2011 至 无数据
  • 项目状态:
    已结题

项目摘要

British society, economy and government are becoming digital at staggering speeds. Individuals use the Internet to shop for books, houses and employment, search for information, share resources and group into social networks. Government wants to provide better and faster services to citizens and companies, cut costs and identify tax evaders. Much of business has moved online in the form of digital stores, service portals and targeted advertisements, breaking the physical barrier of distance between parties interested in a particular kind of interchange. Entering a future digital era provides many opportunities which, if seized properly, have a strong potential to boost economic growth and improve the quality of life. Researchers are facing the challenge of developing the tools necessary to make the best use of these opportunities. In this project we will develop new methodologies addressing the challenges and utilizing the opportunities arising from increasing vastness -in size and accessibility -of digital resources . We will analyze mathematical properties of these problems, design novel techniques to exploit their structure, implement them into efficient algorithms, and collaborate with industrial partners and digital economy hubs to ensure impact. Size: Technological breakthroughs in mankind's ability to produce and store huge amounts of data create an unprecedented challenge: a new science is needed for organizing, optimizing and interpreting data coming from new sources like the Internet, commercial databases, scientific experiments and government records. Hospitals, research labs, transportation companies, retailers and businesses produce more raw data than current technology is able to utilize effectively. Moreover, it seems that this trend will continue at an exponential rate. For the problems in this category we will develop new ground-breaking operational research techniques requiring us to reach the depths of several disciplines, merging insights from numerical optimization, machine learning and software development.Accessibility: Due to the vast accessibility of digital resources, portals connecting suppliers of a certain service with potential customers are becoming extremely popular. There are websites specializing in employment (Jobs.ac.uk), housing (Lettingweb.com), as well as contact points facilitating general exchange (Gumtree.com, Craigslist.org). The need to manage the customer portfolios of these portals for optimal user experience uncovers many fundamental mathematical challenges. Since the existing literature does not address these new problems appropriately, a careful study of these systems has the potential to improve user experience substantially. We will construct and analyze mathematical models of such systems using techniques at the interface of modern queueing theory and optimization.In summary, we will develop new operational research techniques which: (i) are capable of dealing with the unprecedented scale of modern digital resources, and (ii) will upgrade the access management to these new resources. Our goal is to gain new mathematical insights into the underlying problems in digital economy and provide the industry and the society with new tools to address these problems appropriately to meet public's expectations over the next decade.
英国社会、经济和政府正在以惊人的速度实现数字化。个人使用互联网购买书籍、房屋和就业机会、搜索信息、共享资源以及加入社交网络。政府希望为公民和公司提供更好、更快的服务、削减成本并识别逃税者。许多业务已以数字商店、服务门户和定向广告的形式转移到网上,打破了对特定类型交换感兴趣的各方之间的物理距离障碍。进入未来的数字时代提供了许多机遇,如果抓住得当,它们具有促进经济增长和改善生活质量的强大潜力。研究人员面临着开发必要工具以充分利用这些机会的挑战。在这个项目中,我们将开发新的方法来应对挑战并利用数字资源规模和可访问性不断增加所带来的机遇。我们将分析这些问题的数学特性,设计新颖的技术来利用其结构,将其实施为有效的算法,并与工业合作伙伴和数字经济中心合作以确保影响。规模:人类产生和存储大量数据的技术突破带来了前所未有的挑战:需要一门新的科学来组织、优化和解释来自互联网、商业数据库、科学实验和政府记录等新来源的数据。医院、研究实验室、运输公司、零售商和企业产生的原始数据多于当前技术能够有效利用的数据。而且,这种趋势似乎将以指数速度持续下去。对于此类问题,我们将开发新的突破性运筹学技术,要求我们深入多个学科,融合数值优化、机器学习和软件开发的见解。 可访问性:由于数字资源的广泛可访问性,连接某种服务的供应商与潜在客户的门户变得非常受欢迎。有专门从事就业(Jobs.ac.uk)、住房(Lettingweb.com)以及促进一般交流的联系点(Gumtree.com、Craigslist.org)的网站。管理这些门户网站的客户组合以获得最佳用户体验的需求揭示了许多基本的数学挑战。由于现有文献没有适当地解决这些新问题,因此对这些系统的仔细研究有可能大大改善用户体验。我们将使用现代排队论和优化接口的技术构建和分析此类系统的数学模型。总之,我们将开发新的运筹学技术:(i)能够处理前所未有的现代数字资源规模,(ii)将升级对这些新资源的访问管理。我们的目标是对数字经济的根本问题获得新的数学见解,并为行业和社会提供新的工具来妥善解决这些问题,以满足公众未来十年的期望。

项目成果

期刊论文数量(10)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
A PRECONDITIONER FOR A PRIMAL-DUAL NEWTON CONJUGATE GRADIENT METHOD FOR COMPRESSED SENSING PROBLEMS
  • DOI:
    10.1137/141002062
  • 发表时间:
    2015-01-01
  • 期刊:
  • 影响因子:
    3.1
  • 作者:
    Dassios, Ioannis;Fountoulakis, Kimon;Gondzio, Jacek
  • 通讯作者:
    Gondzio, Jacek
Fluid and diffusion approximations of probabilistic matching systems
  • DOI:
    10.1007/s11134-017-9516-3
  • 发表时间:
    2017-02
  • 期刊:
  • 影响因子:
    1.2
  • 作者:
    Burak Büke;Hanyi Chen
  • 通讯作者:
    Burak Büke;Hanyi Chen
On the stability of equilibrium for a reformulated foreign trade model of three countries
三个国家重新制定的对外贸易模型的均衡稳定性
Optimal Solutions for Non-consistent Singular Linear Systems of Fractional Nabla Difference Equations
Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent
  • DOI:
    10.1137/16m1085905
  • 发表时间:
    2016-11
  • 期刊:
  • 影响因子:
    0
  • 作者:
    Olivier Fercoq;Peter Richtárik
  • 通讯作者:
    Olivier Fercoq;Peter Richtárik
{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

Jacek Gondzio其他文献

COAP 2004 Best Paper Award
Customized Block Structures in Algebraic Modeling Languages: The Stochastic Programming Case
  • DOI:
    10.1016/s1474-6670(17)40472-1
  • 发表时间:
    1998-06-01
  • 期刊:
  • 影响因子:
  • 作者:
    Emmanue Fragnière;Jacek Gondzio;Robert Sarkissian
  • 通讯作者:
    Robert Sarkissian
On the scalability of truss geometry and topology optimization with global stability constraints via chordal decomposition
  • DOI:
    10.1007/s00158-024-03947-z
  • 发表时间:
    2024-12-24
  • 期刊:
  • 影响因子:
    4.000
  • 作者:
    Alemseged Gebrehiwot Weldeyesus;Jacek Gondzio;Miguel F. Anjos
  • 通讯作者:
    Miguel F. Anjos
Performance of first- and second-order methods for $$\ell _1$$ -regularized least squares problems
A second-order method for strongly convex $$\ell _1$$ -regularization problems
  • DOI:
    10.1007/s10107-015-0875-4
  • 发表时间:
    2015-03-01
  • 期刊:
  • 影响因子:
    2.500
  • 作者:
    Kimon Fountoulakis;Jacek Gondzio
  • 通讯作者:
    Jacek Gondzio

Jacek Gondzio的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('Jacek Gondzio', 18)}}的其他基金

Computational Design Optimization of Large-Scale Building Structures: Methods, Benchmarking & Applications
大型建筑结构的计算设计优化:方法、基准测试
  • 批准号:
    EP/N019652/1
  • 财政年份:
    2016
  • 资助金额:
    $ 65.88万
  • 项目类别:
    Research Grant

相似海外基金

Improvement of methods for searching vast solution spaces of tension-compression mixed form-finding problems of shells.
壳拉压混合找形问题大解空间搜索方法的改进。
  • 批准号:
    23K17784
  • 财政年份:
    2023
  • 资助金额:
    $ 65.88万
  • 项目类别:
    Grant-in-Aid for Challenging Research (Exploratory)
Dissemination and Implementation of a Videoconference Antimicrobial Stewardship Team (VAST)
视频会议抗菌管理团队 (VAST) 的传播和实施
  • 批准号:
    10672768
  • 财政年份:
    2022
  • 资助金额:
    $ 65.88万
  • 项目类别:
Dissemination and Implementation of a Videoconference Antimicrobial Stewardship Team (VAST)
视频会议抗菌管理团队 (VAST) 的传播和实施
  • 批准号:
    10620614
  • 财政年份:
    2022
  • 资助金额:
    $ 65.88万
  • 项目类别:
Enhancing Patient Engagement in the Vascular Contributions to Cognitive Decline Training (VAST) Platform - SPOR Supplement
增强患者对血管对认知衰退训练 (VAST) 平台的参与度 - SPOR 补充资料
  • 批准号:
    463818
  • 财政年份:
    2022
  • 资助金额:
    $ 65.88万
  • 项目类别:
    Directed Grant
Dissemination and Implementation of a Videoconference Antimicrobial Stewardship Team (VAST)
视频会议抗菌管理团队 (VAST) 的传播和实施
  • 批准号:
    10312278
  • 财政年份:
    2022
  • 资助金额:
    $ 65.88万
  • 项目类别:
Collaborative Research: Digitization PEN: BatPEN!—A Partnership to Facilitate Scientific Inquiry into the Vast Functional Trait Diversity of Phyllostomid Bats
合作研究:数字化 PEN:BatPEN!——促进对叶口蝙蝠的广泛功能性状多样性进行科学调查的合作伙伴关系
  • 批准号:
    2101909
  • 财政年份:
    2021
  • 资助金额:
    $ 65.88万
  • 项目类别:
    Standard Grant
VA Aripiprazole vs. Esketamine for Treatment of Depression VAST-D II
VA 阿立哌唑与艾氯胺酮治疗抑郁症 VAST-D II
  • 批准号:
    10426080
  • 财政年份:
    2021
  • 资助金额:
    $ 65.88万
  • 项目类别:
Health Research Training to Address Vascular Contributions to Cognitive Decline: the Vascular Training (VAST) Platform
解决血管导致认知能力下降的健康研究培训:血管培训 (VAST) 平台
  • 批准号:
    458408
  • 财政年份:
    2021
  • 资助金额:
    $ 65.88万
  • 项目类别:
    Operating Grants
Distributed Machine Learning for Automatic Annotation and Analyses of Vast Distributed Image Archives
用于自动注释和分析大量分布式图像档案的分布式机器学习
  • 批准号:
    2599524
  • 财政年份:
    2021
  • 资助金额:
    $ 65.88万
  • 项目类别:
    Studentship
People's dynamic spatial Kaiyu modeling by transforming real-time observation of a vast amount of their micro Kaiyu behavior histories into a real-time database
将实时观察的海量微观开语行为历史转化为实时数据库,进行人的动态空间开语建模
  • 批准号:
    19H01546
  • 财政年份:
    2019
  • 资助金额:
    $ 65.88万
  • 项目类别:
    Grant-in-Aid for Scientific Research (B)
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了