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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

113 篇 会议
94 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

185 篇 工学
- 135 篇 计算机科学与技术...
- 68 篇 电气工程
- 20 篇 信息与通信工程
- 15 篇 软件工程
- 12 篇 控制科学与工程
- 9 篇 电子科学与技术（可...
- 5 篇 仪器科学与技术
- 4 篇 机械工程
- 4 篇 生物工程
- 2 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 测绘科学与技术
- 1 篇 化学工程与技术
- 1 篇 石油与天然气工程
- 1 篇 轻工技术与工程
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 生物医学工程（可授...
64 篇 理学
- 43 篇 数学
- 16 篇 物理学
- 4 篇 生物学
- 4 篇 系统科学
- 2 篇 统计学（可授理学、...
13 篇 管理学
- 13 篇 管理科学与工程(可...
3 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 理论经济学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
- 1 篇 临床医学

主题

207 篇 deterministic al...
17 篇 randomized algor...
15 篇 distributed algo...
13 篇 algorithms
7 篇 optimisation
7 篇 stochastic proce...
6 篇 runtime
6 篇 computational co...
6 篇 deterministic al...
6 篇 deterministic
5 篇 network topology
5 篇 optimization
5 篇 stochastic algor...
5 篇 approximate comp...
4 篇 graph algorithms
4 篇 probability tree...
4 篇 lower bound
4 篇 treasure hunt
4 篇 matroid
4 篇 randomised algor...

机构

4 篇 nanyang technol ...
3 篇 indian inst tech...
3 篇 univ liverpool d...
2 篇 it univ copenhag...
2 篇 tel aviv univers...
2 篇 dhirubhai ambani...
2 篇 university of li...
2 篇 univ granada dep...
2 篇 univ hong kong d...
2 篇 microsoft res re...
2 篇 univ wroclaw wro...
2 篇 cheriton school ...
2 篇 univ politecn va...
2 篇 indian inst tech...
2 篇 computer science...
2 篇 univ granada dep...
2 篇 mit 77 massachus...
2 篇 univ chinese aca...
2 篇 univ salerno dip...
2 篇 indian inst tech...

作者

9 篇 kowalski dariusz...
5 篇 cano andres
5 篇 gomez-olmedo man...
4 篇 moral serafin
4 篇 de marco gianluc...
3 篇 gorain barun
3 篇 jurdzinski tomas...
3 篇 moses william k....
3 篇 ruzic milan
2 篇 moran feldman
2 篇 aaron bernstein
2 篇 pandit supantha
2 篇 lopez pedro
2 篇 bhattacharya adr...
2 篇 mondal kaushik
2 篇 buchbinder niv
2 篇 dimov ivan t.
2 篇 garg mohit
2 篇 gomez crispin
2 篇 feldman moran

语言

201 篇 英文
5 篇 其他
1 篇 荷兰文

检索条件"主题词=Deterministic algorithms"

共 207 条记录，以下是41-50 订阅

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

详细简洁

排序：

Location determination using radio frequency RSSI and deterministic algorithm

Location determination using radio frequency RSSI and determ...

引用

6th Annual Conference on Communication Networks and Services Research

作者： Malekpour, A. Ling, T. C. Lim, W. C. Univ Malaya Fac Comp Sci & Informat Technol Kuala Lumpur 50603 Malaysia

ISBN: (纸本)9780769531359

In recent years, the employment of IEEE 802.11 radio signals for location determination in an indoor environment has drawn great attention. The basis of this technique is that the location of an object is estimated using an estimation algorithm and the radio frequency (RF) fingerprint database as a reference. The main target of this paper is to find an optimum strategy for the construction of the RF map and a decent estimation algorithm. By obtaining statistical data from several signal strength measurements, we investigate and identify three influential factors on the RSSI behavior. With this knowledge, we propose improvement to the existing deterministic algorithm. An algorithm for detection of and dealing with the aliasing problem is also suggested Test results show that our proposed combinational deterministic method and the anti aliasing technique improves the system performance by up to 33% compared to other deterministic method using single scalar values.

关键词： deterministic algorithms estimation antialiasing wireless LAN mobile communication

来源：评论

学校读者我要写书评

暂无评论

deterministic Dispersion of Mobile Robots in Dynamic Rings 18

Deterministic Dispersion of Mobile Robots in Dynamic Rings

引用

19th International Conference on Distributed Computing and Networking (ICDCN)

作者： Agarwalla, Ankush Augustine, John Moses, William K., Jr. Sankar, Madhav K. Sridhar, Arvind Krishna Natl Inst Technol Rourkela Dept Comp Sci & Engn Rourkela Odisha India Indian Inst Technol Madras Dept Comp Sci & Engn Chennai Tamil Nadu India Natl Inst Technol Tiruchirappalli Dept Comp Sci & Engn Tiruchirappalli Tamil Nadu India

ISBN: (纸本)9781450363723

In this work, we study the problem of dispersion of mobile robots on dynamic rings. The problem of dispersion of n robots on an n node graph, introduced by Augustine and Moses Jr. [2], requires robots to coordinate with each other and reach a configuration where exactly one robot is present on each node. This problem has real world applications and applies whenever we want to minimize the total cost of n agents sharing n resources, located at various places, subject to the constraint that cost of an agent moving to a different resource is comparatively much smaller than cost of multiple agents sharing a resource (e.g. smart electric cars sharing recharge stations). Study of this problem also provides indirect benefits to the studies of scattering on graphs, exploration by mobile robots, and load balancing on graphs. We solve the problem of dispersion in presence of two types of dynamism in the underlying graph: (i) vertex permutation and (ii) 1-interval connectivity. We introduce the notion of vertex permutation dynamism and have it mean that for a given set of nodes, in every round, the adversary ensures a ring structure is maintained, but the connections between the nodes may change. We use the idea of 1-interval connectivity from Di Luna et al. [11], where for a given ring, in each round, the adversary chooses at most one edge to remove. We assume robots have full visibility and present asymptotically time optimal algorithms to achieve dispersion in the presence of both types of dynamism when robots have chirality. When robots do not have chirality, we present asymptotically time optimal algorithms to achieve dispersion subject to certain constraints. Finally, we provide impossibility results for dispersion when robots have no visibility.

关键词： Dispersion Load balancing Mobile robots Collective robot exploration Scattering Dynamic graph algorithms Dynamic networks deterministic algorithms Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

deterministic Memory Sharing in Kahn Process Networks: Ultrasound Imaging as a Case Study 12

Deterministic Memory Sharing in Kahn Process Networks: Ultra...

引用

12th IEEE Symposium on Embedded Systems for Real-Time Multimedia (ESTIMedia)

作者： Tretter, Andreas Pandit, Harshavardhan Kumar, Pratyush Thiele, Lothar ETH Comp Engn & Networks Lab CH-8092 Zurich Switzerland

ISBN: (纸本)9781479963072

Kahn process networks are a popular programming model for programming multi-core systems. They ensure determinacy of applications by restricting processes to separate memory regions, only allowing communication over FIFO channels. However, many modern multi-core platforms concentrate on shared memory as a means of communication and data exchange. In this work, we present a concept for deterministic memory sharing in Kahn process networks. It allows to take advantage of shared memory data exchange mechanisms on such platforms while still preserving determinacy. We show how any Kahn process network can be transformed to use deterministic memory sharing by giving a set of transformations that can be applied selectively, only looking at one process at a time. We demonstrate how these techniques can be applied to an ultrasound image reconstruction algorithm. For an implementation on a test system, our technique yields significantly better performance combined with a drastically smaller memory footprint.

关键词： biomedical ultrasonics deterministic algorithms image reconstruction medical image processing multiprocessing systems FIFO channels Kahn process networks deterministic memory sharing multicore system programming ultrasound image reconstruction algorithm Channel capacity Image reconstruction Optimization Recycling Resource management Transducers Ultrasonic imaging image reconstruction Ultrasonography Multiprocessing systems deterministic algorithms biomedical ultrasonics deterministic Medical image processing Memory Sharing Channel capacity Transducers management of resources Recycling shared memory

来源：评论

学校读者我要写书评

暂无评论

deterministic Bisection Search Algorithm for Distributed Sensor/Relay Networks

Deterministic Bisection Search Algorithm for Distributed Sen...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Denis, Juwendo Tseng, Chia-Shiang Lee, Cheng-Wei Tsai, Chia-Yu Lin, Che Natl Tsing Hua Univ Inst Commun Engn Hsinchu Taiwan

ISBN: (纸本)9781467309219;9781467309202

This paper investigates the problem of adaptive distributed beamforming for wireless sensor/relay networks. Existing schemes seek to adaptively achieve distributed phase alignment for beamforming via the help of an error-free, one-bit feedback link from the receiver to all distributed transmitters. Under such setting, we proposed a deterministic Bisection Search Algorithm (DBSA), designed to achieve distributed phase alignment efficiently in a greedy fashion. Extensive simulations demonstrated significant improvement in the convergence time of the proposed DBSA compared with existing schemes. For wireless sensor/relay networks, inherent issues of system uncertainty such as random node addition or removal often occur due to power depletion or requests from new nodes to join the network. To resolve these issues, DBSA was further extended and numerical experiments have shown that the extended version is indeed robust against such system uncertainty.

关键词： array signal processing deterministic algorithms relay networks (telecommunication) transmitters

来源：评论

学校读者我要写书评

暂无评论

Bayesian and deterministic CRBs for Semi-Blind Channel Estimation in SIMO Single Carrier Cyclic Prefix Systems

Bayesian and Deterministic CRBs for Semi-Blind Channel Estim...

引用

22nd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Omar, Samir-Mohamad Slock, Dirk T. M. Bazzi, Oussama Eurecom Mobile Commun Dept BP 193 F-06904 Sophia Antipolis France Lebanese Univ Dept Phys & Elect Fac Sci 1 Beirut Lebanon

ISBN: (纸本)9781457713484

Traditionally, the performance of different semi-blind channel estimation algorithms has been assessed and compared to a certain lower bound. One of these famous lower bounds that has been extensively used in the literature is the Cramer Rao Bound (CRB). Depending on how we treat the symbols and the channel, different versions of CRB have been derived. There are two possible cases on how to treat the symbols and/or the channel namely, deterministic unknowns or random. Moreover, the symbols are either jointly estimated with the channel or eliminated. In other words, we have six different cases to be handled. In this paper we present the CRBs that exist in the literature and fit to some of these cases and derive the others in the context of SIMO single carrier cyclic prefix systems (SCCP). On the top of that we present a unified framework that permits to derive all versions of CRBs in a concrete manner. All the derived CRBs are validated numerically by conducting limited Monte-Carlo simulations.

关键词： Bayes methods Bayesian CRB Bayesian methods Channel estimation Cramer Rao bound Estimation Gold Joints Monte Carlo methods Monte-Carlo simulation SIMO single carrier cyclic prefix system Signal to noise ratio channel estimation deterministic CRB deterministic algorithms semiblind channel estimation wireless channels

来源：评论

学校读者我要写书评

暂无评论

A deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique 2021

A Deterministic Algorithm for the MST Problem in Constant Ro...

引用

53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Nowicki, Krzysztof Univ Copenhagen Copenhagen Denmark Univ Wroclaw Wroclaw Poland

ISBN: (纸本)9781450380539

In this paper we show that the Minimum Spanning Tree problem (MST) can be solved deterministically in O(1) rounds of the Congested Clique model. In the Congested Clique model there are n players that perform computation in synchronous rounds. Each round consist of a phase of local computation and a phase of communication, in which each pair of players is allowed to exchange O(log n) bit messages. The studies of this model began with the MST problem: in the paper by Lotker, Pavlov, Patt-Shamir, and Peleg [SPAA'03, SICOMP'05] that defines the Congested Clique model the authors give a deterministic O(log log n) round algorithm that improved over a trivial O(log n) round adaptation of Boravka's algorithm. There was a sequence of gradual improvements to this result: an O(log log log n) round algorithm by Hegeman, Pandurangan, Pemmaraju, Sardeshmukh, and Scquizzato [PODC'15], an O(log* n) round algorithm by Ghaffari and Parter, [PODC'16] and an O(1) round algorithm by Jurdzinski and Nowicki, [SODA'18], but all those algorithms were randomized. Therefore, the question about the existence of any deterministic o(log log n) round algorithms for the Minimum Spanning Tree problem remains open since the seminal paper by Lotker, Pavlov, Patt-Shamir, and Peleg [SPAA'03, SICOMP'05]. Our result resolves this question and establishes that O(1) rounds is enough to solve the MST problem in the Congested CI iq ue model, even if we are not allowed to use any randomness. Furthermore, the amount of communication needed by the algorithm makes it applicable to a variant of the M PC model using machines with local memory of size O(n).

关键词： Minimum Spanning Tree MST deterministic algorithms Graph algorithms Distributed algorithms Congested Clique Parallel algorithms Massively Parallel algorithms MapReduce

来源：评论

学校读者我要写书评

暂无评论

Good-Case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The deterministic Case 36

Good-Case Early-Stopping Latency of Synchronous Byzantine Re...

引用

36th International Symposium on Distributed Computing, DISC 2022

作者： Albouy, Timothé Frey, Davide Raynal, Michel Taïani, François Univ Rennes Inria CNRS IRISA France

ISBN: (纸本)9783959772556

This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct, and an essential property for practical distributed systems. Although significant strides have been made in recent years on this question, progress has mainly focused on either asynchronous or randomized algorithms. By contrast, the good-case latency of deterministic synchronous BRB under a majority of Byzantine faults has been little studied. In particular, it was not known whether a good-case latency below the worst-case bound of t + 1 rounds could be obtained under a Byzantine majority. In this work, we answer this open question positively and propose a deterministic synchronous Byzantine reliable broadcast that achieves a good-case latency of max(2, t + 3 - c) rounds, where t is the upper bound on the number of Byzantine processes, and c the number of effectively correct processes. © Timothé Albouy, Davide Frey, Michel Raynal, and François Taïani.

关键词： Byzantine Faults deterministic algorithms Good-case latency Reliable Broadcast Synchronous Systems

来源：评论

学校读者我要写书评

暂无评论

deterministic Mincut in Almost-Linear Time 2021

Deterministic Mincut in Almost-Linear Time

引用

53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Li, Jason Carnegie Mellon Univ Pittsburgh PA 15213 USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450380539

We present a deterministic (global) mincut algorithm for weighted, undirected graphs that runs in m(1)(+o(1)) time, answering an open question of Karger from the 1990s. To obtain our result, we derandomize the construction of the skeleton graph in Karger's near-linear time mincut algorithm, which is its only randomized component. In particular, we partially de-randomize the well-known Benczur-Karger graph sparsification technique by random sampling, which we accomplish by the method of pessimistic estimators. Our main technical component is designing an efficient pessimistic estimator to capture the cuts of a graph, which involves harnessing the expander decomposition framework introduced in recent work by Goranci et al. (SODA 2021). As a side-effect, we obtain a structural representation of all approximate mincuts in a graph, which may have future applications.

关键词： minimum cut deterministic algorithms de-randomization graph sparsification

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for the transient analysis of a class of deterministic Stochastic Petri nets

An efficient algorithm for the transient analysis of a class...

引用

International Conference on Dependable Systems and Networks

作者： Gribaudo, M Sereno, M Univ Turin Dipartimento Informat I-10149 Turin Italy

ISBN: (纸本)0769520529

In this paper a new algorithm for the transient solution of a sub-class of deterministic Stochastic Petri Nets (DSPN) is proposed The technique can be applied to DSPNs comprising only deterministic and immediate transitions and such that in each tangible marking only one deterministic transition is enabled The algorithm does not require any additional restriction on the deterministic transition delays that can have any positive real value. Most of the optimized algorithms presented in the literature are based on an efficient solution of the equations governing the stochastic process associated with the DSPN;the new algorithm we propose is based on an efficient combinatorial analysis of the paths within the state space underlying the DSPN, instead.

关键词： Petri nets stochastic processes deterministic algorithms transient analysis deterministic Petri nets stochastic Petri nets combinatorial analysis

来源：评论

学校读者我要写书评

暂无评论

ColorCast: deterministic Broadcast in Powerline Networks with Uncertainties

ColorCast: Deterministic Broadcast in Powerline Networks wit...

引用

2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)

作者： Pignolet, Yvonne Anne Schmid, Stefan Tredan, Gilles ABB Corp Res Baden Switzerland Telekom Innovat Labs Berlin Germany TU Berlin Berlin Germany CNRS LAAS Toulouse France

ISBN: (纸本)9781479949342

This paper initiates the study of broadcast in a powerline communication network, where nodes communicate by local broadcasts in the grid, and where the quality of the communication links is subject to uncertainty. We first show that state-of-the-art broadcast algorithms for known topologies fail to broadcast messages in such a challenging environment, even when the link quality uncertainty is small. We then present a deterministic algorithm COLORCAST that distributes a message to all nodes in the network in time T(n). The algorithm is based on graph coloring and avoids collisions while guaranteeing a high parallelism. In particular, COLORCAST strictly outperforms existing deterministic broadcast algorithms for unknown topologies in the sense that its time complexity is asymptotically lower than the best possible runtime for the unknown setting. Our formal analysis is complemented with a simulation study on real grid topologies, which confirms the benefits of COLORCAST compared to state-of-the-art protocols.

关键词： broadcast communication carrier transmission on power lines deterministic algorithms graph colouring power grids telecommunication network topology COLORCAST communication links deterministic broadcast algorithms graph coloring link quality uncertainty local broadcasts powerline communication network real grid topologies state-of-the-art broadcast algorithms time complexity Network topology Noise level Schedules Smart grids Time complexity Topology Uncertainty colored graph complexity classes carrier transmission on power lines Telecommunication links deterministic algorithms Smart grids telecommunication network topology Power grids Noise levels Network topology Uncertainty topology Broadcast Network Power cables

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：