Pre‐symptomatic transmission of novel coronavirus in community settings

We used contact tracing to document how COVID‐19 was transmitted across 5 generations involving 10 cases, starting with an individual who became ill on January 27. We calculated the incubation period of the cases as the interval between infection and development of symptoms. The median incubation period was 6.0 days (interquartile range, 3.5‐9.5 days). The last two generations were infected in public places, 3 and 4 days prior to the onset of illness in their infectors. Both had certain underlying conditions and comorbidity. Further identification of how individuals transmit prior to being symptomatic will have important consequences.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/163478/2/irv12773.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/163478/1/irv12773_am.pd

Simultaneous radical cystectomy and colorectal cancer resection for synchronous muscle invasive bladder cancer and cT3 colorectal cancer: Our initial experience in five patients

To review cases of simultaneous radical cystectomy and colorectal cancer (CRC) resection for synchronous carcinoma of bladder and colorectum. Between May 1997 and September 2010, five patients were diagnosed with synchronous bladder cancer and CRCs. The primary colorectal tumors included three sigmoid cancers, one ascending colon cancer and one rectal cancer. All patients underwent simultaneous radical cystectomy and CRC resection. Pathologic types were confirmed by the biopsies of cystoscopy and colonoscopy. All patients were performed synchronous radical cystectomy and CRC resection. Four of them received adjuvant chemotherapies for CRC. Two of them died of liver metastasis 32.8 months and 13 months after surgery. Although patients with synchronous carcinoma of bladder and colorectum are rare, the Urologist should be alerted to this possibility when evaluating patients for the initially presenting symptoms and/or detected tumors. The simultaneous surgery is technically feasible for the selected patients

Advances in Software-Defined Technologies for Underwater Acoustic Sensor Networks: A Survey

Underwater Acoustic Sensor Networks (UASNs) are an important technical means to explore the ocean realm. However, most UASNs rely on hardware infrastructures with poor flexibility and versatility. The systems typically deploy in a redundant manner, which not only leads to waste but also causes serious signal interference due to multiple noises in designated underwater regions. Software-Defined Networking (SDN) is a novel network paradigm, which provides an innovative approach to improve flexibility and reduce development risks greatly. Although SDN and UASNs are hot topics, there are currently few studies built on both. In this paper, we provide a comprehensive review on the advances in software-defined UASNs. First, we briefly present the background, and then we review the progress of the Software-Defined Radio (SDR), Cognitive Radio (CR), and SDN. Next, we introduce the current issues and potential research areas. Finally, we conclude the paper and present discussions. Based on this work, we hope to inspire more active studies and take a further step on software-defined UASNs with high performances

On Secrecy Outage Probability and Average Secrecy Rate of Large-Scale Cellular Networks

We investigate the secrecy performance in large-scale cellular networks, where both Base Stations (BSs) and eavesdroppers follow independent and different homogeneous Poisson point processes (PPPs). Based on the distances between the BS and user, the intended user selects the nearest BS as serving BS to transmit the confidential information. We first derive closed-formed expressions of secrecy outage probability and average secrecy rate of a single-antenna system for both noncooperative and cooperative eavesdroppers scenarios. Then, to further improve the secrecy performance through additional spatial degrees of freedom, the above analyses generalize to the multiantenna scenario, where BSs employ the transmit antenna selection (TAS) scheme. Finally, the results show the small-scale fading has a considerable effect on the secrecy performance in certain density of eavesdroppers and small path loss exponent environment, and when the interference caused by BS is considered, the secrecy performance will be reduced. Moreover, the gap of secrecy performance between noncooperative and cooperative eavesdroppers cases is nearly invariable as the number of antennas increases

Multi-Antenna Jammer-Assisted Secure Short Packet Communications in IoT Networks

In this work, we exploit a multi-antenna cooperative jammer to enable secure short packet communications in Internet of Things (IoT) networks. Specifically, we propose three jamming schemes to combat eavesdropping, i.e., the zero forcing beamforming (ZFB) scheme, null-space artificial noise (NAN) scheme, and transmit antenna selection (TAS) scheme. Assuming Rayleigh fading, we derive new closed-form approximations for the secrecy throughput with finite blocklength coding. To gain further insights, we also analyze the asymptotic performance of the secrecy throughput in the case of infinite blocklength. Furthermore, we investigate the optimization problem in terms of maximizing the secrecy throughput with the latency and reliability constraints to determine the optimal blocklength. Simulation results validate the accuracy of the approximations and evaluate the impact of key parameters such as the jamming power and the number of antennas at the jammer on the secrecy throughput

Optimal Channel Training Design for Secure Short-Packet Communications

Physical layer security is a promising technique to ensure the confidentiality of short-packet communications, since no additional channel uses are needed. Motivated by the fact of finite coding blocklength in short-packet communications, we attempt to investigate the problem of how many the channel uses utilized for channel training should be allocated to perform secure communications. Based on the finite blocklength information theory, we derive a closed-form expression to approximate the average achievable secrecy throughput. To gain more insights, we also present the asymptotic average secrecy throughput under two special cases, i.e., high signal-to-noise ratio (SNR) and infinite blocklength. Moreover, we determine the optimal channel training length to maximize the average secrecy throughput under the reliability constraint and given blocklength. Numerical results are provided to validate the analysis and demonstrate that the performance gain achieved by the optimal channel training length is remarkable, relative to other benchmark schemes