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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

71 篇 会议
7 册 图书
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

52 篇 工学
- 42 篇 计算机科学与技术...
- 26 篇 软件工程
- 10 篇 信息与通信工程
- 9 篇 电气工程
- 5 篇 仪器科学与技术
- 2 篇 机械工程
- 2 篇 控制科学与工程
- 2 篇 建筑学
- 2 篇 土木工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
24 篇 理学
- 20 篇 数学
- 2 篇 生物学
- 1 篇 地质学
- 1 篇 统计学（可授理学、...
6 篇 管理学
- 4 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 法学
- 1 篇 社会学

主题

29 篇 data structures
9 篇 data mining
5 篇 algorithm design...
4 篇 data mining and ...
4 篇 discrete mathema...
4 篇 feature extracti...
4 篇 clustering algor...
4 篇 prediction algor...
4 篇 artificial intel...
4 篇 algorithm analys...
3 篇 algorithms
3 篇 databases
3 篇 bioinformatics
3 篇 classification a...
3 篇 computational bi...
3 篇 data models
2 篇 parallel algorit...
2 篇 vm placement
2 篇 dictionary
2 篇 approximation al...

机构

4 篇 polytech univ de...
3 篇 california state...
2 篇 university of gr...
2 篇 mcgill univ mont...
2 篇 polytechnic univ...
2 篇 free univ brusse...
1 篇 university of ca...
1 篇 yahoo labs barce...
1 篇 sidney kimmel co...
1 篇 univ desarrollo ...
1 篇 department of co...
1 篇 faculty of infor...
1 篇 univ thessaly vo...
1 篇 sch comp sci & i...
1 篇 department of po...
1 篇 univ melbourne d...
1 篇 wilhelm-schickar...
1 篇 department of co...
1 篇 department of si...
1 篇 school of civil ...

作者

4 篇 iacono j
3 篇 tóth csaba d.
2 篇 ignacio rojas
2 篇 langerman s
2 篇 gonzalo joya
2 篇 gawrychowski paw...
2 篇 andreu catala
1 篇 khokhar ashfaq
1 篇 yu zheng
1 篇 vishwa s. parekh
1 篇 dusadee apichart...
1 篇 sacomoto gustavo
1 篇 salikhov kamil
1 篇 elena baralis
1 篇 luca cagliero
1 篇 gharbaoui molka
1 篇 michael a. jacob...
1 篇 qian weng
1 篇 hong edwin s.
1 篇 petri matthias

语言

83 篇 英文
1 篇 中文

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

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

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

详细简洁

排序：

DCSim: A data Centre Simulation Tool

DCSim: A Data Centre Simulation Tool

引用

13th IFIP/IEEE international symposium on Integrated Network Management (IM)

作者： Keller, Gaston Tighe, Michael Lutfiyya, Hanan Bauer, Michael Univ Western Ontario Dept Comp Sci London ON Canada

ISBN: (纸本)9783901882517;9781467352291

Developing algorithms to dynamically manage resources in a virtualized, multi-tenant data centre is challenging. Experimenting with such algorithms on the data centre scale is impractical due to size and complexity. thus, there is a need for simulation tools to allow rapid development and evaluation of management techniques. We present DCSim, an extensible framework for simulating a multi-tenant, virtualized data centre.

关键词： Cloud data Centre Simulator Virtualization Infrastructure as a Service

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient VM Scheduling for Cloud data Centers: Exact allocation and migration algorithms 13

Energy Efficient VM Scheduling for Cloud Data Centers: Exact...

引用

13th IEEE/ACM international symposium on Cluster, Cloud, and Grid Computing (CCGrid)

作者： Ghribi, Chaima Hadji, Makhlouf Zeghlache, Djamal Telecome SudParis Inst Mines Telecom UMR CNRS 5157 F-91011 Evry France

ISBN: (纸本)9780769549965;9781467364652

this paper presents two exact algorithms for energy efficient scheduling of virtual machines (VMs) in cloud data centers. Modeling of energy aware allocation and consolidation to minimize overall energy consumption leads us to the combination of an optimal allocation algorithm with a consolidation algorithm relying on migration of VMs at service departures. the optimal allocation algorithm is solved as a bin packing problem with a minimum power consumption objective. It is compared with an energy aware best fit algorithm. the exact migration algorithm results from a linear and integer formulation of VM migration to adapt placement when resources are released. the proposed migration is general and goes beyond the current state of the art by minimizing both the number of migrations needed for consolidation and energy consumption in a single algorithm with a set of valid inequalities and conditions. Experimental results show the benefits of combining the allocation and migration algorithms and demonstrate their ability to achieve significant energy savings while maintaining feasible convergence when compared with the best fit heuristic.

关键词： Energy efficiency VM placement VM migration Cloud data center Linear integer programming.

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient VM Placement Supported by data Analytic Service 13

Energy Efficient VM Placement Supported by Data Analytic Ser...

引用

13th IEEE/ACM international symposium on Cluster, Cloud, and Grid Computing (CCGrid)

作者： Dong, Dapeng Herbert, John Natl Univ Ireland Univ Coll Cork Dept Comp Sci Mobile & Internet Syst Lab Cork Ireland

ISBN: (纸本)9780769549965;9781467364652

the popularity and commercial use of cloud computing has prompted an increased concern among cloud service providers for energy efficiency while still maintaining quality of service. One of the key techniques used for the efficient use of cloud server resources is virtual machine placement. this work introduces a precise VM placement algorithm that ensures energy efficiency and also prevents Service Level Agreement (SLA) violation. the mathematical model of the algorithm is supported by a sophisticated data analytic system implemented as a service. the precision of the algorithm is achieved by allowing each individual VM to build its own data model on demand over an appropriate time horizon. thus the data model can reflect accurately the characteristics of resource usage of the VM. the algorithm can communicate synchronously or asynchronously with the data analytic service which is deployed as a cloud-based solution. In the experiments, several advanced data modelling and use forecasting techniques were evaluated. Results from simulation-based experiments show that the VM placement algorithm (supported by the data analytic service) can effectively reduce power consumption, the number of VM migrations, and prevent SLA violation;it also compares very favourably with other placement algorithms.

关键词： cloud computing VM placement energy efficiency data analytic services

来源：评论

学校读者我要写书评

暂无评论

Supporting a Light-Weight data Management Layer Over HDF5 13

Supporting a Light-Weight Data Management Layer Over HDF5

引用

13th IEEE/ACM international symposium on Cluster, Cloud, and Grid Computing (CCGrid)

作者： Wang, Yi Su, Yu Agrawal, Gagan Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9780769549965;9781467364652

Scientific simulations are now being performed at finer temporal and spatial scales, leading to an explosion of the output data, and challenges in storing, managing, disseminating, analyzing, and visualizing these datasets. Tools commonly used today for disseminating and visualizing such data have inherent limitations, making it extremely hard to deal with larger datasets. We have developed a light-weight data management tool, which allows server-side subsetting and aggregation on scientific datasets stored in HDF5, one of the most popular scientific data formats. To support a variety of queries efficiently, our tool generates code for hyperslab selector and content-based filtering, and parallelizes selection and aggregation queries efficiently using novel algorithms. Additionally, our tool also supports certain most recent HDF5 features including dimension scale and compound datatype. through extensive evaluation, we show that our system is capable of efficiently supporting a variety of queries, scaling performance by parallelizing the queries, and reducing wide area data transfers through server-side data aggregation. We demonstrate that even for subsetting queries that are directly supported in OPeNDAP, a tool widely used by data dissemination portals, the sequential performance of our system is better.

关键词： data management data types Servers dataset SCALE DIMENSION spatial scale Explosions

来源：评论

学校读者我要写书评

暂无评论

GA-based Architecture Exploration Method for Low Energy VLIW data-Path Model

GA-based Architecture Exploration Method for Low Energy VLIW...

引用

13th international symposium on Communications and Information Technologies (ISCIT) - Communication and Information Technology for New Life Style Beyond the Cloud

作者： Aoki, Kohei Taniguchi, Ittetsu Tomiyama, Hiroyuki Fukui, Masahiro Ritsumeikan Univ Grad Sch Sci & Engn 1-1-1 Noji Higashi Kusatsu Shiga 5258577 Japan Ritsumeikan Univ Coll Sci & Engn Kusatsu Shiga 5258577 Japan

ISBN: (纸本)9781467355803;9781467355780

In this paper, we propose GA-based architecture exploration method for high performance and low energy VLIW data-path. Contribution of this paper is a method to find Pareto optimal FU architecture, i.e., the number of FUs and the instruction assignment for each FU. Proposed method enables to explore the vast solution space effectively, and we obtained the almost optimal Pareto curves for real life applications for about five times faster than the exhaustive search base method. the exploration error on cycle vs energy Pareto curve was less than 1%.

关键词： Pareto optimisation genetic algorithms instruction sets low-power electronics parallel architectures power aware computing

来源：评论

学校读者我要写书评

暂无评论

A Moving Object Tracking Algorithm Using Support Vector Machines in Binary Sensor Networks

A Moving Object Tracking Algorithm Using Support Vector Mach...

引用

13th international symposium on Communications and Information Technologies (ISCIT) - Communication and Information Technology for New Life Style Beyond the Cloud

作者： Apicharttrisorn, Dusadee Apicharttrisorn, Kittipat Kasetkasem, Teerasit Kasetsart Univ Fac Engn Dept Elect Engn Bangkok Thailand Aeronaut Radio Thailand Air Traff Data Syst Engn Bangkok Thailand

ISBN: (纸本)9781467355803;9781467355780

Wireless sensor technologies have enabled us to deploy such small sensors to monitor an area of interest. Object tracking is one of the most attractive applications to be implemented with wireless sensor networks (WSNs). However, many solutions are struggled with energy-draining global positioning system (GPS), poorly-performed trilateration for indoor usage, and impractical, complex algorithms to be implemented in sensor nodes. this paper proposes a moving object tracking algorithm using support vector machines (MOT-SVM). the MOTSVM takes advantage of light-weighted directional binary sensor networks, and state-of-the-art signal processing algorithms, namely the support vector machines and particle filters. We compare our proposed algorithm with the Aslam's work [1] through the simulation. We examine our algorithms for various movement scenarios such as the linear, random and the "8"model trajectories, and the scenarios in which observing sensors make observation errors.

关键词： object tracking particle filtering (numerical methods) support vector machines wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Planar packing of binary trees

Planar packing of binary trees

引用

13th international symposium on algorithms and data structures, wads 2013

作者： Geyer, Markus Hoffmann, Michael Kaufmann, Michael Kusters, Vincent Tóth, Csaba D. Wilhelm-Schickard-Institut für Informatik Universität Tübingen Germany Institute of Theoretical Computer Science ETH Zürich Switzerland California State University Northridge CA United States University of Calgary Canada

ISBN: (纸本)9783642401039

In the graph packing problem we are given several graphs and have to map them into a single host graph G such that each edge of G is used at most once. Much research has been devoted to the packing of trees, especially to the case where the host graph must be planar. More formally, the problem is: Given any two trees T1 and T2 on n vertices, we want a simple planar graph G on n vertices such that the edges of G can be colored with two colors and the subgraph induced by the edges colored i is isomorphic to Ti, for i ∈ {1,2}. A clear exception that must be made is the star tree which cannot be packed together with any other tree. But a popular hypothesis states that this is the only exception, and all other pairs of trees admit a planar packing. Previous proof attempts lead to very limited results only, which include a tree and a spider tree, a tree and a caterpillar, two trees of diameter four and two isomorphic trees. We make a step forward and prove the hypothesis for any two binary trees. the proof is algorithmic and yields a linear time algorithm to compute a plane packing, that is, a suitable two-edge-colored host graph along with a planar embedding for it. In addition we can also guarantee several nice geometric properties for the embedding: vertices are embedded equidistantly on the x-axis and edges are embedded as semi-circles. © 2013 Springer-Verlag.

关键词： Binary trees

来源：评论

学校读者我要写书评

暂无评论

Extracting Workflow structures through Bayesian Learning and Provenance data 13

Extracting Workflow Structures through Bayesian Learning and...

引用

13th international Conference on Intelligent Systems Design and Applications (ISDA)

作者： Naseri, Mahsa Ludwig, Simone A. Univ Saskatchewan Dept Comp Sci Saskatoon SK S7N 0W0 Canada N Dakota State Univ Dept Comp Sci Fargo ND 58105 USA

ISBN: (纸本)9781479935161

Mining workflow models has been a problem of interest for the past few years. Event logs have been the main source of data for the mining process. Previous workflow mining approaches mostly focused on mining control flows that were based on data mining methods, as well as exploited time constraints of events to discover the workflow models. In this work, we present a mining approach which not only takes the behaviourial aspect of workflows into account, but also takes advantage of their informational perspective. Provenance information is a source of reasoning, learning, and analysis since it provides information regarding the service inputs, outputs and quality of service values. therefore, provenance information along with Bayesian structure-learning methods are exploited for this purpose. Two constraint-based Bayesian structure-learning algorithms are investigated and modified in order to make use of additional provenance information. We will show that this leads to better mining results based on three common mining scenarios.

关键词： Meteorology Qualityofservice

来源：评论

学校读者我要写书评

暂无评论

Effective Resource Control Strategies using OpenFlow in Cloud data Center

Effective Resource Control Strategies using OpenFlow in Clou...

引用

13th IFIP/IEEE international symposium on Integrated Network Management (IM)

作者： Adami, Davide Martini, Barbara Antichi, Gianni Giordano, Stefano Gharbaoui, Molka Castoldi, Piero CNIT Pisa Italy

ISBN: (纸本)9783901882517;9781467352291

the increasing popularity of cloud computing applications and the advances in virtualization software technologies (i.e., Virtual Machine deployment) have driven data Center infrastructures toward a greater complexity and workload dynamicity. thus, a unified control and management of computing and network resources would be required for assuring proper traffic performances in high volatile virtual machine deployments. this paper introduces a novel resource control platform for virtualized DC environments aimed at optimizing virtual machine placement on physical servers also considering traffic load across links in order to limit oversubscription- related problems. To this purpose OpenFlow statistics are elaborated for their distinguished features that well suit virtualized environments. Two novel algorithms have been conceived and compared by simulations for evaluating the effectiveness of proposed traffic-aware VM placement strategies.

关键词： cloud computing data center OpenFlow traffic engineering

来源：评论

学校读者我要写书评

暂无评论

algorithms in Bioinformatics - 13th international Workshop, WABI 2013, Proceedings

Algorithms in Bioinformatics - 13th International Workshop, ...

引用

13th Workshop on algorithms in Bioinformatics, WABI 2013

ISBN: (纸本)9783642404528

the proceedings contain 28 papers. the topics discussed include: extending the reach of phylogenetic inference;protein (multi-)location prediction: using location inter-dependencies in a probabilistic framework;towards reliable automatic protein structure alignment;a minimum-labeling approach for reconstructing protein networks across multiple conditions;faster mass decomposition;accurate decoding of pooled sequenced data using compressed sensing;a novel combinatorial method for estimating transcript expression with RNA-seq: bounding the number of paths;a polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data;and distribution of graph-distances in Boltzmann ensembles of RNA secondary structures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：