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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,705 篇 会议
32 篇 期刊文献
25 册 图书

馆藏范围

2,762 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,686 篇 工学
- 1,481 篇 计算机科学与技术...
- 672 篇 软件工程
- 492 篇 信息与通信工程
- 356 篇 电气工程
- 94 篇 控制科学与工程
- 83 篇 网络空间安全
- 65 篇 生物工程
- 57 篇 电子科学与技术（可...
- 43 篇 动力工程及工程热...
- 39 篇 仪器科学与技术
- 33 篇 机械工程
- 28 篇 建筑学
- 28 篇 交通运输工程
- 28 篇 安全科学与工程
- 26 篇 环境科学与工程（可...
- 24 篇 光学工程
- 20 篇 生物医学工程（可授...
- 17 篇 材料科学与工程（可...
324 篇 理学
- 192 篇 数学
- 68 篇 生物学
- 46 篇 系统科学
- 45 篇 统计学（可授理学、...
- 44 篇 物理学
218 篇 管理学
- 145 篇 管理科学与工程(可...
- 86 篇 图书情报与档案管...
- 73 篇 工商管理
50 篇 法学
- 34 篇 社会学
28 篇 医学
- 21 篇 临床医学
- 17 篇 基础医学(可授医学...
23 篇 经济学
- 20 篇 应用经济学
14 篇 教育学
11 篇 农学
6 篇 文学
3 篇 军事学
2 篇 艺术学

主题

285 篇 distributed comp...
267 篇 cloud computing
135 篇 social networkin...
103 篇 computer archite...
93 篇 protocols
91 篇 computer network...
88 篇 computer science
87 篇 peer to peer com...
84 篇 computational mo...
75 篇 security
69 篇 mobile computing
66 篇 routing
66 篇 servers
61 篇 resource managem...
60 篇 internet of thin...
60 篇 peer-to-peer com...
59 篇 grid computing
57 篇 application soft...
56 篇 quality of servi...
51 篇 software enginee...

机构

29 篇 daffodil interna...
21 篇 beijing univ pos...
13 篇 state key labora...
12 篇 daffodil interna...
10 篇 daffodil interna...
10 篇 shandong provinc...
8 篇 institute of com...
8 篇 school of inform...
5 篇 shenyang institu...
5 篇 tokyo denki univ...
5 篇 rissho universit...
5 篇 department of co...
4 篇 univ chinese aca...
4 篇 nokia research c...
4 篇 beijing univ pos...
4 篇 center for compu...
4 篇 university of ch...
4 篇 hosei univ
4 篇 department of co...
4 篇 department of co...

作者

12 篇 abujar sheikh
12 篇 hossain syed akh...
12 篇 sheikh abujar
11 篇 syed akhter hoss...
8 篇 masum abu kaisar...
8 篇 abu kaisar moham...
7 篇 wehrle klaus
7 篇 dustdar schahram
7 篇 kao odej
7 篇 buyya rajkumar
6 篇 m. takizawa
6 篇 yang yang
6 篇 t. enokido
6 篇 wang ying
6 篇 rothermel kurt
5 篇 wu budan
5 篇 wirtz hanno
5 篇 truong hong-linh
5 篇 ramachandran k.i...
5 篇 bhuiyan md. rafi...

语言

2,674 篇 英文
81 篇 其他
6 篇 中文
2 篇 法文

检索条件"任意字段=11th International Conference on Distributed Computing and Networking"

共 2762 条记录，以下是1811-1820 订阅

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

详细简洁

排序：

On Mapping Graphs of Parallel Programs onto Graphs of distributed Computer Systems by Recurrent Neural Networks

On Mapping Graphs of Parallel Programs onto Graphs of Distri...

引用

11th international conference on Parallel computing Technologies

作者： Tarkov, Mikhail S. Russian Acad Sci Siberian Branch AV Rzhanovs Inst Semicond Phys Novosibirsk 630090 Russia

ISBN: (纸本)9783642231773

A problem of mapping graphs of parallel programs onto graphs of distributed computer systems by recurrent neural network is formulated. Parameter values providing absence of incorrect solutions are experimentally determined. Optimal solutions are found for mapping a "line"-graph onto a two-dimensional torus due to introduction into Lyapunov function of penalty coefficients for the program graph edges not-mapped onto the system graph edges. For increasing probability of finding optimal mapping, a method for splitting the mapping is proposed. the method essence is a reducing solution matrix to a block-diagonal form. the Wang recurrent neural network is used to exclude incorrect solutions of the problem of mapping the line-graph onto three-dimensional torus. this network converges quicker than the Hopfield one.

关键词： Mapping graphs of parallel programs distributed computer systems neuron Hopfield network Wang recurrent network

来源：评论

学校读者我要写书评

暂无评论

distributed Genetic Process Mining Using Sampling

Distributed Genetic Process Mining Using Sampling

引用

11th international conference on Parallel computing Technologies

作者： Bratosin, Carmen Sidorova, Natalia van der Aalst, Wil Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands

ISBN: (纸本)9783642231773

Process mining aims at discovering process models from event logs. Complex constructs, noise and infrequent behavior are issues that make process mining a complex problem. A genetic mining algorithm, which applies genetic operators to search in the space of all possible process models, can successfully deal with the aforementioned challenges. In this paper, we reduce the computation time by using a distributed setting. the population is distributed between the islands of a computer network (e.g. a grid). To further accelerate the method we use sample-based fitness evaluations, i.e. we evaluate the individuals on a sample of the event log instead of the entire event log, gradually increasing the sample size if necessary. Our experiments show that both sampling and distributing the event log significantly improve the performance. the actual speed-up is highly dependent of the combination of the population size and sample size.

关键词： Genetic algorithms business intelligence process mining sampling

来源：评论

学校读者我要写书评

暂无评论

computing robot internal/external wrenches by means of inertial, tactile and F/T sensors: theory and implementation on the iCub

Computing robot internal/external wrenches by means of inert...

引用

2011 11th IEEE-RAS international conference on Humanoid Robots, HUMANOIDS 2011

作者： Ivaldi, S. Fumagalli, M. Randazzo, M. Nori, F. Metta, G. Sandini, G. Robotics Brain and Cognitive Sciences Department Istituto Italiano di Tecnologia Genoa Italy Department of Communication Computer and System Sciences University of Genoa Italy Institut des Systèmes Intelligents et de Robotique Université Pierre et Marie Curie Paris France Department of Control Engineering University of Twente Enschede Netherlands

ISBN: (纸本)9781612848679

Reliable access to dynamics is one of the central challenges in humanoid robotics. In this paper we consider the problem of computing both internal and external wrenches in open multiple branches kinematic chains, which are not equipped with joint-level torque sensors, but on the contrary are provided with inertial and tactile sensing, and a set of six-axes Force/Torque Sensors (FTS) distributed within the chain. the proposed method is grounded on the Enhanced Oriented Graph, a graph-representation of the kinematic chain, enriched with the information coming from the different sensors. Under suitable conditions, a maximum of N+1 external wrenches can be estimated from N six-axes FTS. the graph is built dynamically, and internal and external wrenches are consequently updated. theoretical results have been implemented in a software library (iDyn) released with an open-source license (GPL) as part of the iCub software project. the proposed method has been applied to 32 of the 53 DOF of the iCub humanoid robot. © 2011 IEEE.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Community evolution in dynamic social networks - Challenges and problems

Community evolution in dynamic social networks - Challenges ...

引用

11th IEEE international conference on Data Mining Workshops, ICDMW 2011

作者： Takaffoli, Mansoureh Department of Computing Science University of Alberta Edmonton Canada

ISBN: (纸本)9780769544090

Information networks that describe the relationship between individuals are called social networks and are usually modeled by a graph structure. Social network analysis is the study of these information networks which leads to uncover patterns of interaction among the entities. Most social networks are dynamic, and studying the evolution of these networks over time could provide insight into the changes that occurred in the iteration patterns and also the future trends of the networks. Furthermore, in a dynamic scenario, communities, which are groups of densely interconnected nodes, are affected by changes in the underlying population. the analysis of communities and their evolutions can help determine the characteristics and structural properties of the network. Here, we provide a brief overview of the existing research in the area of dynamic social network analysis, their limitations, and the challenges that are exists for further analysis. © 2011 IEEE.

关键词： Accuracy Communities Community evolution Community mining Data mining Dynamic social network Evolutionary analysis Heuristic algorithms Measurement Predictive models Social network services community evolution dynamic social network analysis graph structure graph theory information networks iteration pattern iterative methods social networking (online)

来源：评论

学校读者我要写书评

暂无评论

distributed monitoring of the R2 statistic for linear regression

Distributed monitoring of the R2 statistic for linear regres...

引用

11th SIAM international conference on Data Mining, SDM 2011

作者： Bhaduri, Kanishka Das, Kamalika Giannella, Chris R. MCT Inc. NASA Ames Moffett Field CA 94035 United States SGT Inc. NASA Ames Research Center Moffett Field CA 94035 United States MITRE Corp. 7525 Colshire Drive McLean VA 22102-7539 United States

ISBN: (纸本)9780898719925

the problem of monitoring a multivariate linear regression model is relevant in studying the evolving relationship between a set of input variables (features) and one or more dependent target variables. this problem becomes challenging for large scale data in a distributed computing environment when only a subset of instances is available at individual nodes and the local data changes frequently. Data centralization and periodic model recomputation can add high overhead to tasks like anomaly detection in such dynamic settings. therefore, the goal is to develop techniques for monitoring and updating the model over the union of all nodes' data in a communication-efficient fashion. Correctness guarantees on such techniques are also often highly desirable, especially in safety-critical application scenarios. In this paper we develop DReMo - a distributed algorithm with very low resource overhead, for monitoring the quality of a regression model in terms of its coefficient of determination (R2 statistic). When the nodes collectively determine that R 2 has dropped below a fixed threshold, the linear regression model is recomputed via a network-wide convergecast and the updated model is broadcast back to all nodes. We show empirically, using both synthetic and real data, that our proposed method is highly communication-efficient and scalable, and also provide theoretical guarantees on correctness. Copyright © SIAM.

关键词： Linear regression

来源：评论

学校读者我要写书评

暂无评论

distributed spectrum management and relay selection in interference-limited cooperative wireless networks 11

Distributed spectrum management and relay selection in inter...

引用

17th Annual international conference on Mobile computing and networking, MobiCom'11 and Co-Located Workshops

作者： Guan, Zhangyu Melodia, Tommaso Yuan, Dongfeng Pados, Dimitris A. School of Information Science and Engineering Shandong University Jinan 250100 China Department of Electrical Engineering State University of New York at Buffalo Buffalo NY 14260 United States

ISBN: (纸本)9781450304924

It is well known that the data transport capacity of a wireless network can be increased by leveraging the spatial and frequency diversity of the wireless transmission medium. this has motivated the recent surge of research in cooperative and dynamic-spectrum-access networks. Still, as of today, a key open research challenge is to design distributed control strategies to dynamically jointly assign (i) portions of the spectrum and (ii) cooperative relays to different traffic sessions to maximize the resulting network-wide data rate. In this article, we make a significant contribution in this direction. First, we mathematically formulate the problem of joint spectrum management and relay selection for a set of sessions concurrently utilizing an interference-limited infrastructure-less wireless network. We then study distributed solutions to this (nonlinear and nonconvex) problem. the overall problem is separated into two subproblems, (i) spectrum management through power allocation with given relay selection strategy, and (ii) relay selection for a given spectral profile. distributed solutions for each of the two subproblems are proposed, which are then analyzed based on notions from variational inequality (VI) theory. the distributed algorithms can be proven to converge, under certain conditions, to VI solutions, which are also Nash equilibrium (NE) solutions of the equivalent NE problems. A distributed algorithm based on iterative solution of the two subproblems is then designed. Performance and price of anarchy of the distributed algorithm are then studied by comparing it to the globally optimal solution obtained with a centralized algorithm. Simulation results show that the proposed distributed algorithm achieves performance that is within a few percentage points of the optimal solution. © 2011 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Establishing mobile ad-hoc networks in 802.11 infrastructure mode

Establishing mobile ad-hoc networks in 802.11 infrastructure...

引用

17th Annual international conference on Mobile computing and networking, MobiCom'11 and Co-Located Workshops - 6th ACM Workshop on Challenged Networks, CHANTS'11

作者： Wirtz, Hanno Heer, Tobias Backhaus, Robert Wehrle, Klaus Communication and Distributed Systems RWTH Aachen University Aachen Germany

ISBN: (纸本)9781450308700

Due to the widespread availability of 802.11-compliant devices, the 802.11 ad-hoc mode appears especially suited to set up mobile ad-hoc networks (MANETs). In practice, creating a MANET is challenging because typical mobile devices do not implement the configuration, routing, and name resolution functions required to operate in an ad-hoc scenario. Software restrictions on modern mobile operating systems, such as Android and iOS, even prevent mobile devices from actively participating in ad-hoc networks without circumventing vendor barriers (e.g., acquiring root access). While 802.11 infrastructure mode is not originally meant for ad-hoc establishment of multi-hop networks, it is a commodity in all 802.11-compliant devices. this availability prompts the question whether efficient ad-hoc networks can be formed by solely using 802.11 infrastructure mode. In this paper, we present an approach for 802.11 infrastructure mode ad-hoc networks in which mobile devices simultaneously function as an access point and as a station. To establish multi-hop communication across multiple infrastructure mode networks, they mesh with other access point devices. Our evaluation shows that 802.11 infrastructure ad-hoc networks even outperform 802.11 ad-hoc mode networks in terms of multi-hop throughput. © 2011 ACM.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Towards Optimal Keyword-based Content Dissemination in DHT-based P2P Networks

Towards Optimal Keyword-based Content Dissemination in DHT-b...

引用

11th IEEE international conference on Peer-to-Peer computing (P2P)

作者： Rao, Weixiong Vitenberg, Roman Tarkoma, Sasu Univ Helsinki Dept Comp Sci FIN-00014 Helsinki Finland Univ Oslo Dept Informat N-0316 Oslo Norway

ISBN: (纸本)9781457701498

Keyword-based content alert services, e. g., Google Alerts and Microsoft Live Alerts, empower the end users with the ability to automatically receive useful and most recent content. In this paper, we leverage the favorable properties of DHTs, such as scalability, and propose a design of a scalable keyword-based content alert service. the DHT-based architecture matches textual documents with queries based on document terms: For each term, the implementation assigns a home node that is responsible for handling documents and queries that contain the term. the main challenge of this keyword-based matching scheme is the high number of terms that appear in a typical document resulting in a high publication cost. Fortunately, a document can be forwarded to the home nodes of a carefully selected subset of terms without incurring false negatives. In this paper we focus on the MTAF problem of minimizing the number of selected terms to forward the published content. We show that the problem is NP-hardness, and consider centralized and DHT-based solutions. Experimental results based on real datasets indicate that the proposed solutions are efficient compared to existing approaches. In particular, the similarity-based replication of filters that is a key element of our solution is shown to mitigate the effect of hotspots that arise due to the fact that some document terms are substantially more popular than the others, both inside documents and queries.

关键词： DHT-based architecture Data models IEEE Communications Society MTAF problem Maintenance engineering NP-hardness P2P network Peer to peer computing Publishing Registers Vegetation distributed hash table file organisation keyword-based matching scheme optimal keyword-based content dissemination peer-to-peer computing scalable keyword-based content alert service similarity-based replication

来源：评论

学校读者我要写书评

暂无评论

TinyWiFi: Making network protocol evaluation portable across multiple phy-link layers

TinyWiFi: Making network protocol evaluation portable across...

引用

17th Annual international conference on Mobile computing and networking, MobiCom'11 and Co-Located Workshops - 6th ACM international Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization, WiNTECH'11

作者： Alizai, Muhammad Hamad Wirtz, Hanno Kirchen, Bernhard Vaegs, Tobias Gnawali, Omprakash Wehrle, Klaus Communication and Distributed Systems RWTH Aachen University 52056 Aachen Germany Department of Computer Science Stanford University Stanford CA 94305 United States

ISBN: (纸本)9781450308670

Multihop wireless networks, such as sensor-, ad hoc- and mesh-networks, although different share some common characteristics. All these networks exhibit link dynamics. Protocols designed for these wireless networks must overcome the challenge of link dynamics and the resulting churn in network topology. Due to structural and topological similarities, protocols developed for one class of wireless network should also be applicable in the other classes. However, network-layer protocols are usually developed for and tested in only one class of wireless network due to the lack of a platform that allows testing of protocols across different classes of networks. As a result, we unnecessarily constrain the range of settings and scenarios in which we test network protocols. In this paper, we present TinyWifi, a platform for executing native sensornet protocols on Linux-driven wireless devices. TinyWifi builds on nesC code base that abstracts from TinyOS and enables the execution of nesC-based protocols in Linux. Using this abstraction, we expand the applicability and means of protocol execution from one class of wireless network to another without re-implementation. We demonstrate the generality of TinyWifi by evaluating four well-established protocols on IEEE 802.11 and 802.15.4 based testbeds using a single implementation. © 2011 ACM.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

CSC (component, service, connector): A platform for self-adaptation of multimedia applications

CSC (component, service, connector): A platform for self-ada...

引用

Annual international conference on New Technologies of distributed Systems

作者： Makhlouf, Derdour Roose, Philippe Dalmau, Marc Ghoualmi-Zine, Nacéra Computing Department University of Badji Mokhtar - Annaba Annaba Algeria LIUPPA University of Pau Anglet France

ISBN: (纸本)9781457707292

the trend toward ubiquitous services and any multimedia, the proliferation of mobile devices and the widespread use of wireless networks imply changes in the design, the implementation and the execution of software applications. Ubiquitous systems are dynamic systems that change their behavior according to user's needs and hardware capabilities at runtime. As it is not desirable to develop these systems from scratch every time, a specific software architecture providing opportunities for dynamic adaptation of systems is necessary. It must be able to create adaptations at runtime in order to provide a dynamic and adaptive behavior for users according to the evolving context. In this paper we present a supervised adaptation platform for applications based components. the CSC platform (Component, Service and Connector) is based on a component/service model that allows adaptation of component-based applications and use service-oriented architecture for providing adaptation services to be embedded in adaptation connectors. © 2011 IEEE.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共277页 << < 178 179 180 181 182 183 184 185 186 187 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：