Learning shape and texture progression for young child face aging

Face aging (FA) for young faces refers to rendering the aging faces at target age for an individual, generally under 20s, which is an important topic of facial age analysis. Unlike traditional FA for adults, it is challenging to age children with one deep learning-based FA network, since there are deformations of facial shapes and variations of textural details. To alleviate the deficiency, a unified FA framework for young faces is proposed, which consists of two decoupled networks to apply aging image translation. It explicitly models transformations of geometry and appearance using two components: GD-GAN, which simulates the Geometric Deformation using Generative Adversarial Network; TV-GAN, which simulates the Textural Variations guided by the age-related saliency map. Extensive experiments demonstrate that our method has advantages over the state-of-the-art methods in terms of synthesizing visually plausible images for young faces, as well as preserving the personalized features.     

Patterns in environmental priorities revealed through government open data portals

The ways in which environmental priorities are framed are varied and influenced by political forces. One technological advance--the proliferation of government open data portals (ODPs)--has the potential to improve governance through facilitating access to data. Yet it is also known that the data hosted on ODPs may simply reflect the goals and interests of multiple levels of political power. In this article, I use traditional statistical correlation and regression techniques along with newer natural language processing and machine learning algorithms to analyze the corpus of datasets hosted on government ODPs (total: 49,066) to extract patterns that relate scales of governance and political liberalism/conservatism to the priorities and meaning attached to environmental issues. I find that state-level and municipal-level ODPs host different categories of environmental datasets, with municipal-level ODPs generally hosting more datasets pertaining to services and amenities and state-level ODPs hosting more datasets pertaining to resource protection and extraction. Stronger trends were observed for the influences of political conservatism/liberalism among state-level ODPs than for municipal-level ODPs.     

无线传感器网络中移动sink节点的路径规划

在无线传感器网络中,大量感知数据汇集到sink节点的采集方法会导致sink节点附近的节点能量耗尽,造成能量空洞。针对该问题,利用移动的sink节点进行数据收集是一种解决方法,其中移动sink的路径规划成为一个重要的问题。提出了一个移动sink路径规划算法,将无线传感器中随机分布的节点划分为不同的子区域,寻找sink节点移动的最佳转向点,最终得到最优的移动路径,以实现无线传感器网络生命周期最大化。仿真实验表明,与现有方案相比,该算法能显著延长网络的生命周期。     

无源光网络标准发展及关键技术研究

无源光网络(Passive Optical Network,PON)作为当今接入网的主要技术解决方案,具有带宽使用效率高、传输距离远、抗干扰能力强等特点.通过研究PON技术的发展动态,本文首先归纳了各种PON技术的产生背景和应用特点,整理出各技术间的连接关系及主要标准;其次介绍了PON技术的帧结构,并对带宽、波长、传输模式等PON技术的主要参数进行了汇总;然后将国内外研究热点进行划分,围绕媒体访问控制协议、帧结构、动态带宽分配算法、节能机制等关键技术,阐述了其研究现状及在PON中的重要作用;最后对PON技术的发展趋势进行了展望.     

智能动态网络资源分配系统

通过对解决GSM移动通信网络热点区域话务拥塞问题的研究，提出了利用可控功分器实现智能动态网络资源的分配，解决不同种类的话务拥塞问题，并着重讨论了该系统目前的成功运用及前景。     

全球3G市场管制政策分析

主要对各国3G许可证与使用技术标准的抽绑政策．各国对2G／3G网络漫游的管制规定。以及3G网络之间共享的种类及实施方式等方面做了详尽的讲解，并进行比较和分析。     

构建高扩展性的县级广电宽带数据网络

提出在县市级广电宽带数据网络的建设过程中,要着眼业务发展,突出高扩展性,构建基于标准、扩展灵活的主干网,实现网络建设的可持续性发展,并结合实际,从核心设备、端口、中继带宽、网络业务4个方面对扩展能力进行了阐述.     

Protecting local access telecommunications networks: Toward a minimum-cost solution

The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems. In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective) covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined (less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions grow, DP gives significantly better solution times than IP.