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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

115 篇 期刊文献
113 篇 会议

馆藏范围

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

日期分布

学科分类号

197 篇 工学
- 142 篇 计算机科学与技术...
- 67 篇 电气工程
- 21 篇 信息与通信工程
- 14 篇 控制科学与工程
- 14 篇 软件工程
- 9 篇 电子科学与技术（可...
- 5 篇 机械工程
- 5 篇 仪器科学与技术
- 4 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 1 篇 材料科学与工程（可...
- 1 篇 测绘科学与技术
- 1 篇 矿业工程
- 1 篇 轻工技术与工程
- 1 篇 交通运输工程
82 篇 理学
- 57 篇 数学
- 20 篇 物理学
- 5 篇 系统科学
- 4 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
- 1 篇 地球物理学
- 1 篇 地质学
13 篇 管理学
- 13 篇 管理科学与工程(可...
3 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 理论经济学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学

主题

228 篇 deterministic al...
20 篇 randomized algor...
19 篇 algorithms
15 篇 distributed algo...
8 篇 stochastic proce...
7 篇 lower bound
7 篇 optimisation
7 篇 deterministic
6 篇 runtime
6 篇 computational co...
6 篇 deterministic al...
5 篇 network topology
5 篇 optimization
5 篇 computational mo...
5 篇 stochastic algor...
5 篇 probability
5 篇 stochastic analy...
5 篇 approximate comp...
4 篇 parallel algorit...
4 篇 graph algorithms

机构

3 篇 indian inst tech...
3 篇 univ liverpool d...
3 篇 nanyang technol ...
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

语言

216 篇 英文
11 篇 其他
1 篇 荷兰文

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

共 228 条记录，以下是181-190 订阅

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

详细简洁

排序：

An adaptive threshold algorithm for detection of pulse radar signals

An adaptive threshold algorithm for detection of pulse radar...

引用

2008 IEEE Radar Conference

作者： Carpentieri, Enzo Cuomo, Salvatore MBDA ITALY I-80070 Bacoli Italy

ISBN: (纸本)9781424415380

An adaptive threshold algorithm has been developed in order to achieve a real time waveform reconstruction of IFF radar pulses. In IFF systems, in order to guarantee the receiver selectivity and immunity regarding external interferences, the use of a narrow bandwidth, high order filter is mandatory. This kind of filter introduces an amplitude and phase distortion on received pulses. In order to achieve a correct reconstruction of the received pulses a real time adaptive threshold locked to the pulse amplitude has been developed. Object of the paper is the description of the algorithm and the presentation of the results obtained for detection and reconstruction of IFF (Identification Friends or Foe) pulses.

关键词： Signal detection deterministic algorithms Digital signal processors Filter distortion Field programmable gate arrays Real time systems

来源：评论

学校读者我要写书评

暂无评论

Estimation of blur and noise parameters in remote sensing

Estimation of blur and noise parameters in remote sensing

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Jalobeanu, A Blanc-Féraud, L Zerubia, J INRIA Sophia Antipolis UNSA CNRS Joint Res GrpAriana F-06902 Sophia Antipolis France

ISBN: (纸本)0780374029

In this paper we propose a new algorithm to estimate the parameters of the noise related to the sensor and the impulse response of the optical system, from a blurred and noisy satellite or aerial image. The noise is supposed to be white, Gaussian and stationary. The blurring kernel has a parametric form and is modeled in such a way as to take into account the physics of the system (the atmosphere, the optics and the sensor). The observed scene is described by a fractal model, taking into account the scale invariance properties of natural images. The estimation is performed automatically by maximizing a marginalized likelihood, which is achieved by a deterministic algorithm whose complexity is limited to O(N), where N is the number of pixels.

关键词： remote sensing Gaussian noise computational complexity deterministic algorithms image processing optimisation white noise maximum likelihood estimation blur estimation noise parameters estimation remote sensing sensor impulse response optical system blurred satellite image noisy satellite image blurred aerial image noisy aerial image white noise Gaussian noise stationary. noise blurring kernel system physics atmosphere optics fractal model scale invariance properties natural images marginalized maximum likelihood estimation deterministic algorithm complexity optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Risk-Based Approach for Airlift Task Scheduling Using Stochastic Bin Packing

A Multi-Objective Risk-Based Approach for Airlift Task Sched...

引用

2010 IEEE World Congress on Computational Intelligence

作者： Zhao, Wenjing Liu, Jing Abbass, Hussein A. Bender, Axel Univ New South Wales Australian Def Force Acad Sch Engn & Informat Technol Sydney NSW 2052 Australia Def Sci & Technol Org Canberra ACT Australia

ISBN: (纸本)9781424481262

An important aspect of airlift problems is to find the smallest fleet of aircraft to move cargo from one or more locations to a destination. In critical airlift operations, such as emergency evacuations, disaster relief and defence operations, a compromise needs to be struck between minimizing the time needed for completing all tasks and minimizing the size of the fleet. Usually, the time to complete a task is stochastic. A deterministic model, therefore, will under-estimate fleet size which results in increased levels of risk to achieve the overall airlift mission. In this paper, we introduce a stochastic version of the two-dimensional bin packing problem. We test a number of objective functions to measure different levels of risk. We then use an evolutionary multi-objective algorithm to solve a number of test problems. Analysis demonstrates that the different risk functions and level of variability/uncertainty in performing each task affect solutions non-linearly. Moreover, the multi-objective approach provides the analyst with an estimate of the range of risk;thus solutions can be selected based on criticality of meeting airlift demands.

关键词： aircraft aircraft airlift task scheduling bin packing deterministic algorithms deterministic model freight handling multi-objective risk-based approach objective functions risk analysis scheduling stochastic bin packing stochastic processes two-dimensional bin packing problem

来源：评论

学校读者我要写书评

暂无评论

Approximate inference in Bayesian networks using binary probability trees

Approximate inference in Bayesian networks using binary prob...

引用

10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

作者： Cano, Andres Gomez-Olmedo, Manuel Moral, Serafin Univ Granada Dept Comp Sci & Artificial Intelligence Higher Tech Sch Comp Sci & Telecommun E-18071 Granada Spain

The present paper introduces a new kind of representation for the potentials in a Bayesian network: binary probability trees. They enable the representation of context-specific independences in more detail than probability trees. This enhanced capability leads to more efficient inference algorithms for some types of Bayesian networks. This paper explains the procedure for building a binary probability tree from a given potential, which is similar to the one employed for building standard probability trees. It also offers a way of pruning a binary tree in order to reduce its size. This allows us to obtain exact or approximate results in inference depending on an input threshold. This paper also provides detailed algorithms for performing the basic operations on potentials (restriction, combination and marginalization) directly to binary trees. Finally, some experiments are described where binary trees are used with the variable elimination algorithm to compare the performance with that obtained for standard probability trees. (C) 2010 Elsevier Inc. All rights reserved.

关键词： Bayesian networks inference Approximate computation Variable elimination algorithm deterministic algorithms Probability trees

来源：评论

学校读者我要写书评

暂无评论

Space-Efficient Construction of Compressed Indexes in deterministic Linear Time 17

Space-Efficient Construction of Compressed Indexes in Determ...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： J. Ian Munro Gonzalo Navarro Yakov Nekrich Cheriton School of Computer Science University of Waterloo CeBiB - Center of Biotechnology and Bioengineering Department of Computer Science University of Chile

ISBN: (纸本)9781510836358

We show that the compressed suffix array and the compressed suffix tree of a string T can be built in O(n) deterministic time using O(n log σ) bits of space, where n is the string length and σ is the alphabet size. Previously described deterministic algorithms either run in time that depends on the alphabet size or need ω(n log σ) bits of working space. Our result has immediate applications to other problems, such as yielding the first deterministic linear-time LZ77 and LZ78 parsing algorithms that use O(n log σ) bits.

关键词： deterministic algorithms Workplace Drill bits COMPRESSED deterministic benzoylprop-ethyl Suffix logs logarithm (log) RUN parsing algorithms Cosmic strings Indexes

来源：评论

学校读者我要写书评

暂无评论

deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid 19

Deterministic (1/2 + ε)-Approximation for Submodular Maximi...

引用

Annual ACM-SIAM Symposium on Discrete algorithms

作者： Niv Buchbinder Moran Feldman Mohit Garg Tel Aviv University Israel The Open University of Israel

We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + ε)-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978.

关键词： Submodular optimization Matroid deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Pebble Guided Treasure Hunt in Plane 11th

Pebble Guided Treasure Hunt in Plane

引用

11th International Conference on Networked Systems (NETYS)

作者： Bhattacharya, Adri Gorain, Barun Mandal, Partha Sarathi Indian Inst Technol Guwahati Gauhati India Indian Inst Technol Bhilai Bhilai India

ISBN: (纸本)9783031377648;9783031377655

We study the problem of treasure hunt in a Euclidean plane by a mobile agent with the guidance of pebbles. The initial position of the agent and position of the treasure are modeled as special points in the Euclidean plane. The treasure is situated at a distance at most D > 0 from the initial position of the agent. The agent has a perfect compass, but an adversary controls the speed of the agent. Hence, the agent can not measure how much distance it traveled for a given time. The agent can find the treasure only when it reaches the exact position of the treasure. The cost of the treasure hunt is defined as the total distance traveled by the agent before it finds the treasure. The agent has no prior knowledge of the position of the treasure or the value of D. An Oracle, which knows the treasure's position and the agent's initial location, places some pebbles to guide the agent towards the treasure. Once decided to move along some specified angular direction, the agent can decide to change its direction only when it encounters a pebble or a special point. We ask the following central question in this paper: "For given k >= 0, what is cheapest treasure hunt algorithm if at most k pebbles are placed by the Oracle?" We show that for k = 1, there does not exist any treasure hunt algorithm that finds the treasure with finite cost. We show the existence of an algorithm with cost O(D) for k = 2. For k > 8 we have designed an algorithm that uses k many pebbles to find the treasure with cost O(k(2))+ D(sin theta' + cos theta'), where theta' = pi/2(k-8). The second result shows the existence of an algorithm with cost arbitrarily close to D for sufficiently large values of D.

关键词： Treasure Hunt Mobile agent Pebbles Euclidean plane deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Breaking the O(n~(2.5)) deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow 13

Breaking the O(n~(2.5)) Deterministic Time Barrier for Undir...

引用

Symposium on Discrete algorithms

作者： Ran Duan Max-Planck-Institut für Informatik

ISBN: (纸本)9781627484855

This paper gives the first o(n~(2.5)) deterministic algorithm for the maximum flow problem in any undirected unit-capacity graph with no parallel edges. In an n-vertex, m-edge graph with maximum flow value v, our running time is ?(n~(9/4)v~(1/8)) = ?(n~(2.375)). Note that ν ≤ n for simple unit-capacity graphs. The previous deterministic algorithms [Karger and Levine 1998] achieve O(m + nv~(3/2)) and O(nm~(2/3)υ~(1/6) time bound, which are both O(n~(2.5)) for dense simple graphs and ν = θ (n).

关键词： deterministic Undirected Unit-Capacity Maximum Flow Maximum Flow deterministic Runtime deterministic algorithms chisel edge

来源：评论

学校读者我要写书评

暂无评论

Minimum K-Way Cuts via deterministic Greedy Tree Packing 08

Minimum K-Way Cuts via Deterministic Greedy Tree Packing

引用

ACM Symposium on Theory of Computing

作者： Mikkel Thorup AT&T Labs-Research Shannon Laboratory

ISBN: (纸本)9781605604657

We present a simple and fast deterministic algorithm for the minimum k-way cut problem in a capacitated graph, that is, finding a set of edges with minimum total capacity whose removal splits the graph into at least k components. The algorithm packs O(mk~3 logn) trees. Each new tree is a minimal spanning tree with respect to the edge utili2ations, and the utilization of an edge is the number of times it has been used in previous spanning trees divided by its capacity. We prove that each minimum k-way cut is crossed at most 2k - 2 times by one of the trees. We can enumerate all such cuts in O(n~(2k)) time, which is hence the running time of our algorithm producing all minimum k-way cuts. The previous fastest deterministic algorithm of Kamidoi et al. [SICOMP'06] took 0(n~(4+o(1)k) time, so this is a near-quadratic improvement. Moreover, we essentially match the O{n~(2-o(1)k) running time of the Monto Carlo (no correctness guarantee) randomized algorithm of Karger and Stein [JACM'96].

关键词： Tree packing K-way cuts Runtime edges trees deterministic algorithms Spanning tree minimum cuts greedy method

来源：评论

学校读者我要写书评

暂无评论

Nearly Optimal deterministic Algorithm for Sparse Walsh-Hadamard Transform 16

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hada...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Mahdi Cheraghchi Piotr Indyk Department of Computing Imperial College London MIT Computer Science and Artificial Intelligence Laboratory

ISBN: (纸本)9781510819672

For every fixed constant α > 0, we design an algorithm for computing the k-sparse Walsh-Hadamard transform (i.e., Discrete Fourier Transform over the Boolean cube) of an N-dimensional vector x ∈ R~N in time k~(1+α)(logN)~(O(1)). Specifically, the algorithm is given query access to x and computes a k-sparse ～x ∈ R~N satisfying ‖x - x‖1 ≤ ‖x - H_k(x)‖1, for an absolute constant c > 0, where x is the transform of x and H_k(x) is its best k-sparse approximation. Our algorithm is fully deterministic and only uses non-adaptive queries to x (i.e., all queries are determined and performed in parallel when the algorithm starts). An important technical tool that we use is a construction of nearly optimal and linear lossless condensers which is a careful instantiation of the GUV condenser (Guruswami, Umans, Vadhan, JACM 2009). Moreover, we design a deterministic and non-adaptive l_1/l_1 compressed sensing scheme based on general lossless condensers that is equipped with a fast reconstruction algorithm running in time k~(1+α)(logN)~(O(1)) (for the GUV-based condenser) and is of independent interest. Our scheme significantly simplifies and improves an earlier expander-based construction due to Berinde, Gilbert, Indyk, Karloff, Strauss (Allerton 2008). Our methods use linear lossless condensers in a black box fashion; therefore, any future improvement on explicit constructions of such condensers would immediately translate to improved parameters in our framework (potentially leading to k(logN)~(O(1)) reconstruction time with a reduced exponent in the poly-logarithmic factor, and eliminating the extra parameter α). By allowing the algorithm to use randomness, while still using non-adaptive queries, the running time of the algorithm can be improved to ～O(k log~3 N).

关键词： Condensers mechanical heart valve algorithms Hadamard transform Lossless Transform deterministic algorithms discrete Fourier transform deterministic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共23页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：