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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,739 篇 会议
23 篇 期刊文献
7 册 图书

馆藏范围

1,769 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,208 篇 工学
- 1,099 篇 计算机科学与技术...
- 696 篇 软件工程
- 222 篇 信息与通信工程
- 164 篇 电气工程
- 122 篇 电子科学与技术（可...
- 98 篇 控制科学与工程
- 82 篇 生物工程
- 61 篇 动力工程及工程热...
- 49 篇 机械工程
- 46 篇 生物医学工程（可授...
- 32 篇 交通运输工程
- 31 篇 光学工程
- 29 篇 仪器科学与技术
- 25 篇 环境科学与工程（可...
- 24 篇 化学工程与技术
- 21 篇 网络空间安全
- 18 篇 安全科学与工程
- 17 篇 力学（可授工学、理...
498 篇 理学
- 321 篇 数学
- 96 篇 生物学
- 83 篇 系统科学
- 78 篇 物理学
- 72 篇 统计学（可授理学、...
- 34 篇 化学
270 篇 管理学
- 183 篇 管理科学与工程(可...
- 121 篇 图书情报与档案管...
- 116 篇 工商管理
62 篇 医学
- 55 篇 临床医学
36 篇 法学
- 35 篇 社会学
32 篇 经济学
- 32 篇 应用经济学
8 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

198 篇 computer archite...
80 篇 hardware
79 篇 computational mo...
66 篇 high performance...
57 篇 cloud computing
50 篇 grid computing
41 篇 distributed comp...
41 篇 field programmab...
40 篇 bandwidth
37 篇 kernel
37 篇 graphics process...
34 篇 resource managem...
34 篇 computer network...
33 篇 performance eval...
32 篇 throughput
31 篇 computer science
31 篇 application soft...
31 篇 analytical model...
30 篇 program processo...
29 篇 supercomputers

机构

26 篇 college of compu...
19 篇 university of ch...
14 篇 school of comput...
10 篇 college of compu...
9 篇 school of comput...
9 篇 college of compu...
8 篇 school of comput...
7 篇 school of data a...
7 篇 school of comput...
7 篇 institute of com...
6 篇 computer network...
6 篇 tsinghua univers...
6 篇 school of cyber ...
6 篇 changsha univers...
5 篇 university of sc...
5 篇 skl of computer ...
5 篇 computer science...
5 篇 school of comput...
5 篇 hubei province k...
5 篇 zhongguancun lab...

作者

11 篇 duan yucong
7 篇 zhang tao
7 篇 li kenli
7 篇 xu xiaolong
6 篇 wang wei
6 篇 gao guang r.
5 篇 li peng
5 篇 yunquan zhang
5 篇 liu qin
5 篇 wang dong
5 篇 bader david a.
5 篇 liu ruicheng
5 篇 zhang rui
5 篇 wan shouhong
5 篇 wu jigang
5 篇 panda dhabaleswa...
5 篇 zhang jie
5 篇 wang xiaoliang
5 篇 chen long
5 篇 li wei

语言

1,714 篇 英文
51 篇 其他
3 篇 中文
1 篇 波兰文

检索条件"任意字段=21st International Symposium on Computer Architecture and High Performance Computing"

共 1769 条记录，以下是751-760 订阅

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

详细简洁

排序：

Combined crowdsourcing task auction mechanism based on stable matching 21

Combined crowdsourcing task auction mechanism based on stabl...

引用

21st IEEE international Conference on high performance computing and Communications, 17th IEEE international Conference on Smart City and 5th IEEE international Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Zhang, Lanyu Xiao, Mingjun Zhao, Hui Liu, Jianchun School of Computer Science and Technology Suzhou Institute for Advanced Study University of Science and Technology of China China

ISBN: (纸本)9781728120584

Crowdsourcing allows requester to allocate tasks to a group of workers on the internet to make use of their collective intelligence. In this paper, we consider the complementarity among different types of tasks, which means the cost of a worker to complete a task combination is less than the sum of the costs that the worker completes each task in the combination separately. In the crowdsourcing, task assignment is one of the most essential problems, we formulate the crowdsourcing task assignment as a many-to-many matching problem. However, most existing works ignore the preferences of crowdsourcers and workers. Since both of workers and crowdsourcers are selfish individuals who are not necessarily aligned with the system optimization. They can violate the task assignment to obtain a higher utility. Different from the traditional task assignment mechanisms which focus on social welfare maximization, we not only consider the preferences of crowdsourcers and workers, but also obtain a stable matching result for the many-to-many matching problem. Payment determination is also a essential problem in the crowdsourcing system, so we compute the corresponding payment profiles for both crowdsourcers and workers. Extensive simulations have been performed, and the result demonstrates that our proposed mechanism not only obtains a stable matching but also has a high individual utility for each worker and each crowdsourcer. Workers and crowdsourcers would comply with the allocation results. © 2019 IEEE.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

An empirical study of chunk size variation in DASH system 21

An empirical study of chunk size variation in DASH system

引用

作者： Wang, Bo Ren, Fengyuan Beijing National Research Center Information Science and Technology Beijing China Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9781728120584

Most video players use Dynamic Adaptive streaming over HTTP (DASH) to ensure high Quality of Experience (QoE) in varying network conditions. To improve the encoding efficiency, streaming providers use Variable BitRate (VBR) encoding for video contents, where the video chunks with the same nominal bitrate (video quality) have different instantaneous bitrates and chunk sizes. However, the chunk size variation is assumed to be trivial compared with the network bandwidth variation, and existing bitrate adaptation algorithms simply use the nominal information to make bitrate decisions. In this paper, we present an empirical study of chunk size variation in DASH to explore whether the algorithm can ignore this stochastic factor. We measure the characteristics of chunk size variation based on a rich set of videos and analyze its impact on QoE by trace-driven experiments. Analysis results show that all the buffer-aware algorithms suffer from degraded QoE if they do not consider the chunk size variation. To eliminate the negative impact, we suggest that the bitrate adaptation algorithm should rely on exact chunk size to adjust bitrate instead of the nominal bitrate. To confirm our insights and suggestion, a preliminary solution is proposed and validated based on a real video player and realistic bandwidth traces. © 2019 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

CFADefense: A security solution to detect and mitigate crossfire attacks in software-defined iot-edge infrastructure 21

CFADefense: A security solution to detect and mitigate cross...

引用

作者： Rafique, Wajid He, Xin Liu, Zifan Sun, Yuhu Dou, Wanchun State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9781728120584

Managing the Internet of Things (IoT) infrastructure has become a critical challenge due to an enormous increase in the connected devices and the lack of available security solutions. Software-Defined Networking (SDN) has been extensively involved in network infrastructure management. Moreover, numerous recent studies demonstrate the use of SDN for managing IoT networks. In SDN, policy consistency and security of the data plane is maintained through Waypoint Enforcement (WPE) which ensures that the traffic traverses policy nodes/switches to implement high-level network requirements. Previous studies on SDN primarily secure SDN infrastructure against traditional Distributed Denial of Service (DDoS) attacks. However, we investigate Crossfire Attack (CFA), which is a novel DDoS attack capable of interrupting communication of data plane switches using low-rate legitimate traffic. CFA has the potential to isolate policy switch from the rest of the data plane devices which introduces many security anomalies and routing inconsistencies. We first demonstrate how CFA is lethal on policy switch attacks and then present the design and implementation of a novel CFA countermeasure called CFADefense, which employs link selection, attack detection, and malicious flows interception modules. CFADefense has been developed as an application at the application layer of the open-source Floodlight controller. Our evaluation demonstrates that CFADefense accurately detects and efficiently mitigates CFA and poses minimal overhead on the controller in dealing with this attack. © 2019 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

TBSW: Time-based sliding window algorithm for network traffic measurement 21

TBSW: Time-based sliding window algorithm for network traffi...

引用

作者： Hang, Zijun Shi, Yang Wen, Mei Zhang, Chunyuan National University of Defense Technology School of Computer Science Changsha China

ISBN: (纸本)9781728120584

Network traffic measurement is vital to network applications such as network anomalies detection, capacity planning, and congestion alleviation. Traditional switches sample a small portion of packets and send them to CPU for analysis. However, with sampling rates as low as 0.1%, sampling methods are inaccurate. Faced with the predicament, emerging programmable switches achieve measure functionality to a certain extent. Nevertheless, existing methods depend on CPU to drain and clear the records periodically, which brings in too much communication latency. To avoid disadvantages above and explore the processing ability of modern programmable switches, we proposed a time-based measuring algorithm named TBSW. TBSW is designed to measure the number of packets during an interval accurately with little hardware resource usage. To the best of our knowledge, TBSW is the first to utilize the time information for network traffic measurement. We prototype TBSW in P4 language and run it on Barefoot Tofino switch. Results showed TBSW achieves high efficiency and moderate accuracy at line speed. © 2019 IEEE.

关键词： Software defined networking

来源：评论

学校读者我要写书评

暂无评论

A learning-based vehicle-trajectory generation method for vehicular networking 21

A learning-based vehicle-trajectory generation method for ve...

引用

作者： Zhao, Liang Liu, Yufei Al-Dubai, Ahmed Tan, Zhiyuan Min, Geyong Xu, Lexi School of Computer Science Shenyang Aerospace University China School of Computing Edinburgh Napier University United Kingdom College of Engineering Mathematics and Physical Sciences University of Exeter United Kingdom China Unicom Beijing China

ISBN: (纸本)9781728120584

With the rapid development of mobile applications, networking technologies have been constantly evolved to offer a more convenient way of sharing information and online-communication anytime and anywhere. Vehicular networks have the potential to become one of the important carriers of future mobile networks. The performance of current vehicular networks has been widely evaluated through simulation experiments due to the high cost and impracticality of other experimental approaches. The most paramount factors of vehicle networks are the authenticity of simulative evaluation, where the mobility of the vehicles is the first significant feature (i.e., the nodes of the vehicular network) that must be properly considered. However, generating the corresponding real mobility datasets has always been a big challenge although it is vital to the simulations of vehicular networks. Therefore, in this paper, we propose a learning-based generation method that can be used to build the vehicle-trajectory data for variety of vehicle densities. Firstly, with analyzing the road bayonet data, we obtain the hidden pattern between road traffic and time. Secondly, we deploy Vissim (a well-known traffic simulator) to generate the experimental data by considering the urban functional areas for the origins of vehicles. The generated experimental data are learned by Extreme Learning Machine (ELM), and the weight matrix of the parameters is obtained, which presents the impact of the experimental parameters on the simulation results. We prove the effectiveness of our method by comparing the generated vehicle-trajectory datasets with the vehicle density predicted by the weight matrix and the realistic traffic flow model. © 2019 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Resource-aware availability enhancement mechanism of riak TS 21

Resource-aware availability enhancement mechanism of riak TS

引用

作者： Ye, Feng Liu, Zihao Wang, Zhijian Zhang, Peng Huang, Qian Chen, Yong College of Computer and Information Hohai Univercity Nanjing China College of Computer Jiangsu University of Science and Technology Zhenjiang China Jiangsu Water Resources Department Nanjing China Nanjing Longyuan Micro-Electronic Company Nanjing China

ISBN: (纸本)9781728120584

The dependability of various NoSQL stores in critical application is still worth studying. Currently, cluster and backup technologies are common ways to improve the availability of NoSQL, but with little consideration for availability reduction in case of performance bottlenecks. To improve the availability of Riak TS effectively, a resource-aware availability enhancement mechanism is proposed. At first, the data is sampled according to time to obtain the correspondence between time and data. Meanwhile, the real-time resource consumption is recorded by Prometheus. Based on the sampling results, the prediction model is established. Then the resources required for the upcoming operation are predicted according to the time interval in the SQL statement, and the operation is evaluated by comparing with the remaining resources. Using the real hydrological sensor dataset as experimental data, the effectiveness of the mechanism is evaluated in terms of sensitivity, specificity and average availability, respectively. The results show that, through the availability enhancement mechanism, the specificity reaches 98.04%, and the sensitivity reaches 95.67%. The average availability has been raised from 40.33% to 95.67%. This resource-aware mechanism can effectively prevent potential availability problems through status of the resource, improving the availability of Riak TS. Moreover, with the rapid growth of users and data size, this resource-aware availability enhancement mechanism will become more accurate and useful. © 2019 IEEE.

关键词： Databases Time series analysis Predictive models Memory management computer crashes Monitoring Conferences

来源：评论

学校读者我要写书评

暂无评论

Secure and balanced scheme for non-local data storage in blockchain network 21

Secure and balanced scheme for non-local data storage in blo...

引用

作者： Liu, Tonglai Wu, Jigang Li, Jiaxing Li, Jingyi School of Computer Science and Technology Guangdong University of Technology Guangzhou510006 China Guangxi Key Laboratory of Cryptography and Information Security Guilin541004 China

ISBN: (纸本)9781728120584

Blockchain-based decentralized storage is one of the most typical and prevalence application. However, current works are not concerned about the storage imbalance caused by data leakage. This heavily impacts the availability and stability of the blockchain network. This paper proposes a double-chain scheme to improve the security of the blockchain network. The problem on storage unbalance is formalized, and a heuristic algorithm named FMA is proposed, followed by a customized genetic algorithm (GA), together with a tabu search algorithm (TSA), to deal with the problem for non-local data storage. Numerical results show that the proposed FMA can obtain the same storage fitness compared with GA and TSA for the case of the small number of nodes. GA is able to outperform the other two algorithms in terms of storage fitness, and the solution quality of TSA is bound by the qualities of FMA and GA. © 2019 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

A 3D smooth random walk mobility model for FANETs 21

A 3D smooth random walk mobility model for FANETs

引用

作者： Lin, Na Gao, Feng Zhao, Liang Al-Dubai, Ahmed Tan, Zhiyuan School of Computer Science Shenyang Aerospace University Shenyang China School of Computing Edinburgh Napier University United Kingdom

ISBN: (纸本)9781728120584

The number of Unmanned Aerial Vehicles (UAVs) applications has increased over the past few years. Among all scenarios, UAV group consisting multi-UAVs is normally used to provide extensible communications. As a networking solution, Flying Ad Hoc Networks (FANETs) routing with ideal routing performance is the prerequisite of the multi-UAV application. Regarding the high construction cost of devices for FANETs, it is infeasible to build the real experimental environment, hundreds of UAVs are needed. In this case, network simulation is the most common mean to study FANETs in most cases. For FANETs, the mobility of UAV nodes has an important impact on the simulation results. Thus, a mobility model which can fit into specific environments well is necessary. Traditional mobility models of FANETs are mainly designed for planar scenarios without considering the actual application of FANETs which is three-dimensional (3D). Therefore, in this paper, firstly, the characteristics of UAVs is analyzed and then the key points of 3D mobility model for FANETs are presented. In this context, we propose a 3D Smooth Random Walk (3DSRW) mobility model, which intends to mimic the mobility of UAVs to the greatest extent. Then, we conduct simulations to get the network performance of AODV to verify the performance gap between 2D and 3D environment, in order to demonstrate the validity of our proposal. To further present the usage of our proposal, we show the performance of four routing protocols, including AODV, DSDV, OLSR and GPSR under the 3DSRW-constucted 3D environment, and analyzed their applicability in 3D environment. © 2019 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Two algorithms for fast mitigating multi-congestion in software defined networks 21

Two algorithms for fast mitigating multi-congestion in softw...

引用

作者： Sun, Meng Zhang, Xinchang Zhang, Jianwei Shandong Provincial Key Laboratory of Computer Networks Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan China

ISBN: (纸本)9781728120584

Although software defined networks (SDN) can achieve flexible network management, it lacks an efficient congestion control mechanism. Most existing researches focused on single link congestion scenario and has been inferior in the congestion mitigation time because of numerous flow operations between controllers and switches. Thus, in this paper, we address the problem of fast mitigating congestion (FMCP) in multiple link congestion (Multi-Congestion) scenario over SDN. We first formulate FMCP as a 0-1 nonlinear programming model, which aims to minimize the congestion mitigation cost and avoid congestion propagation. Then we propose two algorithms: one is an optimal algorithm based on Lagrange relaxation, called FMC-LR, which aims to transform the original optimization problem to several shortest path sub-problems corresponding to a new link weight;the other is a heuristic algorithm, called FMC-HE, which aims to reroute the congested flows traversing the maximum number of congested links to an alternative path with the minimum congestion mitigation cost until the congestion is mitigated. Extensive emulation results show that FMC-HE mitigates congestion faster than FMC-LR in small-scale networks, whereas FMC-LR outperforms FMC-HE in terms of success ratio and both algorithms can avoid congestion propagation. © 2019 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient task scheduling for heterogeneous cloud computing systems 21

Energy-efficient task scheduling for heterogeneous cloud com...

引用

作者： Zhao, Hui Qi, Ge Wang, Quan Wang, Jing Yang, Pengfei Qiao, Lei School of Computer Science and Technology Xidian University Xi'an China Beijing Institute of Control Engineering Beijing China

ISBN: (纸本)9781728120584

Virtual machine migration and consolidation technologies can reduce the number of active physical machines (PMs) in the cloud platform, which can effectively reduce the power consumption of cloud platform. However, migration and consolidation of virtual machines (VMs) requires a suitable time to perform. When VMs' migration and consolidation are not performed, how to minimize power consumption of cloud platform through task scheduling is still one major challenge. Existing task scheduling methods mainly aimed at load balancing or minimizing task execution time, without considering the power consumption optimization of heterogeneous server cluster during task execution. To solve the high power consumption problem, this paper proposes a power-aware task scheduling (PATS) method for heterogeneous cloud platform. First, we construct a task scheduling model, which can aware the PM workload in real time according to the VM state, and predict the busy and idle power consumption of the PM, so as to obtain the power consumption of the cloud platform. This model also formulates the task scheduling optimization problem, which tries to minimize the power consumption of heterogeneous cloud platform. Second, we analyze the impact of PM type and task execution time on power consumption of cloud platform, and then propose a task scheduling algorithm to solve the above optimization problem. Finally, the algorithm is evaluated against other existing task scheduling algorithms under a CloudSim framework. Results demonstrate that PATS consumes 23.9-6.6% less total power consumption in comparison to the state-of-the-art. © 2019 IEEE.

关键词： Electric power utilization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 72 73 74 75 76 77 78 79 80 81 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：