Aesthetic Rating and Color Suggestion for Color Palettes

A model to rate color combinations that considers human aesthetic preferences is proposed. The proposed method does not assume that a color palette has a specific number of colors, i.e., input is not restricted to a two‐, three‐, or five‐color palettes. We extract features from a color palette whose size does not depend on the number of colors in the palette. The proposed rating prediction model is trained using a human color preference dataset. The model allows a user to extend a color palette, e.g., from three colors to five or seven colors, while retaining color harmony. In addition, we present a color search scheme for a given palette and a customized version of the proposed model for a specific color tone. We demonstrate that the proposed model can also be applied to various palette‐based applications.     

3D Body Shapes Estimation from Dressed‐Human Silhouettes

Estimation of 3D body shapes from dressed‐human photos is an important but challenging problem in virtual fitting. We propose a novel automatic framework to efficiently estimate 3D body shapes under clothes. We construct a database of 3D naked and dressed body pairs, based on which we learn how to predict 3D positions of body landmarks (which further constrain a parametric human body model) automatically according to dressed‐human silhouettes. Critical vertices are selected on 3D registered human bodies as landmarks to represent body shapes, so as to avoid the time‐consuming vertices correspondences finding process for parametric body reconstruction. Our method can estimate 3D body shapes from dressed‐human silhouettes within 4 seconds, while the fastest method reported previously need 1 minute. In addition, our estimation error is within the size tolerance for clothing industry. We dress 6042 naked bodies with 3 sets of common clothes by physically based cloth simulation technique. To the best of our knowledge, We are the first to construct such a database containing 3D naked and dressed body pairs and our database may contribute to the areas of human body shapes estimation and cloth simulation.     

Prevalence and personality correlates of Facebook bullying among university undergraduates

The purpose of the present study was to examine the prevalence of cyber-bullying through Facebook in a sample of 226 Greek university undergraduates, and to explore whether big five personality characteristics, narcissism, as well as attitudes toward Facebook, technological knowledge and skills were predictive of such behavior. Participants completed a self-report questionnaire measuring the above constructs. Results indicated that almost one third of the sample reported Facebook bullying engagement at least once during the past month, with male students reporting more frequent involvement than females. Bullying through Facebook was predicted by low Agreeableness and more time spent on Facebook only for males, whereas for females none of the studied variables predicted engagement in Facebook bullying. Findings are discussed in terms of prevention and intervention strategies.     

基于剩余能量和距离信息的异构网络分簇协议

针对无线传感网络WSN(Wireless Sensor Network)的网络寿命问题,提出了面向异构网络环境下的基于剩余能量和距离分簇REDC(Residual Energy and Distance Clustering)协议。REDC协议考虑了普通节点、中级节点以及高级节点,具有较高的初始能量节点称为中级节点和高级节点,余下的称为普通节点。在簇头CH(Cluster head)选举中,考虑节点的剩余能量和离基站距离信息,使得具有较高的剩余能量节点、离基站距离较近的节点有更多的机会被选为簇头CH,进而避免了剩余能量较小的节点成头簇头CH而产生节点过早失效缩短网络寿命的问题,平衡了网络内的能量消耗。仿真结果表明,与LEACH、DDEEC和SEP协议相比,提出的REDC协议具有较长的网络寿命和良好的数据传输能力。     

基于R型聚类-因子分析的指标体系简化方法

评价指标体系过于复杂,容易产生冗余信息,增加计算与分析的难度.本文针对评价指标体系的简化方法展开研究,提出了基于R型聚类-因子分析的代表元提取方法.该方法具有定量控制代表元的信息丢失率、代表元实际含义易于解释等优点,同时避免了因子分析难以处理独立指标的问题.实验结果表明本文所提出的R型聚类–因子分析指标体系简化方法可以在没有先验知识可用的情况下,有效提高指标体系的简明性与有效性,同时保持指标信息的完备性.     

面向在线支付业务的容器资源弹性管理框架

随着在线支付业务的大规模应用,系统运维人员需要更便捷的服务器资源管理机制来满足系统扩展需求.本文提出一种基于容器技术的轻量化、弹性资源管理框架,并给出应用服务的性能诊断方法以及集群规模的动态调整方法.利用在线支付业务的典型数据处理场景进行实验,实验结果验证了方法的有效性.     

Evidential grammars: A compositional approach for scene understanding. Application to multimodal street data

Automatic scene understanding from multimodal data is a key task in the design of fully autonomous vehicles. The theory of belief functions has proved effective for fusing information from several sensors at the superpixel level. Here, we propose a novel framework, called evidential grammars, which extends stochastic grammars by replacing probabilities by belief functions. This framework allows us to fuse local information with prior and contextual information, also modeled as belief functions. The use of belief functions in a compositional model is shown to allow for better representation of the uncertainty on the priors and for greater flexibility of the model. The relevance of our approach is demonstrated on multi-modal traffic scene data from the KITTI benchmark suite.     

基于Hadoop平台的K-means聚类算法

传统的K-means算法虽然具有很多优点,但聚类准则函数对簇密度不均的数据集分类效果较差.文中在加权标准差准则函数的基础之上,增加了收敛性判定,并在Hadoop平台上提出了一种基于MapReduce编程思想设计与优化的K-means并行算法.与传统的K-means算法相比,设计的并行算法在聚类结果的准确性、加速比、扩展性、收敛性等方面都有显著的提高,降低了因簇密度不均引起误分的概率,提高了算法的聚类精度,并且数据规模越大、节点越多,优化的效果就越明显.     

基于集群节点间即时拷贝的会话同步技术研究

集群会话同步技术目前主要有如下几种：基于Cookie的会话同步,基于数据库的会话同步,基于分布式缓存的会话同步.在以上会话同步技术的基础上,提出了一种基于集群节点间即时拷贝的会话同步技术,将会话标识信息存放在客户端中,避免了在客户端中存放完整的会话信息,从而可防止用户身份信息暴露的安全隐患;同时,在客户端向服务器发送请求的过程中,只携带会话标识信息,而不是完整的会话信息,传输的数据量将大大减少,提高了客户端对服务器的访问效率;各集群节点间同步会话信息,不需要从数据库中获取会话信息,避免了频繁使用数据库带来的性能瓶颈;也不需要使用专门的会话缓存服务器,减低了开发和部署成本,并具有良好的应用前景.     

计算机网络系统安全防护策略初探

随着时代的发展,Interact日益普及,网络已经成为信息资源的海洋,给人们带来了极大的方便。但由于Interact是一个开放的,无控制机构的网络,经常会受到计算机病毒、黑客的侵袭。它可使计算机和计算机网络数据和文件丢失,系统瘫痪。因此,计算机网络系统安全问题必须放在首位。本文介绍了计算机系统安全的维护措施,给计算机网络工作人员有一定帮助。