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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,824 篇 会议
51 篇 期刊文献
46 册 图书

馆藏范围

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

日期分布

学科分类号

1,581 篇 工学
- 1,304 篇 计算机科学与技术...
- 694 篇 信息与通信工程
- 641 篇 软件工程
- 424 篇 电气工程
- 80 篇 控制科学与工程
- 75 篇 电子科学与技术（可...
- 46 篇 仪器科学与技术
- 43 篇 生物工程
- 31 篇 动力工程及工程热...
- 24 篇 生物医学工程（可授...
- 23 篇 机械工程
- 22 篇 网络空间安全
- 20 篇 建筑学
- 19 篇 光学工程
- 17 篇 交通运输工程
- 16 篇 安全科学与工程
246 篇 理学
- 102 篇 物理学
- 94 篇 数学
- 48 篇 生物学
- 29 篇 统计学（可授理学、...
- 16 篇 系统科学
245 篇 管理学
- 188 篇 管理科学与工程(可...
- 68 篇 图书情报与档案管...
- 56 篇 工商管理
82 篇 医学
- 71 篇 临床医学
- 25 篇 基础医学(可授医学...
- 20 篇 公共卫生与预防医...
36 篇 法学
- 32 篇 社会学
14 篇 教育学
- 14 篇 教育学
13 篇 经济学
- 13 篇 应用经济学
8 篇 文学
4 篇 军事学
1 篇 农学

主题

314 篇 multimedia commu...
257 篇 quality of servi...
251 篇 streaming media
238 篇 mobile computing
232 篇 multimedia syste...
183 篇 social networkin...
170 篇 peer to peer com...
167 篇 bandwidth
165 篇 mobile communica...
159 篇 protocols
157 篇 cloud computing
140 篇 computer network...
129 篇 multimedia compu...
126 篇 multimedia
118 篇 next generation ...
115 篇 computer archite...
109 篇 internet
106 篇 wireless network...
105 篇 delay
101 篇 computer science

机构

53 篇 graduate institu...
44 篇 department of co...
31 篇 state key labora...
31 篇 department of co...
31 篇 natl taiwan univ...
27 篇 natl taiwan univ...
18 篇 institute of inf...
17 篇 beijing univ pos...
13 篇 faculty of compu...
11 篇 wuhan univ natl ...
11 篇 graduate institu...
8 篇 beijing key labo...
8 篇 acad sinica inst...
8 篇 natl taiwan univ...
8 篇 natl taiwan univ...
8 篇 faculty of engin...
8 篇 institute of inf...
8 篇 wuhan univ sch c...
8 篇 faculty of elect...
8 篇 laboratory of mu...

作者

26 篇 wu jan-jan
26 篇 liu pangfeng
20 篇 shih chi-sheng
20 篇 pangfeng liu
19 篇 ruimin hu
19 篇 jan-jan wu
18 篇 hu ruimin
17 篇 kuo tei-wei
13 篇 chu hao-hua
13 篇 tei-wei kuo
12 篇 tai-hoon kim
11 篇 xu changqiao
10 篇 chung-ming huang
10 篇 hung yi-ping
10 篇 zhang xi
10 篇 hsu jane yung-je...
9 篇 chan li-wei
9 篇 shojiro nishio
9 篇 pang ai-chun
9 篇 lin ching-chi

语言

2,871 篇 英文
28 篇 其他
21 篇 中文
2 篇 葡萄牙文

检索条件"任意字段=Conference on Multimedia Computing and Networking"

共 2921 条记录，以下是981-990 订阅

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

详细简洁

排序：

SCALE ME, CROP ME, KNOW ME NOT: SUPPORTING SCALING AND CROPPING IN SECRET IMAGE SHARING

SCALE ME, CROP ME, KNOW ME NOT: SUPPORTING SCALING AND CROPP...

引用

IEEE International conference on multimedia and Expo Workshops (ICMEW)

作者： Mohanty, Manoranjan Ooi, Wei Tsang Atrey, Pradeep K. Natl Univ Singapore Dept Comp Sci Singapore 117548 Singapore Univ Winnipeg Dept Appl Comp Sci Winnipeg MB Canada

ISBN: (纸本)9781479900152

Secret image sharing is a method for distributing a secret image amongst n data stores, each storing a shadow image of the secret, such that the original secret image can be recovered only if any k out of the n shares is available. Existing secret image sharing schemes, however, do not support scaling and cropping operations on the shadow image, which are useful for zooming on large images In this paper, we propose an image sharing scheme that allows the user to retrieve a scaled or cropped version of the secret image by operating directly on the shadow images, therefore reducing the amount of data sent from the data stores to the user. Results and analyses show that our scheme is highly secure, requires low computational cost, and supports a large number of scale factors with arbitrary crop.

关键词： Secret Image Sharing Cloud computing Social networking Image Scaling and Cropping

来源：评论

学校读者我要写书评

暂无评论

Online travel destination recommendation with efficient variable memory Markov model

Online travel destination recommendation with efficient vari...

引用

2013 IEEE International conference on multimedia and Expo Workshops, ICMEW 2013

作者： Kai, Jiang Yu, Nenghai Li, Weihai MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China Hefei China

ISBN: (纸本)9781479916047

Online travel destination recommendation is to keep track of a user's current traveling history to recommend next destination in real time while the user is on the travel. This paper presents an efficient variable memory Markov model based method to provide such recommendation. The proposed method utilizes the large quantity of geotags from photo sharing website and combines travel pattern, location's popularity and distance factors to generate real time recommendation. Experiments on Panoramio data set demonstrate the effectiveness of this method. © 2013 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

QoS-driven Autonomic Abilities through a Multi-homed Transport Protocol

QoS-driven Autonomic Abilities through a Multi-homed Transpo...

引用

IEEE 27th International conference on Advanced Information networking and Applications (IEEE AINA)

作者： Diop, Code Mezghani, Emna Exposito, Ernesto Chassot, Christophe Drira, Khalil CNRS LAAS F-31077 Toulouse France

ISBN: (纸本)9781467355506;9780769549538

With the development of Internet technologies, distributed and multimedia applications are more and more used. Because these applications have Quality of Service (QoS) expectations (bounded delay, guaranteed bandwidth, etc.), a set of QoS oriented protocols aimed at aiding end-to-end communications are proposed. Each one of these protocols offers one or several mechanisms. Selecting the best protocol with the best mechanism(s) according to the application requirements and network contexts is a challenge if we want to provide enough QoS to the final users. Also because contexts can evolve, for example when network characteristics change, the previous selected protocol can become obsolete. In this context, an adaptation is mandatory. In this paper, we show how the OSI transport layer can become autonomic in order to perform dynamically reconfiguration actions when it is needed. Our approach consists in including at the transport layer the MAPE loop of the autonomic computing proposal to monitor and analyze the communication in order to predict or to detect a QoS degradation induced by changes of network context, and to plan and execute dynamically new reconfiguration actions in order to keep the communication at the expected QoS level. To implement and evaluate our approach, we extend the new Multipath-TCP (MPTCP) protocol, which offers an extensible application oriented layer. This layer gives opportunity to deploy QoS-aware mechanisms. The test results show that the consumption time of autonomic selection and composition of these mechanisms at run time does not prevent enhancing the QoS, and encourage us to continue working in this approach.

关键词： Quality of Service Communication systems Multipath Transport protocol Autonomic computing Semantic

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the International conference on Frontiers of Intelligent computing: Theory and Applications (FICTA) 2013

引用

2013年

作者： Suresh Chandra Satapathy Siba Kumar Udgata Bhabendra Narayan Biswal

ISBN: (纸本)9783319029306

This volume contains the papers presented at the Second International conference on Frontiers in Intelligent computing: Theory and Applications (FICTA-2013) held during 14-16 November 2013 organized by Bhubaneswar Engineering College (BEC), Bhubaneswar, Odisha, India. It contains 63 papers focusing on application of intelligent techniques which includes evolutionary computation techniques like genetic algorithm, particle swarm optimization techniques, teaching-learning based optimization etc for various engineering applications such as data mining, Fuzzy systems, Machine Intelligence and ANN, Web technologies and multimedia applications and Intelligent computing and networking etc.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unity: Collaborative Downloading Content Using Co-located Socially Connected Peers

<i>Unity</i>: Collaborative Downloading Content Using Co-loc...

引用

IEEE International conference on Pervasive computing and Communications Workshops (PERCOM Workshops)

作者： Jassal, Prateek Yadav, Kuldeep Kumar, Abhishek Naik, Vinayak Narwal, Vishesh Singh, Amarjeet IIIT D New Delhi India

ISBN: (纸本)9781467350778;9781467350754

Large proliferation of mobile phone applications result in extensive use of data intensive services such as multimedia download and social network communication. With limited penetration of 3G/4G networks in developing countries, it is common to use low bandwidth 2G services for data communication, resulting in larger download time and correspondingly high power consumption. In this paper, we present a system architecture, Unity, that enables collaborative downloading across co-located peers. Unity uses short range radio interfaces such as Bluetooth/WiFi for local coordination, while the actual content is downloaded using a cellular connection. Unity is designed to support mobile phones with diverse capabilities. End-to-end implementation and evaluation of Unity on Android based phones, with varying workload sizes and number of peers, show that Unity can result in multifold increase in download rate for the co-located peers. We also describe architecture of cloud-based Unity which uses principles of mobility prediction, social interactions, and opportunistic networking to make collaboration more pervasive and useful.

关键词： cloud computing content management groupware smart phones ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

multimedia contents dissemination with gossip algorithms in distributed social networks 13

Multimedia contents dissemination with gossip algorithms in ...

引用

5th International conference on Internet multimedia computing and Service, ICIMCS 2013

作者： Yang, Bo Zhu, Guangxi Wu, Weimin Wuhan National Libratory for Optoelectronics Huazhong University of Science and Technology Wuhan 430074 China Electronics and Information Engineering Department Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781450322522

This paper studies the dissemination of multimedia contents in distributed social networks, which are composed of a set of smart handsets. Gossip algorithms are used to spread social multimedia contents in a decentralized way with robustness and simplicity. The performance of gossip algorithms is analyzed and an upper bound on the convergence time is obtained. Simulation results show that each user requires only about 12 iterations on average to obtain 100 contents in the network and the communication cost for each user does not grow when the scale of the network becomes larger. The dynamic topology of the network due to mobility is considered as well, which is proved to be able to significantly reduce the communication cost. © 2013 ACM.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Data Replication for Distributed Graph Processing

Data Replication for Distributed Graph Processing

引用

IEEE 6th International conference on Cloud computing (CLOUD)

作者： Ho, Li-Yung Wu, Jan-Jan Liu, Pangfeng Natl Taiwan Univ Dept Comp Sci & Informat Engn Acad Sinica Inst Informat Sci Taipei 10764 Taiwan Res Ctr Informat Technol Innovat Acad Sinica Inst Informat Sci Taipei 10764 Taiwan Natl Taiwan Univ Grad Inst Networking & Multimedia Dept Comp Sci & Informat Engn Taipei Taiwan

ISBN: (纸本)9780769550282

We present a data replication framework for distributed graph processing. First we partition a graph and store each partition in a machine. Then we replicate all partitions and assign replicas to machines, where each machine can store only a limited number of replicas. The goal is to replicate the partitions so that each partition has at least a certain number of replicated copies, and the cost is minimized. The cost is defined as the data traffic data traffic needed to run general graph processing algorithms. The cost metric is the overall transmission cost of all machines, and the maximum transmission cost of a single machine. We propose an optimal algorithm based on linear programming to solve the problem of minimizing the overall transmission cost. We also propose an optimal algorithm to solve a special problem of minimizing the maximum transmission cost of a node.

关键词： algorithm data replication binary integer programming minimum cost flow totally unimodular social networks

来源：评论

学校读者我要写书评

暂无评论

Micro-Blogging Content analysis via emotionally-Driven Clustering

Micro-Blogging Content analysis via emotionally-Driven Clust...

引用

5th Biannual conference of the Humaine-Association on Affective computing and Intelligent Interaction (ACII)

作者： Chatzakou, Despoina Koutsonikola, Vassiliki Vakali, Athena Kafetsios, Konstantinos Aristotle Univ Thessaloniki Dept Informat Thessaloniki 54124 Greece Univ Crete Dept Psychol Rethimnon GR-74100 Greece

ISBN: (纸本)9780769550480

Microblogging has become commonplace and created new methods of communication, contributing significantly to information sharing. This holds since microblogging focuses on sharing content while building social relations among people who share the same interests and/or activities. In this context, people's perception and emotions towards a specific subject is a valuable piece of information and sentiment and affective analysis play an important role. In this paper, an affective analysis methodology is proposed, which is a lexicon-based technique, for capturing the wisdom of crowds, as well as the social pulse and the trends, through the more accurate assessment of human emotion states. The methodology adopted involves the monitoring of the emotions' intensity, i.e. how strong or weak the emotional states of the published information are. The results suggest that the proposed approach manages to efficiently capture people's emotions as these were recorded in datasets derived from Twitter.

关键词： content management pattern clustering social networking (online) text analysis

来源：评论

学校读者我要写书评

暂无评论

A LOG DATA TRANSMISSION ALGORITHM BASED ON FILE SPLITTING AND CACHE MATCHING

A LOG DATA TRANSMISSION ALGORITHM BASED ON FILE SPLITTING AN...

引用

5th IEEE International conference on Broadband Network & multimedia Technology (IC-BNMT)

作者： Ma, Saimu Wang, Jing Zhang, Lei Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

ISBN: (纸本)9781479900930

The log file for recording events in a cloud platform is maintained by a computer server and generally contains large amounts of data. As networks and transmission are becoming increasingly important for computational science, we are working on proposing a log file transmission algorithm. This new algorithm focuses on optimizing the performance of log file transmission, which is independent of transport protocols. Our approach includes two components: the file splitting and buffer match. The file splitting performs file compression and redundancy elimination, and the buffer memory match avoids transferring the redundant data. Experimental results verify that the log file transmission algorithm can effectively eliminate the redundancy in the log file and reduce the amount of data transmission by 90%.

关键词： File transmission Fingerprint Redundancy elimination Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Constructing trip routes with user preference from location check-in data

Constructing trip routes with user preference from location ...

引用

2013 ACM conference on Ubiquitous computing, UbiComp 2013

作者： Hsieh, Hsun-Ping Li, Cheng-Te Graduate Institute of Networking and Multimedia National Taiwan University Taipei Taiwan Taiwan

ISBN: (纸本)9781450322157

This paper presents a novel trip route construction using location check-in data. Given a set of preference lists of locations from users, we aim to coordinate their preferred locations to visit and construct a route which not only satisfying user preferences as many as possible, but also being popular and reasonable. We formulate such preferred route construction as an optimization problem. We solve it efficiently and effectively by devising some greedy methods. Experiments on Gowalla large-scale check-in data show the promising effectiveness and efficiency of our methods.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共293页 << < 95 96 97 98 99 100 101 102 103 104 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：