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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

101 篇 会议
1 册 图书

馆藏范围

102 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

49 篇 工学
- 40 篇 计算机科学与技术...
- 22 篇 软件工程
- 6 篇 控制科学与工程
- 4 篇 电气工程
- 4 篇 生物医学工程（可授...
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 光学工程
- 2 篇 电子科学与技术（可...
- 2 篇 信息与通信工程
- 2 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 农业工程
32 篇 理学
- 27 篇 数学
- 7 篇 统计学（可授理学、...
- 5 篇 物理学
- 4 篇 生物学
- 4 篇 系统科学
- 3 篇 化学
- 1 篇 地球物理学
- 1 篇 地质学
7 篇 管理学
- 4 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 农学
- 1 篇 作物学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

6 篇 cameras
4 篇 image edge detec...
4 篇 vectors
4 篇 algorithm design...
4 篇 image color anal...
3 篇 data mining
3 篇 web pages
3 篇 semantics
3 篇 feature extracti...
3 篇 training
3 篇 heuristic algori...
2 篇 computer science
2 篇 conferences
2 篇 reliability
2 篇 noise reduction
2 篇 search-based sof...
2 篇 delays
2 篇 throughput
2 篇 dictionaries
2 篇 face recognition

机构

4 篇 school of inform...
3 篇 college of compu...
2 篇 college of compu...
2 篇 school of electr...
1 篇 state key labora...
1 篇 national institu...
1 篇 school of comput...
1 篇 computer school ...
1 篇 national satelli...
1 篇 college of compu...
1 篇 dept. computer s...
1 篇 inspur group co....
1 篇 institute of com...
1 篇 new mexico state...
1 篇 faculty of mecha...
1 篇 college of infor...
1 篇 department of me...
1 篇 faculty of engin...
1 篇 department of el...
1 篇 max-planck-insti...

作者

3 篇 chu shu-chuan
3 篇 zoran ivanovski
2 篇 enrico masala
2 篇 wu tsu-yang
2 篇 guojun wang
1 篇 ahlem saddoud
1 篇 debie essam
1 篇 kim seokhwan
1 篇 zhanyang gao
1 篇 lu ke
1 篇 wei hu
1 篇 fister jr. iztok
1 篇 qiang yang
1 篇 reitzig raphael
1 篇 van der lugt aad
1 篇 lailong luo
1 篇 amorim rainer
1 篇 antonio servetti
1 篇 guido maria cort...
1 篇 kačič zdravko

语言

99 篇 英文
3 篇 中文

检索条件"任意字段=15th Workshop on Algorithm Engineering and Experiments, ALENEX 2013"

共 102 条记录，以下是21-30 订阅

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

详细简洁

排序：

engineering external memory induced suffix sorting 19

Engineering external memory induced suffix sorting

引用

19th workshop on algorithm engineering and experiments 2017, alenex 2017

作者： Kärkkäinen, Juha Kempa, Dominik Puglisi, Simon J. Zhukova, Bella Department of Computer Science University of Helsinki Finland

ISBN: (纸本)9781611974768

Suffix sorting - determining the lexicographical order of all the suffixes of a string - is one of the most important problems in string processing. the resulting data structure is called the suffix array (SA) and underpins dozens of applications in bioinformatics, data compression, and information retrieval. When the size of the input string or the SA exceeds that of internal memory (RAM), an external memory (EM) suffix sorting algorithm must be used. the most scalable of these EM methods is due to Bingmann et al. (Proc. alenex 2013), and is essentially a careful disk-based implementation of the so-called induced sorting technique used by the fastest RAM suffix sorting algorithms. In this paper we show how to greatly improve the efficiency of induced suffix sorting in external memory via a non-trivial reorganization of the computation involved. Our experiments show this new approach to be twice as fast as state-of-the-art methods, while, just as significantly, using a third of the disk memory. We also demonstrate the efficacy of our implementation for handling strings on large alphabets (with many millions of distinct symbols), which is important, e.g., for applications in natural language processing and information retrieval, but unaddressed by previous EM suffix sorting implementations. Our implementation uses a (EM) radix heap data structure and, as a side result of independent interest, we introduce a new operation for radix heaps and other monotone priority queues called min-comp, which we believe to be useful for many other applications, including discrete event simulation and sweep line algorithms, even in internal memory.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the workshop on algorithm engineering and experiments

Proceedings of the Workshop on Algorithm Engineering and Exp...

引用

18th workshop on algorithm engineering and experiments 2016, alenex 2016

ISBN: (纸本)9781510819689

the proceedings contain 15 papers. the topics discussed include: engineering oracles for time-dependent road networks;scalable transfer patterns;generating massive scale-free networks under resource constraints;k-way hypergraph partitioning via N-level recursive bisection;computing top-k closeness centrality faster in unweighted graphs;an algorithm for online k-means clustering;graph bisection with Pareto-optimization;geometry helps to compare persistence diagrams;fast algorithms for pseudoarboricity;real-time k-bounded preemptive scheduling;finding near-optimal independent sets at scale;a novel dual ascent algorithm for solving the min-cost flow problem;a general framework for dynamic succinct and compressed data structures;and a novel dual ascent algorithm for solving the min-cost flow problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Item-based learning for music emotion prediction using EEG data 15th

引用

15th workshop on Computational Models of Natural Argument, CMNA XV 2015 and 6th International workshop on Empathic Computing, IWEC-15

作者： Vateekul, Peerapon thammasan, Nattapong Moriyama, Koichi Fukui, Ken-Ichi Numao, Masayuki Department of Computer Engineering Faculty of Engineering Chulalongkorn University Bangkok Thailand The Institute of Scientific and Industrial Research Osaka University Osaka Japan

ISBN: (纸本)9783319462172

Recently, emotion recognition has gained a lot of attentions particularly in the domain of music recommendation since music can induce emotions. there have been many attempts to predict emotions using Electroencephalograph (EEG) signal, a recording of brain electrical activity. However, almost all of them just employed conventional classification techniques. In this paper, we present a novel emotion prediction algorithm by applying an item-based collaborative filtering (CF). A new EEG-based similarity score is invented to be used in the proposed method. Two-dimensional emotion model is employed, and both valence and arousal levels are discretized into two classes. the experiments were conducted on two data sets: benchmark data and our own collected data. the results show that our method does not only outperform the traditional CF, but also existing classification techniques, i.e., C4.5, SVM, and MLP. © Springer International Publishing Switzerland 2016.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the workshop on algorithm engineering and experiments

Proceedings of the Workshop on Algorithm Engineering and Exp...

引用

17th workshop on algorithm engineering and experiments, alenex 2015

the proceedings contain 15 papers. the topics discussed include: cache replacement with memory allocation;a data-aware FM-index;improved single-term top-k document retrieval;(semi-)external algorithms for graph partitioning and clustering;the 12-3-toolkit for building your own balls-into-bins algorithm;computing MaxMin edge length triangulations;branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover;faster linear-space orthogonal range searching in arbitrary dimensions;region-based approximation algorithms for visibility between imprecise locations;engineering motif search for large graphs;experimental evaluation of multi-round matrix multiplication on MapReduce;approximating betweenness centrality in large evolving networks;and 2-connectivity in directed graphs: an experimental study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Skyline Query on Anti-correlated Distributions: From the Perspective of Spatial Index 15th

Skyline Query on Anti-correlated Distributions: From the Per...

引用

15th International Conference on algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Zhang, Jinchao Zhang, Dong Yu, Bo Li, Bo Wang, Weiping Meng, Dan Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China National Engineering Laboratory for Information Security Technologies Chinese Academy of Sciences Beijing100093 China University of Chinese Academy of Sciences Beijing100049 China Inspur Group Co. Ltd Beijing100085 China State Key Laboratory of High-End Server and Storage Technology Beijing100049 China

ISBN: (纸本)9783319271392

Skyline query has attracted considerable attention since its introduction in databases. algorithms for solving skyline query are proposed consecutively, and most of them ignore data distribution or assume dimensional independence, which leads to poor performance when performing such algorithms on anti-correlated distributions. To accelerate the query process, spatial index is extensively employed, and the state-of-the-art skyline algorithm for anti-correlated distributions, SOAD, is no exception as well. However, the SOAD algorithm internally uses two index structures for the step of determination and elimination respectively, which is complex to implement and imposes extra overhead for index maintenance. In this paper, we propose an efficient algorithm RSAC for anti-correlated distributions, which solely uses one index structure to implement such two steps. experiments reveal that RSAC achieves up to 3 times performance improvement than SOAD on various datasets. © Springer International Publishing Switzerland 2015.

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

On the optimal provider selection for repair in distributed storage system with network coding 15th

On the optimal provider selection for repair in distributed ...

引用

15th International Conference on algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Jia, Chengjin Wang, Jin Zhu, Yanqin Wang, Xin Lu, Kejie Wang, Xiumin Wen, Zhengqing Department of Computer Science and Technology Soochow University Suzhou215006 China School of Computer Science Fudan University Shanghai200433 China College of Computer Science and Technology Shanghai University of Electronic Power Shanghai200444 China Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez Mayagüez00681-9000 United States School of Computer and Information Hefei University of Technology Hefei230000 China

ISBN: (纸本)9783319271392

In large-scale distributed storage systems (DSS), reliability is provided by redundancy spread over storage servers across the Internet. Network coding (NC) has been widely studied in DSS because it can improve the reliability with low repair time. To maintain reliability, an unavailable storage server should be firstly replaced by a new server, named new comer. then, multiple storage servers, called providers, should be selected from surviving servers and send their coded data through the Internet to the new comer for regenerating the lost data. therefore, in a large-scale DSS, provider selection and data routing during the regeneration phase have great impact on the performance of regeneration time. In this paper, we investigate a problem of optimal provider selection and data routing for minimizing the regeneration time in the DSS with NC. Specifically, we first define the problem in the DSS with NC. For the case that the providers are given, we model the problem as a mathematical programming. Based on the mathematical programming, we then formulate the optimal provider selection and data routing problem as an integer linear programming problem and develop an efficient near-optimal algorithm based on linear programming relaxation (BLP). Finally, extensive simulation experiments have been conducted, and the results show the effectiveness of the proposed algorithm. © Springer International Publishing Switzerland 2015.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the workshop on algorithm engineering and experiments

Proceedings of the Workshop on Algorithm Engineering and Exp...

引用

16th workshop on algorithm engineering and experiments, alenex 2014

ISBN: (纸本)9781611973198

the proceedings contain 15 papers. the topics discussed include: triangle listing algorithms: back from the diversion;on the scalability of computing triplet and quartet distances;simplifying massive planar subdivisions;distributed computation of persistent homology;top-k substring matching for auto-completion;multi-pivot quicksort: theory and experiments;a back-to-basics empirical study of priority queues;an exact approach to upward crossing minimization;practical experience with hanani-tutte for testing c-planarity;order constraints for single machine scheduling with non-linear cost;enumerating fundamental normal surfaces: algorithms, experiments and invariants;connection scan accelerated;precomputation techniques for the stochastic on-time arrival problem;and fast shortest-path distance queries on road networks by pruned highway labeling.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A robust dimensionality reduction method from laplacian orientations

A robust dimensionality reduction method from laplacian orie...

引用

15th IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2013

作者： Li, Zhaokui Ding, Lixin Wang, Yan State Key Laboratory of Software Engineering Computer School Wuhan University Wuhan China Computer School Shenyang Aerospace University Shenyang China

ISBN: (纸本)9780769550886

Most dimensionality reduction methods are usually based on dissimilarity measurement of pixel intensities which can not obtain a more robust dissimilarity measurement. To address this problem, in this paper, we propose a novel robust dimensionality reduction method from Laplacian orientations. this method does not directly manipulate pixel intensity, which introduces Laplacian orientations, combined with the kernel method, and ultimately robust dimensionality reduction. the use of the Laplacian orientations results in a more robust dissimilarity measurement between images. Our method is as simple as standard intensity-based learning, yet much more powerful for efficient dimensionality reduction method. Our experiments show that the proposed method for different expressions, different illumination conditions and different occlusions under different illumination conditions has better robustness, and achieves a higher recognition rate. For a single sample per person, the proposed algorithm can also obtain a higher recognition rate. © 2013 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Digital control of PV systems: Dynamic-gain MPPT algorithm and effects of resolution

Digital control of PV systems: Dynamic-gain MPPT algorithm a...

引用

IEEE workshop on Computers in Power Electronics

作者： Alon Blumenfeld Mor Mordechai Peretz Department of Electrical and Computer Engineering Power Electronics Laboratory Ben-Gurion University of the Negev Beer-Sheva Israel

this paper introduces a dynamic-gain MPPT algorithm for PV systems. the method demonstrates a rapid and uniform convergence toward the MPP by employing dynamic steps while owning MPPT control compatibility even for differential power processors. A theoretical analysis on the effects of resolution on limit cycle oscillations existence and power curve traps in the MPPT process is provided. the dynamic gain MPPT algorithm is demonstrated by simulation and experiments, avoiding limit cycle oscillations and power curve traps. the presented algorithm is verified on bi-directional differential power processors, demonstrating dynamic MPP convergence with no limit cycle oscillations and significant improvement of power harvesting capability up to 42%.

关键词： Convergence Limit-cycles Oscillators Signal resolution Heuristic algorithms Power electronics algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Joint base station clustering and beamformer design for partial coordinated transmission using statistical channel state information

Joint base station clustering and beamformer design for part...

引用

IEEE workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Maziar Sanjabi Mingyi Hong Meisam Razaviyayn Zhi-Quan Luo Department of Electrical and Computer Engineering University of Minnesota Minneapolis MN

In this paper we consider the problem of partial coordinated transmission in the downlink of a wireless heterogeneous network (HetNet). the partial coordination is crucial in trading off system performance with backhaul overhead, and it is achieved through jointly optimizing the base station (BS) clustering and the downlink beamformers. Unlike many existing works, we focus on the practical scenario where the channel state information (CSI) is imperfect/incomplete at the transmitter. Mathematically, we formulate the problem into a penalized stochastic optimization problem, and propose an algorithm that converges almost surely to its stationary solution set. Interestingly, our method does not require any additional computational complexity or memory compared to the existing algorithms using perfect CSI. Effectiveness of our method is validated through numerical experiments.

关键词： Signal processing algorithms Clustering algorithms Channel estimation Conferences Wireless communication Signal processing MIMO

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共11页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：