Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under $\theta$ ($\theta$-invariant for short).We establish an extension of the famous defect theorem. Moreover, we prove that for the so-called thin $\theta$-invariant codes, maximality and completeness are two equivalent notions. We prove that a similar property holds in the framework of some special families of $\theta$-invariant codes such as prefix (bifix) codes, codes with a finite deciphering delay, uniformly synchronized codes and circular codes. For a special class of involutive antimorphisms, we prove that any regular $\theta$-invariant code may be embedded into a complete one.Comment: To appear in Acts of WORDS 201

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions

The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions. More precisely, we extend partial derivation of regular expressions to two-sided partial derivation of hairpin expressions and we show how to deduce a recognizer for a hairpin expression from its two-sided derived term automaton, providing an alternative proof of the fact that hairpin completions of regular languages are linear context-free.Comment: 28 page

Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections

In this paper, we present some results regarding the size complexity of Accepting Networks of Evolutionary Processors with Filtered Connections (ANEPFCs). We show that there are universal ANEPFCs of size 10, by devising a method for simulating 2-Tag Systems. This result significantly improves the known upper bound for the size of universal ANEPFCs which is 18. We also propose a new, computationally and descriptionally efficient simulation of nondeterministic Turing machines by ANEPFCs. More precisely, we describe (informally, due to space limitations) how ANEPFCs with 16 nodes can simulate in O(f(n)) time any nondeterministic Turing machine of time complexity f(n). Thus the known upper bound for the number of nodes in a network simulating an arbitrary Turing machine is decreased from 26 to 16

Reaction Dynamics for the Systems 7Be,8B + 208Pb at Coulomb Barrier Energies

In this contribution we describe the first results obtained for the investigation of the elastic scattering process in the reactions induced by the Radioactive Ion Beams 7Be and 8B on a 208Pb target at Coulomb barrier energies. The experimental data were analyzed within the framework of the optical model in order to extract the total reaction cross section. The comparison with data available in literature for reactions induced on 208Pb by light ions in the mass range A = 6-8 shows that the loosely-bound 8B has the largest reactivity

Solution-processed bilayer photovoltaic devices with nematic liquid crystals

The cross-linking of polymerisable liquid crystalline semiconductors is a promising approach to solution-processable, multilayer, organic photovoltaics. Here we demonstrate an organic bilayer photovoltaic with an insoluble electron-donating layer formed by cross-linking a nematic reactive mesogen. We investigate a range of perylene diimide (PDI) materials, some of which are liquid crystalline, as the overlying electron acceptor layer. We find that carrier mobility of the acceptor materials is enhanced by liquid crystallinity and that mobility limits the performance of photovoltaic devices. © 2013 © 2013 Taylor & Francis

Pheochromocytoma – clinical manifestations, diagnosis and current perioperative management

Pheochromocytoma is a neuroendocrine tumor characterized by the excessive production of catecholamines (epinephrine, norepinephrine, and dopamine). The diagnosis is suspected due to hypertensive paroxysms, associated with vegetative phenomena, due to the catecholaminergic hypersecretion. Diagnosis involves biochemical tests that reveal elevated levels of catecholamine metabolites (metanephrine and normetanephrine). Functional imaging, such as 123I-metaiodobenzylguanidine scintigraphy (123I-MIBG), has increased specificity in identifying the catecholamine-producing tumor and its metastases. The gold-standard treatment for patients with pheochromocytoma is represented by the surgical removal of the tumor. Before surgical resection, it is important to optimize blood pressure and intravascular volume in order to avoid negative hemodynamic events

Green and sustainable public procurement—an instrument for nudging consumer behavior. A case study on romanian green public agriculture across different sectors of activity

Green Public Procurement (GPP) became an efficient instrument to achieve the objectives of environmental policy expressed by the European Commission in its Communications. At the same time, it must be addressed by the public authorities as a complex process, in which all purchased goods and services must integrate perfectly into an entire puzzle-like system of legislation, the construction field, innovation, healthcare, food, and education. Scientific references published in the Web of Science (WoS) mainly between 2017 and 2020 were investigated, and they analyze the implications of green public procurement in various fields, as presented by scientific communities. This article brings as a novelty in this context the identification of some barriers in the adoption of these processes, so that they can be overcome. Based on good practices and international standards and trends, the article shows how aspects related to the implementation of green procurement in society can be taken into account. In the second stage, we added a case study on Romanian green agriculture and discussions regarding inter-correlation between different fields and GPP.info:eu-repo/semantics/publishedVersio

Alcoholic liver cirrhosis, more than a simple hepatic disease – A brief review of the risk factors associated with alcohol abuse

Liver cirrhosis is a significant public health problem, being an important cause of mortality and morbidity, responsible for approximately 1.8% of the total number of deaths in Europe. Chronic alcohol consumption is the most common cause of liver cirrhosis in developed countries. Europe has the highest level of alcohol consumption among all the global World Health Organisation (WHO) regions. In this paper, we briefly review major factors leading to excessive alcohol consumption in order to draw attention to the fact that alcoholic liver cirrhosis is more than a simple liver disease, and if those risk/causal factors can be prevented, the incidence of this disease could be reduced greatly. Although excessive alcohol consumption is regarded as the cause of alcoholic liver cirrhosis, the etiology is complex, involving multiple factors that act in synchrony, and which, if prevented, could greatly reduce the incidence of this disease. Children of addicts are likely to develop an alcohol-related mental disorder; however, there is no “gene for alcoholism”

Detecting One-variable Patterns

Given a pattern $p = s_1x_1s_2x_2\cdots s_{r-1}x_{r-1}s_r$ such that $x_1,x_2,\ldots,x_{r-1}\in\{x,\overset{{}_{\leftarrow}}{x}\}$, where $x$ is a variable and $\overset{{}_{\leftarrow}}{x}$ its reversal, and $s_1,s_2,\ldots,s_r$ are strings that contain no variables, we describe an algorithm that constructs in $O(rn)$ time a compact representation of all $P$ instances of $p$ in an input string of length $n$ over a polynomially bounded integer alphabet, so that one can report those instances in $O(P)$ time.Comment: 16 pages (+13 pages of Appendix), 4 figures, accepted to SPIRE 201