A hybrid scheme for processing data structures in a dataflow environment

1992 ◽  
Vol 3 (1) ◽  
pp. 83-96 ◽  
Author(s):  
B. Lee ◽  
A.R. Hurson ◽  
B. Shirazi
Keyword(s):  
Data Structures ◽  
Hybrid Scheme ◽  
Processing Data

scholarly journals A carbuncle cure for the Harten-Lax-van Leer contact (HLLC) scheme using a novel velocity-based sensor

2021 ◽  
Author(s):  
U. S. Vevek ◽  
B. Zang ◽  
T. H. New
Keyword(s):  
Data Structures ◽  
Numerical Experiments ◽  
Additional Data ◽  
Shear Layers ◽  
Hybrid Scheme ◽  
Local Pressure ◽  
Numerical Flux ◽  
Shear Sensor ◽  
Non Local

AbstractA hybrid numerical flux scheme is proposed by adapting the carbuncle-free modified Harten-Lax-van Leer contact (HLLCM) scheme to smoothly revert to the Harten-Lax-van Leer contact (HLLC) scheme in regions of shear. This hybrid scheme, referred to as the HLLCT scheme, employs a novel, velocity-based shear sensor. In contrast to the non-local pressure-based shock sensors often used in carbuncle cures, the proposed shear sensor can be computed in a localized manner meaning that the HLLCT scheme can be easily introduced into existing codes without having to implement additional data structures. Through numerical experiments, it is shown that the HLLCT scheme is able to resolve shear layers accurately without succumbing to the shock instability.

scholarly journals Hash Tables for a Digital Lexicon

2021 ◽  
Vol 28 (2) ◽  
pp. 25-38
Author(s):  
Fábio Carlos Moreno ◽  
Cinthyan Sachs C. de Barbosa ◽  
Edio Roberto Manfio
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Language Processing ◽  
Data Structures ◽  
Response Speed ◽  
Hash Tables ◽  
Processing Data ◽  
Natural Language Interface ◽  
Performance Results ◽  
And Storage

This paper deals with the construction of digital lexicons within the scope of Natural Language Processing. Data Structures called Hash Tables have demonstrated to generate good results for Natural Language Interface for Databases and have data dispersion, response speed and programming simplicity as main features. The storage of the desired information is done by associating a key through the hashing functions that is responsible for distributing the information in this table. The objective of this paper is to present the tool called Visual TaHs that uses a sparse table to a real lexicon (Lexicon of Herbs), improving performance results of several implemented hash functions. Such structure has achieved satisfactory results in terms of speed and storage when compared to conventional databases and can work in various media, such as desktop, Web and mobile.

COSTING NESTED ARRAY CODES

2002 ◽  
Vol 12 (02) ◽  
pp. 249-266 ◽  
Author(s):  
ROMAN LECHTCHINSKY ◽  
MANUEL M. T. CHAKRAVARTY ◽  
GABRIELE KELLER
Keyword(s):  
Data Structures ◽  
Cost Model ◽  
General Concept ◽  
First Order ◽  
Array Codes ◽  
Work Complexity ◽  
Processing Data ◽  
Asymptotic Complexity ◽  
Functional Setting ◽  
Nested Arrays

We discuss a language-based cost model for array programs built on the notions of work complexity and parallel depth. The programs operate over data structures comprising nested arrays and recursive product-sum types. In a purely functional setting, such programs can be implemented by way of the flattening transformation that converts codes over nested arrays into vectorised code over flat arrays. Flat arrays lend themselves to a particularly efficient implementation on standard hardware, but the overall efficiency of the approach depends on the flattening transformation preserving the asymptotic complexity of the nested array codes. Blelloch has characterised a class of first-order array programs, called contained programs, for which flattening preserves the asymptotic depth complexity. However, his result is restricted to programs processing only arrays and tuples. In the present paper, we extend Blelloch's result to array programs processing data structures containing arrays as well as arbitrary recursive product-sum types. Moreover, we replace the notion of containment by the more general concept of fold programs.

Specification scheme for the visualisation of data structures

1994 ◽  
Vol 9 (3) ◽  
pp. 127
Author(s):  
X.-B. Lu ◽  
F. Stetter
Keyword(s):  
Data Structures

Processing of Histopathological Data

1971 ◽  
Vol 10 (03) ◽  
pp. 142-147
Author(s):  
M. RENAUD ◽  
M. AQARQ ◽  
R. GERARD-MARCHANT ◽  
M. WOLFF-TERROINE
Keyword(s):  
Integrated System ◽  
Ease Of Use ◽  
Financial Data ◽  
Identification Number ◽  
Processing Data ◽  
Cancer Hospital

A method is presented for processing data from the histopathological laboratory of a cancer hospital. Emphasis is laid on the ease of use, the connection of medical, administrative and financial data, and the strictness of control of patient’s identification number. The system can be used separately; it is also a module for a large integrated system covering all the activities of the hospital.

Natural Language and a Computer System in Medical Research*)

1979 ◽  
Vol 18 (01) ◽  
pp. 15-17 ◽  
Author(s):  
Ileana C. Johnson ◽  
S. L. Tsao ◽  
I. D. J. Bross ◽  
D. P. Shedd
Keyword(s):  
Head And Neck Cancer ◽  
Natural Language ◽  
Roswell Park Memorial Institute ◽  
Basic Form ◽  
Specialized Knowledge ◽  
Complete Control ◽  
Processing Data ◽  
Remote Terminal ◽  
Initial Stage ◽  
Cancer Project

A series of computer programs are now available for processing data whose basic form is narrative (natural language), numerical or a combination of the two. This system was developed in the Department of Biostatistics of Roswell Park Memorial Institute, to enable an investigator to have complete control of the data — from the initial stage of entering the data to the final stage of analysis. Specialized knowledge of computers is not necessary in order to implement the different procedures. By following the instructions specified in various manuals and by basically just pushing a button of a remote terminal the procedures are activated and executed. This system is actually used for maintaining the data of a head and neck cancer project.

Power Query: The formation of professional competencies of a business analyst

2020 ◽  
pp. 30-40
Author(s):  
D. M. Nazarov ◽  
A. D. Nazarov
Keyword(s):  
Professional Standards ◽  
Professional Competencies ◽  
Federal State ◽  
Key Technology ◽  
Educational Standard ◽  
Training Methodology ◽  
Processing Data ◽  
Business Analyst ◽  
Business Informatics ◽  
State Educational

The article is a description of the Power Query technology training methodology implemented within the framework of the Federal State Educational Standard for Higher Education 3++ taking into account professional standards in the direction of the bachelor’s program “Business Informatics”. The authors propose a set of laboratory works in the form of situational tasks and cases that allow to create professional competencies and labor functions of a future specialist (business analyst) as part of the development of the ETL process for processing data using Power Query technology. The use of situational tasks and cases allows to effectively implement the development of a set of professional competencies, which are elements of generalized labor functions, without tying the material in question specifically to any discipline. As part of the implementation of situational tasks and cases described in the article, bachelors not only learn to use the basic elements of Power Query technology, but also gain the skills and abilities associated with the application of the studied technology in performing standard professional tasks stipulated by a professional standard. The format for describing the methodology is presented in the form of the traditional “Key-by-Key” technology, widely used in obtaining professional IT competencies.

Sign in / Sign up

Export Citation Format

Share Document