Zika Virus Growth in Human Kidney Cells Is Restricted by an Elevated Glucose Level

Mosquito-borne Zika virus (ZIKV) became a real threat to human health due to the lack of vaccine and effective antiviral treatment. The virus has recently been responsible for a global outbreak leading to millions of infected cases. ZIKV complications were highlighted in adults with Guillain–Barré syndrome and in newborns with increasing numbers of congenital disorders ranging from mild developmental delays to fatal conditions. The ability of ZIKV to establish a long-term infection in diverse organs including the kidneys has been recently documented but the consequences of such a viral infection are still debated. Our study aimed to determine whether the efficiency of ZIKV growth in kidney cells relates to glucose concentration. Human kidney HK-2 cells were infected with different ZIKV strains in presence of normal and high glucose concentrations. Virological assays showed a decrease in viral replication without modifying entry steps (viral binding, internalization, fusion) under high glucose conditions. This decrease replication was associated with a lower virus progeny and increased cell viability when compared to ZIKV-infected HK-2 cells in normal glucose concentration. In conclusion, we showed for the first time that an elevated glucose level influences ZIKV replication level with an effect on kidney cell survival.     

采用八叉树和OSG分页结点的海量点云三维可视化

针对现有海量点云可视化方法存在索引构建时间长、内存占用大等问题，研究一种八叉树索引结合OSG分页结点的快速可视化方法，可在占用较小内存的基础上快速建立点云索引并实时调度。采用八叉树索引结构对海量点云进行数据组织，建立各层级的八叉树结点并以文件映射的方式分块保存，对结点文件重组织转换为支持OSG渲染引擎的多分辨率点云数据。采用基于OSG分页结点的实时调度技术，对海量点云进行高质量可视化。与目前两款主流的点云数据处理商业软件进行实验对比分析，结果表明所提方法具有索引建立速度快、内存占用小等优点，同时可视化交互更加流畅，适用于各种配置计算机下海量点云数据的调度管理与实时可视化。     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

An object replication algorithm for real-time distributed databases

A real-time distributed database system (RTDDBS) must maintain the consistency constraints of objects and must also guarantee the time constraints imposed by each request arriving at the system. Such a time constraint of a request is usually defined as a deadline period, which means that the request must be serviced on or before its time constraint. Servicing these requests may incur I/O costs, control-message transferring costs or data-message transferring costs. As a result, in our work, we first present a mathematical model that considers all these costs. Using this cost model, our objective is to service all the requests on or before their respective deadline periods and minimize the total servicing cost. To this end, from theoretical standpoint, we design a dynamic object replication algorithm, referred to as Real-time distributed dynamic Window Mechanism (RDDWM), that adapts to the random patterns of read-write requests. Using competitive analysis, from practical perspective, we study the performance of RDDWM algorithm under two different extreme conditions, i.e., when the deadline period of each request is sufficiently long and when the deadline period of each request is very short. Several illustrative examples are provided for the ease of understanding. Recommended by: Ashfaq Khokhar     

基于LotusNotes的文档ID应用剖析

介绍了文档数据库Lotus Domino／Notes的特点．对其文档处理的核心，即Notes文档的ID构成机制作了系统剖析．并在此基础上分析了如何在文档复制中运用ID的不同组件以及如何运用API程序访问文档ID等。     

Performance characteristics of cascaded delay‐line node architectures in single‐path interconnection networks

Internally buffered multistage interconnection network architectures have been widely used in parallel computer systems and large switching fabrics. Migration from electrical domain to optical domain has raised the necessity of developing node architectures with optical buffers. Cascaded fibre delay line architectures can be seen as possible realizations of output and shared buffering in a 2 × 2‐switching element. These approaches can be used as buffered node architecture in a Banyan like interconnect. In this paper, we investigate and compare these approaches by using simulation methods. Different performance metrics, such as normalized throughput, average packet delay, packet loss rate and buffer utilization have been used under uniform and non‐uniform traffic models. Results show that the TC‐chain node Banyan network offer an improved normalized throughput and average packet delay performances under both traffic models without disrupting first‐in‐first‐out order of arrivals. The switched delay‐line requires fewer switching elements than TC and TTC architectures but at the cost of high packet delay. Copyright © 2004 John Wiley & Sons, Ltd.     

超媒体系统中的人工智能方法

一、什么是超媒体近年来迅速崛起的多媒体(multimedia)技术,是一种使计算机具有交互式地综合处理和管理文字、图形、图象、声音、视频等多种媒体能力的技术,必将使计算机技术发生一     

单层多跨刚架在移动荷载作用下的影响量计算方法

讨论了桥梁、工业厂房和大型公共建筑中较多采用的单层多跨刚架在移动荷载作用下影响量的计算方法。以工程中计算连续梁的一次力矩分配法的概念和思路为基础,建立了结构中杆端真实抗转刚度和结点转角传递的概念及其相应计算公式,提出了一种单层多跨刚架超静定结构影响量的精确计算方法。算例表明,该方法较之传统的计算方法简捷,且既便于手算,也利于编制通用程序用于电算。     

轻型钢结构吊车梁设计方法及节点构造

通过分折和研究单层门式刚架轻型钢结构厂房中的吊车梁设计，总结了轻型钢结构吊车梁的设计方法和节点连接构造，对合理设计吊车梁，降低用钢量提出了设计建议。     

Research and Design of Network Management Construction Based on Mobile AGENT

The technical characters of mobile agent （MA） originated in the distributional artificial intelligence domain is introduced. A network management construction based on agent （NMCA） is then proposed. The NMCA structure features are elaborated in detail. A prototype design of NMCA is given by using the jKQML programming. The establishment of NMCA platform will be helpful to reduce the correspondence load of network management and improves the efficiency and the expansion ability of network management systems.