Radio - Studio - Old - Equipment - Transmitter and Control Room - Radio History - First Broadcast from a Commercial Station - Early WWJ [Detroit News]

Keith Bemand, Elton Plank, Mr. Trumbull

Reliably estimating the effect of toxicants on fertilization success in marine broadcast spawners

Recently, there has been a dramatic increase in the number of ecotoxicological studies examining the effects of toxicants on fertilization success in marine broadcast spawners and it appears that this life-history stage is one of the most vulnerable to toxicants. Most of the studies examining this issue use single sperm concentrations in their assays. Here, I discuss recent advances in fertilization ecology that suggest this technique has some severe limitations resulting in unreliable estimations of the size and direction of toxicant effects. I present an alternative assay technique and two metrics (F-max and [Sperm](max)) that will reliably estimate the size of a toxicant's effect on fertilization success. This technique has the added advantage of making comparisons among species and studies easier without an impractical increase in effort. (c) 2006 Elsevier Ltd. All rights reserved.

A lightweight encryption algorithm for mobile online multimedia devices

Online multimedia data needs to be encrypted for access control. To be capable of working on mobile devices such as pocket PC and mobile phones, lightweight video encryption algorithms should be proposed. The two major problems in these algorithms are that they are either not fast enough or unable to work on highly compressed data stream. In this paper, we proposed a new lightweight encryption algorithm based on Huffman error diffusion. It is a selective algorithm working on compressed data. By carefully choosing the most significant parts (MSP), high performance is achieved with proper security. Experimental results has proved the algorithm to be fast. secure: and compression-compatible.

Motion vector encryption in multimedia streaming

Streaming video application requires high security as well as high computational performance. In video encryption, traditional selective algorithms have been used to partially encrypt the relatively important data in order to satisfy the streaming performance requirement. Most video selective encryption algorithms are inherited from still image encryption algorithms, the encryption on motion vector data is not considered. The assumption is that motion vector data are not as important as pixel image data. Unfortunately, in some cases, motion vector itself may be sufficient enough to leak out useful video information. Normally motion vector data consume over half of the whole video stream bandwidth, neglecting their security may be unwise. In this paper, we target this security problem and illustrate attacks at two different levels that can restore useful video information using motion vectors only. Further, an information analysis is made and a motion vector information model is built. Based on this model, we describe a new motion vector encryption algorithm called MVEA. We show the experimental results of MVEA. The security strength and performance of the algorithm are also evaluated.

Efficient Multi-hop Broadcast Data Dissemination in IoT and Smart Cities

Internet of Things (IoT) can be defined as a “network of networks” composed by billions of uniquely identified physical Smart Objects (SO), organized in an Internet-like structure. Smart Objects can be items equipped with sensors, consumer devices (e.g., smartphones, tablets, or wearable devices), and enterprise assets that are connected both to the Internet and to each others. The birth of the IoT, with its communications paradigms, can be considered as an enabling factor for the creation of the so-called Smart Cities. A Smart City uses Information and Communication Technologies (ICT) to enhance quality, performance and interactivity of urban services, ranging from traffic management and pollution monitoring to government services and energy management. This thesis is focused on multi-hop data dissemination within IoT and Smart Cities scenarios. The proposed multi-hop techniques, mostly based on probabilistic forwarding, have been used for different purposes: from the improvement of the performance of unicast protocols for Wireless Sensor Networks (WSNs) to the efficient data dissemination within Vehicular Ad-hoc NETworks (VANETs).

AUDIOVISUAL: DO BROADCAST À BROADBAND

A sociedade digital nos abraça em todos os aspectos do cotidiano e uma parte significativa da população vive conectada em multiplataformas. Com a instantaneidade dos fluxos de comunicação, vivemos uma rotina onde muitos acessos estão a um clique ou toque. A televisão como mídia preponderante durante várias décadas, na sua transição digital comporta uma função além da TV que conhecíamos, como display interativo que se conecta e absorve conteúdos provenientes de várias fontes. Os consagrados modelos mundiais de distribuição de audiovisual, especialmente pelo Broadcast, sofrem as consequências da mudança do comportamento do seu público pelas novas oportunidades de acesso aos conteúdos, agora interativos e sob demanda. Neste contexto, os modelos das SmartTVs (TVs conectadas) em Broadband (Banda Larga) apresentam opções diferenciadas e requerem um espaço cada vez maior na conexão com todos os outros displays. Com este cenário, o presente estudo busca descrever e analisar as novas ofertas de conteúdos, aplicativos, possibilidades e tendências do hibridismo das fontes para a futura TV.

Statistical mechanics of broadcast channels using low-density parity-check codes

We investigate the use of Gallager's low-density parity-check (LDPC) codes in a degraded broadcast channel, one of the fundamental models in network information theory. Combining linear codes is a standard technique in practical network communication schemes and is known to provide better performance than simple time sharing methods when algebraic codes are used. The statistical physics based analysis shows that the practical performance of the suggested method, achieved by employing the belief propagation algorithm, is superior to that of LDPC based time sharing codes while the best performance, when received transmissions are optimally decoded, is bounded by the time sharing limit.

Packet voice/data in local broadcast networks

A local area network that can support both voice and data packets offers economic advantages due to the use of only a single network for both types of traffic, greater flexibility to changing user demands, and it also enables efficient use to be made of the transmission capacity. The latter aspect is very important in local broadcast networks where the capacity is a scarce resource, for example mobile radio. This research has examined two types of local broadcast network, these being the Ethernet-type bus local area network and a mobile radio network with a central base station. With such contention networks, medium access control (MAC) protocols are required to gain access to the channel. MAC protocols must provide efficient scheduling on the channel between the distributed population of stations who want to transmit. No access scheme can exceed the performance of a single server queue, due to the spatial distribution of the stations. Stations cannot in general form a queue without using part of the channel capacity to exchange protocol information. In this research, several medium access protocols have been examined and developed in order to increase the channel throughput compared to existing protocols. However, the established performance measures of average packet time delay and throughput cannot adequately characterise protocol performance for packet voice. Rather, the percentage of bits delivered within a given time bound becomes the relevant performance measure. Performance evaluation of the protocols has been examined using discrete event simulation and in some cases also by mathematical modelling. All the protocols use either implicit or explicit reservation schemes, with their efficiency dependent on the fact that many voice packets are generated periodically within a talkspurt. Two of the protocols are based on the existing 'Reservation Virtual Time CSMA/CD' protocol, which forms a distributed queue through implicit reservations. This protocol has been improved firstly by utilising two channels, a packet transmission channel and a packet contention channel. Packet contention is then performed in parallel with a packet transmission to increase throughput. The second protocol uses variable length packets to reduce the contention time between transmissions on a single channel. A third protocol developed, is based on contention for explicit reservations. Once a station has achieved a reservation, it maintains this effective queue position for the remainder of the talkspurt and transmits after it has sensed the transmission from the preceeding station within the queue. In the mobile radio environment, adaptions to the protocols were necessary in order that their operation was robust to signal fading. This was achieved through centralised control at a base station, unlike the local area network versions where the control was distributed at the stations. The results show an improvement in throughput compared to some previous protocols. Further work includes subjective testing to validate the protocols' effectiveness.

Sparse image representation with encryption

In this thesis we present an overview of sparse approximations of grey level images. The sparse representations are realized by classic, Matching Pursuit (MP) based, greedy selection strategies. One such technique, termed Orthogonal Matching Pursuit (OMP), is shown to be suitable for producing sparse approximations of images, if they are processed in small blocks. When the blocks are enlarged, the proposed Self Projected Matching Pursuit (SPMP) algorithm, successfully renders equivalent results to OMP. A simple coding algorithm is then proposed to store these sparse approximations. This is shown, under certain conditions, to be competitive with JPEG2000 image compression standard. An application termed image folding, which partially secures the approximated images is then proposed. This is extended to produce a self contained folded image, containing all the information required to perform image recovery. Finally a modified OMP selection technique is applied to produce sparse approximations of Red Green Blue (RGB) images. These RGB approximations are then folded with the self contained approach.

Analysis of a full-memory multidestination ARQ protocol over broadcast links

Based on an assumption that a steady state exists in the full-memory multidestination automatic repeat request (ARQ) scheme, we propose a novel analytical method called steady-state function method (SSFM), to evaluate the performance of the scheme with any size of receiver buffer. For a wide range of system parameters, SSFM has higher accuracy on throughput estimation as compared to the conventional analytical methods.

AUDIOVISUAL: DO BROADCAST À BROADBAND

A sociedade digital nos abraça em todos os aspectos do cotidiano e uma parte significativa da população vive conectada em multiplataformas. Com a instantaneidade dos fluxos de comunicação, vivemos uma rotina onde muitos acessos estão a um “clique” ou toque. A televisão como mídia preponderante durante várias décadas, na sua transição digital comporta uma função além da TV que conhecíamos, como display interativo que se conecta e absorve conteúdos provenientes de várias fontes. Os consagrados modelos mundiais de distribuição de audiovisual, especialmente pelo Broadcast, sofrem as consequências da mudança do comportamento do seu público pelas novas oportunidades de acesso aos conteúdos, agora interativos e sob demanda. Neste contexto, os modelos das SmartTVs (TVs conectadas) em Broadband (Banda Larga) apresentam opções diferenciadas e requerem um espaço cada vez maior na conexão com todos os outros displays. Com este cenário, o presente estudo busca descrever e analisar as novas ofertas de conteúdos, aplicativos, possibilidades e tendências do hibridismo das fontes para a futura TV.

Personal Data and Encryption in the European General Data Protection Regulation

Encryption of personal data is widely regarded as a privacy preserving technology which could potentially play a key role for the compliance of innovative IT technology within the European data protection law framework. Therefore, in this paper, we examine the new EU General Data Protection Regulation’s relevant provisions regarding encryption – such as those for anonymisation and pseudonymisation – and assess whether encryption can serve as an anonymisation technique, which can lead to the non-applicability of the GDPR. However, the provisions of the GDPR regarding the material scope of the Regulation still leave space for legal uncertainty when determining whether a data subject is identifiable or not. Therefore, we inter alia assess the Opinion of the Advocate General of the European Court of Justice (ECJ) regarding a preliminary ruling on the interpretation of the dispute concerning whether a dynamic IP address can be considered as personal data, which may put an end to the dispute whether an absolute or a relative approach has to be used for the assessment of the identifiability of data subjects. Furthermore, we outline the issue of whether the anonymisation process itself constitutes a further processing of personal data which needs to have a legal basis in the GDPR. Finally, we give an overview of relevant encryption techniques and examine their impact upon the GDPR’s material scope.

The Privacy Paradox: Privacy, Surveillance, and Encryption

Thesis (Master's)--University of Washington, 2016-08