Search results for "programming"
showing 10 items of 3090 documents
Left-to-right tree pattern matching
1991
We propose a new technique to construct left-to-right matching automata for trees. Our method is based on the novel concept of prefix unifcation which is used to compute a certain closure of the pattern set. From the closure a kind of deterministic matching automaton can be derived immediately. We also point out how to perform the construction incrementally which makes our approach suitable for applications in which pattern sets change dynamically, such as in the Knuth-Bendix completion algorithm.
Volumetric Reconstruction of Unorganized Set of Points with Implicit Surfaces
2005
Many solutions exist to rebuild a three-dimensional object represented by a set of points. The purpose of our work is to provide an automatic reconstruction from an unorganized cloud, describing an unknown shape, in the aim to compute its volume. The approach employed in this paper consists in filling the object's interior with isosurfaces of potential fields and to use their fusion property in order to find the full volume and the continuous shape of the sampled object. Thus, the first step of our reconstruction is to search a correct interior for the object described by the set of points. Then, comes the positioning of implicit primitives into the cloud, deep inside of it and close to the…
On Using “Stochastic Learning on the Line” to Design Novel Distance Estimation Methods
2018
In this paper, we consider the problem of Distance Estimation (DE) when the inputs are the x and y coordinates of the points under consideration. The aim of the problem is to yield an accurate value for the real (road) distance between the points specified by the latter coordinates. This problem has, typically, been tackled by utilizing parametric functions called Distance Estimation Functions (DEFs). The parameters are learned from the training data (i.e., the true road distances) between a subset of the points under consideration. We propose to use Learning Automata (LA)-based strategies to solve the problem. In particular, we resort to the Adaptive Tertiary Search (ATS) strategy, propose…
Looking Beyond Genres: Identifying Meaningful Semantic Layers from Tags in Online Music Collections
2011
A scheme for identifying the semantic layers of music-related tags is presented. Arguments are provided why the applications of the tags cannot be effectively pursued without a reasonable understanding of their semantic qualities. The identification scheme consists of a set of filters. The first is related with social consensus, user-count ratio, and n-gram properties of tags. The next relies on look-up functions across multiple databases to determine the probable semantic layer of each tag. Examples of the semantic layers with prevalence rates are given based on application of the scheme to a subset of the Million Song Dataset. Finally, a validation of the results was carried out with an i…
Induced &#x2113;<inf>2</inf> control of discrete-time Takagi-Sugeno fuzzy systems with time-varying delays via dynamic output feedback
2012
This paper is concerned with analyzing a novel model transformation of discrete-time Takagi-Sugeno (T-S) fuzzy systems with time-varying delays and applying it to dynamic output feedback (DOF) controller design. A new auxiliary model is proposed by employing a new approximation for time-varying delay state, and then delay partitioning method is used to analyze the scaled small gain of this auxiliary model. A sufficient condition on discrete-time T-S fuzzy systems with time-varying delays, which guarantees the corresponding closed-loop system to be asymptotically stable and has an induced l 2 disturbance attenuation performance, is derived by employing the scaled small gain theorem. Then the…
A High Level Language for Pyramidal Architectures
1986
In the paper are described the syntax and some implementation features of a high level language for pyramidal architectures called Pyramid B Language (PCL). The language is an extension of the B and include data type, set of instructions and builtin functions oriented to the pyramidal architectures. Some notes on the implementation for the PAPIA machine are also given.
Construction and Implementation of LR(1) Parsers
1990
This chapter is devoted to the practical issues involved in the construction and use of deterministic LR(1) parsers. We shall show how the practical versions of LR (1) parsers, most notably the LALR (1) parsers, can be constructed efficiently, and we shall present methods for encoding LR(1) parsers as efficient RAM programs. Two versions of RAM program implementation are considered: in the first implementation the parsing program is table-driven, that is, the rules of the parser are encoded in a two-dimensional array which is simulated by a program body; in the other implementation the tabular information is further transformed into a set of program statements.
Are control of extracellular acid-base balance and regulation of skeleton genes linked to resistance to ocean acidification in adult sea urchins?
2020
SCOPUS: ar.j
Highly contaminated areas as sources of pollution for adjoining ecosystems: The case of Augusta Bay (Central Mediterranean).
2014
An assessment of trace element and polycyclic aromatic hydrocarbon (PAH) contamination based on surface sediments collected in summer 2012 was carried out in Priolo Bay adjoining one of the most polluted areas of the Mediterranean Sea, the industrial Augusta harbour (Italy, Central Mediterranean). Inorganic and organic contaminants were generally not remarkable. Occasional elevated concentrations of Hg, Cd, Ni and PAHs exceeding sediment quality guidelines were detected in the northern sector of Priolo Bay, close to Augusta harbour, possibly as a result of water drainage of industrialised and urbanised areas and/or potential direct export of contaminated material from Augusta harbour, whose…
Informatics in Descriptive Geometry. Didactic Experience
2009
This study is centred in the environment of the research into solutions of the problems of graphic representation, expressing theoretical considerations which allow the carrying out of geometric-descriptive procedures decoded in informatics language, for implementing CAD commands.