Influence of initial chain conformation on the formation of mesoglobule phase in a dilute heteropolymer solution

We have observed, for the first time, that when the initial chain conformation changed from coil to globule, the association of linear poly(N-vinylcaprolactam-co-sodium acrylate) chains could gradually change from a reaction limited to diffusion limited process, reflected in a change of the fractal dimension of the resultant aggregates from ∼2.5 to ∼1.6. Such an influence of the initial chain conformation has been overlooked in past studies of the formation of the mesoglobule phase in a dilute heteropolymer solution.     

基于物元分析法的水资源管理现代化评价

为科学合理地评价区域水资源管理现代化水平,从水资源保障、用水效率、水资源保护、水资源公共管理能力、水资源支撑能力5个方面构建评价指标体系,将模糊层次分析法(FAHP)和熵权法耦合,确定评价指标综合权重,基于物元理论建立水资源管理现代化评价模型。以南京市高淳区为例进行评价,结果表明,南京市高淳区水资源现代化管理水平处于初等现代化阶段,与实际情况相符,验证了所构建评价模型的可行性和有效性。     

浙江省水利管理与服务能力现代化发展水平评价

遵循独立、科学、系统、层次和可操作性的原则,在充分分析国内外大量相关指标的基础上,结合浙江省实际情况,提出了包括防汛防台抗旱管理、水利工程管理、水行政管理、水利工程完好率、人才保障能力、资金保障能力等6项准则层的浙江省水利管理与服务能力现代化发展水平评估指标体系,在此基础上利用模糊聚类循环迭代法科学确定指标权重,并构建了发展水平综合评估模型。对浙江省2015年的水利管理与服务能力现代化水平进行评价,将结果与2020年的预期值进行对比,查找问题和薄弱环节并提出对策建议。     

熵权-云模型在土石坝安全综合评价中的应用

提出了一种基于熵权-云模型的方法,借鉴云模型的特点,在构建评价层次结构模型时,采用改进层次分析法结合信息熵确定各评价指标权重,以克服运用模糊层次综合分析法时权重受人为主观判断影响较大和模糊概念会丢失部分不确定性等问题,改进隶属函数对土石坝进行综合评价,并以某均质土石坝为例评价了大坝安全状态,分析表明该方法具有可行性。     

Discovering social structures of local influence by using tweetStimuli

Information diffusion in large-scale networks has been studied to identify the users influence. The influence has been targeted as a key feature either to reach large populations or influencing public opinion. Through the use of micro-blogs, such as Twitter, global influencers have been identified and ranked based on message propagation (retweets). In this paper, a new application is presented, which allows to find first and classify then the local influence on Twitter: who have influenced you and who have been influenced by you. Until now, social structures of tweets’ original authors that have been either retweeted or marked as favourites are unobservable. Throughout this application, these structures can be discovered and they reveal the existence of communities formed by users of similar profile (that are connected among them) interrelated with other similar profile users’ communities.     

Image clustering based on sparse patch alignment framework

Image clustering methods are efficient tools for applications such as content-based image retrieval and image annotation. Recently, graph based manifold learning methods have shown promising performance in extracting features for image clustering. Typical manifold learning methods adopt appropriate neighborhood size to construct the neighborhood graph, which captures local geometry of data distribution. Because the density of data points’ distribution may be different in different regions of the manifold, a fixed neighborhood size may be inappropriate in building the manifold. In this paper, we propose a novel algorithm, named sparse patch alignment framework, for the embedding of data lying in multiple manifolds. Specifically, we assume that for each data point there exists a small neighborhood in which only the points that come from the same manifold lie approximately in a low-dimensional affine subspace. Based on the patch alignment framework, we propose an optimization strategy for constructing local patches, which adopt sparse representation to select a few neighbors of each data point that span a low-dimensional affine subspace passing near that point. After that, the whole alignment strategy is utilized to build the manifold. Experiments are conducted on four real-world datasets, and the results demonstrate the effectiveness of the proposed method.     

Nighttime face recognition at large standoff: Cross-distance and cross-spectral matching

Face recognition in surveillance systems is important for security applications, especially in nighttime scenarios when the subject is far away from the camera. However, due to the face image quality degradation caused by large camera standoff and low illuminance, nighttime face recognition at large standoff is challenging. In this paper, we report a system that is capable of collecting face images at large standoff in both daytime and nighttime, and present an augmented heterogeneous face recognition (AHFR) approach for cross-distance (e.g., 150 m probe vs. 1 m gallery) and cross-spectral (near-infrared probe vs. visible light gallery) face matching. We recover high-quality face images from degraded probe images by proposing an image restoration method based on Locally Linear Embedding (LLE). The restored face images are matched to the gallery by using a heterogeneous face matcher. Experimental results show that the proposed AHFR approach significantly outperforms the state-of-the-art methods for cross-spectral and cross-distance face matching.     

HEGM: A hierarchical elastic graph matching for hand gesture recognition

A hierarchical scheme for elastic graph matching applied to hand gesture recognition is proposed. The proposed algorithm exploits the relative discriminatory capabilities of visual features scattered on the images, assigning the corresponding weights to each feature. A boosting algorithm is used to determine the structure of the hierarchy of a given graph. The graph is expressed by annotating the nodes of interest over the target object to form a bunch graph. Three annotation techniques, manual, semi-automatic, and automatic annotation are used to determine the position of the nodes. The scheme and the annotation approaches are applied to explore the hand gesture recognition performance. A number of filter banks are applied to hand gestures images to investigate the effect of using different feature representation approaches. Experimental results show that the hierarchical elastic graph matching (HEGM) approach classified the hand posture with a gesture recognition accuracy of 99.85% when visual features were extracted by utilizing the Histogram of Oriented Gradient (HOG) representation. The results also provide the performance measures from the aspect of recognition accuracy to matching benefits, node positions correlation and consistency on three annotation approaches, showing that the semi-automatic annotation method is more efficient and accurate than the other two methods.     

Ensemble clustering by means of clustering embedding in vector spaces

Ensemble clustering is a recently evolving research direction in cluster analysis and has found several different application domains. In this work the complex ensemble clustering problem is reduced to the well-known Euclidean median problem by clustering embedding in vector spaces. The Euclidean median problem is solved by the Weiszfeld algorithm and an inverse transformation maps the Euclidean median back into the clustering domain. In the experiment study different evaluation strategies are considered. The proposed embedding strategy is compared to several state-of-art ensemble clustering algorithms and demonstrates superior performance.     

Runtime home mapping for effective memory resource usage

In tiled Chip Multiprocessors (CMPs) last-level cache (LLC) banks are usually shared but distributed among the tiles. A static mapping of cache blocks to the LLC banks leads to poor efficiency since a block may be mapped away from the tiles actually accessing it. Dynamic policies either rely on the static mapping of blocks to a set of banks (D-NUCA) or rely on the OS to dynamically load pages to statically mapped addresses (first-touch).