A Prototype Implementation of NNEF Execution Framework with CUDA Acceleration

2021 ◽  
pp. 129-132
Author(s):  
Nakhoon Baek
Keyword(s):  
Prototype Implementation

scholarly journals Secure Remote Storage of Logs with Search Capabilities

2021 ◽  
Vol 1 (2) ◽  
pp. 340-364
Author(s):  
Rui Araújo ◽  
António Pinto
Keyword(s):  
Search Algorithm ◽  
Prototype Implementation ◽  
Standard Practice ◽  
Plain Text ◽  
Server Side ◽  
Remote Storage ◽  
Text Information ◽  
Nested Queries ◽  
And Storage ◽  
Common Situation

Along with the use of cloud-based services, infrastructure, and storage, the use of application logs in business critical applications is a standard practice. Application logs must be stored in an accessible manner in order to be used whenever needed. The debugging of these applications is a common situation where such access is required. Frequently, part of the information contained in logs records is sensitive. In this paper, we evaluate the possibility of storing critical logs in a remote storage while maintaining its confidentiality and server-side search capabilities. To the best of our knowledge, the designed search algorithm is the first to support full Boolean searches combined with field searching and nested queries. We demonstrate its feasibility and timely operation with a prototype implementation that never requires access, by the storage provider, to plain text information. Our solution was able to perform search and decryption operations at a rate of, approximately, 0.05 ms per line. A comparison with the related work allows us to demonstrate its feasibility and conclude that our solution is also the fastest one in indexing operations, the most frequent operations performed.

scholarly journals Design and Prototype Implementation of Software-Defined Radio Over Fiber

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Takumasa Ishioka ◽  
Kazuki Aiura ◽  
Ryota Shiina ◽  
Tatsuya Fukui ◽  
Tomohiro Taniguchi ◽  
...  
Keyword(s):  
Software Defined Radio ◽  
Radio Over Fiber ◽  
Prototype Implementation

Design of Remote Controller Using Code Matching and Frequency Hopping Technology

2010 ◽  
Vol 44-47 ◽  
pp. 1412-1416
Author(s):  
Geng Sheng Zheng ◽  
Cheng Liang Li
Keyword(s):  
Frequency Hopping ◽  
Work Process ◽  
Sleep State ◽  
Prototype Implementation ◽  
Design And Implementation ◽  
Emergency Condition ◽  
Channel Interference ◽  
External Conditions ◽  
System States ◽  
Remote Controller

This paper presents the design and implementation of a RF remote controller using code matching and frequency hopping technology. The proposed controller supports access to different random channels under disturbance environment. The work process of RF remote controller is composed of code matching, running state, handover state, and sleep state. Four system states can transform each other under corresponding external conditions. The suggested controller is more reliable than conventional ones especially during emergency condition such as noise and co-channel interference. The feasibility of the architecture has been demonstrated with a prototype implementation and presented in details.

A system of constructor classes: overloading and implicit higher-order polymorphism

1995 ◽  
Vol 5 (1) ◽  
pp. 1-35 ◽  
Author(s):  
Mark P. Jones
Keyword(s):  
Type System ◽  
Type Systems ◽  
Natural Generalization ◽  
Higher Order ◽  
Functional Language ◽  
Effective Algorithm ◽  
Prototype Implementation ◽  
Type Classes

AbstractThis paper describes a flexible type system that combines overloading and higher-order polymorphism in an implicitly typed language using a system of constructor classes—a natural generalization of type classes in Haskell. We present a range of examples to demonstrate the usefulness of such a system. In particular, we show how constructor classes can be used to support the use of monads in a functional language. The underlying type system permits higher-order polymorphism but retains many of the attractive features that have made Hindley/Milner type systems so popular. In particular, there is an effective algorithm that can be used to calculate principal types without the need for explicit type or kind annotations. A prototype implementation has been developed providing, amongst other things, the first concrete implementation of monad comprehensions known to us at the time of writing.

Sign in / Sign up

Export Citation Format

Share Document