The Channel Branches & Network Vessels on the Tianhui Lacquered Meridian Figurine——Taking the Heart-Regulated Channel as an Example

Along with the surge of unearthed medical literature and cultural relics in recent years,a network of channels in the system of medical conduit vessels(meridians) during the early Western Han dynasty has become much clearer gradually.In it,the increasing number of channel branches,network vessels and needle insertion holes(acupoints) is an important feature of the development of channel medicine during the Western Han dynasty.This is not only a reflection of the expanding requirements of the theoretical system of the main trunk channels and other vessels,but also an inevitable result of the continuous enrichment and accumulation of clinical experience.This article integrates the information about channel branches,network vessels,inscriptions,dots and further relics on the Tianhui(天回) Lacquered Meridian Figurine to compare the unearthed literature of the channel genre with the transmitted classical literature about acupuncture.The “Heart-Regulated Channel” in Medical Manuscripts on Bamboo Slips from Tianhui(《天回医简》) serves as an example to explain the occurrence,development and changes of the channel branches and network vessels in the early system of medical channels.

H-infinity performance optimization for networked control systems with limited communication channels

This paper studies the problems of H-infinity performance optimization and controller design for continuous-time NCSs with both sensor-to-controller and controller-to-actuator communication constraints （limited communication channels）. By taking the derivative character of network-induced delay into full consideration and defining new Lyapunov functions, linear matrix inequalities （LMIs）-based H-infinity performance optimization and controller design are presented for NCSs with limited communication channels. If there do not exist any constraints on the communication channels, the proposed design methods are also applicable. The merit of the proposed methods lies in their Jess conservativeness, which is achieved by avoiding the utilization of bounding inequalities for cross products of vectors. The simulation results illustrate the merit and effectiveness of the proposed H-infinity controller design for NCSs with limited communication channels.

A Dual-Channel Secure Transmission Scheme for Internet-Based Networked Control Systems

Two significant issues in Internet-based networked control systems （ INCSs）, transport performance of different protocols and security breach from Internet side, are investigated. First, for improving the performance of data transmission, user datagram protocol （UDP） is adopted as the main stand for controllers and plants using INCSs. Second, a dual-channel secure transmission scheme （DCSTS）based on data transmission characteristics of INCSs is proposed, in which a raw UDP channel and a secure TCP （transmission control protocol） connection making use of SSL/TLS （secure sockets layer/transport layer security） are included. Further, a networked control protocol （NCP） at application layer for supporting DCSTS between the controllers and plants in INCSs is designed, and it also aims at providing a universal communication mechanism for interoperability of devices among the networked control laboratories in Beijing Institute of Technology of China, Central South University of China and Tokyo University of Technology of Japan. By means of a networked single-degree-of-free- dom robot arm, an INCS under the new protocol and security environment is created. Compared with systems such as IPSec or SSL/TLS, which may cause more than 91% network throughput deduction, the new DCSTS protocol may yield results ten times better, being just 5.67%.

Parameter estimation in channel network flow simulation

Simulations of water flow in channel networks require estimated values of roughness for all the individual channel segments that make up a network. When the number of individual channel segments is large, the parameter calibration workload is substantial and a high level of uncertainty in estimated roughness cannot be avoided. In this study, all the individual channel segments are graded according to the factors determining the value of roughness. It is assumed that channel segments with the same grade have the same value of roughness. Based on observed hydrological data, an optimal model for roughness estimation is built. The procedure of solving the optimal problem using the optimal model is described. In a test of its efficacy, this estimation method was applied successfully in the simulation of tidal water flow in a large complicated channel network in the lower reach of the Yangtze River in China.

Dynamic Evolutionary Game-based Modeling,Analysis and Performance Enhancement of Blockchain Channels

The recent development of channel technology has promised to reduce the transaction verification time in blockchain operations.When transactions are transmitted through the channels created by nodes,the nodes need to cooperate with each other.If one party refuses to do so,the channel is unstable.A stable channel is thus required.Because nodes may show uncooperative behavior,they may have a negative impact on the stability of such channels.In order to address this issue,this work proposes a dynamic evolutionary game model based on node behavior.This model considers various defense strategies'cost and attack success ratio under them.Nodes can dynamically adjust their strategies according to the behavior of attackers to achieve their effective defense.The equilibrium stability of the proposed model can be achieved.The proposed model can be applied to general channel networks.It is compared with two state-of-the-art blockchain channels:Lightning network and Spirit channels.The experimental results show that the proposed model can be used to improve a channel's stability and keep it in a good cooperative stable state.Thus its use enables a blockchain to enjoy higher transaction success ratio and lower transaction transmission delay than the use of its two peers.

Network Coding Cooperation Performance Analysis in Wireless Network over a Lossy Channel, M Users and a Destination Scenario

Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels;typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k < 2M unique linear equations, accounting for the fact that the remaining packets will be lost in the network and there are two transmission stages. Simulation results show the behaviour for two and three transmission stages. Our results show that applying NC protocols in two or three stages decreases the traffic significantly, beside the fact that the proposed protocols enable the system to retrieve the lost packets rather than asking for ARQ, resulting in improved data flow, and less power consumption. In fact, in some protocols the ARQ dropped from the rate 10ˉ1 to 10ˉ4, because of the proposed combining algorithm that enables the nodes to generate additional unique linear equations to broadcast rather than repeating the same ones via ARQ. Moreover, the number of the transmitted packets in each cooperative stage dropped from M (M - 1) to just M packets, resulting to 2 M packets instead 2 (M2 - 1) when three stages of transmission system are used instead of one stage (two cooperative stages).

HUSTserver:Implementation for Reliable and High-Performance Network Attached Storage System

Network attached storage (NAS) with the properties of improved scalability, simplified management, low cost and balanced price performance, is desirable for high performance storage systems applied to extensive areas. Unfortunately, it also has some disadvantages such as increased network workload, and inconvenience in disaster recovery. To overcome these disadvantages, we propose a channel bonding technique and provide hot backup functions in the designed NAS system, named HUSTserver. Channel bonding means merging multiple Ethernet channels into integrated one, and that the data packets can be transferred through any available network channels in a parallel mode. The hot backup function provides automatic data mirroring among servers. In this paper, we first describe the whole system prototype from a software and hardware architecture view. Then, multiple Ethernet and hot backup technologies that distinguish HUSTserver from others are discussed in detail. The findings presented demonstrate that network bandwidth can be scaled by the use of multiple commodity networks. Dual parallel channels of commodity 100 Mbps Ethernet are both necessary and sufficient to support the data rates of multiple concurrent file transfers. And the hot backup function introduced in our system provides high data accessibility.

Design and evaluation of Swift routing for payment channel network

Payment Channel Networks(PCNs)are a promising alternative to improve the scalability of a blockchain network.A PCN employs off-chain micropayment channels that do not need a global block confirmation procedure,thereby sacrificing the ability to confirm transactions instantaneously.PCN uses a routing algorithm to identify a path between two users who do not have a direct channel between them to settle a transaction.The performance of most of the existing centralized path-finding algorithms does not scale with network size.The rapid growth of Bitcoin PCN necessitates considering distributed algorithms.However,the existing decentralized algorithms suffer from resource underutilization.We present a decentralized routing algorithm,Swift,focusing on fee optimization.The concept of a secret path is used to reduce the path length between a sender and a receiver to optimize the fees.Furthermore,we reduce a network structure into combinations of cycles to theoretically study fee optimization with changes in cloud size.The secret path also helps in edge load sharing,which results in an improvement of throughput.Swift routing achieves up to 21%and 63%in fee and throughput optimization,respectively.The results from the simulations follow the trends identified in the theoretical analysis.

珠三角网河区河床冲刷深度计算与演变趋势分析

河床冲刷深度对穿河隧道的安全埋深设计至关重要。埋深不足会导致隧道运行安全和河道行洪安全受到威胁,而埋深过深会造成不必要的投资浪费。以珠三角网河区穿河隧道为例,基于河道地质和水文条件,对河床演变趋势进行深入分析,并采用规范推荐及业内常用的冲刷深度计算公式进行详细计算。通过对计算结果的比较分析,确定了合理的河道冲刷深度取值,为类似工程提供了参考依据。

基于5G的输电线路在线监测通信网络设计研究

通信网络是输电线路在线监测系统的重要组成部分,关系到监测数据的完整性和安全性。由于现行通信网络在实际监测中的数据通信效果并不理想,吞吐量较低且丢包率较高,通信网络性能存在一定缺陷。为解决这一问题,文章提出基于5G的输电线路在线监测通信网络设计。利用5G技术来设计输电线路在线监测的通信网络模型和信道,同时基于开放式系统互连(Open System Interconnect,OSI)参考模型来设计通信网络协议,从而完成基于5G的输电线路在线监测通信网络的整体设计。经实验验证,所设计的通信网络吞吐性能良好,丢包率在1%以下,输电线路在线监测通信效果良好。

基于改进遗传算法优化的RBF网络的信道估计

为了提高通信系统信道估计的准确率,同时适应更大的数据量,进行更加复杂的数据计算,引入神经网络的方法进行信道估计,采用了BP和RBF神经网络进行实验对比,与传统信道估计方式相比有明显提升;在此基础上,进一步提出基于改进遗传算法优化的RBF神经信道估计方法,目的是帮助确定RBF网络的隐藏层参数,使得网络的参数趋于全局最优解,信道估计器的性能从而得到提升。经过Matlab仿真,改进后的RBF神经网络可以更好地解决信道估计问题,验证了此方法的可行性。

基于端到端系统的导频插入和信道估计设计

自深度学习技术驱动的端到端通信系统解决方案被引入后,通信系统的架构模式已经发生了巨大的变革。虽然该技术在AWGN信道上表现良好,但在无线信道环境变化情况下,其表现并不尽如人意。因此,当前普遍采用的策略是引入导频信号,将导频按照头部位置插入或固定间隔插入的方式插入数据流中,同时在端到端系统之外增设信道估计模块以补充信道信息。然而,这种做法实际上与端到端一体化的理念相矛盾。提出了一种综合的端到端系统,利用深度神经网络进行导频插入位置选择并设计接收机,使系统能够有效收集信道信息,进而顺利恢复传输数据。与传统的导频插入方案相比,该系统具备明显的性能优势,误码率降低1~2 dB。另外,针对各类信道环境,系统内部的导频插入算法都可以提供具有针对性且高效的导频插入方案,因此对通信环境具有极高的适应性。

高速铁路通信系统小区合并组网性能研究

为提高高铁应用场景下的无线通信速率,通信系统需向铁路5G专用移动通信系统(5G-R)演进,但5G-R系统的同频组网会带来频繁的小区切换和同频干扰问题,采用单频网(SFN)小区合并的组网方式是解决该问题的方法之一。为了进一步提升SFN系统的性能表现,在基站端和列车端进行天线分布式部署,构成分布式多输入多输出(MIMO)系统。为分析分布式天线部署对于SFN小区合并性能的影响,首先建立MIMO系统结构和传输模型;其次,建立可以描述列车高速移动时大尺度衰落和小尺度衰落的信道模型;最后,仿真分析系统容量和功率分配对分布式MIMO系统容量的影响。仿真结果表明,分布式MIMO系统比SFN系统在系统容量和小区覆盖方面具有更好的表现,且对信道环境的变化有更好的稳定性,并可以通过优化功率分配的方式进一步提高系统容量。

基于宽深超分辨率网络的信道估计方法

在正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)系统中由于快衰落导致信道特征不连续,常规的信道插值方法无法准确反应导频与整个信道之间的关联性。针对这一问题,提出了一种基于宽深超分辨率(Wide Deep Super-resolution,WDSR)网络的信道估计方法,把导频值通过最小二乘估计(Least Squares,LS)初步插值,再通过WDSR网络再次放大重构整个信道的响应。将信道估计插值上采样替换成初步插值和图像超分辨率上采样两步。仿真结果表明,与超分辨率卷积神经网络(Super-resolution Convolutional Neural Network,SRCNN)信道估计算法相比,在不同种类的信道以及导频数下WDSR信道估计方法均方误差性能提升约4.6 dB。

多路绝对激光测距仪精密三维控制网的建立与解算

建立高精度三维控制网是实现大型粒子加速器等精密工程测量的前提条件,目前主要通过间接测量两点间距离或者自由设站实现,而多路绝对激光测距仪可在0.02~30 m范围内直接测量空间中两点间距离,利用高精度绝对测距值可建立高精度的三维测边控制网。基于多路绝对激光测距仪高精度绝对测距性能,建立仅含控制点间距离的秩亏自由网平差模型,通过任意初值选取,应用改进的LM算法迭代求解非线性超定方程组实现坐标概算,得到方程组的一组解作为未知数的近似值进行整网平差,获得高精度控制点坐标。实验数据分析表明,在8 m×3.5 m×2.5 m的实验范围内,建立控制点平均点位精度优于±1.14μm的三维测边网,可满足现代工业生产中对安装定位的高精度需求。

中波应急广播覆盖网构建方案

通过对中波频段的特性分析,提出一种创新的中波应急广播覆盖网构建方案。基于信号传播理论和通信工程原理,结合地理信息系统(Geographic Information System,GIS)技术,优化中波发射台布局,提高应急广播信号的覆盖范围和稳定性。采用先进的调制解调技术和功率控制策略,有效克服信道传播中的多径效应和信号衰减,提升应急广播系统的抗干扰性。通过在不同地理环境下的仿真实验,验证所提出构建方案的可行性和效果,为中波应急广播系统的建设提供有力的技术支持,为应对突发事件提供可靠的通信保障。

Practical Polar Code Construction For Degraded Multiple-Relay Networks

In this paper, based on the characteristics of polar codes, a new decode-and-forward strategy called generalized partial information relaying protocol is proposed for degraded multiple-relay networks with orthogonal receiver components(MRNORCs). In such a protocol, with the help of partial information from previous nodes, each relay node tries to recover the received source message and re-encodes part of the decoded message for transmission to satisfy the decoding requirements for the following relay node or the destination node. In order to construct practical polar codes, the nested structures are developed based on this protocol and the information sets corresponding to the partial messages forwarded are also calculated. The proposed scheme is proved to be capable of achieving the theoretical capacity of the degraded MRN-ORCs while still retains the low-complexity feature of polar codes. We perform simulations to testify the practicability of the proposed scheme and compare polar codes by using successive-cancellation list decoder(SCLD) with traditional low-density parity-check(LDPC) codes. The results show that the obtained polar codes provide significant gain.

Performance analysis of an iSCSI-based unified storage network

In this paper, we introduced a novel storage architecture 'Unified Storage Network', which merges NAC( Network Attached Channel) and SAN( Storage Area Network) , and provides the file I/O services as NAS devices and provides the block I/O services as SAN. To overcome the drawbacks from FC, we employ iSCSI to implement the USN( Unified Storage Network) . To evaluate whether iSCSI is more suitable for implementing the USN, we analyze iSCSI protocol and compare it with FC protocol from several components of a network protocol which impact the performance of the network. From the analysis and comparison, we can conclude that the iSCSI is more suitable for implementing the storage network than the FC under condition of the wide-area network. At last, we designed two groups of experiments carefully.

基于改进卷积神经网络的可见光通信系统信道估计方法

为了提升可见光通信系统的通信质量,开展了基于改进卷积神经网络的可见光通信系统信道估计方法研究。首先,建立可见光通信系统信道模型,获取信道增益、LED限制带宽、频域响应的模等参数。其次,从可见光通信系统导频分布与导频间隔两个维度,设计系统导频结构,准确得出系统发送端想要传输的信道信息。利用改进卷积神经网络,开展可见光通信系统信道估计,求解信道估计结果。实验结果表明,该方法的信道估计误码率不存在大幅度波动,最高不超过0.5%,信道传输效果较好。

Water level updating model for flow calculation of river networks

Complex water movement and insufficient observation stations are the unfavorable factors in improving the accuracy of flow calculation of river networks. A water level updating model for river networks was set up based on a three-step method at key nodes, and model correction values were collected from gauge stations. To improve the accuracy of water level and discharge forecasts for the entire network, the discrete coefficients of the Saint-Venant equations for river sections were regarded as the media carrying the correction values from observation locations to other cross-sections of the river network system. To examine the applicability, the updating model was applied to flow calculation of an ideal river network and the Chengtong section of the Yangtze River. Comparison of the forecast results with the observed data demonstrates that this updating model can improve the forecast accuracy in both ideal and real river networks.