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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

17,615 篇 工学
- 6,923 篇 计算机科学与技术...
- 6,750 篇 电气工程
- 2,979 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,473 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,415 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 94 篇 材料科学与工程（可...
- 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,948 篇 algorithm design...
5,905 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,547 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,979 篇 convergence
3,963 篇 performance anal...
3,642 篇 data mining
3,579 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,986 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 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,750 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm design and analysis"

共 82948 条记录，以下是561-570 订阅

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

详细简洁

排序：

Pruning and Nonparametric Multiple Change Point Detection 17

Pruning and Nonparametric Multiple Change Point Detection

引用

17th IEEE International Conference on Data Mining (ICDMW)

作者： Zhang, Wenyu James, Nicholas A. Matteson, David S. Cornell Univ Dept Stat Sci Ithaca NY 14853 USA Cornell Univ Dept Operat Res & Informat Engn Ithaca NY 14853 USA Cornell Univ Dept Social Stat Ithaca NY 14853 USA

ISBN: (纸本)9781538638002

Change point analysis is a statistical tool to identify homogeneity within time series data. We propose a pruning approach for approximate nonparametric estimation of multiple change points. This general purpose change point detection procedure 'cp3o' applies a pruning routine within a dynamic program to greatly reduce the search space and computational costs. Existing goodness-of-fit change point objectives can immediately be utilized within the framework. We further propose novel change point algorithms by applying cp3o to two popular nonparametric goodness of fit measures: 'e-cp3o' uses E-statistics, and 'ks-cp3o' uses Kolmogorov-Smirnov statistics. Simulation studies highlight the performance of these algorithms in comparison with parametric and other nonparametric change point methods. Finally, we illustrate these approaches with climatological and financial applications.

关键词： Measurement Time series analysis Dynamic programming algorithm design and analysis Heuristic algorithms Electronic mail Random variables

来源：评论

学校读者我要写书评

暂无评论

Data Representation in the Modular Code

Data Representation in the Modular Code

引用

Progress in Electromagnetics Research Symposium - Spring (PIERS)

作者： Veligosha, A. V. Bratchenko, N. Yu. Kaplun, D. I. Klionskiy, D. M. Gulvanskiy, V. V. Bogaevskiy, D. V. Mil Acad Peter Great Brigadnaya Str 17 Serpuhov 142210 Russia North Caucasus Fed Univ Pushkina Str 1 Stavropol 355009 Russia St Petersburg Electrotech Univ LETI SPbETU LETI Professora Popova Str 5 St Petersburg 197376 Russia

ISBN: (纸本)9781509062690

The paper is devoted to developing an efficient technique of data representation in the modular code, which is based on the analysis of modular code structures. The suggested technique allowed us to use the "ring" property of modular codes. The technique has no drawbacks typical for the existing ones used for data representation and it can be applied for implementing modular computational devices of different type. The developed technique is efficient from the point of view of temporal and hardware costs in comparison with the existing techniques.

关键词： Hardware algorithm design and analysis Electromagnetics Springs Signal processing algorithms Memory management Transforms

来源：评论

学校读者我要写书评

暂无评论

On Static Control of Swarm Systems

On Static Control of Swarm Systems

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Tomaszek, Lukas Zelinka, Ivan VSB Tech Univ Ostrava Dept Comp Sci FEI Tr 17 Listopadu 15 Ostrava Czech Republic

ISBN: (纸本)9781538627266

In this article, there is reported our progress of our research that merges evolutionary (swarm) algorithms, (complex) networks, and coupled map lattices. The article is mainly focused on the statical control of the self-organizing migrating algorithm. There is described how to convert networks into a coupled map lattices, how to create a feedback loop into the algorithm, and how to control the run of the algorithm through the coupled map lattice. Also, you can find here a small revision of our previous research. All experiments are done on a well known CEC 2015 benchmarks.

关键词： Roads Cost function Lattices Heuristic algorithms algorithm design and analysis Control systems Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Comparison of two types of Quantum Oracles based on Grover's Adaptative Search algorithm for Multiobjective Optimization Problems

Comparison of two types of Quantum Oracles based on Grover's...

引用

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Fogel, Gerardo G. Baran, Benjamin Villagra, Marcos Natl Univ Asuncion Asuncion Paraguay

ISBN: (纸本)9788394625375

Quantum Computing is a field of study in computer science based on the laws of quantum physics. Quantum computing is an attractive subject considering that quantum algorithms proved to be more efficient than classical algorithms and the advent of large-scale quantum computation. In particular, Grover's search algorithm is a quantum algorithm that is asymptotically faster than any classical search algorithm and it is relevant for the design of fast optimization algorithms. This article proposes two algorithms based on Grover's adaptative search for biobjective optimization problems where access to the objective functions is given via two different quantum oracles. The proposed algorithms, considering both types of oracles, are compared against NSGA-II, a highly cited multiobjective optimization evolutionary algorithm. Experimental evidence suggests that the quantum optimization methods proposed in this work are at least as effective as NSGA-II in average, considering an equal number of executions. Experimental results showed which oracle required less iterations for similar effectiveness.

关键词： Quantum computing Optimization Linear programming algorithm design and analysis Boolean functions Search problems Electronic mail quantum computing algorithm design and analysis tabu search electronic mail SEARCHING algorithm Boolean functions linear programming algorithms quanta

来源：评论

学校读者我要写书评

暂无评论

Assuming failure independence: are we right to be wrong?

Assuming failure independence: are we right to be wrong?

引用

IEEE International Conference on Cluster Computing (CLUSTER)

作者： Aupy, Guillaume Robert, Yves Vivien, Frederic Univ Bordeaux INRIA Bordeaux France Univ Bordeaux LaBRI Bordeaux France Ecole Normale Super Lyon Lab LIP Paris France INRIA Paris France Univ Tennessee Knoxville TN USA

ISBN: (纸本)9781538623268

This paper revisits the failure temporal independence hypothesis which is omnipresent in the analysis of resilience methods for HPC. We explain why a previous approach is incorrect, and we propose a new method to detect failure cascades, i.e., series of non-independent consecutive failures. We use this new method to assess whether public archive failure logs contain failure cascades. Then we design and compare several cascadeaware checkpointing algorithms to quantify the maximum gain that could be obtained, and we report extensive simulation results with archive and synthetic failure logs. Altogether, there are a few logs that contain cascades, but we show that the gain that can be achieved from this knowledge is not significant. The conclusion is that we can wrongly, but safely, assume failure independence!.

关键词： algorithm design and analysis Checkpointing Probability distribution Weibull distribution Shape Resilience Protocols

来源：评论

学校读者我要写书评

暂无评论

Noise-Sensitive Feedback Loop Identification in Linear Time-Varying Analog Circuits 20

Noise-Sensitive Feedback Loop Identification in Linear Time-...

引用

20th Conference and Exhibition on design, Automation and Test in Europe (DATE)

作者： Li, Ang Li, Peng Huang, Tingwen Sanchez-Sinencio, Edgar Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA Texas A&M Univ Qatar PBOX 23874 Doha Qatar

ISBN: (纸本)9783981537093

The continuing scaling of VLSI technology and design complexity has rendered robustness of analog circuits a significant concern. Parasitic effects may introduce unexpected marginal instability within multiple noise-sensitive loops and hence jeopardize circuit operation and processing precision. The Loop Finder algorithm has been recently proposed to allow detection of noise-sensitive return loops for circuits that are described using a linear time-invariant (LTI) system model. However, many practical circuits such as switched-capacitor filters and mixers present time-varying behaviors which are intrinsically coupled with noise propagation and introduce new noise generation mechanisms. For the first time, we take an in-depth look into the marginal instability of linear periodically time-varying (LPTV) analog circuits and further develop an algorithm for efficient identification of noise-sensitive loops, unifying the solution to noise sensitivity analysis for both LTI and LPTV circuits.

关键词： Impedance Harmonic analysis Linear systems algorithm design and analysis Transfer functions Analog circuits Mixers

来源：评论

学校读者我要写书评

暂无评论

DTCO for DSA-MP Hybrid Lithography with Double-BCP Materials in Sub-7nm Node 35

DTCO for DSA-MP Hybrid Lithography with Double-BCP Materials...

引用

35th IEEE International Conference on Computer design (ICCD)

作者： Ou, Jiaojiao Xu, Xiaoqing Cline, Brian Yeric, Greg Pan, David Z. Univ Texas Austin ECE Dept Austin TX 78712 USA Arm Austin TX USA

ISBN: (纸本)9781538622544

In the sub-7nm technology nodes, as the mask cost for printing the dense via layers increases dramatically with conventional lithography technique, industries are actively looking for some alternative techniques, such as E-beam, EUV or nanoimprint. In recent years, directed self-assembly (DSA) has been demonstrated to be a promising candidate to reduce the number of masks due to its pitch multiply ability by grouping several vias in the same DSA guiding patterns. A novel idea has been proposed recently to further reduce the mask cost by applying double block copolymer (double-BCP) materials for DSA lithography. However, it is also discovered that new challenges are introduced for the DSA pattern assignment and decomposition problem with double-BCP DSA. This paper discusses the design technology co-optimization ( DTCO) for BCP materials and DSA-MP hybrid lithography. We show that it is necessary to consider the pitch-range of BCP materials for the DSA pattern assignment and decomposition. We first propose a pitch-range optimization method for the BCP material to minimize the potential DSA decomposition conflicts. We then solve the doubleBCP pattern assignment and decomposition by formulating it to a maximum weighted independent set problem, and obtain the optimal solution with integer linear programming (ILP). We also propose a bounded approximation algorithm to solve the ILP problem more efficiently. The experimental results demonstrate that our pitch-range optimization method can quickly find the pitch-range that can minimize the decomposition conflicts. With the optimized pitch-ranges, double-BCP outperforms single-BCP by reducing more than 500 conflicts for very dense design. In addition, our proposed approximation algorithm solves the problem 38x faster than the ILP formulation.

关键词： Lithography Approximation algorithms Optimization methods algorithm design and analysis Topology Complexity theory Layout

来源：评论

学校读者我要写书评

暂无评论

Evolutionary design of FRAX Decks

Evolutionary Design of FRAX Decks

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Ashlock, Daniel McEachern, Andrew Univ Guelph Dept Math & Stat Guelph ON N1G 2W1 Canada Queens Univ Dept Math & Stat Kingston ON K7L 3N6 Canada

ISBN: (纸本)9781509046010

A deck-based game is a game derived from a mathematical game by placing instances of its moves on a deck of cards. Initial work on deck-based games demonstrated that imposing the deck formalism can completely change the nature of the game. In this study, an evolutionary algorithm is used to design decks for a deck-based version of John Nash's classic game divide-the-dollar. The deck-based game is called FRAX and is used for helping students learn the arithmetic of fractions. The game includes a version that uses fraction multiplication, but focuses on addition since this is the more difficult of the basic operations with fractions. The deck design algorithm uses a novel evolutionary strategy called the horde of dumb agents technique to compare and evaluate different decks. Evolution, within the horde of dumb agents strategy, is a uniquely valuable tool for understanding how naive players might approach a new game. It is shown that the techniques presented in this study are able to obtain useful information about decks and new design principles for FRAX decks are discovered. These discoveries include an heuristic for deck difficulty based on strategically matching and non-matching subsets of the cards.

关键词： Games Evolutionary computation algorithm design and analysis Sociology Statistics Tools

来源：评论

学校读者我要写书评

暂无评论

Quantifying Differential Privacy under Temporal Correlations 33

Quantifying Differential Privacy under Temporal Correlations

引用

IEEE 33rd International Conference on Data Engineering (ICDE)

作者： Cao, Yang Yoshikawa, Masatoshi Xiao, Yonghui Xiong, Li Kyoto Univ Dept Social Informat Kyoto Japan Emory Univ Dept Math & Comp Sci Atlanta GA 30322 USA

ISBN: (纸本)9781509065431

Differential Privacy (DP) has received increasing attention as a rigorous privacy framework. Many existing studies employ traditional DP mechanisms (e.g., the Laplace mechanism) as primitives, which assume that the data are independent, or that adversaries do not have knowledge of the data correlations. However, continuous generated data in the real world tend to be temporally correlated, and such correlations can be acquired by adversaries. In this paper, we investigate the potential privacy loss of a traditional DP mechanism under temporal correlations in the context of continuous data release. First, we model the temporal correlations using Markov model and analyze the privacy leakage of a DP mechanism when adversaries have knowledge of such temporal correlations. Our analysis reveals that the privacy loss of a DP mechanism may accumulate and increase over time. We call it temporal privacy leakage. Second, to measure such privacy loss, we design an efficient algorithm for calculating it in polynomial time. Although the temporal privacy leakage may increase over time, we also show that its supremum may exist in some cases. Third, to bound the privacy loss, we propose mechanisms that convert any existing DP mechanism into one against temporal privacy leakage. Experiments with synthetic data confirm that our approach is efficient and effective.

关键词： Privacy Correlation Data privacy Databases Aggregates Probabilistic logic algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Research on Restraint Strategy of Narrow Pulses of Three-level Inverter 3

Research on Restraint Strategy of Narrow Pulses of Three-lev...

引用

2017 IEEE 第3届信息技术与机电一体化工程国际学术会议(ITOEC 2017)

作者： Shuguang Wei Minyu Li Department of Control Engineering Academy of Armored Force Engineering

Narrow pulses may appear in specific area of space vector *** of narrow pulses,switching loss and distortion of output current *** this paper,the region of narrow pulses in the spa

ISBN: (纸本)9781509053643;9781509053636

Narrow pulses may appear in specific area of space vector *** of narrow pulses,switching loss and distortion of output current *** this paper,the region of narrow pulses in the spa

关键词： algorithm design and analysis Out of order Inverters Pareto optimization Resource management Harmonic analysis Aerospace electronics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：