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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

17,626 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,761 篇 电气工程
- 2,980 篇 信息与通信工程
- 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,958 篇 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,760 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

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

共 82958 条记录，以下是791-800 订阅

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

详细简洁

排序：

Anomaly Detection in Large Databases using Behavioral Patterning 33

Anomaly Detection in Large Databases using Behavioral Patter...

引用

IEEE 33rd International Conference on Data Engineering (ICDE)

作者： Mazzawi, Hanna Dalal, Gal Rozenblat, David Ein-Dor, Liat Ninio, Matan Lavi, Ofer Adir, Allon Aharoni, Ehud Kermany, Einat Google Mountain View CA 94043 USA Technion Israel Inst Technol Haifa Israel IBM Software Grp Armonk NY USA IBM Res Yorktown Hts NY USA

ISBN: (纸本)9781509065431

We present a novel approach for detecting malicious user activity in databases. Specifically, we propose a new machine learning algorithm for detecting attacks such as a stolen user account or illegal use by a user. Our algorithm relies on two main components that examine the consistency of a user's activity and compare it with activity patterns learned from past access. The first component tests for self-consistency, to determine whether the actions performed by a user are consistent with previous patterns. This engine is based on a probabilistic model that we developed to capture a user's normal behavior. The second component checks for global-consistency, to determine whether a user's actions are consistent with the past actions of similar users. We test our algorithm on access data from SQL databases. Experimental results show that we can keep false positive rates while retaining the overall accuracy level. An outlier detection engine based on the presented methods is now included in the standard offering of IBM InfoSphere Guardium(1) with positive user feedback.

关键词： Databases Security Data models algorithm design and analysis Context Companies Servers

来源：评论

学校读者我要写书评

暂无评论

STOP STATE CLASSIFICATION IN INTRACORTICAL BRAIN-MACHINE-INTERFACE 39

STOP STATE CLASSIFICATION IN INTRACORTICAL BRAIN-MACHINE-INT...

引用

39th Annual International Conference of the IEEE-Engineering-in-Medicine-and-Biology-Society (EMBC)

作者： Koh, Tze Hui Libedinsky, Camilo Guan, Cuntai Ang, Kai Keng So, Rosa Q. Inst Infocomm Res Dept Neural & Biomed Technol Singapore 138632 Singapore NUS Singapore Inst Neurotechnol Dept Psychol Singapore 769199 Singapore Nanyang Technol Univ Sch Comp Sci & Engn Singapore 639798 Singapore

ISBN: (纸本)9781509028092

Invasive brain-machine-interface (BMI) has the prospect to empower tetraplegic patients with independent mobility through the use of brain-controlled wheelchairs. For the practical and long-term use of such control systems, the system has to distinguish between stop and movement states and has to be robust to overcome non-stationarity in the brain signals. In this work, we investigates the non-stationarity of the stop state on neural data collected from a macaque trained to control a robotic platform to stop and move in left, right, forward directions We then propose a hybrid approach that employs both random forest and linear discriminant analysis (LDA). Using this approach, we performed offline decoding on 8 days of data collected over the course of three months during joystick control of the robotic platform. We compared the results of using the proposed approach with the use of LDA alone to perform direct classifications of stop, left, right and forward. The results showed an average performance increment of 22.7% using the proposed hybrid approach. The results yielded significant improvements during sessions where LDA showed a heavy bias towards the stop state. This suggests that the proposed hybrid approach addresses the nonstationarity in the stop state and subsequently facilitates a more accurate decoding of the movement states.

关键词： Decoding Radio frequency Classification algorithms Linear discriminant analysis algorithm design and analysis Firing Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Quadrotor-UAV Optimal Coverage Path planning in cluttered environment with a limited onboard energy

Quadrotor-UAV Optimal Coverage Path planning in cluttered en...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Bouzid, Y. Bestaoui, Y. Siguerdidjane, H. Univ Paris Saclay Univ Evry IBISC Evry France Univ Paris Saclay CentraleSupelec L2S Gif Sur Yvette France

ISBN: (纸本)9781538626825

In this paper, a quadrotor optimal coverage planning approach in damaged area is considered. The quadrotor is assumed to visit a set of reachable points following the shortest path while avoiding the no-fly zones. The problem is solved by using a two-scale proposed algorithm. In the first scale, an efficient tool for cluttered environments based on optimal Rapidlyexploring Random Trees (RRT) approach, called multi-RRT* Fixed Node (RRT*FN), is developed to define the shortest paths from each point to their neighbors. Using the pair-wise costs between points provided by the firstscale algorithm, in the second scale, the overall shortest path is obtained by solving the Traveling Salesman Problem (TSP) using Genetic algorithms (GA). Taking into consideration the limited onboard energy, a second alternative based on the well-known Vehicle Routing Problem (VRP) is used. This latter is solved using the savings heuristic approach. The effectiveness of this proposed two-scale algorithm is demonstrated through numerical simulations and promising results are obtained.

关键词： Path planning Genetic algorithms Planning algorithm design and analysis Robot sensing systems Shape Traveling salesman problems

来源：评论

学校读者我要写书评

暂无评论

Sparse Exact PGA on Riemannian Manifolds 16

Sparse Exact PGA on Riemannian Manifolds

引用

16th IEEE International Conference on Computer Vision (ICCV)

作者： Banerjee, Monami Chakraborty, Rudrasis Vemuri, Baba C. Univ Florida Dept CISE Gainesville FL 32611 USA

ISBN: (纸本)9781538610329

Principal Component analysis (PCA) is a widely popular dimensionality reduction technique for vector-valued inputs. In the past decade, a nonlinear generalization of PCA, called the Principal Geodesic analysis (PGA) was developed to tackle data that lie on a smooth manifold. PGA suffers from the same problem as PCA in that, in both the methods, each Principal Component (PC) is a linear combination of the original variables. This makes it very difficult to interpret the PCs especially in high dimensions. This lead to the introduction of sparse PCA (SPCA) in the vector-space input case. In this paper, we present a novel generalization of SPCA, called sparse exact PGA (SEPGA) that can cope with manifold-valued input data and respect the intrinsic geometry of the underlying manifold. Sparsity has the advantage of not only easy interpretability but also computational efficiency. We achieve this by formulating the PGA problem as a minimization of the projection error in conjunction with sparsity constraints enforced on the principal vectors post isomorphic mapping to Rm, where m is the dimension of the manifold on which the data reside. Further, for constant curvature smooth manifolds, we use analytic formulae for the projection error leading to an efficient solution to the SEPGA problem. We present extensive experimental results demonstrating the performance of SEPGA in achieving very good sparse principal components without sacrificing the accuracy of reconstruction. This makes SEPGA accurate and efficient in representing manifold-valued data.

关键词： Manifolds Electronics packaging Principal component analysis Linear programming algorithm design and analysis Optimization Closed-form solutions

来源：评论

学校读者我要写书评

暂无评论

Optimal PPDU Duration algorithm for VHT MU-MIMO Systems 26

Optimal PPDU Duration Algorithm for VHT MU-MIMO Systems

引用

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

作者： Syed, Aitizaz Uddin Iftikhar, Mohsin Trajkovic, Ljiljana Simon Fraser Univ Vancouver BC Canada Charles Strut Univ Wagga Wagga NSW Australia

ISBN: (纸本)9781509029914

We propose an optimal Physical Layer Convergence Procedure Protocol Data Unit (PPDU) duration algorithm that divides a long data stream into two portions among consecutive groups based on the average PPDU duration of the Very High Throughput (VHT) group. The proposed solution considers all Wireless Local Area Network (WLAN) parameters and satisfies requirements of the VHT Multi-User Multiple Input Multiple Output (MU-MIMO) protocols. The simulation results show that the optimal PPDU duration algorithm offers significant improvements by accommodating traffic of additional STAs in shorter time and by efficiently utilizing the previously wasted sections of space-time streams.

关键词： Protocols MIMO Wireless LAN algorithm design and analysis Standards Physical layer Throughput

来源：评论

学校读者我要写书评

暂无评论

A Direct Synthesis algorithm Having a Broad Range of Validity for Electromagnetic design

A Direct Synthesis Algorithm Having a Broad Range of Validit...

引用

International Symposium of IEEE-Antennas-and-Propagation-Society / USNC/URSI National Radio Science Meeting

作者： Li, Ping Jiao, Dan Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

ISBN: (纸本)9781538632840

Given an initial design of an electromagnetic structure, we develop a direct synthesis algorithm to find the performance of the structure in a broad range of design space. This method only requires the field solutions at the initial design point for a small number of right hand sides, thus avoiding system solutions at other design points. Unlike a derivative-based method whose range of validity is local, no matter how high the order of the derivative is, the proposed method has a wide range of validity far beyond the initial design point in the design space. In addition, it is suitable for the co-design of multiple design parameters. Numerical experiments have demonstrated its effectiveness.

关键词： Electromagnetics algorithm design and analysis Eigenvalues and eigenfunctions Taylor series Computational modeling Dielectric constant Substrates

来源：评论

学校读者我要写书评

暂无评论

Consensus of Heterogeneous Multiple Integrator Agents On Directed Graphs 56

Consensus of Heterogeneous Multiple Integrator Agents On Dir...

引用

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

作者： Abdessameud, Abdelkader Tayebi, Abdelhamid Penn State Univ Dept Elect Engn Harrisburg PA 17057 USA Lakehead Univ Dept Elect Engn Thunder Bay ON Canada

ISBN: (纸本)9781509028733

This paper considers the consensus problem of heterogeneous high-order multi-agent systems, described by multiple integrator dynamics with mixed order, under general directed graphs. We propose a state-feedback-based distributed consensus algorithm that achieves consensus without topology-dependent conditions. It is shown that consensus is reached under a necessary and sufficient condition of an interconnection graph having a spanning tree. As a result, the proposed approach relaxes some restrictive assumptions, commonly considered in the literature, on the availability of global information for all agents and on the type of information shared among agents.

关键词： Heuristic algorithms Multi-agent systems Laplace equations algorithm design and analysis Eigenvalues and eigenfunctions Position measurement Electrical engineering

来源：评论

学校读者我要写书评

暂无评论

RELNA: Ranking attributes in social networks to detect overlapping communities efficiently 33

RELNA: Ranking attributes in social networks to detect overl...

引用

IEEE 33rd International Conference on Data Engineering (ICDE)

作者： Martinez-Seis, Bella Li, Xiaoou IPN CINVESTAV Comp Sci Dept Mexico City DF Mexico

ISBN: (纸本)9781509065431

A community is a group of entities not only with high density but also with similar characteristics. Just recent works have merged the graph structure of the networks with the attributes of nodes. Some of them make weight modification, linear combination, and the most promising are the model-based algorithms, which faces the mixture of structure and attributes in a centralized way, this integration increases the dimensionality of the problem. Moreover, not all the attributes are relevant for that purpose, and there are works that rank attributes in each iteration of the community detection process, others do not consider multiple groups with the same attribute. Based on the principle that linked nodes are likely to adopt similar attributes, we calculated weight to each attribute to get the most RELevant Node Attributes (RELNA) based on the relations of the nodes. We integrated the selected attributes to overlapping community detection methods like the well-known CESNA (Communities from Edge Structure and Node Attributes) and our method QMUCA (Quality Measure to Upgrade Communities using Attributes and structure), which is a model-based approach that uses optimization in a regression analysis and a new similarity measure. Experiments show that QMUCA with the ranking of RELNA improves the performance of the accuracy of other methods, but we are still working on it.

关键词： Social network services Optimization Image edge detection Regression analysis Heuristic algorithms algorithm design and analysis Measurement uncertainty

来源：评论

学校读者我要写书评

暂无评论

GraphTuner: An Input Dependence Aware Loop Perforation Scheme for Efficient Execution of Approximated Graph algorithms 35

GraphTuner: An Input Dependence Aware Loop Perforation Schem...

引用

35th IEEE International Conference on Computer design (ICCD)

作者： Omar, Hamza Ahmad, Masab Khan, Omer Univ Connecticut Storrs CT 06269 USA

ISBN: (纸本)9781538622544

Graph algorithms have gained popularity and are utilized in high performance and mobile computing paradigms. Input dependence due to input graph changes leads to performance variations in such algorithms. The impact of input dependence for graph algorithms is not well studied in the context of approximate computing. This paper conducts such analysis by applying loop perforation, which is a general approximation mechanism that transforms the program loops to drop a subset of their total iterations. The analysis identifies the need to adapt the inner and outer loop perforation as a function of input graph characteristics, such as the density or size of the graph. A predictive model is proposed to learn the near-optimal loop perforation rates using synthetic input graphs. When the input-aware loop perforation model is applied to real world graphs, the evaluated graph algorithms systematically degrade accuracy to achieve performance and power benefits. Results show similar to 30% performance and similar to 19% power utilization improvements on average at a program accuracy loss threshold of 10% for an NVidia((R)) GPU. The analysis is also conducted for two concurrent Intel((R)) CPU architectures, an 8-core Xeon(TM) and a 61-core Xeon Phi(TM) machine.

关键词： Approximation algorithms algorithm design and analysis Prediction algorithms Benchmark testing Computer architecture Complexity theory Quality of service

来源：评论

学校读者我要写书评

暂无评论

User Scheduling in Massive MIMO Systems with a Large Number of Devices 28

User Scheduling in Massive MIMO Systems with a Large Number ...

引用

28th Annual IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

作者： Kuerbis, Martin Balasubramanya, Naveen Mysore Lampe, Lutz Lampe, Alexander Univ Appl Sci Mittweida Germany Univ British Columbia Vancouver BC Canada

ISBN: (纸本)9781538635315

In this work, we consider a joint grouping and scheduling algorithm for fair user scheduling in massive multiple-input multiple-output (MIMO) systems that support Internet of Things (IoT) application scenarios. Our proposed method serves the users consecutively in groups, where the group sizes are derived from the optimal number of active users in the zero-forcing downlink channel. To select the best group members we adopt a version of the popular semi-orthogonal user selection (SUS) algorithm. Specifically, we identify the drawbacks of the original SUS algorithm when operating in a massive MIMO system and present a modified SUS strategy (SUS-M) for user selection. Simulation results demonstrate that our proposed method outperforms the conventional SUS strategy and provides improved fairness in terms of the individual user rates.

关键词： MIMO communication Signal to noise ratio Downlink Scheduling Internet of Things algorithm design and analysis Correlation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 76 77 78 79 80 81 82 83 84 85 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：