77,339 research outputs found
Walsh, T G, VX30977
No full textThis record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/423777Surname: WALSH. Given Name(s) or Initials: T G. Military Service Number or Last Known Location: VX30977. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 3760.251293
Item: [2016.0049.56038] "Walsh, T G, VX30977
Walsh, T W, 12277
No full textThis record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/423733Surname: WALSH. Given Name(s) or Initials: T W. Military Service Number or Last Known Location: 12277. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 26572.250248
Item: [2016.0049.55994] "Walsh, T W, 12277
Digital (t,m,s)-nets, digital (T,s)-sequences, and numerical integration of multivariate Walsh series
No full textIn a series of papers by the authors and several co-authors a method for the numerical integration of high-dimensional Walsh series was developed. Walsh series play an important role in several areas as for example in image- and signalprocessing. The theory is based on the concept of (t; m; s)-nets and (T; s)-sequences developed by H. Niederreiter. These are finite point sets respectively infinite sequences in the s-dimensional unit-cube which are extremely well distributed. It is the aim of this paper to give a concise introduction in this field of quasiMonte Carlo integration, to announce some new results on the topic which are not yet published, and to state the most important problems which are still unsolved and which are of relevance for our theory. Contents 1 Introduction 75 2 (t; m; s)-nets, (T; s)-sequences and their digital construction 76 3 Numerical integration of multivariate Walsh series 92 4 A comparison of results on "classical" numerical integration methods with the ..
Estudo da transformada de Walsh-Hadamard aplicada à transmissão OFDM
No full textDissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia Elétrica.Esta dissertação apresenta um estudo da aplicação da Transformada de Walsh-Hadamard (WHT) em diferentes sistemas OFDM. Os sistemas avaliados envolvem a transmissão sem fio entre uma antena transmissora e uma receptora (sistema SISO), e duas antenas transmissoras e uma receptora (sistema MISO Alamouti). A WHT espalha o sinal de informação antes de ser modulado no sistema OFDM. Conseqüentemente, os efeitos de desvanecimento provocados pelos canais correspondentes a cada subportadora OFDM também são espalhados, resultando em uma condição de desvanecimento médio destes canais. Isto leva a um aumento da robustez dos canais das subportadoras que mais sofreram com a transmissão puramente OFDM, mas degrada a condição de desvanecimento das mais robustas. Para verificar esta característica da WHT e o ganho de desempenho que ela possa impactar ao sistema OFDM, foram realizadas simulações com sistemas OFDM com e sem o uso da WHT. Assim, foi possível avaliar o desempenho desta técnica no
TCM, TTCM, BICM and BICM-ID Assisted MMSE Multi-User Detected SDMA-OFDM Using Walsh-Hadamard Spreading
No full textSpace Division Multiple Access (SDMA) aided Orthogonal Frequency Division Multiplexing (OFDM) systems assisted by efficient Multi-User Detection (MUD) techniques have recently attracted intensive research interests. Forward Error Correction (FEC) schemes and frequency-domain spreading techniques can be efficiently amalgamated with SDMA-OFDM systems for the sake of improving the achievable performance. In this contribution a Coded Modulation (CM) assisted and Minimum Mean-Square Error (MMSE) multi-user detected SDMA-OFDM system combined with Walsh-Hadamard-Transform-Spreading (WHTS) across a number of subcarriers is proposed. The various CM schemes used are Trellis Coded Modulation (TCM), Turbo TCM (TTCM), Bit-Interleaved Coded Modulation (BICM) and Iteratively Decoded BICM (BICM-ID), which constitute bandwidth efficient schemes that combine the functions of coding and modulation. Invoking the WHTS technique is capable of further improving the average Bit Error Rate (BER) performance of the CM-SDMA-OFDM system, since the bursty error effects imposed by the frequency-domain fading encountered are spread over the entire WHT block length, therefore increasing the chances of correcting the transmission errors by the CM decoders
Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
No full textWe design sensitivity oracles for error-prone networks. For a network problem Π, the data structure preprocesses a network G = (V, E) and sensitivity parameter f such that, for any set F ⊆ V ∪ E of up to f link or node failures, it can report the solution of Π in G−F. We study three network problems Π. • L-HOP SHORTEST PATH: Given s, t ∈ V, is there a shortest s-t-path in G−F with at most L links? • k-PATH: Does G−F contain a simple path with k links? • k-CLIQUE: Does G−F contain a clique of k nodes? Our main technical contribution is a new construction of (L, f)-replacement path coverings ((L, f)-RPC) in the parameter realm where f = o(log L). An (L, f)-RPC is a family G of subnetworks of G which, for every F ⊆E with |F|< f, has a subfamily GF ⊆G such that (i) no subnetwork in GF contains a link of F and (ii) for each s, t∈V, if G−F contains a shortest s-t-path with at most L links, then some subnetwork in GF retains at least one such path. Our (L, f)-RPC has almost the same size as the one by Weimann and Yuster (2013) but it improves the time to query GF from Oe(f2Lf) to Oe(f25 Lo(1)). It also improves over the size and query time of the (L, f)-RPC by Karthik and Parter (2021) by nearly a factor of L. From this construction, we derive oracles for L-HOP SHORTEST PATH, k-PATH, and k-CLIQUE. Notably, our solution for k-PATH improves the query time of the one by Bilò et al. (2022a) for f = o(log k)
Prostate cancer in men aged less than 50 years at diagnosis
No full textPodium Presentation Abstracts No. 48N. Kinnear, G. Kichenadasse, S. Plagakis, M. O, Callaghan, T. Kopsaftis, S. Walsh And D. Forema
A review of the electrodeposition of metal matrix composite coatings by inclusion of particles in a metal layer: an established and diversifying technology
No full textFollowing a brief overview of their history, which dates back to the 1920s with marked developments during the 1960s and 1970s, the principles of composite coatings, achieved by including particles dispersed in a bath into a growing electrodeposited metal layer, are considered. The principles and role of electroplating compared to other techniques for realising such coatings, are considered. A good quality particle dispersion (often aided by a suitable type and concentration of surfactants) appropriate choice of work-piece shape/geometry and controlled agitation in the bath are seen to be prerequisites for achieving uniform coatings having a well-dispersed particle content by electroplating. Examples are provided to illustrate the influence of bath composition and plating conditions on deposit properties. Engineering applications of included particle composite layers are illustrated by examples of hard ceramic, soft ceramic and polymer inclusion composite coatings from the recent literature. Current trends in the development of composite plated coatings are summarised and their diverse applications are seen to include the use of finely structured (especially nanostructured) and functionally active particles together with hybrid and more complex, e.g. hierarchical, structures for applications ranging from tribology to speciality electronics, magnetic and electrochemical energy conversion materials
- …
