Увійти

Готові списки джерел за темами / Broadcast primitives

Добірка наукової літератури з теми "Broadcast primitives"

Автор: Grafiati

Опубліковано: 9 липня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Broadcast primitives".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Статті в журналах з теми "Broadcast primitives":

1

BERNASCHI, MASSIMO, GIULIO IANNELLO, and SAVERIO CREA. "EXPERIMENTAL RESULTS ABOUT MPI COLLECTIVE COMMUNICATION OPERATIONS." Parallel Processing Letters 15, no. 01n02 (March 2005): 223–36. http://dx.doi.org/10.1142/s0129626405002179.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Collective communication performance is critical in a number of MPI applications. In this paper we focus on two widely used primitives, broadcast and reduce, and present experimental results obtained on a cluster of PC connected by InfiniBand. We integrated our algorithms in the MPICH library and we used MPICH implementation of broadcast and reduce primitives to compare the performance of our algorithms based on α-trees. Our tests show that the MPICH implementation can be improved.

2

Ramakrishna, S., B. Prasad, A. Thenmozhi, S. Samdarshi, K. Velaga, K. Shah, and K. Ravindran. "Design of broadcast programming primitives for distributed systems." Computer Communications 16, no. 9 (September 1993): 557–67. http://dx.doi.org/10.1016/0140-3664(93)90026-o.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Groza, Bogdan, and Pal-Stefan Murvay. "Secure Broadcast with One-Time Signatures in Controller Area Networks." International Journal of Mobile Computing and Multimedia Communications 5, no. 3 (July 2013): 1–18. http://dx.doi.org/10.4018/jmcmc.2013070101.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Broadcast authentication in Controller Area Networks (CAN) is subject to real time constraints that are hard to satisfy by expensive public key primitives. For this purpose the authors study here the use of one-time signatures which can be built on the most computationally efficient one-way functions. The authors use an enhancement of the classical Merkle signature as well as the more recently proposed HORS signature scheme. Notably, these two proposals offer different trade-offs, and they can be efficiently paired with time synchronization to reduce the overhead caused by the re-initialization of the public keys, which would otherwise require expensive authentication trees. The authors do outline clear bounds on the performance of such a solution and provide experimental results on development boards equipped with Freescale S12X, a commonly used automotive grade micro-controller. The authors also benefit from the acceleration offered by the XGATE co-processor available on S12X derivatives which significantly increases the computational performances.

4

Ellen, Faith, Barun Gorain, Avery Miller, and Andrzej Pelc. "Constant-Length Labeling Schemes for Deterministic Radio Broadcast." ACM Transactions on Parallel Computing 8, no. 3 (September 30, 2021): 1–17. http://dx.doi.org/10.1145/3470633.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Broadcast is one of the fundamental network communication primitives. One node of a network, called the s ource, has a message that has to be learned by all other nodes. We consider broadcast in radio networks, modeled as simple undirected connected graphs with a distinguished source. Nodes communicate in synchronous rounds. In each round, a node can either transmit a message to all its neighbours, or stay silent and listen. At the receiving end, a node v hears a message from a neighbour w in a given round if v listens in this round and if w is its only neighbour that transmits in this round. If more than one neighbour of a node v transmits in a given round, we say that a c ollision occurs at v . We do not assume collision detection: in case of a collision, node v does not hear anything (except the background noise that it also hears when no neighbour transmits). We are interested in the feasibility of deterministic broadcast in radio networks. If nodes of the network do not have any labels, deterministic broadcast is impossible even in the four-cycle. On the other hand, if all nodes have distinct labels, then broadcast can be carried out, e.g., in a round-robin fashion, and hence O (log n )-bit labels are sufficient for this task in n -node networks. In fact, O (log Δ)-bit labels, where Δ is the maximum degree, are enough to broadcast successfully. Hence, it is natural to ask if very short labels are sufficient for broadcast. Our main result is a positive answer to this question. We show that every radio network can be labeled using 2 bits in such a way that broadcast can be accomplished by some universal deterministic algorithm that does not know the network topology nor any bound on its size. Moreover, at the expense of an extra bit in the labels, we can get the following additional strong property of our algorithm: there exists a common round in which all nodes know that broadcast has been completed. Finally, we show that 3-bit labels are also sufficient to solve both versions of broadcast in the case where it is not known a priori which node is the source.

5

Yadav, Snehlata, and Namita Tiwari. "An Efficient and Secure Data Sharing Method Using Asymmetric Pairing with Shorter Ciphertext to Enable Rapid Learning in Healthcare." Computational Intelligence and Neuroscience 2022 (April 20, 2022): 1–13. http://dx.doi.org/10.1155/2022/4788031.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The recent advent of cloud computing provides a flexible way to effectively share data among multiple users. Cloud computing and cryptographic primitives are changing the way of healthcare unprecedentedly by providing real-time data sharing cost-effectively. Sharing various data items from different users to multiple sets of legitimate subscribers in the cloud environment is a challenging issue. The online electronic healthcare system requires multiple data items to be shared by different users for various purposes. In the present scenario, COVID-19 data is sensitive and must be encrypted to ensure data privacy. Secure sharing of such information is crucial. The standard broadcast encryption system is inefficient for this purpose. Multichannel broadcast encryption is a mechanism that enables secure sharing of different messages to different set of users efficiently. We propose an efficient and secure data sharing method with shorter ciphertext in public key setting using asymmetric (Type-III) pairings. The Type-III setting is the most efficient form among all pairing types regarding operations required and security. The semantic security of this method is proven under decisional BDHE complexity assumption without random oracle model.

6

Szilágyi, Péter. "Iris: A decentralized approach to backend messaging middlewares." Computer Science and Information Systems 11, no. 2 (2014): 549–67. http://dx.doi.org/10.2298/csis130823024s.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this work we introduce the design and internal workings of the Iris decentralized messaging framework. Iris takes a midway approach between the two prevalent messaging middleware models: the centralized one represented by the AMQP family and the socket queuing one represented by ZeroMQ; by turning towards peer-to-peer overlays as the internal transport for message distribution and delivery. A novel concept is introduced, whereby a distributed service is composed not of individual application instances, but rather clusters of instances responsible for the same sub-service. Supporting this new model, a collection of higher level messaging patterns have been identified and successfully implemented: broadcast, request/reply, publish/subscribe and tunnel. This conceptual model and supporting primitives allow a much simpler way to specify, design and implement distributed, cloud based services. Furthermore, the proposed system achieves a significant switching speed, which - given its decentralized nature - can be scaled better than existing messaging frameworks, whilst incurring zero configuration costs.

7

Lee, Jiwon, Seunghwa Lee, Jihye Kim, and Hyunok Oh. "Combinatorial Subset Difference—IoT-Friendly Subset Representation and Broadcast Encryption." Sensors 20, no. 11 (June 2, 2020): 3140. http://dx.doi.org/10.3390/s20113140.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In the Internet of Things (IoT) systems, it is often required to deliver a secure message to a group of devices. The public key broadcast encryption is an efficient primitive to handle IoT broadcasts, by allowing a user (or a device) to broadcast encrypted messages to a group of legitimate devices. This paper proposes an IoT-friendly subset representation called Combinatorial Subset Difference (CSD), which generalizes the existing subset difference (SD) method by allowing wildcards (*) in any position of the bitstring. Based on the CSD representation, we first propose an algorithm to construct the CSD subset, and a CSD-based public key broadcast encryption scheme. By providing the most general subset representation, the proposed CSD-based construction achieves a minimal header size among the existing broadcast encryption. The experimental result shows that our CSD saves the header size by 17% on average and more than 1000 times when assuming a specific IoT example of IP address with 20 wildcards and 2 20 total users, compared to the SD-based broadcast encryption. We prove the semantic security of CSD-based broadcast encryption under the standard l-BDHE assumption, and extend the construction to a chosen-ciphertext-attack (CCA)-secure version.

8

Morris, Glenn K., Paul A. DeLuca, Matthew Norton, and Andrew C. Mason. "Calling-song function in male haglids (Orthoptera: Haglidae, Cyphoderris)." Canadian Journal of Zoology 80, no. 2 (February 1, 2002): 271–85. http://dx.doi.org/10.1139/z02-003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We studied the response of males to the singing of nearby male conspecifics in two species of the orthopteran genus Cyphoderris, primitive relatives of crickets and katydids. Lone male Cyphoderris buckelli stridulating in a large cage made a phonotactic approach to a nearby speaker broadcasting conspecific calling song. But in field experiments no phonotaxis to song broadcasts occurred; rather, a significant number of male C. buckelli increased their chirp duty cycle and pulse rate. There was no change in their carrier frequency. Calling male Cyphoderris monstrosa were exposed in the field to (i) playback of a synthetic calling song at a typical conspecific pulse rate, (ii) relayed broadcast of their own call, and (iii) low-frequency audio noise. Call duty cycle decreased significantly in response to the noise, while the pooled song models fell just short of significance. Singing C. buckelli were marked individually and their perches flagged over successive nights. We observed low site fidelity and extensive male displacement. Such behaviour is inconsistent with defense of topographically fixed singing territories and concurs with the absence of fighting in this species. Chirp duty cycle was increased significantly in C. buckelli in response to the singing of nearby conspecifics, but unlike in C. monstrosa, this change in duty cycle plays no role in overt aggression, though it may maintain a male's relative attractiveness to females.

9

Morris, Glenn. "Acoustic Behavior in Cyphoderris strepitans." UW National Parks Service Research Station Annual Reports 9 (January 1, 1985): 85–91. http://dx.doi.org/10.13001/uwnpsrc.1985.2497.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Cyphoderris strepitans, is a primitive orthopteran which survives only in the mountains of Wyoming and Colorado (Morris and Gwynne 1978). The males rub their forewings together to produce a calling song. This stridulation is presumed to function, as in other acoustic Orthoptera, in attracting conspecific fema1es for mating and in maintaining a broadcast territory around each singer.

10

Huang, Haiping, Qinglong Huang, Fu Xiao, Wenming Wang, Qi Li, and Ting Dai. "An Improved Broadcast Authentication Protocol for Wireless Sensor Networks Based on the Self-Reinitializable Hash Chains." Security and Communication Networks 2020 (September 1, 2020): 1–17. http://dx.doi.org/10.1155/2020/8897282.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Broadcast authentication is a fundamental security primitive in wireless sensor networks (WSNs), which is a critical sensing component of IoT. Although symmetric-key-based μTESLA protocol has been proposed, some concerns about the difficulty of predicting the network lifecycle in advance and the security problems caused by an overlong long hash chain still remain. This paper presents a scalable broadcast authentication scheme named DH-μTESLA, which is an extension and improvement of μTESLA and Multilevel μTESLA, to achieve several vital properties, such as infinite lifecycle of hash chains, security authentication, scalability, and strong tolerance of message loss. The proposal consists of the t,n-threshold-based self-reinitializable hash chain scheme (SRHC-TD) and the d-left-counting-Bloom-filter-based authentication scheme (AdlCBF). In comparison to other broadcast authentication protocols, our proposal achieves more security properties such as fresh node’s participation and DoS resistance. Furthermore, the reinitializable hash chain constructed in SRHC-TD is proved to be secure and has less computation and communication overhead compared with typical solutions, and efficient storage is realized based on AdlCBF, which can also defend against DoS attacks.

Більше джерел

Дисертації з теми "Broadcast primitives":

1

Auvolat, Alex. "Probabilistic methods for collaboration systems in large-scale trustless networks." Thesis, Rennes 1, 2021. http://www.theses.fr/2021REN1S125.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Internet est un outil formidable pour l'éducation, la communication et la collaboration, mais ses usages majoritaires sont actuellement sous monopole de grandes multinationales (GAFAM), ce qui a des conséquences sur le respect des droits humains et des libertés individuelles. Cette thèse propose des outils pour le développement d'applications décentralisées : des applications sur Internet qui fournissent des fonctionnalités similaires aux plateformes des GAFAM, mais de manière décentralisée, afin de rendre le pouvoir aux utilisateur pour décider démocratiquement de leur fonctionnement et de leurs usages. Nous nous concentrons sur les algorithmes épidémiques qui sont particulièrement adaptés dans le cadre de réseaux ouverts à large échelle. Nous proposons des contributions sur la diffusion causale de messages tolérante aux nœuds Byzantins, la diffusion causale épidémique à l'aide d'un stockage d'événements synchronisé par anti-entropie, l'échantillonnage aléatoire de pairs résistants aux attaques Byzantines et aux attaques Sybil, ainsi qu'un nouvel algorithme épidémique de diffusion totalement ordonnée qui tolère les nœuds malicieux et fournit un débit de messages élevé
The Internet is a formidable tool for education, communication and collaboration, however it is currently being monopolized by large corporations (GAFAM), which has consequences for many social issues such as respect of human rights and individual freedoms. This thesis focuses on ways to build decentralized applications: Internet applications that provide levels of functionality similar to those provided by the GAFAM, but that function in a decentralized manner, empowering the users to democratically decide of their functioning and their uses. We focus on epidemic algorithms, which are particularly suited to the context of very large open networks. We make contributions on causal broadcast in presence of Byzantine nodes, epidemic causal broadcast using an event store synchronized with an anti-entropy algorithm, random peer sampling in presence of Byzantine nodes and Sybil attacks, as well as a new epidemic total order broadcast which is tolerant to malicious nodes and provides high throughput message delivery

Книги з теми "Broadcast primitives":

1

Caldwell, Lesley, and Helen Taylor Robinson, eds. The Collected Works of D. W. Winnicott. Oxford University Press, 2016. http://dx.doi.org/10.1093/med:psych/9780190271343.001.0001.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Volume 2, 1939–45, covers the years of World War II. It contains an introduction by the late senior child psychotherapist, Christopher Reeves. The volume includes letters to colleagues, including one to the British Medical Journal with Emanuel Miller and John Bowlby regarding the war and children; a report on war work; Winnicott’s first article on aggression; articles on delinquency and corporal punishment; his contribution to the Controversial Discussions of the British Psychoanalytical Society; texts of his early BBC broadcasts; and the very significant paper, ‘Primitive Emotional Development’, a continually relevant statement of his own evolving position in regard to psychoanalytic theory and practice.

Частини книг з теми "Broadcast primitives":

1

Winnicott, Donald W. "The Development of a Child’s Sense of Right and Wrong." In The Collected Works of D. W. Winnicott, 295–98. Oxford University Press, 2016. http://dx.doi.org/10.1093/med:psych/9780190271381.003.0050.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this BBC radio broadcast, Winnicott argues that a child’s sense of right and wrong develops over time if the appropriate environmental conditions are there. He speaks of the baby and early infancy stages of childhood and asks that primitive and natural processes (such as biting greedily) be seen as both real and fantasized experiences. The parents can develop this into a child’s innate goodness and badness. If a child’s guilt at hating alongside loving is recognized and accepted by parents, the child can internalize these conflicts into a more mature sense of right and wrong.

2

Hewett, Richard. "The genesis of location realism." In The Changing Spaces of Television Acting. Manchester University Press, 2017. http://dx.doi.org/10.7228/manchester/9781784992989.003.0003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Just as studio realism reached its apotheosis in the 1970s, BBC television drama showed signs of moving away from the multi-camera practices of Television Centre and out onto location. While technologically primitive compared to the cameras used today, the early employment of Outside Broadcast videotape equipment for drama (as opposed to live sporting events) saw a move towards a less projected performance style, linked in turn to the gradual introduction in English drama schools of Constantin Stanislavski, whose influence in the UK had been signified a decade earlier by the opening of East 15 and the Drama Centre London. While training for television at drama academies remained minimal, this period saw the beginnings of the birth of location realism, whose emergence in Survivors was praised by contemporary viewers.

3

Reeves, Christopher. "Introduction to Volume 2." In The Collected Works of D. W. Winnicott, 3–22. Oxford University Press, 2016. http://dx.doi.org/10.1093/med:psych/9780190271343.003.0063.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this essay Reeves looks at Winnicott’s development as a paediatrician and an analyst before and during World War Two. He discusses two of Winnicott’s groundbreaking theoretical papers on psychoanalysis written at this time (Primitive Emotional Development and The Observation of Infants in a Set Situation), his fame as a BBC broadcaster speaking to parents about the effects of evacuation on them and their children, his experience of the scientific controversies within the British Psychoanalytical Society at this time, his work in the Oxfordshire Q Camps for evacuated young people, and the beginnings of his distinctive contribution to metapyschological theories in psychoanalysis.

Тези доповідей конференцій з теми "Broadcast primitives":

1

Stanoi, I., D. Agrawal, and A. El Abbadi. "Using broadcast primitives in replicated databases (abstract)." In the sixteenth annual ACM symposium. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/259380.259487.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Haeupler, Bernhard, and David Wajc. "A Faster Distributed Radio Broadcast Primitive." In PODC '16: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933057.2933121.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Camata, Jose J., Renato N. Elias, and Alvaro L. G. A. Coutinho. "MPI Broadcast com Compressão de Números de Ponto Flutuante." In Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2009. http://dx.doi.org/10.5753/wscad.2009.17390.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Aplicações cientificas desenvolvidas para sistemas paralelos de memória distribuída consomem parte do seu tempo total de execução trocando dados entre processos. Portanto, aprimorar o desempenho das rotinas responsáveis pela comunicação vem ganhando cada vez mais importância. Neste contexto, este trabalho investiga a utilização de um algoritmo de compressão de ponto-flutuante na transmissão de mensagens longas. Este algoritmo foi implementado na primitiva broadcast do MPI e foram efetuadas medições de desempenho para diferentes tipos de mensagens em até 512 núcleos de processamento. Os resultados obtidos demonstram que a compressão pode acelerar significativamente o broadcast padrão do MPI.

4

Lotspiech, Jeffrey B. "A Signature-Like Primitive for Broadcast-Encryption-Based Systems." In 2007 4th IEEE Consumer Communications and Networking Conference. IEEE, 2007. http://dx.doi.org/10.1109/ccnc.2007.210.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.