Prototype implementation
Kourie, Gaby · Zenodo (CERN European Organization for Nuclear Research) · 2024
Cited by 0Open access
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “prototype implementation”
Kourie, Gaby · Zenodo (CERN European Organization for Nuclear Research) · 2024
Cited by 0Open access
Kevin Fuchs, Peter A. Henning · River Publishers eBooks · 2022
In Section 3.4 we defined the software architecture for a real implementation of the INTUOTEL system. This architecture is just a recommendation given by the INTUITEL consortium. However, as long as you follow the data model and the communication standards given in Section 3.5, you may design an architecture of your own.
Cited by 0Open access
Zhenlong Li, Chaowei Yang, Baoxuan Jin et al. · Figshare · 2015
Cited by 0Open access
2009
Cited by 2
2009
Cited by 1
Apostle And Its · 2007
High-level, simulation-oriented languages can fully insulate the user from the low-level complexities of Parallel Discrete Event Simulation (PDES), a task that is almost impossible when a parallel simulator is based on providing library support for an existing programming language. High-level, simulation-oriented languages also enable optimizations to be performed that are difficult and cumbersome at the lower-level of traditional parallel simulators; a good example of this is granularity control. This paper describes a prototype implementation of APOSTLE -- a new high-level, simulation-oriented language for PDES. The overall goal of APOSTLE is to provide an environment suitable for the construction, maintenance and fast execution of large and complex simulations. The prototype APOSTLE implementation consists of a compiler generating C++ code that hooks into a runtime system built on top of an existing optimistic parallel simulator. Performance figures for a simple APOST...
Cited by 0
Duarte Carona, António Serrador, Perez Fortes Maria Del Mar et al. · 2010
This paper presents an IEEE 802.11p full-stack prototype implementation to data exchange among vehicles and between vehicles and the roadway infrastructures. The prototype architecture is based on FPGAs for Intermediate Frequency (IF) and base band purposes, using 802.11a based transceivers for RF interfaces. Power amplifiers were also addressed, by using commercial and in-house solutions. This implementation aims to provide technical solutions for Intelligent Transportation Systems (ITS) field, namely for tolling and traffic management related services, in order to promote safety, mobility and driving comfort through the dynamic and real-time cooperation among vehicles and/or between vehicles and infrastructures. The performance of the proposed scheme is tested under realistic urban and suburban driving conditions. Preliminary results are promising, since they comply with most of the 802.11p standard requirements.
Cited by 21
Lu Hou, Lingyi Han, Kan Zheng · SpringerBriefs in computer science · 2024
Cited by 0
Archival Intermemory, Peter Yianilos · 2008
Cited by 0
Realtime Intrusion-forensics, Udo Payer · 2008
The function of a Network Intrusion Detection System (NIDS) is to identify any misuse and abnormal behavior determined as an attack to a network segment or network host. The proposed concept is a pump-in-the-stack approach. This means, that NIDS-features are integrated into the network stack of our operating systems. Using the native stack is important, since this is the only place in our operating systems where we can get access to all packets (passing the stack) in realtime quality. The idea is to make use of already existing knowledge about state transitions, memory content, header information, and packet payload. This is very similar to stack hardening. But while hardening mechanisms are limited to block malicious traffic (violating RFC793), the proposed approach is to collect as much evidence as possible and to do some simple forensic analysis. Knowing that IPv4 is not suitable to collect information about the actual source of an attack, but there is no real difference to traditional IPv4 based forensic analyses. In addition to simple stack hardening mechanisms, the advantage of the proposed approach is to start forensic analysis long time before the host is going to become a “pathologic case”. Maybe that collecting forensic evidence and the preservation of collected information is inappropriate in the case of intrusion detection systems (IDS). But IDSs are the most likely candidates (at least in the absence of alternatives) to collect forensically pristine evidentiary data, if real- or nearly realtime behaviour is required [1]. To verify this statement, two prototypes were built (representing the two most popular categories of operating systems) and stack-based intrusion detection mechanisms have been integrated into the network stack. 1
Cited by 0
Ivar Bergman, Per-ola Gustafsson, Ivar Bergman et al. · 2014
Cited by 0
Christoffer Quist Adamsen, Anders Møller, Saba Alimadadi et al. · Artifact Digital Object Group · 2018
Cited by 0
Ion Stoica · Lecture notes in computer science · 2004
Cited by 0
2001
NOTE: This document is considered a DRAFT version and may not be correct in all aspects regarding the current NIST DASE Prototype Implementation. This document is for informational purposes only and may not be redistributed. The final, up-todate version of this document will have a version number of 1.0 or higher. 1. INTRODUCTION.................................................................................................................. 1 2. DEFINITION OF TERMS...................................................................................................... 1
Cited by 0
Heidari Jozam, M Mohammadali, Allameh, E Erfaneh, Vries, de, B Bauke et al. · TU/e Research Portal (Eindhoven University of Technology) · 2014
Cited by 0
E. Magory, V.L. Bratman, A. Steiner et al. · Nuclear Instruments and Methods in Physics Research Section A Accelerators Spectrometers Detectors and Associated Equipment · 2026
Cited by 0
Eyal Magory, V. L. Bratman, Alexander Steiner et al. · ArXiv.org · 2025
We report the implementation of two types of helical microundulators with a 6 mm period, built from axially magnetized helices fabricated from a single piece of rare-earth magnet. The first device, composed of two oppositely magnetized longitudinal helices, produces a transverse on-axis field exceeding 0.93 T. The second, a hybrid design with two oppositely longitudinally pre-magnetized rare-earth helices alternating with two unmagnetized steel helices, reaches about 1.5 T on axis. Both devices have a 1 mm bore, which required dedicated field-measurement techniques. When used in compact FELs from terahertz to X-ray, such microundulators can provide higher electron oscillation amplitude and radiated power than planar microundulators of similar period. As an illustrative case, we present an ultra-compact SASE XFEL concept in which the studied hybrid helical microundulator can provide approximately 48 GW of radiation power at a wavelength of about 5 angstrom.
Cited by 0Open access
M. Heidari Jozam, E. Allameh, Bauke de Vries et al. · Automation in Construction · 2013
Cited by 51
Harnie, Dries · Zenodo (CERN European Organization for Nuclear Research) · 2015
This release is the one that has been used to perform the benchmarks in my dissertation, after the private defense.
Cited by 0Open access
Yi Sun, Dr. Yun Peng, Advisor Cmsc et al. · 2009
This project aims to build a prototype software system for BayesOWL, a probabilistic framework proposed for dealing with uncertainty in Semantic Web (SW) ontologies. It translates a terminological taxonomy of an OWL ontology into a Bayesian Network (BN), integrates probabilistic information about the concept classes and interclass relations into the translated BN, and supports important ontological reasoning tasks as probabilistic reasoning in BN. The implementation of the BayesOWL framework extends the original framework in two ways. One is encoding probabilistic information in OWL format. The new convention can encode any discrete probabilities in a general form with one or more prior variables and zero or more conditional variables. The other extension is with the input ontologies. In the original BayesOWL framework, only simple ontologies which themselves are terminological taxonomies can be handled. But in this implementation, general OWL ontologies (OWL DL) are supported by taking advantage of existing OWL reasoning tools. These two developments together represent a significant advancement over the original framework. The prototype system BayesOWL 1.0 extracts the taxonomy of the named classes from the given OWL ontology and maps this terminological taxonomy into a BN following a set of structural translation rules; it extracts probabilistic uncertainty information from the probability file and incorporates it into the translated BNs using a set of algorithms based on the iterative proportional fitting procedure (IPFP). Finally a resulting BN will be generated as the output. This prototype system for BayesOWL can be used as a practical tool for ontology engineering tasks such as domain modeling, ontology reasoning and ontology concept mapping. 1 CMSC698 A Prototype Implementation of BayesOWL Yi Sun 1
Cited by 0