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

Temporal optimisations and temporal cardinality in the tOWL language

International Journal of web Engineering and technology 2012年第1期7卷 45-64页

作者： Milea, Viorel Frasincar, Flavius Kaymak, Uzay Houben, Geert-Jan Econometric Institute Erasmus University Rotterdam P.O. Box 1738 3000 DR Rotterdam Netherlands School of Industrial Engineering Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven Netherlands Web Information Systems Group Software Technology Department Delft University of Technology P.O. Box 5031 2600 GA Delft Netherlands

The tOWL language is a temporal web ontology language based on OWL-DL without nominals. The language enables the representation of time and time-related aspects, such as state transitions. The design choices of the language pose new challenges from a temporal perspective. One such challenge is the representation of temporal cardinality. Another challenge consists of optimising the temporal representations in order to reduce the number of axioms. One such optimisation is temporal coalescing, which merges concepts that are associated with time intervals that either meet or share at least one instant with each other. In this paper we formally introduce these concepts into the tOWL language and illustrate how they can be applied. © 2012 Inderscience Enterprises Ltd.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Asymptotic throughput for large-scale wireless networks with general node density

引用

Wireless Networks 2012年第5期19卷 559-575页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China The Tsinghua National Laboratory for Information Science and Technology (TNLIST) Department of Computer Science and Engineering Tongji University Shanghai China The Department of Computer Science Illinois Institute of Technology Chicago USA The TNLIST and School of Software Tsinghua University Beijing China CSE The Hong Kong University of Science and Technology Kowloon Hong Kong

We study the asymptotic throughput for a large-scale wireless ad hoc network consisting of n nodes under the generalized physical model. We directly compute the throughput of multicast sessions to unify the unicast and broadcast throughputs. We design two multicast schemes based on the so-called ordinary arterial road system and parallel arterial road system, respectively. Correspondingly, we derive the achievable multicast throughput by taking account of all possible cases of n s = ω(1) and 1 ≤ n d ≤ n − 1, rather than only the cases of $$n_s=\Uptheta(n)$$ as in most related works, where n s and n d denote the number of sessions and the number of destinations of each session, respectively. Furthermore, we consider the network with a general node density $$\lambda \in [1,n]$$ , while the models in most related works are either random dense network (RDN) or random extended network (REN) where the density is λ = n and λ = 1, respectively, which further enhances the generality of this work. Particularly, for the special case of our results by letting λ = 1 and $$n_s=\Uptheta(n)$$ , we show that for some regimes of n d , the multicast throughputs achieved by our schemes are better than those derived by the well-known percolation-based schemes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Feasibility of Double-Click Attack on a Passive Detection Quantum Key Distribution system

引用

Chinese Physics Letters 2011年第7期28卷 27-30页

作者： ZHANG Peng LI Chao Department of Mathematics and System Science Science CollegeNational University of Defense TechnologyChangsha 410073 State Key Laboratory of Information Security Institute of SoftwareChinese Academy of SciencesBeijing 100190

An eavesdropper(Eve)can exploit all the imperfections of a practical quantum key distribution(QKD)system to obtain some information about the secret key,no matter whether these imperfections are from the physical layer or from the post-processing *** propose a possible attack on a passive detection QKD system based on the imperfection from the software *** analysis shows that Eve can obtain all the information about the key without being discovered.

关键词： layer system quantum

来源：评论

学校读者我要写书评

暂无评论

A new addressing schema for mapping honeycomb into different topologies

引用

Recent Patents on Computer Science 2011年第3期4卷 211-216页

作者： Al-Shargabi, Bassam Al-Nahari, Abdulaziz Sabri, Alia Taha Faculty of Information Technology Department of Software engineering Isra University P O Box 33 Amman 11622 Jordan Applied Science Sana'a Community College Sana'a Yemen Faculty of Information Technology Department of Networking Information system Applied Science University Amman Jordan

In a parallel system, nodes communicate with each other by exchanging messages. Different topologies exist for arranging processors in a network based on the architecture of the network;or based on the fact that a network is a multiprocessor or multi computer network. A honeycomb network is considered as a multiprocessor / multi-computer interconnection network where each node represents a processor/computer and each line represents a link between two computers. In this paper a new addressing schema is presented for the honeycomb network;which can be used in many levels. The rest of the paper defines some methods of mapping the honeycomb into bus, tree, grid in addition to a proposed cluster-based architecture. Mapping the honeycomb requires however some compromising;such as ignoring some links or adding others. Recent patent and research advances aim to find methods for reducing the complexity of mapping honeycomb into other topologies. © 2011 Bentham Science Publishers.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

A comparative study for Arabic text classification algorithms based on stop words elimination 11

A comparative study for Arabic text classification algorithm...

引用

Proceedings of the 2011 International Conference on Intelligent Semantic web-Services and Applications

作者： Al-Shargabi, Bassam Al-Romimah, Waseem Olayah, Fekry Software Engineering Department Faculty of Information Technology Al-Isra University Amman Jordan Computer Information System Department Faculty of Information Technology University of Science and Technology Sana'a Yemen Management Information System Department Faculty of Administrative Science Al-Isra University Amman Jordan

ISBN: (纸本)9781450304740

This paper compares three techniques for Arabic text classification;these techniques are Support Vector Machine (SVM) with Sequential Minimal Optimization (SMO), Naïve Bayesian (NB), and J48. The main objective of this paper is to measure the accuracy for each classifier and to determine which classifier is more accurate for Arabic text classification based on stop words elimination. The accuracy for classifier is measured by Percentage split method (holdout), and K-fold cross validation methods,. The results show that the SMO classifier achieves the highest accuracy and the lowest error rate, and shows that the time needed to build the SMO model is the smallest time. © 2010 ACM.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Creating granular learning object towards reusability of Learning Object in e-learning context

Creating granular learning object towards reusability of Lea...

引用

2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011

作者： Noor, Siti Fadzilah Mat Yusof, Norazah Hashim, Siti Zaiton Mohd School of Information Technology Faculty of Technology and Information Science National University of Malaysia Malaysia Software Engineering Department Faculty of Computer Science and Information System University Technology of Malaysia Malaysia

ISBN: (纸本)9781457707520

Learning Object (LO) is one of the main research topics in the e-learning community in the recent years, and most researchers pay attention to the issue of Learning Object Reusability. The most obvious motivation is the economic interest of reusing learning material instead of repeatedly authoring it. In this paper we present the process of creating granular learning object for enabling the reusing of LO in e-Learning context. Reusability requires the LO to be in a fine-grain form because raw media elements are often much easier to reuse then aggregate assemblies. In other words, as the LO size decreases (lower granularity), its potential for reuse increases. A prototype of learning objects repository that contain granular LO has been developed to show the process of granularizing LO. Each of existing LO will be extracted into granular element with the metadata and the system generated unique id for each LO based on its identifier (URL of LO) and save automatically the metadata contain in the LO. These metadata will be used for searching and retrieval process of the granule LO. © 2011 IEEE.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

DETECTING CRITICAL LEAST ASSOCIATION RULES IN MEDICAL DATABASES

引用

International Journal of Modern Physics: Conference Series 2012年第9期ijmpcs卷 464-479页

作者： ZAILANI ABDULLAH TUTUT HERAWAN MUSTAFA MAT DERIS Department of Computer Science Universiti Malaysia Terengganu Mengabang Telipot Kuala Terengganu 21030 Terengganu Malaysia Database and Knowledge Management Research Group Faculty of Computer System and Software Engineering Universiti Malaysia Pahang Lebuhraya Tun Razak Gambang 26300 Kuantan Pahang Malaysia Faculty of Computer Science and Information Technology Universiti Tun Hussein Onn Malaysia Parit Raja 86400 Batu Pahat Johor Malaysia

Least association rules are corresponded to the rarity or irregularity relationship among itemset in database. Mining these rules is very difficult and rarely focused since it always involves with infrequent and exceptional cases. In certain medical data, detecting these rules is very critical and most valuable. However, mathematical formulation and evaluation of the new proposed measurement are not really impressive. Therefore, in this paper we applied our novel measurement called Critical Relative Support (CRS) to mine the critical least association rules from medical dataset. We also employed our scalable algorithm called Significant Least Pattern Growth algorithm (SLP-Growth) to mine the respective association rules. Experiment with two benchmarked medical datasets, Breast Cancer and Cardiac Single Proton Emission Computed Tomography (SPECT) Images proves that CRS can be used to detect to the pertinent rules and thus verify its scalability.

关键词： Critical least association rules medial data

来源：评论

学校读者我要写书评

暂无评论

Integration of cultural dimensions into software localisation testing of assistive technology for deaf children

Integration of cultural dimensions into software localisatio...

引用

2011 5th Malaysian Conference in software Engineering, MySEC 2011

作者： Ping, Tan Ping Chan, Chiu Po Sharbini, Hamizan Julaihi, Azlina Ahmadi Department of Computing and Software Engineering Faculty of Computer Science and Information Technology Universiti Malaysia Sarawak Malaysia Department of Information Systems Faculty of Computer Science and Information Technology Universiti Malaysia Sarawak Malaysia Department of Computer System and Comm. Technologies Faculty of Computer Science and Information Technology Universiti Malaysia Sarawak Malaysia

ISBN: (纸本)9781457715310

Lack of hearing ability hinders deaf children from mastering grammar in language studies. Unfortunately, such software targeting Malay language is limited. This paper attempts to generate new approach in handling such software. These include detection of defects when switching into local languages, date format and accommodating the local laws. The acceptance of international software for local use goes beyond just these aspects. For this purpose, software that supports the multi-languages is evaluated. The main research question of this paper: The lack of cultural dimensions in localisation testing of assistive technology decreases the effectiveness of localisation testing of the localised software. On the account of cultural dimensions, Hofstede's Cultural Dimensions will be experimented to study which cultural dimensions are most suited for such software. From our empirical results, the failure rate of the testing is higher compared to incorporating culture dimensions. © 2011 IEEE.

关键词： Audition

来源：评论

学校读者我要写书评

暂无评论

Real-time volume caustics with image-based photon tracing

Real-time volume caustics with image-based photon tracing

引用

12th International Conference on Computer-Aided Design and Computer Graphics, CAD/Graphics 2011

作者： Wang, Yuxiang Wang, Bin Chen, Li School of Software Tsinghua University China Department of Computer Science and Technology Tsinghua University China Laboratory for Information System Security Ministry of Education of China China Tsinghua National Laboratory for Information Science and Technology China

ISBN: (纸本)9780769544977

Rendering of volume caustics in participating media is often expensive, even with different acceleration approaches. Basic volume photon tracing is used to render such effects, but rather slow due to its massive quantity of photons to be traced. In this paper we present an image-based volume photon tracing method for rendering volume caustics at real-time frame rates. Motivated by multi-image based photon tracing, our technique uses multiple depth maps to accelerate the intersection test procedure, achieving a plausible and fast rendering of volume caustics. Each photon dynamically selects the depth map layer for intersection test, and the test converges to an approximate solution using image space methods in a few recursions. This allows us to compute photon distribution in participating media while avoiding massive computation on accurate intersection tests with scene geometry. We demonstrate that our technique, combined with photon splatting techniques, is able to render volume caustics caused by multiple refractions. © 2011 IEEE.

关键词： Photons

来源：评论

学校读者我要写书评

暂无评论

Efficiently querying business process models with BeehiveZ

Efficiently querying business process models with BeehiveZ

引用

19th Conference on Business Process Management 2011, BPM 2011

作者： Jin, Tao Wang, Jianmin Wen, Lijie Department of Computer Science and Technology Tsinghua University China School of Software Tsinghua University China Key Laboratory for Information System Security Ministry of Education China Tsinghua National Laboratory for Information Science and Technology China

The technology of business process management is being more widely used, and there are more and more business process models. In this demonstration, we show how to query a large number of models efficiently with BeehiveZ. Four types of queries are all supported in BeehiveZ, i.e. exact query based on structure, similarity query based on structure, exact query based on behavior, similarity query based on behavior. BeehiveZ provides different indexes to facilitate the efficient query processing of different types of queries. To make BeehiveZ more applicable, label similarity is considered.

关键词： Enterprise resource management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：