Academic literature on the topic 'Lemma access'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Lemma access.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Lemma access"
1
Guerini, Federica. "APPUNTI PER UNA EDIZIONE DEL GLOSSARIO BERGAMASCO MEDIOEVALE DI ANTONIO TIRABOSCHI." Italiano LinguaDue 13, no. 2 (January 26, 2022): 589–605. http://dx.doi.org/10.54103/2037-3597/17150.
Full textAbstract:
Il presente contribuito descrive la struttura e i contenuti del Glossario Bergamasco Medioevale di Antonio Tiraboschi, attualmente conservato presso la Biblioteca Civica Angelo Mai di Bergamo, e costituito da quattro quaderni manoscritti e inediti, all’interno dei quali sono registrati oltre 2000 lemmi organizzati alfabeticamente. Si descrivono le fonti, edite e inedite, dalle quali Tiraboschi attinge i frammenti citati all’interno di ciascun lemma e si propone una classificazione delle annotazioni di cui il Glossario si compone in tre sottogruppi:
note di carattere dialettologico, riguardanti gli esiti di forme latine o proto-romanze in italiano e nei dialetti gallo-italici (bergamasco, in primis) o relative alle particolari sfumature semantiche osservabili nel lessico del bergamasco;
annotazioni di natura linguistica sulla comparsa di costruzioni romanze in sostituzione delle costruzioni latine, e sulle innovazioni semantiche romanze ravvisabili all’interno dei frammenti citati ad esemplificazione di ciascun lemma;
osservazioni di carattere onomastico, relative a toponimi, microtoponimi e – più raramente – nomi personali.
L’analisi condotta rappresenta un passo preliminare alla realizzazione di una edizione digitale (consultabile in modalità Open access a partire dalla home page della Biblioteca Civica Angelo Mai) dei preziosi materiali linguistici di cui il Glossario si compone e di una corrispondente edizione cartacea, che favoriscano valorizzazione e la fruizione del lavoro svolto dallo studioso bergamasco.
Notes for an edition of Glossario Bergamasco Medioevale by Antonio Tiraboschi
This paper describes the structure and the content of Antonio Tiraboschi's Glossario Bergamasco Medioevale, currently preserved at the Biblioteca Civica Angelo Mai in Bergamo, consisting of four manuscripts and unpublished notebooks containing more than 2000 alphabetically organized headwords. The sources, both published and unpublished, from which Tiraboschi drew the fragments cited as part of each lemma are described and a classification of the annotations into three subgroups is proposed:
notes of a dialectological nature, concerning either Latin or proto-Roman forms in Italian as well as in the Gallo-Italic dialects (Bergamasque, in primis) or relating to particular semantic nuances observable in the lexicon of Bergamasque;
linguistic notes on the appearance of Romance constructions replacing Latin constructions and questionable Romance semantic innovations in the fragments cited as examples of each lemma;
onomastic observations, concerning toponyms, microtoponyms and - more rarely - personal names.
This analysis is preliminary step towards creating a digital edition (available in Open access mode from the home page of the Biblioteca Civica Angelo Mai) of the precious linguistic materials which compose the Glossary and a corresponding paper edition, which will favor the valorization and fruition of the work carried out by the Bergamasque scholar.
2
Lewandowski, Sharon M., W. R. Bushnell, and C. Kent Evans. "Distribution of Mycelial Colonies and Lesions in Field-Grown Barley Inoculated with Fusarium graminearum." Phytopathology® 96, no. 6 (June 2006): 567–81. http://dx.doi.org/10.1094/phyto-96-0567.
Full textAbstract:
External surfaces of barley florets have thick-walled epidermal cells resistant to direct penetration by the head blight pathogen, Fusarium graminearum. Surfaces within the floral cavity have thin-walled, susceptible cells. How the fungus gains access to the floral cavity, causing head blight, has not been determined. To investigate pathways of entry, field-grown plants were sprayed with macroconidial inoculum after heads emerged from the flag leaf sheath and then were mist irrigated daily in the morning and evening. On selected days, 1 to 8 days after inoculation (DAI), 80 to 190 florets per day were harvested, dissected, and examined for presence and location of mycelial colonies. At 1 to 12 DAI, 57 to 100 florets likewise were examined for lesions. Patterns of colonization indicated that the fungus entered florets principally through crevices between the overlapping lemma and palea or through the apical floret mouth. The crevices were open for entry until ≈8 days after heads emerged. Most florets had mycelial colonies on the external surface in a sheltered pocket near the base of the ventral furrow of the palea. Mycelia spread laterally from the furrow to the crevice between lemma and palea. Anther colonization had only a minor role in invasion of florets. Hyphal penetration of stomates was not seen. Lesions usually developed first within 3 mm of the floret apex or 3 mm of the floret base. Within florets, lesions often were contiguous between lemma and palea, palea and caryopsis, or in all three floret parts. However, lesions in the caryopsis developed later and were fewer in number than in the lemma and palea and always were associated with lesions in the palea. The results show the importance of initial mycelial colonization of floret outer surfaces, pathways of entry via lemma or palea crevices or floret mouth, and spread of lesions within the floret at interfaces between lemma, palea, and caryopsis.
3
Luef, Eva Maria, and Jong-Seung Sun. "Wordform-specific frequency effects cause acoustic variation in zero-inflected homophones." Poznan Studies in Contemporary Linguistics 56, no. 4 (December 1, 2020): 711–39. http://dx.doi.org/10.1515/psicl-2020-0024.
Full textAbstract:
Abstract The frequency with which a word appears in the lexicon has implications for its pronunciation. Numerous studies have shown that high-frequency lemma are characterized by more phonetic reduction than lower-frequency lemma. These findings have proven to be particularly useful in the study of homophones where frequency-related reduction processes can give insights into lexical access theories. The majority of research on homophones and frequency effects has focused on heterographic and semantically unrelated homophones (e.g., English time – thyme) or investigated zero-derived homophones (e.g., English the cut, noun – to cut, verb). Here, zero inflection in German pluralization (e.g., ein Würfel ‘one die’– zwei Würfel ‘two dice’) was investigated to determine if and how frequency effects impact on the acoustic realization of the homophonous singular-plural word pairs. The findings indicate that the number-specified wordforms show acoustic variation related to wordform frequency and the relative frequency of the singular to plural inflected forms. Results differ for durations of wordforms, stem vowels, and final phonemes. Our findings have implications for lexical access theories and can inform about ‘frequency inheritance’ across the singular and plural homophones of the zero-inflected plurals.
4
Ma, Chao, Haiying Gao, and Duo Wei. "A CP-ABE Scheme Supporting Arithmetic Span Programs." Security and Communication Networks 2020 (March 16, 2020): 1–16. http://dx.doi.org/10.1155/2020/3265871.
Full textAbstract:
Attribute-based encryption achieves fine-grained access control, especially in a cloud computing environment. In a ciphertext-policy attribute-based encryption (CP-ABE) scheme, the ciphertexts are associated with the access policies, while the secret keys are determined by the attributes. In recent years, people have tried to find more effective access structures to improve the efficiency of encryption systems. This paper presents a ciphertext-policy attribute-based encryption scheme that supports arithmetic span programs. On the composite-order bilinear group, the security of the scheme is proven by experimental sequence based on the combination of composite-order bilinear entropy expansion lemma and subgroup decision (SD) assumption. And, it is an adaptively secure scheme with constant-size public parameters.
5
de Bot, Kees, T. Sima Paribakht, and Marjorie Bingham Wesche. "TOWARD A LEXICAL PROCESSING MODEL FOR THE STUDY OF SECOND LANGUAGE VOCABULARY ACQUISITION." Studies in Second Language Acquisition 19, no. 3 (September 1997): 309–29. http://dx.doi.org/10.1017/s0272263197003021.
Full textAbstract:
A major requirement for theory development in L2 vocabulary acquisition is an adequate model of L2 lexical organization and processing. At present, there is no widely accepted model of this kind, but recent research has demonstrated the potential usefulness of Levelt's (1989, 1993) L1 speech processing model (de Bot & Schreuder, 1993; Green, 1993; Poulisse, 1993). This paper explores the relevance of the model as adapted for L2 lexical processing of written texts, with particular attention to its mental lexicon components (concepts, lemmas, and lexemes) and organization. The model is first discussed in terms of its relevance to L2 lexical access, retrieval, and acquisition processes. Findings of an introspective L2 vocabulary study follow, detailing how university ESL learners reported dealing with unfamiliar words while carrying out L2 reading tasks. The information provided on their lexical inferencing strategy and varied knowledge sources used in the process provide support for the lexical components and organization proposed by Levelt. It is argued in this paper that the process of inferring the features of unknown words in a reading passage can be described in terms of lemma construction, as defined in the model.
6
Sivaeva, O. "SEMANTIC PROSODY OF THE LEMMA VACCINE IN THE MEDIA TEXTS." Studia Philologica 1, no. 16 (2021): 42–46. http://dx.doi.org/10.28925/2311-2425.2021.166.
Full textAbstract:
This paper discusses the results of the corpus-based analysis of the semantic prosody of collocations with VACCINE in the broadsheet ‘The Guardian’. The corpus has been processed with the help of Sketch Engine. Text passages containing collocations with VACCINE have been interpreted in order to state the prosody mode of the collocation in the context. The study mostly pays attention to the nouns modified by VACCINE as most frequently used in the media texts. The dictionary definition of VACCINE defines it as a word with positive semantic prosody. The discourse analysis demonstrates that collocations containing the lemma VACCINE can have positive, negative or neutral semantic colouring, which depends on the contextual meaning of the analyzed passage and which is also based on the semantic prosody mode of other words in the passage, which actually designates and presupposes the mode of the collocations in question. The nouns supply, safety, mask, uptake, access, protection, production, certification used in ‘The Guardian’ articles, having positive semantic prosody in the pattern noun + VACCINE, in general create a positive metaphorical image and defense from Covid-19. However, the nouns hesitancy, misinformation, availability and skepticism possessing negative semantic prosody, are mostly used to describe people’s unwillingness to get vaccinated and their doubts about the effectiveness of the procedure. Collocations with type, mechanism, distribution, usage and VACCINE have a neutral semantic prosody, which shows that such collocations are used in text passages in the surrounding of neither positive nor negative words and the whole passage serves as a statement of some facts without being evaluated.
7
NiCastro, J. R. A. J. "Study of Two-Sided Similarity Methods Using a Radiation “Switch on” Imploding Shock in a Magnetic Field." Journal of Applied Mathematics 2018 (June 24, 2018): 1–14. http://dx.doi.org/10.1155/2018/9701268.
Full textAbstract:
This paper explores aspects of two-sided similarity modeling using cylindrical geometry for radiating shock waves embedded in a medium with a magnetic field. Two-sided similarity solution techniques may be used to link states influenced by long range near instantaneous fields that continually modify the pre- and postshock zones. Emergent radiation scaling relations are immediately available from consistent homologies. For both small angle and large angle measurements, an approximate analytic technique in the vicinity of luminous fronts together with the high symmetry implications delineated in Lemma provides direct access to the homology parameters. The parameters obtained using this process can augment the constraint relations and contribute to establishing relevant similarity homologies.
8
GOÑI, JOSÉ M., JOSÉ C. GONZÁLEZ, and ANTONIO MORENO. "ARIES: A lexical platform for engineering Spanish processing tools." Natural Language Engineering 3, no. 4 (December 1997): 317–45. http://dx.doi.org/10.1017/s1351324997001812.
Full textAbstract:
We present a lexical platform that has been developed for the Spanish language. It achieves portability between different computer systems and efficiency, in terms of speed and lexical coverage. A model for the full treatment of Spanish inflectional morphology for verbs, nouns and adjectives is presented. This model permits word formation based solely on morpheme concatenation, driven by a feature-based unification grammar. The run-time lexicon is a collection of allomorphs for both stems and endings. Although not tested, it should be suitable also for other Romance and highly inflected languages. A formalism is also described for encoding a lemma-based lexical source, well suited for expressing linguistic generalizations: inheritance classes, lemma encoding, morpho-graphemic allomorphy rules and limited type-checking. From this source base, we can automatically generate an allomorph indexed dictionary adequate for efficient retrieval and processing. A set of software tools has been implemented around this formalism: lexical base augmenting aids, lexical compilers to build run-time dictionaries and access libraries for them, feature manipulation libraries, unification and pseudo-unification modules, morphological processors, a parsing system, etc. Software interfaces among the different modules and tools are cleanly defined to ease software integration and tool combination in a flexible way. Directions for accessing our e-mail and web demonstration prototypes are also provided. Some figures are given, showing the lexical coverage of our platform compared to some popular spelling checkers.
9
Deundyak, Vladimir M., and Denis V. Zagumennov. "On the Properties of Algebraic Geometric Codes as Copy Protection Codes." Modeling and Analysis of Information Systems 27, no. 1 (March 23, 2020): 22–38. http://dx.doi.org/10.18255/1818-1015-2020-1-22-38.
Full textAbstract:
Traceability schemes which are applied to the broadcast encryption can prevent unauthorized parties from accessing the distributed data. In a traceability scheme a distributor broadcasts the encrypted data and gives each authorized user unique key and identifying word from selected error-correcting code for decrypting. The following attack is possible in these schemes: groups of c malicious users are joining into coalitions and gaining illegal access to the data by combining their keys and identifying codewords to obtain pirate key and codeword. To prevent this attacks, classes of error-correcting codes with special c-FP and c-TA properties are used. In particular, c -FP codes are codes that make direct compromise of scrupulous users impossible and c -TA codes are codes that make it possible to identify one of the aackers. We are considering the problem of evaluating the lower and the upper boundaries on c, within which the L-construction algebraic geometric codes have the corresponding properties. In the case of codes on an arbitrary curve the lower bound for the c-TA property was obtained earlier; in this paper, the lower bound for the c-FP property was constructed. In the case of curves with one infinite point, the upper bounds for the value of c are obtained for both c-FP and c-TA properties. During our work, we have proved an auxiliary lemma and the proof contains an explicit way to build a coalition and a pirate identifying vector. Methods and principles presented in the lemma can be important for analyzing broadcast encryption schemes robustness. Also, the c-FP and c-TA boundaries monotonicity by subcodes are proved.
10
Alshehri, Amira Abdullah. "The L1 Semantic Retrieval of L2 Words: Evidence from Advanced L2 Learners’ Reaction Times." World Journal of English Language 12, no. 1 (March 14, 2022): 334. http://dx.doi.org/10.5430/wjel.v12n1p334.
Full textAbstract:
According to the first language (L1) lemma mediation hypothesis, second language learners, regardless of their level of second language (L2) proficiency, access the meaning of L2 words via their first language (Jiang, 2004). To test this hypothesis, a semantic judgment task was conducted on 30 advanced Arab speakers of English, in which they were presented with 86 pairs of English words and had to decide whether each pair was semantically related. Some semantically related pairs are classified as same translation pairs because their members share the same L1 translation, whereas others are semantically related but do not share the same L1 translation, hence they are classified as different translation pairs. Two instruments were used to record the reaction times and determine accuracy: DMDX and Gorilla. The results revealed that the highly proficient L2 speakers rated same translation pairs as semantically related significantly faster than their responses to different translation pairs. When compared with the 28 native speakers’ results, there was a significant difference in the reaction times of the two groups. This provides evidence that the underlying processes of L1 and L2 vocabulary acquisition is substantially different: L2 learners rely on their well-established conceptual system to access the meaning of L2 words.
Dissertations / Theses on the topic "Lemma access"
1
BARBIERI, ELENA. "An investigation of argument structure processing in normal and aphasic participants: a test of the argument structure coplexity hypothesis (Thompson 2003)." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2012. http://hdl.handle.net/10281/28809.
Full textAbstract:
The study was conducted so as to test the mental organization of verb argument structure (VAS)
and the generalization of the predictions based on the Argument Structure Complexity Hypothesis
(ASCH; Thompson, 2003), which explains the pattern of impairment of the agrammatic patients’
verb production as a function of the argument structure complexity, i.e. both in terms of the number
of arguments taken by a verb (transitive vs. unergative verbs) and of the presence of syntactic
movement (unaccusative vs. unergative verbs). The aim was i) to test the effect of the number of
arguments in a task tapping lemma access bypassing overt production, in both neurologically
unimpaired (Experiment 1 and 2) and aphasic participants (Experiment 3), and ii) to test the effect
both of the number of arguments and of syntactic movement in a patient with deep dyslexia
(Experiment 4). Moreover, an additional goal was to inform about the deficit underlying the verbspecific
impairment that characterizes nonfluent aphasia, by testing the hypothesis of a defective
lemma access as compared to a deficit at the level of grammatical encoding (Experiment 3). A third
goal was to test the assumption of a separate level of representation for semantic and VAS
information, as suggested by models of contemporary psycholinguistics (Experiment 2). In
Experiment 1, 2 and 3 participants were asked to perform a sentence completion task by choosing
among two verb options that differed either in the VAS (unergative vs. two-place transitive verb) or
in the verb semantic content (Condition 2 of Experiment 2 only). Experiment 4 provided instead a
deep dyslexic patient with a word naming task that was performed both on verbs belonging to
different categories (unergative, unaccusative, transitive) and on nouns. Results from Experiment 1,
2 and 3 demonstrate that access to VAS information is faster (for healthy subjects) and easier (for
aphasic patients) for unergative than for transitive verbs, thus suggesting the possibility that the
ASCH more generally reflects an aspect of normal language processing. In addition, results from
Experiment 4 offer support only to the first prediction of the ASCH, suggesting that the effect of
the number of arguments and the effect of syntactic movement arise at different level of processing.
Finally, data from Experiment 2 demonstrate that VAS and semantic information can be accessed
independently, in line with models of contemporary psycholinguistics.
2
Zhong, Yangfan. "Joint Source-Channel Coding Reliability Function for Single and Multi-Terminal Communication Systems." Thesis, 2008. http://hdl.handle.net/1974/1207.
Full textAbstract:
Traditionally, source coding (data compression) and channel coding (error protection) are performed separately and sequentially, resulting in what we call a tandem (separate) coding system. In
practical implementations, however, tandem coding might involve a large delay and a high coding/decoding complexity, since one needs to remove the redundancy in the source coding part and then insert certain redundancy in the channel coding part. On the other hand, joint source-channel coding (JSCC), which coordinates source and channel coding or combines them into a single step, may offer substantial improvements over the tandem coding approach.
This thesis deals with the fundamental Shannon-theoretic limits for a variety of communication systems via JSCC. More specifically, we investigate the reliability function (which is the largest rate at which the coding probability of error vanishes exponentially with
increasing blocklength) for JSCC for the following discrete-time communication systems: (i) discrete memoryless systems; (ii) discrete memoryless systems with perfect channel feedback; (iii) discrete memoryless systems with source side information; (iv) discrete systems with Markovian memory; (v) continuous-valued
(particularly Gaussian) memoryless systems; (vi) discrete asymmetric 2-user source-channel systems.
For the above systems, we establish upper and lower bounds for the JSCC reliability function and we analytically compute these bounds. The conditions for which the upper and lower bounds coincide are also provided. We show that the conditions are satisfied for a large class of source-channel systems, and hence exactly determine the reliability function. We next provide a systematic comparison between the JSCC reliability function and the tandem coding reliability function (the reliability function resulting from separate source and channel coding). We show that the JSCC reliability function is substantially larger than the tandem coding
reliability function for most cases. In particular, the JSCC reliability function is close to twice as large as the tandem coding reliability function for many source-channel pairs. This exponent gain provides a theoretical underpinning and justification for JSCC design as opposed to the widely used tandem coding method, since
JSCC will yield a faster exponential rate of decay for the system error probability and thus provides substantial reductions in
complexity and coding/decoding delay for real-world communication systems.Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2008-05-13 22:31:56.425
Books on the topic "Lemma access"
1
Sinn, Heidi. The lemma access to German temporal conjunctions: Situational focusings in speech production. Freiburg [Breisgau]: Hochschulverlag, 1994.
Find full textBook chapters on the topic "Lemma access"
1
Gouws, Rufus H. "1. Sinuous lemma files in printed dictionaries: Access and lexicographic functions." In Lexicography in the 21st Century, 3–21. Amsterdam: John Benjamins Publishing Company, 2009. http://dx.doi.org/10.1075/tlrp.12.03gou.
Full text
2
Greenlaw, Raymond, H. James Hoover, and Walter L. Ruzzo. "The Circuit Value Problem." In Limits to Parallel Computation. Oxford University Press, 1995. http://dx.doi.org/10.1093/oso/9780195085914.003.0010.
Full textAbstract:
In this chapter we return to the Circuit Value Problem, introduced in Section 4.2. First, we will give the formal proof of Theorem 4.2.2 that CVP is P-complete, which we only sketched previously. Then we will show that a number of useful variants and restricted versions of CVP are also P-complete. Recall the definition of the Circuit Value Problem (Definition 4.2.1) in which given an encoding ᾱ of a Boolean circuit α, a designated output y , and values for the inputs x1,..., xn, we ask if output y of α is TRUE. To show CVP is P-complete under ≤mNC1 reducibility requires showing CVP is in P, and that each language L in P is ≤mNC1 reducible to CVP. It is easy to see that given the encoding ᾱ of a circuit and the values of its inputs, one can compute the value of each gate in a number of steps that is polynomial in the size of α. On a random access machine this can be done in linear time by considering the gates in topological order (which also can be computed in linear time; see Gormen, Leiserson, and Rivest [70], for example). On a deterministic Turing machine the process is a bit more clumsy but can still be done in polynomial time. Pippenger shows that even time O(nlogn) suffices, where n is the length of the encoding of α [284]. Thus, we have the following lemma. Lemma 6.1.1 The Circuit Value Problem is in P. The more difficult step in proving that CVP is P-complete under ≤mNC1 reducibility is showing there is a ≤mNC1 reduction from each language in P to CVP. Ladner proved this by simulating Turing machines with circuits. The idea is as follows. First, recall that for each language L in P, there is a 1-tape Turing machine M that on input x = x1,..., xn halts in time t(n) = nO(1) with output equal to 1 if and only if x is in L. Note that, for each n, the machine M uses at most t(n) space on its tape.
3
Galil, Z., and I. Yudkiewicz. "Off-line Parallel Exact String Searching." In Pattern Matching Algorithms. Oxford University Press, 1997. http://dx.doi.org/10.1093/oso/9780195113679.003.0005.
Full textAbstract:
The string matching problem is defined as follows: given a string P0 ... Pm-1 called the pattern and a string T0 .. .Tn-1 called the text find all occurrences of the pattern in the text. The output of a string matching algorithm is a boolean array MATCH[0..n — 1] which contains a true value at each position where an occurrence of the pattern starts. Many sequential algorithms are known that solve this problem optimally, i.e., in a linear O(n) number of operations, most notable of which are the algorithms by Knuth, Morris and Pratt and by Boyer and Moore. In this chapter we limit ourselves to parallel algorithms. All algorithms considered in this chapter are for the parallel random access machine (PRAM) computation model. In the design of parallel algorithms for the various PRAM models, one tries to optimize two factors simultaneously: the number of processors used and the time required by the algorithm. The total number of operations performed, which is the time-processors product, is the measure of optimality. A parallel algorithm is called optimal if it needs the same number of operations as the fastest sequential algorithm. Hence, in the string matching problem, an algorithm is optimal if its time-processor product is linear in the length of the input strings. Apart from having an optimal algorithm the designer wishes the algorithm to be the fastest possible, where the only limit on the number of processors is the one caused by the time-processor product. The following fundamental lemma given by Brent is essential for understanding the tradeoff between time and processors : Any PRAM algoriihm of time t that consists of x elementary operations can be implemented on p processors in O(x/p + t) time. Using Brent’s lemma, any algorithm that uses a large number x of processors to run very fast can be implemented on p < x processors, with the same total work, however with an increase in time as described. A basic problem in the study of parallel algorithms for strings and arrays is finding the maximal/minimal position in an array that holds a certain value.
4
Powell, Mark, and Arunima Ray. "Key Facts about Skyscrapers and Decomposition Space Theory." In The Disc Embedding Theorem, 395–98. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198841319.003.0026.
Full textAbstract:
‘Key Facts about Skyscrapers and Decomposition Space Theory’ summarizes the input from Parts I and II needed for the remainder of the proof of the disc embedding theorem. Precise references to previous chapters are provided. This enables Part IV to be read independently from the previous parts, provided the reader is willing to accept the facts from Parts I and II summarized in this chapter. The listed facts include the shrinking of mixed, ramified Bing–Whitehead decompositions of the solid torus, the shrinking of null decompositions consisting of recursively starlike-equivalent sets, the ball to ball theorem, the skyscraper embedding theorem, and the collar adding lemma.
Conference papers on the topic "Lemma access"
1
Bidokhti, Shirin Saeedi, and Gerhard Kramer. "An application of a wringing lemma to the multiple access channel with cooperative encoders." In 2014 Iran Workshop on Communication and Information Theory (IWCIT). IEEE, 2014. http://dx.doi.org/10.1109/iwcit.2014.6842504.
Full text
2
Sastre, Paz. "Dominios, públicos y accesos. Un wiki en proceso sobre la arqueología del acceso." In Conferencia Interdisciplinaria de Avances en Investigación. Lerma Estado de México, México: Universidad Autónoma Metropilitana, Unidad Lerma, 2018. http://dx.doi.org/10.24275/uam/lerma/repinst/ciai2018/000128/sastre.
Full text
3
Palmas, Santiago. "Acceso a la representación escrita de los números naturales: Una secuencia didáctica para adultos de baja o nula escolaridad." In Conferencia Interdisciplinaria de Avances en Investigación. Lerma Estado de México, México: Universidad Autónoma Metropilitana, Unidad Lerma, 2018. http://dx.doi.org/10.24275/uam/lerma/repinst/ciai2018/000125/palmas.
Full text
4
Hugony, Cecilia, and Juan Carlos Espada Suárez. "Proyecto PATUR: herramientas innovadoras para la gestión participativa de la ciudad histórica." In International Conference Virtual City and Territory. Barcelona: Centre de Política de Sòl i Valoracions, 2009. http://dx.doi.org/10.5821/ctv.7562.
Full textAbstract:
En los últimos 30 años el debate sobre la gestión de los centros históricos ha ido apuntando a la necesidad de experimentar e incorporar los procesos participativos, un reto de primordial importancia para la planificación urbana en la agenda del desarrollo local sostenible. Si bien existe un interés general hacía los procesos de toma de decisión de forma participativa en la planificación urbana y territorial, se aprecia una falta de métodos y protocolos para su aplicación a la gestión del patrimonio histórico. Asimismo, se reclama la necesidad de reformular los objetivos de la intervención en las ciudades históricas,
acompañando la tutela del patrimonio arquitectónico y urbano con políticas de regeneración socioeconómica que garanticen la vitalidad de los centros históricos además de su conservación.
El proyecto de investigación PATUR, desarrollado por Labein Tecnalia en los años 2007-2009 con financiación del gobierno Vasco, se propone desarrollar herramientas específicas de apoyo a la gestión y
planificación de las ciudades históricas que permitan por una parte racionalizar y “objetivar” los procesos de toma de decisiones, facilitando la participación ciudadana e interinstitucional, y, por otra, garantizar el seguimiento de la implementación de los planes y proyectos evaluando de forma continuada el estado de
“salud” de la ciudad.
La definición de las herramientas a desarrollar se realizó a partir de la propuesta de un modelo de gobernanza de la ciudad histórica que se desarrolla como un proceso dialéctico y continuo entre la
definición de la estrategia de intervención –la implementación en planes y programas – el seguimiento de la los mismos. Dicho modelo se construyó sobre la base del estudio de buenas prácticas y se validó
mediante reuniones con expertos y agentes activos en la gestión de los centros históricos.
A partir de dicho modelo, se ha profundizado en 5 instrumentos de especial interés para la gestión participativa de los centros históricos: 1. Herramientas de diagnóstico expeditivo integral del casco histórico (con especial atención a la accesibilidad); 2. Herramienta de edición colaborativa para la gestión y acceso compartido de la información basado en tecnologías Web 2.0 y GIS; 3. Sistema de indicadores específico para la evaluación de la calidad urbana de los centros históricos; 4. Herramienta participativa de selección de alternativas apoyada en tecnologías de realidad virtual y aumentada; 5. Guía de gestión de la ciudad histórica. La guía de gestión desarrolla la fase de implementación de las políticas definidas en la elaboración de la estrategia. Su estructura se adapta a la normativa europea de control de calidad, siguiendo una metodología desarrollada por el centro de investigación LEMA de la Universidad de Lieja, que colaboró
activamente en el proyecto. Para ello, la guía se construyó a partir del análisis de un caso real, la ciudad de Segovia. Durante un año, los investigadores analizaron los mecanismos de gestión y seguimiento de la
ciudad histórica trabajando conjuntamente con los técnicos destinados a su aplicación. A partir del desarrollo de un Diagnóstico Compartido de la situación de la ciudad y a través de dinámicas participativas de análisis inter-sectoriales e inter-institucionales, se identificaron las oportunidades de mejora y se definieron los procesos a desarrollar para facilitar su implementación. Como resultado del trabajo se redactó un prototipo de guía de gestión para la ciudad histórica.