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 / 23
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
1.
An improved harmony search algorithm using opposition-based learning and local search for solving the maximal covering location problem
Soumen Atta, 2023, izvirni znanstveni članek

Opis: In this article, an improved harmony search algorithm (IHSA) that utilizes opposition-based learning is presented for solving the maximal covering location problem (MCLP). The MCLP is a well-known facility location problem where a fixed number of facilities are opened at a given potential set of facility locations such that the sum of the demands of customers covered by the open facilities is maximized. Here, the performance of the harmony search algorithm (HSA) is improved by incorporating opposition-based learning that utilizes opposite, quasi-opposite and quasi-reflected numbers. Moreover, a local search heuristic is used to improve the performance of the HSA further. The proposed IHSA is employed to solve 83 real-world MCLP instances. The performance of the IHSA is compared with a Lagrangean/surrogate relaxation-based heuristic, a customized genetic algorithm with local refinement, and an improved chemical reaction optimization-based algorithm. The proposed IHSA is found to perform well in solving the MCLP instances.
Ključne besede: maximal covering location problem, harmony search algorithm, opposition-based learning, facility location problem, opposite number
Objavljeno v RUNG: 05.10.2023; Ogledov: 551; Prenosov: 6
.pdf Celotno besedilo (2,69 MB)
Gradivo ima več datotek! Več...

2.
Does grammatical number support the acquisition of number words?
Anna Shusterman, Abigail Seevak, Petra Mišmaš, Franc Marušič, Rok Žaucer, 2023, objavljeni znanstveni prispevek na konferenci

Ključne besede: Slovenian, grammatical number, acquisition, number words, dual
Objavljeno v RUNG: 21.07.2023; Ogledov: 671; Prenosov: 2
URL Povezava na datoteko
Gradivo ima več datotek! Več...

3.
L(4, 3, 2, 1)-Labeling for Simple Graphs
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2015, objavljeni znanstveni prispevek na konferenci

Opis: An L(4, 3, 2, 1)-labeling of a graph is a function which assigns label to each vertex of the graph such that if two vertices are one, two, three and four distance apart then assigned labels must have a difference of at least 4, 3, 2 and 1 respectively between them. This paper presents L(4, 3, 2, 1)-labeling number for simple graphs such as complete graphs, complete bipartite graphs, stars, paths and cycles. This paper also presents an L(4, 3, 2, 1)-labeling algorithm for paths which is optimal for paths on n≥7 vertices.
Ključne besede: L(4, 3, 2, 1)-labeling, Labeling number, Graph labeling, Channel assignment problem
Objavljeno v RUNG: 05.06.2023; Ogledov: 570; Prenosov: 0
Gradivo ima več datotek! Več...

4.
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: 619; Prenosov: 0
Gradivo ima več datotek! Več...

5.
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: 611; Prenosov: 0
Gradivo ima več datotek! Več...

6.
Investigation of Slovenian copular agreement
Franc Marušič, Rok Žaucer, 2021, objavljeni znanstveni prispevek na konferenci

Opis: This paper reports on a detailed investigation of agreement inside simple predicative sentences. In this type of sentence, both noun phrases are in the nominative, so in principle either one can trigger agreement on the copular verb. We examine various types of copular contructions and show that regardless of the type of predicative sentence, when a plural is combined with a singular, it is always the plural that agrees. Similarly, when a dual is combined with a singular, the dual wins out. But when we combine a dual and a plural, the copula can agree with either of the two noun phrases, with a preference for the noun phrase following the copula. We discuss the relevance of these findings for recent literature on predication.
Ključne besede: agreement, copula, number, singular, dual, plural, Slovenian
Objavljeno v RUNG: 31.01.2022; Ogledov: 1549; Prenosov: 0
Gradivo ima več datotek! Več...

7.
Number in Slovenian Copular Clauses
Rok Žaucer, vabljeno predavanje na konferenci brez natisa

Ključne besede: number, dual, copular clauses, agreement, Slovenian
Objavljeno v RUNG: 23.09.2021; Ogledov: 1592; Prenosov: 0
Gradivo ima več datotek! Več...

8.
Pseudopartitives vs. agreement attraction : an experimental study
Greta Mazzaggio, Ludovico Franco, M. Rita Manzini, 2020, izvirni znanstveni članek

Opis: Pseudopartitive constructions are constructions of the form DP-of-NP, where the quantificational, collective or container DP head is interpreted as measuring the embedded NP. A verb can agree either with the head (Head Agreement) or with the embedded NP (Embedded Agreement). We argue that agreement alternations with pseudopartitives form part of lin- guistic competence. Specifically, we account for them in terms of a dual la- belling option open to of -DP/NP constituents, as either PPs (of projecting) or as NPs (of not projecting). Thus, we reject the conclusion that pseudopar- titives are to be accounted for in processing terms, and wholly subsumed un- der agreement attraction. In two studies, we investigate subject-verb num- ber agreement (Study 1, N = 103) and gender agreement (Study 2, N = 87), in an acceptability task with pseudopartitive constructions involving either a collective noun or an approximate quantifier, controlling for the nature of the head. Results show that Italian pseudopartitives allows embedded agree- ment, depending on the speaker and on the nature of the head (quantifiers better than collective Ns).
Ključne besede: pseudopartitives, agreement, number, gender, agreement at- traction
Objavljeno v RUNG: 17.09.2021; Ogledov: 1442; Prenosov: 0
Gradivo ima več datotek! Več...

9.
Dual in Slovenian
Franc Marušič, Rok Žaucer, 2021, samostojni znanstveni sestavek ali poglavje v monografski publikaciji

Opis: Slovenian is one of only three contemporary Slavic languages that productively uses the dual. The other two are Upper and Lower Sorbian. In this chapter, we will outline the present-day use of the dual in Slovenian, generally ignoring historical aspects, for which see, i.a., Tesnière (1925a), Belić (1934), Jakop (2008), Olander (2015). Also, the description will primarily be based on standard Slovenian as described/prescribed in Toporišič et al. (2001), mainly ignoring the great variation across different varieties of Slovenian (cf. Tesnière 1925a,b, Jakop 2008) in the actual forms of dual marking and the extent to which dual forms are distinct from the plural. The paradigms presented in the next section exist in entirety only in few dialects and in the prescribed standard variety. A small number of dialects of the South West, along the border between Italy and Slovenia, and the dialects of the South, along the border with Croatia, are without most of the dual forms and in some cases without the dual altogether, but for the most part, different dialects exhibit different amounts of dual forms. Central Slovenian dialects and dialects of the North and North-East use dual fully productively (cf. Jakop 2008 and Marušič et al. 2016 for a comprehensive map of the distribution of dual in Slovenian dialects).
Ključne besede: Slovenian, grammatical number, dual, meaning of dual
Objavljeno v RUNG: 13.08.2021; Ogledov: 1550; Prenosov: 0
Gradivo ima več datotek! Več...

10.
Elucidating local pollution and site representativeness at the Jungfraujoch, Switzerland through parallel aerosol measurements at an adjacent mountain ridge
Nicolas Bukowiecki, Benjamin Brem, Günther Wehrle, Griša Močnik, Stéphane Affolter, Markus Christian Leuenberger, Martine Collaud Coen, Maxime Hervo, Urs Baltensperger, Martin Gysel, 2021, izvirni znanstveni članek

Opis: Many long-term air pollution and climate monitoring stations face the issue of increasing anthropogenic activities in their vicinity. Furthermore, the spatial representativeness of the sites is often not entirely understood especially in mountainous terrain with complex topographic features. This study presents a 5-year comparison of parallel aerosol measurements (total particle number concentration and equivalent black carbon mass concentration) at the Jungfraujoch in the Swiss Alps (JFJ, 3580 m a.s.l.), and an adjacent mountain ridge, the Jungfrau East Ridge (JER, 3705 m a.s.l.), in 1000 m air-line distance to the main site. The parallel aerosol measurements reveal characteristic differences in the diurnal variations between the two sites under certain specific meteorological conditions. Our analysis estimates that on 20-40% of the days local activities at the Jungfraujoch have a clear influence on the measured time series of the total aerosol number concentration and the equivalent black carbon mass concentration. This influence is mainly seen in form of strong isolated spikes rather than by an increase in the on-site background concentration. They can thus be flagged during the data quality assurance process and filtered from those measurement parameters available at high time resolution. Removing the spikes from the original time series results in daily mean values for the total aerosol number concentration and equivalent black carbon mass concentration that are 5-10 % lower compared to the original signals. During nighttime with hardly any local pollution sources that cause spikes this percentage decreases towards 0%. The signal baselines at the Jungfraujoch and Jungfrau East Ridge correlate well during more than 50% of the days.
Ključne besede: aerosol long-term monitoring, equivalent black carbon, aerosol number concentration, spatial variation
Objavljeno v RUNG: 15.03.2021; Ogledov: 1772; Prenosov: 70
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.06 sek.
Na vrh