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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

78,668 篇 会议
4,280 篇 期刊文献

馆藏范围

82,948 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

17,615 篇 工学
- 6,923 篇 计算机科学与技术...
- 6,750 篇 电气工程
- 2,979 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,473 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,415 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 94 篇 材料科学与工程（可...
- 91 篇 动力工程及工程热...
- 83 篇 核科学与技术
- 69 篇 光学工程
1,906 篇 理学
- 955 篇 系统科学
- 515 篇 物理学
- 199 篇 数学
- 153 篇 生物学
- 79 篇 地球物理学
1,750 篇 管理学
- 1,686 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
247 篇 医学
- 180 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
55 篇 教育学
- 54 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

82,948 篇 algorithm design...
5,905 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,547 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,979 篇 convergence
3,963 篇 performance anal...
3,642 篇 data mining
3,579 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,986 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
72 篇 school of comput...
51 篇 department of el...
49 篇 state key labora...
49 篇 school of electr...
46 篇 tsinghua univers...
45 篇 institute for in...
45 篇 school of electr...
44 篇 school of comput...
42 篇 school of comput...
40 篇 school of inform...
38 篇 department of el...
38 篇 department of co...
36 篇 institute of inf...
35 篇 department of co...
35 篇 department of co...
33 篇 department of el...
33 篇 department of el...
32 篇 department of co...

作者

88 篇 lei wang
62 篇 yu wang
57 篇 jun zhang
51 篇 jun wang
43 篇 jian wang
40 篇 bin wang
39 篇 hui wang
37 篇 jing zhang
37 篇 li li
33 篇 wei wang
28 篇 qiang zhou
28 篇 slawomir koziel
27 篇 rui wang
26 篇 xi chen
25 篇 min huang
25 篇 wayne luk
23 篇 jie yang
22 篇 hisao ishibuchi
21 篇 feng liu
21 篇 ming chen

语言

81,750 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm design and analysis"

共 82948 条记录，以下是471-480 订阅

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

详细简洁

排序：

MECCAS: Collaborative Storage algorithm Based on Alternating Direction Method of Multipliers on Mobile Edge Cloud 1

MECCAS: Collaborative Storage Algorithm Based on Alternating...

引用

1st IEEE International Conference on Edge Computing (IEEE EDGE)

作者： Wu, Guanlin Chen, Junjie Bao, Weidong Zhu, Xiaomin Xiao, Wenhua Wang, Ji Liu, Ling Natl Univ Def Technol Coll Informat Syst & Management Changsha 410073 Hunan Peoples R China Georgia Inst Technol Coll Comp Atlanta GA 30332 USA

ISBN: (纸本)9781538620175

The commonly employed centralized algorithms fail to be adaptive to the new storage pattern on mobile edge cloud. To address this issue, we propose an alternating direction-method-of-multipliers-based collaborative storage algorithm named MECCAS Mobile Edge Cloud Collaborative Storage). The proposed MECCAS is able to minimize the delay of task execution and total costs for the overall operation, and meanwhile maximize the utilization of local information of nodes and system reliability. Nodes on mobile edge cloud storage arc capable of adaptively allocating resources for storage to increase power usage effectiveness and reduce the risk of nodes withdrawal. Extensive experiments demonstrate the superiority of our MECCAS algorithm compared with other three baselines, i.e., ADM, RDM and ERASURE. The optimization utility of our algorithm is higher than other three algorithms by 41.72%, 44.52% and 22.94% on average, respectively.

关键词： Mobile communication Cloud computing Collaboration Reliability Memory Bandwidth algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Binary Multi-Verse Optimizer algorithm applied to the Set Covering problem. 4

A Binary Multi-Verse Optimizer Algorithm applied to the Set ...

引用

4th International Conference on Systems and Informatics (ICSAI)

作者： Valenzuela, Matias Pena, Alvaro Lopez, Luis Pinto, Hernan Pontificia Univ Catolica Valparaiso Escuela Ingn Construcc Valparaiso 2362807 Chile

ISBN: (纸本)9781538611074

Many problems addressed in operational research are combinatorial and NP-hard type. Therefore, designing binary algorithms based on swarm intelligence continuous metaheuristics is an area of interest in operational research. In this paper we use a general binarization mechanism based on the percentile concept. We apply the percentile concept to multi-verse optimizer algorithm to solve set covering problem (SCP). Experiments are designed to demonstrate the utility of the percentile concept in binarization. Additionally we verify the efficiency of our algorithm through benchmark instances, showing that Binary multi-verse Optimizer (BMVO) obtains adequate results when it is evaluated against another state of the art algorithm.

关键词： algorithm design and analysis Optimization Mathematical model Silicon compounds Particle swarm optimization Transfer functions Perturbation methods

来源：评论

学校读者我要写书评

暂无评论

Efficient Active Fault Diagnosis Using Adaptive Particle Filter 56

Efficient Active Fault Diagnosis Using Adaptive Particle Fil...

引用

56th Annual IEEE Conference on Decision and Control (CDC)

作者： Skach, Jan Straka, Ondrej Puncochar, Ivo Univ West Bohemia Fac Appl Sci European Ctr Excellence NTIS Univ 8 Plzen 30614 Czech Republic

ISBN: (纸本)9781509028733

This paper presents a solution to a multiple-model based stochastic active fault diagnosis problem over the infinite-time horizon. A general additive detection cost criterion is considered to reflect the objectives. Since the system state is unknown, the design consists of a perfect state information reformulation and optimization problem solution by approximate dynamic programming. An adaptive particle filter state estimation algorithm based on the efficient sample size is proposed to maintain the estimate quality while reducing computational costs. A reduction of information statistics of the state is carried out using non-resampled particles to make the solution feasible. Simulation results illustrate the effectiveness of the proposed design.

关键词： Fault detection Random variables Stochastic processes Monitoring State estimation algorithm design and analysis Fault diagnosis

来源：评论

学校读者我要写书评

暂无评论

Choosing optimal controls for genotyping arrays

Choosing optimal controls for genotyping arrays

引用

IEEE International Conference on Bioinformatics and Biomedicine (IEEE BIBM)

作者： Sigmon, J. Sebastian McMillan, Leonard Univ North Carolina Chapel Hill Dept Comp Sci Chapel Hill NC 27516 USA

ISBN: (纸本)9781509030507

Before genotyping microarrays can be used, calling algorithms must first be calibrated with a control set. Calling algorithms that evaluate hybridization intensity data on the basis of individual markers are better able to compensate for sequence specific variations. However, they require that the control set includes samples sufficient to exercise every marker in all of its allelic states. Minimizing the size of the control set is an important cost-saving measure for the design and production of custom, population-specific microarrays. As the size of the population that the array must discriminate between increases, the naive choice of a control set grows quadratically. We show that a control set that is linear in the population size always exists, but the problem of finding such a linear-sized set grows combinatorially. We examine the problem of finding an optimally-sized control set, in particular for arrays designed to discriminate among an inbred population and their crosses. We derive tight, in the sense of being attainable, lower and upper bounds on the solution size. Further, we show that the problem is equivalent to the set cover problem. We make use of greedy approximate methods to the set cover problem along with our established bounds to create a branch-and-bound framework. We demonstrate our methods on simulated data, available microarrays, and one microarray being developed.

关键词： Strain Sociology Statistics Probes Mice algorithm design and analysis Computer science

来源：评论

学校读者我要写书评

暂无评论

EV-Matching: Bridging Large Visual Data and Electronic Data for Efficient Surveillance 37

EV-Matching: Bridging Large Visual Data and Electronic Data ...

引用

37th IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Li, Gang Yang, Fan Chen, Guoxing Zhai, Qiang Li, Xinfeng Teng, Jin Zhu, Junda Xuan, Dong Chen, Biao Zhao, Wei Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA Univ Macau Taipa Macao Peoples R China

ISBN: (纸本)9781538617915

Visual (V) surveillance systems are extensively deployed and becoming the largest source of big data. On the other hand, electronic (E) data also plays an important role in surveillance and its amount increases explosively with the ubiquity of mobile devices. One of the major problems in surveillance is to determine human objects' identities among different surveillance scenes. Traditional way of processing big V and E datasets separately does not serve the purpose well because V data and E data are imperfect alone for information gathering and retrieval. Matching human objects in the two datasets can merge the good of the two for efficient large-scale surveillance. Yet such matching across two heterogeneous big datasets is challenging. In this paper, we propose an efficient set of parallel algorithms, called EV-Matching, to bridge big E and V data. We match E and V data based on their spatiotemporal correlation. The EV-Matching algorithms are implemented on Apache Spark to further accelerate the whole procedure. We conduct extensive experiments on a large synthetic dataset under different settings. Results demonstrate the feasibility and efficiency of our proposed algorithms.

关键词： Surveillance Visualization Videos algorithm design and analysis Cameras Big Data Sensors

来源：评论

学校读者我要写书评

暂无评论

On Weak Points of the Ellipsoidal Intersection Fusion 13

On Weak Points of the Ellipsoidal Intersection Fusion

引用

IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI)

作者： Ajgl, Jiri Straka, Ondrej Univ West Bohemia European Ctr Excellence New Technol Informat Soc Fac Appl Sci Plzen Czech Republic Univ West Bohemia Dept Cybernet Fac Appl Sci Plzen Czech Republic

ISBN: (纸本)9781509060641

The Ellipsoidal Intersection algorithm aims at fusing two state estimates under a partial knowledge of the cross-correlation of the estimation errors. However, it has been observed that it does not provide an upper bound of all admissible fused mean square error matrices. This paper provides a mathematical tool for an analysis of the fusion under the considered partial knowledge of correlations. The tool facilitates the visualisation of the improvement gained by the partial knowledge and exposes weak points of the Ellipsoidal Intersection fusion. Finally, strictness of the fusion assumption relative to the Covariance Intersection fusion is demonstrated.

关键词： Mean square error methods Correlation Matrix decomposition Upper bound Tools algorithm design and analysis Estimation error

来源：评论

学校读者我要写书评

暂无评论

Supporting analysis of SQL Queries in PHP AiR 17

Supporting Analysis of SQL Queries in PHP AiR

引用

IEEE 17th International Working Conference on Source Code analysis and Manipulation (SCAM)

作者： Anderson, David Hills, Mark East Carolina Univ Greenville NC 27858 USA

ISBN: (纸本)9781538632383

The code behind dynamic webpages often includes calls to database libraries, with queries formed using a combination of static text and values computed at runtime. In this paper, we describe our work on a program analysis for extracting models of database queries that can compactly represent all queries that could be used in a specific database library call. We also describe our work on parsing partial queries, with holes representing parts of the query that are computed dynamically. Implemented in Rascal as part of the PHP AiR framework, the goal of this work is to enable empirical research on database usage in PHP scripts, to support developer tools for understanding existing queries, and to support program transformation tools to evolve existing systems and to improve the security of existing code.

关键词： Databases Libraries Computational modeling Analytical models Runtime Tools algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Fast Routing Graph Extraction from Floor Plans

Fast Routing Graph Extraction from Floor Plans

引用

8th International Conference on Indoor Positioning and Indoor Navigation (IPIN)

作者： Schmitt, Simon Zech, Larissa Wolter, Katinka Willemsen, Thomas Sternberg, Harald Kyas, Marcel Free Univ Berlin Berlin Germany HafenCity Univ Hamburg Germany Reykjavik Univ Reykjavik Iceland

ISBN: (纸本)9781509062997

A routing graph allows to find paths in buildings quickly. Raster images of floor plans are simple to obtain but display poor performance. A manually constructed graph is quite optimal if designed by an informed person, but the process is time consuming and expensive. We describe a fast method to calculate a 2D routing graph from raster images. We adapt image processing techniques and apply a conditional erosion technique. A conditional query of every pixel by means of a predefined 3x 3 image matrix calculates an approximation of common walkways through corridors and rooms. We translate the image processing idea into propositional logic formulas and simplify them. Compared to our previous work, we reduce the run time by about 9 0 % and the amount of needed matrices from 2 9 to eight or even four, depending on the specific application. We also present a parallel version at the cost of redundant edges in the resulting routing graph.

关键词： Kernel Routing Buildings Image processing Estimation algorithm design and analysis Indoor navigation

来源：评论

学校读者我要写书评

暂无评论

Recover Subjective Quality Scores from Noisy Measurements

Recover Subjective Quality Scores from Noisy Measurements

引用

Data Compression Conference (DCC)

作者： Li, Zhi Bampis, Christos G. Netflix 100 Winchester Circle Los Gatos CA 95032 USA Univ Texas Austin Dept ECE Austin TX 78712 USA

ISBN: (纸本)9781509067213

Simple quality metrics such as PSNR are known to not correlate well with subjective quality when tested across a wide spectrum of video content or quality regime. Recently, efforts have been made in designing objective quality metrics trained on subjective data, demonstrating better correlation with video quality perceived by human. Clearly, the accuracy of such a metric heavily depends on the quality of the subjective data that it is trained on. In this paper, we propose a new approach to recover subjective quality scores from noisy raw measurements, by jointly estimating the subjective quality of impaired videos, the bias and consistency of test subjects, and the ambiguity of video contents all together. Compared to previous methods which partially exploit the subjective information, our approach is able to exploit the information in full, yielding better handling of outliers without the need for z-scoring or subject rejection. It also handles missing data more gracefully. Lastly, as side information, it provides interesting insights on the test subjects and video contents.

关键词： Maximum likelihood estimation Noise measurement Optimization algorithm design and analysis Feature extraction Support vector machines

来源：评论

学校读者我要写书评

暂无评论

A 2D Heterogeneous Rendezvous Protocol for Multi-wideband Cognitive Radio Networks

A 2D Heterogeneous Rendezvous Protocol for Multi-wideband Co...

引用

IEEE Conference on Computer Communications (INFOCOM)

作者： Liu, Xingya Xie, Jiang Univ North Carolina Charlotte Dept Elect & Comp Engn Charlotte NC 28223 USA

ISBN: (纸本)9781509053360

Ideally, users in cognitive radio networks (CRNs) are capable of sensing and exploiting any potential transmission opportunities in the available spectrum band ranging from 30 KHz to 300 GHz. With the multiple-diverse-band spectrum, the network can provide more radio resources and capacity to a large number of CR users. However, the multiband scenario (e.g., TV band + 2/3G band + 4/5G band) also introduces significant challenges in channel rendezvous, a fundamental operation for users in CRNs to set up their communication link on a common channel. Existing studies on channel rendezvous suffer from unacceptable long delay and high energy consumption when applied to such scenarios. In this paper, we propose a two-dimensional heterogeneous rendezvous (2D-HR) protocol which can support multi-wideband CRNs (MWB-CRNs) with a significantly reduced rendezvous delay and energy consumption for various rendezvous scenarios, such as the pair-wise rendezvous, any-wise rendezvous, and multi-wise rendezvous. The proposed design also performs better than existing efforts even when dealing with traditional single-band rendezvous. The merits of 2D-HR are proved theoretically and validated against extensive simulations. To the best of our knowledge, this is the first work that addresses heterogeneous rendezvous in MWB-CRNs.

关键词： Delays algorithm design and analysis Wideband Energy consumption Conferences Protocols Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 44 45 46 47 48 49 50 51 52 53 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：