685 resultados para broadcast encryption
Resumo:
Mestrado em Engenharia Electrotécnica e de Computadores
Resumo:
10th International Temperate Reefs Symposium, The University of Western Australia, 12-17 de janeiro.
Resumo:
Dissertação de Mestrado, Gestão e Conservação da Natureza, 12 de Junho de 2014, Universidade dos Açores.
Resumo:
The daily access to news broadcast is something that, generally speaking, we do not abstain ourselves from, whether it is to be aware of what is going on in our country or to be informed about international events. But are we attentive to how the information about those events, namely those that occur outside Portugal, reaches us? How is that information handled – and who handles it – until we have it at our disposal? Is the audience aware that a large part of the news must be translated and must have a linguistic treatment? And how can we describe that same translation and the way it is presented? This case study is just an example of translation‘s role and its crucial presence on TV news broadcast, considering the way translation is processed, how it is barely noticed – or not –, how it influences the construction of the story and how the story influences the translation process. This case study was presented at the 2nd International Conference ―Media for All‖, with the theme ―Text on Air, Text on Screen‖, which took place at the Polytechnic Institute of Leiria, on 7-9 November 2007. O acesso diário a serviços informativos noticiosos é algo de que, de um modo geral, não nos privamos, seja para ficar a par do que se passa no nosso país, seja para ficarmos mais informados sobre eventos e acontecimentos internacionais. Mas teremos noção de como essas informações sobre esses acontecimentos, nomeadamente os que têm lugar fora de Portugal, chegam até nós? Qual será o tratamento dado a essas informações – e quem trata essas informações – até serem colocadas à nossa disposição? Será que o público, de um modo geral, se apercebe que grande parte das notícias é alvo de tratamento tradutológico e linguístico? E como se caracterizará essa tradução e a forma de apresentação da mesma? O presente estudo de caso é apenas um exemplo do papel e da presença fulcral da tradução em serviços noticiosos televisivos, seja pela forma como é feita, pelo modo como passa despercebida (ou não), pela influência que terá na construção da peça noticiosa e pela influência que a peça noticiosa terá no modo como se processa a tradução. Este estudo de caso foi apresentado na 2ª Conferência Internacional ―Media for All‖, subordinada ao tema ―Text on Air, Text on Screen‖, que teve lugar no Instituto Politécnico de Leiria de 7 a 9 de Novembro de 2007.
Resumo:
The relation between the information/knowledge expression and the physical expression can be involved as one of items for an ambient intelligent computing [2],[3]. Moreover, because there are so many contexts around user/spaces during a user movement, all appplcation which are using AmI for users are based on the relation between user devices and environments. In these situations, it is possible that the AmI may output the wrong result from unreliable contexts by attackers. Recently, establishing a server have been utilizes, so finding secure contexts and make contexts of higher security level for save communication have been given importance. Attackers try to put their devices on the expected path of all users in order to obtain users informationillegally or they may try to broadcast their SPAMS to users. This paper is an extensionof [11] which studies the Security Grade Assignment Model (SGAM) to set Cyber-Society Organization (CSO).
Resumo:
A recent trend in distributed computer-controlled systems (DCCS) is to interconnect the distributed computing elements by means of multi-point broadcast networks. Since the network medium is shared between a number of network nodes, access contention exists and must be solved by a medium access control (MAC) protocol. Usually, DCCS impose real-time constraints. In essence, by real-time constraints we mean that traffic must be sent and received within a bounded interval, otherwise a timing fault is said to occur. This motivates the use of communication networks with a MAC protocol that guarantees bounded access and response times to message requests. PROFIBUS is a communication network in which the MAC protocol is based on a simplified version of the timed-token protocol. In this paper we address the cycle time properties of the PROFIBUS MAC protocol, since the knowledge of these properties is of paramount importance for guaranteeing the real-time behaviour of a distributed computer-controlled system which is supported by this type of network.
Resumo:
Consider the problem of designing an algorithm for acquiring sensor readings. Consider specifically the problem of obtaining an approximate representation of sensor readings where (i) sensor readings originate from different sensor nodes, (ii) the number of sensor nodes is very large, (iii) all sensor nodes are deployed in a small area (dense network) and (iv) all sensor nodes communicate over a communication medium where at most one node can transmit at a time (a single broadcast domain). We present an efficient algorithm for this problem, and our novel algorithm has two desired properties: (i) it obtains an interpolation based on all sensor readings and (ii) it is scalable, that is, its time-complexity is independent of the number of sensor nodes. Achieving these two properties is possible thanks to the close interlinking of the information processing algorithm, the communication system and a model of the physical world.
Resumo:
Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take individual sensor readings, however, in many cases, it is relevant to compute aggregated quantities of these readings. In fact, the minimum and maximum of all sensor readings at an instant are often interesting because they indicate abnormal behavior, for example if the maximum temperature is very high then it may be that a fire has broken out. In this context, we propose an algorithm for computing the min or max of sensor readings in a multihop network. This algorithm has the particularly interesting property of having a time complexity that does not depend on the number of sensor nodes; only the network diameter and the range of the value domain of sensor readings matter.
Resumo:
Database query languages on relations (for example SQL) make it possible to join two relations. This operation is very common in desktop/server database systems but unfortunately query processing systems in networked embedded computer systems currently do not support this operation; specifically, the query processing systems TAG, TinyDB, Cougar do not support this. We show how a prioritized medium access control (MAC) protocol can be used to efficiently execute the database operation join for networked embedded computer systems where all computer nodes are in a single broadcast domain.
Resumo:
Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take sensor readings but individual sensor readings are not very important. It is important however to compute aggregated quantities of these sensor readings. The minimum and maximum of all sensor readings at an instant are often interesting because they indicate abnormal behavior, for example if the maximum temperature is very high then it may be that a fire has broken out. We propose an algorithm for computing the min or max of sensor reading in a multihop network. This algorithm has the particularly interesting property of having a time complexity that does not depend on the number of sensor nodes; only the network diameter and the range of the value domain of sensor readings matter.
Resumo:
Consider a network where all nodes share a single broadcast domain such as a wired broadcast network. Nodes take sensor readings but individual sensor readings are not the most important pieces of data in the system. Instead, we are interested in aggregated quantities of the sensor readings such as minimum and maximum values, the number of nodes and the median among a set of sensor readings on different nodes. In this paper we show that a prioritized medium access control (MAC) protocol may advantageously be exploited to efficiently compute aggregated quantities of sensor readings. In this context, we propose a distributed algorithm that has a very low time and message-complexity for computing certain aggregated quantities. Importantly, we show that if every sensor node knows its geographical location, then sensor data can be interpolated with our novel distributed algorithm, and the message-complexity of the algorithm is independent of the number of nodes. Such an interpolation of sensor data can be used to compute any desired function; for example the temperature gradient in a room (e.g., industrial plant) densely populated with sensor nodes, or the gas concentration gradient within a pipeline or traffic tunnel.
Resumo:
Consider a wireless network where links may be unidirectional, that is, a computer node A can broadcast a message and computer node B will receive this message but if B broadcasts then A will not receive it. Assume that messages have deadlines. We propose a medium access control (MAC) protocol which replicates a message in time with carefully selected pauses between replicas, and in this way it guarantees that for every message at least one replica of that message is transmitted without collision. The protocol ensures this with no knowledge of the network topology and it requires neither synchronized clocks nor carrier sensing capabilities. We believe this result is significant because it is the only MAC protocol that offers an upper bound on the message queuing delay for unidirectional links without relying on synchronized clocks.
Resumo:
OBJECTIVE To comprehend the perception of body image in adolescence. METHODS A qualitative study was conducted with eight focus groups with 96 students of both sexes attending four public elementary school institutions in the city of Rio de Janeiro, Southeastern Brazil, in 2013. An interview guide with questions about the adolescents’ feelings in relation to: their bodies, standards of idealized beauty, practice of physical exercise and sociocultural influences on self-image. In the data analysis we sought to understand and interpret the meanings and contradictions of narratives, understanding the subjects’ context and reasons and the internal logic of the group. RESULTS Three thematic categories were identified. The influence of media on body image showed the difficulty of achieving the perfect body and is viewed with suspicion in face of standards of beauty broadcast; the importance of a healthy body was observed as standards of beauty and good looks were closely linked to good physical condition and result from having a healthy body; the relationship between the standard of beauty and prejudice, as people who are not considered attractive, having small physical imperfections, are discriminated against and can be rejected or even excluded from society. CONCLUSIONS The standard of perfect body propagated by media influences adolescents’ self-image and, consequently, self-esteem and is considered an unattainable goal, corresponding to a standard of beauty described as artificial and unreal. However, it causes great suffering and discrimination against those who do not feel they are attractive, which can lead to health problems resulting from low self-esteem.
Resumo:
Consider a distributed computer system such that every computer node can perform a wireless broadcast and when it does so, all other nodes receive this message. The computer nodes take sensor readings but individual sensor readings are not very important. It is important however to compute the aggregated quantities of these sensor readings. We show that a prioritized medium access control (MAC) protocol for wireless broadcast can compute simple aggregated quantities in a single transaction, and more complex quantities with many (but still a small number of) transactions. This leads to significant improvements in the time-complexity and as a consequence also similar reduction in energy “consumption”.
Resumo:
In this paper, we analyze the performance limits of the slotted CSMA/CA mechanism of IEEE 802.15.4 in the beacon-enabled mode for broadcast transmissions in WSNs. The motivation for evaluating the beacon-enabled mode is due to its flexibility for WSN applications as compared to the non-beacon enabled mode. Our analysis is based on an accurate simulation model of the slotted CSMA/CA mechanism on top of a realistic physical layer, with respect to the IEEE 802.15.4 standard specification. The performance of the slotted CSMA/CA is evaluated and analyzed for different network settings to understand the impact of the protocol attributes (superframe order, beacon order and backoff exponent) on the network performance, namely in terms of throughput (S), average delay (D) and probability of success (Ps). We introduce the concept of utility (U) as a combination of two or more metrics, to determine the best offered load range for an optimal behavior of the network. We show that the optimal network performance using slotted CSMA/CA occurs in the range of 35% to 60% with respect to an utility function proportional to the network throughput (S) divided by the average delay (D).