Wyniki wyszukiwania - Biblioteka Nauki

1

From EBNF to PEG

100%

Redziejowski R. R.

Fundamenta Informaticae

|

2013

|

tom Vol. 128, nr 1-2

177--191

EN

Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. The parser has many useful properties, and with the use of memoization, it works in a linear time. In its appearance, PEG is almost identical to a grammar in Extended Backus-Naur Form (EBNF), but usually defines a different language. However, in some cases only minor typographical changes are sufficient to convert an EBNF grammar into its PEG parser. As recently shown by Medeiros, this is, in particular, true for LL(1) grammars. But this is also true for many non-LL(1) grammars, which is interesting because the backtracking of PEG is often a convenient way to circumvent just the LL(1) restriction. We formulate a number of conditions for EBNF grammar to become its own PEG parser, and arrive at a condition that we call LL(1p), meaning that a top-down parser can choose its next action by looking at the input within the reach of one parsing procedure (rather than by looking at the next letter). An extension to LL(kp) for k > 1 seems possible.

2

Models of quantum computation and quantum programming languages

100%

Miszczak J.

|

2011

|

tom Vol. 59, nr 3

305-324

EN

The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counterparts. We also provide an introduction to quantum programming languages, which are developed using the QRAM model. We review the syntax of several existing quantum programming languages and discuss their features and limitations.

3

Zastosowanie narzędzi informatycznych stosowanych w tworzeniu stron internetowych do obliczeń symulacyjnych

100%

Macek-Kamińska K. , Kamiński M.

Prace Instytutu Elektrotechniki

|

2016

|

tom Z. 273

117--123

PL

Celem artykułu jest wskazanie możliwości zastosowania intensywnie ostatnio rozwijanych narzędzi informatycznych, zasadniczo przeznaczonych do tworzenia stron internetowych, do obliczeń numerycznych. Głównym obiektem zainteresowania autorów będzie język JavaScript, który w połączeniu z możliwościami języków HTML5 oraz CSS da programistom zestaw wydajnych narzędzi, które wykorzystać będzie można zarówno na etapie obliczeń numerycznych jak i późniejszej prezentacji wyników w formie gotowej strony internetowej.

EN

The aim of the paper is to indicate the possibility of the application of recently intensively developed tools (generally intended to create websites) to numerical calculations. The main object of the authors' interest is the language JavaScript which combined with the capabilities of HTML5 and CSS languages can give developers a set of powerful tools that may be taken both at the stage of numerical calculations and subsequent presentation of results in the form of ready-made website.

4

Mapping SBQL Query Results to XML

100%

Kowalski T. , Adamus R. , Wiślicki J.

Image Processing & Communications

|

2012

|

tom Vol. 17, no. 4

347--358

EN

The following paper presents a solution resolving inconsistencies in processing XML data-structures with SBQL objectoriented query and programming language. SBQL is based on Stack-Based Architecture (SBA) a formal approach reconstructing query languages’ concepts from the point of view of programming languages (Pls). The basic data store model AS0 defined in SBA can describe complex hierarchical data structures implied by XML. Nevertheless, in the classical approach to processing XML some use-case scenarios cannot be solved in satisfactory manner. In such cases SBQL queries return results either typologically obscure from the point of view of SBA or invalid from the point of view of expected XML tags formatting. The paper illustrates this problem on comprehensive examples, presents its cause and the solution.

5

Application of the computer tools used in the creation of websites for numerical calculation

100%

Kamińska-Macek K. , Kamiński M.

Elektronika : konstrukcje, technologie, zastosowania

|

2015

|

tom Vol. 56, nr 12

24-27

EN

The aim of the paper is to indicate the opportunity of applying intense recently developed tools, which are generally designed to create websites, for numerical calculations. The main object of interest of authors will be the JavaScript programming language, which, combined with the capabilities of HTML5 and CSS languages gives developers a set of powerful tools that may be taken both at the stage of numerical calculations and subsequent presentation of results in the form of ready-made website.

PL

Celem artykułu będzie wskazanie możliwości zastosowania intensywnie rozwijanych narzędzi informatycznych, zasadniczo przeznaczonych do tworzenia stron internetowych, do obliczeń numerycznych. Głównym obiektem zainteresowania autorów będzie język JavaScript, który w połączeniu z możliwościami języków HTML5 oraz CSS da programistom zestaw wydajnych narzędzi, które wykorzystać będzie można zarówno na etapie obliczeń numerycznych jak i późniejszej prezentacji wyników w formie gotowej strony internetowej.

6

A Secure Non-monotonic Soft Concurrent Constraint Language

88%

Bistarelli S. , Santini F.

Fundamenta Informaticae

|

2014

|

tom Vol. 134, nr 3/4

261--285

EN

We present a fine-grained security model to enforce the access control on the shared constraint store in Concurrent Constraint Programming (CCP) languages. We show the model for a non-monotonic version of Soft CCP (SCCP), that is an extension of CCP where the constraints have a preference level associated with them. Crisp constraints can be modeled in the same framework as well. In the considered non-monotonic soft version (NmSCCP), it is also possible to remove constraints from the store. The language can be used for coordinating agents on a common store of information that represents the set of shared resources. In such scenarios, it is clearly important to enforce the integrity and confidentiality rights on the resources, in order, for instance, to hide part of the information to some agents, or to prevent an agent to consume too many resources. Finally, we present a bisimulation relation to check equivalence between two programs written in this language.

7

An Abstract Interpretation Framework for Type and Effect Systems

88%

Galletta L.

Fundamenta Informaticae

|

2014

|

tom Vol. 134, nr 3/4

355--393

EN

Type and effect systems significantly extend type systems and allow one to express general semantic properties and to statically reason about programs execution. They have been widely exploited to specify static analyses, for example to track computational side effects, resource usage and communication in concurrent languages. In this paper we adopt abstract interpretation techniques to express type and effect systems as abstract semantics. We extend the Cousot’s methodology by introducing an abstract domain which (i) is able to express types with annotations, (ii) is reusable in different analyses with few modifications and (iii) is easily implementable. To test our approach we reconstruct two analyses for which the type and effect systems approach were successful.

8

More About Converting BNF to PEG

88%

Redziejowski R. R.

Fundamenta Informaticae

|

2014

|

tom Vol. 133, nr 2/3

257--270

EN

Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. The parser has many useful properties. Converting PEG to an executable parser is a rather straightforward task. Unfortunately, PEG is not well understood as a language definition tool. It is thus of a practical interest to construct PEGs for languages specified in some familiar way, such as Backus-Naur Form (BNF). The problem was attacked by Medeiros in an elegant way by noticing that both PEG and BNF can be formally defined in a very similar way. Some of his results were extended in a previous paper by this author. We continue here with further extensions.

9

Towards an Object-Oriented Programming Language for Physarum Polycephalum Computing : A Petri Net Model Approach

88%

Schumann A. , Pancerz K.

Fundamenta Informaticae

|

2014

|

tom Vol. 133, nr 2/3

271--285

EN

Our research is focused on creation of a new object-oriented programming language for Physarum polycephalum computing. Physarum polycephalum is a one-cell organism that can be used for developing a biological architecture of different abstract devices, among others, the digital ones. In the paper, we use an abstract graphical language in the form of Petri nets to describe the Physarum polycephalum behavior. Petri nets are a good formalism to assist designers and support hardware design tools, especially in developing concurrent systems. At the beginning stage considered in this paper, we show how to build Petri net models, and next implement them as Physarum polycephalum machines, of basic logic gates AND, OR, NOT, and simple combinational circuits on the example of the 1-to-2 demultiplexer.

10

Reference Abstract Domains and Applications to String Analysis

88%

Amadini R. , Gange G. , Gauthier F. , Jordan A. , Schachte P. , Søndergaard H. , Stuckey P. J. , Zhang C.

|

2018

|

tom Vol. 158, nr 4

297--326

EN

Abstract interpretation is a well established theory that supports reasoning about the run-time behaviour of programs. It achieves tractable reasoning by considering abstractions of run-time states, rather than the states themselves. The chosen set of abstractions is referred to as the abstract domain. We develop a novel framework for combining (a possibly large number of) abstract domains. It achieves the effect of the so-called reduced product without requiring a quadratic number of functions to translate information among abstract domains. A central notion is a reference domain, a medium for information exchange. Our approach suggests a novel and simpler way to manage the integration of large numbers of abstract domains. We instantiate our framework in the context of string analysis. Browser-embedded dynamic programming languages such as JavaScript and PHP encourage the use of strings as a universal data type for both code and data values. The ensuing vulnerabilities have made string analysis a focus of much recent research. String analysis tends to combine many elementary string abstract domains, each designed to capture a specific aspect of strings. For this instance the set of regular languages, while too expensive to use directly for analysis, provides an attractive reference domain, enabling the efficient simulation of reduced products of multiple string abstract domains.

11

DNA Tiles, Wang Tiles and Combinators

88%

Bellia M. , Occhiuto M. E.

Fundamenta Informaticae

|

2014

|

tom Vol. 133, nr 2/3

105--121

EN

We investigate the relation between Combinatory Logic and Wang Tiles with the aim of studying Combinators as a programming language for Self-Assembly and DNA computing. We introduce a subset of Combinatory Logic, SKI#, which is Turing Complete, includes simply Typed Combinatory Logic and contains only combinators whose computations require finitely many different redexes. Then, we define a language of Tiles, SKI-Tile, for the representation and the computation of the terms of SKI# in Self-Assembly. Moreover, we introduce a program development methodology that given any computable function, expressed in SKI#, provides a finite set of Tiles that self-assemble to return the computations of the function applications. Finally, the methodology is applied to the derivation of a SKI-Tile program that self-assemble to compute the factorial function.

12

Narzędzia budowy systemu z temporalną bazą wiedzy wspomagającego twórczość organizacyjną

88%

Mach-Król M.

Informatyka Ekonomiczna

|

2014

|

nr 2(32)

179-187

EN

In the paper the tools for developing an intelligent system with temporal knowledge base, supporting organizational creativity, are discussed and analyzed. The main aim of the paper is a critical presentation of possible tools in the context of creativity that is present in organizations. The temporal aspect of organizational creativity is outlined, next the motivation for a temporal system development is presented, and tools are discussed. The possibilities that are given by a tool-under-construction named Logos are also presented.

13

A Nonarchimedian Discretization for Timed Languages

88%

Dima C.

Fundamenta Informaticae

|

2014

|

tom Vol. 131, nr 3-4

389--407

EN

We give a discretization of behaviors of timed automata, in which timed languages are represented as sets of words containing action symbols, a clock tick symbol 1, and two delay symbols δ− (negative delay) and δ+ (positive delay). Unlike the region construction, our discretization commutes with intersection. We show that discretizations of timed automata are, in general, context-sensitive languages over Σ ∪ {1, δ+, δ−}, and give a class of counter automata that accepts exactly the class of languages that are discretizations of timed automata, and show that its emptiness problem is decidable.

14

Adding parallelism to sequential programs : a combined method

88%

Daszczuk W. B. , Czejdo D. B. , Grześkowiak W.

International Journal of Electronics and Telecommunications

|

2024

|

tom Vol. 70, No. 1

135--144

EN

The article outlines a contemporary method for creating software for multi-processor computers. It describes the identification of parallelizable sequential code structures. Three structures were found and then carefully examined. The algorithms used to determine whether or not certain parts of code may be parallelized result from static analysis. The techniques demonstrate how, if possible, existing sequential structures might be transformed into parallel-running programs. A dynamic evaluation is also a part of our process, and it can be used to assess the efficiency of the parallel programs that are developed. As a tool for sequential programs, the algorithms have been implemented in C#. All proposed methods were discussed using a common benchmark.

15

On the Accuracy of Rough Approximations of Regular Languages

88%

Torres G. M.

Fundamenta Informaticae

|

2014

|

tom Vol. 132, nr 4

533--545

EN

In this paper we attempt to measure the accuracy of approximations of regular languages by languages in +−varieties (as defined by Eilenberg). These approximations are upper approximations in the sense of Pawlak’s rough set theory with respect to congruences belonging to the variety of congruences corresponding to the given +−variety. In our approach, the accuracy of an approximation is measured by the relative density of the object language in the approximation language and the asymptotic behavior of this quotient. In particular, we apply our measures of accuracy to k-definite, reverse k-definite, i, j-definite and k-testable approximations.

16

A Hierarchy of Languages with Catenation and Shuffle

88%

Kudlek M. , Flick N. E.

Fundamenta Informaticae

|

2013

|

tom Vol. 128, nr 1-2

113--128

EN

We present basic structures, definitions, normal forms, and a hierarchy of languages based on catenation, shuffle and their iterations, defined by algebraic closures or least fixed point solutions to systems of equations.

17

About Implementation of IEC 61131-3 IL Function Blocks in Standard Microcontrollers

75%

Chmiel M. , Mocha J. , Hrynkiewicz E. , Polok D.

International Journal of Electronics and Telecommunications

|

2014

|

tom Vol. 60, No. 1

42-46

EN

The paper presents considerations on implementation of function blocks of the IL language, as fragments of control programs that use these blocks. Subsequently, the predefined function blocks of the IL language have been applied to implementation in a Central Processing Unit for a programmable controller based on standard microcontroller from such families as MCS-51, AVR and ARM with the Cortex-M3 core. The considerations refer to the IL language revision that is fully compliant with the IEC-61131-3 standards. The completed theoretical analysis demonstrated that the adopted method of the module description is really reasonable and offers substantial advantages as compared to direct calls of function modules already developed as subroutines. Also the executed experiments have proved the feasibility to arrange central units of programmable controllers on the basis of standard microcontrollers and such central units may be competitive to compact CPUs available on the market for typical PLCs.

18

On the π-calculus and Co-intuitionistic Logic : Notes on Logic for Concurrency and λP Systems

75%

Bellin G. , Menti A.

Fundamenta Informaticae

|

2014

|

tom Vol. 130, nr 1

21--65

EN

We reconsider work by Bellin and Scott in the 1990s on R. Milner and S. Abramsky’s encoding of linear logic in the π-calculus and give an account of efforts to establish a tight connection between the structure of proofs and of the cut elimination process in multiplicative linear logic, on one hand, and the input-output behaviour of the processes that represent them, on the other, resulting in a proof-theoretic account of (a variant of) Chu’s construction. But Milner’s encoding of the linear lambda calculus suggests consideration of multiplicative co-intuitionistic linear logic: we provide a term assignment for it, a calculus of coroutines which presents features of concurrent and distributed computing. Finally, as a test case of its adequacy as a logic for distributed computation, we represent our term assignment as a λP system. We argue that translations of typed functional languages in concurrent and distributed systems (such as π-calculi or λP systems) are best typed with co-intuitionistic logic, where some features of computations match the logical properties in a natural way.

19

Porównanie implementacji programowych automatów sterujących w sterownikach wbudowanych

75%

Grodzki L.

Pomiary Automatyka Kontrola

|

2007

|

tom R. 53, nr 10

33-36

PL

Programowanie sterowników wbudowanych polega na wykorzystaniu standardowych języków i narzędzi programowania. Zadanie sterowania sekwencyjnego realizowanego przez sterownik może być w różny sposób zaimplementowane w wybranym środowisku programowania. W zależności od tego uzyskuje się programy różniące się między sobą szybkością pracy i zapotrzebowaniem na pamięć operacyjną. Parametry te stają się istotne przy doborze optymalnej konstrukcji systemu mikroprocesorowego sterownika. Praca zawiera porównanie efektywności różnych wariantów oprogramowania tego samego zadania sterowania.

EN

Programming of embedded microcontrollers is based on usage of the standard programming languages and tools: from machine-level symbolic instructions to high-level languages - mainly C. One of the typical control task, which is usually implemented in microcontroller software, is logic sequential control. Programme implementation of that task depends on: used programming language and its possible syntax. Sometimes we can also use dedicated aiding system, which generates software implementation of the control task from its formal description to insert it into controller software. Usage of different programming languages and techniques causes that control software can work slower or faster and needs less or more operating memory. The time and memory complexity of the control software decide about the controller hardware and are important, when this hardware should be optimal. The article contains the comparison of time and memory efficiency of the exemplary control task according to usage of different programming languages, techniques and even programming tools. Conclusions pointed in the paper can be useful for microcontroller designer and programmer.

20

Clinical database – neonatology

75%

Sarapata K. , Woźniak J. , Walecki P. , Kieczeń W. , Lauterbach R.

Bio-Algorithms and Med-Systems

|

2006

|

tom Vol. 2, no. 4

57--64

EN

This paper presents some aspects of the informatics implementation of the Neonatology Database, which was created in the Department of Bioinformatics and Telemedicine Collegium Medicum Jagiellonian Univ. in association with The Neonatology Clinic. The significance of this database for interdisciplinary collaboration is presented. The database is mainly utilized to gather hospital data in form of accessing and processing. The main assumptions of implementation are: universal code to use it by other clinics' databases, a centralized location of the database server and minimize client computer required. Programming languages (PHP), system server (Linux) and projects (Apache, MySQL, openSSL) are on GNU GPL license.

PL

Praca opisuje wybrane aspekty implementacji bazy danych 'Neonatologia', która była zrealizowana w Zakładzie Bioinformatyki i Telemedycyny Collegium Medicum Uniwersytetu Jagiellońskiego we współpracy z Kliniką Neonatologii. Praca stanowi przykład interdyscyplinarnej współpracy podczas realizacji systemu bazodanowego. Kliniczna baza danych przeznaczona jest zasadniczo do zbierania i przechowywania odpowiednio sformatowanych danych, umożliwia do nich dostęp i ich przetwarzanie. Głównym założeniem implementacji jest utworzenie szkieletu programistycznego (framework) systemu bazodanowego w celu ponownego jego wykorzystania na użytek innych klinik. Kolejne założenia głównie dotyczą uwarunkowań ekonomicznych: centralizacja położenia serwera i minimalizacja wymogów klienta-użytkownika systemu, wykorzystane języki programowania (PHP), system serwera (Linux) i serwery usług (Apache, MySQL, openSSL), które są. na licencji GNU GPL.