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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

58 篇 会议
5 册 图书
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

51 篇 工学
- 46 篇 计算机科学与技术...
- 16 篇 软件工程
- 8 篇 电气工程
- 5 篇 控制科学与工程
- 3 篇 信息与通信工程
- 2 篇 化学工程与技术
- 1 篇 仪器科学与技术
- 1 篇 电子科学与技术（可...
- 1 篇 环境科学与工程（可...
16 篇 理学
- 14 篇 数学
- 2 篇 化学
- 2 篇 统计学（可授理学、...
- 1 篇 系统科学
6 篇 管理学
- 3 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 理论经济学
1 篇 法学
- 1 篇 社会学

主题

25 篇 data structures
6 篇 data mining
4 篇 computational mo...
4 篇 discrete mathema...
4 篇 algorithm analys...
3 篇 mapreduce
3 篇 artificial intel...
3 篇 data models
2 篇 scalability
2 篇 parallel garbage...
2 篇 memory managemen...
2 篇 frequency estima...
2 篇 compressed text ...
2 篇 compressed dynam...
2 篇 computer graphic...
2 篇 sequences
2 篇 databases
2 篇 distributed algo...
2 篇 partial sums
2 篇 numeric computin...

机构

2 篇 univ helsinki de...
2 篇 school of comput...
2 篇 technion israel ...
2 篇 carleton univers...
2 篇 university of vi...
2 篇 univ chile dept ...
2 篇 department of co...
2 篇 department of co...
1 篇 dtu informatics ...
1 篇 universität des ...
1 篇 leiden univ leid...
1 篇 univ desarrollo ...
1 篇 jaypee univ engn...
1 篇 massachusetts in...
1 篇 tallinn univ tec...
1 篇 afrl ryap wright...
1 篇 athens univ econ...
1 篇 univ technol syd...
1 篇 dipartimento di ...
1 篇 politecn milan d...

作者

3 篇 navarro gonzalo
2 篇 maekinen veli
2 篇 sadakane kunihik...
2 篇 cohen nachshon
2 篇 petrank erez
2 篇 sung wing-kin
2 篇 demaine erik d.
2 篇 hon wing-kai
1 篇 mihhailov dmitri
1 篇 maria weslane so...
1 篇 parashar m
1 篇 hu zhigang
1 篇 sens pierre
1 篇 slawomir koziel
1 篇 marina l. gavril...
1 篇 babic frantisek
1 篇 fotakis dimitris
1 篇 ito yasuaki
1 篇 danny hughes
1 篇 cunningham jamie

语言

65 篇 英文
1 篇 其他

检索条件"任意字段=14th International Symposium on Algorithms and Data Structures, WADS 2015"

共 66 条记录，以下是31-40 订阅

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

详细简洁

排序：

Solving k-means on High-Dimensional Big data 14th

引用

14th international symposium on Experimental algorithms (SEA)

作者： Kappmeier, Jan-Philipp W. Schmidt, Daniel R. Schmidt, Melanie Tech Univ Berlin Berlin Germany Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9783319200866;9783319200859

In recent years, there have been major efforts to develop data stream algorithms that process inputs in one pass over the data with little memory requirement. For the k-means problem, this has led to the development of several (1 + epsilon)-approximations (under the assumption that k is a constant), but also to the design of algorithms that are extremely fast in practice and compute solutions of high accuracy. However, when not only the length of the stream is high but also the dimensionality of the input points, then current methods reach their limits. We propose two algorithms, piecy and piecy-mr that are based on the recently developed data stream algorithm BICO that can process high dimensional data in one pass and output a solution of high quality. While piecy is suited for high dimensional data with a medium number of points, piecy-mr is meant for high dimensional data that comes in a very long stream. We provide an extensive experimental study to evaluate piecy and piecy-mr that shows the strength of the new algorithms.

关键词： k-means clustering data streams SVD

来源：评论

学校读者我要写书评

暂无评论

Algorithm theory – SWAT 2014 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： R. Ravi Inge Li Gørtz

ISBN: (数字)9783319084046

ISBN: (纸本)9783319084039

this book constitutes the refereed proceedings of the 14th international Scandinavian symposium and Workshops on Algorithm theory, SWAT 2014, held in Copenhagen, Denmark, in July 2014. the 33 papers were carefully reviewed and selected from a total of 134 submissions. the papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures including but not limited to approximation algorithms, parameterized algorithms, computational biology, computational geometry and topology, distributed algorithms, external-memory algorithms, exponential algorithms, graph algorithms, online algorithms, optimization algorithms, randomized algorithms, streaming algorithms, string algorithms, sublinear algorithms and algorithmic game theory.

关键词： Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science data structures algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal Parallel Hardware K-Sorter and TopK-Sorter, with FPGA implementations 14

Optimal Parallel Hardware <i>K</i>-Sorter and Top<i>K</i>-So...

引用

IEEE 14th international symposium on Parallel and Distributed Computing (ISPDC)

作者： Matsumoto, Naoyuki Nakano, Koji Ito, Yasuaki Hiroshima Univ Dept Informat Engn Kagamiyama 1-4-1 Higashihiroshima 7398527 Japan

ISBN: (纸本)9781467371483

this paper presents a FIFO-based parallel merge sorter optimized for the latest FPGA. More specifically, we show a sorter that sorts K keys in latency K+ log(2) K-1 using log(2) K comparators. It uses K M + log(2) K+ log(2) M-1 memory blocks with capacity M to implement FIFOs. It receives K keys one by one in every clock cycle and outputs the sorted sequence of them from K + log(2) K -1 clock cycles after. Since K clock cycles are necessary to input all K keys, our sorter is almost optimal in terms of the latency. Also, since the total FIFO capacity is only K+ M log(2) K+ M log(2) M-M and at least K keys must be stored in the sorter, our sorter is also almost optimal in terms of the total FIFO capacity if M is small. this paper also presents topK-sorter, which outputs top K keys in N input keys for any large N. Our topK-sorter runs in latency N + log(2) K using log(2) K + 1 comparators. It uses memory blocks of size M and the total FIFO capacity is only 2K + M log(2) K+ M log(2) M-2M. Quite surprisingly, the total FIFO capacity is independent of N. Also, since the latency must be at least N, that of our topK-sorter is almost optimal in terms of the latency. Finally, we have implemented our K-sorter and topK-sorter in a Xilinx Virtex-7 FPGA using built-in Distributed RAMs and Block RAMs. the implementation results show that our K-sorter reduces the used memory resources by half, and both K-sorter and topK-sorter are practical and efficient.

关键词： big data data mining hardware algorithms parallel sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic Interpretation of Unordered Point Cloud data for UAV Navigation in Construction 14

Automatic Interpretation of Unordered Point Cloud Data for U...

引用

14th international Conference on Control, Automation, Robotics and Vision (ICARCV)

作者： Phung, M. D. Quach, C. H. Chu, D. T. Nguyen, N. Q. Dinh, T. H. Ha, Q. P. Vietnam Natl Univ Univ Engn & Technol Hanoi Vietnam Natl Inst Informat & Commun Strategy Hanoi Vietnam Univ Technol Sydney Sch Elect Mech & Mechatron Syst Sydney NSW Australia

ISBN: (纸本)9781509035496

the objective of this work is to develop a data processing system that can automatically generate waypoints for navigation of an unmanned aerial vehicle (UAV) to inspect surfaces of structures like buildings and bridges. the input includes data recorded by two 2D laser scanners, orthogonally mounted on the UAV, and an inertial measurement unit (IMU). To achieve the goal, algorithms are developed to process the data collected. they are separated into three major groups: (i) the data registration and filtering to generate a 3D model of the structure and control the density of point clouds for data completeness enhancement;(ii) the surface and obstacle detection to assist the UAV in monitoring tasks;and (iii) the waypoint generation to set the flight path. Experiments on different data sets show that the developed system is able to reconstruct a 3D point cloud of the structure, extract its surfaces and objects, and generate waypoints for the UAV to accomplish inspection tasks.

关键词： data handling

来源：评论

学校读者我要写书评

暂无评论

the data problem in data mining 14th

The data problem in data mining

引用

14th international symposium on Intelligent data Analysis, IDA 2015

作者： Zimmermann, Albrecht INSA de Lyon France

ISBN: (纸本)9783319244648

Computer science is essentially an applied or engineering science, creating tools. In data Mining, those tools are supposed to help humans understand large amounts of data, and produce actionable insight. In this talk, I argue that for all the progress that has been made in data Mining, in particular Pattern Mining, we are lacking understanding of key aspects of the performance and results of pattern mining algorithms. I will focus particularly on the difficulty of deriving actionable knowledge from patterns. I trace the lack of progress regarding those questions to a lack of data with varying, controlled properties, and argue that we will need to make a science of digital data generation, and use it to develop guidance to data practitioners. © Springer international Publishing Switzerland 2015.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

algorithms for Sensor Systems 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Seth Gilbert Danny Hughes Bhaskar Krishnamachari

ISBN: (数字)9783030140946

ISBN: (纸本)9783030140939

this book constitutes revised selected papers from the 14th international symposium on algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, held in Helsinki, Finland, in August 2018.;the 15 full papers presented in this volume were carefully reviewed and selected from 39 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. Originally focused on sensor networks, it now covers algorithmic issues arising in wireless networks of all types of computational entities, static or mobile, including sensor networks, sensor-actuator networks, autonomous robots. the focus is on the design and analysis of algorithms, models of computation, and experimental analysis.

关键词： Algorithm Analysis and Problem Complexity data structures Discrete Mathematics in Computer Science Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

Evaluation of EUCLID IC/CG Classification Performance Based on Ground-Truth data 14

Evaluation of EUCLID IC/CG Classification Performance Based ...

引用

14th international symposium on Lightning Protection (XIV SIPDA)

作者： Kohlmann, H. Schulz, W. Pedeboy, S. OVE ALDIS Vienna Austria Meteorage Pau France

ISBN: (纸本)9781509060535

this work compares the classification accuracy (CA) of two algorithms applied to data from the EUCLID lightning location system (LLS). As CA we call the accuracy of a LLS to correctly distinguish between cloud-to-ground (CG) and intra cloud (IC) discharges. the ground-truth data, used for this evaluation, was taken from optical and electric field data measured in various regions in Austria (2012 and 2015) and France (2014). the data set contains CG and IC discharges of positive and negative polarity. the data set was split up into further subcategories as long as the number of data was still sufficient to give reasonable results. For a coarse overview of the algorithm performances, the total CA was first calculated for each year and country for both polarities. Furthermore, for the class of CG discharges, the CA of first return strokes, the CA of subsequent return strokes (with and without respect to the polarity) as well as the CA of IC events with respect to their polarity was evaluated. Specifically the subdivision into classes of amplitudes of the peak currents for different events can give further insight to the performance of the algorithms. For that reason the total CA, the CA of negative and positive events and CC and IC was analyzed. the evaluation shows that in combination with the new sensor data format LS the new algorithm exhibits an improvement of 2% at the CA. In combination with the old data format IMPACT, the new algorithm performs worse than the old one. In total, IC events have been classified much better by the new algorithm, irrespective of the sensor data format. CG discharges on the other hand show a worse CA throughout all years for the new algorithm.

关键词： lightning location systems performance of LLS

来源：评论

学校读者我要写书评

暂无评论

WLeidenRDF: RDF data Query Method based on Semantic-Enhanced Graph-Clustering Algorithm 14

WLeidenRDF: RDF Data Query Method based on Semantic-Enhanced...

引用

14th international symposium on theoretical Aspects of Software Engineering (TASE)

作者： Yang, Liu Chen, Zhou Feng, Yiqing Liao, Zhifang Hu, Zhigang Long, Jun Cent South Univ Sch Comp Sci & Engn Changsha Peoples R China

ISBN: (纸本)9781728140865

Graph-clustering algorithms are designed to split large-scale Resource Description Framework (RDF) graphs into subgraphs to improve RDF query performance. However, triple semantics and graph structures embedded in RDF graphs are often ignored during the RDF graph partition. Accordingly, this study utilizes the Leiden algorithm for uncovering community structure to cluster RDF graphs. We propose an optimized WLeidenRDF algorithm to uncover RDF communities and cluster vertex with strong semantics. Different weights are set to predicates in RDF triples to identify semantic-relevance degree and ensure semantic connections after RDF clustering and segmentation. the experiments on WatDiv data sets demonstrate that our WLeidenRDF algorithm obtains better partitions in accordance with modularity than those of the Leiden algorithm. We implement our algorithm on Presto distributed SQL query engine. Experimental results indicate that our algorithm can substantially reduce query time by clustering RDF graphs than with other RDF query methods.

关键词： RDF query graph-clustering Leiden Presto

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis and Modelling of Concurrent Multi-access data structures 22

Performance Analysis and Modelling of Concurrent Multi-acces...

引用

34th ACM symposium on Parallelism in algorithms and Architectures (SPAA)

作者： Rukundo, Adones Atalar, Aras Tsigas, Philippas Chalmers Univ Technol Gothenburg Sweden

ISBN: (纸本)9781450391467

the major impediment to scaling concurrent data structures is memory contention when accessing shared data structure access-points, leading to thread serialisation, hindering parallelism. Aiming to address this challenge, significant amount of work in the literature has proposed multi-access techniques that improve concurrent data structure parallelism. However, there is little work on analysing and modelling the execution behaviour of concurrent multi-access data structures especially in a shared memory setting. In this paper, we analyse and model the general execution behaviour of concurrent multi-access data structures in the shared memory setting. We study and analyse the behaviour of the two popular random access patterns: shared (Remote) and exclusive (Local) access, and the behaviour of the two most commonly used atomic primitives for designing lock-free data structures: Compare and Swap, and, Fetch and Add. We model the concurrent multi-accesses by splitting the thread execution procedure into five logical sessions: i) side-work, ii) access-point search iii) access-point acquisition, iv) access-point data acquisition and v) access-point data operation. We model the acquisition of an access-point, as a system of closed queuing networks with parallel servers, and data acquisition in terms of where the data is located within the memory system. We evaluate our model on a set of concurrent data structure designs including a counter, a stack and a FIFO queue. the evaluation is carried out on two state of the art multi-core processors: Intel Xeon Phi CPU 7290 with 72 physical cores and Intel Xeon E5-2695 with 14 physical cores. Our model is able to predict the throughput performance of the given concurrent data structures with 80% to 100% accuracy on both architectures.

关键词： concurrency data structures locality multi-access semantic relaxation performance modelling parallel programming lock-free parallelism cache multi-core queuing theorem

来源：评论

学校读者我要写书评

暂无评论

A dynamic data structure for maintaining disjoint paths information in digraphs

引用

14th Annual international symposium on algorithms and Computation

作者： tholey, T Goethe Univ Frankfurt Inst Informat D-60054 Frankfurt Germany

ISBN: (纸本)3540206957

In this paper we present the first dynamic data structure for testing - in constant time - the existence of two edge- or quasi-internally vertex-disjoint paths p(1) from s to t(1) and p(2) from s to t(2) for any three given vertices s, t(1), and t(2) of a digraph. By quasi-internally vertex-disjoint we mean that no inner vertex of p(1) appears on p(2) and vice versa. Moreover, for two vertices s and t, the data structure supports the output of all vertices and all edges whose removal would disconnect s and t in a time linear in the size of the output. the update operations consist of edge insertions and edge deletions, where the implementation of edge deletions will be given only in the full version of this paper. the update time after an edge deletion is competitive with the reconstruction of a static data structure for testing the existence of disjoint paths in constant time, whereas our data structure performs much better in the case of edge insertions.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：