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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

83 篇 期刊文献
55 篇 会议

馆藏范围

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

日期分布

学科分类号

110 篇 工学
- 64 篇 计算机科学与技术...
- 25 篇 电气工程
- 15 篇 软件工程
- 13 篇 信息与通信工程
- 13 篇 控制科学与工程
- 12 篇 机械工程
- 8 篇 仪器科学与技术
- 5 篇 电子科学与技术（可...
- 5 篇 生物工程
- 4 篇 航空宇航科学与技...
- 3 篇 生物医学工程（可授...
- 2 篇 化学工程与技术
- 1 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 水利工程
- 1 篇 核科学与技术
- 1 篇 食品科学与工程（可...
43 篇 理学
- 30 篇 数学
- 10 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 系统科学
27 篇 管理学
- 24 篇 管理科学与工程(可...
- 4 篇 工商管理
- 3 篇 图书情报与档案管...
5 篇 经济学
- 4 篇 应用经济学
5 篇 农学
- 5 篇 作物学
2 篇 医学
1 篇 教育学
- 1 篇 教育学
1 篇 军事学

主题

138 篇 analysis of algo...
34 篇 algorithms
12 篇 scheduling
11 篇 competitive rati...
7 篇 semi-online
5 篇 analysis
5 篇 computational co...
5 篇 partitioning
4 篇 on-line scheduli...
4 篇 optimization alg...
3 篇 three dimensions
3 篇 stochastic
3 篇 competitive anal...
3 篇 sorting
3 篇 voronoi diagram
3 篇 computational ge...
3 篇 videotapes
3 篇 randomized algor...
3 篇 dataset
3 篇 data structures

机构

8 篇 zhejiang univ de...
2 篇 zhejiang univ st...
2 篇 zhejiang univ de...
2 篇 univ bordeaux 1 ...
2 篇 ens cnrs phys th...
2 篇 rutgers state un...
2 篇 univ chicago jam...
2 篇 department of el...
2 篇 hong kong polyte...
2 篇 zhejiang univ de...
2 篇 univ illinois de...
1 篇 univ sydney dept...
1 篇 univ elect sci &...
1 篇 mit alfred p slo...
1 篇 usaf res lab afr...
1 篇 al azhar univ ma...
1 篇 arizona state un...
1 篇 department of co...
1 篇 member ieee depa...
1 篇 the department o...

作者

10 篇 he y
5 篇 tan zy
4 篇 he yong
3 篇 tan zhiyi
3 篇 何勇
2 篇 yuan jinjiang
2 篇 métivier y
2 篇 monasson r
2 篇 biroli g
2 篇 杨启帆
2 篇 chang rc
2 篇 cheng t. c. e.
2 篇 wong c.k.
2 篇 ng c. t.
2 篇 shioura akiyoshi
2 篇 murota kazuo
2 篇 姚恩瑜
2 篇 cocco s
2 篇 zemmari a
2 篇 saheb n

语言

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

检索条件"主题词=analysis of algorithm"

共 138 条记录，以下是121-130 订阅

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

详细简洁

排序：

Estimating the Time Parameters of a Free-form Radio Pulse with Unknown Initial Phase

Estimating the Time Parameters of a Free-form Radio Pulse wi...

引用

International Conference on Mathematics, Modeling and Simulation Technologies and Applications

作者： Oleg V.Chernoyarov Alexandra V.Salnikova Yury E.Korchagin Alexander A.Makarov National Research University "Moscow Power Engineering Institute" National Research Tomsk State University University of Zilina Voronezh State University

ISBN: (纸本)9781713800361

This paper focuses on synthesis and analysis of the algorithms for estimating the time of appearance and the duration of a narrow-band radio signal with arbitrary-function envelope and unknown initial phase,such algorithms provide overcoming the prior parametric uncertainty in different *** tested performance of quasi-likelihood,maximum likelihood and quasi-optimal estimation *** of our objectives was to find the closed analytical expressions for biases,variances and correlation coefficients of the estimates of time of appearance and duration that their accuracy would increase with signal-tonoise *** also determined the influence of prior ignorance of the initial signal phase on the quality of the introduced estimates of time of appearance and duration of a radio signal.

关键词： Narrow-band radio signal Time of appearance Signal duration Unknown initial phase Quasi-likelihood estimate Maximum likelihood estimate Quasi-optimal reception maximum likelihood estimation signal duration computer time RADIO SIGNALS initial phase Time parameters signal phase analysis of algorithm signal to noise ratios algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed Least Square with Intermittent Communications

Distributed Least Square with Intermittent Communications

引用

American Control Conference

作者： Jing Wang Nicola Elia Dept. of Electrical and Computer engineering Iowa State University Ames IA 50010

ISBN: (纸本)9781457710957

In this paper, we present a distributed algorithm to solve unconstrained distributed Least Squares optimization problems over networks where the communication links could stochastically break. The iterative algorithm allows each node with limited computation and communication capabilities to obtain the optimal solution of the centralized problem. We provide the convergence analysis of the algorithm based on an internal structure decomposition and an application of stochastic systems theory. The results suggests that agents with simple dynamics, one step memory and local gradient information could collectively solve complicated optimization problems in the presence of unreliable communications.

关键词： Least squares method Communication Research Telecommunication links analysis of algorithm Iterative algorithms distributed algorithms Distribute optimal solution Solve stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Faster exponential time algorithms for the shortest vector problem 10

Faster exponential time algorithms for the shortest vector p...

引用

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

作者： Daniele Micciancio Panagiotis Voulgaris University of California

ISBN: (纸本)9780898717013

We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any n-dimensional lattice can be found in time 2~(3.199n) (and space 2~(1.325n)), or in space 2~(1.095n) (and still time 2~O(n)). This improves the best previously known algorithm by Ajtai, Kumar and Sivakumar [Proceedings of STOC 2001] which was shown by Nguyen and Vidick [J. Math. Crypto. 2(2):181{207} to run in time 2~(5.9n) and space 2~(2.95n). We also present a practical variant of our algorithm which provably uses an amount of space proportional to τ_n, the "kissing" constant in dimension n. No upper bound on the running time of our second algorithm is currently known, but experimentally the algorithm seems to perform fairly well in practice, with running time 2~(0.52n), and space complexity 2~(0.2n).

关键词： algorithm analysis Cryptography Shortest Vector Problem Sieving algorithms Software implementations analysis of algorithm cryptography Runtime Exponential time algorithms

来源：评论

学校读者我要写书评

暂无评论

MAPFAST: A Deep algorithm Selector for Multi Agent Path Finding using Shortest Path Embeddings 21

MAPFAST: A Deep Algorithm Selector for Multi Agent Path Find...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Jingyao Ren Vikraman Sathiyanarayanan Eric Ewing Baskin Senbaslar Nora Ayanian University of Southern California

ISBN: (纸本)9781713832621

Solving the Multi-Agent Path Finding (MAPF) problem optimally is known to be NP-Hard for both make-span and total arrival time minimization. While many algorithms have been developed to solve MAPF problems, there is no dominating optimal MAPF algorithm that works well in all types of problems and no standard guidelines for when to use which algorithm. In this work, we develop the deep convolutional network MAPFAST (Multi-Agent Path Finding algorithm SelecTor), which takes a MAPF problem instance and attempts to select the fastest algorithm to use from a portfolio of algorithms. We improve the performance of our model by including single-agent shortest paths in the instance embedding given to our model and by utilizing supplemental loss functions in addition to a classification loss. We evaluate our model on a large and diverse dataset of MAPF instances, showing that it outperforms all individual algorithms in its portfolio as well as the state-of-the-art optimal MAPF algorithm selector. We also provide an analysis of algorithm behavior in our dataset to gain a deeper understanding of optimal MAPF algorithms' strengths and weaknesses to help other researchers leverage different heuristics in algorithm designs.

关键词： Multi-Agent path finding algorithm selection Deep learning algorithms selectors Dataset Nondeterministic polynomial-time hard shortest path FINDINGS BRIEFCASE Byways analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

CRF formulation of active contour population for efficient three-dimensional neurite tracing

CRF formulation of active contour population for efficient t...

引用

IEEE International Symposium on Biomedical Imaging

作者： S. Gulyanon N. Sharifai M. D. Kim A. Chiba G. Tsechpenakis Computer and Information Science Department Purdue University Indianapolis USA Biology Department University of Miami USA Molecular and Cellular Pharmacology Department University of Miami USA

ISBN: (纸本)9781479923519

We present a conditional random field for three-dimensional neurite tracing, using a population of open curve active contours. We aim at increased robustness under spatially varying neurite-background contrast, and at the same time reducing the computational complexity compared to the state-of-the-art. While most existing active contour based methods perform tracing by evolving multiple snakes along the neurite centerline in a sequential manner, our approach implements a simultaneous evolution, reducing the complexity as we show theoretically in our algorithm analysis and experimentally. Our approach provides increased accuracy in ambiguous regions (e.g., low contrast, neurite bifurcations and crossovers, etc.), by exploiting interactions among spatially neighboring snakes. We illustrate the performance of our method and compare it with existing frameworks using sample volumes of wild-type sensory neurons in the larval Drosophila.

关键词： Neurite tracing Drosophila Active contours CRF inference Active contours Drosophila analysis of algorithm Comet Nucleus Tour Neurites tracking

来源：评论

学校读者我要写书评

暂无评论

Robustness of 3D Deep Learning in an Adversarial Setting

Robustness of 3D Deep Learning in an Adversarial Setting

引用

IEEE/CVF Conference on Computer Vision and Pattern Recognition

作者： Matthew Wicker Marta Kwiatkowska University of Oxford

ISBN: (纸本)9781728132945

Understanding the spatial arrangement and nature of real-world objects is of paramount importance to many complex engineering tasks, including autonomous navigation. Deep learning has revolutionized state-of-the-art performance for tasks in 3D environments;however, relatively little is known about the robustness of these approaches in an adversarial setting. The lack of comprehensive analysis makes it difficult to justify deployment of 3D deep learning models in real-world, safety-critical applications. In this work, we develop an algorithm for analysis of pointwise robustness of neural networks that operate on 3D data. We show that current approaches presented for understanding the resilience of state-of-the-art models vastly overestimate their robustness. We then use our algorithm to evaluate an array of state-of-the-art models in order to demonstrate their vulnerability to occlusion attacks. We show that, in the worst case, these networks can be reduced to 0% classification accuracy after the occlusion of at most 6.5% of the occupied input space.

关键词： Robustness Occlusion Religious Missions space layout algorithms comprehensive analysis solidification Three Dimensions Arts deployment Neural network analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

A COMPLETE DISCRIMINATIVE SUBSPACE FOR ROBUST FACE RECOGNITION

A COMPLETE DISCRIMINATIVE SUBSPACE FOR ROBUST FACE RECOGNITI...

引用

IEEE International Conference on Image Processing

作者： Hongwen Huo Lin Gao Jufu Feng China Electronics Standardization Institute Beijing 100007 Key Laboratory of Machine Perception(MOE) EECS Peking University Beijing 100871

ISBN: (纸本)9781479923427

Aimed at the problem that linear discriminative analysis algorithms for face recognition usually miss discriminative information when reducing dimensions, and the problem that it is difficult to make full use of discriminative information both in rank space and null space at the same time, this paper proposes a novel method to construct a new subspace called complete discriminative subspace and its discriminant matrix without losing any discriminative information contained in o-riginal space. The dimension of the new subspace is much lower and the constructing procedure is simple and costless. The experimental results demonstrate that this method has better performance and efficiency than standard discriminative analysis algorithms for face recognition.

关键词： discriminative analysis rank space null space face recognition Facial Recognition Subspace Face analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Electronic Cam Based on Nurbs Interpolation algorithm

Research on Electronic Cam Based on Nurbs Interpolation Algo...

引用

2009 9th International Conference on Electronic Measurement & Instruments(第九届电子测量与仪器国际会议 ICEMI'2009)

作者： Xu Jiazhong Zhang Lei Qiao Ming Automation college Harbin University of Science and Technology Xuefu Road150086 HarbinChina

ISBN: (纸本)9781424438631;9781424438624

This paper discusses the influence of basic mathematical model, knot vector, control point, weight and basis function on the shape of curve. According to the mathematical principle of NURBS curve and using the equal time division interpolation method, a kind of interpolation algorithm based on Non-Uniform Rational B-Spline (NURBS) is applied to electronic cam under the precondition of meeting the design requirements. Meanwhile, combined with the practical, the impact of the constraint conditions including the velocity, the acceleration, the jerk and the chord error on NURBS curve interpolation has been thoroughly discussed. ' And a kind of optimization algorithm has been adopted to solve problems that the algorithm can not satisfy the requirement of the constraint conditions. The analysis of the algorithm and the simulation trial proves that, this algorithm can fit the profile curve accurately by decreasing the downloaded parameter number, and the gliding property of curve is decent when processing complex profile curve.

关键词： Interpolation Arithmetic constraint condition generating curve Camelopardalis Computer aided manufacturing curve interpolation Curves analysis of algorithm basis functions Design Requirements Optimization algorithms algorithms Electronics

来源：评论

学校读者我要写书评

暂无评论

Comparative study on decision tree based data mining algorithm to assess risk of epidemic

Comparative study on decision tree based data mining algorit...

引用

IET Chennai Fourth International Conference on Sustainable Energy and Intelligent Systems (SEISCON 2013)

作者： Arthi Balasundaram P. T. V. Bhuvaneswari Anna University Chennai Chennai Tamil Nadu IN

ISBN: (纸本)9781510804524

Forecasting the dengue fever based on the diagnosis is an important research in order to prevent and control in advance. Such assessment of risk of an epidemic based on the collected information is proposed. An automatic framework is developed for this system based on data mining. This paper present comparison of three reputed decision tree based data mining algorithms such as C4.5, LMT and REPTree for predicting the risk of dengue fever. The presented work is simulated in “weka”, a data mining tool. The performance analysis of the algorithms is compared in terms of success rate and processing time. It is observed that C4.5 out performs other two algorithms.

关键词： Epidemic Assessment Data mining Prediction Decision tree Epidemic data mining Decision Trees Dengue Fever algorithms analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

Profitable Scheduling on Multiple Speed-Scalable Processors 13

Profitable Scheduling on Multiple Speed-Scalable Processors

引用

Annual ACM Symposium on Parallel algorithms and Architectures

作者： Peter Kling Peter Pietrzyk Heinz Nixdorf Institute & Computer Science Department University of Paderborn

ISBN: (纸本)9781450315722

We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors. Moreover, we provide a tight analysis of the algorithm's competitiveness. Our results generalize and improve upon work by Chan et al. [10], which considers a single speed-scalable processor. Using significantly different techniques, we can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for our algorithm. In our scheduling problem, jobs arrive over time and are preemptable. They have different workloads, values, and deadlines. The scheduler may decide not to finish a job but instead to suffer a loss equaling the job's value. However, to process a job's workload until its deadline the scheduler must invest a certain amount of energy. The cost of a schedule is the sum of lost values and invested energy. In order to finish a job the scheduler has to determine which processors to use and set their speeds accordingly. A processor's energy consumption is power P_α(s) integrated over time, where P_α(s) = s~α is the power consumption when running at speed s. Since we consider the online variant of the problem, the scheduler has no knowledge about future jobs. This problem was introduced by Chan et al. [10] for the case of a-single processor. They presented an online algorithm which is α~α + 2eα-competitive. We provide an online algorithm for the case of multiple processors with an improved competitive ratio of α~α.

关键词： scheduling energy online algorithms primal-dual convex programming PROCESSOR convex programming jobs scheduler program Energy sources energy capacity Multiprocessor algorithms analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：