scholarly journals Compiler from El programing language: improvement and development

2021 ◽  
pp. 9-19
Author(s):  
Nikita Zelenchuk ◽  
◽  
Ekaterina Pristavka ◽  
Aleksandr Maliavko ◽  
◽  
...  
Keyword(s):  
Data Structures ◽  
Current Version ◽  
Control Structures ◽  
Front End ◽  
Initial Stage ◽  
Level Data ◽  
Arbitrary Precision ◽  
High Level ◽  
And Control ◽  
Computational Processes

The implementation of the new multi-paradigm (functionally- imperative) programming language El, developed at the Department of Computer Science of the Novosibirsk State Technical University, in the form of a compiler is associated with the need to find ways to solve a number of complex problems. The current version of the compiler does implement only partially functionality of the language and generates far from optimal executable codes. In this paper, we consider the problem of an efficient compilation of an El-program, taking into account the need to implement new high-level data structures (two-sided lists, vectors with special forms of access, and a number of others) and control structures of the language, which make it possible to uniformly define cyclic and branching computational processes, as well as those laid down in the language a mechanism for explicitly controlling the mutability of variables. The tasks of improving and developing a compiler organized according to the classical multi-platform scheme are briefly considered, in which the front-end (lexical, syntactic, and semantic analyzers) converts the program to be translated into pseudocode of a single format, and used efficient infrastructure for building LLVM compilers as a back-end that turns pseudocode into executable code for different platforms. Execution of all possible operations on elements of high-level data structures (lists, tuples, vectors), as well as on arbitrary-precision numbers, has been moved to the runtime support library and, accordingly, can be deeply optimized. For this structure, the outlined ways of solving the problem of developing and improving the compiler by deep reforming and optimization of the chain of transformations of the translated program implemented by the front-end are formulated. At the initial stage, it is planned to implement a new compiler for two platforms: Linux and Windows.

Agent-Based Negotiation in E-Marketing

2005 ◽  
pp. 88-92
Author(s):  
V. K. Murthy ◽  
E. V. Krishnamurthy
Keyword(s):  
Data Structures ◽  
Agent Based ◽  
Object Based ◽  
Level Data ◽  
Rule System ◽  
High Level ◽  
Two Stages ◽  
Active Objects

This article describes in brief the design of agent-based negotiation system in e-marketing. Such a negotiation scheme requires the construction of a suitable set of rules, called protocol, among the participating agents. The construction of the protocol is carried out in two stages: first expressing a program into an object-based rule system and then converting the rule applications into a set of agent-based transactions on a database of active objects represented using high-level data structures.

scholarly journals FELIX: the new detector interface for the ATLAS experiment

2019 ◽  
Vol 214 ◽  
pp. 01023
Author(s):  
Nikolina Ilic ◽  
Jos Vermeulen ◽  
Serguei Kolos
Keyword(s):  
Control Systems ◽  
Serial Links ◽  
Specific Data ◽  
Atlas Experiment ◽  
Switched Network ◽  
Level Trigger ◽  
Front End ◽  
High Bandwidth ◽  
High Level ◽  
And Control

During the next major shutdown from 2019-2020, the ATLAS experiment at the LHC at CERN will adopt the Front-End Link eXchange (FELIX) system as the interface between the data acquisition, detector control and TTC (Timing, Trigger and Control) systems and new or updated trigger and detector front-end electronics. FELIX will function as a router between custom serial links from front end ASICs and FPGAs to data collection and processing components via a commodity switched network. Links may aggregate many slower links or be a single high bandwidth link. FELIX will also forward the LHC bunch-crossing clock, fixed latency trigger accepts and resets received from the TTC system to front-end electronics. The FELIX system uses commodity server technology in combination with FPGA-based PCIe I/O cards. The FELIX servers will run a software routing platform serving data to network clients. Commodity servers connected to FELIX systems via the same network will run the new Software Readout Driver (SW ROD) infrastructure for event fragment building and buffering, with support for detector or trigger specific data processing, and will serve the data upon request to the ATLAS High-Level Trigger for Event Building and Selection. This proceeding will cover the design and status of FELIX and the SW ROD.

Agent-Based Negotiation in E-Marketing

2011 ◽  
pp. 88-92
Author(s):  
V.K. Murthy ◽  
E.V. Krishnamurthy
Keyword(s):  
Data Structures ◽  
Agent Based ◽  
Object Based ◽  
Level Data ◽  
Rule System ◽  
High Level ◽  
Two Stages ◽  
Active Objects

This article describes in brief the design of agent-based negotiation system in e-marketing. Such a negotiation scheme requires the construction of a suitable set of rules, called protocol, among the participating agents. The construction of the protocol is carried out in two stages: first expressing a program into an object-based rule system and then converting the rule applications into a set of agent-based transactions on a database of active objects represented using high-level data structures.

High Level Data Structures for GPGPU Programming in a Statically Typed Language

2016 ◽  
Vol 45 (2) ◽  
pp. 242-261 ◽  
Author(s):  
Mathias Bourgoin ◽  
Emmanuel Chailloux ◽  
Jean-Luc Lamotte
Keyword(s):  
Data Structures ◽  
Level Data ◽  
High Level

scholarly journals Tool for SPARQL Querying over Compact RDF Representations

2021 ◽  
Vol 7 (1) ◽  
pp. 33
Author(s):  
Delfina Ramos-Vidal ◽  
Guillermo de Bernardo
Keyword(s):  
Data Storage ◽  
Data Structures ◽  
Low Level ◽  
Level Data ◽  
Query Engine ◽  
Compact Data Structures ◽  
High Level

We present an architecture for the efficient storing and querying of large RDF datasets. Our approach seeks to store RDF datasets in very little space while offering complete SPARQL functionality. To achieve this, our proposal was built over HDT, an RDF serialization framework, and its interaction with the Jena query engine. We propose a set of modifications to this framework in order to incorporate a range of space-efficient compact data structures for data storage and access, while using high-level capabilities to answer more complicated SPARQL queries. As a result, our approach provides a standard mechanism for using low-level data structures in complicated query situations requiring SPARQL searches, which are typically not supported by current solutions.

scholarly journals DEVELOPMENT OF AUTOMATED VISION TECHNIQUES FOR IMMEDIATE ANALYSIS AND CONTROL OF BETALAIN-PRODUCING CELL CULTURES

HortScience ◽  
1992 ◽  
Vol 27 (6) ◽  
pp. 572c-572
Author(s):  
M.A.L. Smith ◽  
I. Dustin ◽  
R. Leathers ◽  
J-P. Zrÿd
Keyword(s):  
Production Systems ◽  
Growth Cycle ◽  
Cell Counts ◽  
Level Data ◽  
Immediate Analysis ◽  
High Level ◽  
And Control ◽  
Color Filters ◽  
Betalain Pigment ◽  
Fine Tune

Natural plant pigments (produced as secondary metabolites in cell culture) can replace controversial synthetic chemical colorants to enhance the appearance of processed foods. Intensive bioreactor-based production systems designed for betalain pigment-producing cultures of Beta vulgaris are still not economically competitive, in part due to the slow, prohibitively expensive, and incomplete conventional methods (HPLC analysis, biomass estimates, cell counts) which must be used to assess culture status. As an alternative, software was written using Semper 6 (a high level programming language for image analysis) for collection of exacting morphometric (spatial) and photometric (spectral) process information from an intense violet cell line. Uniform, crisp images of 1 ml culture samples in multiwell plates were captured macroscopically, and the pattern of pigment production was traced at 3 day intervals over the course of a 15 day growth cycle with monochromatic color filters and image grey level data. Rod-shaped cells and aggregates were automatically sorted and measured using parameters of particle size, density, and circularity. The machine vision method offers greater opportunity to fine-tune cell selection for enhanced pigment content.

High-level data structures

2012 ◽  
Vol 55 (12) ◽  
pp. 90-90 ◽  
Author(s):  
Yannis Smaragdakis
Keyword(s):  
Data Structures ◽  
Level Data ◽  
High Level
Sign in / Sign up

Export Citation Format

Share Document