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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

385 篇 会议
294 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

455 篇 工学
- 359 篇 计算机科学与技术...
- 290 篇 软件工程
- 127 篇 信息与通信工程
- 51 篇 控制科学与工程
- 38 篇 生物工程
- 35 篇 电气工程
- 29 篇 机械工程
- 29 篇 电子科学与技术（可...
- 24 篇 生物医学工程（可授...
- 19 篇 仪器科学与技术
- 18 篇 光学工程
- 16 篇 网络空间安全
- 14 篇 动力工程及工程热...
- 11 篇 交通运输工程
- 8 篇 化学工程与技术
- 8 篇 安全科学与工程
185 篇 理学
- 125 篇 数学
- 39 篇 生物学
- 36 篇 统计学（可授理学、...
- 26 篇 物理学
- 18 篇 系统科学
- 10 篇 化学
148 篇 管理学
- 79 篇 管理科学与工程(可...
- 72 篇 图书情报与档案管...
- 31 篇 工商管理
19 篇 医学
- 17 篇 临床医学
- 12 篇 基础医学(可授医学...
- 9 篇 药学(可授医学、理...
16 篇 法学
- 15 篇 社会学
10 篇 经济学
- 10 篇 应用经济学
6 篇 农学
3 篇 文学
3 篇 艺术学
2 篇 教育学
2 篇 军事学

主题

30 篇 semantics
19 篇 routing
19 篇 training
16 篇 feature extracti...
16 篇 machine learning
16 篇 protocols
16 篇 clustering algor...
14 篇 wireless sensor ...
12 篇 contrastive lear...
12 篇 computational mo...
12 篇 privacy
11 篇 deep learning
11 篇 optimization
10 篇 network topology
10 篇 educational inst...
10 篇 estimation
9 篇 computer science
9 篇 peer to peer com...
9 篇 laboratories
9 篇 quality of servi...

机构

175 篇 school of comput...
85 篇 key laboratory o...
62 篇 key laboratory o...
46 篇 key laboratory o...
43 篇 school of cyber ...
41 篇 school of comput...
36 篇 key laboratory o...
21 篇 purple mountain ...
19 篇 key laboratory o...
16 篇 ministry of educ...
13 篇 the school of co...
12 篇 college of softw...
11 篇 school of cyber ...
11 篇 school of comput...
10 篇 national mobile ...
10 篇 department of co...
9 篇 southeast univer...
9 篇 guangxi collabor...
9 篇 national key lab...
9 篇 shanghai key lab...

作者

37 篇 zhou deyu
33 篇 zhang min-ling
29 篇 min-ling zhang
21 篇 guang cheng
20 篇 wang yun
19 篇 geng xin
17 篇 he yulan
16 篇 xiaoping li
16 篇 sanfeng zhang
13 篇 cheng guang
13 篇 shu huazhong
12 篇 li xiaoping
12 篇 qi guilin
12 篇 kong youyong
11 篇 jia yuheng
11 篇 yang peng
11 篇 tao jun
10 篇 wei tong
10 篇 yang guanyu
9 篇 liu bo

语言

546 篇 英文
92 篇 其他
44 篇 中文

检索条件"机构=Key Laboratory of Computer Network and Information Integration in Southeast University"

共 679 条记录，以下是531-540 订阅

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

详细简洁

排序：

TTL sensitive social-aware routing in mobile opportunistic networks

TTL sensitive social-aware routing in mobile opportunistic n...

引用

Consumer Communications and networking Conference, CCNC IEEE

作者： Yongfeng Huang Yongqiang Dong Sanfeng Zhang Guoxin Wu Ministry of Education China Key Laboratory of Computer Network and Information Integration (Southeast University) Nanjing China

Social characteristics such as community and centrality have been used as forwarding metrics in literature to predict nodes encounter probability in mobile opportunistic networks. However, the community detection and centrality estimation based on cumulative contact does not take the lifetime of messages into consideration. By investigating the periodicity of social characteristics evolution, this paper presents a novel method to calculate the community and centrality metrics of nodes, in time scales of τ-window and time-to-live (TTL), respectively. Such metrics are then exploited in a proposed social-aware routing algorithm, PerEvo, to predict the encounter probability of nodes during the lifetime of the forwarded message. Extensive trace-driven simulation results show that PerEvo improves the message delivery ratio significantly, while keeping a comparable delivery overhead with the existing social-based routing schemes.

关键词： Communities Routing Mobile computing Mobile communication Measurement Estimation Aging

来源：评论

学校读者我要写书评

暂无评论

A Personalized Service Recommendation Algorithm for Service Functionality

A Personalized Service Recommendation Algorithm for Service ...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Wei Li Di Hu Junzhou Luo School of Computer Science and Engineering Key Laboratory of Computer Network Information Integration (Southeast University) Ministry of Education Southeast University Nanjing China

With the increasing number of services on the Internet, it has become a great challenge to help users find services according to their demands. Personalized recommendation technology is an effective way to solve the problem. Existing service recommendation approaches make recommendations among services with same or similar functionalities to meet the non-functional requirements of users, while the functional requirements for service are seldom taken into account and new services that satisfy the needs of users are difficult to be recommended. Therefore, in this paper, we introduce social tags to the process of service recommendation and build service functionality oriented social tags model to describe user preference for service functionality, then we present a personalized service recommendation algorithm for service functionality (PSR-SF). The proposed algorithm first discovers the neighbors of a target user according to services use frequency of users, and then clusters services that have been used by the target user and his neighborhoods by using the functional characteristic vector of services which based on service functionality oriented social tags model. Finally, target user preference for service classes are generated by using service functionality tags use information of users to make recommendations. The experiment results show that the performance of PSR-SF algorithm is better than those existing recommendation algorithms in terms of service recommendation precision, recall and F values.

关键词： Clustering algorithms Training Testing Quality of service Web services History Motion pictures

来源：评论

学校读者我要写书评

暂无评论

Defense Technology of Wormhole Attacks Based on Node Connectivity

Defense Technology of Wormhole Attacks Based on Node Connect...

引用

IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)

作者： Jiu-hu Zheng Huan-yan Qian Lei Wang School of Information Technology Jiangsu Institute of Commerce Nanjing Jiangsu China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing Jiangsu China National Mobile Communications esearch Laboratory Southeast University Nanjing Jiangsu China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing Jiangsu China

ISBN: (纸本)9781509018949

After wormhole attacks the routing mechanism of wireless sensor network (WSN) is damaged, then the hop count and distance between nodes cannot be well matched, so that the WSN becomes the anisotropic sensor network, resulting in security treats for WSN. Considering that wormhole attacks can cause the changing of node connectivity, through the theoretical analysis and derivation, the paper has proposed a method which detects wormhole attacks with the connected relation of high connectivity nodes, and optimizes routing with the help of the normal nodes outside the wormhole. Simulation results show that the algorithm can well detect wormhole attacks and has better localization accuracy In addition, the effect is more obvious in the case of the wormhole nodes with large communication radius and long distance.

关键词： Wireless sensor networks Routing Probability Algorithm design and analysis Security Simulation computer science

来源：评论

学校读者我要写书评

暂无评论

MT-NCOR: A practical optimization method for network coded opportunistic routing in WMN

MT-NCOR: A practical optimization method for network coded o...

引用

International Conference on computer Communications and networks (ICCCN)

作者： Xiang Lan Sanfeng Zhang School of Software Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration in Southeast University Ministry of Education Southeast University Nanjing China

network coded opportunistic routing (NCOR) is a potential communication paradigm in wireless multi-hop networks (WMN) with lossy links. It leverages the multipath diversity of wireless networks and applies network coding to resist random erasures. Related optimization work minimizing transmission cost or maximizing throughput are based on the collision-free assumption, which either requires perfect schedule of MAC layer or only considers low traffic load and thus few packet collisions will occur. However, the assumption doesn't hold true because real WMNs often need to support content distribution service and bear a high level of traffic load, and 802.11 protocols cannot guarantee an ideal schedule with no collisions. In order to achieve an optimal forwarding rate distribution and reduce conflicting packets, this paper proposes a throughput optimization algorithm which takes into consideration the channel capacity and interference between neighboring nodes. Based on this algorithm, we implement a practical NCOR protocol aiming at achieving maximum throughput named MT-NCOR. Through extensive experiments, we show that MT-NCOR outperforms the state-of-art NCOR protocols in both throughput and total cost, especially in networks backing high traffic loads.

关键词： Throughput Optimization Interference Routing Protocols Channel capacity Encoding

来源：评论

学校读者我要写书评

暂无评论

An improved DV-Hop positioning algorithm for wireless sensor network

An improved DV-Hop positioning algorithm for wireless sensor...

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Jiuhu Zheng Huanyan Qian Lie Wang School of Information Technology Jiangsu Institute of Commerce Nanjing Jiangsu China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing Jiangsu China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing Nanjing Jiangsu China National Mobile Communications esearch Laboratory Southeast University Nanjing Jiangsu China Ministry of Education Key Lab of Broadband Wireless Communication and Sensor Network Technology (Nanjing University of Posts and Telecommunications) Nanjing Jiangsu China

In the view of the DV-Hop positioning algorithm which relies on the distance vector and beacon nodes, several aspects are improved: the average hop distance and hop count are corrected; a method to detect the abnormal distribution of beacon nodes is used to avoid the influence of the abnormal distribution on the positioning performance. The proposed algorithm is simple and effective. Simulation results show that compared with the traditional DV-Hop algorithm, the performance of the proposed algorithm is greatly improved. The performance is even even superior to that of the algorithm mentioned in literature [10].

关键词： Wireless sensor networks Mobile communication Hardware Maximum likelihood estimation Mathematical model computer science Broadband communication

来源：评论

学校读者我要写书评

暂无评论

Dynamics Nature and Link Prediction Methods in Opportunistic networks

Dynamics Nature and Link Prediction Methods in Opportunistic...

引用

IEEE International Conference on Computational Science and Engineering, CSE

作者： Yin Li Xuebing Zhao Hao Tang Qi Wang Sanfeng Zhang College of Software Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9781479979820

With the increasing popularization of low-cost smart mobile devices, which have the capability of short-range wireless communication, opportunistic networks aimed to meet different requirements start to put into practice. However, because of the mobility of nodes, links in opportunistic networks is intermittent and dynamic, which results in the problems of long delay time and low success rate of delivery. And these problems limit the further development of opportunistic networks. To solve these problems, this paper proposes a solution framework based on prediction, explores potential methods that are applicable to opportunistic networks and compares their performance and suitable application model.

关键词： Indexes Time series analysis Computational modeling Predictive models Prediction algorithms Complex networks

来源：评论

学校读者我要写书评

暂无评论

Quantitative Measurement of Coronary Artery Stenosis in CCTA Images Using a 2D Parametric Intensity Model

Quantitative Measurement of Coronary Artery Stenosis in CCTA...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society

作者： Guanyu YANG Xinglou ZHAO Lijun TANG Huzhong SHU Christine TOUMOULIN Lab of Image Science and Technology Key Laboratory of Computer Network and Information Integration (Southeast University) Dept. of Radiology the First Affiliated Hospital of Nanjing Medical University INSERM-U1099 LTSI Universite de Rennes 1

ISBN: (纸本)9781424479276

In this paper, we propose an approach based on 2D vessel model to segment the vessel lumen in three-dimensional coronary computed tomographic angiography (CCTA) images. The 2D parametric intensity model is introduced first to simulate the intensity distribution of vessel lumen with different size in the longitudinal images. Then the Levenberg-Marquardt method is applied to fit the model within a series of region-of interests defined in the longitudinal image. The estimated parameters of the model are employed to define the boundary points of vessel lumen. The detected boundary points of vessel lumen in six longitudinal images are transformed to the cross-sectional planes in order to calculate the degree of stenosis according to the luminal areas. Our proposed method was evaluated in ten CCTA images with ten reported non-calcified stenosis. The degree of each stenosis was computed according to the luminal area and compared with the standard reference given by radiologists. Experimental results show that our method can estimate the degree of stenosis with a high accuracy.

关键词： Image segmentation Arteries Fitting Solid modeling Three-dimensional displays Computational modeling Accuracy

来源：评论

学校读者我要写书评

暂无评论

Implementation and evaluation of a backtracking algorithm for finding all justifications in OWL 2 EL

Implementation and evaluation of a backtracking algorithm fo...

引用

7th Chinese Semantic Web Symposium and the 2nd Chinese Web ScienceConference, CSWS 2013

作者： Zhou, Zhangquan Qi, Guilin Key Laboratory of Computer Network and Information Integration of State Education Ministry School of Computer Science and Engineering Southeast University China

ISBN: (纸本)9783642540240

Finding justifications plays an important role in the development and maintenance of ontologies. It helps users or developers to understand the entailments by presenting the minimal subsets of the ontology which are responsible for the entailment (called justification). In our previous work, we have proposed a backtracking algorithm for finding justifications in description logic ΕL+, which underpins OWL 2 EL, a profile of the latest version of Web Ontology Language (OWL). However, the algorithm is not implemented. In this paper, we implement this algorithm and conduct experiments on some real world ontologies, including Snomed-CT. We compare our algorithm with a black-box algorithm for finding all justification in OWL 2 EL. The experimental results show that in most cases, the backtracking algorithm outperforms the black-box one. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Multi-label classification with unlabeled data: An inductive approach 5

Multi-label classification with unlabeled data: An inductive...

引用

5th Asian Conference on Machine Learning, ACML 2013

作者： Wu, Lei Zhang, Min-Ling MOE Key Laboratory of Computer Network and Information Integration School of Computer Science and Engineering Southeast University Nanjing210096 China

The problem of multi-label classification has attracted great interests in the last decade. Multi-label classification refers to the problems where an example that is represented by a single instance can be assigned to more than one category. Until now, most of the researches on multi-label classification have focused on supervised settings whose assumption is that large amount of labeled training data is available. Unfortunately, labeling training example is expensive and time-consuming, especially when it has more than one label. However, in many cases abundant unlabeled data is easy to obtain. Current attempts toward exploiting unlabeled data for multi-label classification work under the transductive setting, which aim at making predictions on existing unlabeled data while can not generalize to new unseen data. In this paper, the problem of inductive semi-supervised multi-label classification is studied, where a new approach named iMLCU, i.e. inductive Multi-Label Classification with Unlabeled data, is proposed. We formulate the inductive semi-supervised multi-label learning as an optimization problem of learning linear models and ConCave Convex Procedure (CCCP) is applied to optimize the non-convex optimization problem. Empirical studies on twelve diversified real-word multi-label learning tasks clearly validate the superiority of iMLCU against the other well-established multi-label learning approaches. © 2013 L. Wu & M.-L. Zhang.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

Execution recovery in transactional composite service

Execution recovery in transactional composite service

引用

2013 IEEE 20th International Conference on Web Services, ICWS 2013

作者： Cao, Jiuxin Zhou, Tao Zhu, Gongrui Liu, Bo Luo, Junzhou School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration of MoE of China Southeast University Nanjing 211189 China

ISBN: (纸本)9780768550251

In the composite service which runs for a long time under the heterogeneous and loose-coupled circumstance, the failure of service tends to occur. The transaction and recovery mechanism is urgently needed in order to guarantee the end-to-end QoS of the workflow and satisfy the user requirement. In this paper we address the composite service recovery issue in the way of substitution with the consideration of QoS constraint, based on our previous research work of the transactional construction and processing rules and the global optimization service selection algorithm, TSSA. Firstly, the service execution graph (SEG) is introduced and a service execution solution selection algorithm is proposed to choose one from the solution set of TSSA which has the highest success rate of recovery. Then, the concepts of execution backup path and switch cost are introduced and a search algorithm is presented to search for the optimal backup path when current service failure occurs. Meanwhile, a local induction algorithm based on positive feedback is described which could rapidly construct an transactional execution path when no backup execution path can be found in SEG and also guarantees the transactional constraint of composite service. Finally, experimental results show the recovery algorithm proposed in this paper is efficient and has high reliability. © 2013 IEEE.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共68页 << < 50 51 52 53 54 55 56 57 58 59 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：