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

arXiv 2019年

作者： Wagle, Ankit Singh, Gian Yang, Jinghua Khatri, Sunil Vrudhula, Sarma School of Computing Informatics and Decision Systems Engineering Arizona State University TempeAZ85281 United States Dept. of Electrical and Computer Engineering Texas A&M University College StationTX United States

This paper describes a novel design of a threshold logic gate (a binary perceptron) and its implementation as a standard cell. This new cell structure, referred to as flash threshold logic (FTL), uses floating gate (flash) transistors to realize the weights associated with a threshold function. The threshold voltages of the flash transistors serve as a proxy for the weights. An FTL cell can be equivalently viewed as a multi-input, edge-triggered flipflop which computes a threshold function on a clock edge. Consequently, it can be used in the automatic synthesis of ASICs. The use of flash transistors in the FTL cell allows programming of the weights after fabrication, thereby preventing discovery of its function by a foundry or by reverse engineering. This paper focuses on the design and characteristics of the FTL cell. We present a novel method for programming the weights of an FTL cell for a specified threshold function using a modified perceptron learning algorithm. The algorithm is further extended to select weights to maximize the robustness of the design in the presence of process variations. The FTL circuit was designed in 40nm technology and simulations with layout-extracted parasitics included, demonstrate significant improvements in the area (79.7%), power (61.1%), and performance (42.5%) when compared to the equivalent implementations of the same function in conventional static CMOS design. Weight selection targeting robustness is demonstrated using Monte Carlo simulations. The paper also shows how FTL cells can be used for fixing timing errors after fabrication. Copyright © 2019, The Authors. All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of a Privacy Framework for the Internet of Things (IoT)

Design and Implementation of a Privacy Framework for the Int...

引用

Euromicro Symposium on Digital System Design

作者： Paris Panagiotou Nicolas Sklavos Ioannis D. Zaharakis Computer Engineering & Informatics Dept. University of Patras Hellas Computer & Informatics Engineering Dept. Technological Educational Institute of Western Greece Hellas

ISBN: (纸本)9781538673782

Nowadays, Internet of Things (IoT) is gradually finding its way, into everybody's life. This paper, introduces both the design and the implementation of a privacy framework, for the Internet of Things (IoT). Taking the benefits from it, a privacy platform is developed with a twofold aim: firstly, to train in detail the fundamentals of cryptography and privacy, and secondly, to make applied cryptography more interactive and flexible. Through this work, the proposed architecture and the integration of this open platform is presented, in detail. In addition, an application of symmetric cryptography is introduced, based on the Advanced Encryption Standard (AES) in various modes of operation, for both encryption and decryption of texts, images and electronic data files.

关键词： Encryption Internet of Things Training Privacy Ciphers

来源：评论

学校读者我要写书评

暂无评论

JMentor: An Ontology-Based Framework for Software Understanding and Reuse

JMentor: An Ontology-Based Framework for Software Understand...

引用

ACS/IEEE International Conference on computer Systems and Applications

作者： Majdi Rawashdeh Awny Alnusair Muder Almiani Lina Sawalha Dept. of Business Information Technology Princess Sumaya University for Technology Amman Jordan Dept. of Informatics & Computer Science Indiana University Kokomo Kokomo IN USA Computer Information Systems Dept. Al-Hussein Bin Talal University Ma'an Jordan Dept. of Electrical and Computer Engineering Western Michigan University Kalamazoo MI USA

ISBN: (数字)9781728150529

ISBN: (纸本)9781728150536

Understanding and reusing complex APIs is a difficult and time consuming process, especially in legacy code and open-source software libraries and frameworks. While some primary API features are documented properly, most others lack enough documentation and design knowledge that can help developers find, understand, and reuse the needed software components and other library features. As such, the source-code itself is often the only reliable means for programmers to rely on when performing their reuse practices. In order to leverage program understanding and software reuse, this paper describes an ontology-based system named JMentor that we have developed for this purpose. Firstly, JMentor is capable of recovering the lost design decisions by reverse engineering design patterns. Secondly, JMentor provides a mechanism for locating and retrieving reusable software components. Thirdly, JMentor provides an approach for automatically recommending source-code snippets that show an example of how the user can properly reuse the retrieved components. JMentor mechanisms are based on ontology and semantic reasoning techniques. Its evaluation case studies show evidence that such techniques can improve software understanding and reuse practices.

关键词： Ontologies Software Semantics Object oriented modeling Software libraries Task analysis

来源：评论

学校读者我要写书评

暂无评论

Deep radiomics for brain tumor detection and classification from multi-sequence mri

arXiv

引用

arXiv 2019年

作者： Banerjee, Subhashis Mitra, Sushmita Masulli, Francesco Rovetta, Stefano Indian Statistical Institute Machine Intelligence Unit Kolkata700108 India University of Calcutta Department of Computer Science and Engineering Kolkata700106 India University of Genova Dept of Informatics Bioengineering Robotics and Systems Engineering Genoa16146 Italy

Glioma constitutes 80% of malignant primary brain tumors in adults, and is usually classified as High Grade Glioma (HGG) and Low Grade Glioma (LGG). The LGG tumors are less aggressive, with slower growth rate as compared to HGG, and are responsive to therapy. Tumor biopsy being challenging for brain tumor patients, noninvasive imaging techniques like Magnetic Resonance Imaging (MRI) have been extensively employed in diagnosing brain tumors. Therefore, development of automated systems for the detection and prediction of the grade of tumors based on MRI data becomes necessary for assisting doctors in the framework of augmented intelligence. In this paper, we thoroughly investigate the power of Deep Convolutional Neural Networks (ConvNets) for classification of brain tumors using multi-sequence MR images. We propose novel ConvNet models, which are trained from scratch, on MRI patches, slices, and multi-planar volumetric slices. The suitability of transfer learning for the task is next studied by applying two existing ConvNets models (VGGNet and ResNet) trained on ImageNet dataset, through fine-tuning of the last few layers. Leave-one-patient-out (LOPO) testing, and testing on the holdout dataset are used to evaluate the performance of the ConvNets. Results demonstrate that the proposed ConvNets achieve better accuracy in all cases where the model is trained on the multi-planar volumetric dataset. Unlike conventional models, it obtains a testing accuracy of 95% for the low/high grade glioma classification problem. A score of 97% is generated for classification of LGG with/without 1p/19q codeletion, without any additional effort towards extraction and selection of features. We study the properties of self-learned kernels/ filters in different layers, through visualization of the intermediate layer outputs. We also compare the results with that of state-of-the-art methods, demonstrating a maximum improvement of 7% on the grading performance of ConvNets and 9% on the predi

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Context agnostic trajectory prediction based on λ-Architecture

arXiv

引用

arXiv 2019年

作者： Psomakelis, Evangelos Tserpes, Konstantinos Zissis, Dimitris Anagnostopoulos, Dimosthenis Varvarigou, Theodora Dept. of Informatics and Telematics Harokopio University of Athens Omirou 9 Tavros Greece Dept. of Electrical and Computer Engineering National Technical University of Athens Iroon Polytecniou 9 Zografou Greece Dept. of Product & Systems Engineering University of the Aegean Ermoupolis Syros Greece

Predicting the next position of movable objects has been a problem for at least the last three decades, referred to as ‘trajectory prediction’. In our days, the vast amounts of data being continuously produced add the big data dimension to the trajectory prediction problem, which we are trying to tackle by creating a λ-Architecture based analytics platform. This platform performs both batch and stream analytics tasks and then combines them to perform analytical tasks that cannot be performed by analyzing any of these layers by itself. The biggest benefit of this platform is its context agnostic trait, which allows us to use it for any use case, as long as a time-stamped geo-location stream is provided. The experimental results presented prove that each part of the λ-Architecture performs well at certain targets, making a combination of these parts a necessity in order to improve the overall accuracy and performance of the platform. Copyright © 2019, The Authors. All rights reserved.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces 34

Algorithms for low-distortion embeddings into arbitrary 1-di...

引用

34th International Symposium on Computational Geometry, SoCG 2018

作者： Carpenter, Timothy Fomin, Fedor V. Lokshtanov, Daniel Saurabh, Saket Sidiropoulos, Anastasios Dept. of Computer Science and Engineering Ohio State University Columbus United States Department of Informatics University of Bergen Norway Institute of Mathematical Sciences Chennai India Computer Science Dept. University of Illinois Chicago United States

ISBN: (纸本)9783959770668

We study the problem of finding a minimum-distortion embedding of the shortest path metric of an unweighted graph into a "simpler" metric X. Computing such an embedding (exactly or approximately) is a non-trivial task even when X is the metric induced by a path, or, equival-ently, the real line. In this paper we give approximation and fixed-parameter tractable (FPT) algorithms for minimum-distortion embeddings into the metric of a subdivision of some fixed graph H, or, equivalently, into any fixed 1-dimensional simplicial complex. More precisely, we study the following problem: For given graphs G, H and integer c, is it possible to embed G with distortion c into a graph homeomorphic to H? Then embedding into the line is the special case H = K2, and embedding into the cycle is the case H = K3, where Kk denotes the complete graph on k vertices. For this problem we give • an approximation algorithm, which in time f(H)·poly(n), for some function f, either correctly decides that there is no embedding of G with distortion c into any graph homeomorphic to H, or finds an embedding with distortion poly(c);• an exact algorithm, which in time f'(H, c) · poly(n), for some function f', either correctly decides that there is no embedding of G with distortion c into any graph homeomorphic to H, or finds an embedding with distortion c. Prior to our work, poly(OPT)-approximation or FPT algorithms were known only for embedding into paths and trees of bounded degrees. © Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Anastasios Sidiropoulos;licensed under Creative Commons License CC-BY 34th Symposium on Computational Geometry (SoCG 2018).

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Learning Information Visualization Algorithms using Tulu

Learning Information Visualization Algorithms using Tulu

引用

Latin American Conference on Learning Objects and Technology (LACLO)

作者： Armando Arce-Orozco Antonio Gonzalez-Torres Erick Mata-Montero School of Computing Costa Rica Institute of Technology Cartago Costa Rica School of Informatics UNA Costa Rica Dept. of Computer Engineering Costa Rica Institute of Technology Cartago Costa Rica

Information visualization libraries are toolkits that frequently require users to have a deep understanding of their internal structure and design. Their features sometimes include a wide range of visualization methods from simple low-level drawings all the way to high-level sophisticated visualizations. This complexity is an obstacle for researchers, students, and developers who need to design and implement appealing visual representations that can be incorporated into their products efficiently and easily. This paper presents Tulu, a library that runs on top of Diököl, a programming environment created with Lua and OpenVG. Tulu is aimed to serve as an alternative for creating visualization systems. This library offers several advantages over traditional libraries including its extensibility, portability, and size. With respect to extensibility, it allows the adaptation and extension of the logic of the visualization techniques implemented in its catalog. Concerning portability, it runs on several operating systems. Finally, in regard to size, Diököl's space requirement is less than 1 MB, which makes it fitting for small single-board computers, such as the Raspberry Pi device, aimed at teaching basic computer science concepts.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Traits: An object oriented dynamic type system for reasoning with unstructured data in a type safe environment. 13

Traits: An object oriented dynamic type system for reasoning...

引用

13th RuleML+RR Doctoral Consortium and Rule Challenge, RuleML+RR DC and Challenge 2019

作者： Sottara, Davide Proctor, Mark Bragaglia, Stefano Hekmatnejad, Mohammad Biomedical Informatics Department Arizona State University 13212 East Shea Boulevard ScottsdaleAZ85259 United States Computer Science Department Arizona State University TempeAZ85281 United States Context Scout London United Kingdom Dept. of Electrical and Electronic Engineering Imperial College London London United Kingdom Red Hat WestfordMA United States

This paper describes "traits", an extension to a rule engine that provides a dynamic type system for working with in an object oriented code in a type safe environment. This extension is inspired by frame logic and "duck typing". The implementation is based on the use of dynamic proxies and form of runtime interface injection and requires the partial redefinition of the traditional working memory operations (assert, update, retract), but is otherwise transparently embedded in the engine. We evaluate a reference implementation built on top of the open source rule engine Drools, showing that the approach improves clarity without impacting performance. Copyright © 2019 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Credit-based algorithm for Virtual Machines Scheduling

Credit-based algorithm for Virtual Machines Scheduling

引用

IEEE International Symposium on Innovations in Intelligent Systems and Applications (INISTA)

作者： Andreas Pegkas Christos Alexakos Spiros Likothanassis Dept. Computer Engineering and Informatics University of Patras Patras Greece

ISBN: (纸本)9781538651513

Cloud computing involves a set of new technologies that permit the on-demand utilization of computational resources. This is extremely useful, especially when performing high demanding analysis tasks. The flexibility and scalability on providing computational resources has set cloud computing as an emerging technology for data analysis, where problems demand parallelization and are of high computational workload. In this article, a novel Credit-based algorithm targets at providing an efficient and simple (easy to implement) solution to computational resource management challenge by addressing the virtual machine scheduling problem of serving continuously submitted and different analysis tasks in private cloud infrastructure.

关键词： Cloud computing Processor scheduling Task analysis Scheduling Virtual machining informatics Memory management

来源：评论

学校读者我要写书评

暂无评论

Heuristic approach for jointly optimizing feicic and UAV locations in multi-tier LTE-advanced public safety HetNet

arXiv

引用

arXiv 2019年

作者： Kumbhar, Abhaykumar Binol, Hamidullah Singh, Simran Güvenç, Ismail Akkaya, Kemal Dept. Electrical and Computer Engineering Florida International University MiamiFL United States Center for Biomedical Informatics Wake Forest School of Medicine Winston-SalemNC United States Dept. Electrical and Computer Engineering North Carolina State University RaleighNC United States Motorola Solutions Inc. PlantationFL United States

Unmanned aerial vehicles (UAVs) enabled communications, and networking can enhance wireless connectivity and support emerging services. However, this would require system-level understanding to modify and extend the existing terrestrial network infrastructure. In this paper, we integrate UAVs both as user equipment and base stations into an existing LTE-Advanced heterogeneous network (HetNet) and provide system-level insights of this three-tier LTE-Advanced air-ground HetNet (AG-HetNet). This AG-HetNet leverages cell range expansion (CRE), intercell interference coordination (ICIC), 3D beamforming, and enhanced support for UAVs. Using this system-level understanding and through brute-force technique and heuristics algorithms, we evaluate the performance of AG-HetNet in terms of fifth percentile spectral efficiency (5pSE) and coverage probability. In particular, we compare system-wide 5pSE and coverage probability, when unmanned aerial base stations (UABS) are deployed on a fixed hexagonal grid and when their locations are optimized using a genetic algorithm (GA) and elitist harmony search algorithm based on the genetic algorithm (eHSGA);while jointly optimizing the ICIC and CRE network parameters for different ICIC techniques. Our simulation results show that the heuristic algorithms (GA and eHSGA) outperform the brute-force technique and achieve better peak values of coverage probability and 5pSE. Simulation results also show that a trade-off exists between peak values and computation time when using heuristic algorithms. Furthermore, the three-tier hierarchical structuring of reduced power subframes FeICIC defined in 3GPP Rel-11 provides considerably better 5pSE and coverage probability than the 3GPP Rel-10 with almost blank subframes eICIC. We also investigate the network performance for different practical deployment heights of UABS, and we find low-altitude UABSs (25 m) to perform sparsely better than medium-altitude UABSs (36 m and 50 m). Copyright © 2019, The

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：