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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

383 篇 会议
291 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

173 篇 school of comput...
84 篇 key laboratory o...
60 篇 key laboratory o...
46 篇 key laboratory o...
42 篇 school of cyber ...
41 篇 school of comput...
35 篇 key laboratory o...
21 篇 purple mountain ...
19 篇 key laboratory o...
15 篇 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
31 篇 zhang min-ling
28 篇 min-ling zhang
21 篇 guang cheng
20 篇 wang yun
19 篇 geng xin
17 篇 he yulan
16 篇 xiaoping li
15 篇 sanfeng zhang
14 篇 shu huazhong
13 篇 cheng guang
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

语言

549 篇 英文
85 篇 其他
43 篇 中文

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

共 674 条记录，以下是581-590 订阅

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

详细简洁

排序：

An evolutionary algorithm for no-wait flowshop problems with flowtime minimization

An evolutionary algorithm for no-wait flowshop problems with...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Zhu, Xia Li, Xiaoping Wang, Qian School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9781457703874

In this paper, no-wait flow shop scheduling problem with flowtime minimization is considered. Objective increment properties are analyzed and proved for fundamental operations of heuristics. With these properties, whether a new generated schedule is better or worse than the original one is only evaluated by objective increments, instead of completely calculating objective values as the traditional algorithms do, so that the computational time can be considerably reduced. An evolutionary algorithm (EA) is proposed for the considered problem. The initial population with two members is generated by different heuristics. After crossover, the disturb cycles which consist of a mutation operator and strengthen approaches are conducted to the offspring. EA is compared with the best-so-far algorithms SRTS, PH1p and DPSOvnd on 110 benchmark instances. Experimental results show that EA outperforms the others on effectiveness but is a little worse than DPSOvnd on efficiency. © 2011 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-agent communication model and service manipulation in network service management

引用

作者： Liu, Bo Cao, Jiuxin Luo, Junzhou School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Laboratory of Computer Network and Information Integration of Ministry of Education of China China

ISBN: (纸本)9783642256578

Agent technology has played an important role in distributed network application and agent communication model is an inevitable problem in multi-agent system. We propose a "Shaikh-Guide" based agent communication model (SGACM) to support asynchronous communication, and based on this communication mechanism, we present the matching algorithms to decompose the whole network service into several groups of sub-tasks. During the course of decomposition, different priorities are assigned to sub-tasks. This paper introduces a network service management scenario to support agent communication and task processing. An experiment has been done with the communication model and algorithms, the results of which demonstrate the advantage of the algorithms. As an application example, the process of network multimedia service management is presented finally. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Multimedia services

来源：评论

学校读者我要写书评

暂无评论

Cooperative Agent-based QoS Framework for heterogeneous networks

Cooperative Agent-based QoS Framework for heterogeneous netw...

引用

2011 International Conference on information Technology, computer Engineering and Management Sciences, ICM 2011

作者： Ding, Feng Zhang, Shuai Wang, Heng Huang, Songhua Tao, Jun Key Laboratory of Science and Technology on Information Systems Engineering Nanjing Research Institute of Electronics Engineering Nanjing China Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9780769545226

With the fast development of network technology and expansion of the network scale, the heterogeneity of Internet makes the Quality of Service (QoS) guarantee techniques even more challenging. In this paper the state-of-the-art of QoS guarantee techniques is first reviewed, and a new Cooperative Agent-based QoS Framework (CAQF) for heterogeneous networks is proposed, which integrates the technologies of QoS-adaptive cooperation, situation awareness, admission control, routing, packet scheduling and resource management. It can be used for intra-domain, inter-domain's QoS guarantee in the heterogeneous networks. Procedure simulation results show that CAQF can achieve expected functionality, while demonstrating the feasibility and universality of the framework for distributed end-to-end QoS cooperation. © 2011 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Web service selection with quantitative and qualitative user preferences

Web service selection with quantitative and qualitative user...

引用

2011 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2011

作者： Wang, Hongbing Liu, Weihong Key Lab of Computer Network and Information Integration School of Computer Science and Engineering Southeast University 211189 China School of Computer Science Anhui Unversity of Technology 243002 China

ISBN: (纸本)9780769545134

Most existing approaches of Web service selection with user preferences are either quantitative or qualitative. However, using a qualitative or quantitative approach alone cannot handle all the non-functional properties(NFPs). To solve this problem, we present an approach of service selection with quantitative and qualitative user preferences, where qualitative preferences are modeled as a TCP-net and quantitative preferences are specified by using arbitrary positive numbers. Our approach consists of two steps, that is, qualitative selection based on qualitative preferences and quantitative selection based on quantitative preferences. We prove its effectiveness and verify its efficiency through extensive experiments. © 2011 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Anonymous authentication-oriented vehicular privacy protection technology research in VANET

Anonymous authentication-oriented vehicular privacy protecti...

引用

International Conference on Electrical and Control Engineering (ICECE)

作者： Shuai Zhang Jun Tao Yijia Yuan Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University Nanjing China

Vehicular Ad hoc networks (VANET) consists of several vehicular nodes and uses 802.11p protocol for communication. Because of its unique characteristics, such as fast speed, serious Doppler effect, large node number etc, VANET is vulnerable to be affected by a variety of security threats. In this paper, we firstly introduce the system architecture, applications and categories of attacks in VANET. Then we summarize several types of anonymous authentication techniques which aim at protecting the privacy of vehicular nodes, then discuss and compare the typical anonymous authentication schemes of each type. Finally, we present the problems which should be considered in the next step of research.

关键词： Vehicles Authentication Privacy Roads Protocols Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A two-stage composite heuristic for dual cycling quay crane scheduling problem

A two-stage composite heuristic for dual cycling quay crane ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Dandan Wang Xiaoping Li Qian Wang School of Computer Science & Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

In this paper, hatch constrained quay crane scheduling problem is considered to minimize makespan with dual cycling, which can improve efficiency of operations and utilization of quay cranes. By analyzing precedence relationships intra- and inter- hatches, the problem is decomposed into two embedded sub-problems, each of which can be formulated as a 2-machine flow shop scheduling problem. A composite heuristic is introduced for stacks scheduling in a hatch by integrating the Johnson rule with a developed gap-shifting strategy. A better model is constructed for inter-hatches than existing ones, in which overlapped processing time is shorten and effectiveness can be improved by a reconstructive Johnson rule. Experimental results show that the proposed composite algorithm outperforms the existing hybrid heuristic.

关键词： Cranes Loading Containers Schedules Heuristic algorithms Proposals Optimized production technology

来源：评论

学校读者我要写书评

暂无评论

不确定图最可靠最大流算法研究

不确定图最可靠最大流算法研究

引用

第29届中国数据库学术会议

作者： CAI Wei 蔡伟 ZHANG Bai-Li 张柏礼 LV Jian-Hua 吕建华 School of Computer Science and Engineering Southeast University Nanjing 210096 东南大学计算机科学与工程学院南京 210096 Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast U 东南大学计算机网络和信息集成教育部重点实验室南京 210096

文中首先基于可能世界模型提出了不确定图的最可靠最大流问题和可靠性计算模型,这对于构建可靠性网络、可靠传输路径选择以及系统薄弱环节分析等一系列实际问题具有重要意义;然后基于简单路径组合思想提出了一种求解最可靠最大流的算法S... 详细信息

文中首先基于可能世界模型提出了不确定图的最可靠最大流问题和可靠性计算模型,这对于构建可靠性网络、可靠传输路径选择以及系统薄弱环节分析等一系列实际问题具有重要意义;然后基于简单路径组合思想提出了一种求解最可靠最大流的算法SPCA,通过简单路径流量的组合,在无需求得所有最大流分布的情况下获得最可靠最大流,并在组合过程中引入概率剪枝与约束剪枝策略,对无效组合进行过滤,从而显著地提高了算法效率;接着文中针对SPCA算法易受路径数量及瓶颈容量影响的问题,又提出一种基于状态空间划分的最可靠最大流算法SDBA,该算法的主要思想是将不确定图所蕴含的子图空间划分为互不相交且满足最大流值的闭合区间集合,进而寻找所有闭合区间中概率最大的下界状态,经证明这个下界状态对应子图中的最大流分布为最可靠最大流;最后通过实验,比较了两种算法的性能。实验结果表明SDBA算法相对于SPCA算法其空间复杂度有一定的增加,但时间复杂度方面具有较大的优势,能够很好地解决SPCA算法性能受制于容量的问题,具有更好的性能与适用性。

关键词：数据集不确定图可靠性计算方法复杂度

来源：评论

学校读者我要写书评

暂无评论

A dynamic resource allocation algorithm for database-as-a-service

A dynamic resource allocation algorithm for database-as-a-se...

引用

2011 IEEE 9th International Conference on Web Services, ICWS 2011

作者： Zhu, Jie Gao, Bo Wang, Zhihu Reinwald, Berthold Guo, Changjie Li, Xiaoping Sun, Wei School of Computer Science and Engineering Southeast University 210096 Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education China IBM Research-China 100193 Beijing China IBM Almaden Research Center 650 Harry Road San Jose CA 95120 United States

ISBN: (纸本)9780769544632

In Database-as-a-Service (DBaaS), a large number of tenants share DBaaS resources (CPU, I/O and Memory). While the DBaaS provider runs DBaaS to "share" resources across the entire tenant population to maximize resource utilization and minimize cost, the tenants subscribe to DBaaS at a low price point while still having resources conceptually "isolated" according to service level agreements (SLAs). To optimize this dichotomy of goals, we propose a dynamic resource allocation framework that periodically re-allocates resources to tenants to maximize resource utilization while tolerating a low risk of SLA violations. We model the resource allocation problem as a modified unbounded knapsack problem. The model introduces an additional fairness constraint to assign residual resources to active tenants, while avoiding that few tenants consume all residual resources. Performed experiments demonstrate the effectiveness and efficiency of the proposed allocation algorithm for a synthetic workload with burstiness and predicted tenant behavior. © 2011 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Traffic classification based on port connection pattern

Traffic classification based on port connection pattern

引用

International Conference on computer Science and Service System (CSSS)

作者： Guang Cheng Song Wang School of Computer Science & Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Key Laboratory of Computer Network Technology of Jiangsu South-East University Nanjing China

ISBN: (纸本)9781424497621

While the traditional Web, Email and other Internet applications are still used large-scale, Internet applications, such as typical P2P resource sharing, streaming, games, instant messaging and other new applications emerging, is generating the rapid growth traffic. Connection pattern approach is to observe and identify connection patterns of host behavior at the transport layer. This method has no access to packet payload, no knowledge of port numbers and no additional information other than what current flow collectors provide. But traffic classification method based on host connection pattern can't distinguish some similar applications provided by one server. This paper analyzes the connection pattern between servers for SMTP, POP3, Web, BT traffic, and the distribution of simultaneous connections for each server port, and then propose a new traffic classified approach based on port connection pattern and the simultaneous connection number. The classified method can distinguish WEB, SMTP, POP3, and BT traffic each port in a server without any knowledge of port. The experimental result shows that this method is effective.

关键词： Electronic mail IP networks Joining processes Classification algorithms Web servers

来源：评论

学校读者我要写书评

暂无评论

Collaborative Approaches to Complementing Qualitative Preferences of Agents for Effective Service Selection

Collaborative Approaches to Complementing Qualitative Prefer...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Hongbing Wang Jie Zhang Yangyu Tang Shizhi Shao Key Laboratory of Computer Network and Information Integration School of Computer Science and Engineering South East University China School of Computer Engineering Nanyang Technological University Singapore

Incomplete preferences of agents may render service selection ineffective. We address this problem by proposing a set of collaborative approaches to complementing agents' incomplete preferences in a qualitative way. For an agent, the approaches first find its similar agents, and then base the similar agents' qualitative preferences to complement this agent's missing preferences. We analyze and compare these approaches and provide experimental results to justify our arguments. We also compare our approach with the classic collaborative filtering and show the competitive advantages of our approach in service selection. Our work thus serves as an important step towards effective service selection.

关键词： Collaboration Clustering algorithms Mathematical model Equations Complexity theory Humans Educational institutions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共68页 << < 55 56 57 58 59 60 61 62 63 64 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：