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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

24 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

13 篇 工学
- 13 篇 计算机科学与技术...
- 10 篇 软件工程
- 2 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 轻工技术与工程
7 篇 管理学
- 7 篇 图书情报与档案管...
3 篇 理学
- 2 篇 数学
- 1 篇 物理学

主题

6 篇 query processing
5 篇 distributed comp...
4 篇 visualization
4 篇 information retr...
4 篇 delay
3 篇 probes
3 篇 costs
3 篇 semantics
2 篇 computer science
2 篇 indexing
2 篇 computer archite...
2 篇 xml
2 篇 owl
2 篇 ontologies
2 篇 bandwidth
2 篇 search engines
2 篇 resource descrip...
2 篇 humans
2 篇 protocols
2 篇 mobile computing

机构

12 篇 centre for distr...
3 篇 graz university ...
3 篇 centre for distr...
3 篇 centre for distr...
2 篇 centre for distr...
2 篇 centre for distr...
1 篇 centre for distr...
1 篇 knowledge manage...
1 篇 graz university ...
1 篇 centre for distr...
1 篇 knowledge manage...
1 篇 department of co...
1 篇 institute for in...
1 篇 institute for kn...
1 篇 inffeldgasse ins...
1 篇 centre for distr...
1 篇 capital universi...
1 篇 institute for kn...
1 篇 centre for distr...
1 篇 institute of man...

作者

9 篇 muhammad abdul q...
8 篇 afzal muhammad t...
5 篇 muhammad tanvir ...
4 篇 sharif nauman
3 篇 qadir muhammad a...
2 篇 muhammad farhan ...
2 篇 munir ahmad
2 篇 qadir mohammad a...
2 篇 muhamamd farhan ...
2 篇 muhammad azeem a...
1 篇 denis helic
1 篇 khan sher afgun
1 篇 maurer hermann
1 篇 sanaullah muhamm...
1 篇 mehmood rizwan
1 篇 naseer ahmed saj...
1 篇 nazir saqib
1 篇 saqib nazir
1 篇 naqvi mohsin
1 篇 latif atif

语言

25 篇 英文

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

共 25 条记录，以下是11-20 订阅

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

详细简洁

排序：

Throughput enhancement of simultaneous multipath communication using modified fast retransmit scheme

Throughput enhancement of simultaneous multipath communicati...

引用

International Conference on Computer Networks and Information Technology (ICCNIT)

作者： Samiullah Khan Syed Zubair Ahmed Mohammad Abdul Qadir Centre for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

The increased availability of communication resource through simultaneous use of multiple network interfaces of mobile and fixed devices has enabled higher bandwidth for streaming applications. The out-of-sequence arrival on such multipath transport configurations remains the major challenge to be overcome before the available potential is maximized. In this paper, we propose Modified Fast Retransmit (MFR) Scheme for the multi-homed stream control transmission protocol (SCTP) that minimizes the impact of possible out-of-sequence (OOS) arrival at the destination. The proposed scheme isolates local and global OOS arrivals and adapts fast retransmission strategy for global OOS arrival, in accordance to the end-to-end communication path characteristics. The essence of higher availability of bandwidth is also signified through the modified congestion control mechanism. The proposed scheme produces large boost in throughput of the streams transported through multiple paths, as compared to other schemes; such as Concurrent Multipath Transmission.

关键词： Radiation detectors Throughput

来源：评论

学校读者我要写书评

暂无评论

Extraction and visualization of citation network

Extraction and visualization of citation network

引用

International Conference on Computer Networks and Information Technology (ICCNIT)

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

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 papers 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.

关键词： Visualization Context Protocols

来源：评论

学校读者我要写书评

暂无评论

Citation network visualization of CiteSeer dataset

Citation network visualization of CiteSeer dataset

引用

International Conference on Computer Sciences and Convergence Information Technology (ICCIT)

作者： Afsheen Khalid Muhammad Tanvir Afzal Muhammad Abdul Qadir Institute of Management Sciences Peshawar China Centre for Distributed and Semantic Computing Mohammad Ali Jinnah University Islamabad Pakistan

Citation networks are very dense and large networks. The visualization of such dense networks is a tough task. Furthermore, most of the available tools provide visualization of such networks in the form of static images. However, the static images are not of any use for the users as user cannot interact with the system and cannot find the required information. In this paper, we have implemented a system that generates a dynamic network of citations. We have used CiteSeer dataset for citation network. We have provided the functionalities where a user can magnify the shown graph and can view all the citations of the required selected paper in a radial tree form. We have also provided a lens facility that provides a hyperbolic view and user can zoom in and out the graph in the area of lens. We created this citation network in Pajek tool and then extended the tool by incorporating JUNG libraries of java.

关键词： Layout Java Visualization Libraries Data visualization Lenses Social network services

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Constructing experts profiles from Linked Open Data

Constructing experts profiles from Linked Open Data

引用

International Conference on Emerging Technologies, ICET

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

关键词： Book reviews semantics Computer science Data mining Spirals System analysis and design Search engines

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An efficient query matching algorithm for relational data semantic cache

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

引用

International Conference on Computer, Control and Communication

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

ISBN: (纸本)9781424433131

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 O(2n-1), 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 distributed computing Probes Information retrieval Delay distributed databases Relational databases Database systems XML

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共3页 << < 1 2 3 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：