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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

298 篇 会议
27 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

245 篇 工学
- 229 篇 计算机科学与技术...
- 117 篇 软件工程
- 19 篇 电气工程
- 17 篇 控制科学与工程
- 14 篇 信息与通信工程
- 6 篇 机械工程
- 5 篇 电子科学与技术（可...
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 农业工程
- 1 篇 光学工程
53 篇 理学
- 39 篇 数学
- 8 篇 生物学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 3 篇 化学
- 2 篇 物理学
23 篇 管理学
- 14 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 5 篇 工商管理
6 篇 经济学
- 3 篇 理论经济学
- 3 篇 应用经济学
3 篇 教育学
- 2 篇 教育学
- 1 篇 心理学(可授教育学...
3 篇 农学
- 2 篇 作物学
2 篇 法学
- 2 篇 社会学
1 篇 医学

主题

70 篇 logic programmin...
18 篇 inductive logic ...
12 篇 programming
10 篇 logic gates
7 篇 computer science
7 篇 semantics
6 篇 computer circuit...
6 篇 inductive logic ...
6 篇 probabilistic lo...
6 篇 artificial intel...
5 篇 optimization
5 篇 logic
5 篇 machine learning
4 篇 formal logic
4 篇 computer archite...
4 篇 model checking
4 篇 java
4 篇 computer languag...
4 篇 integer programm...
4 篇 hardware

机构

5 篇 inria rennes ren...
5 篇 university of po...
3 篇 microsoft res re...
3 篇 univ paris 13 li...
3 篇 carnegie mellon ...
3 篇 aalto university...
3 篇 univ penn philad...
2 篇 univ wales dept ...
2 篇 stanford univ ct...
2 篇 politecn torino ...
2 篇 indian inst tech...
2 篇 univ freiburg in...
2 篇 univ wisconsin d...
2 篇 czech tech univ ...
2 篇 univ london impe...
2 篇 department of in...
2 篇 univ paris 13 li...
2 篇 harvard univ cam...
2 篇 columbia univ ct...
2 篇 ibm unternehmens...

作者

8 篇 gebser martin
6 篇 srinivasan ashwi...
6 篇 alphonse erick
5 篇 schaub torsten
5 篇 ricca francesco
4 篇 osmani aomar
4 篇 page david
4 篇 camacho rui
3 篇 yamamoto akihiro
3 篇 king ross
3 篇 rouveirol celine
3 篇 moreno gines
3 篇 leger hippolyte
3 篇 janhunen tomi
3 篇 maratea marco
3 篇 bouthinon domini...
3 篇 lebbah mustapha
2 篇 muggleton stephe...
2 篇 fronhöfer b
2 篇 khatibsyarbini

语言

317 篇 英文
7 篇 其他
5 篇 中文

检索条件"任意字段=13th International Conference on Inductive Logic Programming"

共 329 条记录，以下是141-150 订阅

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

详细简洁

排序：

On Energy Efficient Scheduling and Load Distribution Based on Renewable Energy for Wireless Mesh Network in Disaster Area

On Energy Efficient Scheduling and Load Distribution Based o...

引用

IEEE international conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Meng Li Hiroki Nishiyama Yasunori Owada Kiyoshi Hamaguchi Graduate School of Information Sciences Tohoku University Japan National Institute of Information and Communication Technology Japan

In recent years, disasters happened in many places, and resulted in power shortage and communication interruption. the Wireless Mesh Networks (WMNs) constituted by Renewable Energy-enabled Base Station (REBS) is regarded as a powerful solution in post-disaster recovery, for its energy harvesting ability and the ready-made facilities. However, this solution needs to address several challenges such as unstable power supply, limited bandwidth and long-term optimization. In this paper, we focus on the issue of energy efficiency when realizing the maximal network throughput in a period of time, by the combination of energy usage and network data distribution. To this end, we firstly analyze the unique features of REBS and its associated network in disaster area. then a throughput-maximization problem is proposed in order to figure out the maximal network throughput. Based on the maximal value, we count out the most energy-efficiency result while guaranteeing the maximal network throughput. We formulate the proposed model into a two-stage Mixed-Integer Linear programming (MILP) problem and solve it by branch-and-bound algorithm. Simulation results demonstrate our considered two-stage energy efficient scheme strikes a balance between network throughput and its associated energy consumption, and outperforms the existing schemes.

关键词： Base stations throughput Energy harvesting Energy consumption logic gates Renewable energy sources Batteries

来源：评论

学校读者我要写书评

暂无评论

Aspectual Source Code Analysis with GASR

Aspectual Source Code Analysis with GASR

引用

13th IEEE international Working conference on Source Code Analysis and Manipulation (SCAM)

作者： Fabry, Johan De Roover, Coen Jonckers, Viviane Univ Chile PLEIAD Lab Dept Comp Sci DCC Santiago Chile Vrije Univ Brussel Software Languages Lab Brussels Belgium

ISBN: (纸本)9781467357395

To be able to modularize crosscutting concerns, aspects introduce new programming language features, often in a new language, with a specific syntax. these new features lead to new needs for source code analysis tools, resulting in the requirement for a general-purpose aspectual source code analysis tool. Ignoring this requirement has led to a nontrivial duplication of effort in the aspect-oriented software development community. this is because all code analysis efforts that we are aware of have either built ad-hoc analysis tools or were performed manually. In this paper we present GASR: a source code analysis tool in the tradition of logic program querying that reasons over ASPECTJ source code. By hooking into the IDE plugins for ASPECTJ, GASR provides a library of predicates that can be used to query aspectual source code. We demonstrate the use of GASR by automating the recognition of a number of previously identified aspectual source code assumptions. We then detect assumption instances on two well-known case studies that were manually investigated in the earlier work. In addition to finding the already known aspect assumptions, GASR encounters assumption instances that were overlooked before.

关键词： Aspect Oriented programming logic Program Querying Aspectual Assumptions

来源：评论

学校读者我要写书评

暂无评论

Probabilistic abductive logic programming: A joint approach of logic and probability 1

Probabilistic abductive logic programming: A joint approach ...

引用

1st Doctoral Workshop in Artificial Intelligence, DWAI 2013, An Official Workshop of the 13th international conference of the Italian Association for Artificial Intelligence, AI*IA 2013

作者： Rotella, F. Ferilli, S. Dipartimento di Informatica Universit di Bari Italy Centro Interdipartimentale per la Logica e sue Applicazioni Universit di Bari Italy

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2013 13th international conference on Application of Concurrency to System Design, ACSD 2013

Proceedings - 2013 13th International Conference on Applicat...

引用

2013 13th international conference on Application of Concurrency to System Design, ACSD 2013

ISBN: (纸本)9780769550350

the proceedings contain 25 papers. the topics discussed include: maximal synthesis for Hennessy-Milner logic;incremental bisimulation abstraction refinement;a new multi-threaded code synthesis methodology and tool for correct-by-construction synthesis from polychronous specifications;towards optimal supervisory control of discrete-time stochastic discrete-event processes with data;parametrized compositional verification with multiple process and data types;modular verification of synchronous programs;incremental generation of linear invariants for component-based systems;polynomial sufficient conditions of well-behavedness for weighted join-free and choice-free systems;polynomial sufficient conditions of well-behavedness for weighted join-free and choice-free systems;checking partial-order properties of vector addition systems with states;and programming and timing analysis of parallel programs on multicores.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Comparing alternative solutions for unfounded set propagation in ASP

Comparing alternative solutions for unfounded set propagatio...

引用

13th international conference of the Italian Association for Artificial Intelligence, AI*IA 2013

作者： Alviano, Mario Dodaro, Carmine Ricca, Francesco Department of Mathematics and Computer Science University of Calabria 87036 Rende Italy

ISBN: (纸本)9783319035239

Answer Set programming (ASP) is a logic programming language for nonmonotonic reasoning. Propositional ASP programs are usually evaluated by DPLL algorithms combining unit propagation with operators that are specific of ASP. Among them, unfounded set propagation is used for handling recursive programs by many ASP solvers. this paper reports a comparison of two available solutions for unfounded set propagation, the one adopted in DLV and that based on source pointers. the paper also discusses the impact of splitting the input program in components according to head-to-body dependencies. Both solutions and variants have been implemented in the same solver, namely WASP. An advantage in properly splitting the program in components is highlighted by an experiment on a selection of problems taken from the 3rd ASP Competition. In this experiment the algorithm based on source pointers performs better. © Springer international Publishing Switzerland 2013.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Parallel Implementation of Real-Time Semi-Global Matching on Embedded Multi-Core Architectures

Parallel Implementation of Real-Time Semi-Global Matching on...

引用

13th international conference on Embedded Computer Systems - Architectures, Modeling and Simulation (IC-SAMOS)

作者： Arndt, Oliver Jakob Becker, Daniel Banz, Christian Blume, Holger Leibniz Univ Hannover Inst Microelect Syst D-30167 Hannover Germany Corporate Techn D-81739 Munich Germany

ISBN: (纸本)9781479901036

Embedded real-time algorithms are often realized with dedicated hardware, exhibiting high production costs and low programming flexibility thereafter. For instance, semi-global matching for stereo image processing, including complex data flows, traditionally runs on customized hardware modules. Combining the processing and memory capabilities of multiple individual cores, emerging embedded multi-core technologies address these problems. However, considering concurrency issues (e. g., data races and lock contentions), parallel programming requires experienced programmers and technology-specific techniques (e. g., synchronization libraries) and tools (e. g., parallel profilers), which are often not available on embedded platforms. In this work, we introduce a parallel version of a semi-global matching algorithm and demonstrate within this case study runtime optimizations necessary to meet real-time requirements. We also show structured steps of the applied parallelization workflow, illustrating an efficient migration strategy to multi-core platforms using runtime information (e. g., profiles and hardware counters). Finally, to evaluate the resulting performance characteristics, we compare the runtime behavior of the parallel version running on a Freescale P4080 processor with reference values taken on an Intel i7, a field-programmable logic device, an extended general purpose processor and a GPU.

关键词： concurrency control embedded systems image matching multiprocessing systems parallel architectures parallel programming performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Syntax-Guided Synthesis

Syntax-Guided Synthesis

引用

13th international conference on Formal Methods in Computer-Aided Design (FMCAD)

作者： Alur, Rajeev Bodik, Rastislav Juniwal, Garvit Martin, Milo M. K. Raghothaman, Mukund Seshia, Sanjit A. Singh, Rishabh Solar-Lezama, Armando Torlak, Emina Udupa, Abhishek Univ Penn Philadelphia PA 19104 USA Univ Calif Berkeley Berkeley CA USA MIT Cambridge MA 02139 USA

ISBN: (纸本)9780983567837

the classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of allowed implementations. Our goal is to identify the core computational problem common to these proposals in a logical framework. the input to the syntax-guided synthesis problem (SyGuS) consists of a background theory, a semantic correctness specification for the desired program given by a logical formula, and a syntactic set of candidate implementations given by a grammar. the computational problem then is to find an implementation from the set of candidate expressions so that it satisfies the specification in the given theory. We describe three different instantiations of the counter-example-guided-inductive-synthesis (CEGIS) strategy for solving the synthesis problem, report on prototype implementations, and present experimental results on an initial set of benchmarks.

关键词： automatic programming computational linguistics formal specification program verification

来源：评论

学校读者我要写书评

暂无评论

Mining Probabilistic Frequent Spatio-Temporal Sequential Patterns with Gap Constraints from Uncertain Databases

Mining Probabilistic Frequent Spatio-Temporal Sequential Pat...

引用

IEEE international conference on Data Mining (ICDM)

作者： Yuxuan Li James Bailey Lars Kulik Jian Pei Department of Computing and Information Systems The University of Melbourne VIC Australia School of Computing Science Simon Fraser University Canada

ISBN: (纸本)9781479913282

Uncertainty is common in real-world applications, for example, in sensor networks and moving object tracking, resulting in much interest in item set mining for uncertain transaction databases. In this paper, we focus on pattern mining for uncertain sequences and introduce probabilistic frequent spatial-temporal sequential patterns with gap constraints. Such patterns are important for the discovery of knowledge given uncertain trajectory data. We propose a dynamic programming approach for computing the frequentness probability of these patterns, which has linear time complexity, and we explore its embedding into pattern enumeration algorithms using both breadth-first search and depth-first search strategies. Our extensive empirical study shows the efficiency and effectiveness of our methods for synthetic and real-world datasets.

关键词： Probabilistic logic Databases Data mining Trajectory Uncertainty Dynamic programming Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Allocation of solar units to reduce annual costs of the distribution system

Allocation of solar units to reduce annual costs of the dist...

引用

international conference on Environment and Electrical Engineering (EEEIC)

作者： Mahmood Sadeghi Mohsen Kalantar Dept. of Electrical Engineering Iran University of Science and Technology Tehran Iran

It is widely accepted that renewable sources can find their significant role in power distribution systems. these non-pollutant resources have a lot of advantages such as reducing active power loss, increasing reliability, supplying the peak load duration time, etc. this paper presents a solar unit planning considering uncertainty of solar radiance in order to reduce the costs of the distribution system including costs of energy loss, energy not supplied costs and the purchased power costs. the uncertainty of solar radiance is modeled with Beta probability density function. the planning problem is formulated as mixed integer nonlinear programming (MINLP) and is tested on a 9 bus distribution system using GAMS software. the results show a significant reduction in costs of distribution system in presence of solar units.

关键词： Planning Energy loss Uncertainty Mathematical model Resource management Probabilistic logic Equations

来源：评论

学校读者我要写书评

暂无评论

Probabilistic neuromorphic system using binary phase-change memory (PCM) synapses: Detailed power consumption analysis

Probabilistic neuromorphic system using binary phase-change ...

引用

IEEE conference on Nanotechnology

作者： Daniele Garbin Manan Suri Olivier Bichler Damien Querlioz Christian Gamrat Barbara DeSalvo CEA-LETI-MINATEC Grenoble France CEA-LIST France IEF-Paris Orsay France CEA-LETIMINATEC 38054 Grenoble France

In this paper we investigate the use of phase-change memory (PCM) devices as binary probabilistic synapses in a neuromorphic computing system for complex visual pattern extraction. Different PCM programming schemes for architectures with- or without-selector devices are provided. the functionality of the system is tested through large-scale neural network simulations. the system-level simulations show that such a system can solve a complex real-life video processing problem (vehicle counting) with high recognition rate (>94%) and low power consumption. the impact of the resistance window on the power consumption of the system is also studied. Results show that the learning-mode power consumption can be dramatically reduced if the RESET state of the PCM devices is tuned to a relatively low resistance. Read-mode power consumption, on the other hand, can be minimized by increasing the resistance values for both SET and RESET states of the PCM devices.

关键词： Phase change materials Neurons programming Power demand Computer architecture Probabilistic logic Resistance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：