Lower bounds for the minimum span frequency assignment problem in cellular networks.

Date

2001

Author

Karadeniz, Barış

Metadata

Show full item record

Item Usage Stats

54
views

0
downloads

URI

https://hdl.handle.net/11511/12279

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Improving results on the pseudorandomness of sequences generated via the additive order of a finite field Merai, Laszlo; Yayla, Oğuz (2015-11-01) We improve several results in the area of pseudorandom sequences. First, we obtain an improved bound on the general lattice test for digital explicit inversive and digital explicit nonlinear pseudorandom number generators. Second, we improve the bound on the correlation measure of binary sequences generated by the quadratic character of finite fields. Finally, we improve the bound on the correlation measure of digital explicit inversive pseudorandom numbers, and the bound on their linear complexity profile.
Important issues for brain connectivity modelling by discrete dynamic bayesian networks. Geduk, Salih; Ulusoy, İlkay; Department of Electrical and Electronics Engineering (2020) To understand the underlying neural mechanisms in the brain, effective connectivity among brain regions is important. Discrete Dynamic Bayesian Networks (dDBN) have been proposed to model the brain’s effective connectivity, due to its nonlinear and probabilistic nature. In modeling brain connectivity using discrete dynamic Bayesian network (dDBN), we need to make sure that the model accurately reflects the internal brain structure in spite of limited neuroimaging data. Based on the fact that there are many ...
Practical Methods for Wireless Network Coding With Multiple Unicast Transmissions Aktas, Tugcan; Yılmaz, Ali Özgür; AKTAŞ, EMRE (2013-03-01) We propose a simple yet effective wireless network coding and decoding technique for a multiple unicast network. It utilizes spatial diversity through cooperation between nodes which carry out distributed encoding operations dictated by generator matrices of linear block codes. In order to exemplify the technique, we make use of greedy codes over the binary field and show that the arbitrary diversity orders can be flexibly assigned to nodes. Furthermore, we present the optimal detection rule for the given m...
Numerical Implementation of Equivalence Principle Algorithm for Potentials Farshkaran, Ali; Ergül, Özgür Salih (2018-07-13) We present a novel implementation of the equivalence principle algorithm (EPA) applied to the recently developed potential integral equations (PIEs) for low-frequency problems involving perfect electric conductors. The equivalence integral equations are generalized and updated by including potentials, making it possible to use PIEs to formulate inner problems. The stability of the implementation is demonstrated on canonical objects.
Numerical solutions of two point boundary value problems. Karakaş, Özlem; Department of Mathematics (1992)

Citation Formats

B. Karadeniz, “Lower bounds for the minimum span frequency assignment problem in cellular networks.,” Middle East Technical University, 2001.