Conformally-coupled dark spinor and FRW universe

We study conformal coupling of dark spinor fields to gravity and calculate the energy density and the pressure of the spinor in FRW spacetime. We consider the renormalizable potential of the spinor field. In the cases where the field is proportional to some power of the cosmic scale factor $a(t)$, we determine the Hubble parameter as a function of the scale factor and find analytic solutions for $a(t)$ when the spinor field matter dilutes as the universe expands. We discuss the possibility that both matter- and dark energy-dominated eras of our universe can be described by the dark spinor.Comment: 4 pages, Revised argument in section III, results unchanged. To be published in PR

Squash: low latency multi-path video streaming using multi-bitrate encoding

The demand for low latency video streaming has dramatically increased as live video streaming applications, such as Twitch and Youtube Live, are becoming more popular. According to the 2021 Bitmovin video developer report, the biggest challenge that video developers are experiencing today is providing low latency video streaming. One of the most common on-site live streaming methods is using a wireless LTE network. There have been many approaches for characterizing wireless links and accurately measuring available bandwidth to provide low latency streaming over a wireless LTE network link. However, even with fine-grained bandwidth estimation, video streaming on a single LTE link is still susceptible to unexpected network delay from a sudden drop in available bandwidth or temporal disconnection. People can utilize multiple wireless LTE links to overcome the limitations of using a single LTE link for low latency video streaming. Using multiple links can enhance video quality through increased bandwidth and resilience. However, multi-homed low latency video streaming protocols may achieve lower video quality than single-homed protocols when a frame is split and sent over more than one link. Suppose one of the links becomes congested or gets disconnected. In that case, the part of the frame sent on stable links must wait until the packets sent on the problematic link are re-transmitted through another link. Re-transmission requires at least one extra round trip time. A video player may skip the late frame or serve only the received part of the frame due to the re-transmission delay. Ferlin et al. suggest using Forward Error Correction (FEC) on Multipath TCP (MPTCP) to reduce re-transmission delay. However, FEC is not helpful in the event of a significant bandwidth drop. If the sender does not use sufficient redundancy to handle a significant bandwidth drop, the receiver will not receive enough blocks to decode the video data. FEC requires using a large portion of the network bandwidth for redundancy to handle significant bandwidth drops even when the links are stable. In this thesis, I present Squash, a low latency video transport protocol that encodes each frame at multiple bitrates and sends them across different links to minimize video stream disruption in the event of unexpected bandwidth drops. The encoder encodes a frame into multiple different bitrates, which are high-bitrate and low-bitrate. When a high- bitrate frame cannot arrive on time due to congestion from an unexpected drop in available bandwidth, the low-bitrate frame is used to replace the missing frame. This is because the low-bitrate frame is smaller and is sent on the links that are disjoint from those used by the high-bitrate frame. To the best of my knowledge, Squash is the first architecture that uses multi-bitrate frames to increase resilience against unexpected bandwidth drops in low latency video streaming over multiple wireless LTE links. In emulated wireless LTE network environment using Mahimahi network traces, the average SSIM of the video streamed on Squash is 13 – 58% higher than that streamed on the baseline protocol, which is designed in the same manner as Squash except that it employs single-frame encoding

Resilient Image Fusion

The paper describes a distributed spectral-screening PCT algorithm for fusing hyper-spectral images in remote sensing applications. The algorithm provides intrusion tolerance from information warfare attacks using the notion of computational resiliency. This concept uses replication to achieve fault tolerance, but goes further to dynamically regenerate replication in response to an attack or failure. The concepts of resiliency are incorporated through library technology that is application independent. This library hides the details of communication protocols required to achieve dynamic replication and reconfiguration in distributed applications. The paper provides a status report on our progress in developing the concept and applying it to image fusion. In particular we examine the performance of the PCT algorithm and compare the results with and without resiliency to assess the associated overhead