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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

2,729 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,921 篇 工学
- 1,483 篇 计算机科学与技术...
- 1,193 篇 软件工程
- 325 篇 信息与通信工程
- 280 篇 控制科学与工程
- 154 篇 生物工程
- 137 篇 电气工程
- 136 篇 机械工程
- 123 篇 电子科学与技术（可...
- 94 篇 光学工程
- 88 篇 生物医学工程（可授...
- 72 篇 仪器科学与技术
- 69 篇 动力工程及工程热...
- 58 篇 化学工程与技术
- 41 篇 建筑学
- 40 篇 安全科学与工程
- 40 篇 网络空间安全
- 38 篇 交通运输工程
897 篇 理学
- 555 篇 数学
- 185 篇 物理学
- 172 篇 生物学
- 151 篇 统计学（可授理学、...
- 138 篇 系统科学
- 69 篇 化学
548 篇 管理学
- 339 篇 管理科学与工程(可...
- 223 篇 图书情报与档案管...
- 112 篇 工商管理
76 篇 医学
- 66 篇 临床医学
- 56 篇 基础医学(可授医学...
- 40 篇 药学(可授医学、理...
62 篇 法学
- 42 篇 社会学
37 篇 经济学
17 篇 农学
16 篇 教育学
10 篇 文学
9 篇 艺术学
6 篇 军事学

主题

132 篇 computer science
101 篇 laboratories
61 篇 semantics
60 篇 wireless sensor ...
51 篇 software enginee...
46 篇 application soft...
43 篇 software testing
41 篇 optimization
41 篇 software
40 篇 algorithm design...
39 篇 feature extracti...
39 篇 testing
38 篇 computational mo...
36 篇 data mining
34 篇 web services
33 篇 educational inst...
33 篇 monitoring
32 篇 deep learning
32 篇 protocols
31 篇 cloud computing

机构

508 篇 state key labora...
202 篇 department of co...
154 篇 department of co...
119 篇 national key lab...
108 篇 state key labora...
85 篇 state key labora...
65 篇 department of co...
62 篇 shanghai key lab...
61 篇 school of softwa...
57 篇 state key labora...
51 篇 state key labora...
51 篇 university of ch...
47 篇 national key lab...
39 篇 tsinghua nationa...
37 篇 school of artifi...
33 篇 beijing key labo...
30 篇 college of compu...
30 篇 state key labora...
30 篇 department of co...
28 篇 department of co...

作者

35 篇 junping du
34 篇 yu huiqun
34 篇 li wu-jun
33 篇 guihai chen
32 篇 dou wanchun
31 篇 shen furao
31 篇 fan guisheng
31 篇 zhang lijun
31 篇 yingmin jia
30 篇 zhao jian
29 篇 ying mingsheng
25 篇 yang tianbao
24 篇 xu baowen
23 篇 xiang-yang li
23 篇 sanglu lu
23 篇 chen liqiong
23 篇 fashan yu
22 篇 gao yang
22 篇 xu xiaolong
22 篇 zhang xuyun

语言

2,503 篇 英文
139 篇 其他
86 篇 中文
2 篇 德文

检索条件"机构=State Key Laboratory for Novell Software Technology Department of Computer Science and Technology"

共 2729 条记录，以下是2101-2110 订阅

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

详细简洁

排序：

A propagation model of reputation query request

A propagation model of reputation query request

引用

2010 2nd IEEE International Conference on Information Management and Engineering, ICIME 2010

作者： Sun, Hua Yu, Huiqun Department of Computer Science and Engineering East China University of Science and Technology Shanghai China School of Information Science and Engineering Xinjiang University Urumqi China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China

ISBN: (纸本)9781424452644

Reputation is a key factor to enhance reliability and performance of transactions in the network. Many works have focused on rating the reputation of the entities through kinds of technologies. The entities send the request messages about reputation to other entities when they need the reputation of the target entities. Considering the nodes population is highly transient in open network, and the number of requests and responses are also various, this paper builds up a model about propagation of reputation query request. It reveals relationship of query request times, connect rate and response rate. It is a valuable reference to set the scope of TTL in Gnutella. Through reducing the number of query requests, it's significant to efficiently solve the problems about bottleneck of bandwidth and denial of service attacks. © 2010 IEEE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

Optimal Data Scheduling for P2P VoD Streaming Systems

Optimal Data Scheduling for P2P VoD Streaming Systems

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Qifeng Yu Daoxu Chen State Key Laboratory of Novel Software and Technology Department of Computer Science and Technology Nanjing University China

Media streaming services have been much more popular nowadays, and these services consume lots of network bandwidth. Peer-to-Peer(P2P) technology has been employed in the streaming systems to save the server bandwidth consumption and enhance the system scalability. In a P2P streaming system, the quality of the data scheduling scheme will largely affect the server stress that being saved. In this paper, we present our optimal data scheduling scheme to achieve both server stress minimization and fairness among users when the playback continuities of the users are guaranteed. The data scheduling scheme we proposed is based on the maximum network flow problem, and it is proved to be polynomial. Simulations also show that the time consumption for the computation of the optimal scheduling is acceptable, and the result of the scheduling also achieves small node degree bound which makes it practical.

关键词： Peer to peer computing Servers Optimal scheduling Stress Scheduling Data models Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

D-WAV: A Web Application Vulnerabilities Detection Tool Using Characteristics of Web Forms

D-WAV: A Web Application Vulnerabilities Detection Tool Usin...

引用

International Conference on software Engineering Advances (ICSEA)

作者： Lijiu Zhang Qing Gu Shushen Peng Xiang Chen Haigang Zhao Daoxu Chen State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Jiangsu China

Finding effective approaches to detect vulnerabilities is important to guarantee the security of Web applications. Web application security issues are mostly related to malicious input data and Web forms are the main interface to input these data. According to the above observation, we propose a novel approach to detect Web application vulnerabilities. In our approach, given a URL, we get a target Web form. After analyzing characteristics of this Web form, we assign a set of test values to each field in this form. Then we propose a method to generate test suites taking the weight of each test value into account. Finally, we execute these test suites and analyze corresponding result based on HTTP response code and response HTML. We implement our approach into a tool called D-WAV and choose several Web applications as benchmarks to conduct empirical studies. Final results show that our approach can automatically and effectively discover Web application vulnerabilities such as cross-site scripting and SQL injection.

关键词： Testing HTML Web server Web pages computer hacking Unified modeling language

来源：评论

学校读者我要写书评

暂无评论

Middleware support for context-awareness in asynchronous pervasive computing environments

Middleware support for context-awareness in asynchronous per...

引用

International Workshop on Wireless Network Algorithm and Theory

作者： Yu, Jianping Huang, Yu Cao, Jiannong Tao, Xianping State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

ISBN: (纸本)9780769543222

Context-awareness is an essential feature of pervasive applications, and runtime detection of contextual properties is one of the primary approaches to enabling context-awareness. However, existing context-aware middleware does not provide sufficient support for detection of contextual properties in asynchronous environments. We argue that in asynchronous environments, the concept of time needs to be reexamined. Instead of assuming the availability of global time or synchronous interaction, we should rely on logical time. To this end, we present the Middleware Infrastructure for Predicate detection in Asynchronous environments (MIPA), which supports context-awareness based on logical time. Design and operation of MIPA are explained in detail. We also evaluate MIPA with a comprehensive case study. The evaluation results show the cost-effectiveness and scalability of MIPA. © 2010 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Detection of behavioral contextual properties in asynchronous pervasive computing environments

Detection of behavioral contextual properties in asynchronou...

引用

16th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2010

作者： Huang, Yu Yu, Jianping Cao, Jiannong Tao, Xianping State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

ISBN: (纸本)9780769543079

Detection of contextual properties is one of the primary approaches to enabling context-awareness. In order to adapt to temporal evolution of the pervasive computing environment, context-aware applications often need to detect behavioral properties specified over the contexts. This problem is challenging mainly due to the intrinsic asynchrony of pervasive computing environments. However, existing schemes implicitly assume the availability of a global clock or synchronous coordination, thus not working in asynchronous environments. We argue that in pervasive computing environments, the concept of time needs to be reexamined. Toward this objective, we propose the Ordering Global Activity (OGA) algorithm, which detects behavioral contextual properties in asynchronous environments. The essence of our approach is to utilize the message causality and its on-the-fly coding as logical vector clocks. The OGA algorithm is implemented and evaluated based on the open-source context-aware middleware MIPA. The evaluation results show the impact of asynchrony on the detection of contextual properties, which justifies the primary motivation of our work. They also show that OGA can achieve accurate detection of contextual properties in dynamic pervasive computing environments. © 2010 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

BACH 2 : Bounded reachability checker for compositional linear hybrid systems 10

BACH 2 : Bounded reachability checker for compositional line...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Lei Bu You Li Linzhang Wang Xin Chen Xuandong Li State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing Jiangsu China

ISBN: (纸本)9783981080162

Existing reachability analysis techniques are easy to fail when applied to large compositional linear hybrid systems, since their memory usages rise up quickly with the increase of systems' size. To address this problem, we propose a tool BACH 2 that adopts a path-oriented method for bounded reachability analysis of compositional linear hybrid systems. For each component, a path is selected and all selected paths compose a path set for reachability analysis. Each path is independently encoded to a set of constraints while synchronization controls are encoded as a set of constraints too. By merging all the constraints into one set, the path-oriented reachability problem of a path set can be transformed to the feasibility problem of this resulting linear constraint set, which can be solved by linear programming efficiently. Based on this path-oriented method, BACH 2 adopts a shared label sequence guided depth first search (SLS-DFS) method to perform bounded reachability analysis of compositional linear hybrid system, where all potential path sets within the bound limit are identified and verified one by one. By this means, since only the structure of a system and the recently visited one path in each component need to be stored in memory, memory consumption of BACH 2 is very small at runtime. As a result, BACH 2 enables the verification of extremely large systems, as is demonstrated in our experiments.

关键词： Automata Reachability analysis Encoding Linear programming Surface-mount technology Laboratories computer science Interleaved codes Prototypes Space exploration

来源：评论

学校读者我要写书评

暂无评论

Applying Particle Swarm Optimization to Pairwise Testing

Applying Particle Swarm Optimization to Pairwise Testing

引用

IEEE Annual International computer software and Applications Conference (COMPSAC)

作者： Xiang Chen Qing Gu Jingxian Qi Daoxu Chen State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing Jiangsu China

Combinatorial testing (also called interaction testing) is an effective specification-based test input generation technique. By now most of research work in combinatorial testing aims to propose novel approaches trying to generate test suites with minimum size that still cover all the pairwise, triple, or n-way combinations of factors. Since the difficulty of solving this problem is demonstrated to be NP-hard, existing approaches have been designed to generate optimal or near optimal combinatorial test suites in polynomial time. In this paper, we try to apply particle swarm optimization (PSO), a kind of meta-heuristic search technique, to pairwise testing (i.e. a special case of combinatorial testing aiming to cover all the pairwise combinations). To systematically build pairwise test suites, we propose two different PSO based algorithms. One algorithm is based on one-test-at-a-time strategy and the other is based on IPO-like strategy. In these two different algorithms, we use PSO to complete the construction of a single test. To successfully apply PSO to cover more uncovered pairwise combinations in this construction process, we provide a detailed description on how to formulate the search space, define the fitness function and set some heuristic settings. To verify the effectiveness of our approach, we implement these algorithms and choose some typical inputs. In our empirical study, we analyze the impact factors of our approach and compare our approach to other well-known approaches. Final empirical results show the effectiveness and efficiency of our approach.

关键词： Arrays Particle swarm optimization software testing software Optimization software engineering

来源：评论

学校读者我要写书评

暂无评论

A face-based shape matching method for IGES surface model

A face-based shape matching method for IGES surface model

引用

International Conference on Shape Modeling and Applications - Shape Modeling International Conference, SMI 2010

作者： Hu, Kai-Mo Wang, Bin Gao, Yi Yuan, Qi-Ming Yong, Jun-Hai School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

ISBN: (纸本)9780769540726

IGES is a widely used standard for mechanical data exchange. In this paper, we present a new method for the retrieval task of IGES surface model. Based on this method, a novel distinctive face selection strategy is proposed and evaluated. In the training database, each model is treated as a set of disordered faces, and their features are extracted and stored respectively. The Discounted Cumulative Gain (DCG) value of each face is then calculated and stored for later utilization. To retrieve models in the testing database, we first forecast each face's DCG value by searching its most similar face's DCG value in training database, and then the top k faces with highest forecasted DCGs are selected as query input. A greedy algorithm is finally applied to get the total similarity. Experimental results show that our algorithm is superior or at least comparable to some of the most powerful methods in finding parts with similar functionality in most cases. © 2010 IEEE.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient and Topology-Aware Routing for Underwater Sensor Networks

Energy-Efficient and Topology-Aware Routing for Underwater S...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Xiaobing Wu Guihai Chen Jinming Chen State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing Jiangsu China

Underwater sensor networks were recently proposed to support quite a few aquatic applications such as ocean exploration and harbor monitoring. Different from terrestrial WSNs, the underwater sensor networks have many unique characteristics, such as greater propagation delay, higher dynamic topology and sparse node density. These features bring many new challenges to the protocol design of underwater sensor networks, especially the routing protocols. In this paper, we propose SEANAR, an energy-efficient and topology-aware routing protocol for underwater sensor networks. SEANAR relies on topology information, in specific, degree information of neighboring nodes for making routing decisions. Although this is a simple greedy approach, simulation results show that, compared with Greedy Forwarding and VBF-based routing protocol, SEANAR achieves much higher packet delivery ratio, while keeps the energy consumption in a very low level.

关键词： Wireless sensor networks Routing Routing protocols Energy consumption Mobile communication Simulation

来源：评论

学校读者我要写书评

暂无评论

A community-centric model for service publication, discovery, selection, binding, and maintenance

A community-centric model for service publication, discovery...

引用

5th IEEE International Symposium on Service-Oriented System Engineering, SOSE 2010

作者： Chan, W.K. Mei, Lijun Zhang, Zhenyu Gao, Xiaopeng Department of Computer Science City University of Hong Kong Tat Chee Avenue Hong Kong Hong Kong Department of Computer Science University of Hong Kong Pokfulam Road Hong Kong Hong Kong State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology Beihang University Beijing China

ISBN: (纸本)9780769540818

Services discovery, selection, composition, verification, and adaptation are important in service-oriented computing. Existing researches often study techniques to maximize the benefits of individual services. However, following the power laws, a small fraction of quality services offers their executions to support a significant portion of all service requests. We argue that locating and maintaining such a small and significant set of services is important to the development of service-oriented computing. In this paper, we propose the notion of adaptive service-oriented community. A community consists of peer-reviewed services, and only those operations of member services that the community collectively exceeds a significance threshold are discoverable and bondable. Services also select such communities to bind to its requested operations primarily based on their significance. Our proposal essentially raises a service ecosystem from pursuing the benefits of individual services to that of the community as a whole. Our model also has features to make a namespace or a web service privacy-aware. © 2010 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共273页 << < 207 208 209 210 211 212 213 214 215 216 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：