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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Non-parametric Active Target Localization: Exploiting Unimodality and Separability 55

Non-parametric Active Target Localization: Exploiting Unimod...

引用

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

作者： Mokhasunavisu, Dhruva Mitra, Urbashi Univ Southern Calif Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)9781538632666

The problem of localizing the peak of a unimodal signal from noisy measurements is examined. A non-Bayesian framework is used to identify feasible peak locations based on collected measurements in the absence of prior information regarding the signal. An active sensing algorithm is designed to reduce the number of measurements without compromising the localization accuracy. The sensing algorithm exploits the unimodality of the signal using a group testing strategy to iteratively reduce the ambiguity associated with the location of the target while adaptively excluding sample locations that are irrelevant for localization. While it can be numerically demonstrated that the greedy approach is not always optimal;we can bound this probability and it is found to be small. analysis and experiments suggest that the greedy step is optimal with high probability in most cases. Furthermore, it can be shown that using a greedy approach achieves better localization performance than using all the available samples.

关键词： Indexes Noise measurement algorithm design and analysis Sensors Testing Complexity theory Search problems

来源：评论

学校读者我要写书评

暂无评论

Effects of the distribution of the values of condition attribute on the quality of decision rules 40

Effects of the distribution of the values of condition attri...

引用

40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)

作者： Ognjenovic, V. Brtka, E. Brtka, V. Berkovic, I. Univ Novi Sad Tech Fac Mihajlo Pupin Zrenjanin Serbia

ISBN: (纸本)9789532330922

'The table-organized data can be analyzed by various algorithms;some of them are capable of generating IF THEN decision rules which comprises of condition attributes and decision attributes. However, it is possible to reduce the set of condition attributes but without information loss. By analysis of the condition attributes set and cuts histogram obtained by discretization and rule consistency, it is possible to choose condition attributes. This paper gives some directions and the practical example.

关键词： Histograms Rough sets Classification algorithms Blood Cells (biology) Data mining algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Scalable N-worst algorithms for Dynamic Timing and Activity analysis 17

Scalable N-worst Algorithms for Dynamic Timing and Activity ...

引用

IEEE/ACM 36th International Conference on Computer-Aided design (ICCAD)

作者： Cherupalli, Hari Sartori, John Univ Minnesota Minneapolis MN 55455 USA

ISBN: (纸本)9781538630938

As the overheads for ensuring the correctness of electronic designs continue to increase with continued technology scaling and increased variability, better-than-worst-case (BTWC) design has gained significant attention. Many BTWC design techniques utilize dynamic timing and activity information for design analysis and optimization. These techniques rely on path-based analysis that enumerates the exercised paths in a design as targets for analysis and optimization. However, path-based dynamic analysis techniques are not scalable and cannot be used to analyze full processors and full applications. On the other hand, graph-based techniques like those that form the foundational building blocks of electronic design automation tools are scalable and can efficiently analyze large designs. In this paper, we extend graph-based analysis to provide the fundamental dynamic analysis tools necessary for BTWC design, analysis, and optimization. Specifically, we present scalable graph-based techniques to report the N-worst exercised paths in a design for three metrics - timing criticality (slack), activity (toggle count), and activity subject to delay constraints. Compared to existing path-based techniques, our scalable dynamic analysis techniques improve average performance by 977x, 163x, and 113x, respectively, and enable scalable analysis for a full processor design running full applications.

关键词： Timing Logic gates Optimization Heuristic algorithms Program processors algorithm design and analysis Error analysis

来源：评论

学校读者我要写书评

暂无评论

Hardware-accelerated CCD readout smear correction for Fast Solar Polarimeter 28

Hardware-accelerated CCD readout smear correction for Fast S...

引用

28th IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)

作者： Tabel, Stefan Weikl, Korbinian Stechele, Walter Max Planck Gesell Semicond Lab Otto Hahn Ring 6 D-81739 Munich Germany Tech Univ Munich Chair Integrated Syst Arcisstr 21 D-80290 Munich Germany

ISBN: (纸本)9781509048250

Shutterless frame store charge-coupled devices (CCDs) are commonly used in ground-based solar observations, but the characteristical readout smear error of such devices hinders an application of frame store CCDs to autonomous missions. The combination of polarimetric modulation and image accumulation disables a correction of this error via software-based post-facto processing if in addition microvibrations occur during flight. This paper presents the first FPGA-based architecture for online smear correction of images from frame store CCDs, which allows for the usage of a certain frame store CCD camera on a balloon-borne solar observatory. First, we explore fast convolution-based algorithms with respect to their properties for an implementation. Afterwards, a hardware architecture is derived and implemented. Our results show that 400 frames of megapixel size can be corrected per second, maintaining an acceptable power consumption of less than 12 Watt. Finally, we discuss the circuit and show the degrees of freedom for further designs.

关键词： Mathematical model algorithm design and analysis Cameras Charge coupled devices Modulation Computer architecture Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Feature Extraction Techniques for Low-Power Ambulatory Wheeze Detection Wearables 39

Feature Extraction Techniques for Low-Power Ambulatory Wheez...

引用

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

作者： Acharya, Jyotibdha Basu, Arindam Ser, Wee Nanyang Technol Univ Interdisciplinary Grad Sch NITHM Singapore Singapore Nanyang Technol Univ Sch Elect & Elect Engn Singapore Singapore

ISBN: (纸本)9781509028092

Presence of wheezes in breathing sounds has been associated with several respiratory and pulmonary diseases. In this paper we present a novel low-complexity wheeze detection method based on frequency contour tracking for automatic wheeze detection. Two hardware friendly variants of the algorithm have also been proposed. Applying the proposed feature extraction algorithm we achieved very high classification accuracy (> 99%) at considerably low computational complexity (3x-6x) compared to earlier methods and the power consumption of the proposed method is shown to be significantly less (70x-100x) compared to 'record and transmit' strategy in wearable devices.

关键词： Feature extraction Hardware Time-frequency analysis algorithm design and analysis Spectrogram Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Out Of Memory SVD Solver for Big Data

Out Of Memory SVD Solver for Big Data

引用

IEEE High Performance Extreme Computing Conference (HPEC)

作者： Haidar, Azzam Kabir, Khairul Fayad, Diana Tomov, Stanimire Dongarra, Jack Univ Tennessee Innovat Comp Lab Knoxville TN 37996 USA Oak Ridge Natl Lab Oak Ridge TN USA Univ Manchester Manchester Lancs England Univ Versailles St Quentin En Yvelines Versailles France Nvidia Santa Clara CA USA

ISBN: (纸本)9781538634721

Many applications - from data compression to numerical weather prediction and information retrieval - need to compute large dense singular value decompositions (SVD). When the problems are too large to fit into the computer's main memory, specialized out-of-core algorithms that use disk storage are required. A typical example is when trying to analyze a large data set through tools like MATLAB or Octave, but the data is just too large to be loaded. To overcome this, we designed a class of out-of-memory (OOM) algorithms to reduce, as well as overlap communication with computation. Of particular interest is OOM algorithms for matrices of size mxn, where m >> n or m << n, e.g., corresponding to cases of too many variables, or too many observations. To design OOM SVDs, we first study the communications cost for the SVD techniques as well as for the QR/LQ factorization followed by SVD. We present the theoretical analysis about the data movement cost and strategies to design OOM SVD algorithms. We show performance results for multicore architecture that illustrate our theoretical findings and match our performance models. Moreover, our experimental results show the feasibility and superiority of the OOM SVD.

关键词： algorithm design and analysis Matrix decomposition Multicore processing Kernel Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Online Welfare Maximization of Sponsored Viral Marketing with Stochastically Arriving Spreaders

Online Welfare Maximization of Sponsored Viral Marketing wit...

引用

IEEE Global Telecommunications Conference (GLOBECOM)

作者： Lu, Zhiyi Li, Victor O. K. Shuai, Qiqi Univ Hong Kong Dept Elect & Elect Engn Pokfulam Hong Kong Peoples R China

ISBN: (纸本)9781509050192

spreaders to publish advertisements so that the final information spread is maximized, is the well-studied influence maximization problem. Studies have been focusing on a static pool of potential spreaders and ignoring their autonomy. In fact, as influential users in OSN, spreaders may act at their own discretion. Their availabilities are affected by both their logging in time and their willingness to participate in a marketing campaign. From the perspective of the advertiser, spreaders arrive stochastically. Instead of selecting spreaders on their own, advertisers usually delegate the task to a professional advertising platform and simply buy impressions. Comparing to the short time that spreaders spend on publishing advertisements, multiple advertisers exist simultaneously and are relatively static with much longer durations. Therefore, it is the platform's responsibility to properly distribute advertisements to stochastically arriving spreaders, or equivalently, allocate spreaders to sponsors. The goal is to maximize the sum utilities of all parties, i.e. the social welfare. In this paper, we propose the online simple-greedy algorithm for such allocation problem. We prove the algorithm is guaranteed to achieve an expected welfare of at least 1 - 1/e to the expected offline optimum, and further show it is the best that a polynomial-time algorithm can achieve. Moreover, we discussed extensions with different diffusion models and also conduct experiments on real datasets to show the performance of the greedy algorithm.

关键词： Resource management algorithm design and analysis Heuristic algorithms Approximation algorithms Social network services Greedy algorithms Cost accounting

来源：评论

学校读者我要写书评

暂无评论

Spatio-temporal Indexes for Events in Public Opinion System 4

Spatio-temporal Indexes for Events in Public Opinion System

引用

4th International Conference on Systems and Informatics (ICSAI)

作者： Guo, Cheng Zhang, Chong Ge, Bin Natl Univ Def Technol Sci & Technol Informat Syst Engn Lab Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781538611074

With the development of various media platforms, Internet users would like to become the producer of information and the spreader of the public opinion. Meanwhile, there are mounts of information fragments of public opinion events on the Internet. And users always issue queries according to specific spatial and temporal predicates to better understand the whole process of events. This paper focuses on addressing spatio-temporal query problem in the task of "event assembling" in public opinion system, where information fragments (snippets) are stored in HBase. Many previous works tackle the problem by designing schema, i.e., designing row key and column key formation for HBase. But it can not achieve high query efficiency. In this paper, we address this problem from nature level of HBase by using an index structure of STEHIX (Spatio-TEmporal Hbase IndeX) as a built-in component for HBase. We propose the model of Event Assembling and the algorithms of range query and kNN query for it. STEHIX is adapted to the two-level architecture of HBase and suitable for HBase to process spatio-temporal queries. It is composed of index in the meta table (the first level) and region index (the second level) for indexing inner structure of HBase regions. Base on this structure, the range query and kNN query are solved by proposing algorithms, respectively. We manually collect events data from the Internet, and implement STEHIX and conduct experiments on real dataset, and the results show our design outperforms a previous work in many aspects.

关键词： Computer architecture Internet Indexing Servers algorithm design and analysis Spatial databases

来源：评论

学校读者我要写书评

暂无评论

Fast Linear Algebra-Based Triangle Counting with KokkosKernels

Fast Linear Algebra-Based Triangle Counting with KokkosKerne...

引用

IEEE High Performance Extreme Computing Conference (HPEC)

作者： Wolf, Michael M. Deveci, Mehmet Berry, Jonathan W. Hammond, Simon D. Rajamanickam, Sivasankaran Sandia Natl Labs Ctr Res Comp POB 5800 Albuquerque NM 87185 USA

ISBN: (纸本)9781538634721

Triangle counting serves as a key building block for a set of important graph algorithms in network science. In this paper, we address the IEEE HPEC Static Graph Challenge problem of triangle counting, focusing on obtaining the best parallel performance on a single multicore node. Our implementation uses a linear algebra-based approach to triangle counting that has grown out of work related to our miniTri data analytics miniapplication [1] and our efforts to pose graph algorithms in the language of linear algebra. We leverage KokkosKernels to implement this approach efficiently on multicore architectures. Our performance results are competitive with the fastest known graph traversal-based approaches and are significantly faster than the Graph Challenge reference implementations, up to 670,000 times faster than the C++ reference and 10,000 times faster than the Python reference on a single Intel Haswell node.

关键词： Sparse matrices algorithm design and analysis Linear algebra C++ languages Kernel Libraries Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation in the Cloud: From Simulation to Experimental Validation 10

Resource Allocation in the Cloud: From Simulation to Experim...

引用

10th IEEE International Conference on Cloud Computing (CLOUD)

作者： Maenhaut, Pieter-Jan Moens, Hendrik Volckaert, Bruno Ongenae, Veerle De Turck, Filip Univ Ghent Fac Engn & Architecture Dept Informat Technol Valentin Vaerwyckweg 1 B-9000 Ghent Belgium Univ Ghent IMEC IDLab Dept Informat TechnoliGent Technol Pk Zwijnaarde 15 B-9052 Ghent Belgium

ISBN: (纸本)9781538619933

With cloud computing, the efficient management of resources is of great importance as an increased utilization of the available resources can result in higher scalability and significant energy and cost reductions. Experimental validation of novel resource management strategies is costly and time consuming, and often requires in-depth knowledge of and control over the underlying cloud platform. As a result, many novel strategies are only evaluated by means of simulations, in which the whole cloud computing environment is modelled and simulated. Nonetheless, experimental validation should also be considered during the validation, as these types of experiments can often result in new insights or they can be used to fine-tune some specific parameters. In this paper we present a general approach for the experimental validation of cloud resource management strategies, together with the introduction of a cloud testbed adapter which was designed to facilitate the step from simulations towards experimental validation on physical cloud testbeds. We illustrate our solution by means of two case studies, focusing on two different types of testbeds. The adapter mainly acts as a dispatcher towards specific services of the evaluated cloud setup, and allows researchers to easily validate their ideas without having to dive deep into the complex details of the underlying cloud platform.

关键词： Cloud computing Resource management Computational modeling Hardware Virtual machining algorithm design and analysis Adaptation models

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 47 48 49 50 51 52 53 54 55 56 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：