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

作者： Nguyen, Ngoc Thanh Nguyen, Van Du Hwang, Dosam Division of Knowledge and System Engineering for ICT Faculty of Information Technology Ton Duc Thang University Ho Chi Minh City Viet Nam Faculty of Computer Science and Management Wroclaw University of Science and Technology Poland Department of Computer Engineering Yeungnam University Korea Republic of

Collective knowledge is understood as the common knowledge state of a collective consisting of autonomous units. The knowledge states referred from these autonomous units to some degree reflect the real knowledge state of a subject in the real world, but it is not known to what degree because of incompleteness and uncertainty. Although collective knowledge determination is an important task because these knowledge states can be different from each other, there exists another important issue with its quality. The quality of collective knowledge is based on the difference between the real knowledge state and the collective knowledge. In this study, we investigate the influence of the number of collective members on the quality of collective knowledge. Through experimental analysis, the larger collective we use, the better the quality of collective knowledge will be. In other words, the large number of collective members positively affects the quality of collective knowledge. Besides, some theorems about the relationship between the collective knowledge and the knowledge states in a collective, the influence of adding or removing members on the quality of collective knowledge are also proved. © 2017 - IOS Press and the authors. All rights reserved.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Collective intelligent information and database systems

Collective intelligent information and database systems

引用

作者： Nguyen, Ngoc-Thanh Núñez, Manuel Trawiski, Bogdan Division of Knowledge and System Engineering for ICT Faculty of Information Technology Ton Duc Thang University Ho Chi Minh City Viet Nam Faculty of Computer Science Complutense University of Madrid Spain Faculty of Computer Science and Management Wroclaw University of Science and Technology Poland

Collective intelligence is most often understood as group intelligence which arises on the basis of intelligences of the group members. This paper presents an overview of application of collective intelligence methods in knowledge engineering and in processing collective data. It also introduces papers included in this issue. © 2017 - IOS Press and the authors. All rights reserved.

关键词： Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

Bisimulation-based concept learning for information systems in description logics

引用

Vietnam Journal of Computer Science 2015年第3期2卷 149-167页

作者： Thanh-Luong Tran Linh Anh Nguyen Thi-Lan-Giao Hoang College of Sciences Hue University Hue city Vietnam Division of Knowledge and System Engineering for ICT Ton Duc Thang University Ho Chi Minh City Vietnam Institute of Informatics University of Warsaw Warsaw Poland

In description logic-based information systems, objects are described not only by attributes but also by binary relations between them. This work studies concept learning in such information systems. It extends the bisimulation-based concept learning method of Nguyen and Szałas (Rough sets and intelligent systems. Springer, Berlin, pp 517–543, 2013). We take attributes as basic elements of the language. Each attribute may be discrete or numeric. A Boolean attribute is treated as a concept name. This approach is more general and suitable for practical information systems based on description logic than the one of Nguyen and Szałas (Rough sets and intelligent systems. Springer, Berlin, pp 517–543, 2013). As further extensions, we also allow data roles and the concept constructors “functionality” and “unqualified number restrictions”. We formulate and prove an important theorem on basic selectors. We also present a domain partitioning method based on information gain that has been used for our implementation of the method. Apart from basic selectors and simple selectors, we introduce a new kind of selectors, called extended selectors. The evaluation results show that our concept learning method is valuable and extended selectors support it significantly.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A scalable routing mechanism for stateful microservices

A scalable routing mechanism for stateful microservices

引用

International Conference on Intelligence in Next Generation Networks (ICIN)

作者： Nam H. Do Tien Van Do Xuan Thi Tran Lóránt Farkas Csaba Rotter Division of Knowledge and System Engineering for ICT (KSE-ICT) Ton Duc Thang University HCM City Vietnam Analysis Design and Development of ICT systems (AddICT) Laboratory Budapest University of Technology and Economics Budapest Hungary Nokia Bell Labs Budapest Hungary

ISBN: (纸本)9781509036738

Scalability is an important requirement in the development and the operation of applications in a cloud environment. To handling heavy concurrency in the input load, many design-related and operational factors should be considered. The microservice architecture patterns provide better means to increase the scalability than traditional software architecture patterns. However, certain aspects of applications such as the need to persist/maintain the application state require additional measures in the design and the supporting mechanism. We propose a scalable routing mechanism for applications designed according to the microservice architecture. In particular, a cloud infrastructure resource reservation application has been designed with some stateful services. The proposed approach maintains a good scalability, which provides a mean to achieve the efficient usage of the infrastructure resources.

关键词： Business Routing Scalability Cloud computing Context Computer architecture Servers

来源：评论

学校读者我要写书评

暂无评论

On the possibility of correct concept learning in description logics

引用

Vietnam Journal of Computer Science 2017年第1期5卷 3-14页

作者： Ali Rezaei Divroodi Quang-Thuy Ha Linh Anh Nguyen Hung Son Nguyen Education Department Noshahr Iran Faculty of Information Technology VNU University of Engineering and Technology Hanoi Vietnam Division of Knowledge and System Engineering for ICT Ton Duc Thang University Ho Chi Minh City Vietnam Institute of Informatics University of Warsaw Warsaw Poland

It is well known that any Boolean function in classical propositional calculus can be learned correctly if the training information system is good enough. In this paper, we extend that result for description logics. We prove that any concept in any description logic that extends $$\mathcal {ALC}$$ with some features amongst I (inverse roles), $$Q_k$$ (qualified number restrictions with numbers bounded by a constant k), and $$\mathsf {Self}$$ (local reflexivity of a role) can be learned correctly if the training information system (specified as a finite interpretation) is good enough. That is, there exists a learning algorithm such that, for every concept C of those logics, there exists a training information system such that applying the learning algorithm to it results in a concept equivalent to C. For this result, we introduce universal interpretations and bounded bisimulation in description logics and develop an appropriate learning algorithm. We also generalize common types of queries for description logics, introduce interpretation queries, and present some consequences.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Provision of Disk I/O Guarantee for MapReduce Applications

Provision of Disk I/O Guarantee for MapReduce Applications

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Xuan Thi Tran Tien Van Do Nam H. Do Lorant Farkas Csaba Rotter Design & Dev. of ICT Syst. (AddICT) Lab Budapest University of Technology and Economics Budapest Hungary Div. of Knowledge & Syst. Eng ICT (KSE-ICT) Ton Duc Thang Univ. Vietnam Division of Knowledge and System Engineering for ICT (KSE-ICT) Ton Duc Thang University HCM City Vietnam Analysis Design and Development of ICT systems (AddICT) Laboratory Budapest University of Technology and Economics Budapest Hungary Nokia Networks Budapest Hungary

ISBN: (纸本)9781467379533

YARN is an emerging resource management in the Hadoop ecosystem, where big data in the scale of petabytes/day are processed with the use of commercial off-the-shelf servers. At present YARN supports only RAM and CPU reservation/control. However, the reservation and the control of disk I/O throughput are also needed to provide a satisfactory performance for MapReduce applications. In this paper, we propose a solution with software components that can be integrated into YARN to support the reservation of disk I/O throughput in YARN. Experiments show that a proposed solution can provide a disk I/O throughput guarantee for MapReduce applications.

关键词： Delays Yarn Throughput Resource management Containers TCPIP

来源：评论

学校读者我要写书评

暂无评论

A method for mining top-rank- k frequent closed itemsets

A method for mining top-rank- k frequent closed itemsets

引用

作者： Nguyen, Loan T.T. Trinh, Truc Nguyen, Ngoc-Thanh Vo, Bay Division of Knowledge and System Engineering for ICT Ton Duc Thang University Ho Chi Minh City Viet Nam Faculty of Information Technology Ton Duc Thang University Ho Chi Minh City Viet Nam VOV College Ho Chi Minh City Viet Nam Faculty of Computer Science and Management Wroclaw University of Science and Technology Wrocaw Poland Faculty of Information Technology Ho Chi Minh City University of Technology Viet Nam

Mining frequent closed itemsets (FCIs) is important in mining non-redundant (minimal) association rules. Therefore, many algorithms have been developed for mining FCIs with reduced mining time and memory usage. For mining FCIs, algorithms use the minimum support threshold, minSup, to prune itemsets. However, using a fixed minSup is not suitable for mining top-rank-k FCIs. A large threshold will lead to a small number of generated FCIs, leading to insufficient FCIs to query when k is large. On the other hand, a small minSup will generate a huge number of generated FCIs, leading to large runtimes and high memory usage. In this paper, we propose a method for mining top-rank-k FCIs without using a fixed minimum support threshold. A strategy is first used to eliminate 1-items that cannot generate FCIs belonging to top-rank-k FCIs. Next, based on the set of candidate 1-items, we propose TRK-FCI, a DCI-Plus-based algorithm, for mining top-rank-k FCIs. In the process of mining top-rank-k FCIs, TRK-FCI automatically increases minSup according to the mined FCIs, efficiently pruning itemsets that cannot belong to top-rank-k FCIs. We also modify the dynamic bit vector (DBV) structure and apply it to reduce memory usage and runtime in the TRK-FCI-DBV algorithm. Experimental results show that TRK-FCI-DBV is more efficient than TRK-FCI for various databases. © 2017 - IOS Press and the authors. All rights reserved.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

引用

2016 IEEE International Conference on systems, Man, and Cybernetics, SMC 2016

作者： Nguyen, Linh Anh Nguyen, Thi Hong Khanh Nguyen, Ngoc-Thanh Ha, Quang-Thuy Division of Knowledge and System Engineering for ICT Faculty of Information Technology Ton Duc Thang University Ho Chi Minh City Viet Nam Institute of Informatics University of Warsaw Banacha 2 Warsaw02-097 Poland Electric Power University 235 Hoang Quoc Viet Tu Liem Hanoi Viet Nam Department of Information Systems Faculty of Computer Science and Management Wroclaw University of Technology Poland Faculty of Information Technology VNU University of Engineering and Technology 144 Xuan Thuy Hanoi Viet Nam

ISBN: (纸本)9781509018970

We introduce comparisons with respect to information between interpretations in paraconsistent description logics and use them to define bisimilarity for such logics. As bisimilarity is a natural notion for characterizing indiscernibility in modal and description logics, it is useful for concept learning in description logics also when inconsistencies occur. We give preservation results and the Hennessy-Milner property for comparisons with respect to information in paraconsistent description logics. As consequences, we also obtain invariance results and the Hennessy-Milner property for bisimilarity in paraconsistent description logics. © 2016 IEEE.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

引用

作者： Nguyen, Linh Anh Nguyen, Thi Hong Khanh Nguyen, Ngoc-Thanh Ha, Quang-Thuy Division of Knowledge and System Engineering for ICT Faculty of Information Technology Ton Duc Thang University Ho Chi Minh City Viet Nam Institute of Informatics University of Warsaw Warsaw Poland Electric Power University Hoang Quoc Viet Tu Liem Hanoi Viet Nam Department of Information Systems Faculty of Computer Science and Management Wroclaw University of Science and Technology Str. Wyb. Wyspianskiego 27 Wroclaw50-370 Poland Faculty of Information Technology VNU University of Engineering and Technology Xuan Thuy Hanoi Viet Nam

We introduce comparisons w.r.t. information between interpretations in paraconsistent description logics and use them to define bisimilarity for such logics. This notion is useful for concept learning in description logics when inconsistencies occur. We give preservation results and the Hennessy-Milner property for comparisons w.r.t. information in paraconsistent description logics. As consequences, we obtain also invariance results and the Hennessy-Milner property for bisimilarity in paraconsistent description logics. © 2017 - IOS Press and the authors. All rights reserved.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

Towards richer rule languages with polynomial data complexity for the Semantic Web

Towards richer rule languages with polynomial data complexit...

引用

作者： Nguyen, Linh Anh Nguyen, Thi-Bich-Loc Szalas, Andrzej Division of Knowledge and System Engineering for ICT Faculty of Information Technology Ton Duc Thang University No. 19 Nguyen Huu Tho Street Tan Phong Ward District 7 Ho Chi Minh City Viet Nam Institute of Informatics University of Warsaw Banacha 2 Warsaw02-097 Poland Department of Information Technology Hue University of Sciences 77 Nguyen Hue Hue city Viet Nam Department of Computer and Information Science Linköping University LinköpingSE-581 83 Sweden

We introduce a Horn description logic called Horn-DL, which is strictly and essentially richer than Horn-RegI, Horn-SHIQ and Horn-SROIQ, while still has PTime data complexity. In comparison with Horn-SROIQ, Horn-DL additionally allows the universal role and assertions of the form irreflexives, ¬s(a, b), a∗b. More importantly, in contrast to all the well-known Horn fragments EL, DL-Lite, DLP, Horn-SHIQ, and Horn-SROIQ of description logics, Horn-DL allows a form of the concept constructor "universal restriction" to appear at the left hand side of terminological inclusion axioms. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. We develop the first algorithm with PTime data complexity for checking satisfiability of Horn-DL knowledge bases. © 2015 Elsevier B.V.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：