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

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

来源：评论

学校读者我要写书评

暂无评论

Default logic knowledge management in a multi-agent system

Default logic knowledge management in a multi-agent system

引用

IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (WI-IAT)

作者： Ryzko, Dominik Rybinski, Henryk Warsaw Univ Technol Inst Comp Sci PL-00661 Warsaw Poland

ISBN: (纸本)9781479941438

The paper describes the framework for management of knowledge represented in the form of default theories in a multi-agent system. The process covers the knowledge acquisition as well as its further sharing and transformation. It is shown how two approaches to default rules transformation proposed before can be merged into a coherent system.

关键词： inductive logic programming knowledge acquisition knowledge representation multi-agent systems DDL ILP default logic knowledge management default rule transformation default theories distributed default logic knowledge sharing knowledge transformation multiagent system Atmospheric measurements Cognition Knowledge management logic programming Multi-agent systems Particle measurements Rough sets Multi-agent systems inductive logic programming Information Extraction Knowledge Representation Particle measurements atmospheric monitoring knowledge management logic programming Rough sets knowledge sharing Cognition

来源：评论

学校读者我要写书评

暂无评论

targetDP: an Abstraction of Lattice Based Parallelism with Portable Performance 16

targetDP: an Abstraction of Lattice Based Parallelism with P...

引用

16th IEEE International Conference on High Performance Computing and Communications HPCC 2014\11th IEEE International Conference on Embedded Software and Systems ICESS 2014\6th International Symposium on Cyberspace Safety and Security CSS 2014

作者： Gray, Alan Stratford, Kevin Univ Edinburgh EPCC Edinburgh EH9 3JZ Midlothian Scotland

ISBN: (纸本)9781479961238

To achieve high performance on modern computers, it is vital to map algorithmic parallelism to that inherent in the hardware. From an application developer's perspective, it is also important that code can be maintained in a portable manner across a range of hardware. Here we present targetDP (target Data Parallel), a lightweight programming layer that allows the abstraction of data parallelism for applications that employ structured grids. A single source code may be used to target both thread level parallelism (TLP) and instruction level parallelism (ILP) on either SIMD multi-core CPUs or GPU-accelerated platforms. targetDP is implemented via standard C preprocessor macros and library functions, can be added to existing applications incrementally, and can be combined with higher-level paradigms such as MPI. We present CPU and GPU performance results for a benchmark taken from the lattice Boltzmann application that motivated this work. These demonstrate not only performance portability, but also the optimisation resulting from the intelligent exposure of ILP.

关键词： Synclitism data parallel parallelism crystal lattices Abstraction inductive logic programming central processing units Source code message passing mannose phosphate isomerase remote procedure calls library function BENCHMARKS HIGH-PERFORMANCE Codes

来源：评论

学校读者我要写书评

暂无评论

Machine Translation Model using inductive logic programming

Machine Translation Model using Inductive Logic Programming

引用

International Conference on Natural Language Processing and Knowledge Engineering(IEEE自然语言处理与知识工程国际会议 IEEE NLP-KE 2009)

作者： Aly Fahmy Ahmad Hossny Khaled Shaalan Faculty of Computers and Information Cairo University Cairo Egypt Faculty of Informatics British University in Dubai Dubai UAE

Rule based machine translation systems face different challenges in building the translation model in a form of transfer rules. Some of these problems require enormous human effort to state rules and their consistency. This is where different human linguists make different rules for the same sentence. A human linguist states rules to be understood by human rather than machines. The proposed translation model (from Arabic to English) tackles the mentioned problem of building translation model. This model employs inductive logic programming (ILP) to learn the language model from a set of example pairs acquired from parallel corpora and represent the language model in a rule-based format that maps Arabic sentence pattern to English sentence pattern. By testing the model on a small set of data, it generated translation rules with logarithmic growing rate and with word error rate 11%

关键词： Machine translation inductive logic programming rule based machine translation ezample based machine translation rule Induction Arabic to English

来源：评论

学校读者我要写书评

暂无评论

Predicting virus mutations through statistical relational learning

引用

BMC BIOINFORMATICS 2014年第1期15卷 1-12页

作者： Cilia, Elisa Teso, Stefano Ammendola, Sergio Lenaerts, Tom Passerini, Andrea Univ Livre Bruxelles MLG Dept Informat B-1050 Brussels Belgium ULB VUB Interuniv Inst Bioinformat Brussels IB 2 B-1050 Brussels Belgium Univ Trento Dept Comp Sci & Informat Engn I-38123 Trento Povo Italy Ambiotec Sas R&D I-00142 Cisterna Latina LT Italy Vrije Univ Brussel Vakgroep Computerwetenschappen AI Lab B-1050 Brussels Belgium

Background: Viruses are typically characterized by high mutation rates, which allow them to quickly develop drug-resistant mutations. Mining relevant rules from mutation data can be extremely useful to understand the virus adaptation mechanism and to design drugs that effectively counter potentially resistant mutants. Results: We propose a simple statistical relational learning approach for mutant prediction where the input consists of mutation data with drug-resistance information, either as sets of mutations conferring resistance to a certain drug, or as sets of mutants with information on their susceptibility to the drug. The algorithm learns a set of relational rules characterizing drug-resistance and uses them to generate a set of potentially resistant mutants. Learning a weighted combination of rules allows to attach generated mutants with a resistance score as predicted by the statistical relational model and select only the highest scoring ones. Conclusions: Promising results were obtained in generating resistant mutations for both nucleoside and non-nucleoside HIV reverse transcriptase inhibitors. The approach can be generalized quite easily to learning mutants characterized by more complex rules correlating multiple mutations.

关键词： Nucleoside Reverse Transcriptase Inhibitor Amino Acid Mutation inductive logic programming Definite Clause Single Amino Acid Mutation

来源：评论

学校读者我要写书评

暂无评论

inductive logic programming for gene regulation prediction

引用

MACHINE LEARNING 2008年第2-3期70卷 225-240页

作者： Froehler, Sebastian Kramer, Stefan Tech Univ Munich Inst Informat D-85748 Garching Germany

We present a systems biology application of ILP, where the goal is to predict the regulation of a gene under a certain condition from binding site information, the state of regulators, and additional information. In the experiments, the boosted Tilde model is on par with the original model by Middendorf et al. based on alternating decision trees (ADTrees), given the same information. Adding functional categorizations and protein-protein interactions, however, it is possible to improve the performance substantially. We believe that decoding the regulation mechanisms of genes is an exciting new application of learning in logic, requiring data integration from various sources and potentially contributing to a better understanding on a system level.

关键词： inductive logic programming relational learning gene regulation gene expression systems biology

来源：评论

学校读者我要写书评

暂无评论

inductive logic programming for gene regulation prediction

Inductive logic programming for gene regulation prediction

引用

16th International Conference of inductive logic programming

作者： Froehler, Sebastian Kramer, Stefan Tech Univ Munich Inst Informat D-85748 Garching Germany

关键词： inductive logic programming relational learning gene regulation gene expression systems biology

来源：评论

学校读者我要写书评

暂无评论

Co-Optimization of Memory BIST Grouping, Test Scheduling, and logic Placement 14

Co-Optimization of Memory BIST Grouping, Test Scheduling, an...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Andrew B. Kahng Ilgweon Kang UC San Diego ECE and La Jolla CA UC San Diego ECE La Jolla CA

ISBN: (纸本)9783981537024

Built-in self-test (BIST) is a well-known design technique in which part of a circuit is used to test the circuit itself. BIST plays an important role for embedded memories, which do not have pins or pads exposed toward the periphery of the chip for testing with automatic test equipment. With the rapidly increasing number of embedded memories in modern SOCs (up to hundreds of memories in each hard macro of the SOC), product designers incur substantial costs of test time (subject to possible power constraints) and BIST logic physical resources (area, routing, power). However, only limited previous work addresses the physical design optimization of BIST logic;notably, Chien et al. [7] optimize BIST design with respect to test time, routing length, and area. In our work, we propose a new three-step heuristic approach to minimize test time as well as test physical layout resources, subject to given upper bounds on power consumption. A key contribution is an integer linear programming ILP framework that determines optimal test time for a given cluster of memories using either one or two BIST controllers, subject to test power limits and with full comprehension of available serialization and parallelization. Our heuristic approach integrates (i) generation of a hypergraph over the memories, with test time-aware weighting of hyperedges, along with top-down, FM-style min-cut partitioning;(ii) solution of an ILP that comprehends parallel and serial testing to optimize test scheduling per BIST controller;and (iii) placement of BIST logic to minimize routing and buffering costs. When evaluated on hard macros from a recent industrial 28nm networking SOC, our heuristic solutions reduce test time estimates by up to 11.57% with strictly fewer BIST controllers per hard macro, compared to the industrial solutions.

关键词： Built-in self test TESTING TIME Memory embedded memory inductive logic programming Formal logic power limit Network routing

来源：评论

学校读者我要写书评

暂无评论

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

Learning Requirements Analysis to Software Design Transforma...

引用

2014 IEEE 5th International Conference on Software Engineering and Service Science

作者： Hamdi A.Al-Jamimi Moataz A.Ahmed Information and Computer Science Department King Fahd University of Petroleum and Minerals Dhahran Saudi Arabia

Model transformation is defined as a central concept in model driven *** 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 *** examples provided by expert represent their knowledge in the ***,it is much beneficial to utilize a set of examples,*** of transformation source and target models,in order to learn transformation *** learning(ML) techniques proved their ability of learning relations and concepts in various *** 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 *** and GILPS systems have been employed,individually,to induce the intended transformation rules;however the resultant rules don't accommodate the desire ***,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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：