Search

Jensen, Pia Majbritt, Eva Novrup Redvall, and Christa Lykke Christensen (Eds.). (2023). Audiovisual Content for Children and Adolescents in Scandinavia: Production, Distribution, and Reception in a Multiplatform Era. Goteborg: Nordicom, [...]

Television writers’ work is considered women’s work in the context of the South Korean broadcasting industry in that almost nine out of ten of the more experienced writers in this industry are women. Using a feminist political economy approach, this article investigates how women became the overwhelming majority of television writers in South Korea during the 1980s and 1990s, and how this gendering process is connected with the precarization of labour in the South Korean broadcasting industry. The article describes how, by the end of the 20th century, the South Korean broadcasting companies reorganized and expanded a writing workforce that formerly wrote scripts for fiction programs into a gendered, precarious workforce that performed diverse duties across genres. This research further develops the concept of feminization of labour for understanding the precariousness workers have experienced and contributes to our understanding of the intersection of gender and labour issues in cultural industries. [ABSTRACT FROM AUTHOR]

The Media Act 2024 introduces substantial reforms to the UK’s media regulation framework, to reflect the shift away from a basically linear broadcasting model to new forms of programme delivery in fast-changing markets where audiences expect to have a variety of primarily internet-based sources to access programme-like material as and when they choose. At the same time, its policy objective is to sustain the UK’s public service tradition, with a principal concern being to preserve and protect public service content from being overrun or sidelined by new forms of delivery over the internet, both in the UK and also internationally. [ABSTRACT FROM AUTHOR]

The existence of multiple edge-disjoint Hamiltonian cycles (EDHCs for short) is a desirable property of interconnection networks. These parallel cycles can provide an advantage for algorithms that require a ring structure. Additionally, EDHCs can enhance all-to-all data broadcasting and edge fault tolerance in network communications. In this paper, we investigate the construction of EDHCs in the balanced hypercube, which is a variant of the hypercube with many attractive properties, such as strong connectivity, regularity, and symmetry. In particular, each processor in the balanced hypercube has a backup processor that shares the common neighbors, enabling fault tolerance and efficient system reconfiguration. In 2019, Lü et al. provided an algorithm to construct two EDHCs in an n -dimensional balanced hypercube B H n for n ≥ 2. We further study this topic and give some construction schemes to construct 2 ⌊ log 2 n ⌋ EDHCs in B H n for n ≥ 2. Since B H n is 2 n -regular, our result is optimal for n = 2 r (r ≥ 1). In addition, we simulate the fault-tolerant data broadcasting through these parallel cycles as transmission channels. [ABSTRACT FROM AUTHOR]

Traditional IP-based unicast routing cannot utilize the inherent broadcast property of wireless network, and unicast path can be broken down frequently due to node mobility. Based on the nature of named data networking (NDN) which faces "content" rather than "host", broadcast mode can be applied for content delivery in named data mobile ad hoc networks (ND-MANETs). However, since there are no acknowledgment and retransmission mechanisms in the broadcast mode of IEEE 802.11 protocol, it would cause the problem of transmission unreliability. Moreover, if all forwarding nodes transmit packet concurrently, it can easily lead to collision and redundancy. This paper presents a reliable broadcasting-based content acquisition scheme for highly dynamic ND-MANETs, which makes full use of the inherent broadcast nature of wireless network, and solves the unreliability, collision, and redundancy problems. We define Transmission Reliability Degree (⁠|$TRD$|⁠) for broadcast mode, and estimate its value through Markov model. A content-oriented and |$TRD$| of sending node-based resend algorithm is proposed to improve reliability of broadcast transmission. An area divided and |$TRD$| of receiving node-based reforwarding algorithm is proposed to reduce collision and redundancy. Simulation results demonstrate the effectiveness and efficiency of the proposed mechanism. [ABSTRACT FROM AUTHOR]

This study addresses the limitations of military action and the inevitability of reinforcing it with communication, i.e., broadcasting messages to influence the recipient to adopt a particular stance. The focus of the study is on the concept of «synchronization» and the close connection between simultaneous use of military action and the release of images, which was a «precedent» media approach undertaken by the Al-Qassam during their attack. The study presents a sample with two differing drivers moving toward «postmodernity» and towards methodological authenticity (semiology. It interrogates the text and moves it in directions that transcend temporal-spatial boundaries to draw a significant conclusion: the «mediatization» of this military operation exacerbated the enemy’s military losses and replaced one mental image with another, elevating the painful resistance act into a delightful, fantastical one. [ABSTRACT FROM AUTHOR]

Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast time problem asks for the minimum number of steps in which a signal can be transmitted from the sources to all other nodes in the graph. In each step, the sources and the nodes that already have received the signal can forward it to at most one of their neighbour nodes. The problem has previously been proved to be NP‐hard. In the current work, we develop a compact integer programming model for the problem. We also devise procedures for computing lower bounds on the minimum number of steps required, along with methods for constructing near‐optimal solutions. Computational experiments demonstrate that in a wide range of instances, in particular instances with sufficiently dense graphs, the lower and upper bounds under study collapse. In instances where this is not the case, the integer programming model proves strong capabilities in closing the remaining gap and proves to be considerably more efficient than previously studied models. [ABSTRACT FROM AUTHOR]

The network layer plays a crucial role in blockchain systems, enabling essential functions such as message broadcasting and data synchronization. Enhancing data transmission structures and methods at this layer is key to improving scalability and addressing performance limitations. Currently, the uneven distribution of neighboring node lists and the lack of awareness of underlying linkages in coverage networks hinder the efficiency and comprehensiveness of information transmission. To tackle these challenges, this study introduces a dual-layer transmission model, FPSblo-EP, which divides the blockchain P2P network into two layers: the regular node layer and the tagged node layer. In the initial stage, network nodes are treated as points in a point cloud, and farthest point sampling is applied to the P2P network nodes. During this process, geographic distances between nodes serve as input parameters, while node degrees are used as point weights. Tagged nodes can then provide efficient and stable inter-group routing for regular nodes, creating a hierarchical transmission architecture. This model improves both transmission performance and scalability in blockchain overlay networks. Experimental results show that FPSblo-EP reduces message coverage latency by 22%, redundancy by 26%, and the network stretch coefficient by 28%, demonstrating superior load-balancing capabilities and enhanced network reliability. [ABSTRACT FROM AUTHOR]

Quantum conferencing enables multiple nodes within a quantum network to share a secure conference key for private message broadcasting. The key rate, however, is limited by the repeaterless capacity to distribute multipartite entangled states across the network. Currently, in the finite-size regime, no feasible schemes utilizing existing experimental techniques can overcome the fundamental rate-distance limit of quantum conferencing in quantum networks without repeaters. Here, we propose a practical, multi-field scheme that breaks this limit, involving virtually establishing Greenberger-Horne-Zeilinger states through post-measurement coincidence matching. This proposal features a measurement-device-independent characteristic and can directly scale to support any number of users. Simulations show that the fundamental limitation on the conference key rate can be overcome in a reasonable running time of sending 1014 pulses. We predict that it offers an efficient design for long-distance broadcast communication in future quantum networks. Quantum networks require secure conference keys for users to communicate and decrypt broadcasts. The authors propose a quantum conferencing protocol that overcomes key rate limits in networks without repeaters by using post-measurement coincidence matching, enabling secure, efficient, and flexible communication resistant to detector side channel attacks. [ABSTRACT FROM AUTHOR]

Here we consider the communications tactics appropriate for a group of agents that need to "swarm" together in a challenging communications environment. Swarms are increasingly important in a number of applications, including land, air, sea and space exploration, and their constituent agents could be satellites, drones, or other autonomous vehicles. A particularly difficult problem is to autonomously connect a swarm of agents together in a situation where stringent communication constraints are present, whether due to a need for stealth, restricted on-board power, external requirements to avoid certain broadcast directions, or equipment & hardware limitations. Here we present a novel, discrete, geometry-free model applicable to multi-agent swarm communications where a group of agents need to connect together and where the constraints on the communications dominate the algorithmic outcomes. No global knowledge of the agent locations is held and hence our framework proposes agent-centric performance metrics. We demonstrate our model using a set of candidate connectivity tactics and we show how simulated outcome distributions, risks and connectivity depend on the ratio of information gain to information loss. We also show that checking for excessive round-trip-times can be an effective minimal-information filter for determining which agents to no longer target with messages. The framework and algorithms that are presented here have wider application in testing efficient communication tactics across agent swarms in designated scenarios and testing the connectivity outcomes for future systems and missions. [ABSTRACT FROM AUTHOR]

Abrupt, local frictional fault failure comprises a displacement that is normally accompanied by acoustic emission (AE)—an impulsive elastic wave broadcast with an amplitude proportional to particle velocity. The aggregate of these displacements is the basic fault motion. In laboratory shear experiments, the examination of a sequence of laboratory earthquakes includes continuous measurements of fault motion and the associated AE that is broadcast. From these measurements, connections between the fault motion and cumulative sum of the AE amplitude can be identified. The composition of the AE broadcasts reveals inhomogeneity in the fault mechanical structure from which they arise. This inhomogeneity can be decomposed into a time invariant AE component and an articulated AE component. The articulated AE component serves as a "state of the fault diagnostic" that follows a distinctive pattern to fault failure. Thus, the articulated AE component can be used directly to monitor the state of the fault. [ABSTRACT FROM AUTHOR]

The purpose of this study is to explore content creator preferences in broadcast media, with a specific focus on the impact of integrating 3D graphics to enhance viewer engagement. In this study, we investigated the integration of 3D technology in broadcasting. We examined the preferences of content creators and assessed the impact of 3D photo-real human representations on perceived production quality and viewer engagement. Data was collected through surveys, interviews, and real-time broadcast analysis to gain insights into this technology's potential benefits and challenges in broadcasting. Our findings indicate that incorporating 3D photo-real human representations into broadcasting significantly improves production quality and viewer engagement, especially in real-time broadcasts. We also observed that 3D humans offer greater depth and presence, although challenges in fidelity and orientation highlight areas for technological advancement. Additionally, our study revealed the complementary nature of 2D and 3D visuals in broadcasting, with each modality serving distinct purposes-2D for clarity and information conveyance and 3D for immersive experiences. This research suggests a paradigm shift in broadcast content creation, where integrating 3D technologies, such as 3D photo-real human representations, can lead to more dynamic, engaging, and visually appealing content across various platforms. The study's findings provide explicit guidelines for content creation, catering to diverse viewer preferences and evolving consumption patterns. This research contributes to the broader understanding of how technological advancements in extended reality can effectively enhance the media landscape. [ABSTRACT FROM AUTHOR]

With the advancement of information technology and the varied demands of people's daily lives, the progress of podcasts has gradually matured. Podcasts are capable of catering to users' needs for companionship, free-form content, and interactive listening experiences, effectively meeting users' listening requirements. These attributes enhance users' inclination to engage with podcasts. Previous studies have concentrated primarily on the realms of education and broadcasting convergence, featuring specificity and failing to comprehensively examine motivations for podcast usage across various disciplines. Thus, this research delves into the existing literature on motivations for utilizing podcasts across various fields to gain insights into the current state of research topics and to compare variations in individuals' motivations for using podcasts in diverse fields. This study systematically reviewed key literature on people's motivations for using podcasts with different contents. The PRISMA method was employed for the systematic review of the literature from 2004 to 2023. Scopus and Web of Science were selected as the study's main sources. The analysis of thirty-one selected articles on podcast usage motivations revealed six distinct content categories: education, various genres, health, crime, politics, and sports. Additionally, various usage motivations were identified, namely, entertainment, knowledge acquisition, convenience, and multitasking. These findings have the potential to guide future research in this field. [ABSTRACT FROM AUTHOR]

Since Ethiopia's 2018 transition, sporadic ethnic and political violence and conflict and inter-group divisions have brought the nation to its knees. This study aims to assess the presence of the Hostile Media Phenomenon (HMP) among audiences of Ethiopian private, regional and federal television channels. Survey data were gathered from 600 participants living in Addis Ababa City, Amhara and Oromia regional states and were purposely chosen based on their historical and political dominance in the country. The study examined six different television channels found in the three regions: Oromia Broadcast Network (OBN), Amhara Broadcast Corporation, Addis TV, Wlata TV, Fana Broadcast Corporation (FBC) and Ethiopian Broadcast Corporation (EBC). The results of this study indicate that the regional states' television channels play a major role in intensifying the hostile media phenomenon as well as in motivating violence and conflict among different regional states and groups of people. [ABSTRACT FROM AUTHOR]

The pixel unit is an essential component of many encryption schemes. In the beginning two substitution tables, separately constructed from chaotic maps namely, the logistic map, slanted tent map, and the AJ map, which has a very high Lyapunov exponent and is very sensitive to start factors, are used to make modifications at the pixel level. These S-Boxes have a maximum period and are produced from several linear congruential generators. This approach uses newly developed confusion and diffusion functions connected to the recently built substitution tables to perform a refined Vigenere strategy. The purpose of this chaining is to defend the system from differential assaults. Extensive simulations on a variety of image formats and sizes confirm our process's robustness against identified dangers. [ABSTRACT FROM AUTHOR]

Most current broadcast encryption with optimal parameters is limited to Nick's class 1 (NC1) circuits and does not support polynomial‐depth circuits (P‐depth circuits), making it difficult to provide flexible access control in broadcast channels among vast user groups. To address this problem, we propose a ciphertext‐policy attribute–based encryption (CP‐ABE) that supports P‐depth circuits on lattices, achieving fully collusion resistance with randomization via the matrix tensors, thereby, making it impossible for unauthorized users to get any details about the plaintext even though they join forces and reducing the security to the evasive learning with errors (evasive LWE). By using matrix tensor–based randomization and evasive LWE, we achieve a new optimal broadcast encryption scheme based on lattice specifically designed to support P‐depth circuits. Since the matrices we choose as tensors have a low‐norm block diagonal structure, the use of evasive LWE is sufficient to ensure security for our scheme. Compared with similar studies, it not only avoids being involved with low‐norm matrices that restrict the system to NC1 circuits, but also eliminates the need for an additional assumption of the unproven tensor LWE. In addition, the use of matrix tensors further expands the dimensionality, which in turn enables the encryption of bit strings rather than a single bit, significantly reducing ciphertext expansion. Meanwhile, the CP‐ABE that we use to achieve the broadcast encryption scheme has a more compact ciphertext with a parameter size of O(m2 · d). [ABSTRACT FROM AUTHOR]

Almost from the start of radio broadcasting, the International Council of Women (ICW) took particular interest in the medium, founding a Broadcasting Committee in 1936. This article examines the organisation’s approach to radio as it emerged in the late 1920s and 1930s. It explores these developments through the identities of three women who steered the ICW’s broadcasting work: the internationalist French-American Laura Dreyfus-Barney; the Swedish journalist and women’s rights campaigner Margareta von Konow; and the ‘model fascist’ Italian mathematician Maria Castellani. It reveals the range and scope of ICW feminisms, the roles of its members as both activists and professionals, how women’s radio expertise was defined, and, finally, how radio broadcasting became a key part of ICW strategy. [ABSTRACT FROM AUTHOR]

Hybrid radio has the potential to transform people's in-car radio experience, as it offers a multitude of new features. This article discusses an in the field trial of an in-car hybrid radio service, consisting of different features like interactive menus, voice control and time shifting. The article addresses the methodological test setup and results of the field trial with 14 test-users in the UK and provides a reflection on the user evaluation of the developed hybrid radio tool. Results indicate that participants particularly value now playing and voice control as necessary hybrid in-car radio functionalities. Other functionalities such as time shifting were considered nice to have. The participants did have a concern for safety when navigating the in-car application. The willingness to pay for in-car radio systems was also low. [ABSTRACT FROM AUTHOR]

Since 1967 Jan van Veen has been reciting poems for the Dutch radio program Candlelight, the world's longest-running radio poetry show. Candlelight poems almost always contain end rhymes and revolve around emotional themes. This article examines Candlelight poetry specifically as radio poetry. Three aspects are explored: the wide reach, the accessibility and the meaningful relationship between the linguistic and material code of the poems. The results of a survey conducted among Candlelight listeners are presented. And a material reading is given of a Candlelight poem, recited during a memorial broadcast on the MH17 plane crash in Ukraine in 2014. [ABSTRACT FROM AUTHOR]

Pioneer educators who labored to elevate broadcasting to the status of a respected discipline in higher education have received limited historical study. The storied academic career of Sherman Paxton Lawton ascended in one of the most transformative eras in mass communication history, the introduction of radio and television. This article chronicles not only Lawton's achievements in broadcast education—publication of the first broadcast textbook and founder of a national honorary—but also his contributions to the study of human history and controversial political activism that tested the limits of a tenured professor's free speech. [ABSTRACT FROM AUTHOR]

This study augments seminal podcasting literature by exploring the motivations of independent sports podcasters specifically. The study's in-depth interviews produced findings that are consistent with prior research about the value of listener feedback, relationships, and a sense of community; however, new considerations are introduced including the ease of podcasting from both a technological perspective and a creative perspective. The findings contradict recent research suggesting that podcasters are becoming more focused on money and are therefore treating their creative efforts as a form of employment rather than leisure. Suggestions for future research include a focus on the use of livestream technology. [ABSTRACT FROM AUTHOR]

We propose a novel use of a broadcasting operation, which distributes univariate functions to all entries of the tensor covariate, to model the nonlinearity in tensor regression nonparametrically. A penalized estimation and the corresponding algorithm are proposed. Our theoretical investigation, which allows the dimensions of the tensor covariate to diverge, indicates that the proposed estimation yields a desirable convergence rate. We also provide a minimax lower bound, which characterizes the optimality of the proposed estimator for a wide range of scenarios. Numerical experiments are conducted to confirm the theoretical findings, and they show that the proposed model has advantages over its existing linear counterparts. [ABSTRACT FROM AUTHOR]

Beaconing is a fundamental task in IoT networks, where each node tries to locally broadcast a packet to all its neighbors. Unfortunately, the problem of Minimum Latency Beaconing Schedule (MLBS), which tries to obtain the fastest and collision-free schedule, is not well studied when the IoT devices employ the duty-cycled working mode. The existing works have rigid assumptions that there exists a single channel and can only work in a centralized fashion. Aiming at making the work more practical and general, in this paper, we investigate the first distributed method for the MLBS problem in Multi-channel asynchronous Duty-cycled IoT networks (MLBSMD problem). The MLBSMD problem is first formulated and proved to be NP-hard. To avoid collisions locally, several special structures are designed which can work in O (Δ 2) time, where Δ denotes the maximum node degree in the network. Then, a distributed beaconing scheduling method that can compute a low-latency and collision-free schedule is proposed with a theoretical bound, taking the active time slots of each node into account. Finally, the extensive simulation results demonstrate the effectiveness of the proposed algorithm in terms of latency. [ABSTRACT FROM AUTHOR]

In this paper, we delve into the investigation of locating broadcast 2-centers of a tree T under the postal model. The problem asks to deploy two broadcast centers so that the maximum communication time from the centers to their corresponding vertices is minimized. The broadcast 2-center problem explored in this study is essentially an extension of the classical 2-center problem. To efficiently address this challenge, we employ the binary search method, which enables us to present a highly effective O (n log n) -time algorithm for solving this problem. [ABSTRACT FROM AUTHOR]

Modern knowledge sharing platforms, such as Twitch, have gained significant popularity among developers. Twitch allows streamers (programmers) to broadcast real-time programming tasks across various domains. Viewers engage with streamers through live-chat messages, posting comments to other viewers or asking questions. However, the majority of comments are unhelpful, including spam and unrelated discussions. Streamers are faced with the challenge of identifying useful comments, either by reading the entire chat log, which diverts their attention from coding, or by periodically skimming through, risking the chance of missing important comments. Objective: Therefore, it is crucial to investigate and understand the content of viewer comments in live-streamed programming on Twitch. Method: In this paper, we present a manually labeled dataset of Twitch live-chat messages from programming streams. We conduct experiments to evaluate the accuracy of transformer-based models in automatically classifying these comments. Results: Our results illustrate that fine-tuning through training the BERT-base model with a specific preprocessing technique, @mention removal, can effectively classify Twitch live-chat messages with an F-score of 0.84. Conclusions: The outcomes of this work provide valuable insights for future research leveraging our labeled dataset, and the trained model can serve as a foundational approach for analyzing live stream platforms like Twitch. [ABSTRACT FROM AUTHOR]

Summary: The Internet of Things (IoT) continues to find novel applications across various domains. These applications require the support of efficient communication protocols in the Low Power and Lossy Networks (LLNs). The development of efficient multicast protocols is one such area that requires critical research attention. Efficient multicast protocols are especially important in the non‐storing mode of IPv6 Routing Protocol for LLNs (RPL), considering its applicability in real‐world IoT applications. However, the development of non‐storing RPL multicast protocols needs to handle the intricacies associated with source routing. Addressing these issues, this paper presents a novel multicast protocol named Multicast Forwarding in LLNs under Non‐storing mode (MFLN). MFLN uses Bloom Filters to minimize the overhead that comes with source routing. While retaining the best features of multicast protocols operating in the storing mode of RPL such as bidirectional traffic and cross‐layer optimization with ContikiMAC, MFLN also includes a novel metric named Mode Selection Metric (MSM) to decide the suitable link‐layer forwarding method. MSM makes this decision based on the ability of a node, in terms of its residual energy, to perform multiple link‐layer unicasts. Thus, MFLN saves the node battery from running out and at the same time reduces the duplicate packets created due to link‐layer broadcasts. The simulations conducted using Contiki‐COOJA indicate considerable improvements in terms of packet delivery ratio, energy consumption per delivered packet, packet transmissions, end‐to‐end delay, and normalized routing overhead for the proposed protocol. [ABSTRACT FROM AUTHOR]

Copyright of Ciencia y Educación (2707-3378) is the property of Duanys Miguel Pena Lopez and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Through an analysis of Islamic jurisprudence, ethics, and theological frameworks, the research identifies key considerations and implications for Islamic broadcasters engaging with social media platforms. The study employed a qualitative approach, drawing upon Islamic texts, scholarly literature, and interviews with Islamic broadcasters. Analysis focused on identifying theological principles relevant to social media engagement and examining strategies used by broadcasters to navigate digital communication landscapes. One significant finding is the tension between the imperative to disseminate Islamic teachings widely and the need to maintain theological integrity in online interactions. The study highlights the nuanced approaches taken by Islamic broadcasters to navigate this tension, emphasizing the importance of upholding Islamic values such as tawhid (monotheism) and adab (etiquette) while leveraging the reach and accessibility of social media. Overall, the findings underscore the necessity for a theological reevaluation of Islamic broadcasting practices in the digital age. By synthesizing traditional Islamic teachings, which refer to the principles, beliefs, and practices that have been passed down in Islam since the time of the Prophet Muhammad SAW and his companions, with contemporary digital realities, this research advocates for an approach that balances the imperative of outreach with the necessity of maintaining theological integrity. It concludes by emphasizing the importance of aligning digital practices with core Islamic values to ensure ethical and responsible engagement with social media platforms. [ABSTRACT FROM AUTHOR]

Broadcast ephemeris plays an important role in positioning, navigation, and timing (PNT) services. With the rise of new constellations of Galileo and BDS3, satellite services are moving towards multi-GNSS fusion. Therefore, systematic evaluation of the multi-GNSS broadcast ephemeris and determination of the impact of ranging errors of different constellations in the multi-GNSS standard single point positioning (SPP) are necessary. In the contribution, the 120-day broadcast ephemeris from 1 January 2022 to 30 April 2022 and precise ephemeris provided by three analysis centers (German Research Center for Geosciences (GFZ), European Centre for Orbital Determination (CODE), and Wuhan University (WHU)) are used to analyze the orbits, clock offsets, and signal-in-space ranging error (SISRE) for GPS, GLONASS, Galileo, BDS2, BDS3, and QZSS (G, R, E, C2, C3, and J). The ephemeris analysis shows that the assessments using the precise ephemeris from the three analysis centers are consistent. The average daily SISREs for different constellations evaluated by GFZ products are 0.16 ± 0.07 m (E), 0.38 ± 0.19 m (J), 0.46 ± 0.19 m (C3), 0.50 ± 0.17 m (G), 1.30 ± 0.27 m (C2), and 2.40 ± 0.73 m (R), respectively. In addition, we propose a weight determination method using joint weighting of SISREs and satellite elevation angle (Ele + SIS) based on the analysis. One consecutive week of observations tracked by 23 permanent reference stations is selected, and a comparison experiment is conducted using the classical elevation angle weighting scheme (Ele) and the Ele + SIS scheme in dynamic SPP to verify the feasibility. Compared to the classic Ele scheme, the positioning accuracy of GREC2C3J combined SPP using the Ele + SIS scheme is improved by 34.2 % in the 3D direction, and the 95th percentile of the positioning errors is reduced by 31.5 %. The same dynamic SPP test using data after one year of modeling the Ele + SIS weighting scheme shows that the enhancement of the positioning accuracy of the Ele + SIS scheme decreases by only 3.7 %, which demonstrates that the Ele + SIS scheme can be used in real-time application. [ABSTRACT FROM AUTHOR]

The media access control (MAC) address is the basis of frame forwarding in data‐link layer. When MAC missing occurs in the software‐defined network (SDN), the processing method is the same as that of Ethernet, which is also broadcast. The broadcast will spread and cover part or even the entire network, result in a large number of frames, which leads to a sharp increase in network traffic, even cause congestion. To suppress the layer‐2 flooding, a new frame forwarding method is proposed, namely, multidevice search and path generation (MSPG). New approach will search multiple devices when MAC missing occurs and calculate a forwarding path; a set of flow table is generated to restrain the switch from broadcasting. Experiments and analysis show that in comparison with the existing frame forwarding methods in SDN, MSPG can effectively suppress flooding, greatly reduce the network load, minimize the traffic between data plane and control plane when MAC missing occurs, and reduce energy consumption significantly. The MSPG's path calculation and flow dispatch method also decrease the forwarding delay and are more suitable for large‐scale network. [ABSTRACT FROM AUTHOR]

In unreliable asynchronous distributed systems with failures, achieving a causal view of the system across all processes is a challenging task. The Causal Reliable Broadcast (CRB) abstraction is used to solve this task. When CRB is implemented with algorithms that use logical vector clocks to timestamp broadcast events, the causal relationships between broadcast events can be detected with maximal accuracy. However, this timestamping mechanism used by CRB might not be useful for systems that need to reason about the causal relationships among both broadcast and delivery events. To address this challenge, the paper proposes a Causal Timestamp System (CTS) based on vector clocks that timestamps broadcast and delivery events capturing with maximal accuracy the causal relationships among those events. CTS simplifies the formal verification and testing of implementations of CRB algorithms based on CTS. Additionally, a new Global State Monitoring (GSM) algorithm is proposed, tailored to a distributed system that uses CRB with CTS. GSM enables finer-grained assessment of global states and application-dependent predicates of that system. We clarify these concepts with an IoT example. [ABSTRACT FROM AUTHOR]

University broadcasting was created in Brazil in 1950 and gained prominence at the end of the 1960s. Since then, public institutions have started to operate a few dozen stations. The scenario changed in 2023, in a movement coordinated by federal government and Empresa Brasil de Comunicação (EBC), in partnership with public universities and federal institutes. The objective of this article is to systematize the expansion of university and public broadcasting from that year, comparing it with the scenario in previous decades. This initiative can be equivalent to more than doubling the number of stations in Public Broadcasting National Network (RNCP). [ABSTRACT FROM AUTHOR]

We study the cooperative game associated with a broadcasting problem (the allocation of revenues raised from the collective sale of broadcasting rights for a sports tournament). We show that the set of core allocations can be characterized with three axioms: additivity, null team and monotonicity. We also show that the Shapley value can be characterized with additivity, equal treatment of equals and core selection. [ABSTRACT FROM AUTHOR]

Although daily scheduled radio broadcasting did not take hold until the early 1920s, wireless communication had been growing quickly for more than 20 years and live music was a regular feature by the time of Victor's 1925 broadcasts. These phenomena were captured in the images that follow. [ABSTRACT FROM AUTHOR]

In honor of the one-hundredth anniversary of the historic WEAF broadcast of January 1, 1925 featuring John McCormack and Lucrezia Bori, presented here are the original scripts, now in the public domain, of the seven 1925 broadcasts under the auspices of the Victor Talking Machine Company. The initial broadcast, received by over an estimated six million listeners, marked the beginning of radio broadcasting of major, world-renowned artists. The scripts are reprinted here for the first time, with an essay contextualizing Victor's approach to radio, what led to the broadcasts, and the results. [ABSTRACT FROM AUTHOR]

The Avro Arrow, the supersonic jet interceptor designed just outside Toronto to meet Royal Canadian Air Force specifications as the CF-105 but cancelled by Ottawa at the flight-testing stage toward the end of the 1950s, has long occupied a prominent place in the Canadian public imagination. To illustrate this phenomenon, commentators have repeatedly pointed to the range of representational forms, and individual instances therein, through which popular interest in the Arrow has manifested itself: page, stage, screen, and a myriad other means of expression. In doing so, they have often unintentionally signalled that these various manifestations are of equal relevance in demonstrating the impact of the Arrow on the national psyche. Through examining the origin, development, and broadcast aftermath of The Arrow, first aired by the Canadian Broadcasting Corporation around forty years after the events described, this article seeks to situate this dramatic miniseries within the long-running controversy surrounding the cancellation of the aircraft, and show how and why it has had a significantly greater impact in shaping popular national awareness of, and empathy for, certain beliefs concerning the nature and meaning of the rise and fall of the Avro Arrow in Canada than any other cultural artifact over the past six decades. [ABSTRACT FROM AUTHOR]

Quorum systems are a key abstraction in distributed fault-tolerant computing for capturing trust assumptions. They can be found at the core of many algorithms for implementing reliable broadcasts, shared memory, consensus and other problems. This paper introduces asymmetric Byzantine quorum systems that model subjective trust. Every process is free to choose which combinations of other processes it trusts and which ones it considers faulty. Asymmetric quorum systems strictly generalize standard Byzantine quorum systems, which have only one global trust assumption for all processes. This work also presents protocols that implement abstractions of shared memory, broadcast primitives, and a consensus protocol among processes prone to Byzantine faults and asymmetric trust. The model and protocols pave the way for realizing more elaborate algorithms with asymmetric trust. [ABSTRACT FROM AUTHOR]

Knödel graphs on even number of vertices serve as crucial components in constructing various broadcast graphs, particularly those on an odd number of vertices. The efficacy of these constructions heavily relies on the chosen broadcast scheme. Dimensional broadcast schemes are widely employed for broadcasting Knödel graphs. This paper delves into the investigation of standard and reverse dimensional broadcast schemes identifying numerous valid schemes. Specifically, let K G (n) be a Knödel graph of order n and k = ⌈ log n ⌉. We explore the impact of i cyclic shifts on both standard and reverse dimensional broadcast schemes of Knödel graphs, where 0 ≤ i ≤ k − 2 , with repetition of the second dimension. [ABSTRACT FROM AUTHOR]

The performance of Beidou satellite-based augmentation system (BDSBAS) single frequency augmentation service was evaluated and analyzed according to the shortcomings of the research on the corresponding operational performance support of the BDSBAS with the actual data. The calculation process of BDSBAS accuracy enhancement and integrity enhancement was comprehensively sorted out based on the relevant international standards. The process of accuracy enhancement and integrity enhancement was achieved through the publicly broadcast BDSBAS-BIC messages, and the enhancement results were used to evaluate the service performance of BDSBAS in China in the second quarter of 2022 in terms of precision, integrity and availability. The results show that during the test period, the BDSBAS single frequency augmentation service can support the accuracy and availability required for approach procedure with vertical guidance (APV)-I operation, and the horizontal and vertical accuracies respectively range from 1.5 to 5.5 m and from 2.5 to 10.3 m with the availability of APV-I operation of 99.871% (better than 99.000%). Although the transient integrity does not support APV-I, the positioning error is completely enveloped by the protection level without misleading information and dangerous misleading information events. [ABSTRACT FROM AUTHOR]