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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

314 篇 期刊文献
206 篇 会议
3 篇 学位论文
1 册 图书

馆藏范围

524 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

486 篇 工学
- 433 篇 计算机科学与技术...
- 96 篇 软件工程
- 60 篇 电气工程
- 47 篇 控制科学与工程
- 26 篇 信息与通信工程
- 12 篇 生物工程
- 6 篇 生物医学工程（可授...
- 5 篇 电子科学与技术（可...
- 4 篇 机械工程
- 3 篇 仪器科学与技术
- 3 篇 测绘科学与技术
- 3 篇 网络空间安全
- 2 篇 光学工程
- 2 篇 化学工程与技术
81 篇 理学
- 45 篇 数学
- 21 篇 生物学
- 5 篇 物理学
- 5 篇 统计学（可授理学、...
- 4 篇 化学
- 4 篇 系统科学
- 2 篇 地理学
37 篇 医学
- 16 篇 基础医学(可授医学...
- 11 篇 临床医学
- 3 篇 药学(可授医学、理...
- 2 篇 公共卫生与预防医...
36 篇 管理学
- 28 篇 管理科学与工程(可...
- 5 篇 图书情报与档案管...
- 4 篇 公共管理
3 篇 文学
- 2 篇 外国语言文学
3 篇 农学
- 2 篇 作物学
2 篇 哲学
1 篇 经济学
1 篇 法学
1 篇 教育学
1 篇 军事学

主题

524 篇 inductive logic ...
80 篇 machine learning
24 篇 answer set progr...
23 篇 relational learn...
23 篇 data mining
18 篇 statistical rela...
11 篇 logic programmin...
11 篇 predicate invent...
11 篇 explainable ai
9 篇 theory revision
8 篇 reinforcement le...
8 篇 semantic web
8 篇 ilp
8 篇 information extr...
7 篇 computational le...
7 篇 program synthesi...
7 篇 online learning
7 篇 first-order logi...
7 篇 heuristics
7 篇 meta-interpretiv...

机构

9 篇 katholieke univ ...
8 篇 imperial coll lo...
7 篇 natl inst inform...
6 篇 univ london impe...
6 篇 univ bamberg cog...
6 篇 katholieke univ ...
5 篇 univ oxford oxfo...
5 篇 univ texas dalla...
5 篇 imperial coll lo...
4 篇 univ york dept c...
4 篇 univ waikato dep...
4 篇 res org informat...
4 篇 jozef stefan ins...
4 篇 univ oxford comp...
4 篇 columbia univ ct...
4 篇 tufts univ dept ...
4 篇 univ fed pernamb...
4 篇 univ new south w...
4 篇 univ toulouse 3 ...
3 篇 department of co...

作者

16 篇 inoue katsumi
13 篇 srinivasan ashwi...
13 篇 schmid ute
8 篇 costa vitor sant...
8 篇 muggleton stephe...
8 篇 russo alessandra
7 篇 cropper andrew
7 篇 blockeel h
7 篇 gupta gopal
7 篇 camacho rui
6 篇 dzeroski s
6 篇 ribeiro tony
6 篇 kersting kristia...
6 篇 shakerin farhad
6 篇 zelezny filip
6 篇 zaverucha gerson
5 篇 sakama chiaki
5 篇 de raedt luc
5 篇 law mark
5 篇 siebers michael

语言

497 篇 英文
22 篇 其他
3 篇 中文
1 篇 德文
1 篇 法文

检索条件"主题词=Inductive Logic Programming"

共 524 条记录，以下是221-230 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Function-Level Processor (FLP): Raising Efficiency by Operating at Function Granularity for Market-Oriented MPSoC

Function-Level Processor (FLP): Raising Efficiency by Operat...

引用

IEEE 25th International Conference on Application-Specific Systems, Architectures and Processors (ASAP)

作者： Tabkhi, Hamed Bushey, Robert Schirner, Gunar Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA Analog Devices Inc ADI Embedded Syst Prod & Technol Norwood MA USA

ISBN: (纸本)9781479936090

The exponential growth in computation demand drives chip vendors to heterogeneous architectures combining Instruction-Level Processors (ILPs) and custom HW Accelerators (HWACCs) in an attempt to provide the needed processing capabilities while meeting power/energy requirements. ILPs, on one hand, are highly flexible, but power inefficient. Custom HWACCs, on the other hand, are inflexible (focusing on dedicated kernels), but highly power efficient. Since, designing HWACCs for every application is cost prohibitive, large portions of applications still run inefficiently on ILPs. New processing architectures are needed that combine the power efficiency of HWACCs while still retaining sufficient flexibility to realize applications across targeted market segments. This paper introduces Function-Level Processors (FLPs) to fill the gap between ILPs and dedicated HWACCs. FLPs are comprised of configurable Function Blocks (FBs) implementing selected functions which are then interconnected via programmable point-to-point connections constructing an extensible/configurable macro data-path. An FLP raises programming abstraction to a Function-Set Architecture (FSA) controlling FBs allocation, configuration and scheduling. We demonstrate FLP benefits with an industry example of the Pipeline-Vision Processor (PVP). We highlight the gained flexibility by mapping 10 embedded vision applications entirely to the FLP-PVP offering up to 22.4 GOPs/s with average power of 120 mW. The results also demonstrate that our FLP-PVP solution consumes 14x-18x less power than an ILP and 5x less power than a hybrid ILP+ HWACCs solution.

关键词： fault-location problem PROCESSOR inductive logic programming dynamic efficiency Exponential Growth average power ARCHITECTURE Power (Psychology) Energy sources macro data Target marketing Connection points

来源：评论

学校读者我要写书评

暂无评论

Car relocation for carsharing service: Comparison of CPLEX and Greedy Search

Car relocation for carsharing service: Comparison of CPLEX a...

引用

IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)

作者： Zakaria, Rabih Dib, Mohammad Moalic, Laurent Caminada, Alexandre UTBM OPERA F-90000 Belfort France CEEME GDF SUEZ Paris France

ISBN: (纸本)9781479944972

In this paper, we present two approaches to solve the relocation problem in one-way carsharing system. We start by formulating the problem as an Integer Linear programming Model. Then using mobility data collected from an operational carsharing system, we built demands matrices that will be used as input data for our solver. We notice that the time needed to solve the ILP using an exact solver increases dramatically when we increase the number of employees involved in the relocation process and when the system gets bigger. To cope with this problem, we develop a greedy algorithm in order to solve the relocation problem in a faster time. Our algorithm takes one second to solve the relocation problem in worst cases;also, we evaluated the robustness of the two approaches with stochastic input data using different numbers of employees.

关键词： greedy algorithms integer programming linear programming transportation CPLEX ILP car relocation carsharing service greedy search integer linear programming model mobility data relocation process stochastic input data Companies Data models Greedy algorithms Integer linear programming Solids Space stations Vehicles greedy algorithm Space stations Integer linear programming inductive logic programming data models Relocation incoming data Integer programming vehicle linear programming Companies transport greedy method linear programming models

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共53页 << < 19 20 21 22 23 24 25 26 27 28 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：