Search results for "pali"

showing 10 items of 331 documents

El poder financiero de los municipios y su marco constitucional

2017

La Constitución establece un marco para el ejercicio del poder financiero por parte de los distintos entes territoriales. Los Municipios, en aplicación de preceptos de la Carta Manga, dispondrán de autonomía y suficiencia financiera (art. 140 y 152 CE). Asimismo, y en aplicación del principio de competencia, los Entes Locales podrán desarrollar su potestad reglamentaria en las materias que le sean propias. Por todo ello, el presente trabajo tiene por objeto el análisis y valoración de la aplicación y eficacia que despliegan estos principios constitucionales en el ejercicio del poder financiero municipal y sus límites cuando confluyan con otras Administraciones The Constitution establishes a…

Emerging:CIENCIAS JURÍDICAS [UNESCO]autonomía financierathe principie of competitionmunicipalitypoder financierosuficiencia financiera y principio de competenciafinancial sufficiency and the principle of competitionCiencias jurídicasfinancial sufficiencyConstitutionUNESCO::CIENCIAS JURÍDICASsuficiencia financieraprincipio de competenciafinancial autonomyCiencias jurídicas. GeneralidadesmunicipioConstituciónfinancial power
researchProduct

Fluorescence labels as sensors for oxygen binding of arthropod hemocyanins

2004

The molecular basis of high cooperativity in multi-subunit proteins is still unknown in most cases. Oxygen binding by multi-subunit hemocyanins produces two intrinsic spectroscopic signals which are, however, either limited to the UV or are very weak. Here we demonstrate that fluorescence labels emitting in the visible can be used as sensors for cooperative oxygen binding of hemocyanins. Fluorescence resonance energy transfer to the oxygenated active sites quenches the emission of the labels by roughly 50% upon oxygenation of the protein. The labels give strong and photo-stable emission, allowing imaging of single hemocyanin molecules. Therefore, this study opens up a new perspective for in…

Energy transfermedicine.medical_treatmentBiophysicsAnalytical chemistrychemistry.chemical_elementCooperativityBiochemistryOxygenFluorescence Resonance Energy TransfermedicineAnimalsMoleculePalinuridaeArthropodsMolecular BiologyFluorescent DyesChemistrySpidersHemocyaninCell BiologyFluorescenceOxygenSpectrometry FluorescenceFörster resonance energy transferEnergy TransferHemocyaninsBiophysicsOxygen bindingBiochemical and Biophysical Research Communications
researchProduct

Identification of proteolytic enzymes from Eriphia verrucosa and Palinurus elephas capable to degrade gliadin

2009

In small intestinal disease, coeliac sprue, proline-rich gluten peptides from wheat, rye and barley are relatively resistant to gastrointestinal digestion, and therefore remain in the intestinal lumen to elicit immunopathology in genetically susceptible individuals. Since most serine endopeptidases are unable to hydrolyse proline residues, proline specific proteases may be therapeutic keys in digestive diseases. Partial hydrolysis reduces the risk of allergenic sensitization while total hydrolysis ensures the elimination of the allergenicity of whey protein (Villad´oniga and others 2007). Kimoto and others (1998) reported that 18-, 31-, 37- and 58-kDa wheat allergens were recognized by the …

Eriphia verrucosaproteolytic enzymePalinurus elephasSettore BIO/10 - Biochimicagliadincoeliac
researchProduct

A subquadratic algorithm for minimum palindromic factorization

2014

We give an $\mathcal{O}(n \log n)$-time, $\mathcal{O}(n)$-space algorithm for factoring a string into the minimum number of palindromic substrings. That is, given a string $S [1..n]$, in $\mathcal{O}(n \log n)$ time our algorithm returns the minimum number of palindromes $S_1,\ldots, S_\ell$ such that $S = S_1 \cdots S_\ell$. We also show that the time complexity is $\mathcal{O}(n)$ on average and $\Omega(n\log n)$ in the worst case. The last result is based on a characterization of the palindromic structure of Zimin words.

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)PalindromeCharacterization (mathematics)Binary logarithmOmegaSubstringTheoretical Computer ScienceString algorithmComputational Theory and MathematicsFactorizationComputer Science - Data Structures and AlgorithmsC++ string handlingPalindromeDiscrete Mathematics and CombinatoricsData Structures and Algorithms (cs.DS)FactorizationTime complexityAlgorithmMathematicsComputer Science - Discrete Mathematics
researchProduct

Enumeration and Structure of Trapezoidal Words

2013

Trapezoidal words are words having at most $n+1$ distinct factors of length $n$ for every $n\ge 0$. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a prefix and as a suffix; otherwise it is open. We investigate open and closed trapezoidal words, in relation with their special factors. We prove that Sturmian palindromes are closed trapezoidal words and that a closed trapezoidal word is a Sturmian palindrome if and only if its longest repeated …

FOS: Computer and information sciencesFibonacci numberSpecial factorGeneral Computer ScienceFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheoryEnumerative formulaDisjoint sets68R15Theoretical Computer ScienceFOS: MathematicsPalindromeMathematics - CombinatoricsClosed wordsFibonacci wordMathematicsDiscrete mathematicsClosed wordSequenceta111Sturmian wordPrefixCombinatorics on wordsRich wordtrapezoidal wordF.4.3Combinatorics (math.CO)SuffixWord (group theory)Computer Science(all)
researchProduct

A Classification of Trapezoidal Words

2011

Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word is closed if its longest repeated prefix has exactly two occurrences in the word, the second one being a suffix of the word. Otherwise it is open. We show that open trapezoidal words are all primitive and that closed trapezoidal words are all Sturmian. We then show that trapezoidal palindromes are closed (and therefore Sturmian). This allows us to characterize the special factors of Sturmian palindromes. We end with several open problems.

FOS: Computer and information sciencesFormal Languages and Automata Theory (cs.FL)lcsh:Mathematicstrapezoidal words Sturmian words special factors palindromesPalindromeComputer Science - Formal Languages and Automata TheoryDisjoint setslcsh:QA1-939lcsh:QA75.5-76.95PrefixCombinatoricsF.4.3FOS: MathematicsMathematics - CombinatoricsCombinatorics (math.CO)lcsh:Electronic computers. Computer scienceSuffixWord (group theory)Mathematics
researchProduct

On the least number of palindromes contained in an infinite word

2013

We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then investigate the same problem when the alphabet has size two.

FOS: Computer and information sciencesGeneral Computer ScienceDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata Theory0102 computer and information sciences68R1501 natural sciencesTheoretical Computer ScienceCombinatorics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsMathematics - CombinatoricsPalindromes0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsCombinatorics on wordDiscrete mathematics010102 general mathematicsPalindromeCombinatorics on words010201 computation theory & mathematicsCombinatorics (math.CO)AlphabetWord (group theory)Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

On the Structure of Bispecial Sturmian Words

2013

A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word. There is a deep relation between bispecial Sturmian words and Christoffel words, that are the digital approximations of Euclidean segments in the plane. In 1997, J. Berstel and A. de Luca proved that \emph{palindromic} bispecial Sturmian words are precisely the maximal internal factors of \emph{primitive} Christoffel words. We extend this result by showing that bispecial Sturmian wo…

FOS: Computer and information sciencesGeneral Computer ScienceSpecial factorDiscrete Mathematics (cs.DM)Computer Networks and CommunicationsApproximations of πFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheoryEnumerative formula68R15Characterization (mathematics)Minimal forbidden wordTheoretical Computer ScienceCombinatoricsComputer Science::Discrete MathematicsEuclidean geometryPhysics::Atomic PhysicsMathematicsChristoffel symbolsApplied MathematicsPalindromeSturmian wordSturmian wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Combinatorics on wordsComputational Theory and MathematicsWord (group theory)Computer Science::Formal Languages and Automata TheoryChristoffel wordComputer Science - Discrete Mathematics
researchProduct

Beneficios de un programa de soporte para familiares de pacientes al final de la vida: estudio multicéntrico

2018

RESUMEN EXTENDIDO BENEFICIOS DE UN PROGRAMA DE SOPORTE PARA FAMILIARES DE PACIENTES AL FINAL DE LA VIDA: ESTUDIO MULTICÉNTRICO 1. INTRODUCCIÓN La situación de final de vida supone una serie de retos añadidos que han de afrontar el paciente y su familia, quienes han de ir adaptándose a numerosas pérdidas progresivas que culminarán con el fallecimiento del familiar (Mitrani, 2006). Ante la situación de enfermedad grave y final de vida de uno de sus miembros, la mayoría de las familias cuentan con una persona que asume la responsabilidad central del cuidado, el “cuidador familiar principal”, definido como: “aquel miembro de la familia que se encarga de los cuidados del paciente, la mayor parte…

Final de vida:PSICOLOGÍA [UNESCO]CuidadorFamiliaUNESCO::PSICOLOGÍAIntervenciónPaliativos
researchProduct

Projekts: SIA "ACNielsen Latvia" darbības pilnveidošana

2019

Maģistra darba autore Marina Malooka izstrādāja darbu, kura temats ir SIA “ACNielsen Latvia” darbības pilnveidošana. Maģistra darba mērķis ir pilnveidot uzņēmuma SIA “ACNielsen Latvia” darbību, peļņas palielinošai un tirgus izpētes jomā līdera pozīcijas ieņemšanai.jauno pakalpojumu ieviešanu. Tiek veidots darbības plāns to ieviešanai. Darbā 1.nodaļā tiek aprakstīta jauno piedāvāto pakalpojumu aktualitāte. SIA “ACNielsen”, tai skaitā arī SIA “ACNielsen Latvia” analizē tirgus dinamiku, pircēju uzvedību un vēlmes visdažādākās ekonomikas jomās.Darba 2.nodaļā ir noteikts, ka SIA “ACNielsen Latvia” strādā pēc SIA pamatprincipiem. Tāda juridiska forma tika izvēlēta līdz ar pamatkapitāla lielumu. Š…

Finanses un kredītskonkurences analīzefinanšu analīzepeļņas palielināšanamarketinga strāģijas veidošanaUzņēmuma darbības pilviedošana
researchProduct