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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,182 篇 工学
- 744 篇 计算机科学与技术...
- 450 篇 软件工程
- 216 篇 机械工程
- 162 篇 控制科学与工程
- 157 篇 信息与通信工程
- 137 篇 电气工程
- 115 篇 仪器科学与技术
- 67 篇 电子科学与技术（可...
- 49 篇 网络空间安全
- 46 篇 生物工程
- 37 篇 生物医学工程（可授...
- 29 篇 交通运输工程
- 27 篇 动力工程及工程热...
- 19 篇 光学工程
- 17 篇 建筑学
- 17 篇 安全科学与工程
- 17 篇 公安技术
260 篇 管理学
- 213 篇 管理科学与工程(可...
- 51 篇 图书情报与档案管...
- 45 篇 工商管理
206 篇 理学
- 109 篇 数学
- 41 篇 生物学
- 40 篇 系统科学
- 24 篇 物理学
- 24 篇 统计学（可授理学、...
60 篇 医学
- 41 篇 基础医学(可授医学...
- 38 篇 临床医学
- 21 篇 公共卫生与预防医...
34 篇 经济学
- 34 篇 应用经济学
26 篇 教育学
- 21 篇 教育学
22 篇 农学
15 篇 法学
10 篇 文学
10 篇 艺术学
4 篇 军事学
1 篇 哲学

主题

147 篇 cloud computing
92 篇 informatics
84 篇 computational mo...
55 篇 educational inst...
54 篇 conferences
46 篇 feature extracti...
43 篇 data mining
43 篇 servers
40 篇 computer archite...
39 篇 semantics
39 篇 data models
32 篇 monitoring
32 篇 databases
32 篇 accuracy
30 篇 big data
28 篇 software
28 篇 training
26 篇 visualization
26 篇 security
26 篇 standards

机构

25 篇 school of comput...
12 篇 department of co...
9 篇 school of inform...
9 篇 school of softwa...
9 篇 cloud computing ...
8 篇 dongguan researc...
7 篇 national institu...
7 篇 ieee beijing sec...
7 篇 faculty of engin...
6 篇 shanghai univers...
6 篇 information depa...
6 篇 school of scienc...
6 篇 department of ma...
6 篇 school of softwa...
5 篇 qingdao academy ...
5 篇 signal & informa...
5 篇 cloud computing ...
5 篇 collaborative in...
5 篇 management schoo...
5 篇 informatics cent...

作者

13 篇 gang xiong
10 篇 jing zhang
10 篇 bin sheng
9 篇 ping li
9 篇 xiaohua hu
9 篇 paulo maciel
8 篇 shangce gao
7 篇 xiwei liu
7 篇 li zhuo
7 篇 yinglin wang
7 篇 wang yinglin
7 篇 stoyanova-doyche...
7 篇 yi zhang
7 篇 jin sun
7 篇 zhou mengqi
6 篇 xiong gang
6 篇 shusaku tsumoto
6 篇 anum masood
6 篇 kris hauser
6 篇 shoji hirano

语言

1,836 篇 英文
9 篇 其他
1 篇 中文

检索条件"任意字段=2014 IEEE International Conference on Progress in Informatics and Computing"

共 1846 条记录，以下是1641-1650 订阅

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

详细简洁

排序：

Dynamic Priority Back-up Algorithm Based on ieee802.11 DCF

Dynamic Priority Back-up Algorithm Based on IEEE802.11 DCF

引用

The 2010 ieee international conference on progress in informatics and computing

作者： Chao Liu,Zhengming Li and Wenjuan Li School of Electrical And Information Engineering JiangSu University, Zhenjiang,China

The Distributed Coordination Function(DCF) in the ieee 802.11 protocol is a random access scheme based on the carrier sense multiple access with collision avoidance (CSMA/CA).In recent years,there have been numerous research on the performance analysis and model of DCF under the assumption that the transmission queue is always nonempty(i.e. saturation state).In this paper,we propose a dynamic priority back-up algorithm(DPBA) for ieee802.11 DCF,the basic idea of DPBA is each node should collect statistical data of other node's transmission while sensing the channel,and maintaining a sending data table for all node in *** the node has data to transmit,it will calculate the dynamic priority and connection window according to the number of successful sending,the number of successful sending and the statistical data in sending *** results show that DPBA can properly assign channel among nodes in proportion to their dynamic priority as well as enhance the network saturation throughput.

关键词： Dynamic priority back-up algorithm(DPBA) Distributed coordination function ieee802.11

来源：评论

学校读者我要写书评

暂无评论

Improved Fuzzy C-Means Algorithm and Its Application to Classification of Remote Sensing Image in Chengdu City,China

Improved Fuzzy C-Means Algorithm and Its Application to Clas...

引用

2016 ieee international conference on progress in informatics and computing

作者： Dongmei Han Jiayu Ji Yonghui Dai Guowei Li Weiguo Fan Huagen Chen School of Information Management and Engineering Shanghai University of Finance and Economics Shanghai Financial Information Technology Key Research Laboratory Management School Shanghai University of International Business and Economics Pamplin Coll Business Virginia Polytechnic Institute & State University School of Ocean and Earth Science Tongji University

The classification recognition performance is a hot study in the field of remote sensing image. In this paper, texture feature, shape feature, radiation intensity of remote sensing image information were used to initial terrain classification. Then an improved fuzzy c-means algorithm was applied on classification, and it included optimization of determine clustering center, got the number of clustering automatically and removed the noise of image after classification. Meanwhile, as an alternative to expert knowledge, data fusion method was used, which included the fusion of aeromagnetic data, gravity data and elevation data. The empirical results showed that this method can avoid the highly dependent on domain knowledge experts in image recognition and got a better classification effect in remote sensing image.

关键词： Fuzzy c-means algorithm remote sensing image image classification data fusion

来源：评论

学校读者我要写书评

暂无评论

A New Pruning Method for Medial Axis of Planar Free-form Shape

A New Pruning Method for Medial Axis of Planar Free-form Sha...

引用

2014 ieee international conference on progress in informatics and computing

作者： Guangyi Guo Xinsheng Wang Wen Zhang Pengze Li Xibo Dai School of Resources and Environmental Science Hubei University Institute of Atmospheric Physics Chinese Academy of Sciences

The medial axis(or a topological skeleton) is a thinner version of a geometric object. The medial axis was firstintroduced by Blum as a description of shape. Its classical definitions include grass-fire model and maximal disk model. The grass-fire model means that an object's boundary is taken as an initial fire front that propagates within the object's interior region. Points where the fire front folds or interacts with itself are retained as the skeleton *** maximal disk model means that the medial axis of a planar domain is the locus of the center of a maximal disc, which touches the boundary in at least twopoints. The medial axis has been used within various scientific and engineering areas,including geographical information systems, face recognition,path-finding, image processing, computer vision, collision detection mesh-generation, and machining applications, etc. Usually,because of the noise on the boundary contours of a shape, the traditional algorithms of constructing medial axis produce the redundant branches of medial axis. This paper analyses the reason for the redundant branches of medial axis using the circumcenter method based on constraint Delaunay triangulation, and then presents a new method toprune the redundant branches of the medial axis. Several experiments demonstrate that the proposed method can remove the redundant medial axis branches effectively and efficiently. Obviously this method is an optimization for the circumcenter method based on constraint Delaunay *** the one hand, it makes medial axis more accurate;on the other hand, it can eliminate the byproduct –medial axis branches.

关键词： planar free-form shape constrained Delaunay triangulation the circumcenter method medial axis pruning

来源：评论

学校读者我要写书评

暂无评论

Spray and Wait Routing Algorithm Based on Transfer Utility of Node in DTN

Spray and Wait Routing Algorithm Based on Transfer Utility o...

引用

2015 ieee international conference on progress in informatics and computing(PIC 2015)

作者： Guizhu Wang Mei Shao Run Li Yao Ma Bingting Wang Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Department of Electronic and Electrical Engineering Chuzhou University

Delay Tolerant Networks(DTNs) is a mobile wireless network, in which it is difficult to establish end-to-end paths. Meanwhile, the nodes transmit message copies randomly,resulting in a high overhead of message propagation. In this paper, a Transfer Utility of Node Spray and Wait(TUoN-SNW)routing is proposed to forward the message copies dynamically,which avoid randomness of Spray and Wait routing protocol when message copies are forwarded. And in order to reduce the overhead, a Based on Transfer Utility of Node’s Buffer Scheduling Strategy(BTUoN-BSP) is also applied. Simulation results show that compared with the Spray and Wait(SNW)routing, the algorithms could not only improve the delivery rate but also reduce the overhead of network obviously.

关键词： delay tolerant networks transfer utility spray and wait buffer scheduling strategy

来源：评论

学校读者我要写书评

暂无评论

Holistic, model-based service repository for distributed industrial automation

Holistic, model-based service repository for distributed ind...

引用

international conference on Emerging Technologies and Factory Automation (ETFA)

作者： Viktor Steiner Zoltan Theisz Zsolt Szepessy Brice Morin Gergely Mezei Evopro Innovation Ltd Budapest Hungary Department of Aut. and Applied Informatics Budapest Uni. of Tech. and Econ Budapest Hungary SINTEF IKT Oslo Norway

Modern industrial control applications gradually take advantage of well-defined state-of-the-art distributed software architecture principles and framework designs, including corresponding modeling techniques. Moreover, the advent of this new era goes way beyond current modeling tool-chains via the application of mature meta-model driven software engineering paradigms. In the frame of the Arrowhead ARTEMIS project these techniques are to showcase the synergies between multi-level meta-model driven design and SOA based dynamic model-aware run-time framework components. This paper reports on the on-going engineering efforts in this domain by showing the generic architecture and by explaining some of the current implementation details through a prototypical tool-chain and a simple model example.

关键词： Object oriented modeling Unified modeling language Automation Mathematical model Peer-to-peer computing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Conceptual Graph Based Text Classification

Conceptual Graph Based Text Classification

引用

2014 ieee international conference on progress in informatics and computing

作者： Yi Wan Tingting He Xinhui Tu School of Computer Science Central China Normal University School of Computer Science Wuhan University of Science and Technology

Most traditional Wikipedia based methods use only article contentinformation. By organizing Wikipedia articles as a graph, multi-information such as category and structure information can be utilized in our method. In this paper, we propose a novel method todoclassification by using knowledge from a conceptual graph which is built from Wikipedia. First, we build a conceptual graph from Wikipedia. Each article is considered as a concept node. Titles, hyperlinks, texts and category information are used as edges tomeasure the relationship between those concepts. Each textis mapped toits respective set of nodes and Personalized PageR ank(random walk) is then used togenerate a set of mostimportant node which can represent the text best. Finally the twosets are scored with a measure of vector similarity. We evaluate our techniques on the standard text classification dataset(20newsgroup), the results show the effectiveness of the proposed approach.

关键词： conceptual garph personalized PageR ank semantic similarity text classification

来源：评论

学校读者我要写书评

暂无评论

Data Delivery Delay Estimation Based on Left-turn in Vehicular Ad hoc Networks

Data Delivery Delay Estimation Based on Left-turn in Vehicul...

引用

2016 ieee international conference on progress in informatics and computing

作者： Chang Guo Demin Li Guanglin Zhang Zhaoyuan Cui College of Information Science and Technology Donghua University Engineering Research of Center of Digitized Textile and Apparel Technology Ministry of Education

In this paper, we analyze the data delivery delay at the road intersection, which is influenced by switch operation of traffic lights and the topology of roadways. By employing the arrival rate and departure rate and analyzing the traffic lights operations, we propose the data delivery delay formulae for different cases, respectively. We find that adding left-turn lane to relay the packets can reduce the data delivery delay at intersections. At last, by using extensive simulations via VANETMobisim and NS-2, we compare the average end-to-end delay of single lane roadway with our results of adding left-turn lane in different conditions. The reduction of data delivery delay proves that our theoretical analysis results perform better.

关键词： data delivery delay intersection left-turn lane bidirectional roadways VANETs

来源：评论

学校读者我要写书评

暂无评论

LightGraph: Lighten Communication in Distributed Graph-Parallel Processing

LightGraph: Lighten Communication in Distributed Graph-Paral...

引用

ieee international conference on Services Economics (SE)

作者： Yue Zhao Kenji Yoshigoe Mengjun Xie Suijian Zhou Remzi Seker Jiang Bian Department of Computer Science University of Arkansas at Little Rock Little Rock Arkansas U.S.A Department of ECSSE Embry-Riddle Aeronautical University Daytona Beach FL U.S.A Division of Biomedical Informatics University of Arkansas for Medical Sciences Little Rock Arkansas U.S.A

A number of graph-structured computing abstractions have been proposed to address the needs of solving complex and large-scale graph algorithms. Distributed Graphlab and its successor, PowerGraph, are two such frameworks that have demonstrated excellent performance with high scalability and fault tolerance. However, excessive communication and state sharing among nodes in these frameworks not only reduce network efficiency but may also cause a decrease in runtime performance. In this paper, we first propose a mechanism that identifies and eliminates the avoidable communication during synchronization in existing distributed graph structured computing abstractions. We have implemented our method on PowerGraph and created LightGraph to reduce communication overhead in distributed graph-parallel computation systems. Furthermore, to minimize the required intra-graph synchronizations for PageRank-like applications, LightGraph also employs an edge direction-aware graph partitioning strategy, which optimally isolates the outgoing edges from the incoming edges of a vertex when creating and distributing replicas among different machines. We have conducted extensive experiments using real-world data, and our results verified the effectiveness of LightGraph. For example, when compared with the best existing graph placement method in PowerGraph, LightGraph can not only reduce up to 27.6% of synchronizing communication overhead for intra-graph synchronizations but also cut up to 17.1% runtime for PageRank.

关键词： Mirrors Synchronization Distributed databases Computational modeling Runtime Partitioning algorithms Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Collaborative Intrusion Detection as a Service in Cloud computing Environment

Collaborative Intrusion Detection as a Service in Cloud Comp...

引用

2015 ieee international conference on progress in informatics and computing(PIC 2015)

作者： Hong Liang Yufei Ge Wenjiao Wang Lin Chen College of Computer and Communication Engineering China University of Petroleum （East China）

With the growing trends of cloud computing, the security issues in this area are growing at the same speed as its development. Some malicious intruders and other malware activities tend to find the inner vulnerabilities and spare no effort to control the administration or conduct the pure break-down service with curiosity or on purpose. Traditional defense systems such as firewall, intrusion detection and malware code system are still utilized in nowadays network scenes, but they may not support enough in cloud computing environment with oldfashioned architectures. Here we focus on intrusion detection system（IDS） to defend against intruders and other attacks. In this paper, we proposed a collaborative intrusion detection service and our goal is to make use of the state-of-the-art computing framework in cloud environment and to provide a rounded IDS service for both cloud providers and cloud tenants, while the collaborative architecture will help to respond to the attacks promptly. We set up our system prototype and discuss the empirical results on the preference. The experimental results demonstrate that our system does enhance the security when some network-based attacks happen and ensure that both cloud service providers and tenants are protected with satisfaction.

关键词： cloud computing collaborative IDS intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Optimizing Schedule Length for DAG Type Applications with Energy Consumption Constraint in Heterogeneous computing Systems

Optimizing Schedule Length for DAG Type Applications with En...

引用

Symposium of Image, Signal Processing, and Artificial Vision (STSIVA)

作者： Yu He Jinchao Chen Chenglie Du Pengcheng Han Northwestern Polytechnical University Xi’an China

ISBN: (数字)9781728170862

ISBN: (纸本)9781728170879

Schedule length minimization of a parallel application with precedence constrained tasks in heterogenous computing systems is always a research hotspot of distributed computing. Unfortunately, accelerating the execution of tasks requires faster processors and consequently produces more energy. Users are faced to a time-energy tradeoff in selecting processors and execution frequencies for tasks. A common way to address this trade-off is to minimize schedule length under energy constraints. Up to now only a few works have been done to address this problem. Nevertheless, the energy preassignment methods of these works are unfair for low priority tasks in various degrees. Furthermore, existing works pay little attention to the priority assignment strategy, which can be critical for task scheduling. Hence, we proposed a novel approach named DAG Scheduling with Energy Consumption Constraint (DSECC) to solve this problem. DSECC combines several priority assignment strategies to assign priorities for tasks, and preassigns energy for tasks based on the average energy consumption of tasks on different processors. A large number of experiments based on randomly generated DAG show that compared against state-of-the-art algorithms, our proposed algorithm can obtain smaller schedule length and generate less energy consumption.

关键词： Schedules Energy consumption Time-frequency analysis Program processors Scheduling algorithms Heterogeneous networks Task analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共185页 << < 161 162 163 164 165 166 167 168 169 170 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：