基于光谱和时相特征的夏玉米遥感识别

精确提取作物种植面积一直是农业遥感关注的主要问题之一。综合运用低分辨率的时相变化特征和中分辨率的光谱特征,提出一种夏玉米识别方法。首先基于MODIS NDVI时间序列曲线,分析夏玉米在时相变化上的识别特征,构建识别模型。夏玉米纯像元利用识别模型识别,而耕地和非耕地类型的植被产生的混合像元,则基于像元分解办法获取耕地组分的NDVI时序特征,再利用识别模型判定,然后结合土地利用数据根据空间关系得到中分辨率结果;玉米与其他作物的混合像元则利用中分辨率尺度光谱差异加以区分。研究结果表明,在伊洛河流域主要农业区,识别精度达到90.33%,为作物类型识别提供了新的思路。     

遥感网格的数据压缩与任务分配方法研究

网格计算作为分布式计算在科学计算领域的发展方向,可以为对地观测数据的处理提供强大的计算力。在分析遥感信息服务网格节点(Remote Sensing Information Service Grid Nodes,RSSN)中网络数据传输和负载均衡两个关键问题的基础上,提出了一种有效的基于游程编码和Huffman编码的数据压缩方法和基于"计算端元"的任务分配策略,该方法针对遥感影像特点进行有效数据压缩,具有较好的压缩比,达到了17%,且能实现任务负载均衡。并在遥感信息服务网格节点计算平台上,以中国范围内1km分辨率气溶胶光学厚度(Aerosol Optical Depth,AOD)反演计算为例,从压缩率和计算时间效率方面验证和分析了上述方法的有效性。     

OPTIMA: On-Line Partitioning Skew Mitigation for MapReduce with Resource Adjustment

Partitioning skew has been shown to be a major issue that can significantly prolong the execution time of MapReduce jobs. Most of the existing off-line heuristics for partitioning skew mitigation are inefficient; they have to wait for the completion of all the map tasks. Some solutions can tackle this problem on-line, but will impose an additional overhead by repartitioning the workload of overloaded tasks. In this paper, we present OPTIMA, an on-line partitioning skew mitigation technique for MapReduce. OPTIMA predicts the workload distribution of reduce tasks at run-time, leverages the deviation detection technique to identify the overloaded tasks and pro-actively adjusts resource allocation for these tasks to reduce their execution time. We provide the upper bound of OPTIMA in time complexity, while allowing OPTIMA to perform totally on-line. Through experiments using both real and synthetic workloads running on an 11-node Hadoop cluster, we have observed OPTIMA can effectively mitigate the partitioning skew and improved the job completion time by up to 36.73 % in our experiments.     

Distributed average computation for multiple time‐varying signals with output measurements

This paper studies the distributed average computation problem for multiple time‐varying signals with bounded inputs. Based only on relative output measurements, a pair of continuous algorithms with, respectively, static and adaptive coupling strengths are designed and utilized. From the concept of boundary layer approach, the proposed continuous algorithm with static coupling strengths can asymptotically obtain the average value of the multiple reference signals without chattering phenomenon. Furthermore, for the case of algorithms with adaptive coupling strengths, the calculation errors are uniformly ultimately bounded and exponentially converge to a small adjustable bounded set. Finally, a simulation example is presented to show the validity of the theoretical results. Copyright © 2015 John Wiley & Sons, Ltd.     

Stochastic consensus control with finite frequency specification for Markov jump networks

A stochastic finite frequency consensus protocol for directed networks with Markov jump topologies and external disturbances is proposed in this paper. By introducing the frequency band information into consensus control design, the disagreement dynamics of interconnected networks asymptotically converge to zero with an improved level of disturbance attenuation in the specific frequency band. In addition, the new model transformation approach is presented by exploring certain features of Laplacian matrix in real Jordan form, which leads to more generality of the designed protocol. A numerical example validates the potential of the developed results. Copyright © 2015 John Wiley & Sons, Ltd.     

Semi‐global and global containment control of multi‐agent systems with second‐order dynamics and input saturation

This paper considers both semi‐global and global containment control for a second‐order multi‐agent system that is composed by a network of identical harmonic oscillators or double integrators with multiple leaders and input saturation. A distributed low gain feedback algorithm is proposed to solve the semi‐global containment control problem for the network whose topology is directed and initial condition is taken from any a priori given bounded set. In particular, by using a parametric Lyapunov equation approach, M‐matrix properties and algebraic graph theory, an upper bound of the low gain parameter is estimated such that the low gain feedback matrix can be analytically determined without involving numerical computation. Furthermore, under the assumption that the induced subgraph formed by the followers is strongly connected and detail balanced, two linear feedback protocols are designed for coupled harmonic oscillators and coupled double integrators, respectively, to asymptotically achieve the global containment control of the network with any initial condition. Finally, numerical examples are given to illustrate the effectiveness of the theoretical results. Copyright © 2016 John Wiley & Sons, Ltd.     

Media Niche of Electronic Communication Channels in Friendship: A Meta‐Analysis

The current landscape of communication technologies is characterized by a wide variety of choices. As each medium provides different affordances, each may occupy a different niche and be used in different relationships. Drawing on the theory of the niche, we did a meta‐analysis involving 27 effect sizes from 22 independent samples to test the correlation between media selection/use and friendship closeness. Results showed that the 5 communication channels filled 2 different friendship closeness niches. Mobile phone calls and texting had stronger positive correlations with friendship closeness than instant messaging, social network sites, and online gaming. Culture, but not gender, moderated some of these correlations: Friendship closeness had a stronger positive association with SNS use and online gaming in collectivist cultures.     

Multifocus image fusion method of Ripplet transform based on cycle spinning

The curvelet transform can represent images at both different scales and different directions. Ripplet transform, as a higher dimensional generalization of the curvelet transform, provides a new tight frame with sparse representation for images with discontinuities along C² curves. However, the ripplet transform is lack of translation invariance, which causes the pseudo-Gibbs phenomenon on the edges of image. In this paper, the cycle spinning method is adopted to suppress the pseudo-Gibbs phenomena in the multifocus image fusion. On the other hand, a modified sum-modified-laplacian rule based on the threshold is proposed to make the decision map to select the ripplet coefficient. Several experiments are executed to compare the presented approach with other methods based on the curvelet, sharp frequency localized contourlet transform and shearlet transform. The experiments demonstrate that the presented fusion algorithm outperforms these image fusion works.     

Re-ranking for microblog retrieval via multiple graph model

As a new information sharing platform, microblog has got explosive growth in recent years and has become an important source for public opinion mining. A variety of information like the reviews of brands/products or the trends of events can be socially sensed from such kind of data. However, it is still a challenging task to search relevant microblogs as the user generated content tends to be mixed with noise. Besides short text, image is getting popular in microblogs due to its power in visual information conveying. In this paper, we leverage textual and visual cues integratedly and propose a general re-ranking approach for microblog retrieval via multi-graph semi-supervised learning. We argue that the different types of information in microblogs correspond to different relationships among microblogs and each type of the relationship can be represented as a similarity graph. We then integrate different graphs into a unified framework and solve them simultaneously for microblog re-ranking. Extensive experiments on a recently published Brand-Social-Net dataset showed the effectiveness of the proposed method and marginal improvements have been achieved in accuracy as compared to the single graph model based method.     

Scheduling for electricity cost in a smart grid

We study an offline scheduling problem arising in demand response management in a smart grid. Consumers send in power requests with a flexible set of timeslots during which their requests can be served. For example, a consumer may request the dishwasher to operate for 1 h during the periods 8am to 11am or 2pm to 4pm. The grid controller, upon receiving power requests, schedules each request within the specified duration. The electricity cost is measured by a convex function of the load in each timeslot. The objective of the problem is to schedule all requests with the minimum total electricity cost. As a first attempt, we consider a special case in which the power requirement and the duration a for which a request needs service are both unit-size. For this problem, we present a polynomial time offline algorithm that gives an optimal solution and shows that the time complexity can be further improved if the given set of timeslots forms a contiguous interval.