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

Comparison of Support-Vector Machine and Sparse Representation Using a Modified rule-based Method for Automated Myocardial Ischemia Detection

引用

COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE 2016年第1期2016卷 9460375-9460375页

作者： Tseng, Yi-Li Lin, Keng-Sheng Jaw, Fu-Shan Fu Jen Catholic Univ Dept Elect Engn New Taipei 24205 Taiwan Natl Taiwan Univ Inst Biomed Engn Taipei 10617 Taiwan Natl Taiwan Univ Grad Inst Commun Engn Taipei 10617 Taiwan

An automatic method is presented for detecting myocardial ischemia, which can be considered as the early symptom of acute coronary events. Myocardial ischemia commonly manifests as ST- and T-wave changes on ECG signals. The methods in this study are proposed to detect abnormal ECG beats using knowledge-based features and classification methods. A novel classification method, sparse representation-based classification (SRC), is involved to improve the performance of the existing algorithms. A comparison was made between two classification methods, SRC and support-vector machine (SVM), using rule-based vectors as input feature space. The two methods are proposed with quantitative evaluation to validate their performances. The results of SRC method encompassed with rule-based features demonstrate higher sensitivity than that of SVM. However, the specificity and precision are a trade-off. Moreover, SRC method is less dependent on the selection of rule-based features and can achieve high performance using fewer features. The overall performances of the two methods proposed in this study are better than the previous methods.

关键词： SUPPORT vector machines SPARSE graphs rule-based programming CORONARY heart disease diagnosis ELECTROCARDIOGRAPHY

来源：评论

学校读者我要写书评

暂无评论

On the Complexity of Concurrent Multiset Rewriting

引用

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2016年第1期27卷 67-83页

作者： Bertier, Marin Perrin, Matthieu Tedeschi, Cedric INSA Rennes IRISA Rennes France Univ Nantes F-44035 Nantes France Univ Rennes IRISA Rennes France

In this paper, we are interested in the runtime complexity of programs based on multiset rewriting. The motivation behind this work is the study of the complexity of chemistry inspired programming models, which recently regained momentum due to their adequacy to large autonomous systems. In these models, data are most of the time left unstructured in a container, formally, a multiset. The program to be applied to this multiset is specified as a set of conditioned rules rewriting the multiset. At run time, these rewrite operations are applied concurrently, until no rule can be applied anymore (the set of elements they need cannot be found in the multiset anymore). A limitation of these models stand in their complexity: each computation step may require a complexity in O(n(k)) where n denotes the number of elements in the multiset, and k is the size of the subset of elements method to trigger a given rule. By analogy with chemistry, such elements can be called reactants. In this paper, we explore the possibility of improving the complexity of searching reactants through a static analysis of the rules' condition. In particular, we give a characterisation of this complexity, by analogy to the subgraph isomorphism problem. Given a rule R, we define its rank rk(R) and its calibre C(R), allowing us to exhibit an algorithm with a complexity in O(n(rk)(R)+C(R)) for searching reactants, while showing that rk(R) + C(R) <= k and that rk(R) + C(R) < k most of the time.

关键词： Complexity multiset rewriting concurrency rule-based programming

来源：评论

学校读者我要写书评

暂无评论

Circuit Tolerance Design Using Belief rule Base

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-12页

作者： Xu, Xiao-Bin Liu, Zheng Chen, Yu-Wang Xu, Dong-Ling Wen, Cheng-Lin Hangzhou Dianzi Univ Sch Automat Inst Syst Sci & Control Engn Hangzhou 310018 Zhejiang Peoples R China Univ Manchester Manchester Business Sch Manchester M15 6PB Lancs England

A belief rule-based (BRB) system provides a generic nonlinear modeling and inference mechanism. It is capable of modeling complex causal relationships by utilizing both quantitative information and qualitative knowledge. In this paper, a BRB system is firstly developed to model the highly nonlinear relationship between circuit component parameters and the performance of the circuit by utilizing available knowledge from circuit simulations and circuit designers. By using rule inference in the BRB system and clustering analysis, the acceptability regions of the component parameters can be separated from the value domains of the component parameters. Using the established nonlinear relationship represented by the BRB system, an optimization method is then proposed to seek the optimal feasibility region in the acceptability regions so that the volume of the tolerance region of the component parameters can be maximized. The effectiveness of the proposed methodology is demonstrated through two typical numerical examples of the nonlinear performance functions with nonconvex and disconnected acceptability regions and high-dimensional input parameters and a real-world application in the parameter design of a track circuit for Chinese high-speed railway.

关键词： ELECTRIC circuits TOLERANCE analysis (Engineering) rule-based programming NONLINEAR models (Statistics) INFORMATION theory

来源：评论

学校读者我要写书评

暂无评论

A Belief rule-based Safety Evaluation Approach for Complex Systems

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-10页

作者： Zhang, Jun Jiang, Jiang Chen, Yingwu Yang, Kewei Natl Univ Def Technol Coll Informat Syst & Management Changsha 410073 Hunan Peoples R China

Plenty of hazards underlie complex systems, which have negative effects on the normal functionality of engineering events. To minimize the uncertainty, a comprehensive preevent checkout is necessarily required to judge if the engineering events will be carried out successfully under current circumstance, through which further improvements can be made. A generic belief rule-based safety evaluation approach for large-scale complex systems is proposed. The overall system is firstly decomposed and filtered into the measurable attributes that may potentially contribute to uncertainty. Belief structure is then applied to measure the uncertainty of vagueness and incompleteness and represent heterologous information in a unified scheme. With this scheme, a rule base is established with all antecedents, consequents, and attributes presented in belief degrees, which is used to determine the relationship between attributes, aggregate the influences, and generate the final inference with evidential reasoning algorithm. In the end, an estimation of uncertainty is achieved in the representation of distribution. It describes how the systems perform with given conditions and sources. A numeric case in aerospace program is provided for feasibility illustration.

关键词： rule-based programming COMPUTER algorithms UNCERTAINTY (Information theory) INFORMATION theory SCHEME (Computer program language)

来源：评论

学校读者我要写书评

暂无评论

A rule-based Approach for a Multi-robot Application 19

A Rule-based Approach for a Multi-robot Application

引用

19th International Conference on System Theory, Control and Computing (ICSTCC)

作者： Panescu, Doru Pascal, Carlos Olaeru, Razvan Marian Gheorghe Asachi Tech Univ Iasi Dept Automat Control & Appl Informat Iasi Romania

ISBN: (纸本)9781479984817

This paper presents a solution for planning and coordinating a multi-robot system with industrial manipulators that uses a decisional component developed in the rule-based approach. Some hints on the overall control architecture are presented, with details concerning the rule-based program and robots' programs. The obtained benefits regard an increased adaptability and time optimization.

关键词： multi-robot system rule-based programming planning industrial manipulators

来源：评论

学校读者我要写书评

暂无评论

Designing a relational social robot toolkit for preschool children to explore computational concepts 15

Designing a relational social robot toolkit for preschool ch...

引用

14th International Conference on Interaction Design and Children, IDC 2015

作者： Gordon, Michal Rivera, Eileen Ackermann, Edith Breazeal, Cynthia Personal Robots Group MIT Media Lab. 20 Ames Street E15-468 CambridgeMA United States Wellesley College 21 Wellesley College Rd. WellesleyMA United States

ISBN: (纸本)9781450335904

Designing toolkits for teaching programming concepts to children using robots has received growing attention in recent years. However, teaching preschool children computational concepts, such as non-determinism and event-based programming, presents particular challenges. We have developed a programming toolkit that is embedded in an interpersonal interaction context with a social robot. The toolkit enables young children to program social robots by "teaching" them to interact. In order to "teach", the children show the robot rules designed with reusable vinyl stickers. In doing so, children can experiment with computational concepts while having a playful interaction with the social robot. We present the purpose, context, and design of the social robot toolkit (SoRo Toolkit), and an evaluation performed with 22 preschool children. We show that children have an engaging experience designing and "teaching" social interaction rules to the robot, orchestrating give-and-take exchanges, and delighting in how the robot engages with them as they explore computational ideas. © 2015 ACM.

关键词： early programming rule-based programming social robots tangible programming interaction design children

来源：评论

学校读者我要写书评

暂无评论

A Relation Extraction Framework for Biomedical Text Using Hybrid Feature Set

引用

COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE 2015年第1期2015卷 910423-910423页

作者： Muzaffar, Abdul Wahab Azam, Farooque Qamar, Usman NUST Islamabad 44000 Pakistan

The information extraction from unstructured text segments is a complex task. Although manual information extraction often produces the best results, it is harder to manage biomedical data extraction manually because of the exponential increase in data size. Thus, there is a need for automatic tools and techniques for information extraction in biomedical text mining. Relation extraction is a significant area under biomedical information extraction that has gained much importance in the last two decades. A lot of work has been done on biomedical relation extraction focusing on rule-based and machine learning techniques. In the last decade, the focus has changed to hybrid approaches showing better results. This research presents a hybrid feature set for classification of relations between biomedical entities. The main contribution of this research is done in the semantic feature set where verb phrases are ranked using Unified Medical Language System (UMLS) and a ranking algorithm. Support Vector Machine and Naive Bayes, the two effective machine learning techniques, are used to classify these relations. Our approach has been validated on the standard biomedical text corpus obtained from MEDLINE 2001. Conclusively, it can be articulated that our framework outperforms all state-of-the-art approaches used for relation extraction on the same corpus.

关键词： DATA mining FEATURE extraction (Data processing) MACHINE learning rule-based programming SUPPORT vector machines CORPORA (Linguistics)

来源：评论

学校读者我要写书评

暂无评论

rule-driven service coordination middleware for scientific applications

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2014年第0期35卷 1-13页

作者： Fernandez, Hector Tedeschi, Cedric Priol, Thierry Vrije Univ Amsterdam Amsterdam Netherlands Univ Rennes 1 INRIA IRISA F-35014 Rennes France INRIA Villeneuve Dascq France

With the proliferation of Web services, scientific applications are more and more designed as temporal compositions of services, commonly referred to as workflows. To address this paradigm shift, different workflow management systems have been proposed. While their efficiency has been established over centralized static systems, it is questionable over decentralized failure-prone platforms. Scientific applications recently started to be deployed over large distributed computing platforms, leading to new issues, like elasticity, i.e., the possibility to dynamically refine, at runtime, the amount of resources dedicated to an application. This raised again the demand for new programming models, able to express autonomic self-coordination of services in a dynamic platform. Nature-inspired, rule-based computing models recently gained a lot of attention in this context. They are able to naturally express parallelism, distribution, and autonomic adaptation. While their high expressiveness and adequacy for this context has been established, such models severely suffer from a lack of proof of concepts. In this paper, we concretely show how to leverage such models in this context. We focus on the design, the implementation and the experimental validation of a chemistry-inspired scientific workflow management system. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Service coordination Workflow execution Nature-inspired computing rule-based programming Decentralization

来源：评论

学校读者我要写书评

暂无评论

Verification of Business rules Programs 1

引用

2014年

作者： Bruno Berstel-Da Silva (auth.)

ISBN: (数字)9783642400377

ISBN: (纸本)9783642400377;9783642400384

rules represent a simplified means of programming, congruent with our understanding of human brain constructs. With the advent of business rules management systems, it has been possible to introduce rule-based programming to nonprogrammers, allowing them to map expert intent into code in applications such as fraud detection, financial transactions, healthcare, retail, and marketing. However, a remaining concern is the quality, safety, and reliability of the resulting programs. This book is on business rules programs, that is, rule programs as handled in business rules management systems. Its conceptual contribution is to present the foundation for treating business rules as a topic of scientific investigation in semantics and program verification, while its technical contribution is to present an approach to the formal verification of business rules programs. The author proposes a method for proving correctness properties for a business rules program in a compositional way, meaning that the proof of a correctness property for a program is built up from correctness properties for the individual rulesthus bridging a gap between the intuitive understanding of rules and the formal semantics of rule programs. With this approach the author enables rule authors and tool developers to understand, express formally, and prove properties of the execution behavior of business rules programs. This work will be of interest to practitioners and researchers in the areas ofprogram verification,enterprise computing, database management, and artificial intelligence.

关键词： Business rule-based programming

来源：评论

学校读者我要写书评

暂无评论

Indefinite integration as term rewriting: Integrals containing tangent

引用

programming AND COMPUTER SOFTWARE 2013年第2期39卷 61-66页

作者： Hu, J. Hou, Y. Rich, A. D. Jeffrey, D. J. Univ Western Ontario Dept Appl Math London ON N6A 5B7 Canada

We describe the development of a term-rewriting system for indefinite integration;it is also called a rule-based evaluation system. The development is separated into modules, and we describe the module for a wide clas... 详细信息

关键词： REWRITING systems (Computer science) rule-based programming INFINITE integrals WOLFRAM language (Computer program language) FUNCTIONS (Mathematics) TANGENTS (Geometry) DIOPHANTINE equations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：