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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

17,584 篇 工学
- 6,921 篇 计算机科学与技术...
- 6,726 篇 电气工程
- 2,973 篇 信息与通信工程
- 2,679 篇 控制科学与工程
- 2,468 篇 软件工程
- 1,634 篇 电子科学与技术（可...
- 1,499 篇 仪器科学与技术
- 1,415 篇 机械工程
- 245 篇 航空宇航科学与技...
- 234 篇 生物医学工程（可授...
- 201 篇 网络空间安全
- 195 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 91 篇 动力工程及工程热...
- 81 篇 核科学与技术
- 69 篇 光学工程
1,902 篇 理学
- 955 篇 系统科学
- 511 篇 物理学
- 199 篇 数学
- 153 篇 生物学
- 79 篇 地球物理学
1,749 篇 管理学
- 1,685 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
246 篇 医学
- 180 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
55 篇 教育学
- 54 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

82,912 篇 algorithm design...
5,904 篇 clustering algor...
5,302 篇 heuristic algori...
5,275 篇 computer science
5,158 篇 optimization
4,673 篇 signal processin...
4,542 篇 hardware
4,068 篇 genetic algorith...
3,995 篇 computational mo...
3,979 篇 convergence
3,961 篇 performance anal...
3,639 篇 data mining
3,580 篇 mathematical mod...
3,389 篇 testing
3,249 篇 routing
2,985 篇 educational inst...
2,977 篇 robustness
2,967 篇 equations
2,957 篇 partitioning alg...
2,870 篇 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,713 篇 英文
855 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

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

共 82912 条记录，以下是4851-4860 订阅

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

详细简洁

排序：

Composite Iterative algorithm and Architecture for q-th Root Calculation

Composite Iterative Algorithm and Architecture for <i>q</i>-...

引用

20th IEEE Symposium on Computer Arithmetic (ARITH)

作者： Vazquez, Alvaro Bruguera, Javier D. INRIA CNRS ENSL INRIA UCBL Lab LIP Paris France Univ Santiago de Compostela Ctr Invest Tecnol Informac Dept Elect & Comp Sci Santiago Spain

ISBN: (纸本)9780769543185

An algorithm for the q-th root extraction, q being any integer, is presented in this paper. The algorithm is based on an optimized implementation of X-1/q = 2((1/q) log2(X)) by a sequence of parallel and/or overlapped operations: (1) reciprocal, (2) digit-recurrence logarithm, (3) left-to-right carry-free multiplication and (4) on-line exponential. A detailed error analysis and two architectures are proposed, for low precision q and for higher precision q. The execution time and hardware requirements are estimated for single precision floating-point computations for several radices;this helps to determine which radices result in the most efficient implementations. The architectures proposed improve the features of other architectures for q-th root extraction.

关键词： algorithm design and analysis Approximation methods Equations Integer rooting Mathematical model Piecewise linear approximation Table lookup composite iterative algorithm digit recurrence logarithm elementary function evaluation error analysis error analysis floating point arithmetic high-radix digit-by-digit algorithms iterative methods left-to-right carry-free multiplication on-line algorithms online exponential overlapped operation parallel operation q-th root calculation single precision floating point computation

来源：评论

学校读者我要写书评

暂无评论

A Game-Theoretic Defense Against Data Poisoning Attacks in Distributed Support Vector Machines 56

A Game-Theoretic Defense Against Data Poisoning Attacks in D...

引用

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

作者： Zhang, Rui Zhu, Quanyan NYU Dept Elect & Comp Engn Brooklyn NY 11201 USA

ISBN: (纸本)9781509028733

With a large number of sensors and control units in networked systems, distributed support vector machines (DSVMs) play a fundamental role in scalable and efficient multi-sensor classification and prediction tasks. However, DSVMs are vulnerable to adversaries who can modify and generate data to deceive the system to misclassification and misprediction. This work aims to design defense strategies for DSVM learner against a potential adversary. We use a game-theoretic framework to capture the conflicting interests between the DSVM learner and the attacker. The Nash equilibrium of the game allows predicting the outcome of learning algorithms in adversarial environments, and enhancing the resilience of the machine learning through dynamic distributed algorithms. We develop a secure and resilient DSVM algorithm with rejection method, and show its resiliency against adversary with numerical experiments.

关键词： Support vector machines Games Sensor fusion algorithm design and analysis Game theory Training

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for detecting closed frequent subgraphs in biological networks

An efficient algorithm for detecting closed frequent subgrap...

引用

1st International Conference on Biomedical Engineering and Informatics

作者： Peng Jia-yang Yang Lu-ming Wang Jian-xin Liu Zheng Li Ming Cent S Univ Sch Informat Sci & Engn Changsha 410083 Peoples R China

ISBN: (纸本)9780769531182

In this paper, aimed at the problem of detecting closed frequent subgraphs in biological networks, an improved FP-growth algorithm MaxFP is presented, which is based on the simplification model appropriate to biological networks. The defects of the algorithm based on item-set mining are analyzed when it is applied to biological networks, and which is overcome in MaxFP. In addition, MaxFP also takes the biological network characteristics into account. Experiment results show that MaxFP runs faster than the algorithms based on Apriori, and MaxFP not only detects maximal frequent subgraphs, but also finds more frequent subgraphs having biological meaning. The results got by performing Apriori based algorithms many times can be got by performing MaxFP once.

关键词： Biological information theory Biological system modeling Biochemistry Biomedical engineering Biomedical informatics Information science algorithm design and analysis Biology computing Computer networks Tree data structures

来源：评论

学校读者我要写书评

暂无评论

New approach for feature selection based on rough set and bat algorithm 9

New approach for feature selection based on rough set and ba...

引用

9th International Conference on Computer Engineering & Systems (ICCES)

作者： Emary, E. Yamany, Waleed Hassanien, Aboul Ella Cairo Univ Fac Comp & Informat Cairo Egypt Fayoum Univ Fac Comp & Informat Al Fayyum Egypt SRGE Cairo Egypt

ISBN: (纸本)9781479965946

This paper presents a new feature selection technique based on rough sets and bat algorithm (BA). BA is attractive for feature selection in that bats will discover best feature combinations as they fly within the feature subset space. Compared with GAs, BA does not need complex operators such as crossover and mutation, it requires only primitive and simple mathematical operators, and is computationally inexpensive in terms of both memory and runtime. A fitness function based on rough-sets is designed as a target for the optimization. The used fitness function incorporates both the classification accuracy and number of selected features and hence balances the classification performance and reduction size. This paper make use of four initialisation strategies for starting the optimization and studies its effect on bat performance. The used initialization reflects forward and backward feature selection and combination of both. Experimentation is carried out using VCI data sets which compares the proposed algorithm with a GA-based and PSO approaches for feature reduction based on rough-set algorithms. The results on different data sets shows that bat algorithm is efficient for rough set-based feature selection. The used rough-set based fitness function ensures better classification result keeping also minor feature size.

关键词： data reduction feature selection optimisation pattern classification rough set theory BA bat algorithm classification performance fitness function optimization reduction size rough set Accuracy algorithm design and analysis Classification algorithms Equations Indium phosphide Integrated circuits Feature extraction Rough sets algorithm design and analysis Indium phosphide Sorting algorithm barium Rough set theory Pattern recognition Bats data reduction bat Chiroptera Dataset

来源：评论

学校读者我要写书评

暂无评论

Useless memory allocation in system-on-a-chip test: Problems and solutions 20

Useless memory allocation in system-on-a-chip test: Problems...

引用

20th IEEE VLSI Test Symposium (VTS 02)

作者： Gonciari, PT Al-Hashimi, BM Nicolici, N Univ Southampton Dept ECS Southampton SO9 5NH Hants England

ISBN: (纸本)0769515703

Unlike the existing research direction that focuses oil useful test data reduction, this paper analyzes the useless test data memory requirements for system-on-a-chip test. The proposed solution to minimize the useless test memory is based on a new test methodology which combines a novel core wrapper design algorithm with a new test vector deployment procedure stored in the automatic test equipment (ATE). To reduce memory requirements, the proposed core wrapper design finds the minimum number of wrapper scan chain partitions such that the useless memory allocation is minimized in each partition, which facilitates efficient usage of ATE capabilities. Further, the new test vector deployment procedure provides a seamless integration with the ATE. When compared to the previously proposed core wrapper design algorithms, the proposed test methodology reduces the memory requirements up to 45%, without any penalties in test area overhead.

关键词： algorithm design and analysis Automatic test equipment Automatic testing Circuit testing design for testability Integrated circuit testing Partitioning algorithms Semiconductor device manufacture System testing System-on-a-chip

来源：评论

学校读者我要写书评

暂无评论

An experiment in discovering association rules in the legal domain 11

An experiment in discovering association rules in the legal ...

引用

11th International Workshop on Database and Expert Systems Applications

作者： Bench-Capon, T Coenen, F Leng, P Univ Liverpool Dept Comp Sci LIAL Liverpool L69 3BX Merseyside England

In this paper we explore the applicability of an algorithm designed for finding association rules in large databases to the discovery of relevant associations from a large case base.

ISBN: (纸本)0769506801

In this paper we explore the applicability of an algorithm designed for finding association rules in large databases to the discovery of relevant associations from a large case base.

关键词： algorithm design and analysis Artificial neural networks Association rules Computer science Data mining Databases Hospitals Informatics Law Legal factors

来源：评论

学校读者我要写书评

暂无评论

Guiding Text Image Keypoints Extraction Through Layout analysis 7

Guiding Text Image Keypoints Extraction Through Layout Analy...

引用

14th IAPR International Conference on Document analysis and Recognition (ICDAR)

作者： Royer, E. Bouchara, F. Univ Toulon & Var Aix Marseille Univ CNRS ENSAMLSIS Marseille France

ISBN: (纸本)9781538635865

The rise of the smartphone industry has increased the need for mobile capture of document images and with embedded applications. In the field of image processing, detecting keypoints and computing their associated features is the first step of numerous algorithms. However, keypoints detectors are mostly designed for real world images and usually don't behave well with document images. In this paper, we propose an idea which consists in guiding keypoints extraction by using the document layout information. We compare this approach with the CORE algorithm for confusion reduction, on three classical descriptors. Results show improvements in both matching quality and processing times.

关键词： Feature extraction Layout algorithm design and analysis Detectors Text analysis Mobile communication

来源：评论

学校读者我要写书评

暂无评论

A Fully Automated Method for Segmentation and Classification of Local Field Potential Recordings. Preliminary Results 39

A Fully Automated Method for Segmentation and Classification...

引用

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

作者： Diaz-Parra, Antonio Canals, Santiago Moratal, David Univ Politecn Valencia Ctr Biomat & Tissue Engn Cami Vera S-N E-46022 Valencia Spain CSIC Inst Neurociencias Sant Joan dAlacant Spain Univ Miguel Hernandez Sant Joan dAlacant Spain

ISBN: (纸本)9781509028092

Identification of brain states measured with electrophysiological methods such as electroencephalography and local field potential (LFP) recordings is of great importance in numerous neuroscientific applications. For instance, in Brain Computer Interface, in the diagnosis of neurological disorders as well as to investigate how brain rhythms stem from synchronized physiological mechanisms (e.g., memory and learning). In this work, we propose a fully automated method with the aim of partitioning LFP signals into stationary segments as well as classifying each detected segment into three different classes (delta, regular theta or irregular theta rhythms). Our approach is computationally efficient since the process of detection and partition of signals into stationary segments is only based on two features (the variance and the so-called spectral error measure) and allow the classification at the same time. We developed the algorithm upon analyzing six anesthetized rats, resulting in a true positive rate of 97.5%, 91.8% and 79.1% in detecting delta, irregular theta and regular theta rhythms, respectively. This preliminary quantitative evaluation offers encouraging results for further research.

关键词： Classification algorithms Oscillators Feature extraction Measurement uncertainty Electric potential Electroencephalography algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Competitive Coevolutionary Training of Simple Soccer Agents from Zero Knowledge

Competitive Coevolutionary Training of Simple Soccer Agents ...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Scheepers, Christiaan Engelbrecht, Andries P. Univ Pretoria Sch Informat Technol Dept Comp Sci ZA-0002 Pretoria South Africa

ISBN: (纸本)9781479914883

A new competitive coevolutionary team-based particle swarm optimisation (CCPSO) algorithm is developed to train multi-agent teams from zero knowledge. The CCPSO algorithm uses the charged particle swarm optimiser to train neural network controllers for simple soccer agents. The training performance of the CCPSO algorithm is analysed. The analysis identifies a critical weakness of the CCPSO algorithm in the form of outliers in the measured performance of the trained players. A hypothesis is presented that explains the presence of the outliers, followed by a detailed discussion of various biased and unbiased relative fitness functions. A new relative fitness function based on FIFA's league ranking system is presented. The performance of the unbiased relative fitness functions is evaluated and discussed. The final results show that the FIFA league ranking relative fitness function outperforms the other unbiased relative fitness functions, leading to consistent training results.

关键词： algorithm design and analysis Educational institutions Games Neural networks Optimization Training Vectors

来源：评论

学校读者我要写书评

暂无评论

Novel methods and results in training universal multi-nested neurons 7

Novel methods and results in training universal multi-nested...

引用

7th IEEE International Workshop on Cellular Neural Networks and Their Applications

作者： Dogaru, R Ionescu, F Julián, P Glesner, M Polytech Univ Bucharest Dept Appl Elect & Informat Engn Bucharest Romania

ISBN: (纸本)981238121X

This paper presents state of the art methods for training compact universal CNN cells (or neurons) to represent arbitrary local Boolean functions. The design tools are analyzed and optimized such that they are capable to provide fast solutions for cells with more than 4 inputs. In particular, it is proved statistically that any arbitrary Boolean function with n=5 inputs (corresponding to a von Neumann CNN neighborhood) admits multi-nested cell realizations thus confirming a conjecture that was previously proven only for n<5. Several hints are also provided regarding the choice and the influence of various parameters of the design algorithms on the quality of the solution and the speed of finding it.

关键词： algorithm design and analysis Boolean functions Cellular neural networks design optimization Equations Hypercubes Logic devices Modems Neurons Reconfigurable logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 482 483 484 485 486 487 488 489 490 491 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：