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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

314 篇 multimedia commu...
257 篇 quality of servi...
252 篇 streaming media
238 篇 mobile computing
232 篇 multimedia syste...
187 篇 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
119 篇 next generation ...
116 篇 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,843 篇 英文
63 篇 其他
21 篇 中文
2 篇 葡萄牙文

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

共 2928 条记录，以下是1391-1400 订阅

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

详细简洁

排序：

Quality evaluation for real-time 3D video services

Quality evaluation for real-time 3D video services

引用

IEEE International conference on multimedia and Expo (ICME)

作者： Chaminda T.E.R. Hewage Maria G. Martini Wireless Multimedia & Networking Research Group Faculty of Computing Information Systems and Mathematics Kingston University London UK

3D video adds the sensation of depth to conventional video in order to provide better natural viewing conditions for users. However, 3D video communication applications are in its early stage due to limitations of channel bandwidth and to the packet losses and errors due to congestion and bad channel conditions. In order to provide a better service to 3D video users, the compression and transmission system parameters can be changed "on the fly". The measured 3D video quality at the receiver-side can be used as feedback information to fine tune the system. This paper proposes a quality evaluation method for real-time trans mission of 3D video depth maps associated with colour plus depth based 3D video. The extracted edge information together with luminance and contrast information are employed to evaluate the quality degradation in this method. This work is motivated by the fact that edges and contours of the depth map can represent different depth levels and hence can be used in measuring the structural degradation of 3D depth maps. The performance of the method is evaluated across a range of compression levels and PLRs (Packet Loss Rates) and shows accurate results compared to its counterpart Full-Reference (FR) quality metric.

关键词： Three dimensional displays Image edge detection Measurement Correlation Streaming media Degradation Data mining

来源：评论

学校读者我要写书评

暂无评论

Job sequence scheduling for cloud computing

Job sequence scheduling for cloud computing

引用

International conference on Cloud and Service computing (CSC)

作者： Yung-Ching Hsu Pangfeng Liu Jan-Jan Wu Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Department of Computer Science and Information Engineering Graduate Institute of Networking and Multimedia National Taiwan University Taipei Taiwan Institute of Information Science Academia Sinica Taipei Taiwan

This paper describes the important issue of energy conservation for data centers. We consider the problem of provisioning physical servers to a sequence of jobs, and reducing the total energy consumption. The performance metric is the wasted energy - the over-provisioned computing power provided by the physical servers, but exceeding the requirement of the jobs. We propose three new strategies for allocating servers to a sequence of jobs - a largest machine first heuristic, a best fit method, and a mixed method. We prove that both the largest machine first heuristic and the mixed method will only incur at most 2 in over-provisioned energy. That is, the ratio between the over-provisioned energy and the total provisioned energy is bounded by 2/n(1 + δ), where n is the number of jobs, and 1 + δ is the ratio between the maximum and minimum execution time of jobs. We also derive a tight bound of i on the ratio of wasted energy if the ratio 5 could be arbitrarily large. We also conduct experiments to compare the three algorithms in practice. The experiment results indicate that all three algorithms waste very little energy in over-provision. The mixed method outperforms the best fit method, which outperforms the largest machine first method.

关键词： Program processors Servers Virtual machining Processor scheduling Cloud computing Resource management Energy conservation

来源：评论

学校读者我要写书评

暂无评论

A Real-Data-Stimulated Simulation Assessment Method for P2P-Assisted Telecom IPTV Systems

A Real-Data-Stimulated Simulation Assessment Method for P2P-...

引用

International conference on Network computing and Information Security (NCIS)

作者： Xiuyan Jiang Yinshu Pu Yuan Liu Dejian Ye Guanzhong Lv Qing Xiao Multimedia and Networking Laboratory School of Software Fudan University Shanghai China China Telecom Group Shanghai Company Limited Shanghai China

With China Telecom IPTV system rapidly expanding, reducing operating and deployment costs has become an important issue. To improve IPTV transmission efficiency, using P2P technology is one of the possible solutions. This paper presents a new real-data-stimulated simulation assessment method for P2P-assisted telecom IPTV systems. The new method first proposes a set of performance metrics and primitives to evaluate the system, secondly it analyzes the real topology and actual user behaviors of Shanghai Telecom IPTV system, thirdly it builds a large-scale simulation system RVSPS, and stimulates the simulation system with real topology and actual user behaviors, then it analyzes the impact that various primitives have on the performance metrics. The simulation results show that this method can effectively evaluate the performance of the P2P-assisted telecom IPTV system.

关键词： IPTV Telecommunications Streaming media Topology Measurement Analytical models Servers

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient Virtual Machine Provision Algorithms for Cloud Systems

Energy-efficient Virtual Machine Provision Algorithms for Cl...

引用

IEEE International conference on Utility and Cloud computing (UCC)

作者： Ching-Chi Lin Pangfeng Liu Jan-Jan Wu Institute of Information Science Academia Sinica Taipei Taiwan Department of Computer Science and Information Engineering Graduate Institute of Networking and Multimedia National Taiwan University Taipei Taiwan

Power consumption is one of the most critical problems in data centers. One effective way to reduce power consumption is to consolidate the hosting workloads and shut down physical machines which become idle after consolidation. Server consolidation is a NP-hard problem. In this paper, we propose two new algorithms, Dynamic Round-Robin (DRR) and Hybrid, which combines DRR and First-Fit, for energy aware virtual machine scheduling and consolidation. We also propose an accurate power model to estimate the power consumption resulted from each algorithm. Strategies we proposed are compared with GREEDY, ROUNDROBIN and POWERSAVE scheduling strategies implemented in the Eucalyptus Cloud system. Our experiment results show that our DRR and Hybrid algorithms reduce power consumption by 56.4% and 55.9% respectively, compared with the ROUNDROBIN scheduling strategy in Eucalyptus. DDR and Hybrid also result in 3% less power consumption on average, compared with the POWERSAVE scheduling strategy in Eucalyptus.

关键词： Virtual machining Power demand Energy consumption Servers Mathematical model Retirement Load modeling

来源：评论

学校读者我要写书评

暂无评论

Peer to peer content sharing on ad hoc networks of smartphones

Peer to peer content sharing on ad hoc networks of smartphon...

引用

International Wireless Communications and Mobile computing conference, IWCMC

作者： Piotr K. Tysowski Pengxiang Zhao Kshirasagar Naik Department of Electrical & Computer Engineering University of Waterloo Waterloo ONT Canada

Peer-to-peer networks offer advantages over traditional client-server networking models, such as the lack of a need for connectivity to trusted intermediary hosts or servers and the use of less costly communication links. While they have become popular in the wired broadband environment, they have not yet been effectively adapted to the resource-constrained mobile network environment. They promise significant potential in applications such as the sharing of files like multimedia and operating system updates between mobile devices. However, the peer-to-peer model faces unique challenges in the mobile context, such as limitations on processing power, on-board device memory, wireless data bandwidth, and available battery energy. We propose a high-level framework for a peer-to-peer protocol with these specific constraints addressed. In addition, we investigate the feasibility of a practical implementation of a peer-to-peer file sharing model on smartphones, including an analysis of how performance is impacted by various variables that can be dynamically controlled in the protocol. Through experimentation on leading smartphones, we have found various optimal strategies, including minimizing the upload-to-download ratio to conserve battery life, using larger file segments to increase throughput, and using sockets to decrease memory overhead.

关键词： Peer to peer computing Mobile communication Smart phones Bluetooth Protocols Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Optimal Algorithms for Cross-Rack Communication Optimization in MapReduce Framework

Optimal Algorithms for Cross-Rack Communication Optimization...

引用

IEEE International conference on Cloud computing, CLOUD

作者： Li-Yung Ho Jan-Jan Wu Pangfeng Liu Institute of Information Science Academia Sinica Taipei Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Graduate Institute of Networking and Multimedia National Taiwan University Taipei Taiwan

MapReduce is a widely used data-parallel programming model for large-scale data analysis. The framework is shown to be scalable to thousand of computing nodes and reliable on commodity clusters. However, research has shown that there is room for performance improvement of the MapReduce framework. One of the main performance bottlenecks is caused by the all-to-all communication between mappers and reducers, which may saturate the top-of-rack switch and inflate job execution time. Reducing cross-rack communication will improve job performance. In current MapReduce implementation, the task assignment is based on the pull-model, in which cross-rack traffic is difficult to control. In contrast, the MapReduce framework allows more flexibility in assigning reducers to the computing nodes. In this paper, we investigate the reducer placement problem (RPP), which considers the placement of reducers to minimize cross-rack traffic. We devise two optimal algorithms to solve RPP and implement the algorithms in the Hadoop system. We also propose an analytical solution for this problem. Our experiment results with a set of MapReduce applications show that our optimization achieves 9% to 32%performance improvement compared with the unoptimized Hadoop.

关键词： Silicon Optimization Greedy algorithms Switches Data models Manganese Equations

来源：评论

学校读者我要写书评

暂无评论

Next generation protocol for P2P SIP communication

Next generation protocol for P2P SIP communication

引用

International conference on Computer Applications and Industrial Electronics (ICCAIE)

作者： Muhammad Farhan Khan Muhammad Imran Khan Department of Communications and Networking Aalto University of Science and Technology Espoo Finland Department of Electrical and Computer Engineering Ryerson University Toronto Canada

Session initiation protocol (SIP) is a well-known protocol that is used to provide voice over IP (VoIP) signaling and multimedia services in today's evolving Internet. With the popularity of peer-to-peer (P2P) system, it is envisioned to use SIP in P2P networks, to increase the communication flexibility without a centralized organization and control. The REsource LOcation And Discovery (RELOAD) protocol is used to facilitate SIP signaling in the P2P overlay network. RELOAD with interactive connectivity establishment (ICE) functionality in P2P SIP is used to improve the performance of the SIP under varying network conditions. The aim of this paper is to examine the ICE working mechanism in P2P SIP and explain the operational functionality of ICE in a P2P SIP overlay networking environment. Also, this paper discusses different working methods, challenges and problems that are used by the RELOAD protocol for establishing peer-to-peer SIP connections.

关键词： Protocols Peer to peer computing Ice Servers Internet Force IP networks

来源：评论

学校读者我要写书评

暂无评论

General Pattern Discovery for Development of Social Game-Based Learning: A Case Study from Games in Facebook

General Pattern Discovery for Development of Social Game-Bas...

引用

IEEE International conference on Ubi-Media computing

作者： Man-Ning Lee Martin M. Weng Chih-Hao Lin Zhao-Heng Ma Jen-Chih Lin Li-Chieh Lin Department of Digital Technology Design National Taipei University of Education Taipei Taiwan Department of CSIE Tamkang University Taipei Taiwan Department of Applied Informatics and Multimedia Asia University Taichung Taiwan Industrial Vocational High School National San-chung Commercial Taipei Taiwan Digital Education Institute Institute for Information Industry Taipei Taiwan

An emerging paradigm, social game for learning, has revealed the increasingly development of social networking. However, the feasibility of mentioned approach shall be verified via a continuous and rigorous way to data analysis. In this research, we pay emphasis on discovering the possible general pattern for development of social game for learning. Two major types of social games, simulation games and social games, were adopted. The Triangulation method theory and flowchart were utilized to form the characteristics from and between two types of games. The similarity and diversity of characteristics can be obtained through comparing the factors such as behavior, accumulations of experience, collections of items and tasks, and etc. As a contribution, the discovered pattern can be applied onto the design of social learning games by integrating customized factors. The result will be provided as suggestions when developing the related social games with educational purposes.

关键词： Games Facebook Heart Marine animals Agriculture Flowcharts

来源：评论

学校读者我要写书评

暂无评论

Efficient Big Brother networks

Efficient Big Brother networks

引用

Eurocon

作者： Filipe Cabral Pinto António Videira Athen Ma Laurie Cuthbert Instituto de Telecommunicações Aveiro Portugal Queen''s Mary University of London London UK Portugal Telecom Inovação S. A. Aveiro Portugal

The growing popularity of multimedia group communications requires evolved networking technologies to provide rich-media content to groups of users in the most effective way. 3GPP (3rd Generation Partnership Project) has specified MBMS (multimedia Broadcast Multicast Service) to enable broadcasting and multicasting packet data in UMTS (Universal Mobile Telecommunication System) networks to large user groups. Furthermore, the LTE/SAE (Long Term Evolution / Service Architecture Evolution) specification has evolved MBMS in order to provide broadcast connections over the EPS (Evolved Packet System) architecture. Context, understood as any information that modifies over time, can be used to improve systems' efficiency. Mobile Operators already use location-based information to deliver more accurate content to their clients. But context may have an emphasized role when dealing with communications' groups. Context information shall be used to increase the system effectiveness while augmenting the user experience. This paper introduces the required evolutions towards an architecture where context information is taken into account to improve MBMS and E-MBMS (Evolved MBMS) services allowing an effective multimedia content delivery to mobile users' communities. But are the clients willing to let Mobile Operators know everything about them even if this knowledge is used to meet their needs? Are we ready to have a Big Brother Mobile Network which is always watching us?

关键词： Context Mobile communication multimedia communication Mobile computing Forward error correction Sensors Cognition

来源：评论

学校读者我要写书评

暂无评论

Server Consolidation Algorithms with Bounded Migration Cost and Performance Guarantees in Cloud computing

Server Consolidation Algorithms with Bounded Migration Cost ...

引用

IEEE International conference on Utility and Cloud computing (UCC)

作者： Yufan Ho Pangfeng Liu Jan-Jan Wu Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Department of Computer Science and Information Engineering Graduate Institute of Networking and Multimedia National Taiwan University Taipei Taiwan Institute of Information Science Academia Sinica Taipei Taiwan

Consolidation of virtual machines is essential to achieve energy optimization in cloud computing environments. As virtual machines dynamically enter and leave a cloud system, it becomes necessary to relocate virtual machines among servers. However, relocation of virtual machines introduces run-time overheads and consumes extra energy, thus an careful planning for relocation is necessary. We model the relocation problem as a modified bin packing problem and propose a new server consolidation algorithm that guarantees server consolidation with bounded relocation costs. We also conduct a detailed analysis on the complexity of the server consolidation problem, and give a upper bound on the cost of relocation. Finally, we conduct simulations and compare our server consolidation algorithm with other relocation methods, like First Fit and Best Fit method. The experiment results suggest an interesting trade-off between server consolidation quality and relocation cost. Our algorithm is able to trade about 1% in server consolidation quality for a reduction about 50% in relocation cost, when compared with other well known bin packing algorithms. We also note that the relocation cost incurred in our method is much less than the theoretical bound we provided. The reason is that we overestimate the amount of relocation from theoretical analysis, and the actual amount of relocation found from experiments is much less than the worst-case bound from theoretical analysis.

关键词： Servers Virtual machining Heuristic algorithms Algorithm design and analysis Cloud computing Computational modeling Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共293页 << < 136 137 138 139 140 141 142 143 144 145 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：