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


11 - 20 / 42
Na začetekNa prejšnjo stran12345Na naslednjo stranNa konec
11.
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: 722; Prenosov: 0
Gradivo ima več datotek! Več...

12.
A new variant of the p-hub location problem with a ring backbone network for content placement in VoD services
Soumen Atta, Goutam Sen, 2021, izvirni znanstveni članek

Opis: In this article, the single allocation p-hub location problem (SApHLP) with a ring backbone network for content placement in VoD services is proposed. In VoD services, a large volume of digital data is kept as data segments in spatially distributed hubs. In SApHLP, each user is restricted to be allocated only to a single hub, and here hubs form a ring backbone network. SApHLP jointly addresses (i) the locations of hubs, (ii) the placement of segments to hubs, (iii) the allocation of users to hubs as per their demands, and (iv) the optimal paths to route the demands from users to hubs. We have introduced network flow-based 3-subscripted and path-based 4-subscripted MILP formulations of SApHLP. This article presents a novel discrete particle swarm optimization (PSO)-based approach where factoradic numbers are used to encode solution. It also incorporates three problem-specific solution refinement methods for faster convergence. In this article, SApHLP instances are generated from a real-world database of video files obtained from a movie recommender system. The benchmark solutions are generated using IBM’s CPLEX optimizer with default settings and Benders decomposition strategy. The performance of the proposed PSO is compared with the benchmark results produced by CPLEX.
Ključne besede: Single allocation p-hub location problem, Ring backbone network, VoD services, Particle Swarm Optimization (PSO), Factoradics, CPLEX
Objavljeno v RUNG: 17.04.2023; Ogledov: 758; Prenosov: 0
Gradivo ima več datotek! Več...

13.
Time-of-flight photoconductivity investigation of high charge carrier mobility in ▫$Ti_3C_2T_x$▫ MXenes thin-film
Jurij Urbančič, Erika Tomsic, Manisha Chhikara, Nadiia Pastukhova, Vadym Tkachuk, Alex Dixon, Andraž Mavrič, Payam Hashemi, Davood Sabaghi, Ali Shaygan Nia, Gvido Bratina, Egon Pavlica, 2023, izvirni znanstveni članek

Opis: Charge transport through a randomly oriented multilayered network of two-dimensional (2D) Ti3C2Tx (where Tx is the surface termination and corresponds to O, OH and F) was studied using time-of-flight photoconductivity (TOFP) method, which is highly sensitive to the distribution of charge carrier velocities. We prepared samples comprising Ti3C2Tx with thickness of 12 nm or 6-monolayers. MXene flakes of size up to 16 μm were randomly deposited on the surface by spin-coating from water solution. Using TOFP, we have measured electron mobility that reached values up to 279 cm2/Vs and increase with electric-field in a Poole-Frenkel manner. These values are approximately 50 times higher than previously reported field-effect mobility. Interestingly, our zero-electric-field extrapolate approaches electron mobility measured using terahertz absorption method, which represents intra-flake transport. Our data suggest that macroscopic charge transport is governed by two distinct mechanisms. The high mobility values are characteristic for the intra-flake charge transport via the manifold of delocalized states. On the other hand, the observed Poole-Frenkel dependence of charge carrier mobility on the electric field is typical for the disordered materials and suggest the existence of an important contribution of inter-flake hopping to the overall charge transport.
Ključne besede: charge transport, multilayered network, flakes, time-of-flight photoconductivity, MXene exfoliation, high-mobility solution-cast thin-film, semiconducting MXene
Objavljeno v RUNG: 31.03.2023; Ogledov: 1124; Prenosov: 3
.pdf Celotno besedilo (1,97 MB)

14.
15.
Connectivity reliability in uncertain networks with stability analysis
Ahmad Hosseini, Eddie Wadbro, 2016, izvirni znanstveni članek

Ključne besede: Traffic network, Uncertainty theory, Reliability, Chance-constrained, Stability analysis
Objavljeno v RUNG: 14.02.2023; Ogledov: 876; Prenosov: 0
Gradivo ima več datotek! Več...

16.
An Addendum on Postoptimality of Maximally Reliable Path
Ahmad Hosseini, Bita Kabir Baiki, 2017, izvirni znanstveni članek

Ključne besede: Network theory, Maximally reliable path
Objavljeno v RUNG: 14.02.2023; Ogledov: 791; Prenosov: 0
Gradivo ima več datotek! Več...

17.
An introduction to dynamic generative networks: Minimum cost flow
Ahmad Hosseini, 2011, izvirni znanstveni članek

Ključne besede: Optimization, Network/graphs, Linear programming, Decomposition methods
Objavljeno v RUNG: 14.02.2023; Ogledov: 810; Prenosov: 0
Gradivo ima več datotek! Več...

18.
On Stability of Widest Path in Network Routing
Ahmad Hosseini, Bita Kabir Baiki, 2017, izvirni znanstveni članek

Ključne besede: Operations research, Network routing, Path finding, Widest path
Objavljeno v RUNG: 14.02.2023; Ogledov: 785; Prenosov: 0
Gradivo ima več datotek! Več...

19.
20.
Iskanje izvedeno v 0.06 sek.
Na vrh