基于禁忌搜索的目标图像信息隐藏技术

信息隐藏技术是解决重要目标图像信息网上传输安全的一种有效手段,隐藏的信息量和不可感知性是一个矛盾的两个方面。在对重要目标信息进行隐藏时,必须在二者之间做一个权衡。如何在满足不可感知性的前提下隐藏尽町能多的信息是追求的目标。提出了基于禁忌搜索的图像信息的隐藏技术,可以很好地解决这个问题。     

基于知识图谱的岩溶知识发现系统建设

岩溶领域通过地质调查和科学研究积累了大量的成果资源,资源之间的关联关系更加复杂,传统的关键词检索模式已不满足用户获取知识的需求。为实现知识层面的数据检索,利用数据挖掘技术进行岩溶实体抽取与关系计算,以岩溶术语为核心,基于知识图谱构建岩溶知识发现系统,实现岩溶地质成果、期刊、论文、图书、标准、项目、专家等实体的智能语义搜索和关联导航,最大化的挖掘数据的潜在价值,为用户提供精准知识服务,提升了用户体验。     

供水管网管理系统的设计与实现

城市管网系统的管理是城建工作的一个重要课题。本文介绍已开发实现的青岛市《供水管网管理系统》的设计及主要的技术特点     

地震灾区区域搜救优先级判定方法研究及应用

针对震后快速反应与应急救援辅助决策的需要,综合考虑灾区人口数量、人口密度、地形、交通、天气、烈度等因素,建立了地震灾区区域搜救目标优先级的评判模型,并以汶川地震为例进行了搜救目标优先级的划分,结果表明该方法可以满足大灾区的区域搜救优先级评定需求。     

Computing a hierarchy favored optimal route in a Voronoi-based road network with multiple levels of detail

This paper introduces a robust method for computing the optimal route with hierarchy. We convert a planar road network into its Voronoi-based counterpart with multiple levels of detail (LoDs), which is subsequently assigned travel times that are estimated for different times of day using taxicab trajectory data. On the basis of this network structure, we model the path-finding process in travel, as the optimal route with hierarchy is computed in a ‘coarse-to-fine’ manner. In other words, the route is iteratively constructed from roads in a low LoD network to roads in a high LoD network. To confirm the efficiency and effectiveness of our method, comparative experiments were conducted using randomly selected pairs of origins/destinations in Wuhan, China. The results indicate that our travel lengths are on average 12% longer than those computed by the Dijkstra algorithm and 15% shorter than those computed by the hierarchical algorithm (in ArcGIS). Our travel times are on average 29% longer than those computed by the Dijkstra algorithm and 31% shorter than those computed by the hierarchical algorithm (in ArcGIS). Hence, we argue that our method is situated in terms of performance between the Dijkstra algorithm and the hierarchical algorithm (in ArcGIS). Moreover, road usage patterns confirm that our algorithm is cognitively equivalent to the hierarchical algorithm (in ArcGIS) by favoring high-class roads and outperforms the Dijkstra algorithm by avoiding choosing low-class roads. Computationally, our method outperforms the Dijkstra algorithm but is on the same level as the hierarchical algorithm (in ArcGIS) in terms of efficiency. Therefore, it has the potential to be used in real-time routing applications or services.     

Simulating urban growth in a metropolitan area based on weighted urban flows by using web search engine

As a consequence of rapid and immoderate urbanization, simulating urban growth in metropolitan areas effectively becomes a crucial and yet difficult task. Cellular automata (CA) model is an attractive tool for understanding complex geographical phenomena. Although intercity urban flows, the key factors in metropolitan development, have already been taken into consideration in CA models, there is still room for improvement because the influences of urban flows may not necessarily follow the distance decay relationship and may change over time. A feasible solution is to define the weights of intercity urban flows. Therefore, this study presents a novel method based on weighted urban flows (CA_WeightedFlow) with the support of web search engine. The relatedness measured by the co-occurrences of the cities’ names (toponyms) on massive web pages can be deemed as the weights of intercity urban flows. After applying the weights, the gravitational field model is integrated with Logistic-CA to fulfill the modeling task. This method is employed to the urban growth simulation in the Pearl River Delta, one of the most urbanized metropolitan areas in China, from 2005 to 2008. The results indicate that our method outperforms traditional methods with respect to two measures of calibration goodness-of-fit. For example, CA_WeightedFlow can yield the best value of ‘figure of merit’. Moreover, the proposed method can be further used to explore various development possibilities by simply changing the weights.     

Space–time prism bounds of activity programs: a goal-directed search in multi-state supernetworks

Space–time prism (STP), which envelops the spatial and temporal opportunities for travel and activity participation within a time frame, is a fundamental concept in time geography. Despite many variants, STPs have been mostly modeled for one flexible activity between two anchor points. This study proposes a systemic approach to construct the STP bounds of activity programs that usually include various possible realizations of activity chains. To that effect, multi-state supernetworks are applied to represent the relevant path sets of multi-activity travel patterns. A goal-directed search method in multi-state supernetworks is developed to delineate the potential space–time path areas satisfying the space–time constraints. Particularly, the approximate lower and upper STP bounds are obtained by manipulating the goal-directed search procedure utilizing landmark-based triangular inequalities and spatial characteristics. The suggested approach can in an efficient fashion find the activity state dependent bounds of STP and potential path area. The formalism of goal-directed search through multi-state supernetworks addresses the fundamental shift from constructing STPs for single flexible activities to activity programs of flexible activity chains.     

基于混合模糊神经网络储层裂缝地震反演研究

基于储层裂缝系统具有非线性特征,储层裂缝地震反演是由遗传算法(GA)、模糊神经网络(ANF IS)和禁忌搜索算法(TS)有机地结合而构成的自适应混合模糊神经网络技术。该技术在成像测井约束下,形成的自适应混合算法分别训练ANF IS网络的前提参数和结论参数,从而获得满足精度要求的储层裂缝密度的最佳估计值。针对目标储层段,应用储层裂缝地震反演方法对过井地震剖面和联井地震剖面进行了储层裂缝密度反演处理,获得了可用于地质解释和油气预测的视裂缝密度剖面。这种裂缝密度剖面含有裂缝定量信息,其裂缝密度相对误差为:0.8%~24%,满足勘探开发的要求。经与研究区的地质对比分析表明,视裂缝密度剖面上的裂缝展布特征符合研究区的沉积相分布和岩石力学性质的变化特征,对研究区的勘探开发具有重要意义。     

基于用户历史瓦片浏览记录的兴趣点智能搜索方法优化研究

在网上各种信息呈现爆炸式增长的背景下,传统方法往往难以顾及用户兴趣,而导致查询无法体现个性化。针对这一问题提出一种基于用户历史瓦片浏览记录的兴趣点智能搜索方法。首先对智慧城市平台下的用户历史瓦片浏览记录数据进行分析,并以热力图可视化形式展现出用户关注的热点区域,得出空间热度;然后根据属性查询中加入空间热度影响因子来影响兴趣点搜索结果,使搜索结果更加符合用户搜索意图,针对热点区域给不同用户以相应服务;以滕州市兴趣点为实验数据,使用Elasticsearch构建索引数据库,采用Web前端技术搭建搜索框架,经过实验对比分析发现,该方法能够有效地提高搜索的查准率,并且可随着数据量的丰富变得更加智能化。     

一种非线性搜索的Unix目录结构与搜索算法

阐述了一种全新的Hash目录结构,并说明了对这种目录的搜索算法.同时,对现有UMX文件系统进行了简要说明.