结合精确阵列响应控制的时域宽带波束图综合

提出了采用时域结构的低计算复杂度宽带波束图综合方法。首先,引入自适应零陷波束设计思想,通过在特定频率与角度设置虚拟干扰源,实现对旁瓣区域阵列响应的精确控制,多次迭代控制后满足波束设计要求。其次,所提方法能够在现有波束设计基础上实现灵活调整,根据旁瓣级等设计参数的变化快速更新波束图。理论研究表明,相较现有采用内点法的波束图综合方法,所提方法降低了单次迭代计算复杂度,有效提升了波束设计效率。仿真实验与半消声室实验结果表明,该方法所设计波束形成器相较传统固定波束形成器具有更低的旁瓣级,并且对方向性干扰有更好的抑制效果。     

光弹性分组环节点光分组的组装及时延分析

分析了光弹性分组环(ORPR)网络中流量成型时光分组组装算法,提出一种适合ORPR网络的基于控制发送时间的光分组组装算法,并给出了该算法的算法结构.该算法在混合门限组装算法的基础上,通过增加一个控制分组发送间隔的参数,使得光分组单位时间内流量的突发性被平滑,并可以保证ORPR网络的服务质量(QoS)性能,适合于使用容量有限光缓存的ORPR网络.对ORPR节点光分组平均组装时延进行了详细的分析,新算法通过对分组发送间隔的调整,使在不同负载条件下,组装时延的概率分布基本相同.在ORPR中,平均组装时延的稳定对ORPR网络的QoS性能和公平性调度有重要意义,而发送时机的合理选择,可以保证ORPR网络的QoS性能以及公平性.仿真结果表明,新算法使得ORPR网络中的光分组平均组装时延相对稳定,在大多数情况下,可以保证ORPR网络的调度要求.     

基于光楔阵列产生光学涡旋阵列的研究

在研究光楔衍射法产生单涡旋的基础上,基于长条形光楔阵列,提出了利用光束阵列衍射产生涡旋阵列的方法.该方法要求光束阵列在平行于光楔边缘方向上的光束间距等于光束直径的整数倍.利用超精密机床采用一体化加工法加工了光楔阵列元件,验证了该方法的可行性.利用空间光调制器快速灵活调整光束阵列的优点,搭建了借助空间光调制器加载达曼光栅衍射产生所需光束阵列的实验光学系统.针对光束阵列与光楔阵列的匹配问题,研究了达曼光栅掩模图基本单元对光束阵列的调控,获得了可调结构的光束阵列.实验产生了拓扑荷一致的光学涡旋阵列,与仿真结果相一致,证明所提方法的有效性.     

一种形位不确定回转壳体内壁表面的激光测量与重构方法研究

针对形位不确定回转壳体内表面的测量及重构问题,提出了一种准在线纵截线测量与曲面重构方法.通过粗、精测量相结合的实现过程,首先根据技术文件提取回转壳体的基本信息,并针对内表面存在的不确定性,建立一种模糊调节规则,对回转壳体内表面的形位进行预测,实时调整激光测量的角度与位置,完成测量.搭建激光测试试验平台,开发了模块化的测试平台软件系统.采用所提方法对回转壳体内表面进行测量试验研究,得到待测回转壳体内表面的三维数据,并进一步根据回转曲面二次加工的要求对曲面的重构方法进行分析,重构回转壳体内壁的三维曲面实体模型.试验结果表明,曲面模型的相对误差绝对值平均值小于0.024%.     

基于卷积神经网络的散斑图像位移场测量方法

提出了一种基于卷积神经网络(CNN)的数字散斑图像位移场测量方法.采用给定多种变形模式的精确位移场系列数字散斑图像构建数据集,提出了一种数字散斑图像位移场识别CNN模型.模拟散斑图像的验证实验表明,所提方法对随机变形、轴向均匀变形、剪切变形等模式具有良好的计算效率和测试精度.硅胶单轴拉伸验证实验表明,所提方法也可以精确测试真实实验散斑图像位移场并具有较高的计算效率.所提深度CNN能够高效、精确地测试数字散斑图像位移场,在材料变形测试中具有良好的应用前景.     

提高小波变换轮廓术测量精度的方法

小波在空域和频域上均具有良好的局域化性能,适合于非平稳信号分析。在传统的小波变换轮廓术中,对基小波进行尺度伸缩,即调整子小波的中心频率,去匹配局部条纹,以获取对应的相位信息。但仅在局部位置对Morlet小波进行尺度伸缩不能最佳地提取局部相位信息。详细分析了振荡波形随高斯窗宽变化的复Morlet小波在条纹分析中的特点,提出了一种改进的小波处理方法。将所提方法的相位重建结果与基于代价函数的小波方法的相位重建结果进行比较。结果表明:所提方法综合了不同窗宽的复Morlet小波优点,具有更可靠的脊提取结果;所提的优化小波脊提取方法在条纹分析中具有更好的抑噪能力,提高了小波变换轮廓术的测量精度;计算机模拟和实验均验证了所提方法的有效性。     

基于特征分量输出概率加权的多数据流鲁棒语音识别方法

针对传统多数据流语音识别方法不考虑数据流内各特征分量受噪声影响差异的缺点,提出了一种基于特征分量输出概率加权的数据流结合新方法,分析了特征分量输出概率加权对识别的影响,并结合丢失数据技术中的边缘化(Marginalisation)模型和软判决(Soft decision)模型给出了两种具体的数据流结合方案.将所提数据流结合方案应用到复合子带语音识别系统中,实验结果表明,所提识别方法可以根据噪声环境的不同自适应地调整数据流对识别影响的大小,其性能显著优于传统的多数据流识别方法.     

基于光场相机的全视差三维显示

针对光场相机采集的三维信息在显示时只能呈现非常窄的视差问题,对光场相机信息记录过程进行了分析,提出一种将光场数据转化为元素图像阵列(EIA),并对EIA中的物体进行重新采样以调整深度的全视差三维显示方法。为了验证该方法的有效性,使用光场相机采集真实三维物体,利用所提方法对光场图像进行处理后,将其在深度优先集成成像(DPII)系统中进行显示。实验结果表明,利用所提方法可以实现光场数据的全视差三维显示。     

关联复杂网络建模及辨识研究

运用异质耦合拆分方法和驱动-响应模型,提出关联复杂网络节点参数和拓扑结构的辨识方法.首先,研究异质关联复杂网络建模方法,进而依据网络耦合性质不同,拆分构造了两类异质关联复杂网络.然后运用驱动-响应模型、LaSalle不变原理和Gram矩阵,设计节点系统参数和拓扑参数的自适应辨识观测器.所提的观测器能在线获取网络的节点参数、不同耦合性质的拓扑参数.最后,通过数值仿真验证所提方法的有效性.     

基于图像内容对比感知的图像质量客观评价

为了提出性能优异的图像质量评价(IQA)模型,本文基于人类视觉感知特性和图像的灰度梯度、局部对比度和清晰度特征,提出了一种基于图像内容对比感知的IQA方法.在该方法中,首先结合视觉感知特性,基于物理学中对比度定义,提出一种图像质量定义及其值计算方法;之后,基于灰度梯度共生矩阵,提出一种图像灰度梯度熵的概念及其值的计算方法,并基于图像灰度梯度熵、局部对比度和清晰度,提出一种图像内容及其视觉感知的描述方法;最后,基于图像内容特征和图像质量定义,综合分析,提出IQA方法及其数学模型.并且采用5个开源图像数据库中的119幅参考图像和6395幅失真图像对其进行了仿真测试,同时分析和探讨了52种失真类型对IQA的影响;另外,为了说明所提IQA模型的优势,将其与现有的7个典型IQA模型,从精度、复杂性和泛化性能上进行了对比分析.实验结果表明,所提IQA模型的精度PLCC值在5个数据库中最低可以实现0.8616,最高可达到0.9622,其性能综合效益优于7个现有IQA模型.研究结果表明,所提IQA方法是有效的、可行的,所提IQA模型是一个性能优异的IQA模型.     

A QoS preference-based algorithm for service composition in service-oriented network

Quality of service (QoS) based provisioning for service-oriented network applications has been actively discussed because of user's specific requirements. An order relation vector model is proposed in this paper, which can be used to represent and calculate user's preference information effectively. User's preference order of QoS attributes is a possible approach to formulate user's specific QoS requirements in the context. In order to apply the preference order to actual application, a QoS attribute matrix is introduced to manage QoS attribute value; at the same time, a feasible method of defuzzifying and normalizing is also introduced to deal with the original QoS attribute matrix; user's preference order and the normalized QoS attribute matrix are used to calculate user's QoS attribute weight vector, which can be regarded as an evaluation criterion reflecting user's different QoS preference degrees. Finally, a service composition model and algorithm is proposed in this paper. The numerical examples indicate that the model delivers user's QoS preference reliably and the experiment shows that the algorithm is efficient.     

基于QoS和分簇机制的WMSNs路由算法研究

针对无线多媒体传感器网络中如何设计具有服务质量保证的路由算法问题,综合考虑的了节点间标准化后的丢包率、延迟、剩余能量、可用存储四个参数,提出算法ED-ACO(Energy and best distribution of Cluster Head Distance-Ant colony optimization )。ED-ACO算法采用基于剩余能量和簇首最佳距离分布的分簇结构,均匀划分网络,将节点的丢包率,延迟,剩余能量,可用存储标准化为具体参数,考虑到蚁群算法的状态转移概率公式中,利用该公式去选择下一跳路径传送感知数据,同时满足了服务质量要求。NS2仿真结果表明,与经典的AODV算法相比,在丢包率,延迟上保证了服务质量要求。     

Quality of Service based resource allocation in D2D enabled 5G-CNs with network slicing

With the rapid new advancements in technology, there is an enormous increase in devices and their versatile need for services. Fifth-generation (5G) cellular networks (5G-CNs) with network slicing (NS) have emerged as a necessity for future mobile communication. The available network is partitioned logically into multiple virtual networks to provide an enormous range of users’ specific services. Efficient resource allocation methods are critical to delivering the customers with their required Quality of Service (QoS) priorities. In this work, we have investigated a QoS based resource allocation (RA) scheme considering two types of 5G slices with different service requirements; (1) enhanced Mobile Broadband (eMBB) slice that requires a very high data rate and (2) massive Machine Type Communication (mMTC) slice that requires extremely low latency. We investigated the device-to-device (D2D) enabled 5G-CN model with NS to assign resources to users based on their QoS needs while considering the cellular and D2D user’s data rate requirements. We have proposed a Distributed Algorithm (DA) with edge computation to solve the optimization problem, which is novel as edge routers will solve the problem locally using the augmented Lagrange method. They then send this information to the central server to find the global optimum solution utilizing a consensus algorithm. Simulation analysis proves that this scheme is efficient as it assigns resources based on their QoS requirements. This scheme is excellent in reducing the central load and computational time.     

Bandwidth allocation in cooperative wireless networks: Buffer load analysis and fairness evaluation

In modern cooperative wireless networks, the resource allocation is an issue of major significance. The cooperation of source and relay nodes in wireless networks towards improved performance and robustness requires the application of an efficient bandwidth sharing policy. Moreover, user requirements for multimedia content over wireless links necessitate the support of advanced Quality of Service (QoS) features. In this paper, a novel bandwidth allocation technique for cooperative wireless networks is proposed, which is able to satisfy the increased QoS requirements of network users taking into account both traffic priority and packet buffer load. The performance of the proposed scheme is examined by analyzing the impact of buffer load on bandwidth allocation. Moreover, fairness performance in resource sharing is also studied. The results obtained for the cooperative network scenario employed, are validated by simulations. Evidently, the improved performance achieved by the proposed technique indicates that it can be employed for efficient traffic differentiation. The flexible design architecture of the proposed technique indicates its capability to be integrated into Medium Access Control (MAC) protocols for cooperative wireless networks.     

Interference and priority aware resource allocation in coexisting WBANs using game models

Wireless body area networks (WBANs) have become an integral part of our health monitoring system. However, the specific challenges offered by a dense co-existence of heterogeneous WBANs have not been properly addressed. The interference between the coexisting WBANs which cause throughput degradation and energy wastage can be mitigated by suitable channel and slot allocations. In this work, a Stackelberg game model with pricing is used for resource scheduling among multi-class WBANs. The access points (APs) act as leaders who decide the prices to be paid by the normal WBAN users for reusing the resources allocated to the critical WBAN users. The normal WBAN users act as followers which use the pricing information and a distributed learning algorithm that guarantees Pareto-optimal solution. As a benchmark for comparison purpose, we propose a centralized resource scheduling which is formulated as an optimization problem where the objective is to maximize system throughput while guaranteeing the quality of service (QoS) requirements of multi-class WBANs. To efficiently solve this problem, a column generation method is proposed. Numerical results are provided to show the efficiency and effectiveness of the proposed game model.     

An optimal protection and restoration scheme (OPARS) for optical networks

Protection and restoration are critical network design issues for optical networks since even a single failure for a short duration may result in huge data loss due to the large capacity of optical fibers. However, few studies have been done on these issues for optical burst switching (OBS) networks. Protection and restoration are essential mechanisms for guaranteeing more reliable traffic delivery services. But it is not easy to apply existing mechanisms to optical burst switching (OBS) networks due to its one-way reservation signaling and the statistical burst multiplexing. Thus, to achieve the high transmission performance and reliability simultaneously, unique properties of OBS must be considered in the design of protection scheme. In this paper, an optimal protection and restoration scheme (OPARS) has been introduced that not only optimizes the number of provisioned protection wavelengths adaptively based on the traffic load as well as the quality of service (QoS) requirements of bursts in high speed networks but also minimizes burst loss rates. In addition, the proposed scheme has been used as an efficient contention resolution technique. The simulation results verify that the proposed scheme improve the network resource and channel utilization while guaranteeing the targeted protection reliability and QoS requirements of bursts.     

基于接纳控制和ILP资源调度模型的BDAaaS系统架构

为了使云计算平台为大数据分析提供有效支持,提出一种大数据分析即服务(BDAaaS)的系统架构;首先,当用户向系统提交大数据分析应用(BDAA)时,通过接纳控制器评估任务的执行时间和成本并作出接纳决策;然后,通过服务等级协议(SLA)管理器根据任务的服务质量(QoS)需求制定SLA;最后,利用提出的整数线性规划(ILP)资源调度模型,以最小化执行成本为目标,在满足SLA下合理调度资源来执行任务;仿真结果表明,提出的方案能够有效降低任务执行时间,具有有效性和可行性。     

光突发交换网中一种新的有优先权的冲突解决方案

提出了一种解决不同优先级突发包之间资源竞争的方案,分析了该方案下不同优先级的性能(时延和丢包率) .研究结果表明：高优先级突发包的平均时延和丢包率都远小于低优先级突发包,因此该方案能为高优先级突发包提供很好的QoS保障.     

Burst dropping policies in optical burst switched network

Optical burst switching (OBS) has been proposed as a competitive switching technology to support the next generation optical Internet. However, due to their one-way resource reservation mechanism, OBS networks experience high bursts (thus packets) loss rate. In OBS networks, the contention is resolved either by dropping one of the contending bursts or more efficiently by dropping from one of the contending bursts only the parts that overlap with the other bursts. In both situations, only one data source will suffer the data loss in favor to the other. In this paper, a novel burst dropping policy based on even selection of burst (BDPES) has been proposed in conjunction with an appropriate mechanism to provide differentiated service in order to support the quality of service (QoS) requirements of different applications. In the proposed burst dropping policy, the dropped segments are selected evenly from both contending bursts and the truncated bursts are guaranteed to be larger than the minimum burst-length allowed by the network. Furthermore, the proposed policy is enhanced via a flow control mechanism. Simulation results show that the performance of proposed policy is better than existing burst dropping mechanisms in terms of reducing burst (packets) loss rate.     

Adaptive dynamic bandwidth allocation algorithm supporting multi-services over Ethernet passive optical networks

In order to ensure fairness of each optical networks unit (ONU) in access network and meet quality of service (QoS) requirements of differentiated service such as voice, video and data, Ethernet passive optical network (EPON) dynamic bandwidth allocation (DBA) algorithm should avoid light load penalty, choose different scheduling scheme according to light loading or heavy loading circumstances, adaptively adjust the order of ONUs at the case heavy loading in order to guarantee QoS. Aiming at this problem, an adaptive dynamic bandwidth allocation algorithm supporting multi-services is presented. The algorithm guarantees QoS through dividing service into voice, video and data putting them into different queues, optical line terminal (OLT) collects all requests of different services from different ONUs, divides the adopted scheduling scheme according to loading, adaptively adjusts the order of ONUs queue based on minimum delay at the case heavy load. Therefore, it can really guarantee QoS. Simulation results of the algorithm show that the algorithm not only can support multi-service and avoid light load penalty, but also can guarantee the fairness of each ONUs and QoS. It has a better performance than other algorithms particularly at the case of heavy loading.