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

4th International Conference on Knowledge and Systems Engineering, KSE 2012

作者： Tran, Thanh-Luong Ha, Quang-Thuy Hoang, Thi-Lan-Giao Nguyen, Linh Anh Nguyen, Hung Son Szalas, Andrzej Department of Information Technology College of Sciences Hue University 77 Nguyen Hue Hue City Viet Nam Faculty of Information Technology College of Technology Vietnam National University 144 Xuan Thuy Hanoi Viet Nam Faculty of Mathematics Informatics and Mechanics University of Warsaw Banacha 2 02-097 Warsaw Poland Dept. of Computer and Information Science Linköping University SE-581 83 Linköping Sweden

ISBN: (纸本)9780769547602

The work [1] by Nguyen and Szalas is a pioneering one that uses bisimulation for machine learning in the context of description logics. In this paper we generalize and extend their concept learning method [1] for description logic-based information systems. 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 much more suitable for practical information systems based on description logic than the one of [1]. As further extensions we allow also data roles and the concept constructors "functionality" and "unquantified number restrictions". We formulate and prove an important theorem on basic selectors. We also provide new examples to illustrate our approach. © 2012 IEEE.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

On formal models for cognitive linguistics

On formal models for cognitive linguistics

引用

IEEE International Conference on Cognitive informatics

作者： Yingxu Wang Robert C. Berwick International Institute of Cognitive Informatics and Cognitive Computing (ICIC) University of Calgary Calgary Alberta Canada T2N 1N4 Dept. of Brain and Cognitive Science & Dept. Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge MA 02139 USA

Cognitive linguistics is an emerging discipline that studies the cognitive properties of natural languages and the cognitive models of languages in computational linguistics, cognitive computing, and computational intelligence. This paper presents the theoretical framework of cognitive linguistics in order to systematically formalize the syntaxes and grammars of natural languages. An abstract language model of cognitive linguistics is created at the top level. Based on it, the cognitive structures of languages at the levels of lexis, phrase, clauses, sentence, paragraph, and essay are formally modeled from the bottom up. Using contemporary denotational mathematics, the deductive grammar of English is formally modeled and rigorously analyzed. The basic research provides support for a wide range of applications in computational linguistics, cognitive informatics, online text processing, web search engines, machine language comprehension, autonomous machine learning, smart cell phones, semantic computing, and computing with words.

关键词： Grammar Semantics Pragmatics Computational modeling Natural languages Speech Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012年 7378 LNCS卷 V-VI页

作者： Perales, F.J. Fisher, R. Moeslund, T.B. UIB - Universitat de Les Illes Balears Dept. of Computer Science and Mathematics C/ Valldemossa km 7.5 07122 Palma de Mallorca Spain University of Edinburgh School of Informatics 1.26 Informatics Forum 10 Crichton St. Edinburgh EH8 9AB United Kingdom Aalborg University Dept. for Architecture Design and Media Technology Niels Jernes Vej 14 9220 Aalborg East Denmark

来源：评论

学校读者我要写书评

暂无评论

Optimal Dedicated Protection Approach to Shared Risk Link Group Failures using Network Coding

Optimal Dedicated Protection Approach to Shared Risk Link Gr...

引用

IEEE International Conference on Communications

作者： Peter Babarczi Janos Tapolcai Pin-Han Ho Muriel Medard Dept. of Telecommunications and Media Informatics Budapest University of Technology and Economics Dept. of Electrical and Computer Engineering University of Waterloo Research Laboratory of Electronics Massachusetts Institute of Technology

ISBN: (纸本)9781457720529

Survivable routing serves as a key role in connection-oriented communication networks for achieving desired service availability for each connection. This is particularly critical for the success of all-optical mesh networks where each lightpath carries a huge amount of data. Currently, 1 + 1 dedicated path protection appears to be the most widely deployed network resilience mechanism because it offers instantaneous recovery from network failures. However, 1 + 1 protection consumes almost twice as much capacity as required, which imposes a stringent constraint on network resource utilization. In addition, finding an SRLG-disjoint path is essential for 1 + 1 protection, which is nonetheless subject to non-trivial computation complexity and may fail in some SRLG scenarios. To address these problems, we introduce a novel framework of 1 + 1 protection, called Generalized Dedicated Protection (GDP), for achieving instantaneous recovery from any SRLG failure event. It is demonstrated, that finding a non-bifurcated optimal solution for GDP is NP-complete. Thus, the paper presents a novel scheme applying Generalized Dedicated Protection and Network Coding (GDP-NC) to ensure both optimal resource utilization among dedicated protection approaches and instantaneous recovery for single unicast flows, which can be split into multiple parts in all-optical networks. We demonstrate that the proposed GDP-NC survivable routing problem is polynomial-time solvable, owing to the ability to bifurcate flows. This flexibility comes at the expense of additional hardware for linear combination operations for the optical flows.

关键词： Network coding Robustness Economic indicators Routing Optical fiber networks Unicast Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Constructing Dynamic Category Hierarchies for Novel Visual Category Discovery

Constructing Dynamic Category Hierarchies for Novel Visual C...

引用

IEEE/RSJ International Conference on Intelligent Robotics and Systems

作者： Jianhua Zhang Jianwei Zhang Shengyong Chen Ying Hu Haojun Guan TAMS group Dept. Informatics University of Hamburg. Vogt-Koelln-Strasse 30 22527 Hamburg Germany. College of Computer Science Zhejiang University of Technology 310023 Hangzhou China. He was a guest researcher (Humboldt Fellow) at the Dept of Informatics University of Hamburg Germany. Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China and The Chinese University of Hong Kong Shatin HongKong

ISBN: (纸本)9781467317375

Category hierarchies are commonly used to compactly represent large numbers of categories and reduce the complexity of the classification problem. In this paper we introduce a novel and extended application of category hierarchies which is a powerful novel framework developed to construct dynamic category hierarchies and automatically discover novel visual categories. The dynamic is a characteristic of category hierarchies which can facilitate an important cognitive ability, the discovering of novel categories. We develop a constrained hierarchical latent Dirichlet allocation to build accurate category hierarchies. We employ object attributes as features to describe objects, which can transfer knowledge across categories and can efficiently describe novel categories. By combining them in the novel framework, novel visual object categories can be efficiently discovered and described. Extensive experiments based on PASCAL VOC 2008 and the LabelMe image database show the satisfactory performance of the proposed framework.

关键词： PASCAL VOC LabelMe Pascal Volatile Organic Compounds Social Hierarchy Category

来源：评论

学校读者我要写书评

暂无评论

Fusion of multimodal temporal clinical data for the retrieval of similar patient cases

Fusion of multimodal temporal clinical data for the retrieva...

引用

10th IEEE International Workshop on Biomedical Engineering, BioEng 2011

作者： Tsevas, Spyros Iakovidis, Dimitris K. University of Geneva Dept. of Computer Science Switzerland Technological Educational Institute of Lamia Dept. of Informatics and Computer Technology Greece Technological Educational Institute of Lamia Dept. of Informatics and Computer Technology GR-35100 Lamia Greece

ISBN: (纸本)9781457705526

The temporal evolution of the patient is a key factor in providing an effective healthcare. Moreover, comparing a patient case with other cases having a similar progress in time can prove valuable for medical decision making. However, the large amounts of complex temporal clinical data are not always considered by clinicians in the clinical information process. In this work, a computational framework is proposed for the comparison of multimodal temporal clinical data obtained from different patients. The purpose of the proposed framework is to use a patient's temporal evolution so as to retrieve the most similar profiles from large repositories which can be used to compare treatments, diagnosis, test results and other information. This is achieved by retrieving similar temporal patterns from the data by being based on a sequence similarity scheme. The similarity between the patient cases is assessed by a novel fusion scheme that involves the estimation of multiple dynamic time warping distances between the temporal clinical sequences. The results obtained from its application on a reference dataset of hepatic infections demonstrated high precision even for low recall rates. © 2011 IEEE.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

A Scalable Iterative Convex Design for Nonlinear Systems

A Scalable Iterative Convex Design for Nonlinear Systems

引用

American Control Conference

作者： Simone Baldi Petros A. Ioannou Elias B. Kosmatopoulos Computer Science Department University of Cyprus (UCY) 1678 Nicosia Cyprus Department of Electrical Engineering University of Southern California Los Angeles CA USA Dept. of Electrical and Computer Engineering Democritus University of Thrace Xanthi Greece and the Informatics & Telematics Institute Center for Research and Technology Hellas (ITICERTH) Thessaloniki Greece

ISBN: (纸本)9781457710957

A recently developed control scheme for approximately optimal control of nonlinear systems is the so-called Convex Control Design (ConvCD) methodology, that transforms the control problem of generic nonlinear systems into a convex optimization problem. The ConvCD approach constructs a polynomial controller approximating the optimal control law: such design does not provide a scalable controller as it requires the use of a polynomial controller, which is not scalable, especially in large-scale applications. This problem is overcome in this paper by modifying the ConvCD formulation so that the optimal control law is approximated with a Multi-Controller with Mixing: that is, the polynomial controller is substituted by linear control elements plus mixing signals that are responsible for smoothly switching from one linear element to another. The stability properties of the Multi-Controller with Mixing are analyzed and an iterative approach is proposed to solve the resulting optimization problem. The resulting procedure aims at the development of a scalable and modular architecture for nonlinear systems, in order to allow for easier implementation and re-configurability. A numerical example is used to show the effectiveness of the method.

关键词： Nonlinear systems Scalability Optimal control control law Mixing Blending Controllers Convexity Iterative Polynomial

来源：评论

学校读者我要写书评

暂无评论

Wireless myths, realities, and futures: From 3G/4G to optical and quantum wireless

Wireless myths, realities, and futures: From 3G/4G to optica...

引用

作者： Hanzo, Lajos Haas, Harald Imre, Sndor O'Brien, Dominic Rupp, Markus Gyongyosi, Laszlo School of Electronics and Computer Science University of Southampton Southampton SO17 1BJ United Kingdom University of Edinburgh Edinburgh EH9 3JL United Kingdom Telecommunications Dept. Budapest University of Technology and Economics Budapest 1521 Hungary Department of Engineering Science University of Oxford Oxford OX1 3PJ United Kingdom Technische Universitt Wien Institute of Telecommunications Wien A-1040 Austria Faculty of Electrical Engineering and Informatics Department of Telecommunications Budapest University of Technology and Economics Budapest 1521 Hungary

The Myth: Sixty years of research following Shannon's pioneering paper has led to telecommunications solutions operating arbitrarily close to the channel capacityflawless telepresence with zero error is available ... 详细信息

关键词： Quantum communication

来源：评论

学校读者我要写书评

暂无评论

Optimizing the combination of MBSFN and PTM transmissions in LTE systems

Optimizing the combination of MBSFN and PTM transmissions in...

引用

10th Annual Wireless Telecommunications Symposium, WTS 2011

作者： Alexiou, Antonios Bouras, Christos Kokkinos, Vasileios Papazois, Andreas Tseliou, Georgia Research Academic Computer Technology Institute Patras Greece Computer Engineering and Informatics Dept. Univ. of Patras Greece

ISBN: (纸本)9781457701627

The 3rd Generation Partnership Project (3GPP) has introduced the evolved Multimedia Broadcast/Multicast Service (e-MBMS) feature for cellular systems as an evolution to the existing MBMS service. To support e-MBMS in Long Term Evolution (LTE) systems, 3GPP recommends the use of Point-to-Multipoint (PTM) transmissions and MBMS over a Single Frequency Network (MBSFN). MBSFN is a new feature where a time-synchronized common waveform is transmitted from multiple cells. In this paper we investigate the provision of MBMS service over a combination of MBSFN and PTM transmission methods. A cost analysis of the MBMS service is presented based on the transmission cost over all the interfaces and nodes of the LTE architecture. We evaluate the performance of this transmission scheme from telecommunication cost perspective and we compare it with other transmission schemes. The performance evaluation has been performed with the aid of a new simulation tool that estimates the cost for the MBMS provision under different network topologies, MBSFN deployments and user distributions. © 2011 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

GRAL: A grouping algorithm to optimize application placement in wireless embedded systems

GRAL: A grouping algorithm to optimize application placement...

引用

25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

作者： Tziritas, Nikos Loukopoulos, Thanasis Lalis, Spyros Lampsas, Petros Center for Research and Technology Thessaly Volos Greece Dept. of Computer and Communication Engineering Univ. of Thessaly Volos Greece Dept. of Informatics and Computer Technology TEI of Lamia Lamia Greece

ISBN: (纸本)9780769543857

Recent embedded middleware initiatives enable the structuring of an application as a set of collaborating agents deployed in the various sensing/actuating entities of the system. Of particular importance is the incurred cost due to agent communication which in terms depends on agent positions in the system. In this paper we present GRAL a grouping algorithm that migrates groups of agents with the aim of minimizing communication. The algorithm works in a distributed fashion based on knowledge available locally at each node and can be used both for one-shot initial application deployment and for the continuous updating of agent placement. Through simulation experiments under various scenarios we evaluate the algorithm, comparing the solution quality reached against the optimal obtained from exhaustive search. © 2011 IEEE.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：