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

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

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

Matching structure and bargaining outcomes in buyer–seller networks

We examine the relationship between the matching structure of a bipartite (buyer-seller) network and the (expected) shares of the unit surplus that each connected pair in this network can create. We show that in different bargaining environments, these shares are closely related to the Gallai-Edmonds Structure Theorem. This theorem characterizes the structure of maximum matchings in an undirected graph. We show that the relationship between the (expected) shares and the tructure Theorem is not an artefact of a particular bargaining mechanism or trade centralization. However, this relationship does not necessarily generalize to non-bipartite networks or to networks with heterogeneous link values

Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes

International audienceA partial word is a word with holes (also called don't cares: special symbols which match any symbol). A p-square is a partial word matching at least one standard square without holes (called a full square). Two p-squares are called equivalent if they match the same sets of full squares. Denote by psquares(T) the number of non-equivalent p-squares which are subwords of a partial word T. Let PSQUARES k (n) be the maximum value of psquares(T) over all partial words of length n with k holes. We show asympthotically tight bounds: c1 · min(nk 2 , n 2) ≤ PSQUARES k (n) ≤ c2 · min(nk 2 , n 2) for some constants c1, c2 > 0. We also present an algorithm that computes psquares(T) in O(nk 3) time for a partial word T of length n with k holes. In particular, our algorithm runs in linear time for k = O(1) and its time complexity near-matches the maximum number of non-equivalent p-squares

Dynamic multilateral markets

We study dynamic multilateral markets, in which players' payoffs result from intra-coalitional bargaining. The latter is modeled as the ultimatum game with exogenous (time-invariant) recognition probabilities and unanimity acceptance rule. Players in agreeing coalitions leave the market and are replaced by their replicas, which keeps the pool of market participants constant over time. In this infinite game, we establish payoff uniqueness of stationary equilibria and the emergence of endogenous cooperation structures when traders experience some degree of (heterogeneous) bargaining frictions. When we focus on market games with different player types, we derive, under mild conditions, an explicit formula for each type's equilibrium payoff as the market frictions vanish

Simulating accepting networks of evolutionary processors with filtered connections by accepting evolutionary P systems

In this work, we propose a variant of P system based on the rewriting of string-objects by means of evolutionary rules. The membrane structure of such a P system seems to be a very natural tool for simulating the filters in accepting networks of evolutionary processors with filtered connections. We discuss an informal construction supporting this simulation. A detailed proof is to be considered in an extended version of this work

Probing the N = 32 shell closure below the magic proton number Z = 20: Mass measurements of the exotic isotopes 52,53K

The recently confirmed neutron-shell closure at N = 32 has been investigated for the first time below the magic proton number Z = 20 with mass measurements of the exotic isotopes 52,53K, the latter being the shortest-lived nuclide investigated at the online mass spectrometer ISOLTRAP. The resulting two-neutron separation energies reveal a 3 MeV shell gap at N = 32, slightly lower than for 52Ca, highlighting the doubly-magic nature of this nuclide. Skyrme-Hartree-Fock-Boguliubov and ab initio Gorkov-Green function calculations are challenged by the new measurements but reproduce qualitatively the observed shell effect.Comment: 5 pages, 5 figure