基于Web的科技信息管理系统

介绍了在Internet/Intranet上开发基于Web技术的科技信息管理系统。重点对系统核心技术进行了论述。     

无结构P2P网络资源搜索方法研究

对等网络（P2P）成为近年来的研究热点，如何进行高效准确的资源搜索是实现对等网络应用的关键问题。本文在分析Gnutella网络的基本泛洪算法存在问题的基础之上，介绍了现有的资源搜索改进方法，包括优化网络拓扑结构方法、改进转发机制方法、基于路由信息方法和基于缓存的方法。     

互补共形匹配层研究

在运用数值方法求解开域散射问题时,需采用虚拟边界截断分析区域,这不可避免会造成人工反射。比较已存在的吸收边界条件,介绍了一种新型的吸收边界条件。这种方法基于特性互补的两种边界。分别求解两种边界条件下的解然后取平均,可以完全消除人工边界的一次反射。数值结果表明与其它广泛使用的边界条件相比这种方法可以显著减小由反射造成的误差。     

分布式搜索引擎中页面信息动态迁移算法的研究

针对分布式搜索引擎系统中页面信息分布与动态迁移问题，提出了一种信息的动态迁移算法，并对算法参数进行了实验确定。该算法充分利用用户反馈，使得页面信息在各个站点间达到近似最优的分布。经模拟验证，该算法可以有效地优化信息分布、改善系统性能。     

移动视觉搜索技术研究与标准化进展

移动视觉搜索成为未来移动世界中有影响的基础技术之一。文章介绍了移动视觉搜索面临的技术挑战,探讨了包括紧凑视觉描述子、视觉检索流程、检索系统互操作性等关键技术。围绕紧凑视觉描述子概述了移动视觉搜索国际标准的工作进展,提出建设大规模视觉对象数据集的重要意义。     

基于信令数据的轨迹驻留点识别算法研究

针对密度聚类算法只能识别密度相近的簇类且计算复杂度高等问题,该文提出一种基于信令数据中时空轨迹信息的密度峰值快速聚类(ST-CFSFDP)算法。首先对低采样密度的信令数据进行预处理,消除轨迹震荡现象;然后基于密度峰值快速聚类(CFSFDP)算法显式地增加时间维度限制,将局部密度由2维扩展到3维,并提出高密度时间间隔以表征簇中心在时间维度上的数据特征;接着设计筛选策略以选取聚类中心;最后识别用户出行轨迹中的驻留点,完成出行链的划分。实验结果表明,所提算法适用于采样密度低且定位精度差的信令数据,相比CFSFDP算法更适用于时空数据,相比基于密度的时空聚类算法(ST-DBSCAN)召回率提升14%,准确率提升8%,同时降低计算复杂度。     

Background foreground boundary aware efficient motion search for surveillance videos

The huge amount of data in surveillance video coding demands high compression rates with lower computational requirements for efficient storage and archival. The motion estimation is a very time-consuming process in the traditional video coding framework, and hence reducing computational complexity is a pressing task, especially for surveillance videos. The presence of significant background proportion in surveillance videos makes its special case for coding. The existing surveillance video coding methods propose separate search mechanisms for background and foreground regions. However, they still suffer from misclassification and inefficient search strategies since it does not consider the inherent motion characteristics of the foreground regions. In this paper, a background-foreground-boundary aware block matching algorithm is proposed to exploit special characteristics of the surveillance videos. A novel three-step framework is proposed for boundary aware block matching process. For this, firstly, the blocks are categorized into three classes, namely, background, foreground, and boundary blocks. Secondly, the motion search is performed by employing different search strategies for each class. The zero-motion vector-based search is employed for background blocks. Whereas, to exploit fast and directional motion characteristics of the boundary and foreground blocks, the eight rotating uni-wing diamond search patterns are proposed. Thirdly, the speed-up is achieved through the novel region-based sub-sampled structure. The experimental results demonstrate that two to four times speed-up over existing methods can be achieved through this scheme while maintaining better matching accuracy.     

Statistical prediction of fracture parameters of concrete and implications for choice of testing standard

This article shows how the fracture energy of concrete, as well as other fracture parameters such as the effective length of the fracture process zone, critical crack-tip opening displacement and the fracture toughness, can be approximately predicted from the standard compression strength, maximum aggregate size, water-cement ratio, and aggregate type (river or crushed). A database, consisting of 238 test data, is extracted from the literature and tabulated, and approximate mean prediction formulae calibrated by this very large data set are developed. A distinction is made between (a) the fracture energy, G_f, corresponding to the area under the initial tangent of the softening stress-separation curve of cohesive crack model, which governs the maximum loads of structures and is obtained by the size effect method (SEM) or related methods (Jenq-Shah two-parameter method and Karihaloo's effective crack model, ECM) and (b) the fracture energy, G_F, corresponding to the area under the complete stress-separation curve, which governs large postpeak deflections of structures and is obtained by the work-of-fracture method (WFM) proposed for concrete by Hillerborg. The coefficients of variation of the errors in the prediction formulae compared to the test data are calculated; they are 17.8% for G_f and 29.9% for G_F, the latter being 1.67 times higher than the former. Although the errors of the prediction formulae taking into account the differences among different concretes doubtless contribute significantly to the high values of these coefficients of variation, there is no reason for a bias of the statistics in favor of G_f or G_F. Thus, the statistics indicate that the fracture energy based on the measurements in the maximum load region is much less uncertain than that based on the measurement of the tail of the postpeak load-deflection curve. While both G_f and G_F are needed for accurate structural analysis, it follows that if the testing standard should measure, for the sake of simplicity, only one of these two fracture energies, then G_f is preferable.     

Using search theory to determine an applications selection strategy

The literature on software selection focuses mainly on identifying and ensuring the evaluation of those attributes of alternative commercial software products relevant to meeting the functional and non-functional requirements of the acquiring organisation. Once these attributes are determined, however, the firm acquiring the product must still decide on its selection strategy: which products should be evaluated, in what order, and at what point is it no longer beneficial to continue to evaluate additional products. We applied search theory to solve this problem of determining the selection strategy. This resulted in an optimal strategy but changes the way we view and manage software acquisition. In particular, the approach suggested that software acquisition may be better managed as an ongoing process instead of as a project with a distinct start and end. The approach formally incorporated the strategic importance of the application to the firm in determining the optimal strategy, a consideration that does not appear in the normal requirements-based approach to software selection.