Repozitorij Univerze v Novi Gorici

Iskanje po repozitoriju
A+ | A- | Pomoč | SLO | ENG

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 10 / 11
Na začetekNa prejšnjo stran12Na naslednjo stranNa konec
1.
Czech speakers learn and apply morphological dependencies : lecture at the University of Nova Gorica, Jezik & Linguistics Colloquia, Nova Gorica, 23. 11. 2023
Guy Tabachnick, 2023, druga izvedena dela

Opis: Theories of morphology must account for lexicalized variation: lexical items that differ unpredictably in their inflection must be memorized individually and differ in their stored representation. When tested on such cases, adult speakers usually follow the “law of frequency matching” (Hayes et al. 2009), extending gradient phonological patterns from the lexicon. In this talk, I present results from two wug tests showing that Czech speakers likewise extend gradient morphological patterns from the lexicon: that is, they productively apply correlations between inflected forms of the same word. I handle lexicalized variation using diacritic features marking lexical entries and propose that Czech speakers have learned a gradient cooccurrence relation between diacritic features, extending the sublexicon model of Gouskova et al. (2015). This approach accounts for phonological and morphological patterns with a unified mechanism. This approach provides an account of morphological dependencies in generative grammar compatible with a piece-based, syntactic theory like Distributed Morphology, responding to Ackerman and Malouf (2013) and others who criticize such theories for being unable to account for these morphological correlations.
Ključne besede: morphology, psycholinguistics, inflection classes, nonce word study, frequency matching, morphological dependencies, Czech
Objavljeno v RUNG: 05.03.2024; Ogledov: 473; Prenosov: 1
URL Povezava na datoteko
Gradivo ima več datotek! Več...

2.
Speakers apply morphological dependencies in the inflection of novel forms : lecture at the University of Connecticut, College of Liberal Arts and Sciences, Department of Linguistics, Ling Lunch, 18. 4. 2023
Guy Tabachnick, 2023, predavanje na tuji univerzi

Opis: Theories of morphology must account for lexicalized variation: lexical items that differ unpredictably in their inflection must be memorized individually and differ in their stored representation. When tested on such cases, adult speakers usually follow the “law of frequency matching” (Hayes et al. 2009), extending gradient phonological patterns from the lexicon. In this talk, I present results from two wug tests showing that Hungarian and Czech speakers likewise extend gradient morphological patterns from the lexicon: that is, they productively imply correlations between inflected forms of the same word. I handle lexicalized variation using diacritic features marking lexical entries and propose that Hungarian and Czech speakers have learned a gradient cooccurrence relation between diacritic features, extending the sublexicon model of Gouskova et al. (2015). This approach also allows for a flexible analysis of traditional inflection classes (in languages like Russian) as emergent clusters of frequently cooccurring features.
Ključne besede: morphology, psycholinguistics, inflection classes, nonce word study, frequency matching, morphological dependencies, Hungarian, Czech
Objavljeno v RUNG: 05.03.2024; Ogledov: 403; Prenosov: 1
URL Povezava na datoteko
Gradivo ima več datotek! Več...

3.
4.
Southern African Large Telescope Spectroscopy of BL Lacs for the CTA project
Eli Kasai, Saptashwa Bhattacharyya, Barbara MARČUN, Judit Pérez Romero, Samo Stanič, Veronika Vodeb, Serguei Vorobiov, Gabrijela Zaharijas, Marko Zavrtanik, Danilo Zavrtanik, Miha Živec, 2021, objavljeni znanstveni prispevek na konferenci

Opis: n the last two decades, very-high-energy gamma-ray astronomy has reached maturity: over 200 sources have been detected, both Galactic and extragalactic, by ground-based experiments. At present, Active Galactic Nuclei (AGN) make up about 40% of the more than 200 sources detected at very high energies with ground-based telescopes, the majority of which are blazars, i.e. their jets are closely aligned with the line of sight to Earth and three quarters of which are classified as high-frequency peaked BL Lac objects. One challenge to studies of the cosmological evolution of BL Lacs is the difficulty of obtaining redshifts from their nearly featureless, continuum-dominated spectra. It is expected that a significant fraction of the AGN to be detected with the future Cherenkov Telescope Array (CTA) observatory will have no spectroscopic redshifts, compromising the reliability of BL Lac population studies, particularly of their cosmic evolution. We started an effort in 2019 to measure the redshifts of a large fraction of the AGN that are likely to be detected with CTA, using the Southern African Large Telescope (SALT). In this contribution, we present two results from an on-going SALT program focused on the determination of BL Lac object redshifts that will be relevant for the CTA observatory.
Ključne besede: Cherenkov Telescope Array, very-high-energy gamma-ray astronomy, Active Galactic Nuclei, high-frequency peaked BL Lacs, Southern African Large Telescope
Objavljeno v RUNG: 18.09.2023; Ogledov: 888; Prenosov: 6
.pdf Celotno besedilo (972,63 KB)
Gradivo ima več datotek! Več...

5.
An efficient algorithm for PMFAP
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2016, objavljeni znanstveni prispevek na konferenci

Opis: Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. The proposed algorithm also works for the well-known Frequency Assignment Problem (FAP) and its performance is compared with the existing results for the standard benchmark data sets.
Ključne besede: Frequency Assignment Problem (FAP), Perturbation-Minimizing Frequency Assignment Problem (PMFAP), Perturbation, Heuristic Algorithm
Objavljeno v RUNG: 05.06.2023; Ogledov: 1006; Prenosov: 0
Gradivo ima več datotek! Več...

6.
Perturbation-minimising frequency assignment to address short term demand fluctuation in cellular network
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2018, izvirni znanstveni članek

Opis: In cellular network short term demand fluctuation is a very common phenomenon. The demand of any cell may increase or decrease slightly or the system may expand by adding additional cells or the system may shrink if the demands of certain number of cells become zero. In this paper, the perturbation-minimising frequency assignment problem (PMFAP) is considered to address the short term fluctuation in demand vector. PMFAP is a frequency assignment problem in which newly generated demands are satisfied with minimum changes in the already existing frequency assignment keeping all the interference constraints. In this paper, an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. With a slight modification to the proposed algorithm, it can solve the well-known frequency assignment problem (FAP) and its performance is also compared with the existing results using the standard benchmark data sets for FAP.
Ključne besede: short term demand fluctuation, frequency assignment problem, FAP, PMFAP, cellular network, perturbation, heuristic algorithm
Objavljeno v RUNG: 17.04.2023; Ogledov: 847; Prenosov: 0
Gradivo ima več datotek! Več...

7.
L (D, 2, 1)-labeling of Square Grid
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2019, izvirni znanstveni članek

Opis: For a fixed integer $D (\geq 3)$ and $\lambda$ $\in$ $\mathbb{Z}^+$, a $\lambda$-$L(D, 2, 1)$-$labeling$ of a graph $G = (V, E)$ is the problem of assigning non-negative integers (known as labels) from the set $\{0, \ldots, \lambda\}$ to the vertices of $G$ such that if any two vertices in $V$ are one, two and three distance apart from each other then the assigned labels to these vertices must have a difference of at least $D$, 2 and 1 respectively. The vertices which are at least $4$ distance apart can receive the same label. The minimum value among all the possible values of $\lambda$ for which there exists a $\lambda$-$L(D, 2, 1)$-$labeling$ is known as the labeling number. In this paper $\lambda$-$L(D, 2 ,1)$-$labeling$ of square grid is considered. The lower bound on the labeling number for square grid is presented and a formula for $\lambda$-$L(D, 2 ,1)$-$labeling$ of square grid is proposed. The correctness proof of the proposed formula is given here. The upper bound of the labeling number obtained from the proposed labeling formula for square grid matches exactly with the lower bound of the labeling number.
Ključne besede: Graph labeling, Square grid, Labeling number, Frequency assignment problem (FAP)
Objavljeno v RUNG: 17.04.2023; Ogledov: 850; Prenosov: 0
Gradivo ima več datotek! Več...

8.
No-hole λ-L (k, k – 1, …, 2,1)-labeling for square grid
Soumen Atta, Stanisław Goldstein, Priya Ranjan Sinha Mahapatra, 2017, izvirni znanstveni članek

Opis: Motivated by a frequency assignment problem, we demonstrate, for a fixed positive integer k, how to label an infinite square grid with a possibly small number of integer labels, ranging from 0 to λ −1, in such a way that labels of adjacent vertices differ by at least k, vertices connected by a path of length two receive values which differ by at least k − 1, and so on. The vertices which are at least k + 1 distance apart may receive the same label. By finding a lower bound for λ, we prove that the solution is close to optimal, with approximation ratio at most 9/8. The labeling presented is a no-hole one, i.e., it uses each of the allowed labels at least once.
Ključne besede: graph labeling, labeling number, no-hole labeling, square grid, frequency assignment problem, approximation ratio
Objavljeno v RUNG: 17.04.2023; Ogledov: 847; Prenosov: 0
Gradivo ima več datotek! Več...

9.
10.
Determination of Fe(III) and Fe(II) in natural waters using passive DGT samplers and non-destructive BDS analysis
Hanna Budasheva, Dorota Korte, Arne Bratkič, Mladen Franko, 2019, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: Beam Deflection Spectrometry, iron species, Diffusive Gradients in Thin-films, frequency scanning
Objavljeno v RUNG: 30.09.2019; Ogledov: 3416; Prenosov: 0
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.06 sek.
Na vrh