A Novel, Balanced, and Energy-Efficient Training Method for Receive Antenna Selection

In receive antenna selection (AS), only signals from a subset of the antennas are processed at any time by the limited number of radio frequency (RF) chains available at the receiver. Hence, the transmitter needs to send pilots multiple times to enable the receiver to estimate the channel state of all the antennas and select the best subset. Conventionally, the sensitivity of coherent reception to channel estimation errors has been tackled by boosting the energy allocated to all pilots to ensure accurate channel estimates for all antennas. Energy for pilots received by unselected antennas is mostly wasted, especially since the selection process is robust to estimation errors. In this paper, we propose a novel training method uniquely tailored for AS that transmits one extra pilot symbol that generates accurate channel estimates for the antenna subset that actually receives data. Consequently, the transmitter can selectively boost the energy allocated to the extra pilot. We derive closed-form expressions for the proposed scheme's symbol error probability for MPSK and MQAM, and optimize the energy allocated to pilot and data symbols. Through an insightful asymptotic analysis, we show that the optimal solution achieves full diversity and is better than the conventional method.

Whose ETSIP? National and local ownership of Namibia's education and training sector improvement programme

Tämä työ tarkastelee kansallista ja paikallista omistajuutta Namibian opetussektorin kehittämisohjelmassa. Opetussektorin kehittämisohjelma ETSIP on 15-vuotinen sektoriohjelma vuosille 2005-2015 ja sen tavoitteena on edesauttaa Namibian kehittymistä tietoyhteiskunnaksi. Tutkimuksen tarkoituksena on selvittää miten kansallinen ja paikallinen omistajuus on toteutunut ETSIP prosessin aikana. Erityisesti pyritään selvittämään paikallistason opetussektorin virkamiesten näkemyksiä ETSIP prosessista, heidän roolistaan siinä ja siitä millaisia vaikuttamisen ja hallinnan mahdollisuuksia heillä on ollut prosessin aikana. Tutkimuksen lähtökohta on laadullinen ja lähestymistapa konstruktionistinen: tutkimus tarkastelee todellisuutta ihmisten kokemusten, näkemysten ja toiminnan kautta. Tutkimusaineisto koostuu haastatteluista, epävirallisista keskusteluista, lehtiartikkeleista ja ETSIP dokumenteista. Tutkimus osoittaa että kansallinen omistajuus on epämääräinen käsite sillä kansallisia toimijoita ja näkemyksiä on useita. Tutkimus vahvistaa Castel-Brancon huomion siitä, että omistajuutta on tarkasteltava kontekstissaan: muuttuvana ja kilpailtuna. ETSIPin rinnalle ollaan valmistelemassa uutta strategista ohjelmaa opetusministeriölle mikä saattaa muuttaa omistajuutta ETSIPiin. ETSIP dokumenttien omistajuusretoriikka myötäilee kansainvälisiä sitoumuksia avun vaikuttavuuden parantamiseksi mutta niistä puuttuu syvällisempi analyysi siitä, miten kansallinen ja paikallinen omistajuus toteutuisi käytännössä. Avunantajien näkemys omistajuudesta on suppea: omistajuus nähdään lähinnä sitoutumisena ennalta määrättyyn politiikkaohjelmaan. Haastatteluaineistosta nousee esiin Whitfieldin ja Frazerin jaottelu suppeista ja laajoista omistajuuskäsityksistä. Sitoutumista ETSIP ohjelmaan pidetään tärkeänä mutta riittämättömänä määritteenä omistajuudelle. Paikallisella tasolla sitoutuminen ETSIP ohjelman periaatteisiin ja tavoitteisiin on toteutunut melko hyvin mutta jos omistajuutta tarkastellaan laajemmin vaikutusvallan ja hallinnan käsitteiden kautta voidaan todeta että omistajuus on ollut heikkoa. Paikallisella tasolla ei ole ollut juurikaan vaikutusvaltaa ETSIP ohjelman sisältöön eikä mahdollisuutta hallita ohjelman toteutusta ja päättää siitä mitä hankkeita ohjelman kautta rahoitetaan. Tujanin demokraattisen omistajuuden käsite kuvaa tarvetta muuttaa ja laajentaa omistajuusajattelua huomioiden paikallisen tason paremmin. Tämä tutkimus viittaa siihen että omistajuuden toteutuminen paikallisella tasolla edellyttäisi institutionaalisen kulttuurin muutosta ja institutionaalisen legitimiteetin vahvistamista. Omistajuuden mahdollistamiseksi paikallisella tasolla tarvittaisiin poliittista johtajuutta, luottamusta, vastuullisuuden kulttuurin kehittämistä, tehokkaampaa tiedonjakoa, laajaa osallistumista, vuoropuhelua ja yhteistyötä. Ennen kaikkea tarvittaisiin paikallisen tason vaikutusvaltaa päätöksenteossa ja kontrollia resurssien käytöstä. Tälle muutokselle on selvä tarve ja tilaus.

Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler

A model comprising several servers, each equipped with its own queue and with possibly different service speeds, is considered. Each server receives a dedicated arrival stream of jobs; there is also a stream of generic jobs that arrive to a job scheduler and can be individually allocated to any of the servers. It is shown that if the arrival streams are all Poisson and all jobs have the same exponentially distributed service requirements, the probabilistic splitting of the generic stream that minimizes the average job response time is such that it balances the server idle times in a weighted least-squares sense, where the weighting coefficients are related to the service speeds of the servers. The corresponding result holds for nonexponentially distributed service times if the service speeds are all equal. This result is used to develop adaptive quasi-static algorithms for allocating jobs in the generic arrival stream when the load parameters are unknown. The algorithms utilize server idle-time measurements which are sent periodically to the central job scheduler. A model is developed for these measurements, and the result mentioned is used to cast the problem into one of finding a projection of the root of an affine function, when only noisy values of the function can be observed

Vehicle Routing Problem with Load Compatibility Constraints

The major contribution of this paper is to introduce load compatibility constraints in the mathematical model for the capacitated vehicle routing problem with pickup and deliveries. The employee transportation problem in the Indian call centers and transportation of hazardous materials provided the motivation for this variation. In this paper we develop a integer programming model for the vehicle routing problem with load compatibility constraints. Specifically two types of load compatability constraints are introduced, namely mutual exclusion and conditional exclusion. The model is demonstrated with an application from the employee transportation problem in the Indian call centers.

Effect of drainage basin characteristics on the diffuse load of phosphorus and nitrogen.

Tiivistelmä: Valuma-alueen vaikutus fosforin ja typen hajakuormitukseen.

Prediction of load-deflection behaviour using fracture energy GF: A comparative study of two fracture models for concrete

Load-deflection curves for a notched beam under three-point load are determined using the Fictitious Crack Model (FCM) and Blunt Crack Model (BCM). Two values of fracture energy GF are used in this analysis: (i) GF obtained from the size effect law and (ii) GF obtained independently of the size effect. The predicted load-deflection diagrams are compared with the experimental ones obtained for the beams tested by Jenq and Shah. In addition, the values of maximum load (Pmax) obtained by the analyses are compared with the experimental ones for beams tested by Jenq and Shah and by Bažant and Pfeiffer. The results indicate that the descending portion of the load-deflection curve is very sensitive to the GF value used.

Load balancing algorithms for an extended hypercube

Reduction of the execution time of a job through equitable distribution of work load among the processors in a distributed system is the goal of load balancing. Performance of static and dynamic load balancing algorithms for the extended hypercube, is discussed. Threshold algorithms are very well-known algorithms for dynamic load balancing in distributed systems. An extension of the threshold algorithm, called the multilevel threshold algorithm, has been proposed. The hierarchical interconnection network of the extended hypercube is suitable for implementing the proposed algorithm. The new algorithm has been implemented on a transputer-based system and the performance of the algorithm for an extended hypercube is compared with those for mesh and binary hypercube networks

Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks

Distributed Space-Time Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and non-square CODs other than the Alamouti design) are known to lose their single-symbol ML decodable (SSD) property when used in two-hop wireless relay networks using the amplify and forward protocol. For such a network, a new class of high rate, training-symbol embedded (TSE) SSD DSTBCs are proposed from TSE-CODs. The constructed codes include the training symbols within the structure of the code which is shown to be the key point to obtain high rate along with the SSD property. TSE-CODs are shown to offer full-diversity for arbitrary complex constellations. Non-square TSE-CODs are shown to provide better rates (in symbols per channel use) compared to the known SSD DSTBCs for relay networks when the number of relays is less than 10. Importantly, the proposed DSTBCs do not contain zeros in their codewords and as a result, antennas of the relay nodes do not undergo a sequence of switch on and off transitions within every codeword use. Hence, the proposed DSTBCs eliminate the antenna switching problem.

On the improvement of diversity-multiplexing gain tradeoff in a training based TDD-simo system

This paper investigates the diversity-multiplexing gain tradeoff (DMT) of a time-division duplex (TDD) single-input multiple-output (SIMO) system with perfect channel state information (CSI) at the receiver (CSIR) and partial CSI at the transmitter (CSIT). The partial CSIT is acquired through a training sequence from the receiver to the transmitter. The training sequence is chosen in an intelligent manner based on the CSIR, to reduce the training length by a factor of r, the number of receive antennas. We show that, for the proposed training scheme and a given channel coherence time, the diversity order increases linearly with r for nonzero multiplexing gain. This is a significant improvement over conventional orthogonal training schemes.

Effect of Short Duration of Load increment on the Compressibility of Soils

This study concerns the effect of duration of load increment (up to 24 h) on the consolidation properties of expansive black cotton soil (liquid limit = 81%) and nonexpansive kaolinite (liquid limit = 49%). It indicates that the amount and rate of compression are not noticeably affected by the duration of loading for a standard sample of 25 mm in height and 76.2 mm in diameter with double drainage. Hence, the compression index and coefficient of consolidation can be obtained with reasonable accuracy even if the duration of each load increment is as short as 4 h. The secondary compression coefficient (C-alpha epsilon) for kaolinite can be obtained for any pressure range with 1/2 h of loading, which, however, requires 4 h for black cotton soil. This is because primary consolidation is completed early in the case of kaolinite. The paper proves that the conventional consolidation test can be carried out with much shorter duration of loading (less than 4 h) than the standard specification of 24 h or more even for remolded fine-grained soils.

Scheduling expression trees with reusable registers on delayed-load architectures

In this paper, we look at the problem of scheduling expression trees with reusable registers on delayed load architectures. Reusable registers come into the picture when the compiler has a data-flow analyzer which is able to estimate the extent of use of the registers. Earlier work considered the same problem without allowing for register variables. Subsequently, Venugopal considered non-reusable registers in the tree. We further extend these efforts to consider a much more general form of the tree. We describe an approximate algorithm for the problem. We formally prove that the code schedule produced by this algorithm will, in the worst case, generate one interlock and use just one more register than that used by the optimal schedule. Spilling is minimized. The approximate algorithm is simple and has linear complexity.

Multi-installment load distribution in tree networks with delays

This paper presents a new strategy for load distribution in a single-level tree network equipped with or without front-ends. The load is distributed in more than one installment in an optimal manner to minimize the processing time. This is a deviation and an improvement over earlier studies in which the load distribution is done in only one installment. Recursive equations for the general case, and their closed form solutions for a special case in which the network has identical processors and identical links, are derived. An asymptotic analysis of the network performance with respect to the number of processors and the number of installments is carried out. Discussions of the results in terms of some practical issues like the tradeoff relationship between the number of processors and the number of installments are also presented.