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

Transfer of Domain Knowledge in Plan Generation: Learning Goal-dependent Annulling Conditions for Actions

KUNSTLICHE INTELLIGENZ 2014年第1期28卷 35-38页

作者： Siebers, Michael Univ Bamberg Cognit Syst Grp Fac Informat Syst & Appl Comp Sci Bamberg Germany

In this paper we present an approach to avoid dead-ends during automated plan generation. A first-order logic formula can be learned that holds in a state if the application of a specific action will lead to a dead-end. Starting from small problems within a problem domain examples of states where the application of the action will lead to a dead-end will be collected. The states will be generalized using inductive logic programming to a first-order logic formula. We will show how different notions of goal-dependence could be integrated in this approach. The formula learned will be used to speed-up automated plan generation. Furthermore, it provides insight into the planning domain under consideration.

关键词： Automated planning Learning domain knowledge Dead-end states inductive logic programming

来源：评论

学校读者我要写书评

暂无评论

Extending Typical Worst-Case Analysis Using Response-Time Dependencies to Bound Deadline Misses 14

Extending Typical Worst-Case Analysis Using Response-Time De...

引用

International Conference on Embedded Software (EMSOFT)

作者： Hammadeh, Zain A. H. Quinton, Sophie Ernst, Rolf TU Braunschweig Inst Comp & Network Engn IDA Braunschweig Germany Inria Grenoble Rhone Alpes Montbonnot St Martin France

ISBN: (纸本)9781450330527

Weakly-hard time constraints have been proposed for applications where occasional deadline misses are permitted. Recently, a new approach called Typical Worst-Case Analysis (TWCA) has been introduced which exploits similar constraints to bound response times of systems with sporadic overload. In this paper, we extend that approach for static priority preemptive and non-preemptive scheduling to determine the maximum number of deadline misses for a given deadline. The approach is based on an optimization problem which trades off higher priority interference versus miss count. We formally derive a lattice structure for the possible combinations that lays the ground for an integer linear programming (ILP) formulation. The ILP solution is evaluated showing effectiveness of the approach and far better results than previous TWCA.

关键词： Analytical models Computational modeling Equations Interference Mathematical model Optimization Time factors Time Factors Computational modeling ANALYSIS MODELS Reaction Time Mathematical Model interference inductive logic programming Time constraints Bound

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient Wireless Routing Protocol for Distributed Structural Health Monitoring

An Energy-Efficient Wireless Routing Protocol for Distribute...

引用

7th IFIP Wireless and Mobile Networking Conference (WMNC)

作者： Engel, Andreas Koch, Andreas LOEWE Res Ctr AdRIA Darmstadt Germany Tech Univ Darmstadt Embedded Syst & Applicat Grp Darmstadt Germany

ISBN: (纸本)9781479930609

Congestion-induced packet loss leads to throughput degradation in wireless sensor networks and often requires energetically expensive retransmissions. Though collisions can be avoided (CSMA/CA), the required carrier-sensing also increases the sensor node energy consumption. In this paper, an energy-efficient routing protocol for a distributed monitoring application is proposed. Although the development of the new protocol was motivated by a specific use-case, it is applicable to all static-topology wireless sensor networks where multiple sensor nodes need to simultaneously distribute information to all other nodes in the network. First, we model the globally known network topology as two directed graphs representing reachability and interference. Based on this model, we define an integer linear program to find a collision-free communication schedule with the minimum number of transmissions and receptions required for distributing the data (multi-commodity information flooding). As these ILPs are hard to solve for larger networks, we also propose a heuristic for scheduling. Compared to other advanced flooding protocols, the proposed schedule can reduce wireless activity by up to 90 %, with the heuristic solver achieving a solution quality just 4 % worse than the optimal ILP solution.

关键词： Equations Mathematical model Network topology Optimal scheduling Receivers Routing protocols Schedules Network topology Routing protocols Optimal scheduling Receivers Mathematical Model Distribute Energy efficiency Wireless sensor networks directed graphs protocols Heuristics inductive logic programming structural monitoring

来源：评论

学校读者我要写书评

暂无评论

Test Planning and Test Access Mechanism Design for Stacked Chips using ILP

Test Planning and Test Access Mechanism Design for Stacked C...

引用

IEEE 32nd VLSI TEST SYMPOSIUM (VTS)

作者： SenGupta, Breeta Larsson, Erik Lund Univ Lund Sweden

ISBN: (纸本)9781479926114

In this paper we propose a scheme for test planning and test access mechanism (TAM) design for stacked integrated circuits (SICs) that are designed in a core-based manner. Our scheme minimizes the test cost, which is given as the weighted sum of the test time and the TAM width. The test cost is evaluated for a test flow that consists of a wafer sort test of each individual chip and a package test of the complete stack of chips. We use an Integer Linear programming (ILP) model to find the optimal test cost. The ILP model is implemented on several designs constructed from ITC'02 benchmarks. The experimental results show significant reduction in test cost compared to when using schemes, which are optimized for non-stacked chips.

关键词： test planning inductive logic programming Test Access Computer chips TESTING TIME Scheme mechanism design weight sums

来源：评论

学校读者我要写书评

暂无评论

Cable Length Minimisation in Long-Reach-PON Planning for Sparsely Populated Areas

Cable Length Minimisation in Long-Reach-PON Planning for Spa...

引用

18th International Conference on Optical Network Design and Modeling (ONDM)

作者： Pal, Saptadeep Zukowski, Cezary Nag, Avishek Payne, David B. Ruffini, Marco Univ Dublin Trinity Coll CTVR Dublin 2 Ireland

ISBN: (纸本)9783901882609

Tackling the digital divide has become one of the main goals of many governments around the world, and a main target for the European Commission. Fibre-to-the-premises (FTTP) is the only access technology that has the potential to totally eliminate the digital divide since, within access distances, fibre capacity can be considered distance independent. In practice, however the higher cost means that many rural areas might not be served by FTTP services, further widening the capacity gap between rural and urban access. However, while fibre roll out is certainly less cost-effective in rural than urban areas, a proper deployment strategy that minimises cable installation costs can increase the network profitability and thus the rural FTTP coverage. In this paper, we propose a novel agglomerative clustering algorithm. The algorithm together with ILP and heuristic models, attempt to minimise the total fibre cable required to connect sparse rural users to a drop PON splitter located up to several kilometres away from the user. Our results show that proper deployment strategies can increase the use of large last-stage splitter, thus increasing sharing of fibre among users, while still minimising the overall cable length. In addition, we show that our heuristic is able to obtain similar results as the ILP (i.e. within an 8% margin), but can reduce the computation time by about 6 times, for the scenarios we have considered.

关键词： Clustering algorithms Joining processes Layout Minimization Passive optical networks Power cables Roads Clustering algorithms Passive optical networks Power cables layouts Road fiber-to-the-home inductive logic programming Rural Fiber cable computational time Consumers

来源：评论

学校读者我要写书评

暂无评论

Survivable Lightpath Provisioning in Multi-Domain Optical Networks 15

Survivable Lightpath Provisioning in Multi-Domain Optical Ne...

引用

15th IEEE International Conference on High Performance Switching and Routing (HPSR)

作者： Pavarangkoon, Praphan Oki, Eiji Univ Electrocommun Dept Commun Engn & Informat Tokyo Japan

ISBN: (纸本)9781479916337

This paper proposes a survivable lightpath provisioning scheme that allows traffic splitting in multi-domain optical networks to minimize the cumulative cost of a set of paths. The proposed scheme, called two-phase lightpath provisioning, employs an integer linear programming (ILP) formulation based on hierarchical path computation with full-mesh topology abstraction. There are two phases in the scheme. The first phase solves the ILP problem on an inter-domain topology and then feeds the results as intra-domain requests. The second phase solves the ILP problem in each related domain. Finally, we concatenate all the intra-domain solutions along routing sequences. Three different protection strategies are considered with varying degrees of primary and backup route separation. Furthermore, to support various types of traffic demands, we investigate two cases in terms of the number of requested wavelengths. First, the number of requested wavelengths is less than link wavelength capacity. Second, the number of requested wavelengths is greater than link wavelength capacity. For the latter case, the proposed scheme allows traffic splitting among feasible primary and backup routes. The proposed scheme well supports the implementation of heuristic algorithms for lightpath provisioning since it can provide reference values, including upper and lower bounds, that are useful as benchmarks.

关键词： Abstracts Network topology Optical fiber networks Routing Routing protocols Scalability Topology Fiber optic networks Routing protocols Network routing Network topology topology optical paths Scalability Traffic wavelengths inductive logic programming provisioning multiple domain networks

来源：评论

学校读者我要写书评

暂无评论

Learning Requirements Analysis to Software Design Transformation Rules by Examples: Limitations of Current ILP Systems 5

Learning Requirements Analysis to Software Design Transforma...

引用

5th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Al-Jamimi, Hamdi A. Ahmed, Moataz A. King Fahd Univ Petr & Minerals Dept Informat & Comp Sci Dhahran 31261 Saudi Arabia

ISBN: (纸本)9781479932795

Model transformation is defined as a central concept in model driven engineering. Identifying the transformation rules is nontrivial task, where it might be much easier for the experts to provide examples of the transformations rather than specifying complete and consistent rules. The examples provided by expert represent their knowledge in the domain. Thus, it is much beneficial to utilize a set of examples, i.e. pairs of transformation source and target models, in order to learn transformation rules. Machine learning (ML) techniques proved their ability of learning relations and concepts in various domains. In this paper, we aim to apply inductive logic programming (ILP) for learning the transformation rules between the requirements analysis and software design based on a set of pairs of transformation analysis and design models. ALEPH and GILPS systems have been employed, individually, to induce the intended transformation rules;however the resultant rules don't accommodate the desire transformations. Thus, in this paper we focus on identifying the problem of analysis-design transformation and discussing the derived rules as well as the limitations of the current ILP systems.

关键词： Model Transformation Requirement Analysis Software Design Transformation Rules inductive logic programming

来源：评论

学校读者我要写书评

暂无评论

Rule Mining using Many-sorted logic

Rule Mining using Many-sorted Logic

引用

4th IEEE International Advance Computing Conference (IACC)

作者： Hudli, Shrihari A. Hudli, Aditi A. Hudli, Anand V. ObjectOrb Technol Bangalore Karnataka India MS Ramiah Inst Technol Dept Comp Sci Bangalore Karnataka India

ISBN: (纸本)9781479925711

inductive logic programming (ILP) is used in relational data mining to discover rules in first order logic, given data in multiple relations. This form of data mining has to be distinguished from market basket analysis where the data comes from a single relational table. Although ILP addresses the problem of dealing with data from multiple relational tables, the fact remains that the efficiency of inferring rules in first order logic is significantly less than that of many-sorted logic. Further, many sorted logic is a closer reflection of the real world of objects that belong to sorts, in the presence of a sort hierarchy. We propose a new approach to ILP using many-sorted logic that is more computationally efficient than the approach based on unsorted first order logic.

关键词： Data mining business intelligence machine learning Big Data inductive logic programming many-sorted logic sort hierarchy

来源：评论

学校读者我要写书评

暂无评论

ILP Modulo Data 14

ILP Modulo Data

引用

Conference on Formal Methods in Computer-Aided Design (FMCAD)

作者： Manolios, Panagiotis Papavasileiou, Vasilis Riedewald, Mirek Northeastern Univ Boston MA 02115 USA

ISBN: (纸本)9780983567844

The vast quantity of data generated and captured every day has led to a pressing need for tools and processes to organize, analyze and interrelate this data. Automated reasoning and optimization tools with inherent support for data could enable advancements in a variety of contexts, from data-backed decision making to data-intensive scientific research. To this end, we introduce a decidable logic aimed at database analysis. Our logic extends quantifier-free Linear Integer Arithmetic with operators from Relational Algebra, like selection and cross product. We provide a scalable decision procedure that is based on the BC(T) architecture for ILP Modulo Theories. Our decision procedure makes use of database techniques. We also experimentally evaluate our approach, and discuss potential applications.

关键词： Cognition Concrete Database systems Polynomials Portfolios Database systems Polynomial decision procedure Cognition Concrete BRIEFCASE inductive logic programming Modulo relational algebra integer arithmetic Cross product Intelligence Formal logic database analysis

来源：评论

学校读者我要写书评

暂无评论

Constraint programming Solving in Fuzzy Models

Constraint Programming Solving in Fuzzy Models

引用

23rd International-Business-Information-Management-Association Conference on Visio 2020: Sustainable Growth, Economic Development, and Global Competitiveness

作者： Tudor, Liviana N. Petr Gas Univ Ploiesti Dept Informat Technol Ploiesti Romania

ISBN: (纸本)9780986041921

This paper presents a fuzzy reasoning pattern using some logic programming techniques. A fuzzy approach of a multi-attribute decisional problem is developed. The proposed system offers a model of constraint programming solving for finite domain. A case study is achieved for choosing the optimal merging variant of two companies from more similar suggestions.

关键词： inductive logic programming constraint programming multi-attribute decisional problem fuzzy reasoning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：