Search

Using instance segmentation and video inpainting provides a significant leap in real-time football video broadcast enhancements by removing potential visual distractions, such as an occasional person or another object accidentally occupying the frame. Despite its relevance and importance in the media industry, this area remains challenging and relatively understudied, thus offering potential for research. Specifically, the segmentation and inpainting of camera operator instances from video remains an underexplored research area. To address this challenge, this paper proposes a framework designed to accurately detect and remove camera operators while seamlessly hallucinating the background in real-time football broadcasts. The approach aims to enhance the quality of the broadcast by maintaining its consistency and level of engagement to retain and attract users during the game. To implement the inpainting task, firstly, the camera operators instance segmentation method should be developed. We used a YOLOv8 model for accurate real-time operator instance segmentation. The resulting model produces masked frames, which are used for further camera operator inpainting. Moreover, this paper presents an extensive "Cameramen Instances" dataset with more than 7500 samples, which serves as a solid foundation for future investigations in this area. The experimental results show that the YOLOv8 model performs better than other baseline algorithms in different scenarios. The precision of 95.5%, recall of 92.7%, mAP50-95 of 79.6, and a high FPS rate of 87 in low-volume environment prove the solution efficacy for real-time applications. [ABSTRACT FROM AUTHOR]

After the annexation of Crimea by Russia in March 2014, the peninsula experienced a progressive transition of telecommunication and broadcasting infrastructure under Russian influence, followed by a wave of repression of Ukrainian media. Between 2014 and 2015, dozens of Ukrainian media organizations and independent journalists left the peninsula to continue working in exile. This paper explores the phenomenon of informational annexation using a mixed methods approach consisting of in-depth interviews with media and IT professionals as well as digital ethnography and network measurements. It argues that, besides pressure from pro-Russian authorities, journalistic work in the area is challenged by legal and infrastructural factors such as the absence of legal and financial protections for Ukrainian journalists traveling to Crimea, lack of holistic digital security within media organizations, and increased Internet censorship in Crimea. By analyzing the risk perceptions and digital security practices of exiled and Crimean civic journalists, this paper explores how informational annexation challenges journalistic work on the infrastructural and organizational level, enabling the rise of civic journalism, and how it affects journalists' individual digital security practices. In the context of the current Russian invasion of Ukraine, this research provides insights into some of the informational annexation tactics used by Russians in the occupied Ukrainian territories. [ABSTRACT FROM AUTHOR]

In this paper, probabilistic quantization on Unbiased Broadcast Gossip Algorithms (UBGA) is introduced to adapt to the limited bandwidth of distributed network channels. This innovative quantized consensus algorithm is called Quantized UBGA (QUBGA). By briefly describing the graph and time model, and reviewing UBGA, it is proved that QUBGA can converge in expectation and in the second moment for strongly connected digraphs. Furthermore, it is proved that the convergence rate of QUBGA is related to quantized resolution and topology structure. Performance analysis results are consistent with theoretical analysis. [ABSTRACT FROM AUTHOR]

Blockchain technology has been increasingly integrated into various fields of economic and social development. However, scalability issues such as low broadcast efficiency, high communication overhead, and high redundant transmission rate have greatly limited the large-scale application of blockchain. This paper proposes a new scalability-enhanced Kademlia network protocol (SEKad), which optimizes blockchain network transmission in terms of both network topology and communication broadcast mechanism, provides a new approach to solving the scalability problem from the network layer. In SEKad protocol, firstly, SEKad employs a method that aligns the physical topology with the network topology for node clustering. This strategy groups neighboring nodes into clusters, streamlining network complexity and reducing network diameter. Secondly, SEKad presents a cluster-adaptable network topology based on Kademlia (Kad-CA). Kad-CA improves the rationality and efficiency of per-hop routing, optimizing the construction of K buckets and thus enhancing overall network efficiency. Finally, within the network transmission model, SEKad devise the smallest sub-tree broadcasting mechanism and the minimum redundant transmission mechanism for Kad-CA. These mechanisms work to reduce the redundant transmission rate, and enhance broadcasting efficiency. In order to evaluate the performance of SEKad, we built an experimental platform and conducted evaluations. The experimental results show that SEKad has better network scalability and stability, the network diameter size can be reduced by 27% and the redundant transmission rate can be reduced by 30%. [ABSTRACT FROM AUTHOR]

With the increasing demand for data exchange between nearby devices in proximity-based services, enhancing the security of wireless mutual broadcast (WMB) networks is crucial. However, WMB networks are inherently vulnerable to eavesdropping due to the open broadcast nature of their communication. This paper investigates the improvement of secrecy performance in random-access-based WMB (RA-WMB) networks by integrating physical layer security (PLS) techniques with hybrid duplex (HBD) operations under a stochastic geometry framework. The HBD method balances half-duplex (HD) receiving and full-duplex (FD) transceiving, utilizing self-interference cancellation (SIC) to enhance PLS performance. Key operational parameters, including transmission probability (TxPr), friendly jammer density, and conditions for FD operation, are designed to maximize secrecy performance. The analytical and numerical results demonstrate significant improvements in PLS performance, with SIC playing a critical role, particularly in scenarios with dense legitimate nodes, and with TxPr adjusted to balance HD receiving and FD transceiving based on SIC imperfections. The proposed design principles provide a comprehensive framework for enhancing the security of WMB networks, addressing the complex interplay of interference and SIC in various network configurations. [ABSTRACT FROM AUTHOR]

International broadcasting services are typically designed to serve public diplomacy and soft power objectives. Traditionally, Western powers have explored and benefited from this state-sponsored media category. However, countries in the Global South, like Brazil, have endeavoured to establish cross-border television services to bolster their international presence. This paper scrutinizes TV Brasil Internacional as a case study, examining its designated functions, management, and funding models. The research illuminates through document surveys and semi-structured interviews that while the channel initially reflected Brazil's external policies and public service ideals, structural alterations enabling increased governmental intervention alongside budget cuts rendered the international service dormant. [ABSTRACT FROM AUTHOR]

The capacity to update firmware is a vital component in the lifecycle of Internet of Things (IoT) devices, even those with restricted hardware resources. This paper explores the best way to wirelessly (Over The Air, OTA) update low-end IoT nodes with difficult access, combining the use of unicast and broadcast communications. The devices under consideration correspond to a recent industrial IoT project that focuses on the installation of intelligent lighting systems within ATEX (potentially explosive atmospheres) zones, connected via LoRa to a gateway. As energy consumption is not limited in this use case, the main figure of merit is the total time required for updating a project. Therefore, the objective is to deliver all the fragments of the firmware to each and all the nodes in a safe way, in the least amount of time. Three different methods, combining unicast and broadcast transmissions in different ways, are explored analytically, with the aim of obtaining the expected update time. The methods are also tested via extensive simulations, modifying different parameters such as the size of the scenario, the number of bytes of each firmware chunk, the number of nodes, and the number of initial broadcast rounds. The simulations show that the update time of a project can be significant, considering the limitations posed by regulations, in terms of the percentage of airtime consumption. However, significant time reductions can be achieved by using the proper method: in some cases, when the number of nodes is high, the update time can be reduced by two orders of magnitude if the correct method is chosen. Moreover, one of the proposed methods is implemented using actual hardware. This real implementation is used to perform firmware update experiments in a lab environment. Overall, the article illustrates the advantage of broadcast approaches in this kind of technology, in which the transmission rate is constant despite the distance between the gateway and the node. However, the advantage of these broadcast methods with respect to the unicast one could be mitigated if the nodes do not run exactly the same firmware version, since the control of the broadcast update would be more difficult and the total update time would increase. [ABSTRACT FROM AUTHOR]

This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct. This time plays a crucial role in the performance of practical distributed systems. Although significant strides have been made in recent years on this question, progress has mainly focused on either asynchronous or randomized algorithms. By contrast, the good-case latency of deterministic synchronous BRB under a majority of Byzantine faults has been little studied. In particular, it was not known whether a good-case latency below the worst-case bound of t + 1 rounds could be obtained. This work answers this open question positively and proposes a deterministic synchronous Byzantine reliable broadcast that achieves a good-case latency of max (2 , t + 3 - c) rounds (or equivalently max (2 , f + t + 3 - n) ), where t is the upper bound on the number of Byzantine processes, f ≤ t the number of effectively Byzantine processes, and c = n - f the number of effectively correct processes. The proposed algorithm does not put any constraint on t, and assumes an authenticated setting, in which individual processes can sign the messages they send, and verify the authenticity of the signatures they receive. [ABSTRACT FROM AUTHOR]

The article introduces the new executive editorial team of Australasian Psychiatry for 2024. The team discusses the renewed aims, working model, and format of the journal, with a focus on improving psychiatric care in Australia and New Zealand. They also aim to mentor trainee and mid-career psychiatrists in academic psychiatry and publishing. The article mentions the inclusion of new Associate Editors and a renewed Editorial Committee to increase diversity and speed up the review process. The cover art for this issue depicts the digital triage model discussed in a paper in the journal. [Extracted from the article]

A dominating broadcast of a graph G is a function f : V (G) → { 0 , 1 , 2 , ... , diam (G) } such that f (v) ⩽ e (v) for all v ∈ V (G) , where e (v) is the eccentricity of v , and for every u ∈ V (G) , there exists a vertex v with f (v) ⩾ 1 and d (u , v) ⩽ f (v). The cost of f is ∑ v ∈ V (G) f (v). The minimum cost over all the dominating broadcasts of G is called the broadcast domination number γ b (G) of G. In this paper, we give new upper and lower bounds for γ b (G). We show that both the bounds are tight. Also, we improve the upper bound for a subclass of regular graphs. Further, we explore the broadcast domination numbers of generalized Petersen graphs and a subclass of circulant graphs. [ABSTRACT FROM AUTHOR]

In this paper, we investigate an architecture for autonomous distributed control of braking and driving force on each wheel of a vehicle equipped with in-wheel motors on four wheels. Specifically, in a scenario where the driving force of some wheels is reduced due to low-friction road or motor failure during going straight ahead, the remaining wheels that can generate driving force autonomously control the yaw rate caused by the unbalanced driving force and driving force reduction to maintain the vehicle behavior. To realize autonomous distributed control, we focus on broadcast control from the control theory of multi-agent systems, which deals with the control of systems composed of many elements. We verify by simulation that the proposed architecture performs as desired for the assumed scenario. [ABSTRACT FROM AUTHOR]

The co-occurrence of delusions and other symptoms at the onset of psychosis is a challenge for theories about the aetiology of psychosis. This paper explores the relatedness of delusions about the experience of thinking (thought insertion, thought withdrawal, and thought broadcasting) and auditory verbal hallucinations by describing their trajectories over a 20-year period in individuals diagnosed with schizophrenia, affective and other psychosis, and unipolar depression nonpsychosis. The sample consisted of 407 participants who were recruited at index hospitalization and evaluated over six follow-ups over 20 years. The symptom structure associated with thought insertion included auditory verbal hallucinations, somatic hallucinations, other hallucinations, delusions of thought-dissemination, delusions of control, delusion of self-depreciation, depersonalization and anxiety. The symptom constellation of thought withdrawal included somatic hallucinations, other hallucinations, delusions of thought dissemination, delusions of control, sexual delusions, depersonalization, negative symptoms, depression, and anxiety. The symptom constellation of thought broadcasting included auditory verbal hallucinations, somatic hallucinations, delusions of thought-dissemination, delusion of self-depreciation, fantastic delusions, sexual delusions, and depersonalization. Auditory verbal hallucinations and delusions of self-depreciation were significantly associated with both thought insertion and thought broadcasting. Thought insertion and thought withdrawal were significantly associated with other hallucinations, delusions of control, and anxiety; thought withdrawal and thought broadcasting were significantly related to sexual delusions. We hypothesize that specific symptom constellations over time might be explained as the product of pseudo-coherent realities created to give meaning to the experience of the world and the self of individuals in psychosis based on both prior top-down and ongoing bottom-up elements. [ABSTRACT FROM AUTHOR]

With the development of online programming, the broadcast TV industry has experienced some negative impacts. The program recommendation has become crucial to boost the industry's construction. While there have been many researches on program recommendation, there are still challenges to overcome such as alleviating the sparsity of user interaction data and improving the dynamics and generalizability of the recommendation model. In this paper, we propose a novel approach for TV program recommendation called heterogeneous information-based recommendation with graph enhanced representation (HGER). The HGER model mainly consists of two main modules. One is the program encoder which uses the program's heterogeneous information and attention mechanism to extract personalized content and considers high-order neighbor program representations through a graph structure. The other is the user encoder which utilizes the user's historical viewing behaviors and combines it with the graph structure to represent the high-order neighbor user. Thus, we implement an enhanced representation for both the program and user. Through extensive experiments on a real-world dataset, the results of AUC, NDCG and HR demonstrate that our approach can effectively enhance the dynamics and generalizability of the model for TV program recommendations. [ABSTRACT FROM AUTHOR]

Let G be a simple undirected graph. A broadcast on G is a function f: V (G) → N such that f(v) ≤ eG(v) holds for every vertex v of G, where eG(v) denotes the eccentricity of v in G, that is, the maximum distance from v to any other vertex of G. The cost of f is the value cost(f) =Σv∊V(G) f(v). A broadcast f on G is independent if for every two distinct vertices u and v in G with f(u) > 0 and f(v) > 0, dG(u, v) > max{f(u), f(v)}, where dG(u, v) denotes the distance between u and v in G. The broadcast independence number of G is then defined as the maximum cost of an independent broadcast on G. A caterpillar is a tree such that, after the removal of all leaf vertices, the remaining graph is a non-empty path. A lobster is a tree such that, after the removal of all leaf vertices, the remaining graph is a caterpillar. In [M. Ahmane, I. Bouchemakh and E. Sopena, On the broadcast independence number of caterpillars, Discrete Appl. Math. 244 (2018) 20-35], we studied independent broadcasts of caterpillars. In this paper, carrying on with this line of research, we consider independent broadcasts of lobsters and give an explicit formula for the broadcast independence number of a family of lobsters called locally uniform 2-lobsters. [ABSTRACT FROM AUTHOR]

Copyright of Horyzonty Wychowania is the property of Jesuit University Ignatianum in Krakow 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.)

Many autocrats govern with an in-group, whose support must be secured, and an out-group, which is subject to repression. How do autocrats exploit in-group/out-group dynamics to secure their survival? One strategy, we argue, is to broadcast out-group repression to the in-group as a signal of the regime's capacity for violence. Empirically, we focus on China, where the government represses ethnic Uyghurs in Xinjiang. Drawing on 1 million articles from six propaganda newspapers, we show that the regime broadcasts out-group repression to urban elites on each anniversary of the 1989 Tiananmen Square massacre, when 10% of Beijing residents joined anti-regime protests. To understand its effects, we conducted a survey experiment balanced on the national census during the June 2020 Tiananmen anniversary. Using a list experiment to mitigate preference falsification, we show that CCP propaganda about Uyghurs during the Tiananmen anniversary discourages protests among politically engaged urban elites because they fear repression. [ABSTRACT FROM AUTHOR]

An independent broadcast on a graph G is a function f : V → { 0 , ... , diam (G) } such that (i) f (v) ≤ e (v) for every vertex v ∈ V (G) , where diam (G) denotes the diameter of G and e (v) the eccentricity of vertex v , and (ii) d (u , v) > max { f (u) , f (v) } for every two distinct vertices u and v with f (u) f (v) > 0. The broadcast independence number β b (G) of G is then the maximum value of ∑ v ∈ V f (v) , taken over all independent broadcasts on G. We prove that every circulant graph of the form C (n ; 1 , a) , 3 ≤ a ≤ ⌊ n 2 ⌋ , admits an optimal 2 -bounded independent broadcast, that is, an independent broadcast f satisfying f (v) ≤ 2 for every vertex v , except when n = 2 a + 1 , or n = 2 a and a is even. We then determine the broadcast independence number of various classes of such circulant graphs, and prove in particular that β b (C (n ; 1 , a)) = α (C (n ; 1 , a)) , except for C (n ; 1 , 2) , C (2 a + 1 ; 1 , a) , or C (2 a ; 1 , a) with a ≠ 2 p and p ≥ 0 , where α (C (n ; 1 , a)) denotes the independence number of C (n ; 1 , a). [ABSTRACT FROM AUTHOR]

Due to the high demands of data communication, the broadcasting system streams the data daily. This service not only sends out the message to the correct participant but also respects the security of the identity user. In addition, when delivered, all the information must be protected for the party who employs the broadcasting service. Currently, Attribute-Based Broadcast Encryption (ABBE) is useful to apply for the broadcasting service. (ABBE) is a combination of Attribute-Based Encryption (ABE) and Broadcast Encryption (BE), which allows a broadcaster (or encrypter) to broadcast an encrypted message, including a predefined user set and specified access policy to install the authorization mechanism. It is desirable to hide all the information when producing in the ciphertext, which has not been considered in the previous works of ABBE. Motivated by the above issue, we devise a solution to achieve anonymity for the ABBE scheme, which not only hides the access structures but also anonymizes the user's identity. In this work, we propose two schemes as Anonymous Key Policy (AKP)-ABBE and Anonymous Ciphertext Policy (ACP)-ABBE with supporting multiple access structures by using OR / AND gates. Specifically, we present the generic constructions of AKP/ACP-ABBE on the building block of the Inner Product Encryption (IPE ), which enables the hidden user's identity and complex OR / AND -Gate access structure. We show that our proposed schemes are secured under the standard models. [ABSTRACT FROM AUTHOR]

Bell non-locality and steering are archetypal characteristics of quantum mechanics that mark a significant departure from conventional classical notions. They basically refer to the presence of quantum correlations between separated systems which violate a non-local inequality, the violation otherwise is not possible if we restrict ourselves only to classical correlations. In view of the importance of such unique correlations, one may be interested to generate more states exhibiting non-locality starting from a few, a protocol which is termed as broadcasting. However, in the present submission, we show using universal Buzek–Hillary (BH) quantum cloning machine that, if one restricts to broadcasting through local quantum cloning, then such non-locality cannot be broadcasted. Our study is done in the purview of the Bell-CHSH inequality and the CJWR [E G Cavalcanti et al, Phys. Rev. A80, 032112 (2009)] steering inequality. It is observed that when the number of measurement settings is greater than 6, some of the output states are steerable after the application of local optimal BH cloners. We found that, under some restrictions, if the Werner and Bell diagonal states are subjected to such procedures, then the resultant state is rendered unsteerable. We extended this study to three qubit systems and found that genuine tripartite non-locality cannot be broadcasted using universal BH local quantum cloners, when the Svetlichny's inequality was considered. For two qubit systems, we considered 10 5 simulated general local unitaries over Werner and Bell-diagonal states and found that for none of these states, broadcasting on non-locality and 3-steerability is possible. [ABSTRACT FROM AUTHOR]

Suicide-related media content has preventive or harmful effects depending on the specific content. Proactive media screening for suicide prevention is hampered by the scarcity of machine learning approaches to detect specific characteristics in news reports. This study applied machine learning to label large quantities of broadcast (TV and radio) media data according to media recommendations reporting suicide. We manually labeled 2519 English transcripts from 44 broadcast sources in Oregon and Washington, USA, published between April 2019 and March 2020. We conducted a content analysis of media reports regarding content characteristics. We trained a benchmark of machine learning models including a majority classifier, approaches based on word frequency (TF-IDF with a linear SVM) and a deep learning model (BERT). We applied these models to a selection of more simple (e.g., focus on a suicide death), and subsequently to putatively more complex tasks (e.g., determining the main focus of a text from 14 categories). Tf-idf with SVM and BERT were clearly better than the naive majority classifier for all characteristics. In a test dataset not used during model training, F1-scores (i.e., the harmonic mean of precision and recall) ranged from 0.90 for celebrity suicide down to 0.58 for the identification of the main focus of the media item. Model performance depended strongly on the number of training samples available, and much less on assumed difficulty of the classification task. This study demonstrates that machine learning models can achieve very satisfactory results for classifying suicide-related broadcast media content, including multi-class characteristics, as long as enough training samples are available. The developed models enable future large-scale screening and investigations of broadcast media. [ABSTRACT FROM AUTHOR]

We address in this work the topic of broadcasting one's visual reality, captured by the video cameras embedded in mobile and wearable devices, to a remote audience. We discuss several designs of such life broadcasting systems, which we position at the intersection of lifelogging, Alternate Reality, and Cross-Reality technology. To this end, we introduce the "Alternate Reality Broadcast-Time" matrix for the broadcasting and consumption of alternate realities, in which designs of systems that implement sharing and consumption of personal visual realities can be positioned, characterized, and compared. These design options range from simple video streaming over the web using conventional video protocols to mediated and augmented reality, to audio narration and vibrotactile rendering of concepts automatically detected from video captured by wearable cameras. To demonstrate the usefulness of our broadcast-time matrix, we describe three prototypes implementing lifelogging, concept recognition from video, augmented and mediated vision, and vibrotactile feedback. Our contributions open the way toward new applications that blend lifelogging, consumption of multimedia alternate realities, and XR technology to empower users with richer opportunities for self-expression and new means to connect with the followers of events in their lives. [ABSTRACT FROM AUTHOR]

Generation Z looks to novel media, including podcasts, to learn of the latest scientific innovations. This study compared the use of logical-scientific (LSC) to narrative (NC) communication in science-based podcasts. Participants listened to a podcast featuring LSC and NC while continuously rating their interest in the podcast. The NC section of the podcast received a higher average interest rating than the logical-scientific section. The LSC section received different levels of interest by science attitude level. Science podcasts should determine whether to focus on NC or LSC based on their target audiences. [ABSTRACT FROM AUTHOR]

Introduction: Non-stereotypical gender role endorsement is becoming more common in e-commerce live broadcasting. However, there is relatively little research on this topic, and the mechanism of its impact on purchase intention is not yet clear. Based on schema theory and experimental methods, this study explores the impact of non-stereotypical gender role endorsement (compared to stereotypical gender role endorsement) on purchase intention in e-commerce live broadcasting. Besides, we take traditional gender ideology as the moderating variable. Methods: We first selected experimental materials available for formal experiments through two pre-experiments. Secondly, this study conducted experiments on male/female product groups, respectively. Participants were recruited through the Credamo platform for both experiments. Results: Experiment 1 indicates that for female product, stereotypical gender role endorsement triggers higher consumer purchase intention compared to nonstereotypical gender role endorsement. The subsequent moderating effect test results manifest that traditional gender ideology plays a moderating role in this effect. Experiment 2 shows that for male product, there is no significant difference in the impact of the two types of endorsement on consumers' purchase intention. In other words, non-stereotypical gender role endorsement does affect consumers' purchase intention, but this effect exists only in female product, and is more significant for consumers with a high level of traditional gender ideology. Discussion: This study not only has certain theoretical significance for expanding the application boundaries of schema theory and congruence between celebrities and products endorsed, but also has practical significance for brand owners and streamers to effectively adopt non-stereotypical gender role endorsement to enhance purchase intention. [ABSTRACT FROM AUTHOR]

Guided by the theory of work adjustment (TWA), this study endeavors to investigate the relationship between the work adjustment of news presenters and their career decisions. Taking into account the unique circumstances of the Chinese media landscape and the applicability of TWA, a qualitative research design was adopted, in which 35 news presenters were interviewed to generate data that could be coded to construct a theoretical framework. The findings reveal that the disenchantment of professional authority and the bureaucratic management of Chinese official media have resulted in a negative work adjustment experience for news presenters. However, the study discovered no substantial departure of current news presenters from the industry. Despite the unpleasant work adjustment experiences, the ultra-stability of their jobs offered by official media and the appeal of occupational fame have drawn news presenters back to their existing careers. This study constructed a contextual framework to comprehend the work adjustment phenomenon among Chinese state-affiliated institutions, and offered advice for media managers and students of Broadcasting and Hosting Art major. [ABSTRACT FROM AUTHOR]

A broadcast on a nontrivial connected graph G = (V,E) is a function f: V → {0, 1, . . ., d}, where d = diam(G), such that f(v) = e(v) (the eccentricity of v) for all v V. The weight of f is s(f) = P v∈V f(v). A vertex u hears f from v if f(v) > 0 and d(u, v) = f(v). A broadcast f is dominating if every vertex of G hears f. The upper broadcast domination number of G is Gb(G) = max {s(f): f is a minimal dominating broadcast of G} . A broadcast f is boundary independent if, for any vertex w that hears f from vertices v1, . . ., vk, k = 2, the distance d(w, vi) = f(vi) for each i. The maximum weight of a boundary independent broadcast is the boundary independence broadcast number abn(G). We compare abn to Gb, showing that neither is an upper bound for the other. We show that the differences Gb - abn and abn - Gb are unbounded, the ratio abn/Gb is bounded for all graphs, and Gb/abn is bounded for bipartite graphs but unbounded in general. [ABSTRACT FROM AUTHOR]