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

12th international conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Gavriilidis, Prodromos Gerakakis, Ioannis Georgoudas, Ioakeim G. Trunfio, Giuseppe A. Sirakoulis, Georgios Ch. Democritus Univ Thrace Sch Engn Dept Elect & Comp Engn Univ Campus GR-67100 Xanthi Greece Univ Sassari DADU Piazza Duomo 6 I-07041 Alghero SS Italy

ISBN: (纸本)9783319780542;9783319780535

this work investigates the incorporation of fuzzy logic principles in a cellular automata (CA) based model that simulates crowd dynamics and crowd evacuation processes with the usage of a Mamdani type fuzzy inference system. Major attributes of the model that affect its response, such as orientation, have been deployed as linguistic variables whose values are words rather than numbers. thus, a basic concept of fuzzy logic is realised. Moreover, fuzzy if-then rules constitute the mechanism that deals with fuzzy consequents and fuzzy antecedents. the proposed model also maintains its CA prominent features, thus exploiting parallel activation of transition rules for all cells and efficient use of computational resources. In case of evacuation, the selection of the appropriate path is primarily addressed using the criterion of distance. To further speed up the execution of the Fuzzy CA model the concept of the inherent parallelization was considered through the GPU programming principles. Finally, validation process of the proposed model incorporates comparison of the corresponding fundamental diagram with those from the literature for a building that has been selected for hosting the museum 'CONSTANTIN XENAKIS', in Serres, Greece.

关键词： Crowd modelling Cellular automata Fuzzy logic Evacuation Flow-density diagram Speed-density diagram

来源：评论

学校读者我要写书评

暂无评论

Learners Based on Transducers 1

引用

12th international conference on Language and Automata theory and Applications (LATA)

作者： Jain, Sanjay Kuek, Shao Ning Martin, Eric Stephan, Frank Natl Univ Singapore Dept Comp Sci 13 Comp DrCOM1 Singapore 117417 Singapore Natl Univ Singapore Dept Math 10 Lower Kent Ridge RdS17 Singapore 119076 Singapore Univ New South Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia

ISBN: (数字)9783319773131

ISBN: (纸本)9783319773131;9783319773124

As data come out one by one from an infinite stream, automatic learners maintain some string as long term memory, and update it at every new datum (example) they process. Transduced learners are generalization of automatic learners. Both kind of learners are evaluated with respect to the space they consume for learning. For automatic learners, it is unknown whether at any point, the size of the long term memory can be bounded by the length of the longest datum that has been received so far. Here it is shown that, even when restricting learning to automatic families, there is a hierarchy of classes that can be learnt with memory 0(n k ), and all automatic families which are learnable in principle can be learnt by a transduced learner using exponential sized memory.

关键词： Automata and logic inductive inference Transducers

来源：评论

学校读者我要写书评

暂无评论

12th Multi-disciplinary international conference on Artificial Intelligence, MIWAI 2018

12th Multi-disciplinary International Conference on Artifici...

引用

12th Multi-disciplinary international conference on Artificial Intelligence, MIWAI 2018

ISBN: (纸本)9783030030131

the proceedings contain 25 papers. the special focus in this conference is on Artificial Intelligence. the topics include: Identifying goals of agents by learning from observations;selection of suitable pagerank calculation for analysis of differences between expected and observed probability of accesses to web pages;aggregating crowd opinions using shapley value regression;a hierarchical conditional attention-based neural networks for paraphrase generation;ontology based approach for precision agriculture;learning generalized video memory for automatic video captioning;an efficient hash-based method for time series motif discovery;One-dimensional camera calibration based on PSO algorithm;evaluating named-entity recognition approaches in plant molecular biology;work flexibility, telepresence in the office for remote workers: A case study from Austria;Reconstruction of a 3D model from single 2D image by GAN;inverse ant algorithm;enhanced texture representation for moving targets classification using co-occurrence;an adequate dietary planning model using particle swarm optimization;an agent cooperation model and dependency measurement based on merge & synthesis on shared timed task environments;design and development of real-time video transmission system using visual IoT device;computing logic programming semantics in linear algebra;progressively improving supervised emotion classification through active learning;regularizing feature distribution using sliced wasserstein distance for semi-supervised learning;automated pixel-level surface crack detection using U-net;a novel method of automatic crack detection utilizing non-linear relaxation method and crack geometric features for safety evaluation of concrete structure;Optimal data collection of MP-MR-MC wireless sensors network for structural monitoring;emoticon-based emotion analysis for Weibo articles in sentence level.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Approach Based on MCDA and Fuzzy logic to Select Joint Actions 12th

An Approach Based on MCDA and Fuzzy Logic to Select Joint Ac...

引用

12th international conference on Scalable Uncertainty Management (SUM)

作者： Imoussaten, Abdelhak Univ Montpellier IMT Mines Ales LGI2P Ales France

ISBN: (纸本)9783030004613;9783030004606

To satisfy a fluctuating demand and achieve a high level of quality and service, companies must take into account several features when designing new products in order to become or remain market leaders. When a single company is unable to meet this objective alone, it is appropriate for it to join its actions with other companies. the product design consists of the complex task to select from various potential actions that allowing the fulfilment of several requirements: functional, technical, environmental, economic, security, etc. Furthermore, the task is even more difficult when actions are related to distinct services or companies that do not necessarily know the capacities of each others which makes complex the coordination of joint actions. Interactions between services may be affected by antagonist personal interests. Based on a multiple criteria decision analysis (MCDA) framework and a fuzzy model that links actions to the satisfaction of objectives, this paper proposes to treat two extreme views related to the collective selection of the necessary actions to design a product: (1) the first point of view corresponds to an ideal situation where each service reveals its capacities and the unique objective is to succeed in the realization of the common goal;(2) the second point of view corresponds to a more realistic situation where only necessary information for the progress of collective action are shared and where collective and personal goals coexist and are to be taken into account. the first situation corresponds to a classical case where a single decision maker (DM) has to express his preferences then a classical optimization problem under constraints has to be solved in order to efficiently select actions. In the second situation the services do not share the same preferences and each service wants to maximize its gain, in this case we propose to build a negotiated solution between services.

关键词： MCDA Fuzzy logic Constraint programming Debate modeling

来源：评论

学校读者我要写书评

暂无评论

Constructing Service Clusters Based on Service Space

引用

international JOURNAL OF PARALLEL programming 2017年第4期45卷 982-1000页

作者： Du, Yuyue Wang, Lu Qi, Man Shandong Univ Sci & Technol Coll Informat Sci & Engn Qingdao 266590 Shandong Peoples R China Canterbury Christ Church Univ Dept Comp Canterbury CT1 1QU Kent England

With the development of Web services, the quantity of services in clusters has increased rapidly, and the time complexity of service clustering becomes higher. To solve this problem, a new construction method of service clusters is proposed based on service space in this paper. the main innovation is the construction of service space. Firstly, a mathematical space is defined. then, services are abstracted and quantized to the space based on ontology trees. the experiment illustrates that the time complexity of constructing service clusters is decreased. Moreover, the construction of service space and the mapping rules are shown in this paper. A service cluster and its dynamic library are constructed based on service space. the structure, updating mechanism and generation flows of service clusters are modeled by logic Petri nets. Finally, the validity and advantages of proposed methods are illustrated by some experiments and comparative analysis.

关键词： Service cluster Service space logic Petri net Dynamic library Ontology tree

来源：评论

学校读者我要写书评

暂无评论

ICCSE 2017 - 12th international conference on Computer Science and Education

ICCSE 2017 - 12th International Conference on Computer Scien...

引用

12th international conference on Computer Science and Education, ICCSE 2017

ISBN: (纸本)9781509025084

the proceedings contain 153 papers. the topics discussed include: enhancing English vocabulary learning via computerized adaptive testing;knowledge system modeling in MOOC;knowledge system modeling in MOOC;synchronized uml diagrams for object-oriented program comprehension;a unified approach to automate the usage of plagiarism detection tools in programming courses;a unified approach to automate the usage of plagiarism detection tools in programming courses;digital logic experiment teaching based on experimental platform;and research and development of intelligent online examination monitoring system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

inductive learning in shared neural multi-spaces 12

Inductive learning in shared neural multi-spaces

引用

12th international Workshop on Neural-Symbolic Learning and Reasoning, NeSy 2017

作者： De Souza Mota, Edjard Howe, Jacob M. D’Avila Garcez, Artur S. City University of London LondonEC1V 0HB United Kingdom Universidade Federal do Amazonas Instituto de Computação Campus Setor Norte Coroado - Manaus - AMCEP: 69080-900 Brazil

the learning of rules from examples is of continuing interest to machine learning since it allows generalization from fewer training examples. inductive logic programming (ILP) generates hypothetical rules (clauses) from a knowledge base augmented with (positive and negative) examples. A successful hypothesis entails all positive examples and does not entail any negative example. the Shared Neural Multi-Space (Shared NeMuS) structure encodes first order expressions in a graph suitable for ILP-style learning. this paper explores the NeMuS structure and its relationship with the Herbrand Base of a knowledge-base to generate hypotheses inductively. It is demonstrated that inductive learning driven by the knowledge-base structure can be implementated successfully in the Amao cognitive agent framework, including the learning of recursive hypotheses. Copyright © 2017 for this paper by its authors.

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

37th IFIP WG 6.1 international conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2017 - Held as Part of the 12th international Federated conference on Distributed Computing Techniques, DisCoTec 2017

37th IFIP WG 6.1 International Conference on Formal Techniqu...

引用

37th IFIP WG 6.1 international conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2017 - Held as Part of the 12th international Federated conference on Distributed Computing Techniques, DisCoTec 2017

ISBN: (纸本)9783319602240

the proceedings contain 17 papers. the special focus in this conference is on Formal Techniques for Distributed Objects, Components, and Systems. the topics include: Learning-based compositional parameter synthesis for event-recording automata;modularising opacity verification for hybrid transactional memory;a sound and complete method;session-based concurrency, reactively;procedural choreographic programming;an observational approach to defining linearizability on weak memory models;weak simulation quasimetric in a gossip scenario;reasoning about distributed secrets;classical higher-order processes;weak nominal modal logic;type inference of simulink hierarchical block diagrams in Isabelle;creating büchi automata for multi valued model checking;privacy assessment using static taint analysis and a temporal logic for weakly consistent systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Code3: A System for End-to-End programming of Mobile Manipulator Robots for Novices and Experts 17

Code3: A System for End-to-End Programming of Mobile Manipul...

引用

12th Annual ACM/IEEE international conference on Human-Robot Interaction (HRI)

作者： Huang, Justin Cakmak, Maya Univ Washington Comp Sci & Engn Seattle WA 98195 USA

ISBN: (纸本)9781450343367

this paper introduces Code3, a system for user-friendly, rapid programming of mobile manipulator robots. the system is designed to let non-roboticists and roboticists alike program end-to-end manipulation tasks. To accomplish this, Code3 provides three integrated components for perception, manipulation, and high-level programming. the perception component helps users define a library of object and scene parts that the robot can later detect. the manipulation component lets users define actions for manipulating objects or scene parts through programming by demonstration. Finally, the high-level programming component provides a drag-and-drop interface with which users can program the logic and control flow to accomplish a task using their previously specified perception and manipulation capabilities. We present findings from an observational user study with non-roboticist programmers (N=10) that demonstrate their ability to quickly learn Code3 and program a PR2 robot to do manipulation tasks. We also demonstrate how the system is expressive enough for an expert to rapidly program highly complex manipulation tasks like playing tic-tac-toe and reconfiguring an object to be graspable.

关键词： programming by demonstration programming tools End-user programming Mobile Manipulation

来源：评论

学校读者我要写书评

暂无评论

Holistic Deductive Framework theorem Proving Based on Standard Contradiction Separation For First-Order logic 12

Holistic Deductive Framework Theorem Proving Based on Standa...

引用

12th international conference on Intelligent Systems and Knowledge Engineering (IEEE ISKE)

作者： Cao, Feng Xu, Yang Zhong, Jian Wu, Guanfeng Southwest JiaoTong Univ Sch Informat Sci & Technol Chengdu 610031 Sichuan Peoples R China Southwest Jiaotong Univ Natl Local Joint Engn Lab Syst Credibil Automat V Chengdu 610031 Sichuan Peoples R China

ISBN: (纸本)9781538618295

Nowadays, famous and powerful first-order logic automated theorem proving almost use saturation which called given-clause algorithm as the deductive framework. the given clause algorithm is a divisional framework which divides the entire clauses into selected clause set and deductive clause set. It is efficient with large heuristic strategies and inference calculus. In this paper, we present a holistic deductive framework based on standard contradiction separation. the framework allows arbitrary clause to take part in deduction in the holistic clause set as many as possible which can take full advantage of synergetic effect between clauses. It is a multi-ary, dynamic, sound, complete deduction which can generate more new unit clauses as the goal. We implement the preliminary version of prover, it can find proofs in fewer inferential steps for some Mizar and TPTP problems under effective strategies. Related definitions and useful methods are proposed for programming search paths, avoiding repetition, simplifying clauses and the key strategies, they are contribute to finding proof more efficiently. Performance analysis and some conclusions are outlined at the end of this paper.

关键词： theorem proving holistic deductive framework search paths avoiding repetition key strategies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：