Propagation modelling and resource allocation in mobile radio communications

Over the past years, ray tracing (RT) models popularity has been increasing. From the nineties, RT has been used for field prediction in environment such as indoor and urban environments. Nevertheless, with the advent of new technologies, the channel model has become decidedly more dynamic and to perform RT simulations at each discrete time instant become computationally expensive. In this thesis, a new dynamic ray tracing (DRT) approach is presented in which from a single ray tracing simulation at an initial time t0, through analytical formulas we are able to track the motion of the interaction points. The benefits that this approach bring are that Doppler frequencies and channel prediction can be derived at every time instant, without recurring to multiple RT runs and therefore shortening the computation time. DRT performance was studied on two case studies and the results shows the accuracy and the computational gain that derives from this approach. Another issue that has been addressed in this thesis is the licensed band exhaustion of some frequency bands. To deal with this problem, a novel unselfish spectrum leasing scheme in cognitive radio networks (CRNs) is proposed that offers an energy-efficient solution minimizing the environmental impact of the network. In addition, a network management architecture is introduced and resource allocation is proposed as a constrained sum energy efficiency maximization problem. System simulations demonstrate an increment in the energy efficiency of the primary users’ network compared with previously proposed algorithms.

Web GIS to support irrigation management: a prototype for SAGRA network, Alentejo Portugal

Dissertation submitted in partial fulfilment of the requirements for the Degree of Master of Science in Geospatial Technologies

Enterprise information portals: potential for evaluating research for knowledge management and human capital assets using social network analysis

Paper presented at the ECKM 2010 – 11th European Conference on Knowledge Management, 2-3 September, 2010, Famalicão, Portugal. URL: http://www.academic-conferences.org/eckm/eckm2010/eckm10-home.htm

Network revenue management with product-specific no-shows

Revenue management practices often include overbooking capacity to account for customerswho make reservations but do not show up. In this paper, we consider the network revenuemanagement problem with no-shows and overbooking, where the show-up probabilities are specificto each product. No-show rates differ significantly by product (for instance, each itinerary andfare combination for an airline) as sale restrictions and the demand characteristics vary byproduct. However, models that consider no-show rates by each individual product are difficultto handle as the state-space in dynamic programming formulations (or the variable space inapproximations) increases significantly. In this paper, we propose a randomized linear program tojointly make the capacity control and overbooking decisions with product-specific no-shows. Weestablish that our formulation gives an upper bound on the optimal expected total profit andour upper bound is tighter than a deterministic linear programming upper bound that appearsin the existing literature. Furthermore, we show that our upper bound is asymptotically tightin a regime where the leg capacities and the expected demand is scaled linearly with the samerate. We also describe how the randomized linear program can be used to obtain a bid price controlpolicy. Computational experiments indicate that our approach is quite fast, able to scale to industrialproblems and can provide significant improvements over standard benchmarks.

A randomized concave programming method for choice network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.

A tractable consideration set structure for network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing from an offerset, have recently become popular in assortment optimization and revenue management. The dynamicprogram for these models is intractable and approximated by a deterministic linear program called theCDLP which has an exponential number of columns. When there are products that are being consideredfor purchase by more than one customer segment, CDLP is difficult to solve since column generationis known to be NP-hard. However, recent research indicates that a formulation based on segments withcuts imposing consistency (SDCP+) is tractable and approximates the CDLP value very closely. In thispaper we investigate the structure of the consideration sets that make the two formulations exactly equal.We show that if the segment consideration sets follow a tree structure, CDLP = SDCP+. We give acounterexample to show that cycles can induce a gap between the CDLP and the SDCP+ relaxation.We derive two classes of valid inequalities called flow and synchronization inequalities to further improve(SDCP+), based on cycles in the consideration set structure. We give a numeric study showing theperformance of these cycle-based cuts.

Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management

The network revenue management (RM) problem arises in airline, hotel, media,and other industries where the sale products use multiple resources. It can be formulatedas a stochastic dynamic program but the dynamic program is computationallyintractable because of an exponentially large state space, and a number of heuristicshave been proposed to approximate it. Notable amongst these -both for their revenueperformance, as well as their theoretically sound basis- are approximate dynamic programmingmethods that approximate the value function by basis functions (both affinefunctions as well as piecewise-linear functions have been proposed for network RM)and decomposition methods that relax the constraints of the dynamic program to solvesimpler dynamic programs (such as the Lagrangian relaxation methods). In this paperwe show that these two seemingly distinct approaches coincide for the network RMdynamic program, i.e., the piecewise-linear approximation method and the Lagrangianrelaxation method are one and the same.

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

On bounds for network revenue management

The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear programming (DLP) model, and a simulation based method, the randomized linear programming (RLP) model. Both methods give upper bounds on the optimal solution value (DLP and PHLP respectively). These bounds are used to provide control values that can be used in practice to make accept/deny decisions for booking requests. Recently Adelman [1] and Topaloglu [18] have proposed alternate upper bounds, the affine relaxation (AR) bound and the Lagrangian relaxation (LR) bound respectively, and showed that their bounds are tighter than the DLP bound. Tight bounds are of great interest as it appears from empirical studies and practical experience that models that give tighter bounds also lead to better controls (better in the sense that they lead to more revenue). In this paper we give tightened versions of three bounds, calling themsAR (strong Affine Relaxation), sLR (strong Lagrangian Relaxation) and sPHLP (strong Perfect Hindsight LP), and show relations between them. Speciffically, we show that the sPHLP bound is tighter than sLR bound and sAR bound is tighter than the LR bound. The techniques for deriving the sLR and sPHLP bounds can potentially be applied to other instances of weakly-coupled dynamic programming.

An enhanced concave program relaxation for choice network revenue management

The network choice revenue management problem models customers as choosing from an offer-set, andthe firm decides the best subset to offer at any given moment to maximize expected revenue. The resultingdynamic program for the firm is intractable and approximated by a deterministic linear programcalled the CDLP which has an exponential number of columns. However, under the choice-set paradigmwhen the segment consideration sets overlap, the CDLP is difficult to solve. Column generation has beenproposed but finding an entering column has been shown to be NP-hard. In this paper, starting with aconcave program formulation based on segment-level consideration sets called SDCP, we add a class ofconstraints called product constraints, that project onto subsets of intersections. In addition we proposea natural direct tightening of the SDCP called ?SDCP, and compare the performance of both methodson the benchmark data sets in the literature. Both the product constraints and the ?SDCP method arevery simple and easy to implement and are applicable to the case of overlapping segment considerationsets. In our computational testing on the benchmark data sets in the literature, SDCP with productconstraints achieves the CDLP value at a fraction of the CPU time taken by column generation and webelieve is a very promising approach for quickly approximating CDLP when segment consideration setsoverlap and the consideration sets themselves are relatively small.

Management of adenoid cystic carcinoma of the breast: a Rare Cancer Network study.

BACKGROUND: Mammary adenoid cystic carcinoma (ACC) is a rare breast cancer. The aim of this retrospective study was to assess prognostic factors and patterns of failure, as well as the role of radiation therapy (RT), in ACC.¦METHODS: Between January 1980 and December 2007, 61 women with breast ACC were treated at participating centers of the Rare Cancer Network. Surgery consisted of lumpectomy in 41 patients and mastectomy in 20 patients. There were 51(84%) stage pN0 and 10 stage cN0 (16%) patients. Postoperative RT was administered to 40 patients (35 after lumpectomy, 5 after mastectomy).¦RESULTS: With a median follow-up of 79 months (range, 6-285), 5-year overall and disease-free survival rates were 94% (95% confidence interval [CI], 88%-100%) and 82% (95% CI, 71%-93%), respectively. The 5-year locoregional control (LRC) rate was 95% (95% CI, 89%-100%). Axillary lymph node dissection or sentinel node biopsy was performed in 84% of cases. All patients had stage pN0 disease. In univariate analysis, survival was not influenced by the type of surgery or the use of postoperative RT. The 5-year LRC rate was 100% in the mastectomy group versus 93% (95% CI, 83%-100%) in the breast-conserving surgery group, respectively (p = 0.16). For the breast-conserving surgery group, the use of RT significantly correlated with LRC (p = 0.03); the 5-year LRC rates were 95% (95% CI, 86%-100%) for the RT group versus 83% (95% CI, 54%-100%) for the group receiving no RT. No local failures occurred in patients with positive margins, all of whom received postoperative RT.¦CONCLUSION: Breast-conserving surgery is the treatment of choice for patients with ACC breast cancer. Axillary lymph node dissection or sentinel node biopsy might not be recommended. Postoperative RT should be proposed in the case of breast-conserving surgery.

On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management

The choice network revenue management (RM) model incorporates customer purchase behavioras customers purchasing products with certain probabilities that are a function of the offeredassortment of products, and is the appropriate model for airline and hotel network revenuemanagement, dynamic sales of bundles, and dynamic assortment optimization. The underlyingstochastic dynamic program is intractable and even its certainty-equivalence approximation, inthe form of a linear program called Choice Deterministic Linear Program (CDLP) is difficultto solve in most cases. The separation problem for CDLP is NP-complete for MNL with justtwo segments when their consideration sets overlap; the affine approximation of the dynamicprogram is NP-complete for even a single-segment MNL. This is in contrast to the independentclass(perfect-segmentation) case where even the piecewise-linear approximation has been shownto be tractable. In this paper we investigate the piecewise-linear approximation for network RMunder a general discrete-choice model of demand. We show that the gap between the CDLP andthe piecewise-linear bounds is within a factor of at most 2. We then show that the piecewiselinearapproximation is polynomially-time solvable for a fixed consideration set size, bringing itinto the realm of tractability for small consideration sets; small consideration sets are a reasonablemodeling tradeoff in many practical applications. Our solution relies on showing that forany discrete-choice model the separation problem for the linear program of the piecewise-linearapproximation can be solved exactly by a Lagrangian relaxation. We give modeling extensionsand show by numerical experiments the improvements from using piecewise-linear approximationfunctions.

Radio Resource Management across UMTS Radio Network Subsystems

UMTS (Universal Mobile Telecommunication System), esimerkkinä kolmannen sukupolven matkapuhelinjärjestelmästä pyrkii toistamaan GSM:n (Global System for Mobile Communications) menestyksen. UMTS:n kaupallinen toiminta on parhaillaan alkamassa ja ensimmäinen kaupallinen verkko on jo aloittanut toimintansa Japanissa. Tämä diplomityö antaa yleiskuvan UMTS:stä keskittyen radioverkkojärjestelmän (UMTS Terrestrial Radio Access Network,UTRAN) radioresurssien hallintaan (Radio Resource Management, RRM). Työssä kuvataan radiorajapintojen toimintaa, mutta diplomityön pääaiheena on kuitenkin radioresurssien hallinta UMTS radioaliverkkojärjestelmien ylitse. Radioresurssien hallinta pitää sisällään joukon proseduureja, jotka vaikuttavat koko UTRAN:in rakenteen lävitse. On hyvin tärkeää saavuttaa oikea toiminnallisuus hajautettujen radioresurssien hallintaan jotta voitaisiin saavuttaa paras yhteyden laatu loppukäyttäjälle. Työssä käydään yksityiskohtaisesti lävitse radioresurssien hallinnan perusperiaatteet ja joukko proseduureja. RNSAP (Radio Network Subsystem Application Part) protokollaa tarkastellaan työssä esimerkkinä protokollasta joka osallistuu radioresurssien hallintaprosessiin.

Transport Resource Management within UMTS Radio Network Subsystem

Tällä hetkellä haastavin telekommunikaatioteollisuuden tutkimus – ja kehitystoiminta on keskittynyt kolmannen sukupolven matkapuhelinjärjestelmien ympärille. Järjestelmien standardointityössä on saatu aikaiseksi ensimmäiset vakaat spesifikaatioversiot ja kaupallista toimintaa ollaan parhaillaan aloittelemassa Japanissa ja Euroopassa. Eräs kolmannen sukupolven järjestelmistä on UMTS (Universal Mobile Telecommunications System). Tämä diplomityö antaa yleiskuvan UMTS järjestelmästä ja sen eri verkkoelementtien toiminnallisuuksista. Päähuomio on kiinnitetty radioverkkojärjestelmään (UMTS Terrestrial Radio Access Network) ja erityisesti sen radioaliverkkojärjestelmään (Radio Network Subsystem), joka koostuu radioverkonohjaimesta (Radio Network Controller) ja joukosta siihen kuuluvia tukiasemia (Node B). Radioverkonohjain ja tukiasemat on yhdistetty avoimen rajapinnan kautta jota kutsutaan Iub -rajapinnaksi. Rajapinta tarjoaa radioverkonohjaimelle mahdollisuuden kontrolloida tukiasemia signalointiviestien avulla ja mahdollistaa tehokkaan ja luotettavan käyttäjätiedon siirron radioaliverkkojärjestelmän sisällä. Tämän diplomityön pääasiallinen sisältö on siirtoresurssien hallinta Iub -rajapinnan ylitse. Työssä esitellään ja selitetään siirtoverkon arkkitehtuuri. Myös kaikki Iub:ssä sijaitsevat protokollat ja toiminnalliset yksiköt jotka vaikuttavat siirtoresurssien hallintaan esitellään ja kuvataan yksityiskohtaisesti. Päähuomio on kiinnitetty sovellusprotokolliin sekä rajapinnan siirtoverkko- että radioverkkokerroksella sekä näiden protokollien väliseen vuorovaikutukseen. Kyseiset protokollat ovat Node B Application Part (NBAP) ja Access Link Control Application Part (ALCAP). Työn toteutusosassa käydään lävitse NBAP –protokollan prototyypin ja Node B Manager –toiminnallisen yksikön prototyypin implementaatio.

Considering tourist perceptions and network configuration in destination management

The competitiveness of tourism destinations is a relevant issue for tourism studies, moreso, is a key element on the daily basis of tourism destinations. In this sense, the management of tourism destinations is essential to maintain competitive advantages. In this article tourism destination is considered as a relational network, where interaction and cooperation is needed among tourist agents, to achieve major levels of competitive advantage and a more effective destination management system. In addition, the perceptions of tourists are obtained from two main sources. The first one is the social construction of a tourism destination previous to the visit and the second one is obtained from the interaction between tourists and tourism destination agents during the visit. In this sense, the management of tourism destination to emit a homogenous and collective image is a factor that can reduce the gap if dissatisfaction from the previous and real tourist perception. The discussion is centered on the relationship within a destination, between the supply network and the targeted demand, considering these two approaches jointly, to benefit destination management. The main result is a conceptual model that shows how tourism agents and tourists in the tourism destination interact to improve the destination competitiveness