The Computational Power of Beeps

In this paper, we study the quantity of computational resources (state machine states and/or probabilistic transition precision) needed to solve specific problems in a single hop network where nodes communicate using only beeps. We begin by focusing on randomized leader election. We prove a lower bound on the states required to solve this problem with a given error bound, probability precision, and (when relevant) network size lower bound. We then show the bound tight with a matching upper bound. Noting that our optimal upper bound is slow, we describe two faster algorithms that trade some state optimality to gain efficiency. We then turn our attention to more general classes of problems by proving that once you have enough states to solve leader election with a given error bound, you have (within constant factors) enough states to simulate correctly, with this same error bound, a logspace TM with a constant number of unary input tapes: allowing you to solve a large and expressive set of problems. These results identify a key simplicity threshold beyond which useful distributed computation is possible in the beeping model.Comment: Extended abstract to appear in the Proceedings of the International Symposium on Distributed Computing (DISC 2015

Tight Bounds for MIS in Multichannel Radio Networks

Daum et al. [PODC'13] presented an algorithm that computes a maximal independent set (MIS) within $O(\log^2 n/F+\log n \mathrm{polyloglog} n)$ rounds in an $n$-node multichannel radio network with $F$ communication channels. The paper uses a multichannel variant of the standard graph-based radio network model without collision detection and it assumes that the network graph is a polynomially bounded independence graph (BIG), a natural combinatorial generalization of well-known geographic families. The upper bound of that paper is known to be optimal up to a polyloglog factor. In this paper, we adapt algorithm and analysis to improve the result in two ways. Mainly, we get rid of the polyloglog factor in the runtime and we thus obtain an asymptotically optimal multichannel radio network MIS algorithm. In addition, our new analysis allows to generalize the class of graphs from those with polynomially bounded local independence to graphs where the local independence is bounded by an arbitrary function of the neighborhood radius.Comment: 37 pages, to be published in DISC 201

Saddam Hussein is “dangerous to the extreme”: The ethics of professional commentary on public figures

People are intrinsically interested in the personalities of public figures such as the celebrities they follow, political leaders, and citizens at the center of newsworthy events. The goal of the present article is to examine the key issues that surround ethical commentary on public figures by psychologists, psychiatrists, and other mental health professionals. Public commentaries carry with them a host of issues from representing a given discipline such as psychology well, to potentially harming an individual who is discussed, to furthering public education about personality and mental health issues. For this reason such commentary deserves special consideration as to when and how it is appropriate to carry out

Noisy Beeping Networks

We introduce noisy beeping networks, where nodes have limited communication capabilities, namely, they can only emit energy or sense the channel for energy. Furthermore, imperfections may cause devices to malfunction with some fixed probability when sensing the channel, which amounts to deducing a noisy received transmission. Such noisy networks have implications for ultra-lightweight sensor networks and biological systems. We show how to compute tasks in a noise-resilient manner over noisy beeping networks of arbitrary structure. In particular, we transform any algorithm that assumes a noiseless beeping network (of size $n$) into a noise-resilient version while incurring a multiplicative overhead of only $O(\log n)$ in its round complexity, with high probability. We show that our coding is optimal for some tasks, such as node-coloring of a clique. We further show how to simulate a large family of algorithms designed for distributed networks in the CONGEST($B$) model over a noisy beeping network. The simulation succeeds with high probability and incurs an asymptotic multiplicative overhead of $O(B\cdot \Delta \cdot \min(n,\Delta^2))$ in the round complexity, where $\Delta$ is the maximal degree of the network. The overhead is tight for certain graphs, e.g., a clique. Further, this simulation implies a constant overhead coding for constant-degree networks

General Election and the Study of the Future

Indonesia's position in electoral development is getting better because of the legislation. It is different when a strong bargaining position is artificial. In this case, the state becomes strong because of its own efforts such as having sophisticated technology programs, producing sophisticated weapons, or having world-class athletes. The problem is when the candidate listed in the empty ballot has been elected by the community but the chosen one does not win, then such election is actually not of the will of the community. This study uses normative legal study design which means that it is normative juridical legal research. The approaches used in legal research are statute approach, case approach, and conceptual approach. Future elections will no longer change when there is no legal clarity in Indonesia if the robot is included in it. The election aimed at robots for is not being a contradiction but is a way out to produce elections that are truly fair. When we choose robots in the elections, artificial intelligence holds norms in society. Artificial intelligence will become a habit in Indonesia, turning to jus cogens because its main nature is indirect force

Leader election in synchronous networks

Worst, best and average number of messages and running time of leader election algorithms of different distributed systems are analyzed. Among others the known characterizations of the expected number of messages for LCR algorithm and of the worst number of messages of Hirschberg-Sinclair algorithm are improve

The Household of God: Building Communities of Shalom

This paper explores the problem of anxiety, loneliness, and division within the United States. Research shows that while anxiety, loneliness, and division are on the rise, church participation is on the decline. In light of this reality, this paper asks the question, “How can the church be a community so that lonely and anxious people can be seen, known, and belong?” From Genesis through Revelation, Scripture witnesses to God’s presence in creation, uniting with humanity to expand God’s heaven and earth temple into the rest of creation. Within God’s temple, God’s people are called to love God first, then self and neighbor. Both the second and third century church of Rome, as well as the Methodist movement in the eighteenth century focused on the heaven and earth dwelling place. They did this through a lens of paradise, patience, and practice, with their focus on both vertical and horizontal relationships. In the twenty-first century, neuroscience and psychology have discovered much about the workings of the human brain. The brain is a complex set of systems that function best when integrated and working together. Community development research shows that transforming communities are love-based rather than fear-based, and focused on creating spaces that invest in people and possibilities. They are Christ-centered and relationship-based. This paper argues that in order to address the needs of an anxious and lonely world, the church needs to be a place of shalom. It must join with God, in the power of the Holy Spirit, and in the unity of Christ to love God and one another, and do this through the lens of paradise, practice, and patience

Research in action (1983-03)

A publication devoted to describing the scholarly and creative activities of Virginia Commonwealth University.https://scholarscompass.vcu.edu/ria/1018/thumbnail.jp