Spectrum Balancing for DSL with Restrictions on Maximum Transmit PSD
|
|
- Clemence Hines
- 8 years ago
- Views:
Transcription
1 Spectrm Balancing for DSL with Restrictions on Maximm Transmit PSD Driton Statovci, Tomas Nordström, and Rickard Nilsson Telecommnications Research Center Vienna (ftw.), Dona-City-Straße 1, A-1220 Vienna, Astria s:{statovci, nordstrom, Abstract The importance of a power spectral density (PSD) mask restriction is often overlooked when optimizing the spectrm sage for mltiser digital sbscriber lines (DSL) systems. However, by developing the optimization strategies based only on the PSD constraints (masks) we can tremendosly redce the comptation complexity compared to the methods only based on the total power restriction. In this paper we introdce a maskbased spectrm balancing () algorithm and demonstrate the near optimm performance of this optimization approach. Frthermore, we show that besides standards compliance, PSD restriction is also needed to ensre the convergence of iterative spectrm balancing methods, which se dal decomposition optimization. I. INTRODUCTION In recent years a nmber of spectrm balancing methods have been introdced for digital sbscriber line (DSL) systems in order to optimize the spectrm tilization for mltiser network scenarios. The problem is to design the transmit spectra for U DSL systems (sers) sharing a cable bndle and ths interfering with each other. This is typically described as an optimization problem where the aim is to the sm of weighted bitrates. Sch an optimization is sally constraint by some limits on the sed power. Two approaches exist: one is to restrict the total power and the other is to set a PSD mask where the power is restricted over freqency. These two approaches can also be combined. Since the introdction of DSL transmission techniqes, 20 years ago, standardization bodies have set both kinds of limits on the sed power. The total power limit is mostly aimed at redcing power consmption and lessening the demands on the analog front-end. The PSD limits are mostly set for radio freqency interference egress and to redce the distrbance of other (legacy) DSL systems. In all standards p till now, inclding the latest very high-speed DSL standard known as VDSL2, the total power nder the PSD mask aims to match the total power allowed. Therefore it seems reasonable to base the spectrm balancing optimization solely on the PSD mask instead on total power. Exploring this concept, we have developed a new spectrm balancing algorithms that we call mask-based spectrm balancing (). Frthermore, or motivation was driven by instability problems we have enconter when implementing the iterative spectrm balancing () [1], [2] which only ses a total power constraint. This work was partially financed by the Astrian Kpls program. When evalating spectrm balancing algorithms the network scenario (the nmber of sers and cable topology) might skew the reslts in varios directions. For example, if only two sers are selected (might be good for reasons like comptational convenience or being able to visalize the rate regions) methods that can emphasizes freqency division mltiplexing, like optimal spectrm balancing (OSB) [3] and, shines. If we instead have a scenario with many sers they will all fight for the sed freqencies and no one gets a freqency by itself, and the simple methods like iterative water-filling [4] or normalized-rate iterative algorithm [5] will do almost as well as the optimal ones. In this paper we will still se a two ser scenario. We do this mostly for rate region visalization reasons. This will be to the disadvantage of, as discssed above, and to or experience becomes even closer to the optimm when more sers are inclded into the simlation scenario. Another problem when doing these kind of evalations is that the largest benefit with OSB is for scenarios with long distance between nodes and when total power is tilized, that is, for long lines. Ths, few investigations has been made for realistic scenarios for cabinet deployed VDSL2 (max distance of m). However, when sch scenarios are tested, OSB and behaves nexpectedly and shows convergence problems. To highlight these problems and becase we think it is more realistic scenario, we will also simlate a VDSL2 cabinet deployment scenario with relatively short loops. The paper is strctred as follows. In the following section we show how to calclate bitrates in mltiser DSL environments and give a short introdction to the dal decomposition based optimization for DSL. Then in Section III we describe the need for PSD restriction and conseqences for not inclding it into optimization. In Section IV we describe or maskbased spectrm balancing () algorithm and following that we present some simlation reslts where we compare with. In the end we give some conclding remarks. II. PRELIMINARIES In this paper we will only analyze DSL systems that se a freqency division dplex (FDD) transmission scheme. For sch systems, based on Shannon s capacity formla the nmber of total bits that can be transmitted in a discrete mltitone (DMT) symbol (at a certain bit-error rate) for a particlar
2 ser is determined as R = ( log 1 + Hn P n ) ΓN n, with (1) n I N n = HvP n v n + P,V n, (2) v=1 v where I denotes the set of sbcarriers sed in a particlar transmission direction and it comprises N sbcarrier; Γ is the signal-to-noise ratio gap; N n, P n, P,V n denote the PSD of ser in sbcarrier n of noise, transmit signal, and the sm of backgrond and alien noises, respectively; Hv n denotes the sqared magnitde of channel transfer fnction from ser v to ser, i.e., it represents either the direct channel (with v = ), or far end crosstalk (FEXT) copling. As shown in [3], the optimization goal for DSL can be formlated as an optimization problem where the objective is to the sm of weighted bitrates: P n ;,n sbject to: w R, n I (3a) P n T max,, (3b) P n 0,, n I (3c) where w denotes the weighting vale (or short: weight ) assigned to ser and T max denotes the total power constraint for ser. Withot loss of generality, the weights can be selected sch that U w = 1. We increase the bitrate of ser compared to the bitrates of the other sers by increasing its w. The total power constraint T max is sally selected to be the same for all sers. To solve this constrained optimization problem, the total power constraint from (3b) is incorporated into the cost fnction (3a) by defining the Lagrangian fnction [6]: ) L = w R + ( λ T max n I P n, (4) where λ denotes the Lagrangian mltiplier of ser. Based on the definition of Lagrangian, the optimization problem (3) can be written as L(w, λ, P n ), (5a) P n;,n sbject to: P n 0,, n I λ 0,. (5b) (5c) By collecting the terms that belong to the same sbcarrier (4) can be rewritten as L = n I L n + λ T max, (6) where L n is the Lagrangian on sbcarrier n and is given by L n = w R n λ P n. (7) Sch an approach in optimization is known as dal decomposition, where the optimization is divided into N per-sbcarrier optimization sbproblems that are only related throgh the weighs w and Lagrangian mltipliers λ. This in fact leads to an optimization which has a complexity that scales linearly with the nmber of sbcarriers. However, note that solving directly optimization problem (5), as has been done in [3], still has an complexity that increases exponential with the nmber of sers (lines). From the theory of the Lagrangian fnctions it is known that at the convergence point, Lagrangian mltipliers will be selected sch that either the total power of ser satisfies n I Pn = T max or λ = 0. We achieve different bitrate combination among the sers by changing weights assigned to them. By trying ot all weights combination among the sers, we gain the bondary of the bitrate region. The reason for this is that by dal decomposition optimization only bitrates that lies on the rate region bondary can be fond, since only these bitrates the sm of weighted bitrates. III. THE NEED FOR CONSTRAINING THE PSD To solve the optimization problem (5) a nmber of algorithms have been proposed: optimm spectrm balancing (OSB) [3], iterative spectrm balancing () [1], [2], atonomos spectrm balancing (ASB) [7], and sccessive convex approximation for low-complexity (SCALE) [8]. For all these algorithms it is claimed that there is no need for the maximm transmit PSD mask constraint, since total power, is thoght to be sfficient to ensre the spectral compatibility among the DSL systems inclded into optimization. However, in this section we will show that this assmption might not be valid nder certain circmstances. De to low comptational complexity and performance almost identical to the OSB, iterative-based algorithms have received a special attention for spectrm balancing. Therefore, we will constraint orself to which works as follows: it iterates many times over all sers and in each iteration it s (7) for one ser while keeping the power allocation of all other sers fixed. At the end of each iteration the weight and Lagrangian mltiplier of the ser being optimized are pdated, cf. Algorithm 1. In the following discssions, we constraint orself to twoser case for easy explanations, bt all the claims made here are also valid for scenarios with mltiple sers. Now looking at the i-th iteration, for a two-ser case, the optimization problem for the first ser on a particlar sbcarrier n is constraint, T max 2 w R n sbject to: 0 2 λ P n, (8a) (8b)
3 As shown in [1], [2], the cost fnction (8a) is neither concave nor convex with respect to power allocation of the first ser P1 n. Therefore, the exhastive search is sed to find P1 n, which s (8a). Let s analyze the case when P2 n = 0. This occrs whenever the SNR of the second ser on the sbcarrier n is low either de to high noise level or high channel attenation. For this case, the optimization problem (8) becomes ( ) w 1 log sbject to: Hn 11 Γ,V λ 1 (9a) (9b) The second derivative of (9a) can be calclated in a closed form and it is eqal to ( w 1 (H11) n 2 ) 2. (10) ΓP1,V n + Hn 11 Pn 1 Since (10) is smaller than zero for 0 P1 n <, the cost fnction in (9a) is a concave fnction with respect to P1 n. For this case, there is still no need for a maximm transmit PSD mask constraint to ensre the convergence of. However, Proposition 1 below shows that in order to ensre convergence of in any network scenario we need to set-p a PSD mask constraint. Algorithm 1 Iterative Spectrm balancing as in [1] (Notation is adopted for this paper) Preset vales: R target, T max, λ, w, for = 1 to U do For each n: fix Pj n, j, then P n = arg max P n L n for n I as in (6) {Solve by 1-D exhastive search } Update: w = [ w + ɛ ( R target )] + n I Rn Update: λ = [ λ + ɛ ( n I P )] n T max + {[] + : constraint to non-negative nmbers} ntil convergence end for ntil the PSDs of all sers have reach a desired accracy Proposition 1: algorithm converges in any network scenario only if we set a maximm transmit PSD mask constraint. Proof: We will show that does not converge when both λ 1 = 0 and P2 n = 0 (after the proof we describe when sch a sitation arises). Note that for optimization problem (8) the same also holds when λ 2 = 0 and P1 n = 0. With the made assmptions, the optimization problem (9) becomes w 1 log ( sbject to: Hn 11 Γ,V ) (11a) (11b) The cost fnction (11a) is monotonically increasing on. Therefore, the optimization problem (11) achieves a maximm at =, and the search for it will not converge. Ths, to ensre the convergence of in any network scenario, we have to set a PSD mask constraint, which also concldes the proof. We describe now for which cases both λ 1 and P2 n get zero, based on s oter iterations (oter loop) as given in the psedo-code of Algorithm 1. Assme that in the (i 3)-th iteration, second ser performs power allocation and it tilizes all sbcarriers in set I. Frthermore, in (i 2)-th iteration, first ser does not tilize the total power to achieve a particlar target bitrate, R target 1 ; ths, λ 1 = 0. In (i 1)-th iteration, the second ser search for a new power allocation, and it does not se at least one sbcarrier. In (i)-th iteration, we start to calclate the optimal power allocation for the first ser with λ 1 = 0 and there is at least an n for the second ser which has P2 n = 0. IV. OPTIMIZATION UNDER A MAXIMUM PSD MASK CONSTRAINT As we have shown in Section III, the convergence of is only ensred if we set a maximm transmit PSD mask constraint in addition to the total power constraint. In this section we show that the optimization problem for DSL systems is tremendosly simplified if we select the total power constraint to be eqal to the power within the transmit PSD mask constraint. Under this assmption, the spectrm balancing optimization problem can be formlated as P n ;,n w R, (12a) sbject to: 0 P n P n,max,, n I, (12b) where P n,max denotes the maximm transmit PSD mask constraint for ser in sbcarrier n. Following this approach by setting a niqe transmit PSD mask constraint for each ser (line), we can inclde modems s implementation constraints into the optimization process. Frthermore, setting a niqe transmit PSD mask constraint for each ser does not increase the comptational complexity. However, sing the same maximm transmit PSD constraint for all sers is only a special case of optimization problem (12). Maximizing the bitrate in each sbcarrier independently also s the sm of bitrates over all sbcarrier. Therefore, the optimization problem (12) can be split into N persbcarrier optimization sbproblems by expressing the cost
4 fnction as w R = n I w R. n (13) Different methods have been proposed to search for the appropriate weighting vales w. Under the assmption that the target bitrates of all sers are known in advance (before rnning the algorithm), a sb-gradient method is proposed in [1]. Alternatively the algorithm in [5] ses bitrate relations in order to search for the weights withot any a priori knowledge on target bitrates. As the search for appropriate weights is not the focs of this paper we will in the following not search for the weights bt instead we vary them between 0 and 1 to pictre the complete rate region. The psedo-code of or proposed iterative scheme, which we call mask-based spectrm balancing (), is listed as Algorithm 2. The works as follows: For given weights and PSD mask constraints, it iterates many times over all sers and in each iteration it searches for the transmit PSD of a particlar ser that s the sm of weighted rates. which is only sed to ensre the convergence of in the light of discssion in Section III. For we have set a PSD mask constraint to 59 dbm/hz for all simlations. To have a fair comparison between and, the total power constraint by was set to be eqal to power within the PSD mask constraint in. All simlation are performed for the network scenario shown in Fig. 1 with only two sers. For sch two-ser case the bitrate region is two dimensional and is easy to draw conclsions from. Frthermore, to cover a broad range of network environments, simlations are done for the distance x between the modems eqal to: 200 m, 400 m, and 600 m. CO/Cabinet 1 x 1 2 Fig. 1. Simlation scenario with two sers. CO and x denote the central office and the distance between the modems, respectively. x 2 Algorithm 2 Mask-based spectrm balancing () Preset vales: w, P n,max,, n I {mask constraints} for = 1 to U do Calclate Noise N n for n I as in (2) P n = arg max P n w R n for n I as in (6) {Solve by 1-D exhastive search nder constraint (12b)} end for ntil the PSDs of all sers have reach a desired accracy Bitrate of 2 (Mbit/s) x=600 x=400 x=200 is not the first algorithm to state a PSD mask constraint. For example, the ser niqe power back-off (UUPBO) [9] solves a similar optimization problem as. However, it sets an constraint on maximm transmit PSDs in addition to the total power constraint. This ensres the convergence of UUPBO in any network scenario. V. SIMULATION RESULTS AND DISCUSSIONS In order to evalate the performance of or proposed algorithm, mask-based spectrm balancing () algorithm, simlations have been sed. Simlation parameters are taken according to ETSI VDSL standard [10]. Ths, we se Γ = 12.8 db as the SNR gap, and the band plan 997, which ses two pstream bands. Moreover, to take into accont the alien noise, in addition to the backgrond noise at 140 dbm/hz, we have also added the ETSI VDSL Noise A, which is also specified in [10]. We compare the performance of the with the iterative spectrm balancing () for the pstream transmission direction. For we have set a PSD mask constraint to 0 dbm/hz, Bitrate of 1 (Mbit/s) Fig. 2. Comparison of the rate regions between the MBS and for pstream transmission direction. Simlations are performed for the network scenario with two sers as in Fig. 1 and the distance x between the modems eqal to: 200 m, 400 m, and 600 m. From the simlation reslts presented in Fig. 2 it is obvios that otperform for these network scenarios. The reslts are not srprising, since ses more degrees of freedom and it tilizes them when searching for optimal transmit PSDs. In Table I a few, from Fig. 2, selected pairs of bitrates are shown. For the network scenario with x = 600 m we see in Fig. 2 that visibly otperforms when the operation point is selected on the left side of rate region. For the pairs of bitrates shown in Table I, otperforms by 6.6%. For this set of bitrates the transmit PSDs are shown in Fig. 3. The transmit PSDs of are always above the transmit PSDs of, which is also the reason why otperforms.
5 TABLE I COMPARISON OF THE WITH THE OSB FOR SOME PARTICULAR PAIRS OF BITRATES. PSD (dbm/hz) PSD (dbm/hz) Scenario User 1 User 2 Loss Algorithm (x in m) (Mbit/s) (Mbit/s) (%) Transmit PSD of Sbcarrier index Transmit PSD of Sbcarrier index Fig. 3. Upstream transmit PSDs of and for sers bitrates given in Table I for x = 600 m. On the other hand, for the network scenario with x = 400 m and x = 200 m, and show similar performance. For these pairs of bitrates shown in Table I, only otperforms by 2 to 3 percent. Frthermore, for x = 400 m the bondary of the rate regions for and as plotted are not convex. The reason for this effect is that the doble precision arithmetic, which is also sed dring simlations is not always sfficient to find every operation point on the bondary of the rate region. It is worth mentioning that this holds also for other spectrm balancing algorithms based on the dal decomposition optimization approach. Comparing the psedo-code of and, it becomes clear that reqires mch higher comptational complexity. To indicate the difference in complexity, the simlation time to get a pair of bitrates is 3 seconds for while (for fixed weights) reqires 114 seconds. VI. CONCLUSIONS This paper introdced a new spectrm balancing algorithm for mlti-ser DSL systems: the mask-based spectrm balancing () algorithm. The optimization by is only based on PSD masks constraint instead on the total power constraint as sed by other spectrm balancing algorithms. We have shown that an optimization approach based on PSD masks instead on the total power makes sense both from a comptational complexity and a stability point of view. The stability isse of commonly sed spectrm balancing methods is frther analyzed and we have proven that stability isses exist. Throgh simlations we have additionally shown that the inevitable loss by compared to the optimal schemes (de to less degrees of freedom) is kept very low and is only a few percent for scenarios with short loops (sitable for cabinet deployed VDSL2). This small loss shold be compared to the complexity redction of two magnitdes for compared to. REFERENCES [1] R. Cendrillon and M. Moonen, Iterative spectrm balancing for digital sbscriber lines, in 2005 IEEE International Conference on Commnications (ICC 2005), vol. 3, 2005, pp Vol. 3. [2] R. Li and W. Y, Low-complexity near-optimal spectrm balancing for digital sbscriber lines, in 2005 IEEE International Conference on Commnications (ICC 2005), vol. 3, 2005, pp Vol. 3. [3] R. Cendrillon, W. Y, M. Moonen, J. Verlinden, and T. Bostoen, Optimal mltiser spectrm balancing for digital sbscriber lines, Commnications, IEEE Transactions on, vol. 54, no. 5, pp , [4] W. Y, G. Ginis, and J. Cioffi, Distribted mltiser power control for digital sbscriber lines, Selected Areas in Commnications, IEEE Jornal on, vol. 20, no. 5, pp , [5] D. Statovci, T. Nordström, and R. Nilsson, The normalized-rate iterative algorithm: A practical dynamic spectrm management method for dsl, EURASIP Jornal on Applied Signal Processing, vol. 2006, pp. Article ID , 17 pages, [6] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004, N [7] J. Hang, R. Cendrillon, M. Chiang, and M. Moonen, Atonomos spectrm balancing (asb) for freqency selective interference channels, in Information Theory, 2006 IEEE International Symposim on, 2006, pp [8] J. Papandriopolos and J. Evans, Low-complexity distribted algorithms for spectrm balancing in mlti-ser dsl networks, in Commnications, ICC 06. IEEE International Conference on, vol. 7, 2006, pp [9] D. Statovci, T. Nordström, and Nilsson, Dynamic spectrm management for standardized VDSL, in IEEE International Conference on Acostics, Speech, and Signal Processing (ICASSP 2007), vol. 3, Honoll, Hawaii, USA, Apr. 2007, pp [10] ETSI, Transmission and Mltiplexing (TM); Access transmission systems on metallic access cables; Very high speed Digital Sbscriber Line (VDSL); Part 1: Fnctional reqirements, ETSI, Tech. Rep. TM6 TS , Version 1.3.1, Jl 2003.
ASAND: Asynchronous Slot Assignment and Neighbor Discovery Protocol for Wireless Networks
ASAND: Asynchronos Slot Assignment and Neighbor Discovery Protocol for Wireless Networks Fikret Sivrikaya, Costas Bsch, Malik Magdon-Ismail, Bülent Yener Compter Science Department, Rensselaer Polytechnic
More informationUsing GPU to Compute Options and Derivatives
Introdction Algorithmic Trading has created an increasing demand for high performance compting soltions within financial organizations. The actors of portfolio management and ris assessment have the obligation
More informationDSL Spectrum Management
DSL Spectrum Management Dr. Jianwei Huang Department of Electrical Engineering Princeton University Guest Lecture of ELE539A March 2007 Jianwei Huang (Princeton) DSL Spectrum Management March 2007 1 /
More informationResearch on Pricing Policy of E-business Supply Chain Based on Bertrand and Stackelberg Game
International Jornal of Grid and Distribted Compting Vol. 9, No. 5 (06), pp.-0 http://dx.doi.org/0.457/ijgdc.06.9.5.8 Research on Pricing Policy of E-bsiness Spply Chain Based on Bertrand and Stackelberg
More informationWHITE PAPER. Filter Bandwidth Definition of the WaveShaper S-series Programmable Optical Processor
WHITE PAPER Filter andwidth Definition of the WaveShaper S-series 1 Introdction The WaveShaper family of s allow creation of ser-cstomized filter profiles over the C- or L- band, providing a flexible tool
More informationGUIDELINE. Guideline for the Selection of Engineering Services
GUIDELINE Gideline for the Selection of Engineering Services 1998 Mission Statement: To govern the engineering profession while enhancing engineering practice and enhancing engineering cltre Pblished by
More informationResource Pricing and Provisioning Strategies in Cloud Systems: A Stackelberg Game Approach
Resorce Pricing and Provisioning Strategies in Clod Systems: A Stackelberg Game Approach Valeria Cardellini, Valerio di Valerio and Francesco Lo Presti Talk Otline Backgrond and Motivation Provisioning
More informationEvery manufacturer is confronted with the problem
HOW MANY PARTS TO MAKE AT ONCE FORD W. HARRIS Prodction Engineer Reprinted from Factory, The Magazine of Management, Volme 10, Nmber 2, Febrary 1913, pp. 135-136, 152 Interest on capital tied p in wages,
More informationOptimal Trust Network Analysis with Subjective Logic
The Second International Conference on Emerging Secrity Information, Systems and Technologies Optimal Trst Network Analysis with Sbjective Logic Adn Jøsang UNIK Gradate Center, University of Oslo Norway
More informationCRM Customer Relationship Management. Customer Relationship Management
CRM Cstomer Relationship Management Farley Beaton Virginia Department of Taxation Discssion Areas TAX/AMS Partnership Project Backgrond Cstomer Relationship Management Secre Messaging Lessons Learned 2
More informationDeploying Network Load Balancing
C H A P T E R 9 Deploying Network Load Balancing After completing the design for the applications and services in yor Network Load Balancing clster, yo are ready to deploy the clster rnning the Microsoft
More informationOptimal Transmit Spectra for Communication on Digital Subscriber Lines
Optimal Transmit Spectra for Communication on Digital Subscriber Lines Rohit V. Gaikwad and Richard G. Baraniuk Department of Electrical and Computer Engineering Rice University Houston, Texas, 77005 USA
More informationHow To Plan A Cloud Infrastructure
Concrrent Placement, Capacity Provisioning, and Reqest Flow Control for a Distribted Clod Infrastrctre Shang Chen, Yanzhi Wang, Massod Pedram Department of Electrical Engineering University of Sothern
More information3. DATES COVERED (From- To) Technical 4. TITLE AND SUBTITLE
REPORT DOCUMENTATION PAGE Form Approved OMB No. 0704-01-0188 l ne pblic reporting brden tor this collection of information is estimated to average 1 hor per response, inclding the time tor reviewing instrctions,
More informationCompensation Approaches for Far-field Speaker Identification
Compensation Approaches for Far-field Speaer Identification Qin Jin, Kshitiz Kmar, Tanja Schltz, and Richard Stern Carnegie Mellon University, USA {qjin,shitiz,tanja,rms}@cs.cm.ed Abstract While speaer
More informationEvolutionary Path Planning for Robot Assisted Part Handling in Sheet Metal Bending
Evoltionary Path Planning for Robot Assisted Part Handling in Sheet Metal Bending Abstract Xiaoyn Liao G. Gary Wang * Dept. of Mechanical & Indstrial Engineering, The University of Manitoba Winnipeg, MB,
More informationDIRECT TAX LAWS Taxability of Capital Gains on By-back of Shares - Debate ignites after AAR s rling in RST s case BACKGROUND 1. Recently, the Athority for Advance Rlings ( AAR ) in the case of RST, In
More informationCorporate performance: What do investors want to know? Innovate your way to clearer financial reporting
www.pwc.com Corporate performance: What do investors want to know? Innovate yor way to clearer financial reporting October 2014 PwC I Innovate yor way to clearer financial reporting t 1 Contents Introdction
More informationSample Pages. Edgar Dietrich, Alfred Schulze. Measurement Process Qualification
Sample Pages Edgar Dietrich, Alfred Schlze Measrement Process Qalification Gage Acceptance and Measrement Uncertainty According to Crrent Standards ISBN: 978-3-446-4407-4 For frther information and order
More informationOn a Generalized Graph Coloring/Batch Scheduling Problem
Reglar Papers On a Generalized Graph Coloring/Batch Schedling Problem Giorgio Lcarelli 1, Ioannis Milis Dept. of Informatics, Athens University of Economics and Bsiness, 104 34, Athens, Greece, {glc, milis}@aeb.gr
More informationA Spare Part Inventory Management Model for Better Maintenance of Intelligent Transportation Systems
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 A Spare Part Inventory Management Model for Better Maintenance of Intelligent
More informationHigh Availability for Internet Information Server Using Double-Take 4.x
High Availability for Internet Information Server Using Doble-Take 4.x High Availability for Internet Information Server Using Doble-Take 4.x pblished April 2000 NSI and Doble-Take are registered trademarks
More informationEMC VNX Series. EMC Secure Remote Support for VNX. Version VNX1, VNX2 300-014-340 REV 03
EMC VNX Series Version VNX1, VNX2 EMC Secre Remote Spport for VNX 300-014-340 REV 03 Copyright 2012-2014 EMC Corporation. All rights reserved. Pblished in USA. Pblished Jly, 2014 EMC believes the information
More informationPlanning an Active Directory Deployment Project
C H A P T E R 1 Planning an Active Directory Deployment Project When yo deploy the Microsoft Windows Server 2003 Active Directory directory service in yor environment, yo can take advantage of the centralized,
More informationf.airnet DECT over IP System
The modlar IP commnication system for voice and messaging with the greatest mobility: flexible, easy to maintain, expandable. Fnkwerk Secrity Commnications For s, efficient commnication is vital. New:
More informationHigh Availability for Microsoft SQL Server Using Double-Take 4.x
High Availability for Microsoft SQL Server Using Doble-Take 4.x High Availability for Microsoft SQL Server Using Doble-Take 4.x pblished April 2000 NSI and Doble-Take are registered trademarks of Network
More informationEnabling Advanced Windows Server 2003 Active Directory Features
C H A P T E R 5 Enabling Advanced Windows Server 2003 Active Directory Featres The Microsoft Windows Server 2003 Active Directory directory service enables yo to introdce advanced featres into yor environment
More informationCloser Look at ACOs. Designing Consumer-Friendly Beneficiary Assignment and Notification Processes for Accountable Care Organizations
Closer Look at ACOs A series of briefs designed to help advocates nderstand the basics of Accontable Care Organizations (ACOs) and their potential for improving patient care. From Families USA Janary 2012
More informationRegular Specifications of Resource Requirements for Embedded Control Software
Reglar Specifications of Resorce Reqirements for Embedded Control Software Rajeev Alr and Gera Weiss University of Pennsylvania Abstract For embedded control systems a schedle for the allocation of resorces
More informationModeling Roughness Effects in Open Channel Flows D.T. Souders and C.W. Hirt Flow Science, Inc.
FSI-2-TN6 Modeling Roghness Effects in Open Channel Flows D.T. Soders and C.W. Hirt Flow Science, Inc. Overview Flows along rivers, throgh pipes and irrigation channels enconter resistance that is proportional
More information11 Success of the Help Desk: Assessing Outcomes
11 Sccess of the Help Desk: Assessing Otcomes I dread sccess... I like a state of continal becoming, with a goal in front and not behind. George Bernard Shaw Key Findings Respondents help desks tend to
More informationDesigning and Deploying File Servers
C H A P T E R 2 Designing and Deploying File Servers File servers rnning the Microsoft Windows Server 2003 operating system are ideal for providing access to files for sers in medim and large organizations.
More information9 Setting a Course: Goals for the Help Desk
IT Help Desk in Higher Edcation ECAR Research Stdy 8, 2007 9 Setting a Corse: Goals for the Help Desk First say to yorself what yo wold be; and then do what yo have to do. Epictets Key Findings Majorities
More informationCRM Customer Relationship Management. Customer Relationship Management
CRM Cstomer Relationship Management Kenneth W. Thorson Tax Commissioner Virginia Department of Taxation Discssion Areas TAX/AMS Partnership Project Backgrond Cstomer Relationship Management Secre Messaging
More informationPlanning a Managed Environment
C H A P T E R 1 Planning a Managed Environment Many organizations are moving towards a highly managed compting environment based on a configration management infrastrctre that is designed to redce the
More informationPeriodized Training for the Strength/Power Athlete
Periodized Training for the /Power Athlete Jay R. Hoffman, PhD, FACSM, CSCS *D The se of periodized training has been reported to go back as far as the ancient Olympic games. Its basic premise is that
More informationResearch Article Multiple Beam Selection for Combing M2M Communication Networks and Cellular Networks with Limited Feedback
International Jornal of Distribted Sensor Networks Volme 2013, Article ID 540849, 11 pages http://dx.doi.org/10.1155/2013/540849 Research Article Mltiple Beam Selection for Combing M2M Commnication Networks
More informationTrustSVD: Collaborative Filtering with Both the Explicit and Implicit Influence of User Trust and of Item Ratings
TrstSVD: Collaborative Filtering with Both the Explicit and Implicit Inflence of User Trst and of Item Ratings Gibing Go Jie Zhang Neil Yorke-Smith School of Compter Engineering Nanyang Technological University
More informationA Novel QR Code and mobile phone based Authentication protocol via Bluetooth Sha Liu *1, Shuhua Zhu 2
International Conference on Materials Engineering and Information Technology Applications (MEITA 2015) A Novel QR Code and mobile phone based Athentication protocol via Bletooth Sha Li *1, Shha Zh 2 *1
More informationPlanning and Implementing An Optimized Private Cloud
W H I T E PA P E R Intelligent HPC Management Planning and Implementing An Optimized Private Clod Creating a Clod Environment That Maximizes Yor ROI Planning and Implementing An Optimized Private Clod
More informationNAZIA KANWAL VECTOR TRACKING LOOP DESIGN FOR DEGRADED SIGNAL ENVIRONMENT. Master of Science Thesis
NAZIA KANWAL VECTOR TRACKING LOOP DESIGN FOR DEGRADED SIGNAL ENVIRONMENT Master of Science Thesis Examiners: Professor Jari Nrmi, Adjnct Professor Simona Lohan and Dr. Heikki Hrskainen Examiner and topic
More informationOptimal control and piecewise parametric programming
Proceedings of the Eropean Control Conference 2007 Kos, Greece, Jly 2-5, 2007 WeA07.1 Optimal control and piecewise parametric programming D. Q. Mayne, S. V. Raković and E. C. Kerrigan Abstract This paper
More informationThe Intelligent Choice for Disability Income Protection
The Intelligent Choice for Disability Income Protection provider Pls Keeping Income strong We prposeflly engineer or disability income prodct with featres that deliver benefits sooner and contine paying
More informationIntroduction to HBase Schema Design
Introdction to HBase Schema Design Amandeep Khrana Amandeep Khrana is a Soltions Architect at Clodera and works on bilding soltions sing the Hadoop stack. He is also a co-athor of HBase in Action. Prior
More informationThe Intelligent Choice for Basic Disability Income Protection
The Intelligent Choice for Basic Disability Income Protection provider Pls Limited Keeping Income strong We prposeflly engineer or basic disability income prodct to provide benefit-rich featres delivering
More informationAn unbiased crawling strategy for directed social networks
Abstract An nbiased crawling strategy for directed social networks Xeha Yang 1,2, HongbinLi 2* 1 School of Software, Shenyang Normal University, Shenyang 110034, Liaoning, China 2 Shenyang Institte of
More informationPlanning a Smart Card Deployment
C H A P T E R 1 7 Planning a Smart Card Deployment Smart card spport in Microsoft Windows Server 2003 enables yo to enhance the secrity of many critical fnctions, inclding client athentication, interactive
More informationKentucky Deferred Compensation (KDC) Program Summary
Kentcky Deferred Compensation (KDC) Program Smmary Smmary and Highlights of the Kentcky Deferred Compensation (KDC) Program Simple. Smart. For yo. For life. 457 Plan 401(k) Plan Roth 401(k) Deemed Roth
More informationBLIND speech separation (BSS) aims to recover source
A Convex Speech Extraction Model and Fast Comptation by the Split Bregman Method Meng Y, Wenye Ma, Jack Xin, and Stanley Osher. Abstract A fast speech extraction (FSE) method is presented sing convex optimization
More informationOptimal Personalized Filtering Against Spear-Phishing Attacks
Optimal Personalized Filtering Against Spear-Phishing Attacks Aron Laszka and Yevgeniy Vorobeychik and Xenofon Kotsokos Institte for Software Integrated Systems Department of Electrical Engineering and
More informationCandidate: Shawn Mullane. Date: 04/02/2012
Shipping and Receiving Specialist / Inventory Control Assessment Report Shawn Mllane 04/02/2012 www.resorceassociates.com To Improve Prodctivity Throgh People. Shawn Mllane 04/02/2012 Prepared For: NAME
More informationPgrading To Windows XP 4.0 Domain Controllers and Services
C H A P T E R 8 Upgrading Windows NT 4.0 Domains to Windows Server 2003 Active Directory Upgrading yor domains from Microsoft Windows NT 4.0 to Windows Server 2003 Active Directory directory service enables
More informationComparative Studies of Load Balancing With Control and Optimization Techniques
5 American Control Conference ne 8-, 5 Portland, OR, USA WeC5 Comparative Stdies of Load Balancing With Control and Optimization Techniqes Yixin Diao, Chai Wah W, oseph L Hellerstein, Adam Storm, Maheswaran
More informationEvolution from Voiceband to Broadband Internet Access
Evolution from Voiceband to Broadband Internet Access Murtaza Ali DSPS R&D Center Texas Instruments Abstract With the growth of Internet, demand for high bit rate Internet access is growing. Even though
More informationDesigning an Authentication Strategy
C H A P T E R 1 4 Designing an Athentication Strategy Most organizations need to spport seamless access to the network for mltiple types of sers, sch as workers in offices, employees who are traveling,
More informationThe bintec HotSpot Solution. Convenient internet access anywhere
The bintec HotSpot Soltion Convenient internet access anywhere Convenient internet access for all kinds of spaces Today s internet sers are freqently on the go. They expect to have internet access on their
More informationDesigning a TCP/IP Network
C H A P T E R 1 Designing a TCP/IP Network The TCP/IP protocol site defines indstry standard networking protocols for data networks, inclding the Internet. Determining the best design and implementation
More informationA taxonomy of knowledge management software tools: origins and applications
Evalation and Program Planning 25 2002) 183±190 www.elsevier.com/locate/evalprogplan A taxonomy of knowledge management software tools: origins and applications Peter Tyndale* Kingston University Bsiness
More informationOn the urbanization of poverty
On the rbanization of poverty Martin Ravallion 1 Development Research Grop, World Bank 1818 H Street NW, Washington DC, USA Febrary 001; revised Jly 001 Abstract: Conditions are identified nder which the
More informationPurposefully Engineered High-Performing Income Protection
The Intelligent Choice for Disability Income Insrance Prposeflly Engineered High-Performing Income Protection Keeping Income strong We engineer or disability income prodcts with featres that deliver benefits
More informationEMC Storage Analytics
EMC Storage Analytics Version 2.1 Installation and User Gide 300-014-858 09 Copyright 2013 EMC Corporation. All rights reserved. Pblished in USA. Pblished December, 2013 EMC believes the information in
More informationKEYS TO BEING AN EFFECTIVE WORKPLACE PERSONAL ASSISTANT
5 KEYS TO BEING AN EFFECTIVE WORKPLACE PERSONAL ASSISTANT by: John Barrett Personal assistants (PAs) and their ability to effectively provide essential spports at the workplace are extremely important
More informationBreakthrough Performance in Mobile Phone Testing Fast and Accurate Measurements Full Flexibility with Powerful Control
Breakthrogh Performance in Mobile Phone Testing Fast and Accrate Measrements Fll Flexibility with Powerfl Control The New Platform for Testing Digital Commnications Breakthroghs in speed of test: Transmitter
More informationFirewall Feature Overview
PALO ALTO NETWORKS: Firewall Featre Overview Firewall Featre Overview Palo Alto Networks family of next generation firewalls delivers nprecedented visibility and control of applications, sers and content
More informationBonds with Embedded Options and Options on Bonds
FIXED-INCOME SECURITIES Chapter 14 Bonds with Embedded Options and Options on Bonds Callable and Ptable Bonds Instittional Aspects Valation Convertible Bonds Instittional Aspects Valation Options on Bonds
More informationRoth 401(k) and Roth 403(b) Accounts: Pay Me Now or Pay Me Later Why a Roth Election Should Be Part of Your Plan Now
Reprinted with permission from the Society of FSP. Reprodction prohibited withot pblisher's written permission. Roth 401(k) and Roth 403(b) Acconts: Why a Roth Election Shold Be Part of Yor Plan Now by
More informationCurriculum development
DES MOINES AREA COMMUNITY COLLEGE Crriclm development Competency-Based Edcation www.dmacc.ed Why does DMACC se competency-based edcation? DMACC tilizes competency-based edcation for a nmber of reasons.
More informationData De-duplication from the data sets using Similarity functions
Data De-dplication from the data sets sing Similarity fnctions M.Chitrarpa 1, V.Mniraj Naid 2 1 M.Tech Stdent Department of CSE Adisankara College of Engineering & Technology Gdr, Nellore district, India
More informationPractical Tips for Teaching Large Classes
Embracing Diversity: Toolkit for Creating Inclsive, Learning-Friendly Environments Specialized Booklet 2 Practical Tips for Teaching Large Classes A Teacher s Gide Practical Tips for Teaching Large Classes:
More informationEMC VNX Series Setting Up a Unisphere Management Station
EMC VNX Series Setting Up a Unisphere Management Station P/N 300-015-123 REV. 02 April, 2014 This docment describes the different types of Unisphere management stations and tells how to install and configre
More informationCloser Look at ACOs. Putting the Accountability in Accountable Care Organizations: Payment and Quality Measurements. Introduction
Closer Look at ACOs A series of briefs designed to help advocates nderstand the basics of Accontable Care Organizations (ACOs) and their potential for improving patient care. From Families USA Janary 2012
More informationInferring Continuous Dynamic Social Influence and Personal Preference for Temporal Behavior Prediction
Inferring Continos Dynamic Social Inflence and Personal Preference for Temporal Behavior Prediction Jn Zhang 1,2,3,4 Chaokn Wang 2,3,4 Jianmin Wang 2,3,4 Jeffrey X Y 5 1 Department of Compter Science and
More informationFaceTrust: Assessing the Credibility of Online Personas via Social Networks
FaceTrst: Assessing the Credibility of Online Personas via Social Networks Michael Sirivianos Kyngbaek Kim Xiaowei Yang Dke University University of California, Irvine Dke University msirivia@cs.dke.ed
More informationEquilibrium of Forces Acting at a Point
Eqilibrim of orces Acting at a Point Eqilibrim of orces Acting at a Point Pre-lab Qestions 1. What is the definition of eqilibrim? Can an object be moving and still be in eqilibrim? Explain.. or this lab,
More informationSickness Absence in the UK: 1984-2002
Sickness Absence in the UK: 1984-2002 Tim Barmby (Universy of Drham) Marco Ecolani (Universy of Birmingham) John Treble (Universy of Wales Swansea) Paper prepared for presentation at The Economic Concil
More informationCandidate: Suzanne Maxwell. Date: 09/19/2012
Medical Coder / Billing Clerk Assessment Report Szanne Maxwell 09/19/2012 www.resorceassociates.com Szanne Maxwell 09/19/2012 Prepared For: NAME Prepared by: John Lonsbry, Ph.D. & Lcy Gibson, Ph.D., Licensed
More informationaééäçóáåö=táåççïë= péêîéê=ommp=oéöáçå~ä= açã~áåë
C H A P T E R 7 aééäçóáåö=táåççïë= péêîéê=ommp=oéöáçå~ä= açã~áåë Deploying Microsoft Windows Server 2003 s involves creating new geographically based child domains nder the forest root domain. Deploying
More informationLSN RF Fire Detection System
17 19 18 34 3 50 49 21 20 36 35 52 51 23 2 38 37 54 53 24 10 26 25 40 39 5 57 56 13 12 28 27 42 41 59 58 15 14 30 29 4 43 61 60 16 32 31 46 45 63 62 48 47 64 Fire Alarm Systems LSN RF Fire Detection System
More informationMutualcast: An Efficient Mechanism for One-To-Many Content Distribution ABSTRACT Categories and Subject Descriptors General Terms Keywords
Mtalcast: An Efficient Mechanism for One-To-Many Content Distribtion Jin Li, Philip A. Cho and Cha Zhang, Microsoft Research, Commnication and Collaboration Systems Grop One Microsoft Way, Bld. 3, Redmond,
More informationDimension Debasing towards Minimal Search Space Utilization for Mining Patterns in Big Data
Volme: 3 Isse: 8 59-594 Dimension Debasing towards Minimal Search Space Utilization for Mining Patterns in Big Data Dr. M. Naga Ratna Dept. of Compter Science JNTUH College of Engineering Email: mratnajnt@jnth.ac.in
More informationFair Greening for DSL Broadband Access
Fair Greening for DSL Broadband Access Paschalis Tsiaflais The Katholiee Univ. Leuven, Belgium ptsiafla@esat.uleuven.be Yung Yi School of Electrical and Computer Science KAIST, South Korea yiyung@ee.aist.ac.r
More informationEMC ViPR. Concepts Guide. Version 1.1.0 302-000-482 02
EMC ViPR Version 1.1.0 Concepts Gide 302-000-482 02 Copyright 2013-2014 EMC Corporation. All rights reserved. Pblished in USA. Pblished Febrary, 2014 EMC believes the information in this pblication is
More informationPerforming Arithmetic Operations on Round-to-Nearest Representations
1 Performing Arithmetic Operations on Rond-to-Nearest Representations Peter Kornerp, Member, IEEE Jean-Michel Mller, Senior Member, IEEE Adrien Panhalex Abstract Dring any composite comptation there is
More information3. Fluid Dynamics. 3.1 Uniform Flow, Steady Flow
3. Flid Dynamics Objectives Introdce concepts necessary to analyse flids in motion Identify differences between Steady/nsteady niform/non-niform compressible/incompressible flow Demonstrate streamlines
More informationFlexible, Low-overhead Event Logging to Support Resource Scheduling
Flexible, Low-overhead Event Logging to Spport Resorce Schedling Jan Stoess University of Karlsrhe Germany stoess@ira.ka.de Volkmar Uhlig IBM T.J. Watson Research Center New York vhlig@s.ibm.com Abstract
More informationUpgrading Windows 2000 Domains to Windows Server 2003 Domains
C H A P T E R 9 Upgrading Windows 2000 Domains to Windows Server 2003 Domains Upgrading yor network operating system from Microsoft Windows 2000 to Windows Server 2003 reqires minimal network configration
More information10 Evaluating the Help Desk
10 Evalating the Help Desk The tre measre of any society is not what it knows bt what it does with what it knows. Warren Bennis Key Findings Help desk metrics having to do with demand and with problem
More information5 High-Impact Use Cases of Big Data Analytics for Optimizing Field Service Processes
5 High-Impact Use Cases of Big Analytics for Optimizing Field Service Processes Improving Field Service Efficiency and Maximizing Eqipment Uptime with Big Analytics and Machine Learning Field Service Profitability
More informationHow To Find Revenue Capacity Of A Communication Channel With A Price Function
Revenue Maximization for Broadband Service Providers Using Revenue Capacity Haleema Mehmood, Madeleine Udell and John Cioffi Department of Electrical Engineering Stanford University, Stanford, CA 94305
More informationBorrowing for College. Table of contents. A guide to federal loans for higher education
Borrowing for College A gide to federal loans for higher edcation Table of contents Edcation loan basics 2 Applying for edcation loans 3 Repaying edcation loans 3 Controlling edcation loan debt 5 Glossary
More informationThe Boutique Premium. Do Boutique Investment Managers Create Value? AMG White Paper June 2015 1
The Botiqe Premim Do Botiqe Investment Managers Create Vale? AMG White Paper Jne 2015 1 Exective Smmary Botiqe active investment managers have otperformed both non-botiqe peers and indices over the last
More informationLIMITS IN CATEGORY THEORY
LIMITS IN CATEGORY THEORY SCOTT MESSICK Abstract. I will start assming no knowledge o category theory and introdce all concepts necessary to embark on a discssion o limits. I will conclde with two big
More informationAn accelerated Branch-and-Bound algorithm for assignment problems of utility systems
Compters and Chemical Engineering 6 (00) 67 630 www.elsevier.com/locate/compchemeng An accelerated Branch-and-Bond algorithm for assignment problems of tility systems Alexandros M. Strovalis a, Istvan
More informationCloser Look at ACOs. Making the Most of Accountable Care Organizations (ACOs): What Advocates Need to Know
Closer Look at ACOs A series of briefs designed to help advocates nderstand the basics of Accontable Care Organizations (ACOs) and their potential for improving patient care. From Families USA Updated
More informationThe art of deploying DSL, Broadband via noisy telephony wiring
The art of deploying DSL, Broadband via noisy telephony wiring Whitepaper on DSL Rob F.M. van den Brink, TNO, The Netherlands, Oct 29 Abstract 1 : The huge spread in crosstalk coupling between the individual
More informationTELECOMMUNICATIONS STANDARDS ADVISORY COMMITTEE WORKING GROUP ON COMMON CONNECTION STANDARDS (CCS)
TELECOMMUNICATIONS STANDARDS ADVISORY COMMITTEE WORKING GROUP ON COMMON CONNECTION STANDARDS (CCS) Overview of Very High Speed Digital Subscriber Line 2 (VDSL2) 甚 高 速 數 碼 用 戶 線 路 2 的 概 覽 Introduction ADSL
More informationOn the Traffic Capacity of Cellular Data Networks. 1 Introduction. T. Bonald 1,2, A. Proutière 1,2
On the Traffic Capacity of Cellular Data Networks T. Bonald 1,2, A. Proutière 1,2 1 France Telecom Division R&D, 38-40 rue du Général Leclerc, 92794 Issy-les-Moulineaux, France {thomas.bonald, alexandre.proutiere}@francetelecom.com
More informationA Contemporary Approach
BORICP01.doc - 1 Second Edition Edcational Psychology A Contemporary Approach Gary D. Borich The University of Texas at Astin Martin L. Tombari University of Denver (This pblication may be reprodced for
More informationAnalytical Calculation of Risk Measures for Variable Annuity Guaranteed Benefits
Analytical Calclation of Risk Measres for Variable Annity Garanteed Benefits Rnhan Feng Department of Mathematical Sciences University of Wisconsin - Milwakee fengr@wm.ed Hans W. Volkmer Department of
More information