基于视觉显著和CNN的花卉图像检索软件

花卉图像检索是图像检索领域的热门研究方向,高效、快速地检索数据库中的花卉图像一直是该方向的重点课题。为了检索花卉图像,文中设计了一个基于视觉显著模型和CNN的图像哈希算法,并根据此算法设计和开发出一个高效、快速的花卉图像检索软件。软件具有查询花卉类别、检索相似花卉、浏览花卉信息等功能。     

塘沽电信局动力设备及机房环境集中监控系统

介绍了塘沽电信局动力设备及其机房环境集中监控系统的组网方案和具备的功能．     

时间同步的业务需求和几种时间传送技术

主要介绍了各种电信业务对时间同步的要求及时间的几种传送技术。     

网络安全和HOCN

Internet处于安全失控状态下运行的缺点已日益明显,本文就网络主权、网络安全、网络创新以及研发具有安全质量保障的优质计算网络(HQCN)进行了较为详尽的探讨,并介绍了开发新一代网络技术的组织TINA-C的研发进展。     

A strongly polynomial algorithm for the minimum maximum flow degree problem

Let us consider a network flow respecting arc capacities and flow conservation constraints. The flow degree of a node is sum of the flow entering and leaving it. We study the problem of determining a flow that minimizes the maximum flow degree of a node. We show how to solve it in strongly polynomial time with linear programming.     

基于大容量镜像NAS存储结构的设计

针对IP SAN网络存储结构的部署与维护,在综合考虑柳州广播电视台业务发展和实际需求的基础上,设计了基于大容量镜像的NAS存储结构,结果证明,新的NAS存储结构简单,成本低,易于维护,故障排查和处理更迅速,扩展性较高,并且实现了实时同步与快速切换的主备高可用存储,确保了节目流程中数据的安全性。     

Correlated spin networks in frustrated systems

We introduce a network model for frustrated spin systems based on highly correlated spin fluctuations, to quantify and visualize their ordering. This model shows that networks of strongly correlated but non-contiguous spins exist at low temperatures on a triangular Ising lattice with competing nearest-neighbor interactions. This finding is consistent with chaotic renormalization-group trajectories previously reported for frustrated hierarchical lattices.     

Viscoelastic behavior of stock indices

The scattering diagram of a stock index results in a complex network structure, which can be used to analyze the viscoelastic properties of the index. The change along x- or y-direction of the diagram corresponds to purely elastic (or spring like) movement whereas the diagonal change at an angle of 45° corresponds to purely viscous (or dashpot like) movement. The viscous component pushes the price from its current value to any other value, while the elastic component acts like a restoring force. Four indices, namely, DJI, S&P-500, NASDAQ-100, and NASDAQ-composite were studied for the period of 2001-2009. NASDAQ-composite displayed very high elasticity while NASDAQ-100 displayed the highest fluidity in the time period considered. The fluidity of DJI and S&P-500 came out to be close to each other, and they are almost the same in the second half of the period.     

Network modeling of chromatography by stochastic phenomena of adsorption,diffusion and convection

The limitation of macroscopic models to represent structural parameters, such as topology and morphology, as well as population effects, i.e. multi-molecules movement, in the modeling of chromatography systems has implications on the understanding of the phenomenological aspects that contribute to the separation mechanisms in porous media. The representation of the porous structure of chromatographic columns by a three-dimensional cubic network of interconnected sites allows a better analysis of the structural characteristics of the porous column and its connection with the phenomena of adsorption, diffusion and convection. In the present work the application of an interconnected cubic network model associated with a stochastic modeling of the adsorption, diffusion and convection phenomena leads to the proper representation of the dynamic aspects of the breakthrough curves related to separation processes in chromatographic columns. Therefore, it is possible to study the dynamics of solute retention from the molecules distribution in the separation processes throughout the column. Among the mass transfer mechanisms investigated, the convection showed to be closely related to the separation dynamics of chromatography, with the diffusion having little effects. The adsorption influenced both the separation dynamics and solute retention.     

The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability

We present two classes of polynomially separable valid inequalities for the Maximum Flow Network Interdiction Problem. We prove that the integrality gap of the standard integer program is not bounded by a constant, even when strengthened by our valid inequalities. Finally, we provide an approximation-factor-preserving reduction from a simpler interdiction problem.