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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

145 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

130 篇 工学
- 63 篇 计算机科学与技术...
- 24 篇 机械工程
- 18 篇 软件工程
- 16 篇 仪器科学与技术
- 12 篇 网络空间安全
- 9 篇 控制科学与工程
- 6 篇 信息与通信工程
- 4 篇 电子科学与技术（可...
- 4 篇 水利工程
- 3 篇 电气工程
- 3 篇 船舶与海洋工程
- 2 篇 建筑学
- 2 篇 公安技术
- 1 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 交通运输工程
19 篇 管理学
- 19 篇 管理科学与工程(可...
7 篇 理学
- 5 篇 数学
- 2 篇 系统科学
- 1 篇 统计学（可授理学、...
4 篇 艺术学
- 4 篇 设计学（可授艺术学...
3 篇 教育学
- 3 篇 教育学
2 篇 经济学
- 2 篇 应用经济学
2 篇 文学
- 1 篇 中国语言文学
- 1 篇 外国语言文学
2 篇 医学
- 2 篇 公共卫生与预防医...
2 篇 军事学
- 2 篇 军队指挥学
1 篇 法学
- 1 篇 社会学
1 篇 农学

主题

5 篇 cloud computing
4 篇 conferences
4 篇 computer archite...
4 篇 parallel computi...
4 篇 standards
3 篇 tools
3 篇 parallel process...
3 篇 monitoring
3 篇 wireless sensor ...
3 篇 visualization
3 篇 algorithm design...
3 篇 feature extracti...
3 篇 security
3 篇 mathematical mod...
2 篇 parallel algorit...
2 篇 clustering
2 篇 support vector m...
2 篇 qpso
2 篇 component
2 篇 fault tolerance

机构

8 篇 school of comput...
4 篇 kingston univers...
4 篇 school of iot en...
4 篇 intelligent tran...
4 篇 chongqing medica...
3 篇 association of m...
3 篇 graduate univers...
2 篇 school of comput...
2 篇 engineering rese...
2 篇 faculty of compu...
2 篇 kunming universi...
2 篇 bedfordshire uni...
2 篇 international bu...
2 篇 school of manage...
2 篇 computer and inf...
2 篇 intelligent tran...
2 篇 beijing key labo...
2 篇 school of comput...
2 篇 college of compu...
2 篇 wuhan university...

作者

4 篇 mao zhe
4 篇 jian xu
4 篇 s.khaddaj
3 篇 wenbo xu
3 篇 jun sun
3 篇 yucheng guo
3 篇 souheil khaddaj
3 篇 shufeng gao
3 篇 frédéric magoulè...
3 篇 shesheng zhang
3 篇 ai xu
2 篇 dong xiang
2 篇 yao nianmin
2 篇 hu liu
2 篇 roman putanowicz
2 篇 wenping zhang
2 篇 liu chen-guang
2 篇 hanbing yao
2 篇 yonghua yin
2 篇 ma haifeng

语言

145 篇 英文
1 篇 中文

检索条件"任意字段=第11届分布式计算及其应用国际学术研讨会"

共 146 条记录，以下是131-140 订阅

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

详细简洁

排序：

A Sampling Method for Mining User's Preference

A Sampling Method for Mining User's Preference

引用

第11届分布式计算及其应用国际学术研讨会

作者： Jianfeng Zhang Weihong Han Yan Jia Peng Zou College of Computer National University of Defense Technology Academy of Equipment Command and Technology

Recent years, society relies heavily on the network infrastructure and information system. Protecting these assets from frequently network attacks needs to deploy some distributed security systems. However the amount of data produced by many distributed security tools can be *** it's very difficult and limited to get the most risky alert through manual process based on the huge network alerts with many attributes. The common method used to rank the alerts is scoring function, the higher the score, the more risky of the alert. Our motivation is that many times, user can not precisely specify the weights for the scoring function as their preference in order to get the preferable *** this paper, we propose a sampling method to mining user's preference. Based on this preference, the most risky alerts can be easily ranked for emergency response. An extensive performance study using both synthetic and real datasets is reported to verify its effectiveness and efficiency.

关键词： Network Security Evaluation Preference Top K Ranking Sampling

来源：评论

学校读者我要写书评

暂无评论

A New Linear Programming Based Load-shedding Strategy

A New Linear Programming Based Load-shedding Strategy

引用

第11届分布式计算及其应用国际学术研讨会

作者： Ouyang Lin Zhou Qin Qi Jingjing Pu Qiumei School of Computer Science and Technology Wuhan University of Science and Technology Department of Electrical Engineering Shanghai Dian Ji University School of Computer Science and Technology Wuhan University of Technology School of Information Engeering Minzu University of China

There is a large class of applications that highfrequency data produced continuously in 7 days per week and 24 hours per day. The traditional data processing system can not deal with them efficiently because of the active data pushing and the passive queries. With the purpose of dealing with these data, data stream management systems(DSMS) appeared. For the geographical distribution of data streams, distributed data stream processing systems are studied recently. As an important aspect of distributed data stream management system(DDSMS), load management can balance system load incurred by unpredictable incoming data stream and inappropriate query operators' distribution. Loadshedding acts as an important role in load management of distributed data stream system. In this paper, a new linear programming based load-shedding strategy is proposed to degrade system load on a simple query network with network constraint. Compared with previous work which concentrates on one factor only, it takes two factors;include CPU capacity and network constraints. Experiments indicate that it can increase system stability and to decrease the loss of query accuracy with low extra cost.

关键词： Load-shedding Linear Programming Network Constraint DDSMS

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for Trip Planning with Constraint of Transfer Connection in Urban Mass Transit Network

An Algorithm for Trip Planning with Constraint of Transfer C...

引用

第11届分布式计算及其应用国际学术研讨会

作者： Jianyuan Guo Limin Jia Jie Xu Yong Qin School of traffic and transportation Beijing Jiaotong University State Key Laboratory of Rail TrafficControl and Safety Beijing Jiaotong University

In large scale urban mass transit(UMT) network, different lines in a transfer station always stop at different time. Thus, in the time span of last trains running, passengers are easy to face a problem when transferring: the next line already stopped. This brings big inconvenience to passengers. A survey from 276 passengers in Beijing shows that 51 percent passengers have ever missed the last trains when transferring. As to solve this problem, we analyzed the factors which affect the transfer such as: the topology of UMT network, schedule, distribution of passengers' transfer time. Then we introduced an algorithm with the constraint of transfer connection. Experiments were conducted to validate this algorithm based on the real UMT network in Beijing China. The result shows that the algorithm is efficient to tackle this problem. With the development of the trip planning system based on this algorithm, it will make the late trip more convenient for passengers.

关键词： trip planning transfer connection last train urban mass transit

来源：评论

学校读者我要写书评

暂无评论

A Novel Image Encryption Scheme Based on Dynamical Multiple Chaos and Baker Map

A Novel Image Encryption Scheme Based on Dynamical Multiple ...

引用

第11届分布式计算及其应用国际学术研讨会

作者： XiaoJun Tong Yang Liu Miao Zhang Zhu Wang School of Computer Science and Technology Harbin Institute of Technology School of Information Science and Technology Harbin Institute of Technology

Chaotic encryption has a series of good characteristics such as sensitivity to initial value, pseudorandom properties and so on. However, the traditional lowdimensional chaotic sequence is truncated because of the limitation of finite precision in computer. Precision degradation has seriously affected the security of encryption. An image encryption scheme based on high-dimensional dynamical multiple chaotic maps is proposed in this paper. In order to produce fast encryption and more avalanche effect, a novel Baker map is utilized to permute the positions of the image pixels in the spatial domain. The experimental results show that it is more efficient than traditional encryption schemes. Compared with simple low-dimensional chaotic system, the proposed scheme does not readily lead to precision degradation and it has passed NIST sp800-22 standards, it provides a secure way for image encryption.

关键词： Image encryption Dynamical Multiple chaotic Baker Bilateral-diffusion

来源：评论

学校读者我要写书评

暂无评论

Optimized GPU Sorting Algorithms on Special Input Distributions

Optimized GPU Sorting Algorithms on Special Input Distributi...

引用

第11届分布式计算及其应用国际学术研讨会

作者： Quan Yang Zhihui Du Sen Zhang Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Department of Mathematics Computer Science and Statistics State University of New York

We present a high performance graphics processing unit(GPU) sorting algorithm ISSD(Improved Sorting considering Special Distributions) implemented with the Compute Unified Device Architecture(CUDA). The ISSD focuses on two aspects to improve parallel sorting performance. One is how to decompose the sorting tasks into independent and balanced subtasks which can then be easily distributed to thousands of threads to realize the concept of "parallel sorting" as well as to efficiently explore the power of GPU. The other one is how to take advantage of special data distributions to further optimize the algorithms and improve their performance. The algorithm is redesigned based on our previous general data distribution version and optimized both on general implementation methods and special input distributions. Experimental results show that for the general data distribution inputs, the ISSD outperforms the existing parallel sorting algorithms by about 10% in performance due to its practical optimization in implementation;and for three special data distribution inputs, the ISSD outperforms the existing algorithms by more than 40% due to its special optimization based on the data distributions. Therefore, the algorithm is viable and efficient when dealing with specific data distributions.

关键词： GPU,parallel sorting algorithm,special data distribution

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Traffic Control in Virtual Environment

Evaluation of Traffic Control in Virtual Environment

引用

第11届分布式计算及其应用国际学术研讨会

作者： Wang Xiaojing Ye Wei Wu Haowei Ding Linjie Zhang Chi School of Computer Science and Technology Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics College of Optoelectronic Science and Engineering Huazhong University of Science and Technology

Due to the development of hardware technology, virtualization has been drawing more attention recently. Virtualization brings the benefits of ease management to users but also poses challenges to researchers. As multiple virtual machines run on a single hardware platform, the problem of resource allocation and scheduling, and performance of the system should be taken into consideration. In network environment, performance decreased significantly as more and more virtual machines sharing hardware resources. Since each user may have different demands, to improve the network QoS, we bring traffic control into Xen virtual platform to manage the network traffic and satisfy several desirable properties. Users are incentivized to share the network resources by ensuring that resources are weighted partitioned among them. And performance is improved by the optimized scheduler scheme. By classifying the requests into different priorities, scheduling the network request could improve the performance by decreasing 60% of latency and an adjustable throughput control.

关键词： Evaluation Traffic Control Quality of Service Xen Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Parallel Hierarchical K-means Clustering-based Image Index Construction Method

Parallel Hierarchical K-means Clustering-based Image Index C...

引用

第11届分布式计算及其应用国际学术研讨会

作者： Yuan-feng Yang Jian Wu Jing Fang Zhi-ming Cui JiangSu Province Support Software Engineering R&D Center for Modern Information Technology Application in Enterprise The Institute of Intelligent Information Processing and Application Soochow University

Content-based image retrieval often uses the integration of various features. The characteristic dimensions are up to hundreds of dimensions. The capabilities for image representation storage management far exceed that of the database. Retrieval and matching of large-scale image are the urgent problems which need to be solved. To solve the construction of image indexing of large-scale image retrieval, this paper introduces a parallel level K-means clustering method. Firstly, image clustering based on the level K-means reduces the size of matching data in retrieval;secondly, considering the inherent defects in the cluster, we put forward optimization program and calculate cluster rapidly with parallel computing algorithms. The experimental results show that this method can quickly build a massive image index for fast image retrieval.

关键词： image feature index constructing K-means parallel computing

来源：评论

学校读者我要写书评

暂无评论

Image Retrieval Using ESNs and Relevance Feedback

Image Retrieval Using ESNs and Relevance Feedback

引用

第11届分布式计算及其应用国际学术研讨会

In order to overcome "semantic gap" between bottom features and high-level semantic in the image retrieval, this paper introduces the echo state network to strengthen the mapping between the high-level vision content and the bottom visual feature and designs a feedback category screening strategy. We extract the feature of the queried image and get the characteristic vector of the image;through introducing the echo state network for image and constructing sample testing model for each kind of image data, we can calculate the category probability of the queried image, so as to achieve similarity discrimination of the queried image and library image. After users make feedbacks to the retrieval results and systems use related feedback algorithm to amend image feature, we retrieve and screen the category of the returned image. Experiments show that our retrieval architecture can achieve very good retrieval results.

关键词： image retrieval feature extraction ESNs relevance feedback

来源：评论

学校读者我要写书评

暂无评论

BFS Traversal on Multi-GPU Cluster

BFS Traversal on Multi-GPU Cluster

引用

第十五届分布式计算及其应用国际学术研讨会

作者： Micha?l Krajecki Julien Loiseau Fran?ois Alin Christophe Jaillet

ISBN: (纸本)9781509035946

The High Performance Computing field is striving for the next computational step: exascale(1018 floating point operations per second).The first machine at this scale is expected at horizon 2020 and some French companies such as Atos/Bull are already working on *** supercomputer,Sequana,will deliver the expected computational power using either Xeon Phi or GPU *** these machines are built to produce an exaFLOPS,they are exclusively based on *** question is how they will behave when confronted with highly irregular problems such as graph theory *** algorithms are considered to be highly irregular with intensive communication and require high memory resources(but also I/O).In this study our goal is to provide an optimized implementation of the Graph500 benchmark to rank the Kepler GPU based supercomputers(a specific class of HPC architectures) in the Graph500 list.

关键词： Graphics processing units Supercomputers Benchmark testing Algorithm design and analysis Partitioning algorithms Computer architecture Random access memory supercomputer Algorithm design and analysis Benchmark testing Partitioning algorithms random access machine Computer Architecture Graphics Processing Unit

来源：评论

学校读者我要写书评

暂无评论

Research on the algorithm of pedestrian recognition in front of the vehicle based on SVM

Research on the algorithm of pedestrian recognition in front...

引用

第11届分布式计算及其应用国际学术研讨会

作者： Ying Yang Weiguo Liu Youcai Wang Yuanjun Cai School of Mechanical Engineering and Automation Northeastern University

After extracting the candidate region from an image, it is necessary to take a kind of technology to determine whether the split target is a pedestrian. By analysis and feature extraction to segmentations of pedestrian candidate region, the classification of pedestrians has been studied. The pedestrian classifier of the SVM(Support Vector Machines) has been trained with pedestrian's typical characteristics. This paper mainly studies the efficient algorithms of splitting pedestrian target from other non-pedestrians. As the pedestrians in the image will show different shapes, postures and sizes, and they are usually in different light conditions, it is complicate to describe the pedestrians. This paper proposes a pedestrian segmentation method, which effectively solves the problems, making the classifier be able to deal with the complicate problems. Secondly, the paper uses the pedestrian image texture and shape features to describe the pedestrian. The extracted features are taken as the input of SVM. In order to solve the impact of lighting and other factors to pedestrian recognition, some characteristics have been considered, such as the pedestrian's grayscale images have certain gray symmetry and texture features, and the pedestrians successive edge makes outline of the image features clear. By using lots of events to train the SVM algorithm the recognized pedestrian classification can be obtained. The test results show that the proposed algorithm can effectively recognize different pedestrians in front of the vehicle and get a good real-time effect.

关键词： feature extraction pedestrian segmentation image texture features support vector machines SVM classifier.

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共15页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：