基于旅游资源空间结构和市场通达度的旅游区划研究——以江苏沿江旅游发展为例

旅游区划是旅游资源开发的重要工作之一,在进行旅游资源普查、区划、规划之后才能合理的开发利用和保护旅游资源.其中不仅要进行一定数量的旅游资源的调查与评价,还要分析其空间结构和旅游交通网络,确定其旅游中心城市,以体现旅游过程的系统性、完整性以及旅游区的地域性等特点.在目前的旅游区划研究和工作中,对于旅游资源的调查与评价可以依据国家标准《旅游资源分类、调查与评价》,但在分析其空间结构和旅游交通网络方面,还缺少有效的定量分析方法和指标描述.本文基于国家《旅游资源分类、调查与评价》标准对江苏沿江旅游资源进行评价,并应用图论方法对旅游资源进行空间结构分析,以通达度作为描述旅游交通网络的指标,在以上定量研究和综合分析的基础上,对江苏沿江旅游区进行旅游区划研究.     

The Chromatic Uniqueness of Bipartite Graphs K （ m, n ） - A with ｜ A ｜ = 2

The chromatically uniqueness of bipartite graphs K （m, n） - A（]A] = 2） was studied. With comparing the numbers of partitions into r color classes of two chromatically equivalent graphs, one general numerical condition guaranteeing that K（ m, n） - A （ I A ] = 2） is chromatically unique were obtained. This covers and improves the former correlative results.     

Analyzing Nonstationary Random Response of a SDOF System under the Evolutionary Random Excitation by Wavelet Transform

For evolutionary random excitations, a general method of analyzing nonstationary random responses of systems was presented in this paper. Firstly, for the evolutionary random excitation model, the evolutionary power spectrum density function （EPSD） of a random excitation was given by wavelet transform. Based on the EPSD, the nonstationary responses of a SDOF system subjected to evolutionary random excitations were studied. The application and validity of presented method were illustrated by numerical examples. In numerical examples, the recently developed stochastic models for El Centro （1934） and Mexico City （1985） earthquakes which preserve the nonstationary evolutions of amplitude and frequency content of ground accelerations were used as excitations. The nonstationary random mean-square responses of a SDOF system under these two excitations were evaluated and compared with simulated results.     

一种基于导频的OFDM系统信道估计方法

提出一种使用矩形导频图案的OFDM信道估计方法。接收端首先在频率方向估计信道,然后在时间方向插值。该方法仅需累加和少量乘法运算就能估计出信道冲激响应,复杂度低,实时性高。在未编码16QAM-OFDM系统中,通过仿真将提出的方法与线性、cubic和MMSE插值法进行均方误差和误比特率的比较。结果表明该方法性能优于前两者,接近后者。     

采用小波域α稳定分布的图像去噪

基于统计模型的图像去噪的关键是统计模型的选取.α稳定分布能很好地表示具有严重拖尾的数据的统计分布.该文采用α稳定分布来对图像小波域系数进行建模,并采用贝叶斯估计来对无噪图像进行估计.通过将该算法与近来的一些方法进行比较,仿真结果表明该算法具有好的去噪效果.     

基于图像变换域的双重数字水印方法

基于变换域的双重数字水印方法,通过嵌入鲁棒水印和脆弱水印实现了图像内容版权保护和完整性认证的双重目的.其优点是利用小波变换,分块、适应性嵌入鲁棒水印,在图像的高频和低频中分别嵌入鲁棒水印,使鲁棒水印更加强壮;同时它利用离散余弦变换,在图像的高频部分嵌入脆弱水印,使脆弱水印在遭受攻击或篡改时更易被损坏.     

Identify Implicit Communities by Grap Clustering

How to find these communities is an important research work. Recently, community discovery are mainly categorized to HITS algorithm, bipartite cores algorithm and maximum flow/minimum cut framework. In this paper, we proposed a new method to extract communities. The MCL algorithm, which is short for the Markov Cluster Algorithm, a fast and scalable unsupervised cluster algorithm is used to extract communities. By putting mirror deleting procedure behind graph clustering, we decrease comparing cost considerably. After MCL and mirror deletion, we use community member select algorithm to produce the sets of community candidates. The experiment and results show the new method works effectively and properly.     

Analyzing and Designing Business Processes Management System Based on Transformation of Instantiated Ontology＇s State

The paper discusses efforts of finding a simple and transparent method to analyze business processes and developing its management system architecture. By introducing ontology and its state, the approach tried to find a unified representation and a flexible choreography of business processes. The main idea of the paper is the transformation of ontology＇s states, which are the most important scenarios of enterprises. The business activity composition, that is, case composition based on an AI technique, Case Based Reason （CBR）, which is to solve new problems by retrieving solutions to previous problems, and then store the modified solution. The main interest in CBR relies on that it allows a system to avoid past failures and exploit past successes.     

一类基于二部图的（g，f）-2-覆盖图的研究

一个图G称（g,f）-2-覆盖图，如G的任何两条边都属于它的一个（g,f）-因子．本文得到了如下结论：（i）当g≤f时一个二部图是（g,f）-2-覆盖图的一个充分必要条件；（ii）当f（x）=f（Y）时一个二部图是f-2-覆盖图的一个充分必要条件．     

二分图上有限制条件的(g,f) 因子和f 因子

设图G=(X,Y,E)是二分图, g,f是定义在V(G)上的正整值函数, 且对任意的x∈V(G)有g(x)＜f(x), 证明了: 如果图G是(mg,mf-1)-图, M是G的任一含有m条边的对集, 则存在图G的一个(g,f)-因子F, 使F包含M任意给定的一条边, 并且不包含其他的m-1条边; 二分图G是(2m-1)-边连通的(mf)-图, 则图G有一个f-因子包含任意给定的一条边, 并且不包含任意其他的m-1条边.