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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1-10 订阅

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

详细简洁

排序：

Exploiting Title-Keywords Relation to Develop Concept Classifier for Scientific Community

引用

4th International Conference on Networked Digital Technologies, NDT 2012

作者： Khan, Sher Afgun Afzal, Muhammad Tanvir Qadir, Muhammad Abdul Centre for Distributed and Semantic Computing Mohammad Ali Jinnah University Pakistan

ISBN: (纸本)9783642305665

The exponential growth of scientific resources on the web has raised scalability issues like quick retrieval of relevant resource. The major obstacle is attributed to unstructured nature of information. It is estimated that the scientific knowledge is doubling in every five years. This information is being indexed by search engines, citation indexes, and digital libraries etc. Most of the time, the indexed information is unstructured or semi-structured. Therefore, the users are unable to find the relevant research papers. Users are given thousands and sometimes millions of irrelevant hits. This is mainly due to the unstructured nature of information being stored. For a query, the information retrieval may be restricted to the relevant resources if the resources are structured in a classification. Some classifications are being used in different domains such as in computer science, the ACM classification scheme is being used to structure the research papers. However, the ACM classification was majorly updated in 1998 and does not include evolving concepts and domains since then. Furthermore, only ACM papers are classified using ACM classification scheme while other publishers normally do not use this classification. Therefore, the automatic classification becomes a major challenge for scientific community. Several approaches are being used for creating automatic classification on the basis of co-occurrence analysis, keywords analysis, and using domain models, etc. However, the current approaches have their limitations. In this paper, we proposed and implemented a new approach of finding the evolving classification, termed as concept classifier for the scientific community by aggregating the correlation between title terms and keywords of the paper. Initially the experiment has been conducted over the dataset of journal i.e. Journal of Universal Computer Science (***). The resultant taxonomy has been verified and compared with the Growbag dataset (DBLP dataset of co

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

semantic Aware Implication and Satisfiability for Conjunctive Queries in semantic Caching

Semantic Aware Implication and Satisfiability for Conjunctiv...

引用

4th International Conference on Networked Digital Technologies, NDT 2012

作者： Abbas, Muhammad Azeem Qadir, Muhammad Abdul Ahmad, Munir Ali, Tariq Center for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

ISBN: (纸本)9783642305061

Finding satisfiability and implication results among queries is fundamental to several problems in databases especially in distributed databases. The known complexity of finding satisfiability of term S is O({pipe}S{pipe}3). Similarly complexity of finding "Is S implies T (S→T)" is O(S3+K) Where {pipe}S{pipe} is the number of distinct predicate attributes in S, and K is the number of predicate terms in T (S and T are conjunctive select-project-join(PSJ) queries). We show that with the induction of Cross Attribute Knowledge (CRA) the above complexity is reduced to O({pipe}S - CRA{pipe}3) and O({pipe}S - CRA{pipe}3+K) for satisfiability and implication respectively. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Efficient query processing over semantic cache

Efficient query processing over semantic cache

引用

Intelligent Systems and Agents 2008, MCCSIS'08 - IADIS Multi Conference on Computer Science and Information Systems

作者： Ahmad, Munir Qadir, Muhammad Abdul Razaque, Abdul Ullah, Muhammad Sana Center for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

ISBN: (纸本)9789728924607

semantic cache reduces the latencies of retrieving of data over distributed system by reusing already retrieved data. It improves the performance (response time) of the system with limited bandwidth. Cache management and query processing over semantic cache are two major activities which should be handled carefully. Query processing plays a major role to reuse the retrieved data efficiently. Efficient query processing algorithms made the semantic cache more efficient. This paper identifies four issues that became the cause of decreasing the efficiency of query processing's algorithm. Solution is also provided to identified issues to improve the efficiency of query processing. Improvement in efficiency is discussed along each of the issue. Efficiency analysis for enhanced algorithm is also provided. © 2008 IADIS.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Detection of crashed objects in eACID and its comparision with other techniques

Detection of crashed objects in eACID and its comparision wi...

引用

2009 IEEE 13th International Multitopic Conference, INMIC 2009

作者： Hussain, Shujaat Qadir, Muhammad Abdul Center for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

ISBN: (纸本)9781424448722

Failure detectors are one of the key components of fault tolerant distributed systems as it is very important to determine the suspected/crashed object and take recovery steps to keep the system going. The main objective of the fault monitoring activity is to quickly and correctly identify the faults. A fault monitoring system which is quick to declare faults increases the chances of false alarms, i.e., declaration of a fault which is actually not a fault. Therefore, an ideal fault monitoring system needs to be as quick as possible in identification of faults without increasing the false alarms. One of the major responsibilities of the monitor is to adapt these intervals according to the dynamic network and system conditions, and set them close to the actual delays in the system. The adaptation of the delays, timeout and monitoring intervals, must not fluctuate with large amplitudes around the actual delays. Otherwise, the number of false alarms would increase or the identification of faults will be delayed. Our algorithm with the name of eACID (enhanced Adaptive Convergent Intelligent fault monitoring in distributed systems), when compared with the best known algorithm, ADAPTATION [Sotama et al.], yielded 16% less false timeouts and 9% more utilization of responses. eACID adapts the timeout on the previous history which gives us a fair idea about the work load and we use it to our advantage. Our scheme does not take decisions on transient behaviors of the system, moreover it has a threshold which is set after having intimate knowledge of past network behavior. These threshold depend on consecutive timeouts occurred/ If this threshold is crossed, it is declared dead. ©2009 IEEE.

关键词： Monitoring

来源：评论

学校读者我要写书评

暂无评论

Warnings for disjoint knowledge omission in ontologies

Warnings for disjoint knowledge omission in ontologies

引用

2nd International Conference on Internet and Web Applications and Services, ICIW'07

作者： Qadir, Muhammad Abdul Noshairwan, Wajahat Center for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

ISBN: (纸本)0769528449

Structured knowledge is the most important component of semantic based information systems required to automate intelligent tasks which are normally performed by expert humans. The knowledge about a domain is typically structured in the form of Ontologies. An ontology organizes basic terms and the rules for combining these terms in the form that is machine-interpretable and machine-understandable. Therefore, defining an ontology should be considered an important and serious task with well-defined tools and techniques to verify and validate it. A considerable work is being done to define the processes to develop Ontologies for every phase of its life-cycle [1]. Automated tools to evaluate the contents of an ontology are a great help for large scale ontology developers. We formulated some ontologies to represent real life situations and left certain errors in those ontologies intentionally to see whether these tools would raise the alarm or not. To our surprise, there were some important situations where the alarm should have been raised, but we did not get any warning. In this paper, we report those situations and present algorithms to raise the alarm. We have surveyed the available literature with reference to these situations, and unfortunately could not found satisfactory answer. This paper also summarizes the survey. One of the most difficult situation to detect with automated tools is the incompleteness. This requires the intervention of the domain experts / ontology developers. We discovered that disjoint knowledge and exhaustive knowledge omissions are not being handled by existing tools to raise an alarm for the developers. Algorithms have been proposed to tackle these situations. These algorithms have been executed on a number of case studies. We found them working properly. © 2007 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A framework for ontology evaluation

A framework for ontology evaluation

引用

16th International Conference on Conceptual Structures, ICCS 2008

作者： Fahad, Muhammad Qadir, Muhammad Abdul Center for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

Mapping and merging of multiple ontologies to produce consistent, coherent and correct merged global ontology is an essential process to enable heterogeneous multi-vendors semantic-based systems to communicate with each other. To generate such a global ontology automatically, the individual ontologies must be free of (all types of) errors. We have observed that the present error classification does not include all the errors. This paper extends the existing error classification (Inconsistency, Incompleteness and Redundancy) and provides a discussion about the consequences of these errors. We highlight the problems that we faced while developing our DKP-OM, ontology merging system and explain how these errors became obstacles in efficient ontology merging process. It integrates the ontological errors and design anomalies for content evaluation of ontologies under one framework. This framework helps ontologists to build semantically correct ontology free from errors that enables effective and automatic ontology mapping and merging with lesser user intervention.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

OntRel: An optimized relational structure for storage of dynamic OWL-DL ontologies

OntRel: An optimized relational structure for storage of dyn...

引用

2009 IEEE 13th International Multitopic Conference, INMIC 2009

作者： Khalid, Adnan Shah, Syed Adnan Hussain Qadir, Muhammad Abdul Center for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

ISBN: (纸本)9781424448722

Ontology is one of the most important components of semantic based information systems which provides context to the document. Ontology enables us to define relationship between different terminologies from diverse domains. To interpret this information and perform reasoning we require to store Ontologies in a way that retrieval becomes easy. Ontologies are defined using OWL (Web Ontology Language) which is based on XML. All the OWL documents are stored in the form of specialized XML files. With the increase in the semantic websites number of Ontologies describing different domains also grow and with their growth there comes a problem of storing these Ontologies. With the passage of time it has been established that RDBMS (Relational Database Management Systems) is the most efficient and reliable Data Structure in terms of storage and retrieval. To store OWL documents in RDBMS multiple techniques have been proposed, but they still lack the advantages of RDBMS. All the databases in RDBMS are closed in nature, but OWL documents are inherently dynamic and semi-structured. So, there is a need to preserve the dynamic OWL documents in the Relational structure in such an way that no data or relationship is lost and advantages of RDBMS are also gained. This paper briefly presents the survey of existing ontologies with comparative analysis on the basis of Load Time and Query Performance. Secondly, this paper makes a contribution by proposing a rule based approach to improve the downside of earlier techniques. ©2009 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Extraction and visualization of citation network

Extraction and visualization of citation network

引用

1st International Conference on Computer Networks and Information Technology, ICCNIT'11

作者： Naqvi, Mohsin Mailk, Ahmad Usman Razzaq, Sohail Afzal, Muhammad Tanvir Centre for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

ISBN: (纸本)9781612849416

The digital information is expanding with exponential curve. It becomes difficult to find the relevant information. For example, in scientific domain, to identify the most relevant paper for the focused paper, one needs to explore the focused paper's citations using some citation index such as Google Scholar etc. However, the focused paper may receive 100's and sometimes 1000's of citations. With this huge number of citations, it becomes difficult for users to find the highly relevant papers with respect to the focused paper. While exploring the relevant papers from citations of the focused paper, the user may end up with finding only few. This is because of the fact that authors often cite a paper for providing a background study of the domain and hence cited and cited-by paper have no strong relationship. Currently users need to skim all citations to filter such papers. There is a dire need to develop a system that could automate the process of finding the most relevant papers from the citations. In the current work, we have proposed such a system which ranks the most relevant cited phapers for a cited-by paper. The system conceptualizes citations as a graph model. Furthermore, the system employs number of weights to find the most relevant papers. Such weights include topic weight, keyword weight, and author weight. The edge between two nodes in the graph gets a maximum Weight if both are the most relevant papers. Subsequently, a visualization technique has been designed to visualize the graph. We have used the dataset of Journal of Universal Computer Science having 1400 papers and 6090 citations. The manual inspection has revealed that the top ranked papers were actually the most relevant papers. © 2011 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

An efficient query matching algorithm for relational data semantic cache

An efficient query matching algorithm for relational data se...

引用

2009 2nd International Conference on Computer, Control and Communication, IC4 2009

作者： Ahmad, Munir Sanaullah, Muhammad Qadir, Muhammad Abdul Bashir, Muhammad Farhan Centre for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

ISBN: (纸本)9781424433148

Data access latency can be reduced for databases by using caching. semantic caching enhances the performance of normal caching by locally answering the partially overlapped queries. Query processing (generation of probe and remainder query from the incoming queries) and cache management need to be addressed in its totality to really enjoy these benefits. That is, there is a need of correct, complete and efficient algorithms to process incoming queries and to manage semantic and data cache. In this paper, we address this issue in the context of query processing. We have observed that the algorithm proposed by Q. Ren and his colleagues has some inefficiencies and redundancies. To overcome these inefficiencies and redundancies, we have proposed an algorithm for query matching with hierarchal stored query semantics. Proposed algorithm performs matching of stored semantics in cache with semantics of incoming query. It also has capability to generate amending query efficiently and rejects incorrect queries at initial level. Comparison of proposed algorithm is made with existing algorithm. Complexity of proposed query matching algorithm is O(n) which is smaller then the existing which have 0(2n-l), n is number of attributes in a relation. Also, the proposed algorithm is capable to stop the useless processing as was done in the previous algorithms.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：