• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 220
  • 50
  • 24
  • 23
  • 20
  • 16
  • 10
  • 8
  • 6
  • 5
  • 4
  • 4
  • 3
  • 2
  • 2
  • Tagged with
  • 503
  • 108
  • 107
  • 79
  • 78
  • 73
  • 73
  • 59
  • 56
  • 51
  • 51
  • 48
  • 47
  • 46
  • 46
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
321

A Java Framework for Broadcast Encryption Algorithms / Ett ramverk i Java för prestandatest av broadcast-krypteringsalgoritmer

Hesselius, Tobias, Savela, Tommy January 2004 (has links)
Broadcast encryption is a fairly new area in cryptology. It was first addressed in 1992, and the research in this area has been large ever since. In short, broadcast encryption is used for efficient and secure broadcasting to an authorized group of users. This group can change dynamically, and in some cases only one-way communication between the sender and receivers is available. An example of this is digital TV transmissions via satellite, in which only the paying customers can decrypt and view the broadcast. The purpose of this thesis is to develop a general Java framework for implementation and performance analysis of broadcast encryption algorithms. In addition to the actual framework a few of the most common broadcast encryption algorithms (Complete Subtree, Subset Difference, and the Logical Key Hierarchy scheme) have been implemented in the system. This master’s thesis project was defined by and carried out at the Information Theory division at the Department of Electrical Engineering (ISY), Linköping Institute of Technology, during the first half of 2004.
322

Digital predistortion and equalization of the non-linear satellite communication channel / Prédistorsion numérique et turbo-égalisation du canal de communication par satellite non-linéaire

Deleu, Thibault 14 November 2014 (has links)
In satellite communications, non-linear interference is created by the non-linear power amplifier aboard the satellite. Even in the case of a memoryless power amplifier, the channel is a non-linear system with memory due to the presence of linear filters on ground and aboard the satellite. The non-linear interference degrades the system performance, especially when considering high-order modulations or in case of several signals being amplified by the same power amplifier. In this thesis, we have proposed algorithms at the transmitter and at the receiver to digitally compensate this interference. In particular, a new predistortion algorithm has been proposed, which significantly improves state-of-the-art algorithms. Since the complexity of this algorithm is an issue, low-complexity algorithms have also been proposed and achieve almost the same performance as the initial algorithm. We have also proposed joint predistortion and turbo-equalization algorithms to further improve the system performance. / En communications par satellite, de l’interférence non-linéaire est créée par l’amplificateur de puissance non-linéaire à bord du satellite. Même si l’amplificateur peut être considéré comme sans mémoire, le canal est malgré tout un système non-linéaire avec mémoire de par la présence de filtres linéaires au sol ou à bord du satellite. L'interférence non-linéaire dégrade les performances du système, en particulier lorsqu’on considère des modulations d’ordre élevé ou plusieurs signaux amplifiés par le même amplificateur de puissance. Dans cette thèse, nous avons proposé des algorithmes à l’émetteur et au récepteur pour compenser numériquement cette interférence. En particulier, nous avons proposé un nouvel algorithme de prédistorsion qui améliore de façon significative les algorithmes de l’état-de-l’art. La complexité de l’algorithme étant très élevée, nous avons proposé des algorithmes de plus faible complexité atteignant pratiquement les mêmes performances par rapport à l’algorithme initial. Nous avons aussi proposé des algorithmes de prédistorsion et d’égalisation conjointes, permettant d'atteindre des performances plus élevées qu'avec la prédistorsion seule. / Doctorat en Sciences de l'ingénieur / info:eu-repo/semantics/nonPublished
323

Music radio stations from the “On Air” to the Online : Identifying media logics in the content and formats of Radio FIP on its digital platforms

Ignatiew, Nicolas January 2017 (has links)
Internet and digital media have profoundly reorganised the radio landscape by giving birth to new formats and patterns of radio listening. Today, traditional radio actors systematically use online platforms to diffuse their programs and communicate with their audience. This master thesis offers a case study and examines how Radio FIP, a French music station of public service, uses its digital devices to diffuse its program and produce content online. On the basis of existing researches on radio and radio diffusion online, and with the help of the concepts of format, media logics and hybrid media system, the author of this paper defines two logics of traditional radio and radio online used as reference in order to analysis the influence of media logics on the station’s material and formats online.   Observation of Radio FIP’s website and social media pages on Facebook and Twitter showed  a clear influence of radio online logics in the visual and informative extra content, the additional audio offers through online webradio streams, the promotion of non linear and asynchronous formats of radio listening’s and the incorporation of networked media frames. At the same time, logics of traditional radio prove to be also very significant with the pre-eminence and promotion of the station’s on air broadcast on digital devices and the reproduction of traditional radio patterns of temporality, music prescription and vertical communication on social media platforms. The coexistence of the two logics in Radio FIP online platforms characterises the station’s digital apparatus as a hybrid media space, and opens up new research trails for better understanding what influence the content formats of radio stations diffusing online.
324

Kanadská média: historie a současnost / Canadian media: history/genesis and present/contemporaneity

Vránová, Vendula January 2011 (has links)
The thesis is focused on key canadian media - print, radio and television, in the individulal chapters I'm trying to describe their development as it is during the formative years and influenced, and what role it plays in today's Canada and which one of them has a privileged position in the country. Before that I was trying to deal with the history of Canada to clarify the roots all Canadian journalism and the media occurred. I also give attention to some selected major Canadian media personalities, whether those from the past and the present, who are in some way involved on what is today Canadian journalism, or the form of it's today. My attention did not miss either: the French-Canadian journalism, which about their form and the place on the map of the Canadian media fought for centuries. Its center is the Canadian province of Quebec. In my work, I also discuss how journalism is taught at several Canadian universities, how much of them offers a learning program and how they teach it. Whether the emphasis is more on theory or more practical. I write also about media education, which has been several years in Canada's history. Last but not least, I tried to map the Czech track in the Canadian media and specifically designate some of expatriate media that readers can find in Canada.
325

Segmentation et identification audiovisuelle de personnes dans des journaux télévisés / Audiovisual segmentation and identification of persons in broadcast news

Gay, Paul 25 March 2015 (has links)
Cette thèse traite de l’identification des locuteurs et des visages dans les journaux télévisés. L’identification est effectuée à partir des noms affichés à l’écran dans les cartouches qui servent couramment à annoncer les locuteurs. Puisque ces cartouches apparaissent parcimonieusement dans la vidéo, obtenir de bonnes performances d’identification demande une bonne qualité du regroupement audiovisuel des personnes. Par regroupement, on entend ici la tâche de détecteret regrouper tous les instants où une personne parle ou apparaît. Cependant les variabilités intra-personnes gênent ce regroupement. Dans la modalité audio, ces variabilités sont causées par la parole superposée et les bruits de fond. Dans la modalité vidéo, elles correspondent essentiellement à des variations de la pose des visages dans les scènes de plateaux avec, en plus, des variations de luminosité (notamment dans le cas des reportages). Dans cette thèse, nous proposons une modélisation du contexte de la vidéo est proposée afin d’optimiser le regroupement pour une meilleure identification. Dans un premier temps, un modèle basé sur les CRF est proposé afin d’effectuer le regroupement audiovisuel des personnes de manière jointe. Dans un second temps, un système d’identification est mis en place, basé sur la combinaison d’un CRF de nommage à l’échelle des classes, et du CRF développé précédemment pour le regroupement. En particulier, des informations de contexte extraites de l’arrière plan des images et des noms extraits des cartouches sont intégrées dans le CRF de regroupement. Ces éléments permettent d’améliorer le regroupement et d’obtenir des gains significatifs en identification dans les scènes de plateaux. / This Phd thesis is about speaker and face identification in broadcast news. The identification is relying on the names automatically extracted from overlaid texts which are used to announce the speakers. Since those names appear sparsely in the video, identification performance depends on the diarization performance i.e. the capacity of detecting and clustering together all the moments when a given person appears or speaks. However, intra-person variability in the video signal make this task difficult. In the audio modality, this variability comes from overlap speech and background noise. For the video, it consists in head pose variations and lighting conditions (especially in report scenes). A context-aware model is proposed to optimize the diarization for a better identification. Firstly, a Conditional Random Field (CRF) model isproposed to perform the diarization jointly over the speech segments and the face tracks. Secondly, an identifcation system is designed. It is based on the combination of a naming CRF at cluster level and the diarization CRF. In particular, context information extracted from the image background and the names extracted from the overlaid texts are integrated in the diarization CRF at segment level. The use of those elements enable us to obtain better performances in diarization and identification, especially in studio scenes.
326

Coordenação de Agentes Móveis através do Canal de Broadcast / Coordination of Mobile Agents through the Broadcast Channel

Vera Nagamuta 19 November 1999 (has links)
Em aplicações distribuídas baseadas em agentes móveis, a coordenação das ações dos agentes móveis é uma tarefa complexa. A maior dificuldade é devido ao fato que agentes móveis podem mudar de endereço dinamicamente. Nesta dissertação, apresentamos o projeto e a implementação de um mecanismo de coordenação de agentes móveis que contorna este problema. Este mecanismo, que chamamos de Canal de Broadcast, está baseado na difusão de mensagens e possibilita que os membros de um grupo de agentes móveis interajam entre si, independentemente de suas localizações correntes. Modelos de coordenação existentes oferecem formas de interação entre agentes móveis, mas todos eles impõem alguma exigência. Ou os agentes móveis devem conhecer a localização de outros agentes, ou devem estar localizados no mesmo lugar ou devem migrar para um lugar específico. A principal vantagem deste mecanismo de coordenação está na total transparência de localização: as mensagens podem ser endereçadas a um conjunto de agentes móveis independentemente de sua localização corrente. Este mecanismo foi implementado no ASDK (Aglets Software Development Kit) da IBM e a sua utilidade foi demonstrada usando dois problemas típicos de coordenação em Sistemas Distribuídos: a Exclusão Mútua e o protocolo Manager-Workers. Testamos o desempenho do mecanismo e identificamos que o custo do Canal de Broadcast não é tão alto comparado aos benefícios que proporciona. Através deste mecanismo, os agentes móveis poderão executar as suas tarefas e interagir entre sí com o propósito da coordenação sem as exigências impostas por outros modelos de coordenação. / In distributed applications based on mobile agents, the coordination of mobile agents actions is a difficult task. The main difficulty comes from the fact that mobile agents can change their address dynamically. In this dissertation, we present the project and implementation of a mechanism for coordinating mobile agents that overcomes this problem. This mechanism, which we called Broadcast Channel, is based on the difusion of messages and enables the members of a mobile agent group to interact with each other independently of their current locations. Existing coodination models offer some means of interaction between mobile agents, but all of them impose some requirements. Either the mobile agents must know about each other's location, or must be located at the same place or must move to a specific place. The main advantage of our coordination mechanism is the full location transparency: the messages can be sent to a set of mobile agents independently of their current locations. This mechanism was implemented using IBM's ASDK (Aglets Software Development Kit) and its use was demonstrated using two typical coordination problems in Distributed Systems: the Mutual Exclusion and the Manager-Workers protocol. We tested the performance of the mechanism and identified that the cost of the Broadcast Channel is not too high, compared to the benefit it provides. Through this mechanism, the mobile agents can do their tasks and interact with each other for the purpose of coordination without the requirements imposed by other models.
327

Automatic Dependent Surveillance-Broadcast for Detect and Avoid on Small Unmanned Aircraft

Duffield, Matthew Owen 01 May 2016 (has links)
Small unmanned aircraft systems (UAS) are rapidly gaining popularity. As the excitement surrounding small UAS has grown, the Federal Aviation Administration (FAA) has repeatedly stated that UAS must be capable of detecting and avoiding manned and unmanned aircraft. In developing detect-and-avoid (DAA) technology, one of the key challenges is identifying a suitable sensor. Automatic Dependent Surveillance-Broadcast (ADS-B) has gained much attention in both the research and consumer sectors as a promising solution. While ADS-B has many positive characteristics, further analysis is necessary to determine if it is suitable as a DAA sensor in environments with high-density small UAS operations. To further the understanding of ADS-B, we present a characterization of ADS-B measurement error that is derived from FAA regulations. Additionally, we analyze ADS-B by examining its strengths and weaknesses from the perspective of DAA on small UAS. To demonstrate the need and method for estimation of ADS-B measurements, we compare four dynamic filters for accuracy and computational speed. The result of the comparison is a recommendation for the best filter for ADS-B estimation. We then demonstrate this filter by estimating ADS-B measurements that have been recorded from the National Airspace System (NAS). We also present a novel long-range, convex optimization-based path planner for ADS-B-equipped small UAS in the presence of intruder aircraft. This optimizer is tested using a twelve-state simulation of the ownship and intruders.We also consider the effectiveness of ADS-B in high-density airspace. To do this we present a novel derivation of the probability of interference for ADS-B based on the number of transmitting aircraft. We then use this probability to document the need for limited transmit range for ADS-B on small UAS. We further leverage the probability of interference for ADS-B, by creating a tool that can be used to analyze self-separation threshold (SST) and well clear (WC) definitions based on ADS-B bandwidth limitations. This tool is then demonstrated by evaluating current SST and WC definitions and making regulations recommendations based on the analysis. Coupling this tool with minimum detection range equations, we make a recommendation for well clear for small UAS in ADS-B congested airspace. Overall these contributions expand the understanding of ADS-B as a DAA sensor, provide viable solutions for known and previously unknown ADS-B challenges, and advance the state of the art for small UAS.
328

Grafické zobrazení relací mezi počítači v Internetu / Visualization of relations between computers in the Internet

Cimbálek, Přemysl January 2008 (has links)
Internet Protocol Television (IPTV) transmits the television signal over the TCP/IP family of protocols. Its advantages are for example that the transmitting is not only one-way as in the “classical” TV broadcasting, but it can provide feedback such as interactivity. There are also some problems which avoids development, for example low channel capacity of access networks. That is why new methods , for example how to get more efficiency in IPTV transmission, are proposed. The main task of this diploma thesis is to visualize tree structure of relations between nodes in the network, based on understanding of principles of the hierarchical summarization and IPTV transmitting. The nodes in the tree structure provide computing and summarizing of the data in back-way channel. There is the data from the end users in this channel. In the first part of this diploma thesis there is explained the principle of IPTV and its differences as compared with classical TV broadcasting. The part is also aimed for the supported services, advantages and disadvantages. There is explained the compressing data with the MPEG-2 and MPEG-4 standards and problems with transport networks called “last mile problem.” To transmitting data IPTV uses Source Specific Multicast – every user connects to the multicast session with requested TV program. Feedback is provided by unicast. Feedback network uses the hierarchical summarization principle to reduce the data. This problem, connected with RTP, RTCP and TTP protocols, is in the work described as well. There is an international experimental network called PlanetLab mentioned in theoretical part of this work. Proposed structure of new protocol and applications including the visualization for IPTV broadcast, is tested in that network. In the practical part of this work there are discussed possibilities and methods for the visualization and data storage. Because of high availability and flexibility, there were chosen web technologies, such as MySQL for data storage. The tree model is executed by Java. The visualization is solved by web technologies, source code for visualization is dynamically generated by scripts in JSP (Java Server Pages). Graphical output is provided by the vector format SVG (Scalable Vector Graphics) which is created for graphical expression on the internet and in the mobile phones. There were created interactive web application thanks its ability to cooperation with Javascript technology. This application visualizes relation-tree structure of nodes. In this work there are explained basics of all used technologies, there are also given reasons for chosen methods and formats. Examples and interesting parts of solution are mentioned as well.
329

Think tanks and the construction of authority in the UK : Ideological representations of private sector knowledge producers in broadcast television news

Graham, Minenor-Matheson January 2020 (has links)
Private sector knowledge producers, more commonly known as think tanks or research institutes, are used as authoritative sources in Western media either as interview guests or their research quoted by journalists.  Most studies have focused on their ability to influence government policy, but very little has focused on their role in the public sphere, particularly their visibility in media.  This study will explore how often think representatives appear as authoritative sources or experts in broadcast media during the 2015, 2017 and 2019 UK General Elections.  This will be done through a quantitative content analysis and thematic analysis investigating whether such representatives are accorded preferential access and ascribed primary authority to define narratives.  Additionally, a theoretical model has been designed to detect whether a marketplace of ideas can be detected or whether television news is a site of Habermassian rational-critical public sphere.  Inspired by the work of Anstead and Chadwick, and taking this vital work further, this study investigates whether authority signalling, and primary definition is still a relevant theory by analysing broadcast news coverage across three general elections.
330

Inventaire analytique de l'émission radiophonique culturelle québécoise L'Heure provinciale à CKAC (1929-1939)

Lang, Johanne 05 1900 (has links)
No description available.

Page generated in 0.0627 seconds