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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
5,059 篇 期刊文献

馆藏范围

83,727 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

18,393 篇 工学
- 7,502 篇 电气工程
- 7,153 篇 计算机科学与技术...
- 3,218 篇 信息与通信工程
- 2,729 篇 控制科学与工程
- 2,562 篇 软件工程
- 1,634 篇 电子科学与技术（可...
- 1,514 篇 仪器科学与技术
- 1,418 篇 机械工程
- 339 篇 航空宇航科学与技...
- 257 篇 生物医学工程（可授...
- 208 篇 交通运输工程
- 202 篇 网络空间安全
- 144 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 90 篇 动力工程及工程热...
- 88 篇 核科学与技术
- 69 篇 光学工程
1,995 篇 理学
- 956 篇 系统科学
- 575 篇 物理学
- 222 篇 数学
- 153 篇 生物学
- 83 篇 地球物理学
1,751 篇 管理学
- 1,687 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
261 篇 医学
- 189 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
60 篇 教育学
- 59 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

83,727 篇 algorithm design...
5,925 篇 clustering algor...
5,326 篇 heuristic algori...
5,293 篇 computer science
5,165 篇 optimization
4,758 篇 signal processin...
4,585 篇 hardware
4,077 篇 genetic algorith...
4,043 篇 performance anal...
4,041 篇 convergence
4,038 篇 computational mo...
3,668 篇 data mining
3,597 篇 mathematical mod...
3,435 篇 testing
3,275 篇 routing
3,012 篇 robustness
3,010 篇 equations
2,994 篇 educational inst...
2,981 篇 partitioning alg...
2,923 篇 delay

机构

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

作者

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

语言

82,448 篇 英文
935 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm Design And Analysis"

共 83727 条记录，以下是611-620 订阅

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

详细简洁

排序：

A Constraint-Pattern Based Method for Reachability Determination 41

A Constraint-Pattern Based Method for Reachability Determina...

引用

41st IEEE Annual Computer Software and Applications Conference (COMPSAC)

作者： Wang, Yuexing Gu, Zuxing Cheng, Xi Zhou, Min Song, Xiaoyu Gu, Ming Sun, Jiaguang Minist Educ Key Lab Informat Syst Secur Beijing Peoples R China Tsinghua Natl Lab Informat Sci & Technol TNList Beijing Peoples R China Tsinghua Univ Sch Software Beijing Peoples R China Portland State Univ Elect & Comp Engn Portland OR 97207 USA

ISBN: (纸本)9781538603673

When analyzing programs using static program analysis, we need to determine the reachability of each possible execution path of the programs. Many static analysis tools collect constraints of each path and use SMT solvers to determine the satisfiability of these constraints. The accumulated computing time can be long if we use SMT solvers too many times. In this paper, we propose a constraint-pattern based method for reachability determination to address the limitation of current approaches. We define some constraint-patterns. For each pattern, a carefully designed constraints solving algorithm is presented. Our method contains two steps. Firstly, we collect some information about the constraints in the program to be analyzed. Then we choose the most suitable algorithm for reachability determination based on the information. Secondly, we apply the algorithm in analysis process to speed up satisfiability checking of path constraints. We implement our method based on CPAchecker, a famous software verification tool. The experimental results on some well-known benchmarks show that, with a moderate accuracy, our method is more efficient in comparison with some state-of-the-art SMT solvers.

关键词： algorithm design and analysis Tools Heuristic algorithms Software Security Software algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

Priority-Based Spectrum Access in Cognitive D2D Networks for IoT

Priority-Based Spectrum Access in Cognitive D2D Networks for...

引用

IEEE International Conference on Communications (ICC)

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

ISBN: (纸本)9781467389990

Device to device (D2D) communication is essential in Internet of things (IoT). Cognitive radio (CR)-enabled device is a promising technique to address D2D communications. Among all the functions supported in IoT, priority-based spectrum access is less investigated yet urgently desired in IoT. An important operation to achieve this capacity is channel hopping (CH) based rendezvous which allows two CR users to meet each other on a common available channel. Unfortunately, existing CH methods cannot help CR users achieve priority-based spectrum access due to various shortcomings. In this paper, we propose PCH, a priority-based spectrum access protocol for cognitive D2D, which can be integrated with any existing CH algorithm. PCH can support priority transmissions with a significantly reduced CH delay, as compared with non-priority transmissions. More importantly, PCH can work under practical scenarios such as the D2D both with priority packets, the D2D handoff, and the overhead/energy constraint IoT. The merits of PCH are proved theoretically and validated against extensive simulations. To the best of our knowledge, this is the first work that investigates priority communications in cognitive IoT.

关键词： Device-to-device communication Delays Cognitive radio Sensors Ad hoc networks algorithm design and analysis Interference

来源：评论

学校读者我要写书评

暂无评论

Semantic Bootstrapping: A Theoretical Perspective 33

Semantic Bootstrapping: A Theoretical Perspective

引用

IEEE 33rd International Conference on Data Engineering (ICDE)

作者： Wu, Wentao Li, Hongsong Wang, Haixun Zhu, Kenny Q. Microsoft Res Redmond WA 98052 USA Alibaba Grp Hangzhou Zhejiang Peoples R China Facebook Inc Menlo Pk CA USA Shanghai Jiao Tong Univ Shanghai Peoples R China

ISBN: (纸本)9781509065431

Knowledge acquisition is an iterative process. Most prior work used syntactic bootstrapping approaches, while semantic bootstrapping was proposed recently. Unlike syntactic bootstrapping, semantic bootstrapping bootstraps directly on knowledge rather than on syntactic patterns, that is, it uses existing knowledge to understand the text and acquire more knowledge. It has been shown that semantic bootstrapping can achieve superb precision while retaining good recall on extracting isA relation. Nonetheless, the working mechanism of semantic bootstrapping remains elusive. In this extended abstract, we present a theoretical analysis as well as an experimental study to provide deeper insights into semantic bootstrapping.

关键词： Semantics Syntactics algorithm design and analysis Pattern matching Conferences Data engineering Facebook

来源：评论

学校读者我要写书评

暂无评论

A Grid-Based Detailed Routing algorithm for Advanced 1D Process 50

A Grid-Based Detailed Routing Algorithm for Advanced 1D Proc...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Zhang, Ye Yang, Fan Zhou, Dian Zeng, Xuan Hu, Xiangdong Fudan Univ Sch Microelect State Key Lab ASIC & Syst Shanghai Peoples R China Shanghai High Performance Integrated Circuit Desi Shanghai Peoples R China Univ Texas Dallas Dept Elect Engn Richardson TX 75083 USA

ISBN: (纸本)9781467368537

End cutting 1D layout process is a promising candidate for sub-10nm process nodes. To be correctly manufactured, any pair of end cuts must be either merged/aligned or apart from each other with at least a minimum distance. This constraint adversely affects the manufacturability, especially when the end cuts have to be solely printed with the conventional lithography technology. To improve the manufacturability, recent works start to consider the constraint in early stages, such as physical design. In this paper, we propose a heuristic grid-based detailed routing algorithm for the end cutting 1D layout process. One important issue of the routing algorithm is how to represent the routing resources, especially for the end cuts. In the proposed algorithm, this issue is addressed by maintaining a directed routing graph. On the routing graph, new end cuts are initially located by a regular shortest path algorithm. Since the routing resources are correctly represented with the routing graph, the new end cuts are not in conflict with the existing end cuts. To further resolve the conflicts among the new end cuts, each segment of the wire is sequentially legalized. Experimental results indicate that compared with an intuitive two-stage method, the proposed algorithm can achieve higher solution quality with much less runtime.

关键词： Routing Metals Wires Layout algorithm design and analysis Pins Lithography

来源：评论

学校读者我要写书评

暂无评论

Segregated Targeting for Resource Allocation Networks with Dedicated Sources 6

Segregated Targeting for Resource Allocation Networks with D...

引用

6th International Symposium on Advanced Control of Industrial Processes (AdCONIP)

作者： Jain, Sheetal Bandyopadhyay, Santanu Indian Inst Technol Dept Energy Sci & Engn Bombay 400076 Maharashtra India

ISBN: (纸本)9781509043972

Segregated targeting problems consist of a set of sources called internal sources and multiple sets of demands called zones. Each zone consists of a set of demands and a unique resource. Internal sources are allocated to different zones such that the total resource requirement for the overall problem is minimized. In this paper, the problem definition is extended to include dedicated sources in each zone. These dedicated internal sources are specific to a zone in which they are present and are not shared with other zones. The primary objective of this paper is to develop an algorithm to determine the minimum resource requirement for the segregated problem with dedicated sources. Using rigorous mathematical arguments, a non-dimensional number is determined that dictates the allocation of an internal source to a zone for overall resource optimality. The applicability of the proposed algorithm is demonstrated through an illustrative example of carbon constrained energy sector planning.

关键词： Minimization Planning Industries Hydrogen algorithm design and analysis Resource management Carbon

来源：评论

学校读者我要写书评

暂无评论

Novel Clique Enumeration Heuristic for Detecting Overlapping Clusters

Novel Clique Enumeration Heuristic for Detecting Overlapping...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Schmitt, Rafael Ramos, Pedro Santiago, Rafael Lamb, Luis Univ Vale Itajai Lab Appl Intelligence Itajai Brazil Univ Fed Rio Grande do Sul Inst Informat Porto Alegre RS Brazil

ISBN: (纸本)9781509046010

There are several known methods for detecting overlapping communities in graphs, each one having their advantages and limitations. The Clique Percolation Method (CPM) is one such method. CPM works by joining highly connected subgraphs (cliques) and using it to find the graph communities. However, the clique enumeration problem is NP-Hard, taking exponential time to be solved. This makes its use impractical in large real-world networks and applications. The aim of this paper is to present an efficient heuristic to enumerate cliques. This enables the Clique Percolation Method to detect overlapping communities in networks containing thousands of nodes. The analyses showed that our novel heuristic is competitive with other known methods regarding solution quality and we also make the CPM more scalable.

关键词： Heuristic algorithms Clustering algorithms Binary trees Electronic mail Context Random access memory algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Backtracking and Dynamic Bit-shield Anti-Collision algorithm in RFID System 2

Backtracking and Dynamic Bit-shield Anti-Collision Algorithm...

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Mo Lei Chen HuaLi Fang MengXu Ren Ju Chengdu Aeronautic Polytechnic The Innovation Base of School-Enterprise Cooperation Aviation Electronic Technology in Sichuan SiChuan TOP IT Vocational Institute

In a radio frequency identification system, The lower identification efficiency problem of system brought by multi tags collision has become the bottleneck problem of the application of RFID technolog

ISBN: (纸本)9781467389808

关键词： Heuristic algorithms Radiofrequency identification algorithm design and analysis Satellite broadcasting Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatically design Distance Functions for Graph-based Semi-Supervised Learning 16

Automatically Design Distance Functions for Graph-based Semi...

引用

16th IEEE International Conference on Trust, Security and Privacy in Computing and Communications / The 11th IEEE International Conference on Big Data Science and Engineering / The 14th IEEE International Conference on Embedded Software and Systems

作者： Miquilini, Patricia Rossi, Rafael G. Quiles, Marcos G. de Melo, Vinicius V. Basgalupp, Marcio P. Univ Fed Sao Paulo Inst Sci & Technol Sao Paulo Brazil Univ Fed Mato Grosso do Sul Campo Grande MS Brazil

ISBN: (纸本)9781509049066

Automatic data classification is often performed by supervised learning algorithms, producing a model to classify new instances. Reflecting that labeled instances are expensive, semi supervised learning (SSL) methods prove to be an alternative to performing data classification, once the learning demands only a few labeled instances. There are many SSL algorithms, and graph-based ones have significant features. In particular, graph-based models grant to identify classes of different distributions without prior knowledge of statistical model parameters. However, a drawback that might influence their classification performance relays on the construction of the graph, which requires the measurement of distances (or similarities) between instances. Since a particular distance function can enhance the performance for some data sets and decrease to others, here, we introduce a novel approach, called GEAD, a Grammatical Evolution for Automatically designing Distance functions for Graph-based semi-supervised learning. We perform extensive experiments with 100 public data sets to assess the performance of our approach, and we compare it with traditional distance functions in the literature. Results show that GEAD is capable of designing distance functions that significantly outperform the baseline manually-designed ones regarding different predictive measures, such as Micro-F-1, and Macro-F-1.

关键词： Semisupervised learning algorithm design and analysis Supervised learning Classification algorithms Euclidean distance Data models

来源：评论

学校读者我要写书评

暂无评论

Unbiased Sparse Subspace Clustering By Selective Pursuit 14

Unbiased Sparse Subspace Clustering By Selective Pursuit

引用

14th Conference on Computer and Robot Vision (CRV)

作者： Ackermann, Hanno Rosenhahn, Bodo Yang, Michael Ying Leibniz Univ Hannover Inst Informat Proc Hannover Germany Univ Twente Scene Understanding Grp Enschede Netherlands

ISBN: (纸本)9781538628188

Sparse subspace clustering (SSC) is an elegant approach for unsupervised segmentation if the data points of each cluster are located in linear subspaces. This model applies, for instance, in motion segmentation if some restrictions on the camera model hold. SSC requires that problems based on the l(1)-norm are solved to infer which points belong to the same subspace. If these unknown subspaces are well-separated this algorithm is guaranteed to succeed. The question how the distribution of points on the same subspace effects their clustering has received less attention. One case has been reported in which points of the same model are erroneously classified to belong to different subspaces. In this work, it will be theoretically shown when and why such spurious clusters occur. This claim is further substantiated by experimental evidence. Two algorithms based on the Dantzig selector and subspace selector are proposed to overcome this problem, and good results are reported.

关键词： Sparse matrices Clustering algorithms Motion segmentation Computer vision Data models algorithm design and analysis Distributed databases

来源：评论

学校读者我要写书评

暂无评论

An L1-Minimization Based algorithm to Measure the Redundancy of State Estimators in Large Sensor Systems 13

An L1-Minimization Based Algorithm to Measure the Redundancy...

引用

13th IEEE Conference on Automation Science and Engineering (IEEE CASE)

作者： Vijayaraghavan, Vishnu Kianfar, Kiavash Ding, Yu Parsaei, Hamid Texas A&M Univ Dept Ind & Syst Engn College Stn TX 77843 USA Texas A&M Univ Qatar Dept Mech Engn POB 23874 Doha Qatar

ISBN: (纸本)9781509067817

Linear models have been successfully used to establish the connections between sensor measurements and system states in sensor networks. Finding the degree of redundancy for structured linear systems is proven to be NP-hard. Previously bound-and-decompose, 0-1 mixed integer programming and hybrid algorithms embedding 0-1 mixed integer feasibility checking within a bound-and-decompose framework have all been proposed and compared in the literature. In this paper, we exploit the computational efficiency of linear programs to present a novel heuristic algorithm which solves a series of l(1)-norm minimization problems in a specific framework to find extremely good solutions to this problem in remarkably small runtime.

关键词： Redundancy Sensor systems algorithm design and analysis Signal processing algorithms Q measurement Sparse matrices Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 58 59 60 61 62 63 64 65 66 67 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：