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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,291 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

17,627 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,762 篇 电气工程
- 2,981 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,477 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,416 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 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,959 篇 algorithm design...
5,906 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,549 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,980 篇 convergence
3,964 篇 performance anal...
3,643 篇 data mining
3,580 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,987 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
71 篇 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,761 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

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

共 82959 条记录，以下是591-600 订阅

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

详细简洁

排序：

Secure Network Monitoring Using Programmable Data Planes

Secure Network Monitoring Using Programmable Data Planes

引用

IEEE Conference Network Function Virtualization and Software Defined Networks (NFV-SDN)

作者： Pereira, Fabio Neves, Nuno Ramos, Fernando M. V. Univ Lisbon Fac Ciencias LaSIGE Lisbon Portugal

ISBN: (纸本)9781538632857

The accuracy provided by traditional sampling-based monitoring approaches, such as NetFlow, is increasingly being considered insufficient to meet the requirements of today's networks. By summarizing all traffic for specific statistics of interest, sketch-based alternatives have been shown to achieve higher levels of accuracy for the same cost. Existing switches, however, lack the necessary capability to perform the sort of processing required by this approach. The emergence of programmable switches and the processing they enable in the data plane has recently led sketch-based solutions to be made possible in switching hardware. One limitation of existing solutions is that they lack security. At the scale of the datacenter networks that power cloud computing, this limitation becomes a serious concern. For instance, there is evidence of security incidents perpetrated by malicious insiders inside cloud infrastructures. By compromising the monitoring algorithm, such an attacker can render the monitoring process useless, leading to undesirable actions (such as routing sensitive traffic to disallowed locations). In this paper we propose, for the first time, a secure sketch-based monitoring solution that can run in programmable switches. Our algorithm - a secure version of the well-known count-min sketch - was implemented in P4, a programming language for switches. The evaluation of our solution demonstrates the performance penalty introduced by security to be negligible.

关键词： Monitoring Data structures Security algorithm design and analysis Prediction algorithms Estimation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Hybrid Precoding in Millimeter Wave Systems: How Many Phase Shifters Are Needed?

Hybrid Precoding in Millimeter Wave Systems: How Many Phase ...

引用

IEEE Global Telecommunications Conference (GLOBECOM)

作者： Yu, Xianghao Zhang, Jun Letaief, Khaled B. Hong Kong Univ Sci & Technol Dept ECE Hong Kong Hong Kong Peoples R China Hamad Bin Khalifa Univ Doha Qatar

ISBN: (纸本)9781509050192

Hybrid precoding has been recently proposed as a cost-effective transceiver solution for millimeter wave (mm-wave) systems. The analog component in such precoders, which is composed of a phase shifter network, is the key differentiating element in contrast to conventional fully digital precoders. While a large number of phase shifters with unquantized phases are commonly assumed in existing works, in practice the phase shifters should be discretized with a coarse quantization, and their number should be reduced to a minimum due to cost and power consideration. In this paper, we propose a new hybrid precoder implementation using a small number of phase shifters with quantized and fixed phases, i.e., a fixed phase shifter (FPS) implementation, which significantly reduces the cost and hardware complexity. In addition, a dynamic switch network is proposed to enhance the spectral efficiency. Based on the proposed FPS implementation, an effective alternating minimization (AltMin) algorithm is developed with closed-form solutions in each iteration. Simulation results show that the proposed algorithm with the FPS implementation outperforms existing ones. More importantly, it needs much fewer phase shifters than existing hybrid precoder proposals, e.g., similar to 10 fixed phase shifters are sufficient for practically relevant system settings.

关键词： Radio frequency Phase shifters Switches Precoding Antennas algorithm design and analysis Complexity theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Matrix Decomposition Based Threshold Orthogonal Matching Pursuit algorithm for Parameter and Time Delay Identification of MISO-FIR Systems 43

Matrix Decomposition Based Threshold Orthogonal Matching Pur...

引用

43rd Annual Conference of the IEEE-Industrial-Electronics-Society (IECON)

作者： Xu, Huan Liu, Yanjun Jiangnan Univ Sch Internet Things Engn Wuxi 214122 Peoples R China

ISBN: (纸本)9781538611272

This paper focuses on the identification problem of multiple input single output finite impulse response (MISO-FIR) systems with unknown time delays. Using the matrix decomposition, a modified threshold orthogonal matching pursuit (TH-OMP) algorithm is proposed for identifying the parameters and time delays of the MISO-FIR systems from finite sampled data. The modified version of the TH-OMP algorithm can avoid the matrix inversion and eliminate the redundant computation at each iteration. Therefore it is more efficient than the original TH-OMP algorithm. A simulation example is given to demonstrate the effectiveness of the modified TH-OMP algorithm.

关键词： algorithm design and analysis Matching pursuit algorithms Delay effects Computational efficiency Matrix decomposition Computational modeling Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Robust Convergence analysis of Distributed Optimization algorithms 55

Robust Convergence Analysis of Distributed Optimization Algo...

引用

55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Sundararajan, Akhil Hu, Bin Lessard, Laurent Univ Wisconsin Dept Elect & Comp Engn 1415 Johnson Dr Madison WI 53706 USA Univ Wisconsin Wisconsin Inst Discovery Madison WI USA

ISBN: (纸本)9781538632666

We present a unified framework for analyzing the convergence of distributed optimization algorithms by formulating a semidefinite program (SDP) which can be efficiently solved to bound the linear rate of convergence. Two different SDP formulations are considered. First, we formulate an SDP that depends explicitly on the gossip matrix of the network graph. This result provides bounds that depend explicitly on the graph topology, but the SDP dimension scales with the size of the graph. Second, we formulate an SDP that depends implicitly on the gossip matrix via its spectral gap. This result provides coarser bounds, but yields a small SDP that is independent of graph size. Our approach improves upon existing bounds for the algorithms we analyzed, and numerical simulations reveal that our bounds are likely tight. The efficient and automated nature of our analysis makes it a powerful tool for algorithm selection and tuning, and for the discovery of new algorithms as well.

关键词： algorithm design and analysis Convergence Linear matrix inequalities Optimization Symmetric matrices Upper bound Convex functions

来源：评论

学校读者我要写书评

暂无评论

Hardware-Centric Vision Processing for Mobile IoT Environment Exploiting Approximate Graph cut in Resistor Grid 17

Hardware-Centric Vision Processing for Mobile IoT Environmen...

引用

17th IEEE Winter Conference on Applications of Computer Vision (WACV)

作者： Choi, Yeongjae Park, Jun-Seok Kim, Lee-sup Korea Adv Inst Sci & Technol Daejeon South Korea

ISBN: (纸本)9781509048229

The Internet of things (IoT) has become a general trend in the electronic world. In this IoT era, various types of sensors gathering data are placed everywhere, and visual data is one of the most valuable information. While extracting important features from visual images, complex vision algorithms are often processed by high speed computing units like CPU or GPU. However, most IoT devices are mobile, so hardware resources are severely limited, which disturbs usage of the high performance processors in IoT appliances. Therefore, efficient vision computing becomes a crucial concern in this resource poor environment. Graph cut is a popular and widespread algorithm for image segmentation, image denoising, and stereo matching. However, it suffers from inefficient memory access patterns and massive digital computations. Due to the small hardware capacity not enough to overcome these obstacles, it is hardly feasible to run the algorithm in the IoT devices. In this paper, we propose an approximate version of the graph cut with the aid of the dedicated hardware design. By exploiting the analogy between the max flow and electric currents, we design the theoretical model of an approximate max flow solution and suggest the resistor grid as its processing circuit. Because this work utilizes electric potentials for the min cut computation, it is possible to find the cut at a low energy and a high speed. A prototype circuit is designed and simulated for evaluation. Using public GrabCut benchmark, algorithm evaluations are performed. As a result, we can verify a fast and an energy-efficient image processing with an acceptable accuracy. For supervised binary image segmentation, speed efficiency is 4.57 times higher, and energy-efficiency is 9.11 times better when compared to other image/video segmentation works.

关键词： Resistors Hardware Mobile communication Fuses Robots Visualization algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

On Information Spreading in Multiplex Networks with Gossip Mechanism

On Information Spreading in Multiplex Networks with Gossip M...

引用

IEEE International Conference on Communications (ICC)

作者： Huang, Yufan Dai, Huaiyu North Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27695 USA

ISBN: (纸本)9781467389990

In this work, we investigate information spreading in multiplex networks, adopting the gossip (random-walk) based model. Two key features of multiplex networks allow potentially much faster information spreading: availability of multiple channels and communication actions for each user, and more choices on neighbor contacting. As a first work in this area, we explore the impact of layer number, layer similarity, and average node degree on the efficiency of information spreading, and theoretically prove our results. Another observation is that multiplex network structure can improve network connectivity. Simulation results are provided to support and complement theoretical analysis.

关键词： Multiplexing Clocks Pins Nonhomogeneous media Ad hoc networks Simulation algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 56 57 58 59 60 61 62 63 64 65 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：