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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是421-430 订阅

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

详细简洁

排序：

Simple CART Based Real-Time Traffic Classification Engine on FPGAs

Simple CART Based Real-Time Traffic Classification Engine on...

引用

International Conference on Reconfigurable Computing and FPGAs (ReConFig)

作者： Soylu, Tuncay Erdem, Oguzhan Carus, Aydin Guner, Edip S. Trakya Univ Elect & Otomat TR-22030 Edirne Turkey Trakya Univ Elect & Elect Engn TR-22030 Edirne Turkey Trakya Univ Comp Engn TR-22030 Edirne Turkey Kirklareli Univ Software Engn TR-39100 Kirklareli Turkey

ISBN: (纸本)9781538637975

Traffic classification is a process which assorts computer network traffic into predefined traffic classes by utilizing packet header information or network packet statistics. Real-time traffic classification is mainly used in network management tasks comprising traffic shaping and flow prioritization as well as in network security applications for intrusion detection. Machine Learning (ML) based traffic classification that exploits statistical characteristics of traffic, has come into prominence recently, due to its ability to cope with encrypted traffic and newly emerging network applications utilizing non-standard ports to circumvent firewalls. To meet high data rates and achieve online classification with ML-based techniques, Field Programmable Gate Arrays (FPGAs) providing abundant parallelism and high operating frequency is the most appropriate platform. In this paper, we propose to use Simple Classification and Regression Trees (Simple CART) machine learning algorithm for traffic classification. However, the variations in node sizes of Simple CART decision tree caused by discretization pre-process incur memory and resource inefficiency problems when the tree is directly mapped onto the hardware. To resolve these problems, we propose to represent Simple CART decision tree by two stage hybrid data structure (Extended-Simple CART) that comprises multiple range trees in Stage 1 and a Simple CART decision tree enriched with bitmaps at its nodes in Stage 2. Our design is implemented on parallel and pipelined architectures using Field Programmable Gate Arrays (FPGAs) to acquire high throughput. Extended-Simple CART architecture can sustain 557 Gbps or 1741 million classification per second (MCPS) (for the minimum packet size of 40 Bytes) on a state-of-the-art FPGA and achieve an accuracy of 96.8% while classifying an internet traffic trace including eight application classes.

关键词： Decision trees Ports (Computers) Field programmable gate arrays Niobium Throughput algorithm design and analysis Machine learning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Wait-Before-Starting algorithm for Fast, Fault-Tolerant and Low Energy Leader Election in WSNs dedicated to Smart-cities and IoT 16

A Wait-Before-Starting Algorithm for Fast, Fault-Tolerant an...

引用

16th IEEE SENSORS CONFERENCE

作者： Bounceur, Ahcene Bezoui, Madani Euler, Reinhardt Lalem, Farid Univ Bretagne Occidentale Lab STICC CNRS UMR 6285 Brest France Univ Boumerdes Dept Math Boumerdes Algeria

ISBN: (纸本)9781509010127

Many of the existing Leader Election algorithms don't deal with energy consumption and fault tolerance since they are not mainly dedicated to autonomous systems like wireless sensor and IoT networks. It is possible to use the classical Minimum Finding (MinFind) algorithm, where each node sends its value in a broadcast mode each time a better value is received. This process is very energy consuming and not realistic since it may be subject to an important number of collisions. In this paper, we propose a new algorithm called WBS (Wait-Before-Starting), which is fault tolerant and where each node in the network will wait for a certain time before starting the execution of its program. This time lapse depends on the node's value so that the leader will be the one which will wait the least. In this case, the leader will be the first one which will start by sending a message to all the nodes of the network to inform them that it is the leader. Then, the other nodes will start the execution of their programs. Otherwise, if the leader fails, another node will do the same. The obtained results show that the proposed algorithm reduces the energy consumption with rates that can exceed 96% compared with the classical MinFind algorithm.

关键词： Voting Wireless sensor networks Fault tolerance Fault tolerant systems Energy consumption Heuristic algorithms algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Adaptive Walk Detection algorithm using Activity Counts 4

Adaptive Walk Detection Algorithm using Activity Counts

引用

4th IEEE EMBS International Conference on Biomedical and Health Informatics (BHI)

作者： Kheirkhahan, Matin Chen, Zhiguo Corbett, Duane B. Wanigatunga, Amal A. Manini, Todd M. Ranka, Sanjay Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32601 USA Univ Florida Dept Aging & Geriatr Res Gainesville FL 32601 USA

ISBN: (纸本)9781509041794

Accelerometers have been the dominant device used for physical activity assessment studies. They are comfortable to wear at different locations and can accurately measure acceleration. Although, accurate methods for detecting walking in the lab and free-living condition using raw acceleration data exist, these algorithms are not useful for determining indoor movements that correspond to short walking bouts (<= 2 minutes). In this paper, we present a new method that is adaptive to a small window of activity count data (10-15 seconds) and robust to within and between subject variability. The adaptive walking detection algorithm is evaluated using 22 adults and walks with a variety of durations ranging from 10 seconds to 8 minutes. The proposed algorithm showed high accuracy for all the walking periods and was significantly better for intervals shorter than 2 minutes.

关键词： Legged locomotion Accelerometers Detection algorithms Prediction algorithms Acceleration algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Multi-Layer Adversarial Network design for the IoT-Enabled Infrastructures

Heterogeneous Multi-Layer Adversarial Network Design for the...

引用

IEEE Global Telecommunications Conference (GLOBECOM)

作者： Chen, Juntao Touati, Corinne Zhu, Quanyan NYU Tandon Sch Engn Dept Elect & Comp Engn Brooklyn NY 11201 USA INRIA F-38330 Montbonnot St Martin France

ISBN: (纸本)9781509050192

Internet of Things (IoT)-enabled infrastructures have naturally a multi-layer system architecture with an overlaid or underlaid device network and its coexisting infrastructure network. The connectivity between different components in these two heterogeneous networks plays an important role in ensuring a high-level situational awareness. However, IoT-enabled infrastructures face cyber threats due to the wireless nature of communications. Therefore, maintaining the network connectivity in the presence of adversaries is a critical task for the infrastructure network operators. In this paper, we establish a three-player three-stage game-theoretic framework including two network operators and one attacker to capture the secure design of multi-layer infrastructure networks by allocating limited resources. We use subgame perfect Nash equilibrium (SPE) to characterize the strategies of players with sequential moves. In addition, we assess the efficiency of the equilibrium network by comparing with its team optimal solution counterparts in which two network operators can coordinate. We further design a scalable algorithm to guide the construction of the equilibrium IoT-enabled infrastructure networks. Finally, we use case studies on the emerging paradigm of Internet of Battlefield Things (IoBT) to corroborate the obtained results.

关键词： Games Nash equilibrium Communication system security Wireless communication Internet Electronic mail algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Dynamic Bitwidth Assignment for Efficient Dot Products 27

Dynamic Bitwidth Assignment for Efficient Dot Products

引用

27th International Conference on Field Programmable Logic and Applications (FPL)

作者： Schmidt, Simon Joel Boland, David Monash Univ Dept Elect & Comp Syst Engn Clayton Vic Australia Univ Sydney Sch Elect & Informat Engn Sydney NSW Australia

ISBN: (纸本)9789090304281

The benefits of customising the precision throughout an FPGA design according to a design tolerance are well known. However, customising the precision of a design at run-time has the potential for an even greater performance impact. In this paper, we add the ability to dynamically choose the internal precision of a datapath. This enables a result that is at least as accurate as the worst-case under standard precisions, whilst internally operating at a lower precision. We demonstrate this technique on fused floating-point dot-product circuits. We show that for circuits with inputs that have a wide dynamic range, we can see substantial resource savings. We provide examples with savings of up to 75% of the DSPs and 16% of the ALMs over an optimised fused dot-product design.

关键词： Multiplexing Random access memory algorithm design and analysis Adders Clocks Field programmable gate arrays Hardware

来源：评论

学校读者我要写书评

暂无评论

Enhanced Firefly algorithm for Constrained Numerical Optimization

Enhanced Firefly Algorithm for Constrained Numerical Optimiz...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Strumberger, Ivana Bacanin, Nebojsa Tuba, Milan John Naisbitt Univ Grad Sch Comp Sci Belgrade Serbia State Univ Novi Pazar Dept Tech Sci Novi Pazar Serbia

ISBN: (纸本)9781509046010

Firefly algorithm is one of the recent and very promising swarm intelligence metaheuristics for tackling hard optimization problems. While firefly algorithm has been proven on various numerical and engineering optimization problems as a robust metaheuristic, it was not properly tested on a wide set of constrained benchmark functions. We performed testing of the original firefly algorithm on a set of standard 13 benchmark functions for constrained problems and it exhibited certain deficiencies, primarily insufficient exploration during early stage of the search. In this paper we propose enhanced firefly algorithm where main improvements are correlated to the hybridization with the exploration mechanism from another swarm intelligence algorithm, introduction of new exploitation mechanism and parameter-based tuning of the exploration-exploitation balance. We tested our approach on the same standard benchmark functions and showed that it not only overcame weaknesses of the original firefly algorithm, but also outperformed other state-of-the-art swarm intelligence algorithms.

关键词： Optimization Benchmark testing algorithm design and analysis Particle swarm optimization Robustness Standards

来源：评论

学校读者我要写书评

暂无评论

Service Placement in Complex Active Networks 26

Service Placement in Complex Active Networks

引用

26th International Conference on Computer Communication and Networks (ICCCN)

作者： Ibn-Khedher, Hatem Afifi, Hossam Kamal, Ahmed E. Telecom SudParis Inst Mines Telecom IMT Saclay France Iowa State Univ Dept Elect Comp Engn Ames IA 50011 USA

ISBN: (纸本)9781509029914

The Information-Centric Network (ICN) is very promising in the area of Complex Active Networks (CANs), where the data-centric approach is useful in reducing the data retrieval latency as well as the network traffic of active networking services. Also, the in-network caching and processing capabilities in ICN limits the massive data access to the data producers and so relaxes the need of continuous E2E connectivity between data producers and data consumers. In this paper, we present an ICN-based architecture in which ICN nodes provide processing/treatment capabilities and caching functions. Service placement algorithms (OPPA and HPPA) in CANs are proposed to choose optimal and near-optimal placement location for ICN nodes. We evaluated the algorithms with respect to several performance metrics and the obtained results show improvement in services consumption latency and network load. Furthermore, we propose a caching strategy that shows to stabilize the network load despite any increase in the number of consumer interests.

关键词： Heuristic algorithms Optimization algorithm design and analysis Complexity theory Servers Planning Complex networks

来源：评论

学校读者我要写书评

暂无评论

FPGA design of Low-Complexity Joint Channel Estimation and Data Detection for Large SIMO Wireless Systems 50

FPGA Design of Low-Complexity Joint Channel Estimation and D...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Castaneda, Oscar Goldstein, Tom Studer, Christoph Cornell Univ Sch ECE Ithaca NY 14850 USA Univ Maryland Dept CS College Pk MD 20742 USA

ISBN: (纸本)9781467368537

Joint channel estimation and data detection (JED) enables near-optimal error-rate performance in realistic wireless communication systems that suffer from channel estimation errors. In this paper, we propose a new JED algorithm and a corresponding FPGA design for large single-input multiple-output (SIMO) wireless systems that use constant-modulus constellations. Our algorithm, referred to as PrOX (short for PRojection Onto conveX hull), relies on biconvex relaxation (BCR) in order to efficiently compute an approximate solution of the maximum-likelihood JED problem that exhibits prohibitive complexity. PrOX is a simple and hardware-friendly algorithm that achieves near-optimal error-rate performance for a wide-range of system configurations. To demonstrate the efficacy of PrOX, we develop a scalable VLSI architecture and present reference implementation results on a Xilinx Virtex-7 FPGA. Compared to a recently-reported reference JED design, PrOX achieves 3xhigher throughput, 20xbetter hardware-efficiency (in terms of throughput per look-up tables), and 8ximproved energy-efficiency.

关键词： Wireless communication algorithm design and analysis Computer architecture Complexity theory Channel estimation Approximation algorithms Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

Joint Pilot Allocation and Robust Beam-vector design for Ultra-Dense TDD C-RAN

Joint Pilot Allocation and Robust Beam-vector Design for Ult...

引用

IEEE Global Telecommunications Conference (GLOBECOM)

作者： Pan, Cunhua Mehrpouyan, Hani Liu, Yuanwei Elkashlan, Maged Nallanathan, Arumugam Queen Mary Univ London London England Boise State Univ Boise ID 83725 USA Kings Coll London London England

ISBN: (纸本)9781509050192

This paper deals with the unavailability of full CSI in ultra-dense user-centric TDD C-RAN. To reduce the channel training overhead, we consider the incomplete CSI case, where only large-scale inter-cluster CSI is available. Channel estimation for intra-cluster CSI is also considered, where we formulate a joint pilot allocation and user equipment (UE) selection problem to maximize the number of admitted UEs with fixed number of pilots. A novel pilot allocation algorithm is proposed by considering the multi-UE pilot interference. Then, we consider robust beam-vector optimization problem subject to UEs' data rate requirements and fronthaul capacity constraints, where the channel estimation error and incomplete inter-cluster CSI are considered. Simulation results demonstrate its superiority over the existing algorithms.

关键词： Resource management Channel estimation Training Contamination Interference algorithm design and analysis Robustness

来源：评论

学校读者我要写书评

暂无评论

Fast algorithm for Suppressing Sidelobes at Specified Intervals

Fast Algorithm for Suppressing Sidelobes at Specified Interv...

引用

Progress in Electromagnetics Research Symposium - Spring (PIERS)

作者： Tang, Liang Zhu, Yongfeng Fu, Qiang Natl Univ Def Technol Changsha Hunan Peoples R China

ISBN: (纸本)9781509062690

Sequences with good correlation property have a great deal of applications in both military and civil fields. A fast algorithm for minimizing the weighted integrated sidelobe level (WISL) is developed based on the gradient algorithm. Unlike the existing gradient-based algorithm for this problem, the step size of the proposed algorithm is obtained by solving a cubic equation, rather than by the time consuming linear search method. Since the gradient and step size of the algorithm can be calculated via the fast Fourier transform (FFT) operations, the whole algorithm is computationally efficient. Numerical experiments show that the proposed algorithm has better performance than the state-of-the-art algorithm.

关键词： Correlation algorithm design and analysis Electromagnetics Springs Radar Measurement Discrete Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 39 40 41 42 43 44 45 46 47 48 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：