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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

69 篇 会议
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

27 篇 工学
- 26 篇 计算机科学与技术...
- 18 篇 软件工程
- 4 篇 建筑学
- 3 篇 信息与通信工程
- 3 篇 土木工程
- 1 篇 冶金工程
- 1 篇 控制科学与工程
- 1 篇 轻工技术与工程
16 篇 管理学
- 13 篇 图书情报与档案管...
- 4 篇 管理科学与工程(可...
- 2 篇 工商管理
5 篇 理学
- 3 篇 数学
- 1 篇 物理学
- 1 篇 地球物理学

主题

24 篇 distributed comp...
12 篇 delay
10 篇 query processing
9 篇 ontologies
7 篇 computer archite...
7 篇 visualization
7 篇 information retr...
6 篇 owl
6 篇 semantics
5 篇 computer crashes
5 篇 xml
5 篇 throughput
5 篇 bandwidth
5 篇 condition monito...
5 篇 costs
5 篇 humans
5 篇 mobile computing
5 篇 fault detection
5 篇 ontology
4 篇 object detection

机构

21 篇 center for distr...
12 篇 centre for distr...
3 篇 center of distri...
3 篇 graz university ...
3 篇 centre for distr...
3 篇 centre for distr...
3 篇 center for distr...
3 篇 center of excell...
2 篇 centre for distr...
2 篇 center for distr...
2 篇 center for distr...
2 篇 center of semant...
2 篇 distributed & se...
2 篇 centre for distr...
1 篇 center for distr...
1 篇 centre for distr...
1 篇 knowledge manage...
1 篇 m. a. jinnah uni...
1 篇 center for softw...
1 篇 center for distr...

作者

30 篇 muhammad abdul q...
14 篇 qadir muhammad a...
9 篇 afzal muhammad t...
9 篇 syed zubair ahma...
8 篇 muhammad tanvir ...
5 篇 munir ahmad
5 篇 shujaat hussain
4 篇 sharif nauman
4 篇 m. abdul qadir
4 篇 mohammad saeed a...
4 篇 ahmad munir
3 篇 muhammad farhan ...
3 篇 fahad muhammad
3 篇 mohammad abdul q...
3 篇 ali tariq
3 篇 muhammad sanaull...
3 篇 adnan khalid
3 篇 syed adnan hussa...
2 篇 qadir m. abdul
2 篇 abdelaziz bouras

语言

71 篇 英文

检索条件"机构=Distributed and Semantic Computing"

共 71 条记录，以下是21-30 订阅

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

详细简洁

排序：

Graph based query trimming of conjunctive queries in semantic caching

Graph based query trimming of conjunctive queries in semanti...

引用

International Conference on Emerging Technologies, ICET

作者： Muhammad Azeem Abbas Muhammad Abdul Qadir Munir Ahmad Tariq Ali Naseer Ahmed Sajid Centre for Distributed and Semantic Computing (CDSC) Faculty of Engineering and Applied Sciences Mohammad Ali Jinnah University Islamabad Pakistan

In semantic cache query processing, an important step is query trimming. Trimming a query can potentially reduce the answer size that is required to retrieve from a remote server. Existing query trimming technique is based on Boolean logic, which inhibits several shortcomings such as after trimming it expands number of predicate terms and induces disjunction even if conjunctive queries are under consideration. It trims the query segment wise and can not process the combined semantics of all the segments in a cache. In this paper we propose a query trimming technique that is based on variation of modeling approach (graph based) used for satisfiability and implication testing. We demonstrated with a case study that our proposed technique overcomes limitations of the previous query trimming technique and hence improves semantic cache query processing.

关键词： semantics Remuneration Query processing Probes Servers Sun

来源：评论

学校读者我要写书评

暂无评论

Graph based query trimming algorithm for relational data semantic cache 10

Graph based query trimming algorithm for relational data sem...

引用

Proceedings of the International Conference on Management of Emergent Digital EcoSystems

作者： Ahmad, Munir Asghar, Sohail Qadir, M. Abdul Ali, Tariq Center for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

ISBN: (纸本)9781450300476

semantic cache enhances the capability of conventional (page/tuple) cache by adopting the dynamic strategy to group the contents and semantics of already processed queries. Query processing and cache management are two major activities for semantic caching. semantic caching demands efficient, correct and complete algorithms to process incoming queries. Efficiency of query processing activity in semantic cache mainly depends on query trimming. Query trimming process consists of two sub processes;query matching and query splitting. Efficient query matching and query splitting process will ensures the optimal query trimming process. In this paper, we have proposed query trimming algorithm by defining query matching algorithm and using query splitting algorithm from the literature. To optimize the query matching process we have proposed graph based semantic indexing scheme. On the basis of proposed indexing scheme we have designed query matching algorithm (qTrim). We have proved that complexity of graph based query matching algorithm is reduced to linear from exponential. Comparison of graph based (proposed) scheme is done with segment based scheme. On the basis of comparison and runtime complexity we have argued that the proposed algorithm is an optimum to trim the queries into sub-queries (probe and remainder). Copyright © 2010 ACM.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Evaluation of extended error taxonomy for OWL2

Evaluation of extended error taxonomy for OWL2

引用

2nd International Conference on Information and Emerging Technologies, ICIET 2010

作者： Sajid, Naseer Ahmed Qadir, Muhammad Abdul Ali, Tariq Center for Distributed and Semantic Computing Department of Computer Science Mohammad Ali Jinnah University Islamabad Pakistan

ISBN: (纸本)9781424480012

Ontology Evaluation is one of the most critical phases in ontology engineering. Applications depending upon ontology can have serious and appalling problems if ontology itself is infected with errors. Therefore, ontology should be consistent, complete and errors free. An error taxonomy using OWL constructs and axioms was developed to overcome the possibility of occurring errors in ontology. Recently, some new features have been proposed in OWL2 specification to overcome the limitation of expressive power of OWL. In this paper we evaluate the extended error taxonomy of OWL with the new features of OWL2. We also evaluate that while using OWL2 features, occurrence of possibility of new types of errors get reduced or not. On the basis of different examples for each error, we conclude that the error taxonomy is also valid for OWL2. This is because of the fact that every OWL ontology is a valid OWL2 ontology and every OWL2 ontology (excluding new features) is also a valid OWL ontology. The zero level circulatory errors can also be removed if we use the reflexive property and self restriction (local reflexive) property of OWL2. Otherwise, we have to generate a warning omission for zero level circulatory error. ©2010 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Constructing experts profiles from Linked Open Data

Constructing experts profiles from Linked Open Data

引用

International Conference on Emerging Technologies

作者： Latif, Atif Afzal, Muhammad Tanvir Tochtermann, Klaus Graz University of Technology Knowledge Management Institute Know Center Graz Austria Centre for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

ISBN: (纸本)9781424480586

Identification and assignment of (potential) experts to subject field is an important task in various settings and environments. In scientific domain, the identification of experts is normally based on number of factors like: number of publications, citation record, and experience etc. However, the discovered experts cannot be assigned reviewing duties immediately. One also need further information about expert like the country, university, service record, contributions, honors, and name of conferences/journals where the discovered expert is already serving as editor/reviewer. To some extent, this information can be found from search engines using heuristics, by applying Natural Language Processing, and Machine Learning techniques. However, the emergence of many semantically rich and structured datasets from Linked Open Data movement (LOD) can facilitate in more controlled search and fruitful results. This paper employs an automatic technique to find the required information about experts using LOD dataset. The expert profile is discovered, aggregated, clustered, structured, and visualized to the administration of peer-review system. The system has been implemented for an electronic journal such as Journal of Universal Computer Science (***). The proposed system facilitates *** administration to find potential reviewers for scientific papers to assign reviewing duties and to call new editors for computer science topics. © 2010 IEEE.

关键词： Linked data

来源：评论

学校读者我要写书评

暂无评论

Disjoint-knowledge analysis and preservation in ontology merging process

Disjoint-knowledge analysis and preservation in ontology mer...

引用

International Conference on Software Engineering Advances

作者： Fahad, Muhammad Moalla, Nejib Bouras, Abdelaziz Qadir, Muhammad Abdul Farukh, Muhammad University of Lyon2 CERRAL IUT-Lumiere Lyon II Bron France Center for Distributed and Semantic Computing M.A.J.U. Islamabad Pakistan

ISBN: (纸本)9780769541440

Ontology mapping and merging systems play a vital role that aim at promoting automatic interoperability among different heterogeneous systems, agents, web services or groups in open environments such as semantic Web. These systems help ontologists to resolve different types of conflicts among local ontologies to produce global merged ontology. This paper provides three contributions to the study and design of ontology merging systems that provides complete, consistent and coherent merged global ontology. First, we analyze that one of the important merge requirements is ignored yet by state-of-the-art ontology mapping and merging systems, i.e., Disjoint-knowledge Preservation between concepts. Second, we introduce another type of semantic conflict, which needs attention for consistent and coherent merged ontology, i.e., Alignment Conflict among disjoint relations. Third, we present an overview of our semantic-based ontology merger, DKP-OM, as a solution for the generation of global merged ontology that is consistent, coherent and complete with respect to local ontologies. We conclude that disjoint knowledge analysis for ontology merging is very much helpful for the detection of inconsistent initial mappings that originate from concept name or instance matching strategies, reduce search space for concept matching, and promote consistent computation by exploiting reliable logical inference on facts by axiomatization. © 2010 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Evaluation of extended error taxonomy for OWL2

Evaluation of extended error taxonomy for OWL2

引用

International Conference on Information and Emerging Technologies, ICIET

作者： Naseer Ahmed Sajid Muhammad Abdul Qadir Tariq Ali Center for Distributed and Semantic Computing Department of Computer Science Mohammad Ali Jinnah University Islamabad Pakistan

关键词： Ontologies Taxonomy Redundancy OWL semantics Animals Vocabulary

来源：评论

学校读者我要写书评

暂无评论

CAOWL-SAI: Context aware OWL based semantic association inference

CAOWL-SAI: Context aware OWL based semantic association infe...

引用

作者： Nazir, Saqib Afzal, Muhammad Tanvir Qadir, Muhammad Abdul Maurer, Hermann Centre for Distributed and Semantic Computing Mohammad Ali Jinnah University Jinnah Avenue Blue Area Islamabad Islamabad Pakistan Institute for Information Systems and Computer Media Graz University of Technology Inffeldgasse 16c 8010 Graz Austria

ISBN: (纸本)9788988678251

semantic Web unleashed a new era of data processing by enabling machines to understand the semantics of data. This semantic expression is achieved by formal representation of knowledge in data models such as RDF or OWL. The RDF and OWL data model can be envisioned as graph data models. The discovery of implicit relationships (termed as semantic associations) between entities in RDF graph had been the focus of research from quite some time now. The semantic associations are found using different path associations between entities in a RDF graph. This paper, however, exploits OWL constructs in an intelligent way to mine implicit relationships between semantic entities. The discovered relationships may not be found directly using RDF model. We employed our techniques on the available datasets of University ontology benchmark.

关键词： Birds

来源：评论

学校读者我要写书评

暂无评论

Disjoint-Knowledge Analysis and Preservation in Ontology Merging Process

Disjoint-Knowledge Analysis and Preservation in Ontology Mer...

引用

International Conference on Software Engineering Advances (ICSEA)

作者： Muhammad Fahad Nejib Moalla Abdelaziz Bouras Muhammad Abdul Qadir Muhammad Farukh CERRAL / IUT University of Lyon Bron France Center for distributed and Semantic Computing M. A. J. University Islamabad Pakistan

关键词： Ontologies Merging semantics OWL Pragmatics Redundancy Cognition

来源：评论

学校读者我要写书评

暂无评论

CAOWL-SAI: Context aware OWL based semantic association inference

CAOWL-SAI: Context aware OWL based semantic association infe...

引用

International Conference on Networked computing and Advanced Information Management (NCM)

作者： Saqib Nazir Muhammad Tanvir Afzal Muhammad Abdul Qadir Hermann Maurer Centre for Distributed and Semantic Computing Mohammad Ali Jinnah University Jinnah Avenue Islamabad Pakistan Inffeldgasse Institute for Information Systems and Computer Media Graz University of Technology Graz Austria

关键词： semantics Resource description framework OWL Data models Ontologies Search engines

来源：评论

学校读者我要写书评

暂无评论

An Opportunistic Multi-server Scheduling Approach for Service Guarantees through Mobile Routers

An Opportunistic Multi-server Scheduling Approach for Servic...

引用

International Conference on Advances in Future Internet

作者： Syed Zubair Ahmad Muhammad Abdul Qadir Abdelaziz Bouras Center for Distributed and Semantic Computing (CDSC) Mohammad Ali Jinnah University Islamabad Pakistan Research and Research-action Lumiere (CERRAL) IUT-Lumiere University Lumiere Lyon 2 Lyon France

ISBN: (纸本)9781424475285

In this paper, we have presented an opportunistic multi-server scheduling scheme that distributes traffic on multiple wireless interfaces of a mobile router to improve service guarantees for competing flows during mobility. The proposed adaptive, scalable, multi-server (ASM) scheduling scheme extends guaranteed-rate(GR) service model to ensure bounded service delays for each packet of flows in accordance with their committed rates. The major challenges handled through ASM scheduling include the unification of mutable heterogeneous wireless links into a single virtual channel with higher capacity. This approach enhances service guarantees without resource reservation on individual wireless links for diverse traffic sources. Hence, the transmission deadlines for multiple flows are maintained through transparently hiding disconnections during mobility. The simulation results of proposed scheme show higher degree of reliability and scalability of service provisioning during mobility.

关键词： Servers Delay Schedules Scheduling Wireless communication Availability Mobile communication

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：