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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

294 篇 期刊文献
202 篇 会议
16 篇 学位论文
1 册 图书

馆藏范围

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

日期分布

学科分类号

455 篇 工学
- 313 篇 计算机科学与技术...
- 183 篇 电气工程
- 69 篇 信息与通信工程
- 60 篇 软件工程
- 59 篇 控制科学与工程
- 16 篇 石油与天然气工程
- 15 篇 仪器科学与技术
- 12 篇 机械工程
- 9 篇 电子科学与技术（可...
- 8 篇 动力工程及工程热...
- 7 篇 测绘科学与技术
- 6 篇 网络空间安全
- 5 篇 材料科学与工程（可...
- 4 篇 力学（可授工学、理...
- 4 篇 化学工程与技术
- 4 篇 交通运输工程
- 4 篇 环境科学与工程（可...
- 4 篇 生物医学工程（可授...
111 篇 理学
- 68 篇 数学
- 22 篇 物理学
- 10 篇 生物学
- 10 篇 统计学（可授理学、...
- 7 篇 地球物理学
- 7 篇 系统科学
- 6 篇 化学
- 4 篇 天文学
31 篇 管理学
- 25 篇 管理科学与工程(可...
- 5 篇 图书情报与档案管...
9 篇 医学
- 7 篇 临床医学
7 篇 经济学
- 6 篇 应用经济学
4 篇 农学
3 篇 教育学
2 篇 法学
1 篇 军事学

主题

513 篇 distributed comp...
15 篇 big data
12 篇 parallel computa...
12 篇 optimization
12 篇 wireless sensor ...
12 篇 pagerank algorit...
12 篇 sensor networks
12 篇 randomization
11 篇 convergence
10 篇 multi-agent cons...
10 篇 task analysis
10 篇 privacy
9 篇 stochastic matri...
8 篇 machine learning
7 篇 clustering
7 篇 message passing
7 篇 search engines
7 篇 resource allocat...
7 篇 scheduling
7 篇 multi-agent syst...

机构

6 篇 politecn torino ...
4 篇 tokyo inst techn...
4 篇 department of co...
3 篇 ieiit-cnr polite...
3 篇 univ chinese aca...
3 篇 univ chinese aca...
3 篇 chinese acad sci...
3 篇 chinese acad sci...
3 篇 university of pe...
3 篇 univ illinois de...
3 篇 hohai univ coll ...
3 篇 univ cyprus dept...
2 篇 ocean univ china...
2 篇 univ ljubljana f...
2 篇 department of co...
2 篇 univ babylon dep...
2 篇 univ north texas...
2 篇 chongqing univ c...
2 篇 michigan state u...
2 篇 department of el...

作者

9 篇 tempo roberto
8 篇 ishii hideaki
6 篇 wang lei
5 篇 gunduz deniz
5 篇 wang ning
4 篇 kosugi g
4 篇 kamada tomio
4 篇 ohta chikara
4 篇 takata t
4 篇 zhao jinquan
4 篇 finnerty patrick
4 篇 hong yiguang
4 篇 hideaki ishii
4 篇 yagi m
4 篇 bai er-wei
4 篇 roberto tempo
4 篇 yiguang hong
3 篇 gomez-vilardebo ...
3 篇 mizumoto y
3 篇 wu zhengtian

语言

488 篇 英文
20 篇 其他
5 篇 中文

检索条件"主题词=distributed computation"

共 513 条记录，以下是291-300 订阅

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

详细简洁

排序：

From Graphs to Tables the Design of Scalable Systems for Graph Analytics 23

From Graphs to Tables the Design of Scalable Systems for Gra...

引用

23rd International Conference on World Wide Web (WWW)

作者： Gonzalez, Joseph E. Univ Calif Berkeley AMPLab Berkeley CA 94720 USA

ISBN: (纸本)9781450327459

From social networks to language modeling, wing scale and importance of graph data has driven thedevelopwenl of numerous new graph-parallel systems (e.g Giraph and GraphLab). By restricting the types of computation that can be expressed and by introducing new techniques to partition and distribute graphs, these systems can efficiently execute sophisticated graph algorithms orders of magnitude faster than more general data-parallel systems. However, the same restrictions that enable graph-parallel systems to achieve substantial performance gains also limit their ability to express many of the important stages in a typical grapil-analytics pipeline. Moreover, while graph parallel systems are optimized for iterative diffusion algorithms like PageRank they are not well suited for more basic tasks like constructing the graph, modifying its structure, or expressing computation that, spans multiple graphs. While existing systems address specific stages of a typical graphanalytics pipeline, they do not address the entire pipeline, forcing the user to deal with multiple systems, complex and brittle file interfaces, and inefficient data-movement, and duplication. To fill the need for a holistic approach to graph-analytics we introduce GraphX, which unifies graph and data parallel computation under a single API and system. GraphX recasts advances in graph-processing in the context of relational algebra and distributed join optimization enabling more general data-parallel systems to process graphs efficiently. We evaluate the GraphX system on several real world tasks and show that its end-to-end performance can exceed that of specialized systems. This talk describes recent work at the PC Berkeley AM-PLab in collaboration with Reynold S. Xin, Ankur Dave, Daniel Crankshaw, Michael J. Franklin, and Ton Stolen.

关键词： distributed computation graph-parallel

来源：评论

学校读者我要写书评

暂无评论

Smart Garments: An On-Body Interface for Sensory Augmentation and Substitution

Smart Garments: An On-Body Interface for Sensory Augmentatio...

引用

ACM International Joint Conference on Pervasive and Ubiquitous Computing (UbiComp)

作者： Profita, Halley P. Univ Colorado Dept Comp Sci Boulder CO 80309 USA

ISBN: (纸本)9781450330473

The human sensory network provides an immediate interface by which to gauge ambient properties of the environment, registering pressure, sound, odor, etc. However, sensory loss can drastically diminish one's ability to process such ambient information, exposing an individual to potentially harmful situations. Smart Garments, capable of computation, communication, sensing, and actuation, have the ability to offset potentially hazardous circumstances associated with sensory loss by augmenting the human sensory capabilities. This research explores how Smart Garments can support those with a hearing impairment by leveraging the proximity and surface area of the human skin to provide contextual information (vibrotactile cues approximating the direction of critical environmental sounds) to a user.

关键词： Haptic interface wearable technology distributed computation hearing impairment sensory substitution

来源：评论

学校读者我要写书评

暂无评论

FAST AND ROBUST BOOTSTRAP IN ANALYSING LARGE MULTIVARIATE DATASETS 48

FAST AND ROBUST BOOTSTRAP IN ANALYSING LARGE MULTIVARIATE DA...

引用

48h Asilomar Conference on Signals, Systems and Computers

作者： Basiri, Shahab Ollila, Esa Koivunen, Visa Aalto Univ Dept Signal Proc & Acoust POB 13000 FI-00076 Aalto Finland

ISBN: (纸本)9781479982974

In this paper we address the problem of performing statistical inference for large scale data sets. The volume and dimensionality of the data may be so high that it cannot be processed or stored in a single node. We propose a scalable, statistically robust and computationally efficient bootstrap method compatible with distributed processing and storage systems. Bootstrapping is performed on multiple smaller distinct subsets of data similarly to the bag of little bootstrap method (BLB) [1]. For each bootstrap replica drawn from distinct data subsets, a computationally efficient fixed-point estimation equation is solved. The proposed bootstrap method facilitates using highly robust statistical methods in analyzing large scale data sets. Significant savings in computation is achieved since the method does not require recomputing the estimator for each bootstrap sample but it is done analytically using a smart approximation. Simulation examples demonstrate the usefulness and validity of the method for bootstrap analysis of large data sets.

关键词： bootstrap bag of little bootstraps fast and robust bootstrap big data robust estimation distributed computation

来源：评论

学校读者我要写书评

暂无评论

Estimating the Degrees of Neighboring Nodes in Online Social Networks 1

引用

17th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA)

作者： Lee, Jooyoung Oh, Jae C. Innopolis Univ Kazan Russia Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY USA

ISBN: (数字)9783319131917

ISBN: (纸本)9783319131917;9783319131900

We propose an agent centric algorithm that each agent (i.e., node) in a social network can use to estimate each of its neighbor's degree. The knowledge about the degrees of neighboring nodes is useful for many existing algorithms in social networks studies. For example, algorithms to estimate the diffusion rate of information spread need such information. In many studies, either such degree information is assumed to be available or an overall probabilistic distribution of degrees of nodes is presumed. Furthermore, most of these existing algorithms facilitate a macro-level analysis assuming the entire network is available to the researcher although sampling may be required due to the size of the network. In this paper, we consider the case that the network topology is unknown to individual nodes and therefore each node must estimate the degrees of its neighbors. In estimating the degrees, the algorithm correlates observable activities of neighbors to Bernoulli trials and utilize a power-law distribution to infer unobservable activities. Our algorithm was able to estimate the neighbors' degrees in 92% accuracy for the 60867 number of nodes. We evaluate the mean squared error of accuracy for the proposed algorithm on a real and a synthetic networks.

关键词： Online social networks degree estimations distributed computation

来源：评论

学校读者我要写书评

暂无评论

distributed LARGE-SCALE TENSOR DECOMPOSITION

DISTRIBUTED LARGE-SCALE TENSOR DECOMPOSITION

引用

IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： de Almeida, Andre L. F. Kibangou, Alain Y. Univ Fed Ceara Dept Teleinformat Engn Fortaleza Ceara Brazil Univ Joseph Fourier CNRS GIPSA Lab St Martin Dheres France

ISBN: (纸本)9781479928934

Canonical Polyadic Decomposition (CPD), also known as PARAFAC, is a useful tool for tensor factorization. It has found application in several domains including signal processing and data mining. With the deluge of data faced in our societies, large-scale matrix and tensor factorizations become a crucial issue. Few works have been devoted to large-scale tensor factorizations. In this paper, we introduce a fully distributed method to compute the CPD of a large-scale data tensor across a network of machines with limited computation resources. The proposed approach is based on collaboration between the machines in the network across the three modes of the data tensor. Such a multi-modal collaboration allows an essentially unique reconstruction of the factor matrices in an efficient way. We provide an analysis of the computation and communication cost of the proposed scheme and address the problem of minimizing communication costs while maximizing the use of available computation resources.

关键词： Tensor decompositions large-scale data distributed computation

来源：评论

学校读者我要写书评

暂无评论

QoS-ensuring Distribution of computation Load among Cloud-enabled Small Cells 3

QoS-ensuring Distribution of Computation Load among Cloud-en...

引用

3rd IEEE International Conference on Cloud Networking (CloudNet)

作者： Vondra, Michal Becvar, Zdenek Czech Tech Univ Fac Elect Engn Dept Telecommun Engn Prague Czech Republic

ISBN: (纸本)9781479927302

With increasing requirements of mobile users on computational demanding applications, the need for offloading of computation to a cloud is a convenient way to provide high QoS and to lower energy consumption of a User Equipment (UE). However, common centralized cloud can prolong overall application processing time due to high delay of data delivery from the UE to the cloud and back. To reduce data delivery delay, a concept known as Small Cell Cloud (SCC) can be adopted. The SCC is based on equipping small cell base stations by additional computing capacity and enabling distributed computation for mobile cloud application. For proper function of the SCC, offloaded computing tasks must be efficiently and uniformly distributed among all computing cells. In this paper, we design the algorithm for selection of the computing cells that increases user's satisfaction with experienced delay due to data transmission and computing. The algorithm selects the computing cell based on combination of users' requirements and the SCC status. As the results show, the proposed algorithm is able to provide higher satisfaction comparing to competitive approaches for all types of backhauls while the balancing of load is not significantly affected.

关键词： mobile cloud computing distributed computation cloud-enable small cell small cell cloud QoS

来源：评论

学校读者我要写书评

暂无评论

Partially-distributed Coordination with Reo

Partially-Distributed Coordination with Reo

引用

22nd Euromicro International Conference on Parallel, distributed, and Network-Based Processing (PDP)

作者： Jongmans, Sung-Shik T. Q. Santini, Francesco Arbab, Farhad Ctr Wiskunde & Informat Formal Methods Amsterdam Netherlands INRIA Paris Rocquencourt Contraintes Le Chesnay France

ISBN: (纸本)9781479927289

Coordination languages, as Reo, have emerged for the specification and implementation of interaction protocols among concurrent entities. In this paper, we propose a framework for generating partially-distributed, partially-centralized implementations of Reo connectors to improve 1) build-time compilation and 2) run-time throughput and parallelism. Our framework relies on the definition of a new formal product operator on constraint automata (Reo's formal semantics), which enables the formally correct distribution of disjoint parts of a coordination scheme over different machines according to several possible motivations (e.g., performance, privacy, QoS constraints, resource availability, network topology). First, we describe the design and a proof-of-concept implementation of our framework. Then, in a case study, we show and explain how a generated connector implementation can be executed in the Cloud and supports Big Data coordination.

关键词： Reo coordination language distributed computation Web services Cloud Big Data

来源：评论

学校读者我要写书评

暂无评论

Using distributed feature detection for an assistive work system

Using distributed feature detection for an assistive work sy...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Kistel, Thomas Wendlandt, Ole Vandenhouten, Ralf Wildau Univ Appl Sci Inst Telemat Hochschulring 1 D-15745 Wildau Germany

ISBN: (纸本)9781479938407

The real-time detection of context information in marker-less Augmented Reality (AR) scenarios with a large amount of key-point based descriptors still represents a scientific challenge. In this demo paper we present a mobile assistive work system that uses key-point based descriptors in marker-less AR to automatically detect the current working context of an employee and display the required information for the user. Our system is used in workshops for the maintenance of train vehicles. In this use case the mobile application has to detect a large amount of different tools and train components (i.e. objects). We use marker-less detection algorithms, which require the existence of referential images, whose amount grows linear to the number of objects that have to be detected. However, a large amount of referential images makes it impossible to execute the whole detection process on the mobile device. Therefore we implemented a distributed computation of the marker-less detection, which allows to find many different objects. In this paper we describe the components of the system, the image processing technologies used, and current limitations that we have identified.

关键词： augmented reality feature extraction mobile computing object detection personnel assistive work system distributed computation distributed feature detection image processing technologies key-point based descriptors marker-less AR marker-less augmented reality scenarios marker-less detection algorithms mobile assistive work system mobile device real-time context information detection train vehicle maintenance Conferences Context Detection algorithms Feature extraction Mobile communication Mobile handsets Servers

来源：评论

学校读者我要写书评

暂无评论

Investigating distributed Approaches to Efficiently Extract Textual Evidences for Biomedical Ontologies 14

Investigating Distributed Approaches to Efficiently Extract ...

引用

14th IEEE International Conference on BioInformatics and BioEngineering (BIBE)

作者： Cheng, Long Ma, Yue Tech Univ Dresden Dept Comp Sci Dresden Germany CNRS LRI Orsay France Univ Paris 11 Orsay France

ISBN: (纸本)9781479975020

Heterogeneous data resources in biomedicine become available both in structured and unstructured formats, such as scientific publications, healthcare guidelines, controlled vocabularies, and formal ontologies. Bridging the gaps among these heterogeneous data is useful to discovery implicit knowledge. To make this happen, efficient computational approaches are a necessity for applications in such a knowledge-and data-intensive domain. In this paper, we first define a particular task, relation alignment, which is to identify textual evidences for biomedical ontologies. Then, we investigate two parallel approaches for this task over distributed systems and present the details of their implementations. Moreover, we characterize the performance of our methods through extensive experiments, thereby allowing researchers to make a more informed choice in the presence of large-scale biomedical data.

关键词： Biomedical ontology relation alignment distributed computation high performance big data

来源：评论

学校读者我要写书评

暂无评论

Rational and Resilient Protocols 14

Rational and Resilient Protocols

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Micali, Silvio MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450329446

Cryptography and distributed computation have been very successful in advancing the study of interaction of distinct computing agents. Moreover, both fields have been very successful in conversing with each other, sharing models and techniques. Notably, they both model agents as being either 'good' (i.e., following their prescribed programs) or 'bad' (i.e., deviating from their prescribed program, by stopping, by acting maliciously, or even by coordinating their malicious strategies). I believe however, that we have been neglecting a fundamental ingredient, UTILITY, which has long been recognized and studied by another scientific field, game theory, and in particular by a beautiful subfield of it, mechanism design. Mechanism design aims at obtaining a desired outcome by engineering a game that, rationally played, yields a desired outcome. In such games, multiple players interact very much as in a cryptographic/distributed protocol. But here players are not good or malicious. Rather, every player is RATIONAL, that is, always acts so as to maximize HIS OWN utility.I believe that properly incorporating utility/rationality in our models will dramatically increase our range of action. Viceversa, mechanism design stands to gain a lot by properly incorporating cryptographic/distributed notions and techniques. In particular, rational players may, by colluding (and making side-payments to one another), increase their utilities. And they too value privacy, which may indeed represent their strategic interests in unforeseen and not yet modeled interactions. Thus, privacy and collusion can disrupt the intended course of an engineered game, and ultimately prevent a desired outcome from being achieved. Mechanism design has been only moderately successful in protecting against collusion, has largely ignored privacy, and might gain precious resiliency by taking into consideration our notions and *** sum, there is an opportunity for cryptography, distributed computation, an

关键词： interaction collusion privacy rationality resiliency cryptography distributed computation mechanism design

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：