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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

66 篇 期刊文献
41 篇 会议
3 篇 学位论文
1 册 图书

馆藏范围

111 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

91 篇 工学
- 73 篇 计算机科学与技术...
- 18 篇 电气工程
- 17 篇 软件工程
- 10 篇 控制科学与工程
- 9 篇 信息与通信工程
- 3 篇 机械工程
- 3 篇 电子科学与技术（可...
- 2 篇 力学（可授工学、理...
- 2 篇 材料科学与工程（可...
- 2 篇 土木工程
- 2 篇 生物工程
- 1 篇 动力工程及工程热...
- 1 篇 建筑学
- 1 篇 测绘科学与技术
- 1 篇 地质资源与地质工...
- 1 篇 矿业工程
- 1 篇 石油与天然气工程
- 1 篇 航空宇航科学与技...
44 篇 理学
- 37 篇 数学
- 3 篇 生物学
- 1 篇 物理学
- 1 篇 地理学
- 1 篇 大气科学
- 1 篇 地球物理学
- 1 篇 地质学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
14 篇 管理学
- 12 篇 管理科学与工程(可...
- 2 篇 工商管理
4 篇 医学
1 篇 法学
- 1 篇 法学
1 篇 军事学

主题

111 篇 dynamic algorith...
6 篇 graph algorithm
6 篇 shortest path
4 篇 planar graph
3 篇 graph
3 篇 computational ge...
3 篇 graph theory
3 篇 channel assignme...
3 篇 point location
2 篇 experimentation
2 篇 clustering
2 篇 graph algorithms
2 篇 distributed algo...
2 篇 load balancing
2 篇 delaunay triangu...
2 篇 algorithms
2 篇 core network
2 篇 efficiency
2 篇 l(2,1)-labeling
2 篇 convergence

机构

3 篇 beijing inst tec...
3 篇 brown univ dept ...
2 篇 univ copenhagen ...
2 篇 max planck inst ...
2 篇 univ copenhagen ...
2 篇 rutgers univ new...
2 篇 univ warsaw wars...
2 篇 kings coll londo...
1 篇 univ sci & techn...
1 篇 nanjing universi...
1 篇 adaplab llc
1 篇 univ vienna fac ...
1 篇 univ utah sch me...
1 篇 vellammal engn c...
1 篇 graduate school ...
1 篇 natl univ singap...
1 篇 graz univ igam i...
1 篇 queens univ belf...
1 篇 dalian univ tech...
1 篇 georgia inst tec...

作者

5 篇 tamassia r
4 篇 zaroliagis cd
4 篇 vesel a
3 篇 sankowski piotr
3 篇 frigioni daniele
3 篇 ma zhongjing
3 篇 gutenberg maximi...
3 篇 wulff-nilsen chr...
3 篇 bernstein aaron
2 篇 saha barna
2 篇 lacki jakub
2 篇 klavzar s
2 篇 zou suli
2 篇 pantziou ge
2 篇 van den brand ja...
2 篇 italiano giusepp...
2 篇 chaudhuri s
2 篇 perry john
2 篇 zaroliagis chris...
2 篇 cohen rf

语言

104 篇 英文
6 篇 其他
1 篇 中文

检索条件"主题词=Dynamic Algorithm"

共 111 条记录，以下是91-100 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Improved algorithms for Min Cut and Max Flow in Undirected Planar Graphs 11

Improved Algorithms for Min Cut and Max Flow in Undirected P...

引用

43rd ACM Symposium on Theory of Computing

作者： Italiano, Giuseppe F. Nussbaum, Yahav Sankowski, Piotr Wulff-Nilsen, Christian Univ Roma Tor Vergata Dipartimento Informat Sistemi & Prod Rome Italy

ISBN: (纸本)9781450306911

We study the min st-cut and max st-flow problems in planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph and two vertices s and t computes a min st-cut in O(n log log n) time. Second, we show how to achieve the same bound for the problem of computing a max st-flow in an undirected planar graph. These are the first algorithms breaking the O(n log n) barrier for those two problems, which has been standing for more than 25 years. Third, we present a fully dynamic algorithm maintaining the value of the min st-cuts and the max st-flows in an undirected plane graph (i.e., a planar graph with a fixed embedding): our algorithm is able to insert and delete edges and answer queries for min st-cut/max st-flow values between any pair of vertices s and t in O(n(2/3) log(8/3) n) time per operation. This result is based on a new dynamic shortest path algorithm for planar graphs which may be of independent interest. We remark that this is the first known non-trivial dynamic algorithm for min st-cut and max st-flow.

关键词： Planar graph min cut max flow dynamic algorithm

来源：评论

学校读者我要写书评

暂无评论

Avoiding Doubles in Distributed Nominative Medical Databases: Optimization of the Needleman and Wunsch algorithm

Avoiding Doubles in Distributed Nominative Medical Databases...

引用

19th International Congress of the European-Federation-for-Medical-Informatics

作者： Le Mignot, Loic Mugnier, Claude Ben Said, Mohamed Jais, Jean-Philippe Richard, Jean-Baptiste Le Bihan-Benjamin, Christine Taupin, Pierre Landais, Paul Hop Necker Enfants Malad Serv Biostat & Informat Med EA222 F-75743 Paris 15 France

ISBN: (纸本)9781586035495

Difficulties in reconstituting patients' trajectory in the public health information systems are raised by errors in patients' identification processes. A crucial issue to achieve is avoiding doubles in distributed web databases. We explored Needleman and Wunsch (N&W) algorithm in order to optimize the properties of string matching. Five variants of the N&W algorithm were developed. The algorithms were implemented for a web Multi-Source Information System. This system was dedicated to tracking patients with End-Stage Renal Disease at both regional and national level. A simulated study database of 73,210 records was created. An insertion or suppression of each character of the original string was simulated. The rate of double entries was 2% given cut acceptable distance set to 5 modifications. The search was sensitive and specific with an acceptable detection time. It detected up to 10% of modifications that is above the estimated error rate. A variant of the N&W algorithm designed as "cut-off heuristic", proved to be efficient for the search of double entries occurring in nominative distributed databases.

关键词： dynamic algorithm Alignment Edit distance Pattern matching End- Stage Renal Disease

来源：评论

学校读者我要写书评

暂无评论

Optimizing cloud health Care Data Transmissions using Fog

Optimizing cloud health Care Data Transmissions using Fog

引用

International Conference on Computer Vision and Machine Learning (ICCVML)

作者： Valeti, Nagarjuna Sharmila, V. Ceronmani Sri Harshini Degree & PG Coll Ongole AP India Sir CR Reddy Coll Engn Dept CSE Eluru India

Cloud computing has been dominating enterprise data management solutions for a while now but still requires human-computer interface agents to govern and facilitate services and healthcare domain is no exception. Fog Computing the latest buzz word often considered an extension to Cloud computing enables smart pervasive devices to directly interact with the cloud while simultaneously upholding Quality of Service (QoS) metrics such as performance and security. For smooth transition of communication services in health care computing domain, prior approaches suggested a data collection protocol to support autonomic fogging between medical devices and cloud storages. Although efficient and automated this approach is facing a bottleneck scenario leading to data retransmissions when health data spikes exponentially. To address this problem we propose a dynamic buffering algorithm that ensures the optimized queue and power management scheme within the medical user's device to hold the data in the queue for updating, to prevent queue over flows and thus reducing important health data losses when involved entities are offline. To improve the performance of the proposed system a new sensor technology is adapted to the system. This approach is a first of its kind approach in health care driven fog computing that can offer smooth automated data transitions.

关键词： dynamic algorithm optimized queue IOT

来源：评论

学校读者我要写书评

暂无评论

A Distributed Charging and Discharging Coordination for Large-Population Plug-In Electric Vehicles

A Distributed Charging and Discharging Coordination for Larg...

引用

Chinese Intelligent Systems Conference (CISC)

作者： Li, Huiling Ma, Zhongjing Beijing Inst Technol Sch Automat Beijing 100081 Peoples R China

ISBN: (纸本)9783662483862;9783662483848

Motivated by the economic and environmental benefits of plug-in electric vehicles (PEVs), the PEVs have been regarded as adjustable bilateral auxiliaries for the power grid. They can not only charge from the grid but also discharge back to the grid. This work studies the problems of PEV coordinations, considering the battery degradation cost. We analyze the characteristics of distributed strategy curve and propose an updated algorithm to implement the optimal distributed coordination in the case of the infeasibility of fully centralized formulation. As key contribution of this paper, we show that under certain mild conditions, the system converges to an optimal charging and discharging strategy. Simulation examples illustrate the results developed in the paper.

关键词： Plug-in electric vehicles Charge and discharge Distributed control dynamic algorithm Peak-shift and valley-fill Convergency

来源：评论

学校读者我要写书评

暂无评论

On the Automated Scaling of User Plane Function for 5G: An Experimental Evaluation

On the Automated Scaling of User Plane Function for 5G: An E...

引用

Joint European Conference on Networks and Communications & 6G Summit (EuCNC/6G Summit)

作者： Christakis, Sokratis Makris, Nikos Korakis, Thanasis Fdida, Serge Univ Thessaly Dept Elect & Comp Engn Volos Greece CERTH Ctr Res & Technol Hellas Maroussi Greece Sorbonne Univ Lab LiP6 CNRS Paris France

ISBN: (纸本)9798350344998;9798350345001

The advent of emerging technologies like autonomous vehicles, AR/VR, IoT, smart cities, etc., have raised the bar in terms of dealing with enormous data transfer, high speeds, and low response times. 5G has been designed and is optimized unceasingly to try to meet these demands. The quick evolution of 5G Radio Access Network (RAN) technologies has ushered in a new era of connectivity and communication. This has caused the 5G Core Network to face significant problems, as on many occasions, the RAN's ability to transmit data overwhelms the core network's ability to handle it. As a result, network congestion occurs, leading to reduced network speeds, significant delays, and occasional disruptions, which have a profound effect on low-quality user experience. This issue has triggered the scientific community to investigate ways to enhance the performance of the 5G core network, to match with the evolving demands of RAN technologies. In this work, we present an innovative algorithm for dynamic management and optimization of 5G network resources within a Kubernetes cluster environment. The algorithm's functionality revolves around monitoring metrics of User Plane Function (UPF) and making real-time decisions on deploying multiple UPFs within the cluster to ensure enhanced network performance and cost optimization.

关键词： Kubernetes 5G Network UPF Core Network Scaling dynamic algorithm

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Decremental SSSP in Dense Weighted Digraphs 61

Near-Optimal Decremental SSSP in Dense Weighted Digraphs

引用

61st IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Bernstein, Aaron Gutenberg, Maximilian Probst Wulff-Nilsen, Christian Rutgers Univ New Brunswick Dept Comp Sci New Brunswick NJ 08901 USA Univ Copenhagen Dept Comp Sci Copenhagen Denmark BARC Copenhagen Denmark

ISBN: (纸本)9781728196213

In the decremental Single-Source Shortest Path problem (SSSP), we are given a weighted directed graph G = (V, E, w) undergoing edge deletions and a source vertex r is an element of V;let n = vertical bar V vertical bar, m = vertical bar E vertical bar and W be the aspect ratio of the graph. The goal is to obtain a data structure that maintains shortest paths from r to all vertices in V and can answer distance queries in O(1) time, as well as return the corresponding path P in O(vertical bar P vertical bar) time. This problem was first considered by Even and Shiloach [JACM'81], who provided an algorithm with total update time O(mn) for unweighted undirected graphs;this was later extended to directed weighted graphs [FOCS'95, STOC'99]. There are conditional lower bounds showing that O(mn) is in fact near-optimal [ESA'04, FOCS'14, STOC'15, STOC'20]. In a breakthrough result, Forster et al. showed that total update time min{m(7/6) n(2/3+o(1)), m(3/4) n(5/4+o(1))}polylog(W) = mn(0.9+o(1))polylog(W) is possible if the algorithm is allowed to return (1 + epsilon)-approximate paths, instead of exact ones [STOC'14, ICALP'15]. No further progress was made until Probst Gutenberg and Wulff-Nilsen [SODA'20] provided a new approach for the problem, which yields total time (O) over tilde (min{m(2/3) n(4/3) log W, (mn)(7/8) log W}) = (O) over tilde (min{n(8/3) log W, mn(3/4) log W}). Our result builds on this recent approach, but overcomes its limitations by introducing a significantly more powerful abstraction, as well as a different core subroutine. Our new framework yields a decremental (1 + epsilon)-approximate SSSP data structure with total update time (O) over tilde (n(2) log(4) W/epsilon). Our algorithm is thus near-optimal for dense graphs with polynomial edge-weights. Our framework can also be applied to sparse graphs to obtain total update time (O) over tilde (mn(2/3) log(3) W/epsilon). Combined, these data structures dominate all previous results. Like all previous o(mn)

关键词： dynamic algorithm shortest paths single-source shortest paths generalized topological order

来源：评论

学校读者我要写书评

暂无评论

Query Independent Scholarly Article Ranking 34

Query Independent Scholarly Article Ranking

引用

34th IEEE International Conference on Data Engineering Workshops (ICDEW)

作者： Ma, Shuai Gong, Chen Hu, Renjun Luo, Dongsheng Hu, Chunming Huai, Jinpeng Beihang Univ SKLSDE Lab Beijing Peoples R China Beijing Adv Innovat Ctr Big Data & Brain Comp Beijing Peoples R China

ISBN: (纸本)9781538655207

Ranking query independent scholarly articles is a practical and difficult task, due to the heterogeneous, evolving and dynamic nature of entities involved in scholarly articles. To do this, we first propose a scholarly article ranking model by assembling the importance of involved entities (i.e., articles, venues and authors) such that the importance is a combination of prestige and popularity to capture the evolving nature of entities. To compute the prestige of articles and venues, we propose a novel Time-Weighted PageRank that extends traditional PageRank with a time decaying factor. We then develop a batch algorithm for scholarly article ranking, in which we propose a block-wise method for Time-Weighted PageRank in terms of an analysis of the citation characteristics of scholarly articles. We further develop an incremental algorithm for dynamic scholarly article ranking, which partitions graphs into affected and unaffected areas, and employs different updating strategies for nodes in different areas. Using real-life data, we finally conduct an extensive experimental study, and show that our approach is both effective and efficient for ranking scholarly articles.

关键词： scholarly article ranking query independent time-weighted PageRank block-wise algorithm dynamic algorithm

来源：评论

学校读者我要写书评

暂无评论

Processing Power-based Task Scheduling Technique for Cloud-Fog Environment 17

Processing Power-based Task Scheduling Technique for Cloud-F...

引用

17th Conference on Industrial Electronics and Applications (ICIEA)

作者： Lepcha, Norbu Z. Halgamuge, Malka N. Vel Tech Rangarajan Dr Sagunthala R&D Inst Sci & Comp Sci & Engn Chennai Tamil Nadu India RMIT Univ Dept Informat Syst & Business Analyt Melbourne Vic 3000 Australia

ISBN: (纸本)9781665409841

Internet of Things (IoT) applications have emerged as a critical component in improving people's quality of life. The increasing volume of data generated by IoT devices, on the other hand, places a strain on the resources of traditional cloud data centres. This makes cloud data centres unable to meet the demands of IoT applications. Due to resource constraints and the massive connectivity of IoT devices, efficient task (incoming request) allocation is critical for service providers. We create a novel processing power-based task scheduling technique that employs a broker manager to distribute tasks and the process strategy across multiple devices. This is important in cloud technology because it enables organisations to effectively scale their processes. We use multithreading to parallelize processes and evaluate the performance of the proposed model using existing task allocation algorithms (i) round-robin, (ii) weighted round-robin, (iii) random allocation, (iv) genetic algorithm, and (v) dynamic algorithm. Our results show that when there are few tasks and one cluster has more processing capacity than the others, a weighted round-robin algorithm works well. The effectiveness of allocating based on weight shows no improvement in task completion time as task size increases. Using our proposed model, we show that the dynamic algorithm outperforms all other algorithms for task scheduling by 1.37 times for all task sizes.

关键词： Task Scheduling resource allocation IoT applications dynamic algorithm cloud-fog computing

来源：评论

学校读者我要写书评

暂无评论

Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing 61

Deterministic Decremental Reachability, SCC, and Shortest Pa...

引用

61st IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Bernstein, Aaron Gutenberg, Maximilian Probst Saranurak, Thatchaphol Rutgers Univ New Brunswick Dept Comp Sci New Brunswick NJ 08901 USA Univ Copenhagen Dept Comp Sci Copenhagen Denmark Univ Copenhagen BARC Copenhagen Denmark Toyota Technol Inst Chicago Chicago IL USA

ISBN: (纸本)9781728196213

Let G = (V, E, w) be a weighted, directed graph subject to a sequence of adversarial edge deletions. In the decremental single-source reachability problem (SSR), we are given a fixed source s and the goal is to maintain a data structure that can answer path-queries s (sic) v for any v is an element of V. In the more general single-source shortest paths (SSSP) problem the goal is to return an approximate shortest path to v, and in the SCC problem the goal is to maintain strongly connected components of G and to answer path queries within each component. All of these problems have been very actively studied over the past two decades, but all the fast algorithms are randomized and, more significantly, they can only answer path queries if they assume a weaker model: they assume an oblivious adversary which is not adaptive and must fix the update sequence in advance. This assumption significantly limits the use of these data structures, most notably preventing them from being used as subroutines in static algorithms. All the above problems are notoriously difficult in the adaptive setting. In fact, the state-of-the-art is still the Even and Shiloach tree, which dates back all the way to 1981 [1] and achieves total update time O(mn). We present the first algorithms to break through this barrier. deterministic decremental SSR/SCC with total update time mn(2/3+o(1)) deterministic decremental SSSP with total update time n(2+2/3+o(1)) To achieve these results, we develop two general techniques for working with dynamic graphs. The first generalizes expander-based tools to dynamic directed graphs. While these tools have already proven very successful in undirected graphs, the underlying expander decomposition they rely on does not exist in directed graphs. We thus need to develop an efficient framework for using expanders in directed graphs, as well as overcome several technical challenges in processing directed expanders. We establish several powerful primitives that we hope w

关键词： dynamic algorithm single-source shortest paths single-source reachability strongly-connected components

来源：评论

学校读者我要写书评

暂无评论

Decremental Single-Source Reachability and Strongly Connected Components in (O)over-tilde(m√n) Total Update Time 57

Decremental Single-Source Reachability and Strongly Connecte...

引用

57th IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Chechik, Shiri Hansen, Thomas Dueholm Italiano, Giuseppe F. Lacki, Jakub Parotsidis, Nikos Tel Aviv Univ Tel Aviv Israel Aarhus Univ Aarhus Denmark Univ Roma Tor Vergata Rome Italy Sapienza Univ Rome Rome Italy

ISBN: (纸本)9781509039333

We present randomized algorithms with a total update time of (O) over tilde (m root n) for the problems of decremental single-source reachability and decremental strongly connected components on directed graphs. This improves recent breakthrough results of Henzinger, Krinninger and Nanongkai [STOC 14, ICALP 15]. In addition, our algorithms are arguably simpler.

关键词： dynamic algorithm single-source reachability strongly connected components

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共12页 << < 3 4 5 6 7 8 9 10 11 12 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：