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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

934 篇 工学
- 783 篇 计算机科学与技术...
- 677 篇 软件工程
- 211 篇 信息与通信工程
- 105 篇 控制科学与工程
- 99 篇 生物工程
- 60 篇 电气工程
- 60 篇 生物医学工程（可授...
- 46 篇 电子科学与技术（可...
- 39 篇 安全科学与工程
- 37 篇 光学工程
- 32 篇 机械工程
- 28 篇 交通运输工程
- 27 篇 动力工程及工程热...
- 27 篇 建筑学
- 24 篇 土木工程
385 篇 理学
- 230 篇 数学
- 108 篇 生物学
- 71 篇 统计学（可授理学、...
- 55 篇 物理学
- 47 篇 系统科学
288 篇 管理学
- 166 篇 管理科学与工程(可...
- 142 篇 图书情报与档案管...
- 96 篇 工商管理
55 篇 医学
- 53 篇 临床医学
- 51 篇 基础医学(可授医学...
- 34 篇 药学(可授医学、理...
- 23 篇 公共卫生与预防医...
54 篇 法学
- 37 篇 社会学
33 篇 教育学
- 33 篇 教育学
32 篇 经济学
- 32 篇 应用经济学
18 篇 农学
2 篇 文学
2 篇 军事学
1 篇 艺术学

主题

51 篇 software
48 篇 software enginee...
36 篇 feature extracti...
34 篇 machine learning
33 篇 computer science
31 篇 accuracy
30 篇 computational mo...
28 篇 deep learning
28 篇 semantics
26 篇 real-time system...
25 篇 artificial intel...
25 篇 training
20 篇 wireless sensor ...
20 篇 data models
19 篇 scalability
19 篇 support vector m...
19 篇 data mining
18 篇 computer archite...
18 篇 quality of servi...
18 篇 predictive model...

机构

19 篇 faculty of compu...
19 篇 gik institute of...
19 篇 university of eu...
19 篇 dept. of technol...
17 篇 dept. of compute...
16 篇 dept. of compute...
14 篇 dept. of softwar...
13 篇 dept. of compute...
12 篇 dept. of compute...
12 篇 dept. of compute...
11 篇 bcmaterials basq...
11 篇 state key labora...
11 篇 bcmaterials basq...
10 篇 college of compu...
10 篇 dept. of compute...
8 篇 daffodil interna...
8 篇 faculty of elect...
8 篇 school of softwa...
8 篇 university of re...
8 篇 dept. of compute...

作者

19 篇 ku wei-shinn
19 篇 ali raja hashim
19 篇 raja hashim ali
16 篇 usama arshad
16 篇 arshad usama
15 篇 baldwin timothy
14 篇 zain ul abideen
12 篇 shiri nematollaa...
11 篇 buyya rajkumar
10 篇 ali zeeshan ijaz
8 篇 qusay h. mahmoud
8 篇 baik doo-kwon
8 篇 cho seong-je
8 篇 nisar ali
8 篇 shafiur rahman
8 篇 ali nisar
8 篇 ijaz ali zeeshan
7 篇 siddique abu bak...
7 篇 ul abideen zain
7 篇 abideen zain ul

语言

1,404 篇 英文
49 篇 其他
5 篇 中文
4 篇 朝鲜文
3 篇 日文

检索条件"机构=Dept. of Computer Science& Software Engineering"

共 1465 条记录，以下是1131-1140 订阅

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

详细简洁

排序：

Comparative evaluation of change propagation approaches towards resilient software evolution

Comparative evaluation of change propagation approaches towa...

引用

3rd International Conference on software engineering Advances, ICSEA 2008

作者： Ibrahim, Noraini Kadir, Wan M. Nasir Wan Deris, Safaai Software Engineering Dept. Faculty of Computer Science and Information System Universiti Teknologi Malaysia

ISBN: (纸本)9780769533728

Producing software that is adaptable to the rapid environmental changes and the dynamic nature of the business life-cycle is extensively becoming a topical issue in the software evolution. In this context, change propagation (CP) process is one of the critical parts in the software change management. Traditional strategies have projected more complex ways, resulting to substantial failures and risks. This paper presents an investigation and highlights on the desired criteria to provide better means to simplify the complicated CP tasks. The evaluation results may be used as a foundation in improving CP approaches that provide significant challenges in software evolution. ©2008 IEEE.

关键词： Life cycle

来源：评论

学校读者我要写书评

暂无评论

Teaching black-box testing techniques through specification patterns

Teaching black-box testing techniques through specification ...

引用

2008 ASEE Annual Conference and Exposition

作者： Salamah, Salamah Gates, Ann Computer and Software Engineering Dept. Embry-Riddle Aeronautical University Computer Science Dept. University of Texas El Paso United States

software verification is one of the most important activities in the software development cycle, and testing remains the most common approach to verification used in industry. The goal of blackbox testing (functional testing) is to verify the system's adherence to specifications. The notion of patterns and scopes developed by Dwyer et al. provides a cohesive and rich set of examples to teach black-box testing strategies. A pattern describes a recurring software property, and a scope specifies the interval of program execution where a pattern must hold. A property specified using a pattern and scope combination has characteristics that must be satisfied if it is to hold. Based on these characteristics, there is a large set of behaviors that can be examined using black-box testing techniques. In a complementary fashion, the behaviors specified by patterns and scopes provide clear and simple examples that can enhance the understanding of these testing techniques. In this paper, we describe an approach and present general lessons and exercises that demonstrate how patterns and scopes can be used to teach boundary value analysis and equivalence class testing, which are two of the most commonly used black-box testing techniques. As a side effect of this approach, students are exposed to, and become familiar with, formally specifying system behavior. © American Society for engineering Education, 2008.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

An unstructured peer-to-peer approach to aggregate node selection 08

An unstructured peer-to-peer approach to aggregate node sele...

引用

17th International Symposium on High Performance Distributed Computing 2008, HPDC'08

作者： Rao, Imran Harwood, Aaron Karunasekera, Shanika NICTA Victoria Labs. Dept. of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)9781595939975

In distributed and high performance applications it it is necessary to discover the aggregate resource capabilities of the collaborating peers. Another requirement of these applications is to locate the resources meeting the given aggregate search criteria. In this paper we present an unstructured peer-to-peer approach to aggregate node selection for resource management. Our objective is to efficiently calculate the aggregate value and search the aggregate node whose attribute matches or falls in the proximity of this value. Our contribution also includes the inclusion of an explicit network for aggregate query routing. We evaluated our protocol for accuracy, efficiency and communication cost through detailed simulations. Copyright 2008 ACM.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

The multi-rule partial sequenced route query 08

The multi-rule partial sequenced route query

引用

16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008

作者： Chen, Haiquan Ku, Wei-Shinn Sun, Min-Te Zimmermann, Roger Dept. of Computer Science and Software Engineering Auburn University Auburn AL 36849 United States Dept. of Computer Science and Information Engineering National Central University Taoyuan 320 Taiwan Dept. of Computer Science National University of Singapore Singapore 117590 Singapore

ISBN: (纸本)9781605583235

Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number of constraints. Unfortunately, most of these constrained TPS cannot be directly answered by any of the existing algorithms. By formulating each restriction into rules, we propose a novel form of route query, namely the multi-rule partial sequenced route (MRPSR) query. Our work provides a unified framework that also subsumes the well-known trip planning query (TPQ) and the optimal sequenced route (OSR) query. In this paper, we first prove that MRPSR is NP-hard and then present three heuristic algorithms to search for near-optimal solutions for the MRPSR query. Our extensive simulations show that all of the proposed algorithms can answer the MRPSR query effectively and efficiently. Using both real and synthetic datasets, we investigate the performance of our algorithms with the metrics of the route distance and the response time in terms of the percentage of the constrained points of interest (POI) categories. Compared to the LORD-based brute-force solution, the response times of our algorithms are remarkably reduced while the resulting route length is only slightly longer than the shortest route. Copyright 2008 ACM.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

A cloaking algorithm based on spatial networks for location privacy

A cloaking algorithm based on spatial networks for location ...

引用

2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008

作者： Li, Po-Yi Peng, Wen-Chih Wang, Tsung-Wei Ku, Wei-Shinn Xu, Jianliang Hamilton Jr., J.A. Dept. of Computer Science National Chiao Tung University Taiwan Dept. of Computer Science and Software Engineering Auburn University Auburn United States Dept. of Computer Science Hong Kong Baptist University Hong Kong Hong Kong

ISBN: (纸本)9780769531588

Most of research efforts have elaborated on k-anonymity for location privacy. The general architecture for implementing k-anonymity is that there is one trusted server (referred to as location anonymizer) responsible for cloaking at least k users' locations for protecting location privacy. A location anonymizer will generate cloaked regions in which there are at least k users for query processing. Prior works only explore grid shape cloaked regions. However, grid shape cloaked regions result in a considerable amount of query results, thereby increasing the overhead of filtering unwanted query results. In this paper, we propose a cloaking algorithm in which cloaked regions are generated according to the features of spatial networks. By exploring the features of spatial networks, the cloaked regions are very efficient for reducing query results and improving cache utilization of mobile devices. Furthermore, an index structure for spatial networks is built and in light of the proposed index structure, we develop a Spatial-Temporal Connective Cloaking algorithm(abbreviated as STCC). A simulator is implemented and extensive experiments are conducted. Experimental results show that our proposed algorithm outperforms prior cloaking algorithms in terms of the candidate query results and the cache utilization. © 2008 IEEE.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Exact Dynamic Programming for decentralized POMDPs with lossless policy compression

Exact Dynamic Programming for decentralized POMDPs with loss...

引用

18th International Conference on Automated Planning and Scheduling, ICAPS 2008

作者： Boularias, Abdeslam Chaib-Draa, Brahim Computer Science and Software Engineering Dept. Laval University QC Glk 7p4 Canada

ISBN: (纸本)9781577353867

High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a probability distribution over the system states and the policies of other agents. Belief compression is an efficient POMDP approach that speeds up planning algorithms by projecting the belief state space to a low-dimensional one. In this paper, we introduce a new method for solving DEC-POMDP problems, based on the compression of the policy belief space. The reduced policy space contains sequences of actions and observations that are linearly independent. We tested our approach on two benchmark problems, and the preliminary results confirm that Dynamic Programming algorithm scales up better when the policy belief is compressed. Copyright © 2008, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Using PSU for Early Prediction of COSMIC Size of Functional and Non-functional Requirements

引用

Joint Meeting of the International Workshop on software Measurement (IWSM)/MetriKon/Mensura 2008

作者： Buglione, Luigi Ormandjieva, Olga Daneva, Maya École de Technologie Supérieure (ETS) / Engineering.it Computer Science and Software Dept. Concordia University Information Systems Group University of Twente

ISBN: (纸本)9783540894025

The project effort calculation with a functional size measurement method such as COSMIC can only be properly performed after the "Requirements Analysis" phase in a Project Life Cycle. The goal of this research is to investigate an early and project-level tuned prediction of the product size with the intent to reduce the effect of the 'cone of uncertainty' phenomenon. The lack of size measurement methods which take into account the effect of the product non-functional requirements (NFR) on size also contributes to the above phenomenon. We propose to use the Project Size Unit (PSU) technique for predicting the product (FUR and NFR) size measured in COSMIC functional size units. Such early prediction will lower the cost of size counting the project and minimize the estimation error in the requirements phase. Furthermore, the PSU calculation procedure can be automated, which would further reduce the cost of size counting. The expected advantage of jointly using PSU and COSMIC is the ability to get early estimates of the whole project effort.

关键词： Project Size Prediction COSMIC Project Size Unit (PSU) Functional User Requirements (FUR) Non-Functional Requirements (NFR)

来源：评论

学校读者我要写书评

暂无评论

Construction of a smooth multivariate simulation environment from a finite one-to-one mapping 46

Construction of a smooth multivariate simulation environment...

引用

46th Annual Southeast Regional Conference on XX, ACM-SE 46

作者： Gittens, Shaun Auburn University Dept. of Computer Science and Software Engineering 3101 Shelby Center Auburn AL 36849-5347 United States

ISBN: (纸本)9781605581057

Complex computer-simulated environments are often sought in which autonomous agents can interact and their capabilities can be examined. Creating such simulated environments, however, can often be regarded as a very non-trivial undertaking. This work demonstrates how one can construct a smooth and continuous online environment which is easily computable and runs in polynomial time using a finite number of example function input/output pairs. Due to the manner of its construction, the newly created smooth mapping will give the same or similar outputs as the original one-to-one function it was derived from. Also, having no discontinuities, the constructed smooth mapping will not break should it be made to accept out-of-range or erroneous actions from an agent which engages it. Ultimately, this algorithm is used to construct an integral portion of a sequential environment which is utilized in a study to simulate the acquisition of phoneme sequence generating ability thought to occur in the brain. Copyright 2008 ACM.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Robust scheduling and runtime adaptation of multi-agent plan execution

Robust scheduling and runtime adaptation of multi-agent plan...

引用

2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

作者： Wang, Mingzhong Ramamohanarao, Kotagiri Chen, Jinjun Dept. of Computer Science and Software Engineering University of Melbourne VIC 3010 Australia Faculty of ICT Swinburne University of Technology VIC 3122 Australia

ISBN: (纸本)9780769534961

Robustness and reliability with respect to the successful completion of a schedule are crucial requirements for scheduling in multi-agent systems because agent autonomy makes execution environments dynamic and nondeterministic. We introduce a model to incorporate trust which indicates the probability that an agent will comply with its commitments into scheduling, thus improving the predicability and stability of the schedule. To deal with exceptions during execution, we adapt and evolve the schedule at runtime by interleaving the processes of evaluation, scheduling, execution and monitoring in the life cycle of a plan. Experiments show that schedules maximizing participants' trust are more likely to survive and succeed in open and dynamic environments. The results also prove that the proposed plan evaluation approach conforms with the simulation result, thus being helpful for plan selection. © 2008 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Bayes-adaptive POMDPs: A new perspective on the explore-exploit tradeoff in partially observable domains

Bayes-adaptive POMDPs: A new perspective on the explore-expl...

引用

10th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2008

作者： Pineau, Joelle Ross, Stephane Chaib-Draa, Brahim School of Computer Science McGill University Montreal QC H3A 2A7 Canada Computer Science and Software Engineering Dept. Laval University Québec QC Canada

Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning. However most investigations of Bayesian reinforcement learning to date focus on the standard Markov Decision Processes (MDPs). Our goal is to extend these ideas to the more general Partially Observable MDP (POMDP) framework, where the state is a hidden variable. This difficult decision-making problem can be formulated cleanly by simply extending the state to include the model parameters themselves. However closed-form solutions are not possible. This paper explores a family of approximations for solving this problem. These approaches are able to trade-off between (1) improving knowledge of the POMDP domain through interaction with the environment, (2) resolving uncertainty about the current state, and (3) choosing actions with high expected reward. Copyright © 2007, authors listed above. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共147页 << < 110 111 112 113 114 115 116 117 118 119 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：