僵尸网络的防御与控制

僵尸网络对网络安全运行及用户数据安全都是极具威胁的隐患,它也因此成为一个国际上十分关注的问题.明确僵尸网络的概念,把握僵尸网络的产生、内部工作机理、发展、类型及危险性,就能主动、有效地做好对僵尸网络的防御与控制,强化网络运行及用户数据的安全性.     

TreeNetViz: revealing patterns of networks over tree structures

Network data often contain important attributes from various dimensions such as social affiliations and areas of expertise in a social network. If such attributes exhibit a tree structure, visualizing a compound graph consisting of tree and network structures becomes complicated. How to visually reveal patterns of a network over a tree has not been fully studied. In this paper, we propose a compound graph model, TreeNet, to support visualization and analysis of a network at multiple levels of aggregation over a tree. We also present a visualization design, TreeNetViz, to offer the multiscale and cross-scale exploration and interaction of a TreeNet graph. TreeNetViz uses a Radial, Space-Filling (RSF) visualization to represent the tree structure, a circle layout with novel optimization to show aggregated networks derived from TreeNet, and an edge bundling technique to reduce visual complexity. Our circular layout algorithm reduces both total edge-crossings and edge length and also considers hierarchical structure constraints and edge weight in a TreeNet graph. These experiments illustrate that the algorithm can reduce visual cluttering in TreeNet graphs. Our case study also shows that TreeNetViz has the potential to support the analysis of a compound graph by revealing multiscale and cross-scale network patterns.     

Multi-objective layout optimization for an orbital propellant depot

Structural and Multidisciplinary Optimization - The overall layout optimization design of an orbital propellant depot involves the optimization of shape, size, and positions of propellant tanks in...     

Birman–Wenzl–Murakami algebra, topological parameter and Berry phase

In this paper, a 3?×?3-matrix representation of Birman?CWenzl?CMurakami (BWM) algebra has been presented. Based on which, unitary matrices A(??, ?? ₁, ?? ₂) and B(??, ?? ₁, ?? ₂) are generated via Yang?CBaxterization approach. A Hamiltonian is constructed from the unitary B(??, ??) matrix. Then we study Berry phase of the Yang?CBaxter system, and obtain the relationship between topological parameter and Berry phase.     

基于设计树模板的产品外观风格定制研究

为满足客户对产品外观的个性化定制需求,提出了产品外观风格特征的量化描述方法,构造了设计树来组织和管理设计方案的几何数据信息和风格信息,并给出了产品外观模板的形式化描述和建立方法。在此基础上,建立了基于设计树模板的产品外观风格定制系统的模型,介绍了基于CAD平台二次开发的、COM组件结合中间件的开发方案。     

航空声纳ATE测试系统设计

提出了基于ATE技术的航空声纳综合测试系统设计思想,通过对设计系统可行性的总体分析和方案的评估,证明该系统设计方案合理,能够满足测试系统应具备的功能要求并保证原有系统的完整性,从而依据该方案开展航空声纳综合测试系统的下-步研制工作.     

基于ArcEngine和C/S构架的矿产资源管理系统开发

基于组件式GIS（Geographical Information System）思想,在Java平台下,以Oracle为后台数据库,通过以下技术的实施：ArcEngine实现地图表现、Java存储过程实现Oracle远程逻辑备份与恢复、ArcSDE实现空间数据存储,成功开发了攀枝花市矿产资源管理系统,并取得良好应用效果。系统的应用和实践促进了该市矿政管理信息化建设进程。     

有共线边的多边形窗口的线裁剪算法

采用参考坐标系B、顶点类型、重合段、处理单位Unit等概念,有效地处理了交点的计算以及裁剪线通过顶点或边的情况．由于利用了多边形窗口结构上的有序性和完整性的特点,文中算法不仅适用于凹多边形窗口,而且适用于相邻边共线等特殊情况的多边形窗口。     

A parallel matrix factorization based recommender by alternating stochastic gradient decent

Collaborative Filtering (CF) can be achieved by Matrix Factorization (MF) with high prediction accuracy and scalability. Most of the current MF based recommenders, however, are serial, which prevent them sharing the efficiency brought by the rapid progress in parallel programming techniques. Aiming at parallelizing the CF recommender based on Regularized Matrix Factorization (RMF), we first carry out the theoretical analysis on the parameter updating process of RMF, whereby we can figure out that the main obstacle preventing the model from parallelism is the inter-dependence between item and user features. To remove the inter-dependence among parameters, we apply the Alternating Stochastic Gradient Solver (ASGD) solver to deal with the parameter training process. On this basis, we subsequently propose the parallel RMF (P-RMF) model, of which the training process can be parallelized through simultaneously training different user/item features. Experiments on two large, real datasets illustrate that our P-RMF model can provide a faster solution to CF problem when compared to the original RMF and another parallel MF based recommender.     

Semantic consistent adversarial cross-modal retrieval exploiting semantic similarity

Cross-modal retrieval aims to search the semantically similar instances from the other modalities given a query from one modality. However, the differences of the distributions and representations between different modalities make that the similarity of different modalities can not be measured directly. To address this problem, in this paper, we propose a novel semantic consistent adversarial cross-modal retrieval (SC-ACMR), which learns semantic consistent representation for different modalities under adversarial learning framework by considering the semantic similarity from intra-modality and inter-modality. Specifically, for intra-modality, we minimize the intra-class distances. For the inter-modality, we require class center of different modalities with same semantic label to be as close as possible, and also minimize the distances between the samples and the class center with same semantic label from different modalities. Furthermore, we preserve the semantic similarity of transformed features of different modalities through a semantic similarity matrix. Comprehensive experiments on two benchmark datasets are conducted and the experimental results show that the proposed method have learned more compact semantic representations and achieved better performance than many existing methods in cross-modal retrieval.