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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

983 篇 会议
37 篇 期刊文献
25 册 图书

馆藏范围

1,043 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

704 篇 工学
- 585 篇 计算机科学与技术...
- 368 篇 软件工程
- 146 篇 电气工程
- 56 篇 控制科学与工程
- 30 篇 信息与通信工程
- 27 篇 材料科学与工程（可...
- 19 篇 电子科学与技术（可...
- 16 篇 机械工程
- 11 篇 动力工程及工程热...
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 7 篇 仪器科学与技术
- 7 篇 石油与天然气工程
- 6 篇 城乡规划学
- 4 篇 核科学与技术
- 4 篇 农业工程
188 篇 理学
- 155 篇 数学
- 18 篇 系统科学
- 17 篇 物理学
- 12 篇 统计学（可授理学、...
- 10 篇 生物学
69 篇 管理学
- 53 篇 管理科学与工程(可...
- 22 篇 工商管理
- 19 篇 图书情报与档案管...
16 篇 教育学
- 16 篇 教育学
11 篇 文学
- 11 篇 新闻传播学
9 篇 法学
- 8 篇 社会学
6 篇 医学
- 4 篇 基础医学(可授医学...
4 篇 农学
- 4 篇 作物学
3 篇 经济学
- 3 篇 应用经济学
1 篇 军事学

主题

96 篇 logic gates
77 篇 programming
63 篇 logic programmin...
40 篇 fuzzy logic
35 篇 application soft...
30 篇 probabilistic lo...
29 篇 linear programmi...
27 篇 programming prof...
27 篇 computer archite...
26 篇 computer science
26 篇 dynamic programm...
23 篇 software enginee...
23 篇 protocols
21 篇 uncertainty
20 篇 object oriented ...
20 篇 java
20 篇 semantics
18 篇 computer circuit...
18 篇 costs
17 篇 software systems

机构

4 篇 univ potsdam pot...
4 篇 vienna univ tech...
4 篇 imdea software i...
4 篇 institute for lo...
3 篇 tu wien austria
3 篇 graduate school ...
3 篇 univ calabria de...
3 篇 carnegie mellon ...
3 篇 univ freiburg fr...
3 篇 univ british col...
3 篇 imperial coll lo...
3 篇 department of in...
2 篇 univ tecn federi...
2 篇 ist austria klos...
2 篇 univ savoie savo...
2 篇 tel aviv univers...
2 篇 zhongguancun lab...
2 篇 univ ferrara dip...
2 篇 south china univ...
2 篇 univ neuchatel i...

作者

8 篇 alviano mario
6 篇 lamma evelina
5 篇 schaub torsten
4 篇 riguzzi fabrizio
3 篇 lin yu
3 篇 vardi moshe y.
3 篇 gebser martin
3 篇 bellodi elena
3 篇 costa vitor sant...
3 篇 shinji sakamoto
3 篇 lakemeyer gerhar...
3 篇 ikeda markus
3 篇 zhou neng-fa
3 篇 xu hongxiang
3 篇 sabuncu orkunt
3 篇 leonard barolli
3 篇 schockaert steve...
3 篇 pichler andreas
3 篇 wang bin
3 篇 de givry simon

语言

1,013 篇 英文
25 篇 其他
8 篇 中文
1 篇 法文

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

共 1045 条记录，以下是351-360 订阅

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

详细简洁

排序：

Framework for a Decentralized Web

Framework for a Decentralized Web

引用

Australasian Telecommunication Networks and Applications conference, ATNAC

作者： Raman Singh Andrew Donegan Hitesh Tewari School of Comp Sci & Stats Trinity College Dublin Dublin Ireland Thapar Institute of Engineering & Technology Patiala India

ISBN: (数字)9781728188270

ISBN: (纸本)9781728188287

Over the past decade, we have witnessed the Internet becoming increasingly centralized in the hands of a small number of giant technology firms, that control many of the most popular applications and the content they host on their platforms. In addition, in the majority of instances today, access to the Internet is usually provided through local internet service providers (ISPs) in each country. Governments in different jurisdictions can exert pressure on these technology firms and ISPs to enforce restrictions on Internet usage by their citizens, such as the blocking access to certain sites and/or content. In this paper, we present a promising new approach to circumventing some of these issues. Our decentralized web (DWeb) proposal makes use of a mesh network to connect community based routers. In addition, objects on the DWeb are indexed using blockchain technology, which allows for secure storage of immutable object references, and integrity checking of the data being served to users. Our DWeb design is also capable of operating during network partitions, and is able to quickly re-synchronize with the larger network once connectivity has been restored. the proposed concept is simulated using ns-3, Multichain and Docker technologies. the performance of the system is analysed for different cache replacement strategies with a varying number of gateway nodes. the Popularity-based cache replacement algorithm outperforms the other studied strategies, which show it is the best-suited strategy for the DWeb architecture. In summary, DWeb solves issues like data integrity, centralization and controlled access to the Internet, and the overall framework exhibits fair performance in the studied simulated environment.

关键词： Internet Blockchain logic gates Routing Routing protocols Mesh networks IP networks

来源：评论

学校读者我要写书评

暂无评论

Characterization of the Convex Lukasiewicz Fragment for Learning from Constraints 32

Characterization of the Convex Lukasiewicz Fragment for Lear...

引用

32nd AAAI conference on Artificial Intelligence / 30th Innovative Applications of Artificial Intelligence conference / 8th AAAI Symposium on Educational Advances in Artificial Intelligence

作者： Giannini, Francesco Diligenti, Michelangelo Gori, Marco Maggini, Marco Univ Siena Dept Informat Engn & Math Sci Via Roma 56 Siena Italy

ISBN: (纸本)9781577358008

this paper provides a theoretical insight for the integration of logical constraints into a learning process. In particular it is proved that a fragment of the Lukasiewicz logic yields a set of convex constraints. the fragment is enough expressive to include many formulas of interest such as Horn clauses. Using the isomorphism of Lukasiewicz formulas and McNaughton functions, logical constraints are mapped to a set of linear constraints once the predicates are grounded on a given sample set. In this framework, it is shown how a collective classification scheme can be formulated as a quadratic programming problem, but the presented theory can be exploited in general to embed logical constraints into a learning process. the proposed approach is evaluated on a classification task to show how the use of the logical rules can be effective to improve the accuracy of a trained classifier.

关键词： Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Efficient cardinality constraints in problog 30

Efficient cardinality constraints in problog

引用

30th Benelux conference on Artificial Intelligence, BNAIC 2018

作者： Van Bremen, Timothy Meert, Wannes De Raedt, Luc Department of Computer Science KU Leuven Celestijnenlaan 200A - box 2402 Leuven3001 Belgium

Cardinality constraints impose the requirement that at least (or at most) a certain number of literals in a set are true. In probabilistic knowledge bases, it is often helpful to use cardinality constraints to represent restrictions on possible models. In this paper, we explore different methods for integrating cardinality constraints into the probabilistic logic programming language ProbLog and compare their performance with respect to the knowledge compilation and query process. © 2018 University of Groningen. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Monolithic Integration of GaN-Based NMOS Digital logic Gate Circuits with E-Mode Power GaN MOSHEMTs 30

Monolithic Integration of GaN-Based NMOS Digital Logic Gate ...

引用

30th IEEE international Symposium on Power Semiconductor Devices and ICs (ISPSD)

作者： Zhu, Minghua Matioli, Elison Ecole Polytech Fed Lausanne Power & Wide Band Gap Elect Res Lab POWERLAB Lausanne Switzerland

ISBN: (纸本)9781538629277

In this work, we demonstrate high-performance NMOS GaN-based logic gates including NOT, NAND, and NOR by integration of E/D-mode GaN MOSHEMTs on silicon substrates. the load-to-driver resistance ratio was optimized in these logic gates by using a multi-finger gate design of E-mode GaN MOSHEMT to increase the logic swing voltage and noise margins, and reduce the transition periods. State-of-the-art NMOS inverter was achieved with logic swing voltage of 4.93 V at a supply voltage of 5 V, low-input noise margin of 2.13 V and high-input noise margin of 2.2 V at room temperature. Excellent high temperature performance, at 300 C, was observed with a logic swing of 4.85 V, low-input noise margin of 1.85 V and high output noise margin of 2.2V. In addition, GaN-based NAND and NOR NMOS logic gates are reported for the first time with very good performance. Finally, the logic gates were monolithically integrated with high-voltage E-mode power transistors, which reveals a significant step forward towards monolithic integration of GaN power transistors with gate drivers.

关键词： logic gates GaN high temperature inverters NAND NOR E-mode D-mode monolithic integration

来源：评论

学校读者我要写书评

暂无评论

Energy Efficiency Exploration on the ZYNQ Ultrascale 30

Energy Efficiency Exploration on the ZYNQ Ultrascale

引用

30th international conference on Microelectronics (ICM)

作者： Giorgi, Roberto Khalili, Farnam Procaccini, Marco Univ Siena Dept Informat Engn & Math Siena Italy Univ Florence Dept Informat Engn Florence Italy

ISBN: (纸本)9781538681671

In the context of Cyber-Physical Systems (CPSs), Single Board Computers (SBCs) could provide adaptivity for various present and future applications, and pemiit scalability through clusters of SBCs while possibly save energy consumption. In this paper, we explore energy efficiency of a Zynq Ultrascale+ based board developed in the context of the AXIOM project. While an entire framework based on the Zynq Ultrascale+ is still in progress, the board is already available and capable of running a full Linux OS and it is possible to measure energy consumption. We demonstrate a possible architecture based on DataFlow-threads (DF-threads), a novel execution model, on the Zynq Ultrascale+ platform, in order to assess the energy efficiency of DF-threads. We measured the power consumption, while the RAW and RDMA message types were transceived through board-to-board interconnects.

关键词： Cyber-Physical Systems Reconfigurable Systems FPGA programming thread Level Parallelization Energy Evaluation

来源：评论

学校读者我要写书评

暂无评论

Effective Ant Colony Optimization Solution for the Brazilian Family Health Team Scheduling Problem 30

Effective Ant Colony Optimization Solution for the Brazilian...

引用

30th IEEE international conference on Tools with Artificial Intelligence (ICTAI)

作者： Martins, Willian Heitor de Santiago, Lucia H. S. A. de Santiago, Rafael Lamb, Luis C. Univ Vale Itajai Lab Appl Intelligence Itajai Brazil Prefeitura Municipal Navegantes Secretaria Saude Navegantes Brazil Univ Fed Santa Catarina Dept Informat & Stat Florianopolis SC Brazil Univ Fed Rio Grande do Sul Inst Informat Porto Alegre RS Brazil

ISBN: (纸本)9781538674499

the family health strategy in Brazil is a program that aims at universal access to actions and services of health promotion, protection, and recovery. In this nationwide program, teams of health professionals are responsible for attending and promoting health actions to a community of a specific area. these teams perform home visits that will support the patients of their respective target areas who demand special health care. To help in the scheduling process of these visits, we propose a new bi-objective problem and two methods for its implementation. the main method is an Ant Colony Optimization-based (ACO) heuristic. the other one is an exact linear programming algorithm designed to allow for experimental comparisons. Our experiments suggest that our ACO surpassed the exact solver in runtime, reaching the optimal solutions for all the solutions known. Amortized complexity analysis showed that the ACO heuristic has sublinear complexity over the number of patients.

关键词： ant colony optimization scheduling algorithms integer linear programming public healthcare health information management

来源：评论

学校读者我要写书评

暂无评论

Automata vs Linear-programming Discounted-Sum Inclusion 30th

Automata vs Linear-Programming Discounted-Sum Inclusion

引用

30th international conference on Computer-Aided Verification (CAV) Held as Part of the Federated logic conference (FloC)

作者： Bansal, Suguman Chaudhuri, Swarat Vardi, Moshe Y. Rice Univ Houston TX 77005 USA

ISBN: (纸本)9783319961422;9783319961415

the problem of quantitative inclusion formalizes the goal of comparing quantitative dimensions between systems such as worst-case execution time, resource consumption, and the like. Such systems are typically represented by formalisms such as weighted logics or weighted automata. Despite its significance in analyzing the quality of computing systems, the study of quantitative inclusion has mostly been conducted from a theoretical standpoint. In this work, we conduct the first empirical study of quantitative inclusion for discounted-sum weighted automata (DS-inclusion, in short). Currently, two contrasting approaches for DS-inclusion exist: the linear-programming based DetLP and the purely automata-theoretic BCV. theoretical complexity of DetLP is exponential in time and space while of BCV is PSPACE-complete. All practical implementations of BCV, however, are also exponential in time and space. Hence, it is not clear which of the two algorithms renders a superior implementation. In this work we present the first implementations of these algorithms, and perform extensive experimentation to compare between the two approaches. Our empirical analysis shows how the two approaches complement each other. this is a nuanced picture that is much richer than the one obtained from the theoretical study alone.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

PPAC: A Versatile In-Memory Accelerator for Matrix-Vector-Product-Like Operations

PPAC: A Versatile In-Memory Accelerator for Matrix-Vector-Pr...

引用

international conference on Application Specific Systems (ASAP), Architectures and Processors

作者： Oscar Castañeda Maria Bobbett Alexandra Gallyas-Sanhueza Christoph Studer School of Electrical and Computer Engineering Cornell University Ithaca NY

Processing in memory (PIM) moves computation into memories with the goal of improving throughput and energy-efficiency compared to traditional von Neumann-based architectures. Most existing PIM architectures are either general-purpose but only support atomistic operations, or are specialized to accelerate a single task. We propose the Parallel Processor in Associative Content-addressable memory (PPAC), a novel in-memory accelerator that supports a range of matrix-vector-product (MVP)-like operations that find use in traditional and emerging applications. PPAC is, for example, able to accelerate low-precision neural networks, exact/approximate hash lookups, cryptography, and forward error correction. the fully-digital nature of PPAC enables its implementation with standard-cell-based CMOS, which facilitates automated design and portability among technology nodes. To demonstrate the efficacy of PPAC, we provide post-layout implementation results in 28nm CMOS for different array sizes. A comparison with recent digital and mixed-signal PIM accelerators reveals that PPAC is competitive in terms of throughput and energy-efficiency, while accelerating a wide range of applications and simplifying development.

关键词： Computer architecture throughput Sociology Statistics logic gates Program processors Task analysis

来源：评论

学校读者我要写书评

暂无评论

Near-linear time algorithms for streett objectives in graphs and MDPs 30

Near-linear time algorithms for streett objectives in graphs...

引用

30th international conference on Concurrency theory, CONCUR 2019

作者： Chatterjee, Krishnendu Dvořák, Wolfgang Henzinger, Monika Svozil, Alexander IST Austria Klosterneuburg Austria Institute of Logic and Computation TU Wien Austria Theory and Application of Algorithms University of Vienna Austria

ISBN: (纸本)9783959771214

the fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All ω-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. the current best-known algorithm for the problem requires time O(min(n2, m√mlog n)+blog n). In this work we present randomized near-linear time algorithms, with expected running time Oe(m + b), where the Oe notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. © Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger, and Alexander Svozil.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Pseudo-exhaustive verification of rule based systems 30

Pseudo-exhaustive verification of rule based systems

引用

30th international conference on Software Engineering and Knowledge Engineering, SEKE 2018

作者： Richard Kuhn, D. Yaga, Dylan Kacker, Raghu N. Lei, Yu Hu, Vincent National Institute of Standards and Technology GaithersburgMD20899 United States Computer Science and Engineering University of Texas at Arlington ArlingtonTX United States

ISBN: (纸本)1891706446

Rule-based systems are important in application domains such as artificial intelligence and business rule engines. When translated into an implementation, simple expressions in rules may map to a large body of code that requires testing. We show how rule-based systems may be tested efficiently, using combinatorial methods and a constraint solver in a test method that is pseudo-exhaustive, which we define as exhaustive testing of all combinations of variable values on which a decision is dependent. the method has been implemented in a tool that can be applied to testing and verification for a wide range of applications. © 2018 Universitat zu Koln. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共105页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：